Let F = fC 1 ; C 2 ; : : : ; C n g be a family of n disjoint convex bodies in the plane. We say that a set V of exterior light sources illuminates F, if for every boundary point u of any member of F there is a point v in V such that u is visible from v, i.e. the open line segment joining u and v is disjoint from F. An illumination system V is called primitive if no 1 2 Valeriu Soltan, LL aszll ...

A sensitive atmospheric pressure chemical ionization liquid chromatographic-mass spectrometric (APCI-LC-MS) assay with positive ion mode has been developed for the determination of nifedipine in human plasma. In this method, nifedipine was extracted from human plasma using diethyl ether with dimethoxanate as the internal standard. Analysis was achieved on a BDS C(18) column with methanol-H(2)O ...

We study the complexity of the problem MAX SOL which is a natural optimisation version of the graph homomorphism problem. Given a fixed target graph H with V (H) ⊆ N, and a weight function w : V (G) → Q, an instance of the problem is a graph G and the goal is to find a homomorphism f : G → H which maximises P v∈G f(v) · w(v). MAX SOL can be seen as a restriction of the MIN HOM-problem [Gutin et...

Let G = (V,E) be a graph. All graphs considered are simple, £nite and undirected. A grid drawing of G is an injective mapping θ : V → Z such that for all edges vw ∈ E and vertices x ∈ V , θ(x) ∈ θ(v)θ(w) implies that x = v or x = w, where ab denotes the line-segment with endpoints a and b. That is, a grid drawing of a graph represents each vertex by a distinct gridpoint in the plane, and each e...

We study the following basic problem called Bi-Covering. Given a graph GpV,Eq, find two (not necessarily disjoint) sets A Ď V and B Ď V such that A Y B “ V and that every edge e belongs to either the graph induced by A or to the graph induced by B. The goal is to minimize maxt|A|, |B|u. This is the most simple case of the Channel Allocation problem [13]. A solution that outputs V,H gives ratio ...

The following is a proof which is independent of this characterisation. First assume that ‖ ‖ is non-archimedean. Let x, y ∈ K. Using that ‖ ‖ extends | | we then obtain |x + y| = ‖x + y‖ ≤ max{‖x‖, ‖y‖} = max{|x|, |y|} which shows that | | is non-archimedean. Now assume that | | is non-archimedean. Let x, y ∈ K̂. Let ε > 0. Since K is dense in K̂ there exist u, v ∈ K such that ‖x − u‖ < ε and ‖y...

For distinct vertices u and v in a graph G, the connectivity between v, denoted $$\kappa _G(u,v)$$ , is maximum number of internally disjoint u–v paths G. The average $${\overline{\kappa }}(G),$$ taken over all unordered pairs u, Analogously, for directed D, from to _D(u,v)$$ D. }}(D)$$ ordered An orientation G obtained by assigning direction every edge let }}_{\max }(G)$$ denote among orientat...

OBJECTIVE To assess the significance of changes in respiratory muscle endurance in relation to respiratory and limb muscle strength in patients with mild to moderate chronic heart failure using a threshold loading technique. SUBJECTS 20 patients with chronic heart failure (17 male) aged 63.8 (SD 7.4) years and 10 healthy men aged 63.1 (5.6) years. Heart failure severity was New York Heart Ass...

The present study investigated whether blood lactate removal after supramaximal exercise and fatigue indexes measured during continuous and intermittent supramaximal exercises are related to the maximal muscle oxidative capacity in humans with different training status. Lactate recovery curves were obtained after a 1-min all-out exercise. A biexponential time function was then used to determine...

background: hypertensive patients are highly susceptible to oxidizability. although hypertension is common among iranians, few data are available about lipid oxidation status in the involved people. the aim of this study was to evaluate the relationship between serum lipids levels and susceptibility of lipids to oxidation in hypertensive patients. materials and method: fasting serum lipids and ...