Search results for "Linear Algebra."
showing 10 items of 552 documents
AQM generalized nyquist stability in multiple bottleneck networks
2005
Abstract The influence of multiple bottlenecks on the stability of Active Queue Management (AQM) controllers, usually configured on a single bottleneck basis is discussed. 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. We show that instability may arise when two links become congested. We justify this result through a multiple bottleneck model using the Generalized Nyquist stability criterion.
Performance of revised STO(1M)-3G basis set for prediction of 5-fluorocytosine chemical shifts.
2019
Nuclear shieldings and chemical shifts of 5-fluorocytosine (5FC) were predicted in the gas phase and DMSO solution modeled by polarizable continuum model using B3LYP density functional and revised STO(1M)-3G basis set. For comparison, eight arbitrary selected basis sets including STO-3G and medium-size Pople-type and larger dedicated Jensen-type ones were applied. The former basis sets were significantly smaller, but the calculated structural parameters, harmonic vibrational frequencies, were very accurate and close to those obtained with larger, polarization-consistent ones. The predicted 13 C and 1 H chemical shieldings of 5FC and cytosine, selected as parent molecule, were acceptable (ro…
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…
Scalable Dense Factorizations for Heterogeneous Computational Clusters
2008
This paper discusses the design and the implementation of the LU factorization routines included in the Heterogeneous ScaLAPACK library, which is built on top of ScaLAPACK. These routines are used in the factorization and solution of a dense system of linear equations. They are implemented using optimized PBLAS, BLACS and BLAS libraries for heterogeneous computational clusters. We present the details of the implementation as well as performance results on a heterogeneous computing cluster.
A Basic Program for Calculating Scale Values Using Four Unidimensional Scaling Methods in Random Subsamples
1993
This MS BASIC program calculates and stores for further analysis scale values obtained from random subsamples using four unidimensional scaling methods: Dunn-Rankin's variance stable rank sums, Thurstone's case V (paired comparisons), Thurstone-Chave's IAI, and Green's successive categories.
Robust fault tolerant tracking controller design for vehicle dynamics: A descriptor approach
2015
Abstract In this paper, an active Fault Tolerant Tracking Controller (FTTC) scheme dedicated to vehicle dynamics system is proposed. To address the challenging problem, an uncertain dynamic model of the vehicle is firstly developed, by considering the lateral forces nonlinearities as a Takagi–Sugeno (TS) representation, the sideslip angle as unmeasurable premise variables and the road bank angle as an unknown input. Subsequently, the vehicle dynamic states with the sensor faults are jointly estimated by a descriptor observer on the basis of the roll rate and the steering angle measures. Then a fault tolerant tracking controller is synthesized and solutions are proposed in terms of Linear Ma…
Die Schmieghyperebenen an die Veronese-Mannigfaltigkeit bei Beliebiger Charakteristik
1982
By means of linear algebra a base-free definition of a Veronese variety V(n,r) is given and also an illuminating description of its osculating primes from which can be deduced in a general form and without difficulty the phenomena of degeneracy in case of small characteristics. (Instance best known: For characteristic 2 all tangents of a conic are confluent.) The last section investigates special problems for the V(1,r) in characteristic p: So the osculating primes of a V(1,p) intersect its node in a V(1,p-2). Furthermore it becomes clearer why for 2<r<¦K¦−1 no elation can fix a V(1,r) (in case of a perfect field).
*-Representations of Partial *-Algebras
2002
This chapter is devoted to *-representations of partial *-algebras. We introduce in Section 7.1 the notions of closed, fully closed, self-adjoint and integrable *-representations. In Section 7.2, the intertwining spaces of two *-representations of a partial *-algebra are defined and investigated, and using them we define the induced extensions of a *-representation. Section 7.3 deals with vector representations for a *-representation of a partial *-algebra, which are the appropriate generalization to a *-representation of the notion of generalized vectors described in Chapter 5. Regular and singular vector representations are defined and characterized by the properties of the commutant, and…
Assessment of drainage network analysis methods to rank sediment yield hotspots
2021
This paper aims to test different methods used for assessing sediment yield indices to identify hotspots and rank sediment yield hotspots. This process includes the assessment of the entropy weight...
Time-Frequency Filtering for Seismic Waves Clustering
2014
This paper introduces a new technique for clustering seismic events based on processing, in time-frequency domain, the waveforms recorded by seismographs. The detection of clusters of waveforms is performed by a k-means like algorithm which analyzes, at each iteration, the time-frequency content of the signals in order to optimally remove the non discriminant components which should compromise the grouping of waveforms. This step is followed by the allocation and by the computation of the cluster centroids on the basis of the filtered signals. The effectiveness of the method is shown on a real dataset of seismic waveforms.