نتایج جستجو برای: global sepsis alliance gsa

تعداد نتایج: 500016  

2002
Timothy H. Dixon L. Hotaling E. Norabuena

doi: 10.1130/0091-7613(2003)031<0055:PAGPSE>2.0.CO;2 2003;31;55-58 Geology Timothy H. Dixon, E. Norabuena and L. Hotaling geodetic versus geologic fault slip rates in the Eastern California shear zone Paleoseismology and Global Positioning System: Earthquake-cycle effects and Email alerting services cite this article to receive free e-mail alerts when new articles www.gsapubs.org/cgi/alerts cli...

Journal: :Academic Medicine 1970

E. Salajegheh , M. Dehghani, M. Mashayekhi,

In this paper, for topology optimization of double layer grids, an efficient optimization method is presented by combination of Imperialist Competitive Algorithm (ICA) and Gravitational Search Algorithm (GSA) which is called ICA-GSA method. The present hybrid method is based on ICA but the moving of countries toward their relevant imperialist is done using the la...

Journal: :Electr. J. Comb. 2011
Xue-Gang Chen Wai Chee Shiu

A global defensive alliance in a graph G = (V,E) is a dominating set S satisfying the condition that for every vertex v ∈ S, |N [v] ∩ S| ≥ |N(v) ∩ (V − S)|. In this note, a new upper bound on the global defensive alliance number of a tree is given in terms of its order and the number of support vertices. Moreover, we characterize trees attaining this upper bound.

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1991
M A Smith B Grimm C G Kannangara D von Wettstein

Purified Synechococcus glutamate-1-semialdehyde aminotransferase (GSA-AT; EC 5.4.3.8) has absorption maxima characteristic of vitamin B6-containing enzymes and can be converted to the pyridoxamine 5'-phosphate or pyridoxal 5'-phosphate form by reaction with diaminovalerate or dioxovalerate, respectively, suggesting that these two analogues are intermediates in the conversion of glutamate 1-semi...

2012
Mustapha Chellali Lutz Volkmann

Let k ≥ 0 be an integer. A set S of vertices of a graph G = (V (G), E(G)) is called a global offensive k-alliance if |N(v) ∩ S| ≥ |N(v) − S| + k for every v ∈ V (G) − S, where 0 ≤ k ≤ ∆ and ∆ is the maximum degree of G. The global offensive k-alliance number γ o (G) is the minimum cardinality of a global offensive k-alliance in G. We show that for every bipartite graph G and every integer k ≥ 2...

Background Military conflict has been an ongoing determinant of inequitable immunisation coverage in many low- and middle-income countries, yet the impact of conflict on the attainment of global health goals has not been fully addressed. This review will describe and analyse the association between conflict, immunisation coverage and vaccine-preventable disease (VPD) outbreaks, along with...

Journal: :The Gerontologist 2016
John R Beard Alana M Officer Andrew K Cassels

Lead Authors Anthony Woolf, Bone and Joint Research Group, Royal Cornwall Hospital, UK; Chair, Global Alliance for Musculoskeletal Health Lyn March, Institute of Bone and Joint Research, University of Sydney, Australia; Chair, Global Alliance for Musculoskeletal Health Surveillance & Information Task Force; Member, International Coordinating Committee Alana Officer, Senior Health Advisor, Depar...

Journal: :Australasian J. Combinatorics 2010
Mustapha Chellali Lutz Volkmann

Let G be a simple graph with vertex set V (G). A non-empty set S ⊆ V (G) is a global strong offensive alliance if for every vertex v in V (G)−S, a strict majority of its closed neighborhood is in S. The global strong offensive alliance number γô(G) is the minimum cardinality of a global strong offensive alliance of G. We show that if G is a connected bipartite graph of order at least three, the...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید