نتایج جستجو برای: lobster claw syndrome

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

2013
Elizabeth A. Corey Yuriy Bobkov Kirill Ukhanov Barry W. Ache

The nature of the olfactory receptor in crustaceans, a major group of arthropods, has remained elusive. We report that spiny lobsters, Panulirus argus, express ionotropic receptors (IRs), the insect chemosensory variants of ionotropic glutamate receptors. Unlike insects IRs, which are expressed in a specific subset of olfactory cells, two lobster IR subunits are expressed in most, if not all, l...

Journal: :بینا 0
علی غلامی­نژاد a gholaminejad تهران- خیابان ولی عصر- خیابان بابک بهرامی- پلاک 6- کلینیک چشم پزشکی نور- کدپستی 55751-19686 حسن هاشمی h hashemi تهران- خیابان ولی عصر- خیابان بابک بهرامی- پلاک 6- کلینیک چشم پزشکی نور- کدپستی 55751-19686 سهیل علی­اکبری s aliakbari دانشگاه علوم پزشکی تهران

purpose: to evaluate the predictability, efficacy, and safety of iris-claw artisanô phakic intraocular lenses ­for myopia. methods: through a prospective clinical study, 35 eyes of 21 patients with myopia from -5 to 26.5 diopters underwent implantation of the artisan lens. patients were examined 1, 3, and 7 days (all eyes); 1 month (28 eyes), 3 months (29 eyes), and 6 months (32 eyes) after the...

2011
M. Enokida Y. Sasaki Y. Hoshino H. Saito Y. Koketsu

Article history: Received 7 May 2010 Received in revised form 13 September 2010 Accepted 18 September 2010 Claw lesions in lactating sows on 3 commercial farms were assessed in 6 areas of each of a sow's 8 claws to investigate the relationship between claw lesions and stage of lactation. In addition, the relationships between claw lesions and postural behavior, reproductive performance or culli...

Journal: :CoRR 2015
Paolo Nobili Antonio Sassano

A claw-free graph G(V,E) is said to be basic if there exists a matching M ⊆ E whose edges are strongly bisimplicial and such that each connected component C of G − M is either a clique or a {claw, net}-free graph or satisfies α(G[C \ V (M)]) ≤ 3. The Maximum Weight Stable Set (MWSS) Problem in a basic claw-free graph can be easily solved by first solving at most four MWSS problems in each conne...

2010
Jackie Locke Stuart A Baird Jamie Frankis

BACKGROUND In order to facilitate normal gait, toes require to be in a rectus position during the propulsive phase. This requires a correct balance and sequence of activity of the intrinsic musculature of the feet. Alteration of this balance and sequence may lead to the development of claw toes. Atrophy of the lumbricals occurs in the development of claw toes, but it is not known if changes occ...

Journal: :Jurnal Hukum Ekonomi Syariah 2023

Penelitian ini menjelaskan ekploitasi lobster di Kabupaten Simeulue dalam perspektif maqashid al-syariah. Lobster merupakan sumber daya alam hewani yang bermanfaat bagi manusia baik sebagai protein maupun pendapatan (ekonomi). salah satu komoditas banyak diminati, kancah bisnis lobster, menyasar pangsa pasar lokal dan dunia. dianggap punah jika ada penangkapan ikan terus menerus tidak mempertim...

Journal: :Discussiones Mathematicae Graph Theory 2005
Shinya Fujita

Let G be a graph with |V (G)| ≥ 10. We prove that if both G and G are claw-free, then min{∆(G), ∆(G)} ≤ 2. As a generalization of this result in the case where |V (G)| is sufficiently large, we also prove that if both G and G are K1,t-free, then min{∆(G), ∆(G)} ≤ r(t− 1, t)− 1 where r(t− 1, t) is the Ramsey number.

2012
Daniel W. Cranston Landon Rabern

We prove that every claw-free graph G that does not contain a clique on ∆(G) ≥ 9 vertices can be ∆(G)− 1 colored.

2014
Henning Bruhn Oliver Schaudt

A graph is called t-perfect if its stable set polytope is defined by nonnegativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.

Journal: :Discrete Mathematics 2001
Xiaotao Cai Warren E. Shreve

For any natural number k, a graph G is said to be pancyclic mod k if it contains a cycle of every length modulo k. In this paper, we show that every K1,4-free graph G with minimum degree δ(G) ≥ k+ 3 is pancyclic mod k and every claw-free graph G with δ(G) ≥ k+ 1 is pancyclic mod k, which confirms Thomassen’s conjecture [8] for claw-free graphs.

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

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