管路系统计算机辅助设计方法研究

为进行计算机辅助管路系统敷设,本文归纳出9条管路CAD规则,探讨了3种管路敷设方法。为满足管路设计规则,根据管路系统的复杂性和计算机辅助敷设的特点,本文提出了先敷设粗管再分区敷设最后解决跨区域管路的WRS法。它按照先重后轻、先短后长、先难后易的敷管原则,体现了局部最优从而达到全局最佳的原理。文中着重介绍了该方法的思路,并结合在电子模型样机上的敷管实例及过程,分析了该方法的特点。      

RSAB积木块自动布线系统

 本文介绍了在SUN工作站UNIX操作系统下实现的一个用于LSI/VLSI积木块布图设计的自动布线系统——RSAB,给出了系统构成,通道定义方法以及全局和通道布线算法。系统除了可对一般信号线网自动布线外,还可处理特殊线网(电源/地线网,临界线网等)的自动布线。目前RSAB已集成在一个交互式版图编辑系统——Magic中,提供设计者一个友好的用户界面和自动/交互式布图环境。实验结果表明RSAB是可行的,布线结果令人满意。     

Effective local dynamic routing strategy for air route networks

With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network(ARN), we propose an effective local dynamic routing strategy in this paper. Several factors, such as the routing distance, the geographical distance and the real-time local traffic, are taken into consideration.When the ARN is in the normal free-flow state, the proposed strategy can recover the shortest path routing(SPR) strategy. When the ARN undergoes congestion, the proposed strategy changes the paths of flights based on the real-time local traffic information. The throughput of the Chinese air route network(CARN) is evaluated. Results confirm that the proposed strategy can significantly improve the throughput of CARN. Meanwhile, the increase in the average flying distance and time is tiny. Results also indicate the importance of the distance related factors in a routing strategy designed for the ARN.     

一种新的基于位置信息的路由算法研究

 为航空移动Ad hoc网络(MANET)提出一种基于位置信息的路由算法,即位置网格路由（LBGR）算法,以此来解决节点高速移动引起的路径重建问题。算法中,数据包沿路由发现时得到的网格轨迹进行传输,每个收到数据包的中转节点根据它与相邻节点、目的节点的位置关系及网络轨迹下游的路由网格位置决定下一跳节点。由于利用了网格位置信息,LBGR算法在航空节点高速移动和拓扑变化无法事先预测的情况下,使用较少的开销就可获得稳定的路由。仿真结果表明,与GRID路由算法相比,LBGR算法在节点中高速移动时,能够有效地减少路由开销,提高网络吞吐量。     

ELGR: An Energy-efficiency and Load-balanced Geographic Routing Algorithm for Lossy Mobile Ad Hoc Networks

Geographic routing is a highly active area of research in mobile ad hoc networks (MANETs) owing to its efficiency and scalability. However, the use of simple greedy forwarding decreases the packet reception rate (PRR) dramatically in unreliable wireless environments; this also depresses the network lifetime. Therefore, it is important to improve delivery performance and prolong MANET lifetime simultaneously. In this article, a novel geographic routing algorithm, named energy-efficiency and load-loalanced geographic routing (ELGR), is presented for lossy MANETs. ELGR combines energy efficiency and load balance to make routing decisions. First, a link estimation scheme for the PRR is presented that increases the network energy efficiency level. Second, a learning method is proposed to adaptively sense local network loads, allowing enhanced whole network load balance. The results of a simulation show that ELGR performs better than several other geographic routing algorithms; in particular it extends network lifetime by about 20%, with a higher delivery ratio.     

基于蚁群优化的能量均衡自适应路由算法

基于蚁群优化的WSNs路由算法具有蚁群优化自组织性、正反馈性和并行性的特点,在构造无线传感器网络中的最优路由时有很好的性能。但是蚁群优化构造最优解时带来的网络开销十分可观,不适合在路由维护阶段反复使用蚁群优化重构路由。考虑到蚁群优化的上述特点,同时针对无线传感器网络能量受限的特点,提出了一种基于蚁群优化的能量均衡白适应路由算法。该算法使用了新的信息素更新算子,算子中包含了网络能量水平因子,能够均衡网络能量消耗。在路由维护阶段,该算法使用了新的基于侦测蚂蚁的自适应路由维护机制,很好地降低了网络开销。     

基于遗传算法的军事物流运输计划

针对军事物流运输中车辆装载和车辆路径的组合问题进行研究,建立车辆装载和车辆路径组合问题的目标优化模型。通过改进遗传算法对模型求解,得到了较为满意的结果,可以在满足多车型多品种货物配送约束的条件下,实现运输车辆最少、车辆满载率高、车辆运输路径最短的目标。     

