Search results for "Graph theory"
showing 10 items of 784 documents
AQM Stability in Multiple Bottleneck Networks
2004
In this paper, we highlight that multiple bottlenecks can affect the performance of active queue management controllers, which are usually configured on a single bottleneck basis, as if each controller were the only element regulating the TCP traffic along its path. To see this, we consider a network scenario where RED is configured at each router, according to previously developed control theoretic techniques. These configuration rules assure stability in a single bottleneck scenario. Yet, we show that instability may arise when two link become congested. We justify this result through a multiple bottleneck model and give guidelines for new cooperative AQM controllers.
A self-routing protocol for distributed consensus on logical information
2010
In this paper, we address decision making problems, depending on a set of input events, with networks of dynamic agents that have partial visibility of such events. Previous work by the authors proposed so-called logical consensus approach, by which a network of agents, that can exchange binary values representing their local estimates of the events, is able to reach a unique and consistent decision. The approach therein proposed is based on the construction of an iterative map, whose computation is centralized and guaranteed under suitable conditions on the input visibility and graph connectivity. Under the same conditions, we extend the approach in this work by allowing the construction o…
Expressive and efficient pattern languages for tree-structured data (extended abstract)
2000
It would be desirable to have a query language for tree-structured data that is (1) as easily usable as SQL, (2) as expressive as monadic second-order logic (MSO), and (3) efficiently evaluable. The paper develops some ideas in this direction. Towards (1) the specification of sets of vertices of a tree by combining conditions on their induced subtree with conditions on their path to the root is proposed. Existing query languages allow regular expressions (hence MSO logic) in path conditions but are limited in expressing subtree conditions. It is shown that such query languages fall short of capturing all MSO queries. On the other hand, allowing a certain guarded fragment of MSO-logic in the…
Invariant Feature Matching for Image Registration Application Based on New Dissimilarity of Spatial Features
2016
An invariant feature matching method is proposed as a spatially invariant feature matching approach. Deformation effects, such as affine and homography, change the local information within the image and can result in ambiguous local information pertaining to image points. New method based on dissimilarity values, which measures the dissimilarity of the features through the path based on Eigenvector properties, is proposed. Evidence shows that existing matching techniques using similarity metrics--such as normalized cross-correlation, squared sum of intensity differences and correlation coefficient--are insufficient for achieving adequate results under different image deformations. Thus, new…
Combinatorial solid-phase synthesis using D-galactose as a chiral five-dimension-deversity scaffold
1999
Abstract All five hydroxy groups of galactose as the scaffold are used for selective coupling of side chains in a combinatorial methodology by application of a set of orthogonally stable protecting groups in combination with a thioglycoside anchor.
Coronal Loops: Observations and Modeling of Confined Plasma
2010
Coronal loops are the building blocks of the X-ray bright solar corona. They owe their brightness to the dense confined plasma, and this review focuses on loops mostly as structures confining plasma. After a brief historical overview, the review is divided into two separate but not independent sections: the first illustrates the observational framework, the second reviews the theoretical knowledge. Quiescent loops and their confined plasma are considered, and therefore topics such as loop oscillations and flaring loops (except for non-solar ones which provide information on stellar loops) are not specifically addressed here. The observational section discusses loop classification and popula…
Morphological Enhancement and Triangular Matching for Fingerprint Recognition
2008
Among the principal problems for realizing a robust Automated Fingerprint Identification System (AFIS) there are the images quality and matching algorithms. In this paper a fingerprint enhancement algorithm based on morphological filter and a triangular matching are introduced. The enhancement phase is based on tree steps: directional decomposition, morphological filter and composition. For the matching phase a global transformation to overcame the effects of rotation, displacement and deformation between acquired and stored fingerprint is performed using the number of similar triangular, having fingerprint minutiae as vertexes. The performance of the proposed approach has been evaluated on…
5G Functional Architecture and Signaling Enhancements to Support Path Management for eV2X
2019
Enhanced vehicle-to-everything (eV2X) communication is one of the most challenging use cases that the fifth generation (5G) of cellular mobile communications must address. In particular, eV2X includes some 5G vehicular applications targeting fully autonomous driving which require ultra-high reliability. The usual approach to providing vehicular communication based on single-connectivity transmission, for instance, through the direct link between vehicles (PC5 interface), often fails at guaranteeing the required reliability. To solve such a problem, in this paper, we consider a scheme where the radio path followed by eV2X messages can be proactively and dynamically configured to either trans…
Application of Adaptive Hypergraph Model to Impulsive Noise Detection
2001
In this paper, using hypergraph theory, we introduce an image model called Adaptive Image Neighborhood Hypergraph (AINH). From this model we propose a combinatorial definition of noisy data. A detection procedure is used to classify the hyperedges either as noisy or clean data. Similar to other techniques, the proposed algorithm uses an estimation procedure to remove the effects of the noise. Extensive simulations show that the proposed scheme consistently works well in suppressing of impulsive noise.
Quasi-Modes and Spectral Instability in One Dimension
2019
In this section we describe the general WKB construction of approximate “asymptotic” solutions to the ordinary differential equation $$\displaystyle P(x,hD_x)u=\sum _{k=0}^m b_k(x)(hD_x)^ku=0, $$ on an interval α < x < β, where we assume that the coefficients bk ∈ C∞(]α, β[). Here h ∈ ]0, h0] is a small parameter and we wish to solve (above equation) up to any power of h. We look for u in the form $$\displaystyle u(x;h)=a(x;h)e^{i\phi (x)/h}, $$ where ϕ ∈ C∞(]α, β[) is independent of h. The exponential factor describes the oscillations of u, and when ϕ is complex valued it also describes the exponential growth or decay; a(x;h) is the amplitude and should be of the form $$\displaystyle a(x;h…