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

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

2012
Van Bang Le Dieter Rautenbach

We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratic-time algorithm that decides if a given interval graph admits such an intersection representation.

Journal: :Discrete Mathematics & Theoretical Computer Science 2007
Van Bang Le H. N. de Ridder

An undirected graph G = (V, E) is a probe split graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E′ ⊆ N ×N such that G′ = (V, E ∪ E′) is a split graph. Recently Chang et al. gave an O(V (V +E)) time recognition algorithm for probe split graphs. In this article we give O(V 2 +V E) time recognition algorithms and charac...

Journal: :JDCTA 2009
Reza Ebrahimpour Mohammad R. Moradian Alireza Esmkhani Farzad M. Jafarlou

A method for recognition of Persian handwritten digits based on characterization loci and mixture of experts is proposed. This method utilizes the characterization loci, as the main feature. In the classification stage of our proposed method the mixture of experts are applied. This recognition method is applied to Farsi hand-written digits in the HODA database. The experimental results support ...

Journal: :J. Comb. Theory, Ser. A 2011
Suho Oh

Recently Postnikov gave a combinatorial description of the cells in a totallynonnegative Grassmannian. These cells correspond to a special class of matroids called positroids. We prove his conjecture that a positroid is exactly an intersection of permuted Schubert matroids. This leads to a combinatorial description of positroids that is easily computable. The main proof is purely combinatorial,...

2007
Ming C. Wu

Optoelectronic tweezers is a new technique to trap and manipulate particles with sizes ranging from tens of nanometers to hundreds of micrometers. Using optically-controlled dielectrophoretic force on a photoconductive electrode, optoelectronic tweezers enables complex, dynamic manipulation functions using light intensities up to 100,000 times lower than that of conventional laser tweezers. © 2...

Journal: :ACS nano 2014
Sidong Lei Liehui Ge Sina Najmaei Antony George Rajesh Kappera Jun Lou Manish Chhowalla Hisato Yamaguchi Gautam Gupta Robert Vajtai Aditya D Mohite Pulickel M Ajayan

Atomic layers of two-dimensional (2D) materials have recently been the focus of extensive research. This follows from the footsteps of graphene, which has shown great potential for ultrathin optoelectronic devices. In this paper, we present a comprehensive study on the synthesis, characterization, and thin film photodetector application of atomic layers of InSe. Correlation between resonance Ra...

Journal: :Journal of the American Chemical Society 2009
Ravuri S K Kishore Oksana Kel Natalie Banerji Daniel Emery Guillaume Bollot Jiri Mareda Alberto Gomez-Casado Pascal Jonkheijm Jurriaan Huskens Plinio Maroni Michal Borkovec Eric Vauthey Naomi Sakai Stefan Matile

In this study, we describe synthesis, characterization, and zipper assembly of yellow p-oligophenyl naphthalenediimide (POP-NDI) donor-acceptor hybrids. Moreover, we disclose, for the first time, results from the functional comparison of zipper and layer-by-layer (LBL) assembly as well as quartz crystal microbalance (QCM), atomic force microscopy (AFM), and molecular modeling data on zipper ass...

Journal: :Discrete Mathematics 2016
Simeon Ball Valentina Pepe

We show that the norm graph constructed in [13] with n vertices about 1 2n 2−1/t edges, which contains no copy of Kt,(t−1)!+1, does not contain a copy of Kt+1,(t−1)!−1.

Journal: :Discrete Mathematics 1997
Vassilis Giakoumakis

In this paper we investigate the closure ~-* under substitution-composition of a family of graphs ~,, defined by a set Lr of forbidden configurations. We first prove that ~-* can be defined by a set L~* of forbidden subgraphs. Next, using a counterexample we show that ~* is not necessarily a finite set, even when .~ is finite. We then give a sufficient condition for ~* to be finite and a simple...

Journal: :Mathematical Social Sciences 2014
Oliver Walker

Logical structures for modeling agents’ reasoning about unawareness are presented where it can hold simultaneously that: (i) agents’ beliefs about whether they are fully aware need not be veracious with partitional information; and (ii) the agent is fully aware if and only if she is aware of a fixed domain of formulae. In light of (ii), all states are deemed “possible”. Semantics operate in two...

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

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