Modelling plane mixing layers using vortex points and sheets

We present here a critical assessment of two vortex approaches (both two-dimensional) to the modelling of turbulent mixing layers. In the first approach the flow is represented by point vortices, and in the second it is simulated as the evolution of a continuous vortex sheet composed of short linear elements or ''panels''. The comparison is based on fresh simulations using approximately the same number of elements in either model, paying due attention in both to the boundary conditions far downstream as well as those on the splitter plate from which the mixing layer issues. The comparisons show that, while both models satisfy the well-known invariants of vortex dynamics approximately to the same accuracy, the vortex panel model, although ultimately not convergent, leads to smoother roll-up and values of stresses and moments that are in closer agreement with the experiment, and has a higher computational efficiency for a given degree of convergence on moments. The point vortex model, while faster for a given number of elements, produces an unsatisfactory roll-up which (for the number of elements used) is rendered worse by the incorporation of the Van der Vooren correction for sheet curvature.

DMT of Multihop Networks: End Points and Computational Tools

In this paper, the diversity-multiplexing gain tradeoff (DMT) of single-source, single-sink (ss-ss), multihop relay networks having slow-fading links is studied. In particular, the two end-points of the DMT of ss-ss full-duplex networks are determined, by showing that the maximum achievable diversity gain is equal to the min-cut and that the maximum multiplexing gain is equal to the min-cut rank, the latter by using an operational connection to a deterministic network. Also included in the paper, are several results that aid in the computation of the DMT of networks operating under amplify-and-forward (AF) protocols. In particular, it is shown that the colored noise encountered in amplify-and-forward protocols can be treated as white for the purpose of DMT computation, lower bounds on the DMT of lower-triangular channel matrices are derived and the DMT of parallel MIMO channels is computed. All protocols appearing in the paper are explicit and rely only upon AF relaying. Half-duplex networks and explicit coding schemes are studied in a companion paper.

Field and potential around local scatterers in thin metal films studied by scanning tunneling potentiometry

We report the direct observation of electrochemical potential and local transport field variations near scatterers like grain boundaries, triple points, and voids in thin platinum films studied by scanning tunneling potentiometry. The field is highest at a void, followed by a triple point and a grain boundary. The local transport field near a void can even be four orders of magnitude higher than the macroscopic field, indicating that the void is the most likely place for an electromigration induced failure. The field build up for a particular type of scatterer depends on the grain connectivity. We estimate an average grain boundary reflection coefficient for the film from the temperature dependence of its resistivity.

Real Theta Characteristics And Automorphisms Of A Real Curve

Let X be a geometrically irreductble smooth projective cruve defined over R. of genus at least 2. that admits a nontrivial automorphism, sigma. Assume that X does not have any real points. Let tau be the antiholomorphic involution of the complexification lambda(C) of X. We show that if the action of sigma on the set S(X) of all real theta characteristics of X is trivial. then the order of sigma is even, say 2k and the automorphism tau o (sigma) over cap (lambda) of X-C has a fixed point, where (sigma) over cap is the automorphism of X x C-R defined by sigma We then show that there exists X with a real point and admitting a nontrivial automorphism sigma, such that the action of sigma on S(X) is trivial, while X/ not equal P-R(1) We also give an example of X with no real points and admitting a nontrivial automorphisim sigma such that the automorphism tau o (sigma) over cap (lambda) has a fixed point, the action of sigma on S(X) is trivial, and X/ not equal P-R(1)

Text localization and extraction from complex gray images

We propose two texture-based approaches, one involving Gabor filters and the other employing log-polar wavelets, for separating text from non-text elements in a document image. Both the proposed algorithms compute local energy at some information-rich points, which are marked by Harris' corner detector. The advantage of this approach is that the algorithm calculates the local energy at selected points and not throughout the image, thus saving a lot of computational time. The algorithm has been tested on a large set of scanned text pages and the results have been seen to be better than the results from the existing algorithms. Among the proposed schemes, the Gabor filter based scheme marginally outperforms the wavelet based scheme.

Synthesis and characterization of N,N'-aliphatic dicarboxylbis(hydrazones)

N,N'-Malonylbis-,N,N'-adipinylbis- and N,N'-sebacoylbis-(hydrazones) 1 of various aldehydes and ketones have been prepared and characterized by elemental analyses, melting points, and H-1 NMR and IR spectral data.

A Fast Linear Separability Test by Projection of Positive Points on Subspaces

A geometric and non parametric procedure for testing if two finite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that determines if a strictly positive point h > 0 exists in the range of a matrix A (related to the points in the two finite sets). The algorithm proposed in the paper iteratively checks if a strictly positive point exists in a subspace by projecting a strictly positive vector with equal co-ordinates (p), on the subspace. At the end of each iteration, the subspace is reduced to a lower dimensional subspace. The test is completed within r ≤ min(n, d + 1) steps, for both linearly separable and non separable problems (r is the rank of A, n is the number of points and d is the dimension of the space containing the points). The worst case time complexity of the algorithm is O(nr3) and space complexity of the algorithm is O(nd). A small review of some of the prominent algorithms and their time complexities is included. The worst case computational complexity of our algorithm is lower than the worst case computational complexity of Simplex, Perceptron, Support Vector Machine and Convex Hull Algorithms, if d

