Facet-to-facet Linking of Shape-anisotropic Colloidal Cadmium Chalcogenide Nanostructures
نویسندگان
چکیده
منابع مشابه
Facet evolution on supported nanostructures: Effect of finite height
Pak-Wing Fok,1,2 Rodolfo R. Rosales,3 and Dionisios Margetis4 1Applied and Computational Mathematics, California Institute of Technology, Pasadena, California 91125, USA 2Department of Biomathematics, University of California–Los Angeles, Los Angeles, California 90095, USA 3Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA 4Department of Mathe...
متن کاملOn the facet-to-facet property of solutions to convex parametric quadratic programs
In some of the recently-developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-facet property. It is shown by an example, whose solution is unique, that the facet-to-facet property does not hold in general. Consequently, som...
متن کاملNot Every GTSP Facet Induces an STSP Facet
The graphical traveling salesman problem (GTSP) has been studied as a variant of the classical symmetric traveling salesman problem (STSP) suited particularly for sparse graphs. In addition, it can be viewed as a relaxation of the STSP and employed for solving the latter to optimality as originally proposed by Naddef and Rinaldi. There is a close natural connection between the two associated po...
متن کاملResolutions of Facet Ideals
In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the concept of a tree in graph theory. We show that the Koszul homology of the facet ideal I of a tree is generated by the homology classes of monomial cycles, determin...
متن کاملAnother Facet of LIG
In this paper we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining grammars. For a LIG L and an input string x of length n, we build a non ambiguous context-free grammar whose sentences are all (and exclusively) valid derivation sequences in L which lead to x. We show that this grammar ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Visualized Experiments
سال: 2017
ISSN: 1940-087X
DOI: 10.3791/56009