Let M = {v1, v2 ... vl} be an ordered set of vertices in a graph G. Then (d(u, v1), d(u, v2) ... d(u, vl)) is called the M-location of a vertex u of G. The set M is called a locating set if the vertices of G have distinct M-locations. A minimum locating set is a set M with minimum cardinality. The cardinality of a minimum locating set of G is called Location Number L(G). This concept has wide a...

Type-I quantum defects are considered in the context of the glN spin chain. The type-I defects are associated to the generalized harmonic oscillator algebra, and the chosen defect matrix is the one of the vector non-linear Schrödinger (NLS) model. The transmission matrices relevant to this particular type of defects are computed via the Bethe ansatz methodology.

The robust p-median problem in changing networks is a version of known discrete p-median problem in network with uncertain edge lengths where uncertainty is characterised by given interval. The uncertainty in edge lengths may appear in travel time along the edges in any network location problem. Several possible future scenarios with respect to the lengths of edges are presented. The planner wi...

This paper presents a new independency metric for blind source separation (BSS) problem. It is mathematically proved that the metric value of any linear combination of source signals is less than the largest one of sources under a loose condition. Further, the global optimization of this new metric is achieved by formulating it as a generalized eigenvalue problem. Subsequently, we guarantee to ...

Global Navigation Satellite System (GNSS) carrier phase ambiguity resolution is the process of resolving the carrier phase ambiguities as integers. It is the key to fast and high precision GNSS positioning and it applies to a great variety of GNSS models which are currently in use in navigation, surveying, geodesy and geophysics. A new principle of carrier phase ambiguity resolution is introduc...

This paper explains the relation between the fusion product of symmetric power sln evaluation modules, as defined by Feigin and Loktev, and the graded coordinate ring Rμ which describes the cohomology ring of the flag variety Flμ′ of GLN . The graded multiplicity spaces appearing in the decomposition of the fusion product into irreducible sln-modules are identified with the multiplicity spaces ...

The optimal design of multicontaminant industrial water networks according to several objectives is carried out in this paper. The general formulation of the water allocation problem (WAP) is given as a set of nonlinear equations with binary variables representing the presence of interconnections in the network. For optimization purposes, three antagonist objectives are considered: F(1), the fr...

We present a mechanism which transparently enhances service invocations by contextual data (e.g., location / positioning data gained through other information that is accessible within the invocation chain): the context is applied and extracted in a way such that the called service(s) can be completely agnostic to the intricacies of context encoding, transmission, and processing. This is partic...

Voume 6 • Issue 1 • 1000356 Dentistry ISSN: 2161-1122 Dentistry, an open access journal *Corresponding author: Seigo Ohba, DDS, PhD, FIBCSOMS, Department of Regenerative Oral Surgery, Unit of Translational Medicine, Graduate School of Biochemical Science, Nagasaki University, 1-7-1 Sakamoto, Nagasaki 852-8588, Japan, Tel: 81 958197704; Fax: 81 958197705; E-mail: [email protected]/ sohba@nagas...

The robber locating game, introduced by Seager in [8], is a variation of the classic cops and robbers game on a graph. A cop attempts to locate an invisible robber on a graph by probing a single vertex v each turn, from which the cop learns the robber’s distance. The robber is then permitted to stay at his current vertex or move to an adjacent vertex other than v. A graph is locatable if the co...