BACKGROUND AND OBJECTIVES: This study aims down to evaluate the ability of chloride magnesium- aluminium- layered double hydroxides (4:1) for nitrate adsorption from the soil solution in successive cropping periods. METHODS: The study was conductedunder long-term cropping periods, including first crop): bell pepper; second crop: mentheae; third crop: cher...

In this paper an uncapacitated multiple allocation p-hub median problem is discussed. The model minimizes the transportation cost based on inventory service level at hubs through double paths between hubs. Inventory service level is defined as the percent of inventory shortage of vehicles at hubs according to passengers demand and replenishment time of vehicles. A real data from 25 nodes of mun...

Abstract The spontaneous emission spectrum from a driven three-level atom placed inside a double-band photonic crystal has been investigated. We use the model which assumes the upper levels of the atomic transition are coupled via a classical driving field. The transition from one of the upper levels to lower level couples to the modes of the modified reservoir, and the transition from the oth...

The purpose of this paper is to analyze the effect of a particular control doctrine applied to the service mechanism of a queuing process with lapse. It is assumed that the service discipline is FCFS (first come, first served), arrival process is Poisson, service time distribution is exponential, service process is one phase and the capacity is infinite. It is also assumed that the customer may...

We derive a free boson representation of the Yangian double DY~(slN ) with arbitrary level k using the observation that there is a correspondence between the q-affine algebra and Yangian double associated with the same Cartan matrix. Vertex operator and screening currents are not obtained in the same way. Date: January 1997. 0 FREE BOSON REPRESENTATION OF YANGIAN DOUBLE 1

let g be a graph with p vertices and q edges and a = {0, 1, 2, . . . , [q/2]}. a vertex labeling f : v (g) → a induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. for a ∈ a, let vf (a) be the number of vertices v with f(v) = a. a graph g is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in a, |vf (a) − vf (b)| ≤ 1 and the in...