Introduction The purpose of this study was to evaluate the effectiveness of Bt corn, with and without soil insecticides, for management of corn rootworm. Evaluation of Bt hybrids included Agrisure 3000GT, Agrisure 3122 RIB, DeKalb YieldGard VT3, and Pioneer Optimum AcreMax1. Soil insecticides evaluated were Aztec 2.1G, Aztec-SB 4.67G, Capture LFR 1.5SC, Counter-SB 20G, Force 250CS, and SmartCho...

In 1954, Tutte conjectured that every bridgeless graph has a nowherezero 5-flow. Let ω be the minimum number of odd cycles in a 2-factor of a bridgeless cubic graph. Tutte’s conjecture is equivalent to its restriction to cubic graphs with ω ≥ 2. We show that if a cubic graph G has no edge cut with fewer than 5 2ω − 1 edges that separates two odd cycles of a minimum 2-factor of G, then G has a n...

A novel stability indicating liquid chromatographic method was developed for the determination of Cefditoren pivoxil in presence of degradation products using Zorbax SB C18 (150 mm × 4.6 mm i.d., 3.5 μm particle size) column with a flow rate 1.0 mL/min (UV detection 210 nm). Linearity was observed over a concentration range 0.1–200 μg/mL with regression equation y = 34809 x + 30603 (R = 0.9994)...

For any graphG, letW (G) be the set of vertices inG of degrees larger than 3. We show that for any bridgeless graph G, if W (G) is dominated by some component of G−W (G), then F (G,λ) has no roots in (1, 2), where F (G,λ) is the flow polynomial of G. This result generalizes the known result that F (G,λ) has no roots in (1, 2) whenever |W (G)| 6 2. We also give some constructions to generate gra...

A graph G = (V,E) has a nowhere-zero k-flow if there exists an orientation H = (V,A) of G and an integer flow φ : A → Z such that for all a ∈ A, 0 < |φ(a)| < k. A (1, 2)-factor of G is a set F ⊆ E such that the degree of any vertex v in the subgraph induced by F , denoted by dF (v), is 1 or 2. The main result of this work is the following. A bridgeless cubic graph G has a nowhere-zero 5-flow if...

A cut edge in a graph G is an edge whose removal increases the number of connected components of G. In this paper we determine the maximum number of cut edges in a connected d-regular graph G of order p.

At the National Institute of Metrological Research (INRIM), a Hamon guarded 10×100 M network was developed to improve the traceability levels of dc resistance at 1 G level. Utilizing and revisiting this project, a Hamon 10×10 G network is developed to extend the capabilities of the Hamon scaling technique up to 100 G . The novelty of the 10× 10 G network is its improved guard system, and the im...

The Rockefeller University Press $30.00 J. Cell Biol. Vol. 206 No. 1 129–143 www.jcb.org/cgi/doi/10.1083/jcb.201310117 JCB 129 Correspondence to Nicolas T. Chartier: [email protected]; or JeanClaude Labbé: [email protected] A.S. Maddox’s present address is Dept. of Biology, The University of North Carolina at Chapel Hill, 408 Fordham Hall, Chapel Hill, NC, 27599. N.T. Chartier’s prese...

In this work we present the λ-coordinates, a new system for representing points in binary elliptic curves. We also provide efficient elliptic curve operations based on the new representation and timing results of our software implementation over the field F2254 . As a result, we improved the known speed records for protected/unprotected single/multi-core software implementations of the random-p...