Heterogeneous virus propagation in networks: a theoretical study

The node‐based epidemic modeling is an effective approach to the understanding of the impact of the structure of the propagation network on the epidemics of electronic virus. In view of the heterogeneity of the propagation network, a heterogeneous node‐based SIRS model is proposed. Theoretical analysis shows that the maximum eigenvalue of a matrix related to the model determines whether viruses tend to extinction or persist. When viruses persist, the connectedness of the propagation network implies the existence and uniqueness of a viral equilibrium, and a set of sufficient conditions for the global stability of the viral equilibrium are given. Numerical examples verify the correctness of our results. Copyright © 2016 John Wiley & Sons, Ltd.     

Exact boundary controllability of partial nodal profile for network of strings

Based on the theory of exact boundary controllability of nodal profile for hyperbolic systems, the authors propose the concept of exact boundary controllability of partial nodal profile to expand the scope of applications. With the new concept, we can shorten the controllability time, save the number of controls, and increase the number of charged nodes with given nodal profiles. Furthermore, we introduce the concept of in-situ controlled node to deal with a new situation that one node can be charged and controlled simultaneously. The minimum number of boundary controls on the entire tree-like network is determined by using the concept of ‘degree of freedom of charged nodes’ introduced. And the concept of ‘control path’ is introduced to appropriately divide the network, so that we can determine the infimum of controllability time. General frameworks of constructive proof are given on a single interval, a star-like network, a chain-like network and a planar tree-like network for linear wave equation(s) with Dirichlet, Neumann, Robin and dissipative boundary conditions to establish a complete theory on the exact boundary controllability of partial nodal profile.     

破片撞击装药点火实验和数值模拟

实验中采用升 降法得到了破片撞击装药点火的临界速度范围,数值模拟中采用节点约束 分离方法、热弹塑性材料本构方程和化学动力学方程描述了炸药的破坏行为和点火反应。实验结果与数值模拟结果吻合较好。研究结果表明,采用节点约束 分离方法、热弹塑性材料本构方程和化学动力学方程可以有效地描述装药在破片撞击作用下的破坏行为和点火反应。     

A new model for the analysis of reinforced concrete members with a coupled HdBNM/FEM

As a truly boundary-type meshless method, the hybrid boundary node method (HdBNM) does not require ‘boundary element mesh’, either for the purpose of interpolation of the solution variables or for the integration of ‘energy’. In this paper, the HdBNM is coupled with the finite element method (FEM) for predicting the mechanical behaviors of reinforced concrete. The steel bars are considered as body forces in the concrete. A bond model is presented to simulate the bond-slip between the concrete and steels using fictitious spring elements. The computational scale and cost for meshing can be further reduced. Numerical examples, in 2D and 3D cases, demonstrate the efficiency of the proposed approach.     

紧急疏散中最优抗出错路径选择模型与算法

疏散路径选择是紧急疏散中的重要问题,为了减小疏散人在紧急疏散过程中由于路径选择错误带来的损失,提出一对起讫点间最优抗出错路径选择模型。给出路径出错系数的定义,用以度量疏散人路径选择错误带来的疏散效率损失,并且设计了求解最优抗出错路径的DAE算法,证明该算法的时间复杂度为O（ mn2）。结果表明,选择最优抗出错路径作为疏散路径,能够有效地抵抗由于疏散人路径选择错误带来的损失,对提高突发事件下的疏散效率具有实际意义。     

Lifting,superadditivity, mixed integer rounding and single node flow sets revisited

In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer rounding with lifting for the development of strong valid inequalities for knapsack and single node flow sets. Our hope is that the latter can be used in practice to generate cutting planes for mixed integer programs. The survey contains essentially two parts. In the first we present lifting in a very general way, emphasizing superadditive lifting which allows one to lift simultaneously different sets of variables. In the second, our procedure for generating strong valid inequalities consists of reduction to a knapsack set with a single continuous variable, construction of a mixed integer rounding inequality, and superadditive lifting. It is applied to several generalizations of the 0–1 single node flow set. This paper appeared in 4OR, 1, 173–208 (2003). The first author is supported by the FNRS as a chercheur qualifié. This paper presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister’s Office, Science Policy Programming. The scientific responsibility is assumed by the authors.     

Influence diagrams with super value nodes involving imprecise information

The concept of super value nodes was established to allow dynamic programming to be performed within the theory of influence diagrams and to reduce the computational complexity in solving problems by means of influence diagrams. This paper is focused on how influence diagrams with super value nodes are affected by the presence of imprecise information. We analyze how to reduce the complexity when evaluating an influence diagram in this framework by modelling these kinds of nodes and random magnitudes in terms of fuzzy random variables. Finally, an applied example of the theoretical results is developed.     

Level of nodes in increasing trees revisited

Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size n ≥ j. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that n − j is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

2(1/2)维等离子体粒子模拟分布式并行程序设计

设计了两种粒子模拟的并行算法,并对其进行了比较,基于消息传递环境开发2(1/2)维粒子模拟并行程序,测试并分析了并行性能.粒子模拟算法中,给出了一个初始化粒子三维Maxwell速度分布的算法,并对常用的电磁场的Lindman吸收边界作了推广.最后对激光钻孔问题作了粒子模拟计算,验证了该并行程序.     

基于DSP的CAN总线系统智能节点设计

控制器局域网CAN已经形成了国际标准，并已被公认为几种最有前途的现场总线之一，而随着DSP芯片性价比和开发手段的不断提高，DSP的应用已经深入到社会生活各个领域。结合DSP（TMS320C6000）强大的数据处理能力以及CAN总线灵活、应用范围广且日趋成熟的特点，提出了一种基于DSP的CAN总线系统智能节点设计的可行性方法。