نتایج جستجو برای: n4

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

2010
Pieter-Jan Ceyssens Andrew Brabban Larissa Rogge Matthew Spooner Lewis Derek Pickard David Goulding Gordon Dougan Jean-Paul Noben Andrew Kropinski Elizabeth Kutter Rob Lavigne

We present a detailed analysis of the genome architecture, structural proteome and infection-related properties of three Pseudomonas phages, designated LUZ7, LIT1 and PEV2. These podoviruses encapsulate 72.5 to 74.9 kb genomes and lyse their host after 25 min aerobic infection. PEV2 can successfully infect under anaerobic conditions, but its latent period is tripled, the lysis proceeds far slow...

1997
Bas V. de Bakker Jan Smit

Here N2 is the number of triangles in the simplicial manifold consisting of N4 four-simplices and the topology is chosen to be that of S. (For more details see [1].) We recall that the system has two phases, a crumpled phase at low 2 and an elongated phase at high 2. The model is supposed to represent the quantum gravitational path integral over euclidean spacetimes weighted with the Regge-Eins...

G Ferns G Tabatabaei LA Latiff M Ghayour Mobarhan M Mazidi MH Soo Lee T Shafieian

Introduction: Children are one of the most vulnerable groups to sub-optimal nutritional intake in most societies. We have investigated some of the potential determinants of malnutrition in children of 2-5 years of age.   Methods and Materials: A cross sectional study was conducted to determine the relationship between nutritional status (weight for age, height for age and weight for height) and...

Journal: :Journal of the American Chemical Society 2007
Fangwei Shao Jacqueline K Barton

A cyclometalated complex of Ir(III) is covalently tethered to DNA oligonucleotides and serves as both a photooxidant and photoreductant in the study of DNA-mediated hole transport (HT) and electron transport (ET). Spectroscopic and melting temperature studies support intercalation of the tethered complex into the DNA duplex through the functionalized dppz ligand. Using these tethered assemblies...

Journal: :Value in health : the journal of the International Society for Pharmacoeconomics and Outcomes Research 2015
C Deger O Ozdemir B Eldem N Unlu M N Alp A O Saatci E Ozmert A K Altintas F Sermet E Erdal C Sar S Asan F Sumer E Parali O Ozel

Deger C1, Ozdemir O2, Eldem B3, Unlu N4, Alp MN5, Saatci AO6, Ozmert E7, Altintas KA8, Sermet F7, Erdal E1, Sar C1, Asan S1, Sumer F1, Parali E1, Ozel O1 1 Bayer Turk Kimya San. Ltd. Sti., Istanbul, Turkey, 2 Yorum Consultancy Ltd., Istanbul, Turkey, 3 Hacettepe University Faculty of Medicine, Ankara, Turkey, 4 Ankara Training & Research Hospital, Ankara, Turkey, 5 Ankara Numune Training & Rese...

1997
Hajo Broersma Ton Kloks Dieter Kratsch Haiko Müller

An asteroidal triple (AT) is a set of three vertices such that there is a path between any pair of them avoiding the closed neighborhood of the third. A graph is called AT-free if it does not have an AT. We show that there is an O(n4) time algorithm to compute the maximum weight of an independent set for AT-free graphs. Furthermore, we obtain O(n4) time algorithms to solve the independent domin...

2004
Branko Grünbaum

An (n4) configuration is a family of n points and n (straight) lines in the Euclidean plane such that each point is on precisely four of the lines, and each line contains precisely four of the points. A configuration is said to be connected if it is possible to reach every point starting from an arbitrary point and stepping to other points only if they are on one of the lines of the configurati...

2005
Aleksey Zinger

These notes are intended as an easy-to-read supplement to some of the background material presented in my talks on enumerative geometry. In particular, the numbers n3 and n4 of plane rational cubics through eight points and of plane rational quartics through eleven points are determined via the classical approach of counting curves. The computation of the latter number also illustrates my topol...

2014
Mikael Nilsson Jonas Kvarnström Patrick Doherty

Simple Temporal Networks with Uncertainty (STNUs) allow the representation of temporal problems where some durations are uncontrollable (determined by nature), as is often the case for actions in planning. It is essential to verify that such networks are dynamically controllable (DC) – executable regardless of the outcomes of uncontrollable durations – and to convert them to an executable form....

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

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