A Neural Network Approach for Signal Detection in Digital Communications

In this paper, we propose a new approach for signal detection in wireless digital communications based on the neural network with transient chaos and time-varying gain (NNTCTG), and give a concrete model of the signal detector after appropriate transformations and mappings. It is well known that the problem of the maximum likelihood signal detection can be described as a complex optimization problem that has so many local optima that conventional Hopfield-type neural networks fail to solve. By refraining from the serious local optima problem of Hopfield-type neural networks, the NNTCTG makes use of the time-varying parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks only with point attractors, so that it can be expected to have much ability to search for globally optimal or near-optimal solutions. After going through a transiently inverse-bifurcation process, the NNTCTG can approach the global optimum or the neighborhood of global optimum of our problem. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for the signal detection in digital communications.     

BIDPS^＊：基本的循环加深周边搜索算法

ＢＩＤＰＳ＾＊是一种把ＩＤＡ算法和ＰＳ法相结合而产生的人工智能搜索算法。该文研究了不考虑启发式计算最小化技术的搜索效率问题，提出了一些新的算法效率的度量，用８数码难题检验了ＢＩＤＰＳ算法并与ＩＤＡ算法进行了比较分析，实验结果表明尽管ＢＩＤＰＳ启发式计算量较大，但较ＩＤＡ算法在效率上还有所提高的。     

一种自动布线方法：多级线探索法

本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念，通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法，但有较传统线探索法更强的探索能力，不需要结合李氏算法而能单独完成布线任务，是一种较理想的算法，通过实验获得了较为满意的效果。     

网络行为建模环境的实现及网络混沌性状分析

设计并实现了一种用于网络行为研究的网络行为建模环境，将网络环境的监测功能和网络行为的分析功能相互结合，为网络系统行为的研究奠定了基础。在这一环境下，归纳了四种有普遍意义的网络突发流量模型，并用混沌分形理论中的迭代函数系统和相空间重构方法对它们进行描述、分析、计算和重构，得到了它们的分形维以及能体现网络流量行为特性的宏观参数。     

Scheduling railway traffic at a construction site

We consider the problem of rescheduling trains in the case where one track of a railway section consisting of two tracks in opposing directions is closed due to construction activities. After presenting an appropriate model for this situation we derive a polynomial algorithm for the subproblem of finding an optimal schedule with minimal latenesss if the subsequences of trains for both directions outside the construction site are fixed. Based on this algorithm we propose a local search procedure for the general problem of finding good schedules and report test results for some real world instances. Received: December 8, 1999 / Accepted: May 2, 2001     

中国学术期刊网燕化镜像站点建设

通过中国学术期刊网燕化镜像站点的建设，介绍了燕山石化镜像站点的配置及主要管理功能和对全文数据库的检索，浏览功能，同时介绍了新形势下，信息化建设的新观念，新思路，以及强化信息意识，加强信息服务产业化发展的重要性和迫切性。     

舰船水声隐身技术(二)

本文探讨了水声隐身性能对舰船战技术性能的影响 ,舰船水噪声的主要噪声源、水噪声的治理措施及其展望。     

基于混沌电路的一种混合噪声调制雷达引信

提出了一种基于混沌电路的随机脉位调制（RPPM）和随机二相码调相（RBCPM）混合调制的雷达引信系统。介绍了该引信波形的数学模型，平均模型函数及引信的实现框图和工作原理，研究了基于混沌电路的混合调制信号的产生方法，这种引信波形不仅具有结构简单和易于处理等特点，而且具有良好的测距和测速性能，以及极低的截获概率和很强的抗干扰特性。     

The GENIUS-test-facility—first results on background from Rn daughters

GENIUS-TF (Nucl. Instr. and Meth. A 511 (2003) 341; Nucl. Instr. and Meth. A 481 (2002) 149.) is a test-facility for the GENIUS project (GENIUS-Proposal, 20 November 1997; Z. Phys. A 359 (1997) 351; CERN Courier, November 1997, 16; J. Phys. G 24 (1998) 483; Z. Phys. A 359 (1997) 361; in: H.V. Klapdor-Kleingrothaus, H. Pas. (Eds.), First International Conference on Particle Physics Beyond the Standard Model, Castle Ringberg, Germany, 8–14 June 1997, IOP Bristol (1998) 485 and in Int. J. Mod. Phys. A 13 (1998) 3953; in: H.V. Klapdor-Kleingrothaus, I.V. Krivosheina (Eds.), Proceedings of the Second International Conference on Particle Physics Beyond the Standard Model BEYOND’ 99, Castle Ringberg, Germany 6–12 June 1999, IOP Bristol (2000) 915), a proposed large scale underground observatory for rare events which is based on operation of naked germanium detectors in liquid nitrogen for an extreme background reduction. Operation of naked Ge crystals in liquid nitrogen has been applied routinely already for more than 20 years by the CANBERRA Company for technical functions tests (CANBERRA Company, private communication, 5 March 2004.), but it never had found entrance into basic research. Only in 1997 first tests of application of this method for nuclear spectroscopy have been performed, successfully, in Heidelberg (Klapdor-Kleingrothaus et al., 1997, 1998; J. Hellmig and H.V. Klapdor-Kleingrothaus, 1997).

On May 5, 2003 the first four naked high-purity germanium detectors (total mass 10.52 kg) were installed in liquid nitrogen in the GENIUS Test Facility at the Gran Sasso underground laboratory. Since then the experiment has been running continuously, testing for the first time the novel technique in an underground laboratory and for a long-lasting period.

In this work, we present the first analysis of the GENIUS-TF background after the completion of the external shielding, which took place in December 2003. We focus especially on the background coming from ²²²Rn daughters. This is found to be at present by a factor of 200 higher than expected from simulation. It is still compatible with the scientific goal of GENIUS-TF, namely to search for cold dark matter by the modulation signal, but on the present level would cause serious problems for a full GENIUS—like experiment using liquid nitrogen.     

Optimization by random search with jumps

We give a random optimization (RO) algorithm to optimize a real‐valued function of n real variables. During the optimization process, interpolation points are examined to follow valleys, and jumps to new starting points are executed to avoid numerous iterations in local minima. Convergence with probability one to the global minimum of a function is proved. The proposed RO method is a simple, derivative‐free and computationally moderate algorithm, with excellent performance compared to other RO methods. Seven functions, which are commonly used to test the performance of optimization methods, are used to evaluate the performance of the RO algorithm given here. Copyright © 2004 John Wiley & Sons, Ltd.