一种基于信息推送的搜索引擎模型

随着信息时代的来临,海量信息不断地涌入因特网,人们想要获得自己所需要的信息,越来越离不开搜索引擎。但目前的搜索引擎往往无法满足人们搜索信息的根本要求,常常有人抱怨,我所搜索的信息都是我不需要的。针对现有搜索引擎的不足,把信息推送技术引入到搜索引擎中,建立了一种基于信息推送的搜索引擎模型,解决了现有搜索引擎在搜索过程中存在的资源迷向问题,真正实现了信息找人的搜索方式。     

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

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

Inter-antenna and subblock shifting and inversion for peak-to-average power ratio reduction in MIMO-OFDM systems

In this article, an inter-antenna inter-subblock shifting and inversion (IASSI) scheme is proposed to reduce the peak-to-average power ratio (PAPR) in multi-input multi- output orthogonal frequency division multiplexing (MIMO- OFDM) systems. It exploits multiple antennas and subblocks to provide additional degrees of freedom to benefit the system. To reduce the implementation complexity of the proposed scheme, two simple suboptimal schemes are further presented based on the minimum current maximum criterion; one adopts sequential search and the other employs random binary grouping. The simulation results exhibit the effectiveness of these proposed schemes.     

一种K值自适应和局部搜索的KNN矩阵修复方法

数据在采集和传输过程中由于多种原因会造成矩阵残缺,因此在数据分析之前需要对残缺矩阵进行修复。常见的KNN修复方法 k值选取不合理,且需在整个矩阵中搜索近邻,影响算法的修复效果。在其基础上提出了一种k值自适应的局部KNN矩阵修复方法,合理考虑了k值的选取和近邻项的搜索范围。实验证明了该方法能有效提高矩阵修复的正确率,且算法的时效性有所提高。     

The rollon–rolloff waste collection vehicle routing problem with time windows

This study introduces a rollon–rolloff waste collection vehicle routing problem involving large containers that accumulate huge amounts of garbage at construction sites and shopping districts. In this problem, tractors move one container at a time between customer locations, a depot, disposal facilities, and container storage yards. The complicated constraints discussed in this study arise from having multiple disposal facilities, multiple container storage yards, seven service types of customer demands, different time windows for customer demands and facilities, various types and sizes of containers, and the lunch break of tractor drivers. In addition, real-world issues, such as changing service types, multiple demands at a customer’s location, and tractors with different work schedules, are dealt with. This study proposes a large neighborhood search based iterative heuristic approach consisting of several algorithms for the problem. The effectiveness of the proposed methods is demonstrated by computational experiments using benchmark data, some instances of which are derived from real-world problems.     

Parameter-setting-free harmony search algorithm

Various phenomenon-mimicking algorithms, such as genetic algorithm, simulated annealing, tabu search, ant colony optimization, and particle swarm optimization, have their own algorithm parameters. These parameters need to be skillfully assigned in order to obtain good results. It is burdensome, especially to novice users, to assign these parameters. The same is true for the harmony search algorithm which was inspired by music performance. Thus, this study proposes a novel technique to eliminate tedious and experience-requiring parameter assigning efforts. The new parameter-setting-free (PSF) technique which this study suggests contains one additional matrix which contains an operation type (random selection, memory consideration, or pitch adjustment) for every variable in harmony memory. Three examples illustrate that the PSF technique can find good solutions robustly.     

Schemata, Distributions and Graphical Models in Evolutionary Optimization

In this paper the optimization of additively decomposed discrete functions is investigated. For these functions genetic algorithms have exhibited a poor performance. First the schema theory of genetic algorithms is reformulated in probability theory terms. A schema defines the structure of a marginal distribution. Then the conceptual algorithm BEDA is introduced. BEDA uses a Boltzmann distribution to generate search points. From BEDA a new algorithm, FDA, is derived. FDA uses a factorization of the distribution. The factorization captures the structure of the given function. The factorization problem is closely connected to the theory of conditional independence graphs. For the test functions considered, the performance of FDA—in number of generations till convergence—is similar to that of a genetic algorithm for the OneMax function. This result is theoretically explained.     

A memetic algorithm for multi-objective dynamic location problems

This paper describes a new multiobjective interactive memetic algorithm applied to dynamic location problems. The memetic algorithm integrates genetic procedures and local search. It is able to solve capacitated and uncapacitated multi-objective single or multi-level dynamic location problems. These problems are characterized by explicitly considering the possibility of a facility being open, closed and reopen more than once during the planning horizon. It is possible to distinguish the opening and reopening periods, assigning them different coefficient values in the objective functions. The algorithm is part of an interactive procedure that asks the decision maker to define interesting search areas by establishing limits to the objective function values or by indicating reference points. The procedure will be applied to some illustrative location problems.     

Multi-step nonlinear conjugate gradient methods for unconstrained minimization

Conjugate gradient methods are appealing for large scale nonlinear optimization problems, because they avoid the storage of matrices. Recently, seeking fast convergence of these methods, Dai and Liao (Appl. Math. Optim. 43:87–101, 2001) proposed a conjugate gradient method based on the secant condition of quasi-Newton methods, and later Yabe and Takano (Comput. Optim. Appl. 28:203–225, 2004) proposed another conjugate gradient method based on the modified secant condition. In this paper, we make use of a multi-step secant condition given by Ford and Moghrabi (Optim. Methods Softw. 2:357–370, 1993; J. Comput. Appl. Math. 50:305–323, 1994) and propose two new conjugate gradient methods based on this condition. The methods are shown to be globally convergent under certain assumptions. Numerical results are reported.