Search results for "Networks"

Handbook of Memristor Networks

2019

Inversion of matrix pencils for generalized systems

1993

Abstract This paper clarifies the nature of the Leverrier-Faddeev algorithm for generalized and state-space systems. It presents useful diagrams for recursive computation of the coefficients of the characteristic polynomial and the coefficient matrices of the adjoint matrix for various matrix pencils. A simplified case covers recursive equations and diagrams for inversion of the second-order matrix pencil (Es2 + A1s + A0) where E may be singular. The appendix provides two examples of mechanical and heat exchange systems which can be described by the generalized models.

Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments

2013

This article studies the vehicle routing problem with trailers and transshipments VRPTT, a practically relevant, but challenging, generalization of the classical vehicle routing problem. The article makes three contributions: i Building on a nontrivial network representation, two mixed-integer programming formulations for the VRPTT are proposed. ii Based on these formulations, five different branch-and-cut algorithms are developed and implemented. iii The computational behavior of the algorithms is analyzed in an extensive computational study, using a large number of test instances designed to resemble real-world VRPTTs.Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 631, 119-133 20…

A service-oriented routing scheme with load balancing in wireless mesh networks

2008

Wireless mesh networks will play an important role in the next-generation wireless communication systems as it can provide wide coverage and scalable broadband Internet access services. However, congestion in such networks may lead to throughput degradation, packet loss and longer transmission delay. Therefore, routing and traffic forwarding schemes which are aware of the congestion status of a wireless network can efficiently improve network performance. In this paper, we propose a new congestion-aware routing scheme which may direct different paths for different services types, according to network congestion status. The goal of this routing scheme is to use traffic load metric for choosi…

Circuit-Elimination based Link-State Routing in Mobile Ad-hoc Networks

2007

Circuit-elimination based connected dominating set formation is an efficient technique for reducing routing overhead in mobile ad hoc networks. In this paper, we propose a new message dissemination algorithm which utilizes such techniques to reduce the number of nodes that generate or forward link state advertisements in link state routing protocols. Simulation results with both static and dynamic network topologies demonstrate the potential of the proposed algorithm to reduce routing overhead, compared with a benchmark link state routing protocol, OLSR.

Hierarchical Structure in Financial Markets

1998

I find a topological arrangement of stocks traded in a financial market which has associated a meaningful economic taxonomy. The topological space is a graph connecting the stocks of the portfolio analyzed. The graph is obtained starting from the matrix of correlation coefficient computed between all pairs of stocks of the portfolio by considering the synchronous time evolution of the difference of the logarithm of daily stock price. The hierarchical tree of the subdominant ultrametric space associated with the graph provides information useful to investigate the number and nature of the common economic factors affecting the time evolution of logarithm of price of well defined groups of sto…

Temporal and spatial persistence of combustion fronts

2002

The spatial and temporal persistence, or first-return distributions are measured for slow combustion fronts in paper. The stationary temporal and (perhaps less convincingly) spatial persistence exponents agree with the predictions based on the front dynamics, which asymptotically belongs to the Kardar-Parisi-Zhang (KPZ) universality class. The stationary short-range and the transient behavior of the fronts is non-Markovian and the observed persistence properties thus do not agree with the theory. This deviation is a consequence of additional time and length scales, related to the crossovers to the asymptotic coarse-grained behavior.

Noise-enhanced stability of periodically driven metastable states

2000

We study the effect of noise-enhanced stability of periodically driven metastable states in a system described by piecewise linear potential. We find that the growing of the average escape time with the intensity of the noise is depending on the initial condition of the system. We analytically obtain the condition for the noise enhanced stability effect and verify it by numerical simulations.

Ranking coherence in topic models using statistically validated networks

2023

Probabilistic topic models have become one of the most widespread machine learning techniques in textual analysis. Topic discovering is an unsupervised process that does not guarantee the interpretability of its output. Hence, the automatic evaluation of topic coherence has attracted the interest of many researchers over the last decade, and it is an open research area. This article offers a new quality evaluation method based on statistically validated networks (SVNs). The proposed probabilistic approach consists of representing each topic as a weighted network of its most probable words. The presence of a link between each pair of words is assessed by statistically validating their co-oc…

High-frequency trading and networked markets

2021

Financial markets have undergone a deep reorganization during the last 20 y. A mixture of technological innovation and regulatory constraints has promoted the diffusion of market fragmentation and high-frequency trading. The new stock market has changed the traditional ecology of market participants and market professionals, and financial markets have evolved into complex sociotechnical institutions characterized by a great heterogeneity in the time scales of market members’ interactions that cover more than eight orders of magnitude. We analyze three different datasets for two highly studied market venues recorded in 2004 to 2006, 2010 to 2011, and 2018. Using methods of complex network th…