The simulation of large-scale networks is a challenging task especially if the network to simulate is the Dynamic Multipoint Virtual Private Network, it requires expert knowledge to properly configure its component technologies. The study of these network architectures in a real environment is almost impossible because it requires a very large number of equipment, however, this task is feasible...

A complex dynamic system based on a network of multiple reversible reactions has been established. The network was applied to a dynamic systemic resolution protocol based on kinetically controlled lipase-catalyzed transformations. This resulted in the formation of cyclized products, where two thiazolidinone compounds were efficiently produced from a range of potential transformations.

in general, the objective of distillation control is to maintain the desired products quality. in this paper, the performances of different one point control strategies for an aromatic distillation column have been compared through dynamic simulation. these methods are: a) composition control using measured composition directly. this method sufferes from large sampling delay of measuring device...

in this paper, we present an analytical method for solving a well-posed boundary value problem of mathematical physics governing the vibration characteristics of an internal flow propelled fluid-structure interaction where the pipeline segment is idealized as an elastic hollow beam conveying an incompressible fluid on a viscoelastic foundation. the effect of coriolis and damping forces on the o...

in this study, a low-cost, rapid and qualitative evaluation procedure is presented using dynamic pattern recognition analysis to assess liquefaction potential which is useful in the planning, zoning, general hazard assessment, and delineation of areas, dynamic pattern recognition using neural networks is generally considered to be an effective tool for assessing of hazard potential on the basis...

Closeness is a widely-studied centrality measure. Since it requires all pairwise distances, computing closeness for all nodes is infeasible for large real-world networks. However, for many applications, it is only necessary to find the k most central nodes and not all closeness values. Prior work has shown that computing the top-k nodes with highest closeness can be done much faster than comput...

Modeling of network structures has been a popular issue in the study of complex networks. The use of complex network theory in modeling complex networks has gradually become a trend. In this study, the current research status of the modeling of complex networks was synthesized based on the BA scale-free network model. The advantages and disadvantages of most mainstream models were integrated, a...

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

We present fully dynamic algorithms for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν∗ · log n) time per update with our basic algorithm, and O(ν∗ · log n) time with a more complex algorithm, where n = |V |, and ν∗ bounds the number...