延迟离散Hopfield-型网络广义异步收敛性分析

给出了延迟离散Hopfield -型神经网络的收敛性定理。在广义异步运行方式下 ,证明了对称连接权阵 (只要w0 对称 )条件下的收敛性定理 ,推广了已有的延迟离散Hopfield -型神经网络的收敛性结果 ,表明网络收敛滞后于能量函数收敛最多 2n 1步。最后给出了能量函数的极大值点与延迟离散Hopfield -型神经网络的稳定态的关系。     

传递函数拟合算法及其在变压器绕组变形诊断中的应用

提出了利用网络的实测数据拟合其传递函数的实用算法。本算法是基于当某极点的实部较小时，该极点对网络传递函数的作用区域集中于其虚部附近，所以利用其虚部近的测量数据可以较准确的拟合同该极点。对拟合结果使用高斯－赛德尔型迭代法进行修正可以进一步改善所得结果。对几组变压器的实测数据所做的计算证实了所提出的算法，此外对传递函数的拟合在变压器绕组变形中的可能应用进行了探讨。     

Suan Shu Shu A Book on Numbers and Computations

In December and January of 1983–1984, archaeologists excavating the tomb of an ancient Chinese provincial bureaucrat at a Western Han Dynasty site near Zhangjiashan, in Jiangling county, Hubei Province, discovered a number of books on bamboo strips, including inter alia works on legal statutes, military practice, and medicine. Among these was a previously unknown mathematical work on some 200 bamboo strips, the Suan shu shu, or Book of Numbers and Computations. Based upon other works found in the tomb, especially a copy of the Er nian lü ling (Laws and Decrees of the Second Year (of the reign of empress Lü, i.e. Lü Hou)), archaeologists have dated the tomb to ca. 186 BCE (Lü Hou’s regency lasted from 188 to 180 BCE). The Suan shu shu, as the earliest yet discovered work devoted specifically to mathematics from ancient China, has stirred considerable interest among Chinese historians of science. The translation and commentary offered here draw extensively on the works cited in Sect. 3 below. Several appendixes devoted to specific issues related to translating the Suan shu shu, including its title and the problem of determining English equivalents for various commodities that arise in the text, may be found in Appendix II. An erratum to this article can be found at     

Quantitative Estimates of Outcrossing Rates in a Natural Population of Caldesia grandis （Alismataceae）

Outcrossing rate in a natural population of Caldesia grandis was estimated by the dominant random amplified polymorphism DNA (RAPD) marker using 10 open-pollinated progeny arrays of 24 individuals. The multilocus outcrossing rate estimated based on all 25 RAPD loci was 0.872 ±0.033 and the single-locus outcrossing rate was 0.795 ±0.032. Multilocus estimates did not differ significantly from the single-locus estimates. The fixation index, F, in the progeny estimated from RAPD data was -0.142 ±0.000. The estimates of multilocus outcrossing rates (t_m) and single-locus outcrossing rates (t_s) obtained from MLDT clearly indicate that outcrossing is predominant in the open-pollinated C. grandis population. An empirical analysis suggests that 15 should be the minimum number of dominant marker loci necessary to achieve robust estimates of t_m.     

Participatory Sustainability Impact Assessment: Scientific Policy Advice as a Social Learning Process

This paper deals with the development of scientific policy advice by providing a methodology to foster a social learning process. The methodology, called participatory Sustainability Impact Assessment (pSIA), aims to structure complex problem situations, to clarify interests and basic assumptions, to interpret scientific studies, to develop impact assessment, and to explore sensitivity of uncertainty and lack of information. In pSIA workshops the participants are supposed to build conceptual models with different modelling methods, like System Dynamics, Value Chain Analysis, and Morphological Analysis. A case study is presented that describes a workshop series with political as well as academic actors, applying the pSIA approach to an impact assessment of Economic Partnership Agreements between the European Union and the Eastern and Southern Africa Region.

A PLL Clock Frequency Multiplier Using Dynamic Current Matching Adaptive Charge-Pump and VCO Frequency Reuse

A 3.5 times PLL clock frequency multiplier for low voltage different signal （LVDS） driver is presented. A novel adaptive charge pump can automatically switch the loop bandwidth and a voltage-controlled oscillator （VCO） is designed with the aid of frequency ranges reuse technology. The circuit is implemented using 1st Silicon 0.25 μm mixed-signal complementary metal-oxide-semiconductor （CMOS） process. Simulation results show that the PLL clock frequency multiplier has very low phase noise and very short capture time .     

AN IMPROVED BRANCH-AND-BOUND ALGORITHM TO MINIMIZE THE WEIGHTED FLOWTIME ON IDENTICAL PARALLEL MACHINES WITH FAMILY SETUP TIMES

This article investigates identical parallel machines scheduling with family setup times. The objective function being the weighted sum of completion times, the problem is known to be strongly NP-hard. We propose a constructive heuristic algorithm and three complementary lower bounds. Two of these bounds proceed by elimination of setup times or by distributing each of them to jobs of the corresponding family, while the third one is based on a lagrangian relaxation. The bounds and the heuristic are incorporated into a branch-and-bound algorithm. Experimental results obtained outperform those of the methods presented in previous works, in term of size of solved problems.     

A FRAMEWORK FOR REAL-VALUED CIPHER SYSTEMS

Most cipher systems designed thus far are binary-valued or integer-valued cipher systems. Their security relies on the assumption that one-way functions exist. Though the existence of one-way functions has not been proved yet, most cryptographic researchers believe that one-way functions exist. In addition, many candidates for one-way functions have been proposed. Therefore, the key step for developing real-valued cipher systems is to define real one-way functions and to propose candidates for them. In this paper, based on computational complexity theory over the real field, we give two definitions of real one-way functions; one is for digital one-way functions and the other is for general one-way functions. Candidates for these two classes of one-way functions are also proposed. Moreover, we present two examples to demonstrate that the candidates for both digital one-way functions and general one-way functions can be applied to construct secure real-valued cipher systems.     

城市规划的Pascal分形模型

Ｐａｓｃａｌ分形是分形理论中的重要内容，主要用于研究自相似结构的问题。     

关于Mackey序列式回缩性

设(E,t)是局部凸空间诱导序列(E_n,t_n)_n∈N的诱导极限.则(E,t)=ind(E_n,t_n)为正则当且仅当对于(E,t)中每个Mackey收敛于o的序列(x_k)存在自然数n=n(x_k),使(x_k)含于且有界于(E_n,t_n).由此可获得关于正则性的一系列等价刻划.