Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.     

基于MPEG-4的视频流式传输系统及动态带宽分配方法

提出了一个基于MPEG 4精细可分级编码技术的视频流式传输系统。介绍了系统中主要模块的作用,并重点研究了速率控制模块。速率控制模块采用了适合视频流式传输的动态带宽分配方法。它可以根据实时的网络通道波动状况来动态调整滑动参数,以适应网络波动和高效地利用网络的有限资源。实验结果表明,动态带宽分配方法在动态带宽波动条件下不仅可以使相邻帧间的视频质量更加平滑,而且可以大大提高解码视频图像的总体质量,也就是说可同时改善解码视频的主客观性能。     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

互补型自适应滤波器在心磁信号处理中的应用

将心磁信号从干扰噪声中加以提取并有效地消除噪声干扰是心磁信号处理中尤为重要的环节 .从改进算法的角度出发，提出互补型自适应滤波器结构以实现心磁信号的消噪处理.该滤波器针对心磁这类非平稳信号进行设计，有效地解决了常规自适应滤波器应用于心磁信号处理时收敛速度和稳态误差的矛盾.通过仿真实验和心磁实验结果表明，该算法能有效地消除心磁信号的背景噪声和工频干扰噪声.同时该算法也可用于其他非平稳信号的消噪处理. 关键词： 自适应滤波 心磁图 最小均方误差     

Balanced contributions for TU games with awards and applications

Calleja et al. [Calleja, P., Borm, P., Hendrickx, R., 2005. Multi-issue allocation situations. European Journal of Operational Research 164, 730–747] introduced multi-issue allocation situations with awards. In this paper, we extend the classical model of cooperative games with transferable utility to the cooperative games with transferable utility and awards. We define a run-to-the-bank rule for cooperative games with transferable utility and awards and characterise it in terms of a property of balanced contributions. We apply our main result to bankruptcy problems and multi-issue allocation situations with awards.     

神经网络自适应滤波器在故障诊断中的应用

分析了用自适应滤波器进行故障诊断的方法．针对该方法在计算上要花费大量时间、难于完成实时诊断任务的缺点，提出了用神经网络自适应滤波器来完成故障诊断的方法．神经网络有极快的运行速度，能很好地完成实时诊断任务．     

电子直线加速器磁控管频率稳定的自适应线性神经元方法

 电子直线加速器电子束能量的稳定与否取决于功率源工作频率的稳定性,磁控管在短时间内的散谱和轻微跳谱造成稳频系统的控制精度下降,最后电子束的扫描均匀度下降。引入自适应线性神经元方法(ADALINE)和噪声对消技术以消除对工作频率长期稳定性的影响,从而保证了电子束的扫描均匀度。     

A perturbation-based heuristic for the capacitated multisource Weber problem

This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. This procedure is based on an effective use of borderline customers. Several implementations are considered and the two most appropriate are then computationally enhanced by using a reduced neighbourhood when solving the transportation problem. Computational results are presented using data sets from the literature, originally used for the uncapacitated case, with encouraging results.     

一类混沌系统的自适应模糊控制器设计

通过混沌系统的形式的抽象，提出了一种间接自适应模糊控制方法来控制一类具有未知非线性函数的混沌系统跟踪一参考轨迹．     

Estimating market shares in each market segment using the information entropy concept

Sales data of a certain product for the various competitors are usually available at the aggregate level. However these data give no clue to the heterogeneities in the sales pattern across different market segments. Heterogeneities are caused by different purchasing behavior in each market segment; as a purchaser in a segment will be attracted to the attributes of the product most important to that segment. This concept can be formalized via a simple attraction model that utilizes an elasticity measure for each quality or price attribute [G.S. Carpenter, L.G. Cooper, D.M. Hanssens, D.F. Midgley, Modeling asymmetric competition, Marketing Science 7 (4) (1998) 393–412]. Assessment of these elasticities is not difficult since customer response – in each market segment – to perception of quality and price is tracked by most firms [J. Ross, D. Georgoff, A survey of productive and quality issues in manufacturing. The state of the industry, Industrial Management 3 (5) (1991) 22–25]. This paper attempts to formulate a generic framework based on the information entropy concept that utilizes such an attraction model to estimate competitors’ sales in each market segment.