A simple method that incorporates coupling between bath and system and between individual bath modes is proposed. In Ž . the new locally propagating gaussian LPG approximation, the bath is modeled by Gaussians at each system site that propagate in time. Each site couples to others by the overlap of their Gaussians. In a test case with weak but non-negligible coupling, LPG is nearly as rapid as ...

Recently we presented a method for modeling a quantum system to a bath that explicitly correlates the system with the individual bath modes. We do this through representation of the bath by locally propagating Gaussians (LPG), which change in position and momentum but remain Gaussian in form. The explicit correlation of the system to the bath modes enters through the simultaneous use of a di†er...

The ambient index and temperature effects on the spectral profiles of two sets of long period gratings (LPGs) of different periods were investigated. The shorter period LPGs were found to be more sensitive than the longer period LPGs over identical ambient index ranges but less sensitive over identical temperature ranges. The coupling wavelength shifts due to temperature are also seen to be lin...

In this paper, we explore the interaction between taxation and local public good (LPG) and how it impacts the spatial pattern in the framework of new economic geography (NEG). In the benchmark case of a pure LPG, the system displays a similar location pattern to the existing NEG taxation model, although the tax reduces the market size of manufactured goods. However, when we consider the inheren...

A graph G is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (lu, lv) ≤ dmax where dT (lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this paper we analyze...

A graph G = (V, E) is called a pairwise compatibility graph (PCG) if there exists a tree T , a positive edge-weight function w on T , and two non-negative real numbers dmin and dmax, dmin ≤ dmax, such that V coincides with the set of leaves of T , and there is an edge (u, v) ∈ E if and only if dmin ≤ dT,w(u, v) ≤ dmax where dT,w(u, v) is the sum of the weights of the edges on the unique path fr...

A graph G = (V, E) is called a pairwise compatibility graph (PCG) if there exists a tree T , a positive edge-weight function w on T , and two non-negative real numbers dmin and dmax, dmin ≤ dmax, such that V coincides with the set of leaves of T , and there is an edge (u, v) ∈ E if and only if dmin ≤ dT,w(u, v) ≤ dmax where dT,w(u, v) is the sum of the weights of the edges on the unique path fr...