基于主成分分析的网络搜索数据合成方法研究

针对利用网络搜索数据合成各类指数时难以消除共线性、难以合理确定各指标权重等问题,基于数据降维的思想构建了以主成分分析法为核心的指数合成方法,并以利用网络搜索数据合成消费者物价指数为例,将提出的方法与当前主流的逐步回归法做出比较研究.研究结果表明,基于主成分分析法的数据合成方法可以得到稳定性和拟合度更高的指数.     

Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

In this paper we present a primal-dual inexact infeasible interior-point algorithm for semidefinite programming problems (SDP). This algorithm allows the use of search directions that are calculated from the defining linear system with only moderate accuracy, and does not require feasibility to be maintained even if the initial iterate happened to be a feasible solution of the problem. Under a mild assumption on the inexactness, we show that the algorithm can find an -approximate solution of an SDP in O(n²ln(1/)) iterations. This bound of our algorithm is the same as that of the exact infeasible interior point algorithms proposed by Y. Zhang.Research supported in part by the Singapore-MIT alliance, and NUS Academic Research Grant R-146-000-032-112.Mathematics Subject Classification (1991): 90C05, 90C30, 65K05     

LINEAR SEARCH FOR A BROWNIAN TARGET MOTION

A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point.The object is to detect the target. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite,and to show the existence of a search plan which made this expected value minimum.     

基于拟熵自适应启动局部搜索策略的混合粒子群算法

在继承综合学习粒子群算法（Comprehensive Learning Particle Swarm Optimizer,CLPSO）全局探索优势的基础上,引入具有高效收敛性能的传统局部搜索（Orthodox Local Search,OLS）方法,提出了基于拟熵自适应启动局部搜索策略的混合粒子群算法（Hybrid Particle Swarm Optimization algorithm with Adaptive starting strategy of Local Search based on Quasi-Entropy,ALSQE-HPSO）.采用拟熵指标解决何时启动OLS这一关键问题.对8个标准函数的10维和20维问题的测试结果,表明了ALSQE-HPSO算法的性能优势.本文提出的算法也与包含两种基于CLPSO的改进算法和一种带OLS的粒子群算法在内的其他6种改进粒子群算法进行了对比,实验结果表明ALSQE-HPSO算法的性能优于对比算法.     

Tabu search for graph partitioning

In this paper, we develop a tabu search procedure for solving the uniform graph partitioning problem. Tabu search, an abstract heuristic search method, has been shown to have promise in solving several NP-hard problems, such as job shop and flow shop scheduling, vehicle routing, quadratic assignment, and maximum satisfiability. We compare tabu search to other heuristic procedures for graph partitioning, and demonstrate that tabu search is superior to other solution approaches for the uniform graph partitioning problem both with respect to solution quality and computational requirements.     

Conjugate Gradient Methods with Armijo-type Line Searches

Abstract Two Armijo-type line searches are proposed in this paper for nonlinear conjugate gradient methods.Under these line searches, global convergence results are established for several famous conjugate gradientmethods, including the Fletcher-Reeves method, the Polak-Ribiere-Polyak method, and the conjugate descentmethod.     

一种快速目标检测跟踪方法研究与实现

阐述目标检测跟踪详细过程,提出一种近距离复杂背景下使用快速模板匹配方法对运动目标检测跟踪的方法。该方法针对目标的环境,利用高斯-拉普拉斯滤波器预处理,进而对相邻图像的差分图像获取和识别运动目标中心和区域大小,然后利用相关匹配算法并结合改进的十字搜索法对目标进行快速持续的检测跟踪。实验表明该方法是有效的。     

高速移动CDMA网络搜索窗优化

通过对码分多址(CDMA,Code Division Multiple Access)高速移动网络搜索窗进行研究,结合CDMA高速移动网络现状及特点,提出基于环路时延(RTD,Round Trip Delay)的CDMA高速移动网络的搜索窗优化方法。通过对操作维护后台统计的小区RTD分析,通过RTD并结合CDMA搜索窗设置要求进行搜索窗优化,能够减少高速移动网络搜索时延,进而提高高速移动网络的切换成功率,提升高速移动用户的使用感知。     

现代通信技术在海上搜救中的应用

海上搜救是确保船舶航行安全与生命救助的重要手段,也是海洋国际公约的要求,而及时报警和可靠通信则是海上搜救的关键。以国际海上人命安全公约（SOLAS）为依据,结合全球海上遇险与安全系统（GMDSS）的组成、功能和技术现状,全面系统地介绍甚高频、中/高频、卫星以及雷达等现代通信与信息技术在海上救援中的应用范围、主要功能、设备要求和技术特点。目的是将陆地上已经应用成熟的通信技术向海上推广的同时,进一步研究与开发适合海上应用的现代通信和信息技术。