航空发动机管路系统数字化设计

本文介绍了基于数字样机的全新管路系统设计。通过构建规范化的数字样机，借助研究开发的规范、应用程序、数据库，实现了发动机结构参数提取、空间数据管理与分析、管路路径生成与路径快速更新。借助标准件库实现面向加工与装配的全新设计模式，达到了设计的高速、高质量和低开发成本等多个目标。     

一种新的容错蛀洞路由算法

研究了蛀洞网络的容错路由问题,提出了一种新的重新路由算法。与已知算法不同的是,该算法不需要虚拟信道,适用于任何网络拓扑结构和任意确定的路由策略,只要保证网络连通,也可适用于任意数目的故障信道。模拟结果表明,与现有方法相比,本文提出的方法在网格结构下具有更好或类似的性能。     

基于缓存的结构化P2P路由算法研究

P2P网络中的资源经常会被不同节点重复查找,有些热门资源被重复查找的概率更高,如何保证资源在重复查找时的效率,提高路由算法对已查找结果的自记忆能力,是一个亟待解决的问题.在分析传统的Pastry路由算法基础上,采用内容缓存机制和路径缓存机制来改善路由性能,重点研究了不同消息重复率下的路由性能.在不同节点个数和不同的消息重复率下进行大量模拟实验,结果表明改进后的路由算法随着消息重复率的升高,算法的路由性能明显改善.     

基于最短路径和负载动态的改进路由策略

随着计算机通讯技术的发展和网络的普及,信息资源日益膨胀,随时导致网络拥塞的发生,甚至造成网络崩溃。为了对网络拥塞进行控制,提出了基于最短路径和局部负载动态的改进路由策略。采用基于距离优先和度优先连接的复杂网络演化模型构建现实网络的模拟网络,并在此基础上再对所提出的改进路由策略进行仿真实验,仿真结果充分说明提出的改进路由策略在网络拥塞控制上效果更优。     

低雷诺数下翼面局部振动增升机理研究

采用计算流体力学(CFD)方法研究低雷诺数下翼面局部振动对翼型气动特性及其流动特征的影响规律。建立局部振动激励的力学模型,并采用任意拉格朗日-欧拉坐标系下的特征线有限元(ALE-CBS)方法对局部振动激励下翼型绕流问题进行模拟,分析局部振动对非定常流动演化的影响规律,揭示其增升机理。研究结果表明:翼面局部变形的增加会有效降低翼型上表面的前缘压力;非定常流动分离中旋涡之间的距离及其演化频率与振动频率的关系是影响翼型翼面局部振动增升效果的重要因素。当流场主频率与振动频率相同,次要频率为主频率的2倍,即发生锁频时,翼面振动产生的移动分离泡能够使分离区从主流获取更多的能量,使翼型上表面保持较低的压力,有效提高翼型升力。     

一种高效的组合动导数分量数值模拟算法

基于传统网格速度法,发展了在流场网格不变的情况下,数值模拟沉浮运动、纯俯仰运动和俯仰振荡运动的算法,提出了一套直接求解旋转阻尼导数和洗流时差导数的方法,该方法不需要实时更新网格,减少了计算时间和所需内存,避免了负体积的出现。首先通过NACA 0006的阵风响应和NACA 0012翼型的强迫俯仰振荡,验证了程序和方法的正确性;然后数值模拟了BFM(basic finner missile)标准模型的沉浮运动、纯俯仰运动和俯仰振荡运动,并计算了其旋转阻尼导数、洗流时差导数和组合动导数,所得结果与动网格方法和风洞试验值吻合,最大误差不超过4%,进一步验证了该方法的正确性。     

一种针对局部结构的有限元模型修正方法

针对实际结构有限元模型（FEM）的建模误差通常仅存在于局部区域,提出了一种对局部结构单独进行模型修正的方法。首先,根据频响函数（FRF）解耦理论得到由残余结构频响函数与包含待修正参数的局部结构动刚度所重构的整体结构频响函数的拟合值,然后通过迭代优化使其与测量值的残差最小化,从而得到参数的极大似然估计。在此基础上,将残差关于参数的灵敏度以局部结构动力学矩阵表示,建立了模型修正的基本方程,利用整体结构的测试数据即可直接对分离出来的局部结构进行模型修正。最后,对喷气式飞机和三角机翼飞机分别进行了数值模拟和实验研究,验证了所提方法的可行性和有效性。结果表明,所提方法可以成功地用于仅局部区域含有建模误差的实际结构有限元模型的修正,修正后的有限元模型的动态特性与实际结构有较好的一致性。     

