Self-Absorption and Focusing Effects in Carrier Relaxation Dynamics under Depletion Conditions

The effect of a one-dimensional field (1) on the self-absorption characteristics and (2) when we have a finite numerical aperture for the objective lens that focuses the laser beam on the solid are considered here. Self-absorption, in particular its manifestation as an inner filter for the emitted signal, has been observed in luminescence experiments. Models for this effect exist and have been analyzed, but only in the absence of space charge. Using our previous results on minority carrier relaxation in the presence of a field, we obtain expressions incorporating inner filter effects. Focusing of a light beam on the sample, by an objective lens, results in a three-dimensional source and consequently a three-dimensional continuity equation to be solved for the minority carrier concentration. Assuming a one-dimensional electric field and employing Fourier-Bessel transforms, we recast the problem of carrier relaxation and solve the same via an identity that relates it to solutions obtained in the absence of focusing effects. The inner filter effect as well as focusing introduces new time scales in the problem of carrier relaxation. The interplay between the electric field and the parameters which characterize these effects and the consequent modulation of the intensity and time scales of carrier decay signals are analyzed and discussed.

Exceptional adhesive and gelling properties of fibrous nanoscopic tapes of self-assembled bipolar urethane amides of L-phenylalanine

Seven L-phenylalanine based alkyl (monopolar) and alkanediyl (bipolar) derivatives are synthesized; while the bipolar urethane amides form gels and show strong adhesive properties, the monopolar analogues form fibrous nanoscopic cloth-like tapes.

Macroporous metal oxide foams through self-sustained combustion reactions

A number of macroporous metal oxide foams were prepared through self-sustained combustion reactions starting from dough made of the corresponding metal nitrate, urea and starch. The nitrate ion acts as an oxidizing agent, urea as fuel and starch as an organic binder. The metal oxide foams are characterized by scanning electron microscopy and powder X-ray diffraction.

Self-Assembled Pd(II) Metallocycles Using an Ambidentate Donor and the Study of Square-Triangle Equilibria

The self-assembly reaction of a cis-blocked 90° square planar metal acceptor with a symmetrical linear flexible linker is expected to yield a [4 + 4] self-assembled square, a [3 + 3] assembled triangle, or a mixture of these.However, if the ligand is a nonsymmetrical ambidentate, it is expected to form a complex mixture comprising several linkage isomeric squares and triangles as a result of different connectivities of the ambidentate linker. We report instead that the reaction of a 90° acceptor cis-(dppf)Pd(OTf)2 [where dppf ) 1,1′-bis(diphenylphosphino)- ferrocene] with an equimolar amount of the ambidentate unsymmetrical ligand Na-isonicotinate unexpectedly yields a mixture of symmetrical triangles and squares in the solution. An analogous reaction using cis-(tmen)Pd(NO3)2 instead of cis-(dppf)Pd(OTf)2 also produced a mixture of symmetrical triangles and squares in the solution. In both cases the square was isolated as the sole product in the solid state, which was characterized by a single crystal structure analysis. The equilibrium between the triangle and the square in the solution is governed by the enthalpic and entropic contributions. The former parameter favors the formation of the square due to less strain in the structure whereas the latter one favors the formation of triangles due to the formation of more triangles from the same number of starting linkers. The effects of temperature and concentration on the equilibria have been studied by NMR techniques. This represents the first report on the study of square-triangle equilibria obtained using a nonsymmetric ambidentate linker. Detail NMR spectroscopy along with the ESI-mass spectrometry unambiguously identified the components in the mixture while the X-ray structure analysis determined the solid-state structure.

Efficient Output-Sensitive Construction of Reeb Graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these critical points in the second step to obtain the Reeb graph. A simplification mechanism based on topological persistence aids in the removal of noise and unimportant features. A radial layout scheme results in a feature-directed drawing of the Reeb graph. Experimental results demonstrate the efficiency of the Reeb graph construction in practice and its applications.

Impressive Gelation in Organic Solvents by Synthetic, Low Molecular Mass, Self-Organizing Urethane Amides of L-Phenylalanine

Synthetic routes leading to 12 L-phenylalanine based mono- and bipolar derivatives (1-12) and an in-depth study of their structure-property relationship with respect to gelation have been presented. These include monopolar systems such as N-[(benzyloxy)carbonyl]-L-phenylalanine-N-alkylamides and the corresponding bipolar derivatives with flexible and rigid spacers such as with 1,12-diaminododecane and 4,4'-diaminodiphenylmethane, respectively. The two ends of the latter have been functionalized with N-[(benzyloxy)carbonyl]-L-phenylalanine units via amide connection. Another bipolar molecule was synthesized in which the middle portion of the hydrocarbon segment contained polymerizable diacetylene unit. To ascertain the role of the presence of urethane linkages in the gelator molecule protected L-phenylalanine derivatives were also synthesized in which the (benzyloxy)carbonyl group has been replaced with (tert-butyloxy)carbonyl, acetyl, and benzoyl groups, respectively. Upon completion of the synthesis and adequate characterization of the newly described molecules, we examined the aggregation and gelation properties of each of them in a number of solvents and their mixtures. Optical microscopy and electron microscopy further characterized the systems that formed gels. Few representative systems, which showed excellent gelation behavior was, further examined by FT-IR, calorimetric, and powder X-ray diffraction studies. To explain the possible reasons for gelation, the results of molecular modeling and energy-minimization studies were also included. Taken together these results demonstrate the importance of the presence of (benzyloxy)carbonyl unit, urethane and secondary amide linkages, chiral purities of the headgroup and the length of the alkyl chain of the hydrophobic segment as critical determinants toward effective gelation.

