椭圆强非局域空间光孤子

对傍轴椭圆高斯光束在具有椭圆对称响应特性的强非局域非线性介质中的演化规律进行研究，得到了光束各参量演化的精确解析解，分析了单向空间光孤子和强非局域椭圆空间光孤子的形成条件，发现了椭圆光孤子的相移与介质响应函数的椭圆率有关. 关键词： 椭圆对称强非局域响应介质 椭圆强非局域空间光孤子 相移     

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.     

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     

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

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

A data model for regions with indeterminate boundaries

Most of spatial phenomena like natural vegetation units and land use areas constantly change over time and have uncertainty spatial extents. Till now, a considerable number of data models have been proposed for spatial objects with sharp boundaries as well as with indeterminate boundaries. However, they mainly concern space and time or space and fuzziness and not yet integrate them into a single unified framework. This paper introduces a formal definition of the conceptual fuzzy spatiotemporal data model, called FSTDM for fuzzy regions based on fuzzy set theory. We also contribute a method of manipulating queries with the presence of both temporal predicate and fuzzy spatial predicate in the condition clause efficiently. We then implement a prototype system.Through the experimental results, we prove that our work can be used to build a specialized system such as GIS, spatial database, and so on.     

Asymptotic Methods Applied to Contact Problems

Asymptotic methods for contact problems are expounded. Some typical integral equations are considered     

背景光光伏效应对屏蔽-光伏空间孤子的影响

在光伏晶体两端外加一恒定的直流偏压，背景光的光伏效应对形成屏蔽-光伏孤子的空间电荷场没有影响，但对晶体中的电流有影响.如果外电源的电动势是恒定的，则背景光的光伏效应与外电路的电阻协同起作用，可以通过晶体两端的电压降影响晶体中的空间电荷场，进而影响空间孤子的宽度.在一定的条件下甚至可以实现亮、暗孤子的转换. 关键词： 屏蔽-光伏 空间孤子 孤子宽度 亮暗孤子转换     

Quantum information processing in optical images

Optical images can be used to transport, store and process information in a parallel way. We discuss different results obtained in the domain of ‘quantum imaging’, aiming at exploiting at the same time the quantum properties of optical images and their intrinsic parallelism. We define the notion of standard quantum limit (SQL) in optical resolution, set by the quantum noise of usual coherent light, and show that it can be much lower than the diffraction limit. We also prove that this limit can be circumvented by especially designed nonclassical and multimode light. We present an experiment showing that OPOs oscillating inside an exactly confocal cavity actually produce such transverse multimode nonclassical light. We finally describe another experiment which has surpassed the SQL in the case of beam positioning, both in the 1D and 2D cases.     

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

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

基于GIS空间分析的北京城市空间发展

根据城市空间相互作用理论和城市综合引力模型 ,以北京市空间发展为例 ,探讨了应用地理信息系统 (GIS)研究城市空间发展的方法流程。在 CIS支持下 ,建立了空间数据库和属性数据库 ,并运用 GIS的多种空间分析功能 ,通过发展背景分析、发展轴线确定、引力参数定义、城市距离确定、质量数据处理等具体过程 ,综合计算了北京市的空间发展潜力。结果表明 ,北京市未来的空间发展首先应该面向廊坊市、天津市、黄骅市的东南方向发展