用约束网络表示二维图形的二叉树算法

文章重点讨论了利用网络表达二维图形，提出网络的分解原则，使其最终能转化成可以求解的二叉树表示，并在其过程中探讨尺寸标注的一致性及可加工性，最后讨论加速网络分解的技术，为参数化设计提供快速，简捷的技术手段。  

大规模集成电路模块级云-小波故障诊断

随着集成电路的结构功能模块化,元件级诊断已没有必要,且容差特性将导致累积误差缺陷。对此提出一种云模型嵌套小波网络的大规模集成电路故障诊断方法。采集网络撕裂后的模块化集成电路状态信息,用正向云模型对采集量归一化预处理作为小波网络数据量输入,经训练后的输出数据组逆云化处理,得出辨识明晰的诊断结果。例证说明,该方法提高了集成电路的故障诊断精度。  

模拟电路的分块故障诊断法

本文使用网络分解技术研究了模拟电路的故障诊断问题，导出了支路分块故障诊断方程，只需检验方程的相容性，按照最终的分解水平就能把故障定位到尽可能小的子电路中。对存在不可测节点、容差情况和连接支路的故障也进行了讨论。  

状态检修专家系统中神经网络的应用研究

介绍了设备状态检修专家系统的结构，提出了一种基于模块化的神经网络的系统结构和学习算法。它通过用分解判定子模块对输入向量的适当分区域、由合成子网将各区域的结果合成，实现了复杂任务的自动分解判定和模块化训练策略。研究表明该结构和算法是可行的、有效的，它具有并行性高、对新增样本易于学习等特点。  

Network partitioning using harmony search and equivalencing for distributed computing

Power system has a highly interconnected network that requires intense computational effort and resources for centralized control. Distributed computing needs the systems to be partitioned optimally into clusters. The network partitioning is an optimization problem whose objective is to minimize the number of nodes in a cluster and the tie lines between the clusters. Harmony Search(HS) Algorithm is one of the recently developed meta heuristic algorithms that can be applied to optimization problems. In this work, the HS algorithm is applied to the network partitioning problem and power flow based equivalencing is done to represent the external system. Simulation is done on IEEE Standard Test Systems. The algorithm is found to be very effective in partitioning the system hierarchically and the equivalencing method gives accurate results in comparison to the centralized control.  

一种基于大规模网络分解和协调的WSNs MAC协议

针对树状拓扑的大规模传感器网络中存在的节点能量和传输效率问题,提出了一种基于大规模网络分解和协调的无线传感器网络(WSNs)MAC协议。该协议在路由信息的基础上对网络进行再一次分解,并采用了与之相适应的节点接入算法。实验结果表明:该协议总体能耗低、传达率高且具有一定的自适应性,同时网络时延并没有因为分层而增加。该协议对大规模无线传感器网络有良好的适用性。  

Design of a Railway Scheduling Model for Dense Services

We address the problem of generating detailed conflict-free railway schedules for given sets of train lines and frequencies. To solve this problem for large railway networks, we propose a network decomposition into condensation and compensation zones. Condensation zones contain main station areas, where capacity is limited and trains are required to travel with maximum speed. They are connected by compensation zones, where traffic is less dense and time reserves can be introduced for increasing stability. In this paper, we focus on the scheduling problem in condensation zones. To gain structure in the schedule we enforce a time discretisation which reduces the problem size considerably and also the cognitive load of the dispatchers. The problem is formulated as an independent set problem in a conflict graph, which is then solved using a fixed-point iteration heuristic. Results show that even large-scale problems with dense timetables and large topologies can be solved quickly.  

Queues in DOCSIS cable modem networks

In this paper we determine the optimal fraction c^*$c^{*}$ of the uplink channel capacity that should be dedicated to the contention channel in a DOCSIS cable network in order to minimize its mean response time. For this purpose, we have developed an open queueing network with a non-standard form of blocking consisting of tens to hundreds of nodes. The network contains several types of customers that enter the network at various points according to a Markovian arrival process with marked customers. One of the main building blocks of the model exists in capturing the behavior of the conflict resolution algorithm by means of a single processor sharing queue. To assess the performance characteristics of this open queueing network we rely on an advanced decomposition technique that is specifically designed to deal with the Markovian nature of the arrival pattern. Several simulations are run to confirm the accuracy of the decomposition technique. We also explore the impact of a variety of systems parameters, e.g., the number of cable modems, the initial backoff window size, the correlation structure of the arrival process, the mean packet sizes, etc., on the optimal fraction c^*$c^{*}$.  

一种基于混合遗传的贝叶斯网络分解算法

针对最优贝叶斯网络分解是一个NP-完全问题,提出了一种基于混合遗传贝叶斯网络分解算法PHGA.PHGA算法将进化过程划分为三个不同的阶段,在前期和中期阶段采用较大的种群规模和交叉率,以及较小的群体选择压力,来增强PHGA算法的全局探索能力,避免早熟现象;在后期采用较小的种群规模和交叉率,以及较大的群体选择压力,并引入爬山局部优化算子,以增强群体在进化后期中的局部寻优能力,提高算法的收敛速度.三个标准的贝叶斯网络上的实验表明该算法在最优解方面要优于遗传算法和模拟退火算法.  

A novel decomposition and coordination algorithm for complex networks and its application to power grids

To analyze and control complex networks effectively, this paper puts forward a new kind of scheme, which takes control separately in each area and can achieve the network＇s coordinated optimality. The proposed algorithm is made up of two parts： the first part decomposes the network into several independent areas based on community structure and decouples the information flow and control power among areas; the second part selects the center nodes from each area with the help of the control centrality index. As long as the status of center nodes is kept on a satisfactory level in each area, the whole system is under effective control. Finally, the algorithm is applied to power grids, and the simulations prove its effectiveness.