BP人工神经网络用于除草剂活性预测

采用AMI方法研究了10种新型的磺酰脲类除草剂的电子结构，并以原子的Mulliken净电荷和除草剂在不同浓度(100，10mg／L)下对油菜、稗草两种作物的根、茎部位的抑制率为训练样本集。构造并训练得到具有活性预测能力的BP神经网络．结果表明，该BP网络不仅能对训练样本很好拟合。亦能对未知化合物的活性作出很好的预测．     

全光网中基于FBG的OADM设计研究

提出一种全新的OADM(Optical Add—Drop Multiplexers)结构设计，此结构仅采用一个多端口环行器，大大减少了环行器的数量，节约了成本。若要上／下路一个波长．则只需要一个FBG(Fiber Bragg Grating)；若要同时上／下路多个波长，则需要2m个FBG。计算机仿真实验证明此结构比H．Yuan提出的结构具有更低的损耗．对全光网络的实现具有重大的意义。     

网络图在产品配送中的应用

面对多样化的市场需求，企业的销售渠道也变得异常复杂，利用网络图可以简化实际问题，并能形象地描述它。本根据网络知识建立了产品分销模型，探求企业在市场需求固定和随机时的最优收益。最后，章还进行实例验算，并做出相应的结果分析。     

Minkowski-type and Alexandrov-Type Theorems for Polyhedral Herissons

Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image.     

当前我国FTTH建设中的几点考虑

分析了推动我国FTTH的主要动力及相关演进策略；在分析和比较FTTH不同技术体系优缺点的基础上，对我国FTTH的发展前景提出了看法。     

光学系统光阑应用的实例

介绍了一种光学组合系统，通过构造光学系统虚拟的视场光阑实现人眼屈光度测量，它是光学系统光阑应用的生动实例.     

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

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

基于免疫算法的Hopfield神经网络多用户检测器

提出的基于免疫算法的Hopfield神经网络多用户检测器，将扰乱的Hopfield神经网络多用户检测器的输出作为免疫算法的初始种群，利用了免疫算法的全局收敛的特点，从而克服了Hopfield易收敛到局部能量最小点的缺点。理论分析和仿真结果表明：该检测器具有良好的抗多址干扰和抗远近效应的能力。     

Modeling and performance analysis of IP access interface in optical transmission networks with packet switching

The article analyzes the influence of the Internet Protocol (IP) access interface on the packet loss probability and delay times in the optical packet switched network. The network and node model have been proposed, and the structure of the IP access interface, including assembler and holder, have been included in the analysis. It has been shown that the increase of the maximum optical packet sizes, as well as use of the holding feature as contention resolution mechanism, decrease the packet loss probability, but introduce delays at the optical network access points. Modeling and analysis were based on the discrete event simulation assuming self-similar traffic sources. IP packet lengths were modeled using empirical data. This work has been conducted while the author was affiliated with the Telecommunication Laboratory, Swiss Federal Institute of Technology (EPFL-STI-ITOP-TCOM), Lausanne, Switzerland     

Virtual Fiber Configuration for Dynamic Lightpath Establishment in Large-scaled Optical Networks

Recently, progress has been made in the Generalized Multi-Protocol Label Switching (GMPLS) and Automatic Switched Optical Networks (ASON) standardizations. These technologies realize construction of large-scaled optical networks, interconnections among single-domain Wavelength Division Multiplexing (WDM) networks, and direct communication over multi-domain WDM networks. Meanwhile, it is known that the topology of the Internet exhibits the power-law attribute. Since the topology of the Internet, which is constructed by interconnecting ASs, exhibits the power-law, there is a possibility that large-scale WDM networks, which are constructed by interconnecting WDM networks, will also exhibit the power-law attribute. One of the structural properties of a topology that adheres to the power-law is that most nodes have just a few links, although some have a tremendous number of them. Another property is that the average distance between nodes is smaller than in a mesh-like network. A natural question is how such a structural property performs in WDM networks. In this paper, we first investigate the property of the power-law attribute of physical topologies for WDM networks. We compare the performance of WDM networks with mesh-like and power-law topologies, and show that links connected to high-degree nodes are bottlenecks in power-law topologies. To relax this, we introduce a concept of virtual fiber, which consists of two or more fibers, and propose its configuration method to utilize wavelength resources more effectively. We compare performances of power-law networks with and without our method by computer simulations. The results show that our method reduces the blocking probabilities by more than one order of magnitude.