Time-Reversed Dynamical Entropy and Irreversibility in Markovian Random Processes

A concept of time-reversed entropy per unit time is introduced in analogy with the entropy per unit time by Shannon, Kolmogorov, and Sinai. This time-reversed entropy per unit time characterizes the dynamical randomness of a stochastic process backward in time, while the standard entropy per unit time characterizes the dynamical randomness forward in time. The difference between the time-reversed and standard entropies per unit time is shown to give the entropy production of Markovian processes in nonequilibrium steady states.     

基于人工神经网络的商业银行信用风险模型

在对人工神经网络的基本原理进行简要介绍的基础上 ,着重对构建商业银行信用风险的人工神经网络模型进行了研究 ,实证结果表明 ,人工神经网模型具有很高的预测精度     

First measurement of the helicity-dependent γ p?pη differential cross-section

The helicity dependence of the γ p↦pη reaction has been measured for the first time at a center-of-mass angle θ^* _η = 70^° in the photon energy range from 780 MeV to 790 MeV. The experiment, performed at the Mainz microtron MAMI, used a 4π-detector system, a circularly polarized, tagged photon beam, and a longitudinally polarized frozen-spin target. The helicity 3/2 cross-section is found to be small and the results for helicity 1/2 agree with predictions from the MAID analysis. Received: 19 December 2002 / Accepted: 10 March 2003 / Published online: 20 May 2003     

Entropy production per site in (nonreversible) spin-flip processes

Entropy production per site in a (nonreversible) spin-flip process is studied. We give it a useful expression, from which a property stronger than affinity of the entropy production per site follows. Furthermore, quasi-invariance of nonequilibrium measures in the spin-flip processes is discussed via entropy production.     

资源有限网络计划的PRWI启发式优化方法

本文在综合考虑了有资源约束的网络计划结构特征、资源强度、时间约束等方面因素的基础上，提出了一种新的资源优化的启发式优化方法—ＰＲＷＩ方法，并通过分析证明了该方法处理问题的效果较现有的其它方法好。     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

用于光学神经网络硬件系统误差纠正的虚拟神经网络

提出了一种用于修正光学神经网络硬件系统误差的虚拟神经网络模型，光学实验结果表明该网络能够有效地消除硬件系统误差对实验结果的影响。     

IPv4/IPv6翻译网关的研究

In this paper, a model of translation gateway is proposed. The communications between IPv4 network and IPv6 network are realized by using the Microsoft intermediate driver technology in environment of Windows 2000.     

Isospin symmetry violation, meson production and η-nucleus interaction studies

We have studied isospin symmetry violation in nuclear reactions by measuring simultaneously the cross-section of the following two reactionsp +d →³H π⁺ andp +d →³He π⁰. The experiment was perfomed at the cooler synchrotron accelerator COSY, Jülich at several beam energies close to the correspondingη production threshold. We also have ongoing programmes onη-nucleus final-state interaction studies viap+⁶ Li →⁷ Be +η reactions, high resolution search for dibaryonic resonances and lambda-proton final state interaction studies. The experimental details and results obtained so far are presented here     

Remarks on beyond leading order

In recent years a two-scale expansion was established to study reactions of the type NN→NNπ within chiral perturbation theory. Then the diagrams of some subclasses that are invariant under the choice of the pion field no longer appear at the same chiral order. In this Letter we show that the proposed expansion still leads to well defined results. We also discuss the appropriate choice of the heavy baryon propagator.