In this paper we discuss the problem of computing the real radius of controllability of the Single Input Multi Output (SIMO) systems described by univariate polynomial matrices. The problem is equivalent to computing the nearest noncoprime polynomial matrix to the polynomial matrix describing the system in some prescribed norm. A particular case of this problem is to compute approximate GCD of ...

In this paper, a more general definition of triangular intuitionistic fuzzy number (TIFN) is proposed by removing the `normality' in the definition of intuitionistic fuzzy number. The basic arithmetic operations of generalized triangular intuitionistic fuzzy numbers (GTIFNs) and the notion of -cut sets are defined. Also a nearest interval approximation method is described to approximate a GTIFN...

in this work, one and two-dimensional lattices are studied theoretically by a statistical mechanical approach. the nearest and next-nearest neighbor interactions are both taken into account, and the approximate thermodynamic properties of the lattices are calculated. the results of our calculations show that: (1) even though the next-nearest neighbor interaction may have an insignificant effect...

The problem of feature transformation arises in many fields of information processing, including machine learning, data compression, computer vision and geosciences applications. Here we discuss an approach that seeks a hyperspherical coordinate system preserving geodesic distances in the high dimensional hyperspectral data space. A lower dimensional hyperspherical manifold is computed using a ...

This paper is devoted to the location of public facilities in a metric space. Selfish agents are located in this metric space, and their aim is to minimize their own cost, which is the distance from their location to the nearest facility. A central authority has to locate the facilities in the space, but she is ignorant of the true locations of the agents. The agents will therefore report their...

The nearest neighbor search (NNS) problem is the following: Given a set of n pointsP = fp1; : : : ; png in some metric spaceX, preprocess P so as to efficiently answer queries which require finding a point in P closest to a query point q 2 X. The approximate nearest neighbor search (c-NNS) is a relaxation of NNS which allows to return any point within c times the distance to the nearest neighbo...

Nearest neighbor search is a nearly ubiquitous problem in computer science. When nearest neighbors are desired for a query set instead of a single query point, dual-tree algorithms often provide the fastest solution, especially in low-to-medium dimensions (i.e. up to a hundred or so), and can give exact results or absolute approximation guarantees, unlike hashing techniques. Using a recent deco...

The nearest neighbor search (NNS) problem is the following: Given a set of n points P = fp 1 ; : : : ; p n g in some metric space X , preprocess P so as to eeciently answer queries which require nding a point in P closest to a query point q 2 X. The approximate nearest neighbor search (c-NNS) is a relaxation of NNS which allows to return any point within c times the distance to the nearest neig...

The simultaneous unavailability of several technical components within large-scale engineering systems can lead to high stress, rendering them prone to cascading events. In order to gain qualitative insights into the failure propagation mechanisms resulting from independent outages, we adopt a minimalistic model representing the components and their interdependencies by an undirected, unweighte...

The ongoing study has been vehemently allocated to propound an ameliorated α-weighted generalized approximation of arbitrary fuzzy number. This method sets out lessen the distance between original set and its approximation. In effort elaborate study, formulas are designed for computing by using a multitude examples. numerical samples will be exemplified illuminate improvement nearest triangular...