Partitioning of biweighted trees

A districting problem is formulated as a network partitioning model where each link has one weight to denote travel time and another weight to denote workload. The objective of the problem is to minimize the maximum diameter of the districts while equalizing the workload among the districts. The case of tree networks is addressed and efficient algorithms are developed when the network is to be partitioned into two or three districts. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 143–158, 2002; DOI 10.1002/nav.10003     

Rendezvous search on labeled networks

Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which they may move at unit speed or between adjacent distinct nodes, respectively. There are two versions of the problem (asymmetric or symmetric), depending on whether or not we allow the players to use different strategies. After obtaining some optimality conditions for general networks, we specialize to the interval and circle networks. In the first setting, we extend the work of J. V. Howard; in the second we prove a conjecture concerning the optimal symmetric strategy. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 256–274, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10011     

An INS/GNSS integrated navigation in GNSS denied environment using recurrent neural network

In view of the failure of GNSS signals, this paper proposes an INS/GNSS integrated navigation method based on the recurrent neural network (RNN). This proposed method utilizes the calculation principle of INS and the memory function of the RNN to estimate the errors of the INS, thereby obtaining a continuous, reliable and high-precision navigation solution. The performance of the proposed method is firstly demonstrated using an INS/GNSS simulation environment. Subsequently, an experimental test on boat is also conducted to validate the performance of the method. The results show a promising application prospect for RNN in the field of positioning for INS/GNSS integrated navigation in the absence of GNSS signal, as it outperforms extreme learning machine (ELM) and EKF by approximately 30% and 60%, respectively.     

基于科学计量的机器学习技术发展评估分析

机器学习是通过数据训练使机器获取新的知识和技能的计算机技术,是人工智能技术的核心和前沿领域之一。本文以Web of Science?核心合集收录的机器学习领域相关SCI论文和incoPat全球专利数据库收录的机器学习领域相关专利为数据源,运用科学计量方法对文献数据和专利数据进行时间、地域和机构分布分析,展示了机器学习领域研究实力的分布情况,并对机器学习的发展趋势进行了分析;然后利用主题聚类分析方法及可视化软件VOSviewer,挖掘出机器学习领域的关键技术、技术热点;最后对结果进行了总结分析,以期为我国机器学习发展布局提供参考和借鉴。     

对网络教学的几点思考

随着网络技术、多媒体技术的发展,网络教学已经成为一种重要的教学形式,如何正确把握网络教学的模式,抓住特点,准确定位教师在网络教学中的角色,上好每一堂课,应该是每一位老师考虑的问题。     

分布式网络环境下雷达网的网络性能分析

在分布式网络环境下,对雷达网的性能评估是雷达网对抗论证和战术研究的重要组成部分。从复杂网络理论的角度研究了此系统的组成、特性,提出了它的网络结构及性能层次模型,以全新的角度去解决系统的评估问题。对网络结构模型的信息传输能力进行了仿真试验。仿真结果表明,网络模型能够正确指导系统的结构组建及性能评估。根据网络性能层次模型,应用最优指标法,实现了该系统网络综合性能的量化评估。     

对新疆高校校园网建设的思考与探索

随着新疆高饺的校园网建设逐渐由硬件基础建设阶段转入软件和资源建设阶段,本文就新疆高校校园网建设的现状及出现的一些问题做了探讨和分析,并对如何加强高校校园网建设,充实网络教学资源,强化校园网知识培训,提高师生应用能力等一系列问题提出了建议,以期为新疆高校的信息化建设提供一些借鉴。     

基于门限的无线传感器网络密钥管理方案

由于无线传感器网络在能量消耗、内存开销和计算能力等方面的局限性,传统的网络密钥管理方法已不适用。为此提出了一种适用于无线传感器网络的密钥预分配方法——基于（t,n）-门限方案,给出了密钥分配方法,并从方案的连通性、安全性等方面进行了有效的分析,结果表明该算法在这些方面有一定的优势。     

基于拓扑结构的空间信息网络脆弱性分析

建立了空间信息网络拓扑结构,提出了基于拓扑结构的空间信息网络脆弱性分析方法,设计了空间信息网络脆弱性分析系统,并对假定的空间信息网络拓扑结构的脆弱性进行了分析。     

基于类神经网络模型的电路自主修复方法

为进一步提高电子系统在恶劣环境下的生存能力,对利用演化硬件实现电路自主修复的方法进行了研究。首先,根据FPGA芯片与多层前馈神经网络的相似性,建立了一个可用于数字电路演化的门级电路模型,设计了专用的二进制列向量编码方法;然后,给出了实现电路自主修复的工作流程,探讨了进行电路故障诊断和修复的途径,提出了快速重构与演化相结合的电路修复方法。Matlab仿真试验表明：基于类神经网络模型的遗传算法较适合进行演化修复操作;修复效果分析表明：快速重构与演化修复相结合的修复方法比单纯依靠演化修复更为便捷。