Multicriteria movement synchronization scheduling problems and algorithms

This article deals with multicriteria optimization models and algorithms of movement scheduling for many objects to synchronize their movement (2CMSS problem). The model consists of two parts: (1) node–disjoint path planning visiting specified nodes for K objects with a given vector of intermediate nodes for each one (NDSP problem); (2) movement synchronization in some intermediate nodes (MS problem). For synchronous movement, two categories of criteria are defined: time of movement and ‘distance’ of K-moved objects from the movement pattern. We defined the problem as a discrete-continuous, non-linear, two-criteria mathematical programming problem. We proposed to use a two-stage algorithm to solve the 2CMSS problem (as lexicographic solution): At first we have to find the vector of node–disjoint shortest paths for K objects visiting intermediate nodes to set optimal paths under the assumption that we use maximal possible velocities on each arc belonging to a path for each object (solution of the NDSP problem), and next we try to decrease the values of velocities to optimize the second criterion (synchronization, solution of the MS problem). Experimental analyses of effectiveness and complexity of the algorithms are presented.     

On structural properties of scale-free networks with finite size

Since many large real networks tend to present scale-free degree distribution, this paper investigates the structural properties of scale-free networks with finite size. Beginning with a comprehensive analysis of the degree distribution consisting of the concentration trend, dispersion and inequality, this paper then focuses on the discussion of heterogeneity and hub nodes of scale-free networks. The findings will help to improve our understanding of the structure and function of real networks.     

Identifying all-around nodes for spreading dynamics in complex networks

Identifying the most influential nodes in complex networks provides a strong basis for understanding spreading dynamics and ensuring more efficient spread of information. Due to the heterogeneous degree distribution, we observe that current centrality measures are correlated in their results of nodes ranking. This paper introduces the concept of all-around nodes, which act like all-around players with good performance in combined metrics. Then, an all-around distance is presented for quantifying the influence of nodes. The experimental results of susceptible-infectious-recovered (SIR) dynamics suggest that the proposed all-around distance can act as a more accurate, stable indicator of influential nodes.     

非简谐驻波

讨论了两列频率相同、振动方向相同、振幅相同且波形也相同的非简谐波，在同一直线上沿相反方向传播时的叠加问题．     

Packing subgraphs in a graph

We show that the problem of packing edges and triangles in a graph in order to cover the maximum number of nodes can be solved in polynomial time. More generally we present results for the problem of packing edges and a family of hypomatchable subgraphs.     

双曲线型结点组上的插值

本文讨论了R~2上的弧线型结点组之一:双曲线型结点组上插值的适定性问题。     

基于FDLs的边缘汇聚节点的性能研究

随着全光接入网的不断发展,接入速率不断提高,对于边缘节点发送来的高速数据业务也必须进行流量梳理。为了适应未来全光高速网络接入的需求,基于光纤延迟线(Fiber delay lines,FDLs)结构,构造了一种简单高效的全光包交换网络边缘汇聚节点。并针对光线延迟线结构,提出一种新的主动缓存队列管理模型来分析节点性能,得到了与以往研究不同的结果。同时在对节点性能分析的基础上,提出一种新的FDLs的排列方式,在缓存深度相同的情况下,大大提高了FDLs的效率,实现了对到来的具有自相似性的数据业务的合理调配。     

奇异杂交边界点方法求解泊松方程

As a boundary-type meshless method,the singular hybrid boundary node method(SHBNM)is based on the modified variational principle and the moving least square(MLS)approximation,so it has the advantages of both boundary element method(BEM)and meshless method.In this paper,the dual reciprocity method(DRM)is combined with SHBNM to solve Poisson equation in which the solution is divided into particular solution and general solution.The general solution is achieved by means of SHBNM,and the particular solution is approximated by using the radial basis function(RBF).Only randomly distributed nodes on the bounding surface of the domain are required and it doesn't need extra equations to compute internal parameters in the domain.The postprocess is very simple.Numerical examples for the solution of Poisson equation show that high convergence rates and high accuracy with a small node number are achievable.     

A Bidirectional “Y” Type OXC Structure Using the Least Optical Switches

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｉｎｔｈｅｒｅｃｅｎｔ 2 0 ｙｅａｒｓ ,ｏｐｔｉｃａｌｃｏｍｍｕｎｉｃａｔｉｏｎｄｅｖｅｌｏｐｅｄｖｅｒｙｆａｓｔ.Ｎｏｗｉｔｉｓｔｈｅｆｉｒｓｔｃｈｏｉｃｅｏｆａｂａｃｋｂｏｎｅｎｅｔｗｏｒｋ .Ｏｎｔｈｅｏｔｈｅｒｈａｎｄ ,ｄｕｅｔｏｔｈｅｅｘｐｌｏｓｉｏｎｏｆＩｎｔｅｒｎｅｔ,ｔｈｅｒｅｑｕｅｓｔｏｆｃｏｍｍｕｎｉｃａｔｉｏｎｃａｐａｃｉｔｙｉｎｃｒｅａｓｅｓｆａｓｔｅｒｔｈａｎｔｈｅｏｐｔｉｃａｌｃｏｍｍｕｎｉｃａｔｉｏｎｔｅｃｈｎｉｑｕｅｄｏｅｓ.Ｉｎｏｒｄｅ…     

How size evaluation of lymph node is protocol dependent in MRI when using ultrasmall superparamagnetic iron oxide nanoparticles

In this study, the volume of susceptibility artifact was evaluated in T1 and T2-weighted spin echo (SE) and gradient echo (GRE) images at various parameters using registration and subtraction methods. In order to state an important misinterpretation problem in lymphography, it was demonstrated that a lymph node size may be enlarged approximately 10 times when a T2*-weighted GRE protocol is used. To overcome this problem a technical consideration using multisequence (GRE and SE) paradigm was suggested to ensure both lymph node detection and metastasis identification in lymphatic system. The paradigm was also extended by post-processing manipulation of the SE images using a registration and subtraction approach for detection of lymphatic lesions.