In this paper, we present an analysis for an queue with balking and state-dependent service. By using the block matrix solution, we first deduce the matrix form iterative formula of the steady-state probability. We also derive some performance measures of the system. Based on these performance analyses, we develop a cost model to determine numerically the system’s optimal cost and critical value. Finally, we perform a sensitivity analysis through numerical experiments.
Li, Hui-Dong
Wang, Zhan-Hui
Weiland, Jan
Feng, Hao
Sun, Wei-Guo
It is crucial to increase the total stored energy by realizing the transition from a low confinement (L-mode) state to a high confinement (H-mode) state in magnetic confinement fusion. The L–H transition process is simulated by using the predictive transport code based on Weiland's fluid model. Based on the equilibrium parameters obtained from equilibrium fitting (EFIT) in the experiment, the electron density ne, electron temperature Te, ion temperatures Ti, ion poloidal Vp, and toroidal momenta Vt are simulated self-consistently. The L–H transition dynamic behaviors with the formation of the transport barriers of ion and electron temperatures, the electron density, and the ion toroidal momenta are analyzed. During the L–H transition, the strong poloidal flow shear in the edge transport barrier region is observed. The crashes of the electron and ion temperature pedestals are also observed during the L–H transition. The effects of the heating and particle sources on the L–H transition process are studied systematically, and the critical power threshold of the L–H transition is also found.
This article analyses H. L. A. Hart's concept of international law from the perspective of anaytical jurisprudence and in light of the state of contemporary international law. The article challenges Hart's view that international law is 'law' but not a 'legal system'. Hart arrives at this conclusion on the basis of a comparison of the international legal order with the municipal legal system. This comparison is distorted by Hart's general focus on private law and criminal law and becomes less convincing when constitutional law is added to the equation. As a consequence, Hart's methodological approach is inconsistent and should be modified. Rather than asking whether international law resembles municipal law in form, it should be asked whether international law encompasses legislative, executive, and judicative structures which are able to perform the same functions as the legal order of a nation state, and which thereby overcome the defects of a primitive social order. Against the background of this modified analytical framework, Hart's analysis is revisited in light of recent developments and changes in the structure of international law at the beginning of the 21st century.
Soininen, Tuula H
Jukarainen, Niko
Soininen, Pasi
Auriola, Seppo O K
Julkunen-Tiitto, Riitta
Oleszek, Wieslaw
Stochmal, Anna
Karjalainen, Reijo O
Vepsalainen, Jouko J
INTRODUCTION: Leek (Allium ampeloprasum var. porrum) is consumed as a vegetable throughout the world. However, little is known about the metabolites of leek cultivars, especially those with potentially important beneficial properties for human health.; OBJECTIVE: We provide new information for the overall metabolite composition of several leek cultivars grown in Europe by using HPLC-MS and (1) H NMR.; METHODS: The use of a novel CTLS/NMR (constrained total-line-shape nuclear magnetic resonance) approach was found to be capable of reliable quantification, even with overlapping metabolite signals in the (1) H NMR of plant metabolites. Additionally, a new application for leek flavonoids was optimised for HPLC-MS.; RESULTS: The total concentration of carbohydrates (glucose, fructose, kestose/nystose and sucrose) and nine amino acids varied by fourfold in leek juice from different cultivars, while the total concentrations of four organic acids were similar in all cultivars. All the quantified flavonols were kaempferol derivatives or quercetin derivatives and threefold differences in flavonol concentrations were detected between cultivars.; CONCLUSION: In this study, various phytochemical profiles were determined for several leek cultivars by (1) H NMR spectroscopy with CTLS combined with HPLC-MS. The wide variation in bioactive compounds among commercial leek cultivars offers promising opportunities for breeders to raise the levels of important biochemical compounds in leek breeding lines, and also provides some objective measure for quality assurance for the leek industry. Copyright =C2=A9 2014 John Wiley & Sons, Ltd.
Josep M. TRIGO-RODRÍGUEZ; Jordi LLORCA; Alan E. RUBIN; Jeffrey N. GROSSMAN; Derek W. G. SEARS; Mateo NARANJO; Stacy BRETZIUS; Mar TAPIA; Marino H. GUARÍN SEPÚLVEDA
Tiziana Calamoneri
Emanuele G. Fusco
Richard B. Tan and Paola Vocca
An L(h, 1, 1)-labeling of a graph is an assignment of labels from the set of integers {0, . . . , λ} to the nodes of the graph such that adjacent nodes are assigned integers of at least distance h ≥ 1 apart and all nodes of distance three or less must be assigned different labels. The aim of the L(h, 1, 1)-labeling problem is to minimize λ, denoted by λ h, 1, 1 and called span of the L(h, 1, 1)-labeling. As outerplanar graphs have bounded treewidth, the L(1, 1, 1)-labeling problem on outerplanar graphs can be exactly solved in O(n 3), but the multiplicative factor depends on the maximum degree Δ and is too big to be of practical use. In this paper we give a linear time approximation algorithm for computing the more general L(h, 1, 1)-labeling for outerplanar graphs that is within additive constants of the optimum values.
Given two non-negative integers h and k, an L(h, k)-labeling of a graph G = (V, E) is a function from the set V to a set of colors, such that adjacent nodes take colors at distance at least h, and nodes at distance 2 take colors at distance at least k. The aim of the L(h, k)-labeling problem is to minimize the greatest used color. Since the decisional version of this problem is NP-complete, it is important to investigate particular classes of graphs for which the problem can be efficiently solved. It is well known that the most common interconnection topologies, such as Butterfly-like, Bene, CCC, Trivalent Cayley networks, are all characterized by a similar structure: they have nodes organized as a matrix and connections are divided into layers. So we naturally introduce a new class of graphs, called (l x n)-multistage graphs, containing the most common interconnection topologies, on which we study the L(h, k)-labeling. A general algorithm for L(h, k)-labeling these graphs is presented, and from this method an efficient L(2, 1)-labeling for Butterfly and CCC networks is derived. Finally we describe a possible generalization of our approach.
N. Girszyn, F. Hé
ron, L. Lahaxe, H. Lé
vesque , I. Marie
Upper limb lymphedema occurs in 15 to 20%of patients after breast cancer treatment. Upper limb lymphedema without any history of neoplasia is an unusual situation. In this situation, breast cancer should be suspected.ExegesisWe reported two women, 53 and 67 years old, who developed upper limb lymphedema, 18 and 8 months before the diagnosis of breast cancer. In the two cases, clinical examination (breast and axillary palpation) was normal. In one case, mammography led to the diagnosis and in the other breast MRI was required to confirm the cancer.DiscussionUpper limb lymphedema may be the presenting clinical feature of breast cancer. Breast cancer should be actively sought despite normal clinical and radiological findings. Breast MRI is required in this situation.
Calamoneri, Tiziana
Caminiti, Saverio
Petreschi, Rossella
Olariu, Stephan
Given two nonnegative integers h and k, an L(h, k)-labeling of a graph G = (V, E) is a map from V to a set of integer labels such that adjacent vertices receive labels at least h apart, while vertices at distance at most 2 receive labels at least k apart. The goal of the L(h, k)-labeling problem is to produce a legal labeling that minimizes the largest label used. Since the decision version of the LA k)-labeling problem is NP-complete, it is important to investigate classes of graphs for which the problem can be solved efficiently. Along this line of thought, in this article we deal with co-comparability graphs, its subclass of interval graphs, and circular-arc graphs. To the best of our knowledge, ours is the first reported result concerning the L(h, k)labeling of co-comparability and circular-arc graphs. In particular, we provide the first algorithm to L(h, k)-label co-comparability, interval, and circular-arc graphs with a bounded number of colors. Finally, in the special case where k = 1 and G is an interval graph, our algorithm improves on the best previously-known ones using a number of colors that is at most twice the optimum. (C) 2008 Wiley Periodicals, Inc. NETWORKS, Vol. 53(1),27-34 2009