Microstructure, shape, stability and melting inembeddednanoparticles

The present article reviews some of the current work on a new class of materials which are nanoscale granular materials. We shall discuss in this paper two phase granular materials where one of the phases having nanometric dimension is embedded in a matrix of larger dimension. Known as nanoembedded materials, nanocomposites or ultrafine granular materials, this class of materials has attracted attention because of the opportunity of basic studies on the effect of size and embedding matrix on transformation behaviors as well as some novel properties, which include structural, magnetic and transport properties. These are in addition to the tremendous interests in what is known as quantum structures(embedded particles size less than 5 nm) for the case of semiconductors, which will not be discussed here. We shall primarily review the work done on metallic systems where the dispersed phases have low melting points and borrow extensively from the work done in our group. The phase transformations of the embedded particles show distinctive behavior and yield new insights. We shall first highlight briefly the strategy of synthesis of these materials by non-equilibrium processing techniques, which will be followed by examples where the effect of length scales on phase transformation behaviors like melting and solidification are discussed.

Robust tracking with interest points: A sparse representation approach

Visual tracking is an important task in various computer vision applications including visual surveillance, human computer interaction, event detection, video indexing and retrieval. Recent state of the art sparse representation (SR) based trackers show better robustness than many of the other existing trackers. One of the issues with these SR trackers is low execution speed. The particle filter framework is one of the major aspects responsible for slow execution, and is common to most of the existing SR trackers. In this paper,(1) we propose a robust interest point based tracker in l(1) minimization framework that runs at real-time with performance comparable to the state of the art trackers. In the proposed tracker, the target dictionary is obtained from the patches around target interest points. Next, the interest points from the candidate window of the current frame are obtained. The correspondence between target and candidate points is obtained via solving the proposed l(1) minimization problem. In order to prune the noisy matches, a robust matching criterion is proposed, where only the reliable candidate points that mutually match with target and candidate dictionary elements are considered for tracking. The object is localized by measuring the displacement of these interest points. The reliable candidate patches are used for updating the target dictionary. The performance and accuracy of the proposed tracker is benchmarked with several complex video sequences. The tracker is found to be considerably fast as compared to the reported state of the art trackers. The proposed tracker is further evaluated for various local patch sizes, number of interest points and regularization parameters. The performance of the tracker for various challenges including illumination change, occlusion, and background clutter has been quantified with a benchmark dataset containing 50 videos. (C) 2014 Elsevier B.V. All rights reserved.