Research of multi-path routing based on network coding in space information networks

A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks. On the basis of traditional multi-path routing, the algorithm uses a random linear network coding strategy to code data pack- ets. Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together. The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding. Meanwhile, the algorithm also adopts the flow distribution strategy based on time delay to balance network load. Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate, reduce packet delay, and enhance network performance.     

Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.     

Dynamic neighborhood genetic learning particle swarm optimization for high-power-density electric propulsion motor

To maximize the power density of the electric propulsion motor in aerospace application, this paper proposes a novel Dynamic Neighborhood Genetic Learning Particle Swarm Optimization (DNGL-PSO) for the motor design, which can deal with the insufficient population diversity and non-global optimal solution issues. The DNGL-PSO framework is composed of the dynamic neighborhood module and the particle update module. To improve the population diversity, the dynamic neighborhood strategy is first proposed, which combines the local neighborhood exemplar generation mechanism and the shuffling mechanism. The local neighborhood exemplar generation mechanism enlarges the search range of the algorithm in the solution space, thus obtaining high-quality exemplars. Meanwhile, when the global optimal solution cannot update its fitness value, the shuffling mechanism module is triggered to dynamically change the local neighborhood members. The roulette wheel selection operator is introduced into the shuffling mechanism to ensure that particles with larger fitness value are selected with a higher probability and remain in the local neighborhood. Then, the global learning based particle update approach is proposed, which can achieve a good balance between the expansion of the search range in the early stage and the acceleration of local convergence in the later stage. Finally, the optimization design of the electric propulsion motor is conducted to verify the effectiveness of the proposed DNGL-PSO. The simulation results show that the proposed DNGL-PSO has excellent adaptability, optimization efficiency and global optimization capability, while the optimized electric propulsion motor has a high power density of 5.207 kW/kg with the efficiency of 96.12%.     

Momentum transfer-based attitude control of spacecraft with backstepping

A nonlinear control law design based upon the backstepping approach is addressed for attitude maneuver control of spacecraft by momentum transfer (MT) in the presence of disturbance. For MT, a traditional method usually applies constant torque as an input, which tends to produce significant residual oscillation. Enhanced methods such as optimal control can somewhat reduce the residual oscillation, but may not be enough for minimum residual motion. Feedback linearization technique can drive the final nutation angle small enough, but it is rather sensitive to parameter uncertainty. The proposed method here takes advantage of nonlinear control approach with small steady-state nutation angle. Sensitivity about parameter uncertainties by feedback linearization can be reduced by the backstepping technique. Stability of the resulting control law is guaranteed by the Lyapunov stability theory. Boundedness of the control law is presented to validate practical merit of the proposed control law.     

飞机维修路径研究热点与前沿——基于CiteSpace的可视化分析

近年来,随着民航运输业的飞速发展,飞机维修路径规划研究越来越受到重视。为了探究飞机维修路径规划问题的研究现状、研究热点以及前沿趋势,以中国知网（CNKI）和Web of Science 核心数据库2000 年1 月—2022 年12 月收录的国内外飞机维修路径规划研究的相关文献作为分析数据,将CiteSpace V 软件作为辅助研究工具,分析飞机维修路径规划研究领域的研究学者和研究机构以及合作关系,结合知识图谱与文献内容总结该领域的研究热点与研究前沿。考虑国内的飞机维修路径规划研究情况,针对我国在该领域的研究趋势以及重点研究内容提出研究建议,为今后飞机维修路径规划研究提供参考。     

UMR: A utility-maximizing routing algorithm for delay-sensitive service in LEO satellite networks

This paper develops a routing algorithm for delay-sensitive packet transmission in a low earth orbit multi-hop satellite network consists of micro-satellites. The micro-satellite low earth orbit(MS-LEO) network endures unstable link connection and frequent link congestion due to the uneven user distribution and the link capacity variations. The proposed routing algorithm,referred to as the utility maximizing routing(UMR) algorithm, improve the network utility of the MS-LEO network for carrying flows with strict end-to-end delay bound requirement. In UMR, first, a link state parameter is defined to capture the link reliability on continuing to keep the end-to-end delay into constraint; then, on the basis of this parameter, a routing metric is formulated and a routing scheme is designed for balancing the reliability in delay bound guarantee among paths and building a path maximizing the network utility expectation. While the UMR algorithm has many advantages, it may result in a higher blocking rate of new calls. This phenomenon is discussed and a weight factor is introduced into UMR to provide a flexible performance option for network operator. A set of simulations are conducted to verify the good performance of UMR, in terms of balancing the traffic distribution on inter-satellite links, reducing the flow interruption rate,and improving the network utility.