运动目标声信号的时频特征研究

提高声被动目标定位精度需要研究运动目标在有风条件下目标声信号的特征。本文从声学波动方程出发，对无风和有常速风情况下的波动方程进行了求解，得到了运动目标声信号的延迟关系；分析了解的主要影响项，并得到了其解析信号；用解析信号对运动目标声信号的延迟特性和时频特征进行了仿真计算。     

基于径向基函数神经网络的Lorenz混沌系统滑模控制

针对受参数不确定和外扰影响的混沌Lorenz系统，提出一种基于径向基函数（RBF）神经网 络的滑模控制方法.基于被控系统在不稳定平衡点处状态误差的可控规范形，设计滑模切换 面并将其作为神经网络的唯一输入.单入单出形式的RBF控制器隐层只需7个径向基函数，网 络的权值则依滑模趋近条件在线确定.仿真表明该控制器对系统参数突变和外部干扰具有鲁棒性，同时抑制了抖振. 关键词： 混沌控制 滑模 径向基函数神经网络 Lorenz系统     

虫草氨基酸的人工神经网络-近红外光谱快速测定方法

提出了用近红外漫反射光谱技术快速检测发酵冬虫夏草中氨基酸含量的新方法。采用比色法测定虫草菌粉中氨基酸含量。用BP神经网络建立了近红外光谱数据与氨基酸、精氨酸和总氨酸含量间的定量关联模型。通过比较不同的光谱预处理方法及光谱范围, 得到最优模型,即在7 501.7～6 097.8,5 453.7～4 246.5 cm-1区域内,近红外光谱的一阶微分光谱与其氨基酸含量之间建立模型。甘氨酸、精氨酸和总氨基酸的预测标准偏差分别为0.08,0.07和0.36,均优于主成分回归(PCR)和偏最小二乘回归(PLS)等线性模型的处理结果。结果表明,该方法是一种有效实用的非线性校正方法。为近红外光谱快速测定中药组分含量提供了一条新途径。     

利用网络资源进行四级物理实验的科研设计

以科研实验为主题的大学四级物理实验,其目的是引导学生科研入门以及培养锻炼其科研能力。中国科学技术大学物理实验中心在这方面做了许多有益的探索。     

基于Internet/Intranet的大学物理实验系统

利用计算机技术、传感技术和校园网，将现代教育技术引入大学普通物理实验教学中，实现实验数据的自动采集，基于网络的实验预习和实验报告写作、递交、批改及管理等功能．     

Applying simulated annealing to location-planning models

Simulated annealing is a computational approach that simulates an annealing schedule used in producing glass and metals. Originally developed by Metropolis et al. in 1953, it has since been applied to a number of integer programming problems, including the p-median location-allocation problem. However, previously reported results by Golden and Skiscim in 1986 were less than encouraging. This article addresses the design of a simulated-annealing approach for the p-median and maximal covering location problems. This design has produced very good solutions in modest amounts of computer time. Comparisons with an interchange heuristic demonstrate that simulated annealing has potential as a solution technique for solving location-planning problems and further research should be encouraged.     

F值函数的微分及其在FNN中的应用

本文引进了集值函数的ｓ－可微和模糊值（Ｆ值）函数的Ｆｓ－可微概念。给出了这两种可微性的几个判别条件。最后研究并得到了一类模糊神经网络（ＦＮＮ）的Ｆｓ－可微性和连续性。     

Optimizing flow rates in a queueing network with side constraints

In this paper, modified versions of the classical deterministic maximum flow and minimum cost network flow problems are presented in a stochastic queueing environment. In the maximum flow network model, the throughput rate in the network is maximized such that for each arc of the network the resulting probability of finding congestion along that arc in excess of a desirable threshold does not exceed an acceptable value. In the minimum cost network flow model, the minimum cost routing of a flow of given magnitude is determined under the same type of constraints on the arcs. After proper transformations, these models are solved by Ford and Fulkerson's labeling algorithm and out-of-kilter algorithm, respectively.     

Countable network weight and multiplication of Borel sets

A space Borel multiplies with a space if each Borel set of is a member of the -algebra in generated by Borel rectangles. We show that a regular space Borel multiplies with every regular space if and only if has a countable network. We give an example of a Hausdorff space with a countable network which fails to Borel multiply with any non-separable metric space. In passing, we obtain a characterization of those spaces which Borel multiply with the space of countable ordinals, and an internal necessary and sufficient condition for to Borel multiply with every metric space.

     

用于解决大规模波长路由光网中路由和波长分配问题的新启发式算法

本文提出了一种新的启发式算法,它将路由和波长分配问题分解为两个子问题分别进行优化求解,并以最小化波长需求作为目标函数。在不同通信负荷的情况下,我们以NSF网为例,分析了波长通道(WP)和虚波长通道(VWP)路由方案之间在波长需求方面的差别。同时还研究了网络波长重用度的问题。数值结果表明所提出的算法可有效地应用于大规模波长路由光网。