نتایج جستجو برای: surface characterization

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

Journal: :international journal of nano dimension 0
m. ghane department of microbiology, islamic azad university tonekabon branch ,tonekabon, iran. b. sadeghi department of chemistry, islamic azad university tonekabon branch, tonekabon, iran. a.r. jafari department of microbiology, islamic azad university tonekabon branch, tonekabon, iran. a.r. paknejhad department of physics, islamic azad university shabestar branch, iran.

in the present work, we report the synthesis of binary nano metal oxides such as zinc /copper oxide via novel dry synthetic methods such as thermal decomposition of oxalate precursor. the synthesis route involves facile solid-phase mechanochemical activation of a physical mixture of simple copper/zinc salts and oxalic acid, followed by calcination of the as-ground oxalate precursors at 450◦c. x...

2015
Chris N. Takahashi Aaron W. Miller Felix Ekness Maitreya J. Dunham Eric Klavins

Engineered biological circuits are often disturbed by a variety of environmental factors. In batch culture, where the majority of synthetic circuit characterization occurs, environmental conditions vary as the culture matures. Turbidostats are powerful characterization tools that provide static culture environments; however, they are often expensive, especially when purchased in custom configur...

2017
Konrad K. Dabrowski Vadim V. Lozin Daniël Paulusma

Daligault, Rao and Thomassé asked whether every hereditary graph class that is well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev (JCTB 2017+) gave a negative answer to this question, but their counterexample is a class that can only be characterised by infinitely many forbidden induced subgraphs. This raises the issue of whether the questio...

2008
Wayne Barrett Jason Grout

Abstract Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by exploring how some of these results over the finite field of order 2 extend to arbitrary fields and demonstrate that at least one third of the 62 ar...

Journal: :Advanced pharmaceutical bulletin 2013
Meesaraganda Sreedevi Aluru Raghavendra Guru Prasad Yadati Narasimha Spoorthy Lakshmana Rao Krishna Rao Ravindranath

PURPOSE This article makes an attempt to synthesize certain compounds containing thiazole and imidazole moieties and screen for the antimicrobial properties. METHODS The novel compounds synthesized were characterized by elemental analysis, IR and (1)HNMR spectral data. The antimicrobial activity of novel compounds was evaluated by cup plate method. RESULTS The compound p-t showed more antib...

Journal: :Discrete Mathematics 2002
Ralph J. Faudree Ronald J. Gould Michael S. Jacobson Linda M. Lesniak

In this paper we characterize those forbidden triples of graphs, no one of which is a generalized claw, su2cient to imply that a 2-connected graph of su2ciently large order is hamiltonian. c © 2002 Elsevier Science B.V. All rights reserved.

2003
Adrian Stoica Ricardo Salem Zebulum Xin Guo Didier Keymeulen Michael I. Ferguson Vu Duong

No silicon fabrication and characterization of circuits with topologies designed by evolution has been done before, leaving open questions about the feasibility of the evolutionary design approach, as well as on how highperformance, robust, or portable such designs could really be when implemented in hardware. This paper is the first to report on a silicon implementation of circuits evolved in ...

Journal: :Order 2016
Alan Shuchat Randy Shull Ann N. Trenk

A poset P = (X,≺) is a unit OC interval order if there exists a representation that assigns an open or closed real interval I(x) of unit length to each x ∈ P so that x ≺ y in P precisely when each point of I(x) is less than each point in I(y). In this paper we give a forbidden poset characterization of the class of unit OC interval orders and an efficient algorithm for recognizing the class. Th...

Journal: :Discrete Mathematics 2007
Elzbieta Sidorowicz

Let P be a hereditary property. Let kP(G) denote the number of forbidden subgraphs, which are contained in G. A graph G is said to be weakly P-saturated, if G ∈ P and the edges of the complement of G can be labelled e1, e2, . . . , el in such way that for i= 0, 1, . . . , l− 1 the inequality kP(Gi+1)> kP(Gi) holds, whereG0=G,Gi+1=Gi + ei andGl =Kn. The minimum possible size of weakly P-saturate...

2006
Mehdi Boukallel Maxime Girot Stéphane Régnier

This paper presents a fully automated microrobotic system based on force/vision referenced control designed for cell mechanical characterization. The design of the prototype combines Scanning Probe Microscopy (SPM) techniques with advanced robotics approaches. As a result, accurate and non-destructive mechanical characterization based on soft contact mechanisms are achieved. The in vitro workin...

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

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