采用目标假设的三被动式传感器数据关联算法

被动式传感器目标跟踪是多传感器多目标跟踪领域的一个重要研究方向。针对三被动式传感器多目标定位系统全局最优数据关联的三维分配问题，在允许传感器漏检和虚警的情况下，通过分析拉格朗日松弛算法，提出一种假定真实目标的快速收敛算法。该算法通过粗关联假定真实目标并重新修改代价矩阵，然后进行细关联，使得拉格朗日松弛算法在保证关联精度的前提下有效地提高了收敛速度。理论分析和实验结果表明，该算法提高了数据关联的速度,并在一定程度上提高了关联准确率。     

无穷范数松弛的低复杂度超奈奎斯特检测

超奈奎斯特(Faster-than-Nyquist,FTN)速率传输可以有效提高频谱效率，但这种非正交传输方式引入的严重码间串扰相应提高了接收端的处理难度。针对该问题，设计了一种基于循环成块传输的低复杂度检测算法。最优检测被建模为无约束的二元二次规划(Boolean Quadratic Program,BQP)问题，为了求解该NP-hard问题，采用无穷范数约束松弛原问题的非凸可行解集，并基于次梯度下降法提出松弛问题的有效优化算法。数值仿真结果表明，所提算法在误比特率(Bit Error Rate,BER)性能上优于频域均衡，且在可接受的性能损失范围内算法执行效率远高于理论最优的最大似然序列估计(Maximum Likelihood Sequence Estimation,MLSE)。     

A profit-maximization location-capacity model for designing a service system with risk of service interruptions

This paper considers the design of an immobile service system in which each facility’s service process is subject to the risk of interruptions. The location-capacity decisions and allocations are simultaneously made to maximize the difference between the service provider’s profit and the sum of customers’ transportation and waiting costs. An efficient Lagrangian-based solution algorithm is developed, which solves large-sized instances with up to 50 service facilities and 500 customers in a few seconds. Several sensitivity analyses and managerial insights are presented. The model is also applied to a case study on a logistics network design problem in the zinc mining industry.     

一种改进的松弛迭代图像配准算法

本文展示了一种改进的松弛迭代图像配准算法,此算法首先使用归一化自相关运算求得图像的粗匹配对,接着使用改进的松弛迭代匹配算法进行精匹配。本文通过优化筛选第一轮迭代结果,使得后续迭代时间明显减少。实验证明此算法效率比原始算法有了很大的提高。     

Hub location problems in transportation networks

In this paper we propose a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design. This formulation is very tight and most of the tractable instances for MIP solvers are optimally solvable at the root node. While the existing state-of-the-art MIP solvers fail to solve even small size instances of problem, our accelerated and efficient primal (Benders) decomposition solves larger ones. In addition, a very efficient greedy heuristic, proven to be capable of obtaining high quality solutions, is proposed. We also introduce fixed cost values for Australian Post (AP) dataset.     

考后放松游市场特征分析及开发探讨

近年来，伴随旅游业的蓬勃发展，考后放松游逐渐兴起并日益升温。潜力巨大，收益率颇高。研究发现：考后放松游出游时间长且相对集中；考后放松游游客消费能力较强；出游形式多样，港澳地区成为考后放松游游客最理想的旅游目的地；考后放松游游客对滨海旅游线路和名校参观体验游表现出明显的偏好。针对考后放松游以上特点，进行定量分析。得出考后放松游市场人均消费总额的构成因素，旨在揭示其规律，为今后相关研究打下基础并提供依据。     

A Brief Survey of Modern Optimization for Statisticians

Modern computational statistics is turning more and more to high‐dimensional optimization to handle the deluge of big data. Once a model is formulated, its parameters can be estimated by optimization. Because model parsimony is important, models routinely include non‐differentiable penalty terms such as the lasso. This sober reality complicates minimization and maximization. Our broad survey stresses a few important principles in algorithm design. Rather than view these principles in isolation, it is more productive to mix and match them. A few well‐chosen examples illustrate this point. Algorithm derivation is also emphasized, and theory is downplayed, particularly the abstractions of the convex calculus. Thus, our survey should be useful and accessible to a broad audience.     

说话状态在歌唱训练中的应用

说话的声音和歌唱的声音都是由同一个结构、同样的发声器官产生的。呼吸器官、喉头、声带、共鸣器官以及咬字吐字器官是说话与歌唱发声所必须的物质基础与条件，只是两者对这些器官的运用程度不一样。说话发音是歌唱的基础，歌唱发音是说话的技术系统化和艺术化。歌唱发音与说话发音有着不可分割的联系，将说话发音的自然、放松，以及语言表述感迁移到歌唱训练中，用怎样“说”来启发怎样“唱”，对声乐学习有重要意义。     

探讨服装胸围放松量

比例裁剪法中很多产品规格主要是通过胸围按照一定比例推算而来,由于季节不同穿着层次的变化,胸围的放松量,直接影响服装结构的合理性。通过分析空隙量,使设计师更好地把握放松量的取值。     

The strategic berth template problem

A marine container terminal operator may have a situation with excessive calling requests to be served especially when some new service contracts are under consideration. For this situation, we propose a strategic berth template problem (BTPS) that selects the ships among the requesting ones to be served and arrange their berth-windows within a limited planning horizon. The BTPS employs the subgradient optimization procedure, which is an improved version of the procedure that the authors developed for the operational berth allocation problem. A wide variety of numerical experiments indicate the improved subgradient procedure works well for the BTPS.