Let c be a proper k-coloring of a connected graph G. Let Π = {S1, S2, . . . , Sk} be the induced partition of V (G) by c, where Si is the partition class having all vertices with color i. The color code cΠ(v) of vertex v is the ordered k-tuple (d(v, S1), d(v, S2), . . . , d(v, Sk)), where d(v, Si) = min{d(v, x)|x ∈ Si}, for 1 ≤ i ≤ k. If all vertices of G have distinct color codes, then c is ca...

Purpose – The purpose of this paper is to develop a facade for seamlessly using locating services and enabling easy development of an application with indoor and outdoor location information without being aware of the difference of individual services. To achieve this purpose, in this paper, a unified locating service, called KULOCS (Kobe-University Unified LOCating Service), which horizontally...

A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V \ C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, l...

This work leans more towards the analytical side, focusing on providing a detailed discussion and derivation of the process that leads to the above-mentioned curves. Before going any further, it would be helpful to touch on some of the relevant works and their relation to our objectives. There are at least two issues that surround the WACC and/or the WACC curve. Firstly, how accurately can the ...

This paper proposes an algorithm for optimal placement of FACTS devices in transmission line to maintain the power system voltage stability and optimal sizing of the FACTS device. The aim of this paper is to improve voltage stability and reduce the total power losses. Here, voltage stability means no variation in the voltages of each bus beyond its boundaries and system stability is the ability...

Locating good design solutions within a sequential process environment is necessary to improve the quality and overall productivity of the processes. Multi-objective, multi-stage sequential process design is a complex problem involving large number of design variables and sequential relationship between any two stages. The aim of this paper is to propose a novel framework to handle real-life se...

We improve the analysis made in Chang et al (2011), by exploring the possibilities for the raise of global indeterminacy via a Shilnikov saddle-node bifurcation on an invariant circle. This allows us to better understand the determinants for the emergence of endogenous fluctuations in a monetary policy model, and to explain the existence of irregular patterns. Hence, the economy may start at so...

In most cases, it is considerably difficult to directly measure structural vibration with a lot of sensors because of complex geometry, time and equipment cost. For this reason, this paper deals with the problem of locating sensors on a plate model by four advanced sensor placement optimization (S.P.O) techniques. It also suggests the evaluation index representing the characteristic of orthogon...

The unequal area facility design problem has been studied in the literature generally by considering block layout separate from detailed design. This paper shows a tractable method for concurrently optimizing department shape and location within the facility, and selection of the appropriate number of input/output (I/O) stations per department and then optimally locating them. The distance metr...

We are interested in computation of locating arbitrage in financial markets with frictions. We consider a model with a finite number of financial assets and a finite number of possible states of nature. We derive a negative result on computational complexity of arbitrage in the case when securities are traded in integer numbers of shares and with a maximum amount of shares that can be bought fo...