Capacitated stochastic coloured Petri net-based approach for computing two-terminal reliability of multi-state network

Classical network reliability problems assume both networks and components have only binary states,fully working or fully failed states.But many actual networks are multi-state,such as communication networks and transportation networks.The nodes and arcs in the networks may be in intermediate states which are not fully working either fully failed.A simulation approach for computing the two-terminal reliability of a multi-state network is described.Two-terminal reliability is defined as the probability that d units of demand can be supplied from the source to sink nodes under the time threshold T.The capacities of arcs may be in a stochastic state following any discrete or continuous distribution.The transmission time of each arc is also not a fixed number but stochastic according to its current capacity and demand.To solve this problem,a capacitated stochastic coloured Petri net is proposed for modelling the system behaviour.Places and transitions respectively stand for the nodes and arcs of a network.Capacitated transition and self-modified token colour with route information are defined to describe the multi-state network.By the simulation,the two-terminal reliability and node importance can be estimated and the optimal route whose reliability is highest can also be given.Finally,two examples of different kinds of multistate networks are given.     

Pre-processing for time domain image formation in SS-BSAR system

A pre-processing procedure is designed for a space-surface bistatic synthetic aperture radar (SS-BSAR) system when a time domain image formation algorithm is employed. Three crucial technical issues relating to the procedure are fully discussed. Firstly, unlike image formation algorithms operating in the frequency domain, a time domain algorithm requires the accurate global navigation satellite system (GNSS) time and position. This paper proposes acquisition of this information using a time-and-spatial transfer with precise ephemeris and interpolation. Secondly, synchronization errors and compensation methods in SS-BSAR are analyzed. Finally, taking the non-ideal factors in the echo and the compatibility of image formation algorithms into account, a matched filter based on the minimum delay is constructed. Experimental result using real data suggest the pre-processing is functioning properly.     

一种突发通信的IJF-OQPSK调制信号解调方法

提出了一种用于时分多址突发通信系统中的IJF-OQPSK调制信号解调方法.介绍了电路的组成及原理,分析了系统的性能.该方法具有电路结构简单、数据恢复快、相位抖动小的优点,对提高突发通信系统的效率有显著作用.实验结果表明在时分多址突发通信系统中,该方法具有很好的使用价值.     

公路建设中土石方调运方法研究

本文研究了公路建设中土石方调运的实际背景,提出了处理该问题的数学模型和计算方法.     

Two Innovative Coalition Formation Models for Dynamic Task Allocation in Disaster Rescues

This paper addresses the problem of multi-objective coalition formation for task allocation. In disaster rescue, due to the dynamics of environments, heterogeneity and complexity of tasks as well as limited available agents, it is hard for the single-objective and single (task)-to-single (agent) task allocation approaches to handle task allocation in such circumstances. To this end, two multi-objective coalition formation for task allocation models are proposed for disaster rescues in this paper. First, through coalition formation, the proposed models enable agents to cooperatively perform complex tasks that cannot be completed by single agent. In addition, through adjusting the weights of multiple task allocation objectives, the proposed models can employ the linear programming to generate more adaptive task allocation plans, which can satisfy different task allocation requirements in disaster rescue. Finally, through employing the multi-stage task allocation mechanism of the dynamic programming, the proposed models can handle the dynamics of tasks and agents in disaster environments. Experimental results indicate that the proposed models have good performance on coalition formation for task allocation in disaster environments, which can generate suitable task allocation plans according to various objectives of task allocation.     

Risk reduction in a project portfolio

The positive impacts of managing projects as a portfolio are quantified by comparing the value of the integrated risk of a project portfolio and the aggregation of single project risks implemented separately. Firstly, the integrated risk is defined by proposing risky events based on set theory. Secondly, as projects interact with each other in a project portfolio, the integrated risk is evaluated by using a Bayesian network structure learning algorithm to construct an interdependent network of risks. Finally, the integrated risk of a practical case is assessed using this method, and the results show that the proposed method is an effective tool for calculating the extent of risk reduction of implementing a project portfolio and identifying the most risky project, so as to assist companies in making comprehensive decisions in the phase of portfolio selection and portfolio controlling.     

非满载车辆调度问题的遗传算法

非满载车辆调度问题是车辆调度问题中的一个基本问题,由于它是一个典型的NP难题,传统方法的求解结果往往不能令人满意。本文采用最大保留交叉、交叉率和变异率自适应变换等技术,设计了基于自然数编码的遗传算法,用于求解非满载车辆调度问题,在实验分析中获得了较好的结果。     

几种跳频码的混沌动力学特性及预测分析

利用动力系统方法研究了几种跳频码(m序列,RS序列,非线性序列及混沌序列)的动力学特性(相关维数与最大李雅普诺夫指数),结果表明了跳频码表现出混沌的特征。最后根据遗传算法确定前馈神经网络的结构,并利用该神经网络模型对这几种序列做了预测分析。实验结果表明,该模型能成功地预测跳频码,因而可对跳频通信进行有效的干扰。     

Removable ears of 1-extendable graphs

<正> Carvalho,Lucchesi and Murty proved that any 1-extendable graph G different from K_2and C_(2n)has at least Δ(G)edge-disjoint removable ears,and any brick G distinct from K_4 and■hasat least Δ(G)-2 removable edges,where Δ(G)denotes the maximum degree of G.In this paper,weimprove the lower bounds for numbers of removable ears and removable edges of 1-extendable graphs.It is proved that any 1-extendable graph G different from K_2 and C_(2n)has at least χ′(G)edge-disjointremovable ears,and any brick G distinct from K_4 and■has at least χ′(G)-2 removable edges,whereχ′(G)denotes the edge-chromatic number of G.     

Investigation on full distribution CNC system based on SERCOS bus

A full distribution CNC system based on SERCOS bus is studied in accordance with the limitations of traditional PC-based motion card. The conventional PC-based motion control card is dispersed into several autonomous intelligent servo-control units with the function of servo driver. The autonomous intelligent servocontrol units realize the loop control of position, velocity and current. Interpolation computation is completed in PC and the computational results are transferred to every autonomous intelligent servo-control unit by high speed SERCOS bus. Software or hardware synchronization technology is used to ensure all servomotors are successive and synchronously running. The communication and synchronization technology of SERCOS are also researched and the autonomous intelligent servo-control card is developed byself. Finally, the experiment of circle contour process on a prototype system proves the feasibility.