Experimental Investigations on the Thermal Diffusion Characteristics and Photoluminescence in Multiphase Micro Fluids Containing ZnO Micro Tubes and Fluorescein Dye

Optics and Spectroscopy - Scattering of light by disordered structures is normally detrimental to their applicability in many optoelectronic devices. However, some micro and nanostructures are...     

Invariant discrete flows

In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.     

Compatible relations on filters and stability of local topological properties under supremum and product

An abstract scheme using particular types of relations on filters leads to general unifying results on stability under supremum and product of local topological properties. We present applications for Fréchetness, strong Fréchetness, countable tightness and countable fan-tightness, some of which recover or refine classical results, some of which are new. The reader may find other applications as well.     

The cardinality of manifold atlases

It is shown that any finite dimensionalC ⁰ manifold (connected and Hausdorff but otherwise unrestricted) has an atlas of cardinality not greater than that of the continuum; while if it has a Hölder continuous pseudo-Riemannian metric then there is a countable atlas.     

Line graphs of bipartite graphs with Hamiltonian paths

It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path P_t as a star complement for the eigenvalue ?2. The maximal graph is the line graph of K_m,m if t = 2m?1, and of K_m,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement P_r ∪ P_s or P_r ∪ C_s for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003     

Structure of solid monolayers and multilayers of n -hexane on graphite

We present all-atom molecular dynamics simulations ofn-hexane on the basal plane of graphite at monolayer and multilayer coverages. In keeping with experimental data, we find the presence of ordered adsorbed layers both at single monolayer coverage and when the adsorbed layer coexists with excess liquid adsorbate. Using a simulation method that does not impose any particular periodicity on the adsorbed layer, we quantitatively compare our results to the results of neutron diffraction experiments and find a structural transition from a uniaxially incommensurate lattice to a fully commensurate structure on increasing the coverage from a monolayer to a multilayer. The zig-zag backbone planes of all the alkane molecules lie parallel to the graphite surface at the multilayer coverage, while a few molecules are observed to attain the perpendicular orientation at monolayer coverage. Dedicated to Professor C N R Rao on his 70th birthday     

Dynamic programming in cricket: optimizing batting order for a sticky wicket

In cricket, a rain-affected pitch can make batting more difficult than normal. Several other conditions such as poor light or an initially lively pitch, may also result in difficulties for the batsmen. In this note, we refer to all of them as ‘sticky wickets’. On sticky wickets, lower order batsmen are often sent into ‘hold the fort’ until conditions improve. In this paper, a stochastic dynamic programming model is used to examine the appropriateness of this policy. The model suggests that the tactic is often optimal when the sticky wicket persists until the end of the day's play, but not often when the sticky wicket is transitory. In some circumstances, it is worthwhile, on a normal wicket near the end of the day, to send in a lower order batsman to hold the fort (a night watchman): when the wicket is sticky, this tactic is even more worthwhile.