Response to ``Comment on `Frequency-domain stimulated and spontaneous light emission signals at molecular junctions''' J. Chem. Phys. 142, 137101 (2015)]

In a recent work [U. Harbola, B. K. Agrawalla, and S. Mukamel, J. Chem. Phys. 141, 074107 (2014)], we have presented a superoperator (Liouville space) diagrammatic formulation of spontaneous and stimulated optical signals from current-carrying molecular junctions. We computed the diagrams that contribute to the spontaneous light emission SLE (fluorescence and Raman) signal using a diagrammatic method which clearly distinguishes between the Raman and the fluorescence contributions. We pointed out some discrepancies with the work of Galperin, Ratner and Nitzan (GRN) [M. Galperin, M. A. Ratner and, A. Nitzan, J. Chem. Phys. 130, 144109 (2009)]. In their response [M. Galperin, M. A. Ratner and A. Nitzan, “Comment on‘ Frequency-domain stimulated and spontaneous light emission signals at molecular junctions’” [J. Chem. Phys. 141, 074107 (2014)], J. Chem. Phys. 142, 137101 (2015)] to our work, GRN have argued that there are no differences in the choice of Raman diagrams in both works. Here we reply to their points and show where the differences exist.

Lifshitz transition and modulation of electronic and transport properties of bilayer graphene by sliding and applied normal compressive strain

Using density functional theory (DFT) we investigate the changes in electronic and transport properties of graphene bilayer caused by sliding one of the layers. Change in stacking pattern breaks the lattice symmetry, which results in Lifshitz transition together with the modulation of the electronic structure. Going from AA to AB stacking by sliding along armchair direction leads to a drastic transition in electronic structure from linear to parabolic dispersion. Our transport calculations show a significant change in the overall transmission value for large sliding distances along zigzag direction. The increase in interlayer coupling with normal compressive strain increases the overlapping of conduction and valence band, which leads to further shift in the Dirac points and an enhancement in the Lifshitz transition. The ability to tune the topology of band structure by sliding and/or applying normal compressive strain will open doors for controlled tuning of many physical phenomenon such as Landau levels and quantum Hall effect in graphene. (C) 2015 Elsevier Ltd. All rights reserved.

Singularity-free path planning for the Stewart platform manipulator

This paper addresses the problem of singularity-free path planning for the six-degree-of-freedom parallel manipulator known as the Stewart platform manipulator. Unlike serial manipulators, the Stewart platform possesses singular configurations within the workspace where the manipulator is uncontrollable. An algorithm has been developed to construct continuous paths within the workspace of the manipulator by avoiding singularities and ill-conditioning. Given two end-poses of the manipulator, the algorithm finds out safe (well-conditioned) via points and plans a continuous path from the initial pose to the final one. When the two end-poses belong to different branches and no singularity-free path is possible, the algorithm indicates the impossibility of a valid path. A numerical example has also been presented as illustration of the path planning strategy.

A feedback-based algorithm forMotion analysis with application to object tracking

We present a motion detection algorithm which detects direction of motion at sufficient number of points and thus segregates the edge image into clusters of coherently moving points. Unlike most algorithms for motion analysis, we do not estimate magnitude of velocity vectors or obtain dense motion maps. The motivation is that motion direction information at a number of points seems to be sufficient to evoke perception of motion and hence should be useful in many image processing tasks requiring motion analysis. The algorithm essentially updates the motion at previous time using the current image frame as input in a dynamic fashion. One of the novel features of the algorithm is the use of some feedback mechanism for evidence segregation. This kind of motion analysis can identify regions in the image that are moving together coherently, and such information could be sufficient for many applications that utilize motion such as segmentation, compression, and tracking. We present an algorithm for tracking objects using our motion information to demonstrate the potential of this motion detection algorithm.

Composite scheme using localized relaxation with non-standard finite difference method for hyperbolic conservation laws

Non-standard finite difference methods (NSFDM) introduced by Mickens [Non-standard Finite Difference Models of Differential Equations, World Scientific, Singapore, 1994] are interesting alternatives to the traditional finite difference and finite volume methods. When applied to linear hyperbolic conservation laws, these methods reproduce exact solutions. In this paper, the NSFDM is first extended to hyperbolic systems of conservation laws, by a novel utilization of the decoupled equations using characteristic variables. In the second part of this paper, the NSFDM is studied for its efficacy in application to nonlinear scalar hyperbolic conservation laws. The original NSFDMs introduced by Mickens (1994) were not in conservation form, which is an important feature in capturing discontinuities at the right locations. Mickens [Construction and analysis of a non-standard finite difference scheme for the Burgers–Fisher equations, Journal of Sound and Vibration 257 (4) (2002) 791–797] recently introduced a NSFDM in conservative form. This method captures the shock waves exactly, without any numerical dissipation. In this paper, this algorithm is tested for the case of expansion waves with sonic points and is found to generate unphysical expansion shocks. As a remedy to this defect, we use the strategy of composite schemes [R. Liska, B. Wendroff, Composite schemes for conservation laws, SIAM Journal of Numerical Analysis 35 (6) (1998) 2250–2271] in which the accurate NSFDM is used as the basic scheme and localized relaxation NSFDM is used as the supporting scheme which acts like a filter. Relaxation schemes introduced by Jin and Xin [The relaxation schemes for systems of conservation laws in arbitrary space dimensions, Communications in Pure and Applied Mathematics 48 (1995) 235–276] are based on relaxation systems which replace the nonlinear hyperbolic conservation laws by a semi-linear system with a stiff relaxation term. The relaxation parameter (λ) is chosen locally on the three point stencil of grid which makes the proposed method more efficient. This composite scheme overcomes the problem of unphysical expansion shocks and captures the shock waves with an accuracy better than the upwind relaxation scheme, as demonstrated by the test cases, together with comparisons with popular numerical methods like Roe scheme and ENO schemes.

Elasto-plastic Cracking Analysis of Reinforced Concrete

A new elasto-plastic cracking constitutive model for reinforced concrete is presented. The nonlinear effects considered cover almost all the nonlinearities exhibited by reinforced concrete under short term monotonic loading. They include concrete cracking in tension, plasticity in compression, aggregate interlock, tension softening, elasto-plastic behavior of steel, bond-slip between concrete, and steel reinforcement and tension stiffening. A new procedure for incorporating bondslip in smeared steel elements is described. A modified Huber-Hencky-Mises failure criterion for plastic deformation of concrete, which fits the experimental results under biaxial stresses better, is proposed. Multiple cracking at Gauss points and their opening and closing are considered. Matrix expressions are developed and are incorporated in a nonlinear finite element program. After the objectivity of the model is demonstrated, the model is used to analyze two different types of problems: one, a set of four shear panels, and the other, a reinforced concrete beam without shear reinforcement. The results of the analysis agree favorably with the experimental results.