Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 227 )

2018 ( 334 )

2017 ( 358 )

2016 ( 547 )

Custom range...

Search Results: 1 - 10 of 249547 matches for " James R. Currie Jr. "
All listed articles are free for downloading (OA Articles)
Page 1 /249547
Display every page Item
Electronic Transport Mechanisms in PVDF/ZnO Nanocomposite Films  [PDF]
Bir B. Bohara, Ashok K. Batra, James R. Currie Jr.
Open Access Library Journal (OALib Journal) , 2019, DOI: 10.4236/oalib.1105707
In this report, we present fundamental DC conduction mechanisms of pol-yvinyl difluoride/nano-zinc oxide (PVDF/ZnO) composite films. Nano-composite films of zinc oxide in the PVDF matrix have been fabricated via a solution casting method. Space charge limited conduction (SCLC) was found to be a prominent conduction mechanism in higher voltage region and Schottky- Richardson mechanism was a possible conduction mechanism in a higher temperature region. DC activation energy for composites was found to decrease with increasing concentration of ZnO nanoparticles and reduced graphene oxide (RGO) with 1.41 eV (9.9 wt%), 1.04 eV (33.33 wt%), and 0.95 eV (33.33 wt% RGO), respectively.
Characteristics of Nanoparticles-Based Chemical Sensors  [PDF]
Jason Stephens, A. K. Batra, James R. Currie
Materials Sciences and Applications (MSA) , 2012, DOI: 10.4236/msa.2012.37063
Abstract: Semiconducting nanoparticle tin oxide-based sensors have been prepared with a pressure load of 4, 6, 8, 10 tons and reinforced with carbon nanofibers (CNF) in SnO2 matrix. The SnO2/CNF sensor’s sensitivity for ethyl alcohol has in-creased by a factor of two, in compared with that of pure SnO2 8-ton pressed sensor with lower response time. These results open the way towards further optimized lower cost CNF nanocomposite sensors as compared with expensive tin oxide/carbon nanotubes sensors.
Existence, multiplicity, and bifurcation in systems of ordinary differential equations
James R. Ward Jr.
Electronic Journal of Differential Equations , 2007,
Abstract: We prove new non-resonance conditions for boundary value problems for two dimensional systems of ordinary differential equations. We apply these results to the existence of solutions to nonlinear problems. We then study global bifurcation for such systems of ordinary differential equations Rotation numbers are associated with solutions and are shown to be invariant along bifurcating continua. This invariance is then used to analyze the global structure of the bifurcating continua, and to demonstrate the existence of multiple solutions to some boundary value problems.
Which Primates Recognize Themselves in Mirrors?
James R. Anderson,Gordon G. Gallup Jr
PLOS Biology , 2012, DOI: 10.1371/journal.pbio.1001024
Which Primates Recognize Themselves in Mirrors?
James R. Anderson ,Gordon G. Gallup Jr
PLOS Biology , 2011, DOI: 10.1371/journal.pbio.1001024
Recurrent words with constant Abelian complexity
James Currie,Narad Rampersad
Mathematics , 2009,
Abstract: We prove the non-existence of recurrent words with constant Abelian complexity containing 4 or more distinct letters. This answers a question of Richomme et al.
Dejean's conjecture holds for n>=27
James Currie,Narad Rampersad
Computer Science , 2009,
Abstract: We show that Dejean's conjecture holds for n>=27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible.
Pattern avoidance with involution
James D. Currie
Computer Science , 2011,
Abstract: We give the avoidance indices (morphic and antimorphic) for all unary patterns with involution.
There are k-uniform cubefree binary morphisms for all k >= 0
James Currie,Narad Rampersad
Computer Science , 2008,
Abstract: A word is cubefree if it contains no non-empty subword of the form xxx. A morphism h : Sigma^* -> Sigma^* is k-uniform if h(a) has length k for all a in Sigma. A morphism is cubefree if it maps cubefree words to cubefree words. We show that for all k >= 0 there exists a k-uniform cubefree binary morphism.
Infinite ternary square-free words concatenated from permutations of a single word
James D. Currie
Computer Science , 2012,
Abstract: We answer a question of Harju: An infinite square-free ternary word with an $n$-stem factorization exists for any $n\ge 13$. We show that there are uniform ternary morphisms of length $k$ for every $k\ge 23$. This resolves almost completely a problem of the author and Rampersad.
Page 1 /249547
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.