نتایج جستجو برای: promoter optical characterization

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

2008
Nuh S. Yuksek Xinzhu Sang En-Kuang Tien Qi Song Feng Qian Ivan V. Tomov Ozdal Boyraz

Due to the high-index contrast between the silicon core and silica cladding, the silicon waveguide allows strong optical confinement and large effective nonlinearity, which facilitates low cost chip scale demonstration of all-optical nonlinear functional devices at relatively low pump powers. One of the challenges in ultrafast science is the full characterization of optical pulses in real time....

2006
Petr Šimeček

The paper shows that there is no finite set of forbidden minors which characterizes classes of independence models that are representable by Gaussian, discrete and binary distributions, respectively. In addition, a way to prove the nonexistence of a finite characterization for any other class of independence models is suggested. MSC 2000: 60A99, 68T30, 94A15

2015
Matthieu Dubarry Arnaud Devie

The contents of this report reflect the views of the authors, who are responsible for the facts and the accuracy of the information presented herein. This document is disseminated under the sponsorship of Centers Program in the interest of information exchange. UCF and the U.S. Government assumes no liability for the contents or use thereof.

Journal: :Australasian J. Combinatorics 2010
Y. M. Borse

In this paper, we obtain a forbidden-minor characterization of the class of binary gammoids M such that, for every pair of elements x, y of M, both the splitting matroid Mx,y and the element splitting matroid M ′ x,y are binary gammoids.

Journal: :Discrete Mathematics 2015
Premysl Holub Zdenek Ryjácek Ingo Schiermeyer

A connected edge-colored graphG is said to be rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors, and the rainbow connection number rc(G) ofG is the minimum number of colors that can make G rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that every connected F-free graph G with...

Journal: :Order 2013
Michael K. Kinyon Jonathan Leech

Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of forbidden subalgebras. We also consider the subclass of strictly categorical skew lattices.

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,...

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

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