cdse nanostructures were synthesized by using green chemical route as starch was used as capping agent. xrd, hr-tem, sead, uv and pl studies were made for structural and optical properties of the prepared sample. film morphology and the thickness measurement of n-cdse were carried out with afm analysis. i-v characteristics curve of this junction confirmed the formation of schottky contact betwe...

This paper presents an in situ operando approach that allows characterization of lithium-ion battery electrodes. A MEMS sensor is designed and integrated with a commercially available Raman spectroscope to enable monitoring the stress and structural changes in the electrodes. An interferometric method with an enhanced image processing algorithm is applied for analyzing the crystal phase-depende...

Glycosaminoglycans (GAGs) are a class of biologically important molecules, and their structural analysis is the target of considerable research effort. Advances in tandem mass spectrometry (MS/MS) have recently enabled the structural characterization of several classes of GAGs; however, the highly sulfated GAGs, such as heparins, have remained a relatively intractable class due their tendency t...

In this paper, we explore the effects of certain forbidden substructure conditions on preordered sets. In particular, we characterize in terms of these conditions those preordered sets which can be represented as the supremum of a well-ordered ascending chain of lowersets whose members are constructed by means of alternating applications of disjoint union and ordinal sums with chains. These dec...

Biosurfactants can be classified by their chemical composition and their origin. This review briefly describes various classes of biosurfactants based on their origin and introduces a few of the most widely used biosurfactants. The current status and future trends in biosurfactant production are discussed, with an emphasis on those derived from plants. Following a brief introduction of the prop...

The graph theoretic problem of identifying the finite sets C of constraint graphs for which there is a countable universal C-free graph is closely related to the problem of determining for which sets C the model companion T ∗ C of the theory of C-free graphs is א0-categorical, and this leads back to combinatorics. Little is known about these theories from any other perspective, such as stabilit...

The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs has remained an open question for a long time. The minimal strongly imperfect graphs which are simultaneous imperfect are only odd holes and odd antiholes ( E. Olaru, [9]), but the entire list is not known, in spite of a lot of particular results in this direction. In this paper we give some new ...

Let L3 be the class of edge intersection graphs of linear 3-uniform hypergraphs. The problem of recognizing G ∈ L3 is NP-complete. Denote by δALG the minimal integer such that the problem ”G ∈ L3 ” is polynomially solvable in the class of graphs G with the minimal vertex degree δ(G) ≥ δALG and by δFIS the minimal integer such that L3 can be characterized by a finite list of forbidden induced su...