On the cubicity of bipartite graphs

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k, where each R-i is a closed interval on the real line of the form [a(j), a(i), + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.

Cubicity of threshold graphs

We show that the cubicity of a connected threshold graph is equal to inverted right perpendicularlog(2) alpha inverted left perpendicular, where alpha is its independence number.

2.5-dimensional solution of the advective accretion disk:a self-similar approach

We provide a 2.5-dimensional solution to a complete set of viscous hydrodynamical equations describing accretion- induced outflows and plausible jets around black holes/compact objects. We prescribe a self-consistent advective disk-outflow coupling model, which explicitly includes the information of vertical flux. Inter-connecting dynamics of an inflow-outflow system essentially upholds the conservation laws. We provide a set of analytical family of solutions through a self-similar approach. The flow parameters of the disk-outflow system depend strongly on the viscosity parameter α and the cooling factor.

Synthesis and characterisation of heterometallic molecular triangles using ambidentate linker: self-selection of a single linkage isomer

The coordination driven self-assembly of discrete molecular triangles from a non-symmetric ambidentate linker 5-pyrimidinecarboxylate (5-pmc) and Pd(II)/Pt(II) based 90◦ acceptors is presented. Despite the possibility of formation of a mixture of isomeric macrocycles (linkage isomers) due to different connectivity of the ambidentate linker, formation of a single and symmetrical linkage somer in both the cases is an interesting observation. Moreover, the reported macrocycles represent the first example of discrete metallamacrocycles of bridging 5-pmc. While solution composition in both the cases was characterised by multinuclear NMR study and electrospray ionization mass spectrometry (ESI-MS), the identity of the assemblies in the solid state was established by X-ray single crystals structure analysis. Variable temperature NMR study clearly ruled out the formation of any other macrocycles by [4 + 4] or [2 + 2] self-assembly of the reacting components.

Characterisation of k-Variegated Graphs, k greater-than-or-equal-to 3

A graph is said to be k-variegated if its vertex set can be partitioned into k equal parts such that each vertex is adjacent to exactly one vertex from every other part not containing it. Bednarek and Sanders [1] posed the problem of characterizing k-variegated graphs. V.N. Bhat-Nayak, S.A. Choudum and R.N. Naik [2] gave the characterization of 2-variegated graphs. In this paper we characterize k-variegated graphs for k greater-or-equal, slanted 3.

A comparative study of side-band Fresnel holograms recorded with self-imaging and general objects

This paper deals with new results obtained in regard to the reconstruction properties of side-band Fresnel holograms (SBFH) of self-imaging type objects (for example, gratings) as compared with those of general objects. The major finding is that a distribution I2, which appears on the real-image plane along with the conventional real-image I1, remains a 2Z distribution (where 2Z is the axial distance between the object and its self-imaging plane) under a variety of situations, while its nature and focusing properties differ from one situation to another. It is demonstrated that the two distributions I1 and I2 can be used in the development of a novel technique for image subtraction.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

Efficient algorithms for computing Reeb graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(nlogn+nlogg(loglogg)3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. We extend this algorithm to construct Reeb graphs of d-manifolds in O(nlogn(loglogn)3) time, where n is the number of triangles in the simplicial complex that represents the d-manifold. Our result is a significant improvement over the previously known O(n2) algorithm. Finally, we present experimental results of our implementation and demonstrate that our algorithm for 3-manifolds performs efficiently in practice.

On the Cubicity of Interval Graphs

A k-cube (or ``a unit cube in k dimensions'') is defined as the Cartesian product R-1 x . . . x R-k where R-i (for 1 <= i <= k) is an interval of the form [a(i), a(i) + 1] on the real line. The k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that the k-cubes corresponding to two vertices in G have a non-empty intersection if and only if the vertices are adjacent. The cubicity of a graph G, denoted as cub(G), is defined as the minimum dimension k such that G has a k-cube representation. An interval graph is a graph that can be represented as the intersection of intervals on the real line - i. e., the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. We show that for any interval graph G with maximum degree Delta, cub(G) <= inverted right perpendicular log(2) Delta inverted left perpendicular + 4. This upper bound is shown to be tight up to an additive constant of 4 by demonstrating interval graphs for which cubicity is equal to inverted right perpendicular log(2) Delta inverted left perpendicular.