A parametric study of pulsed Nd:YAG laser micro-drilling of gamma-titanium aluminide

In the present research, Nd:YAG laser micro-drilling of gamma-titanium aluminide, a new material which has performed well in laboratory tests as well as in different fields of engineering, is studied. The effect of different process parameters in the optimization of the process is investigated. The aspects considered are the hole circularity at exit and the hole taper of the drilled hole. Lamp current, pulse frequency, air pressure and thickness of the job are selected as independent process variables. The central composite design (CCD) technique based on response surface methodology (RSM) is employed to plan the experiments to achieve optimum responses with a reduced number of experiments.     

A novel technique for measurement of self-generated magnetic fields and the plasma density in laser produced plasmas from the Faraday rotation using two color probes

Diagnostic information about the self-generated magnetic fields (SGMF) generated in laser produced plasmas is normally obtained by measuring the Faraday rotation angle (FRA) of a linearly polarized laser probe beam passing through the plasma. Simultaneous recording of the corresponding interferogram is required to get the density information necessary for estimating the magnetic field. The problem with this method is that the visibility of the fringes in the interferogram can be poor, and the SGMF cannot be calculated in the regions where the interference fringes are not observable. In this paper, we propose a new method to obtain the density distribution and the SGMF from two simultaneous measurements of FRA using two probe beams of different colors, which allows one to calculate the SGMF without the need of interferometry.     

Exit time and invariant measure asymptotics for small noise constrained diffusions

Constrained diffusions, with diffusion matrix scaled by small ?>0, in a convex polyhedral cone G⊂R^k, are considered. Under suitable stability assumptions small noise asymptotic properties of invariant measures and exit times from domains are studied. Let B⊂G be a bounded domain. Under conditions, an “exponential leveling” property that says that, as ?→0, the moments of functionals of exit location from B, corresponding to distinct initial conditions, coalesce asymptotically at an exponential rate, is established. It is shown that, with appropriate conditions, difference of moments of a typical exit time functional with a sub-logarithmic growth, for distinct initial conditions in suitable compact subsets of B, is asymptotically bounded. Furthermore, as initial conditions approach 0 at a rate ?² these moments are shown to asymptotically coalesce at an exponential rate.     

Approximation, integration and differentiation of time functions using a set of orthogonal hybrid functions (HF) and their application to solution of first order differential equations

Differential equations of different types and orders are of utmost importance for mathematical modeling of control system problems. State variable method uses the concept of expressing n number of first order differential equations in vector matrix form to model and analyze/synthesize control systems.The present work proposes a new set of orthogonal hybrid functions (HF) which evolved from synthesis of sample-and-hold functions (SHF) and triangular functions (TF). This HF set is used to approximate a time function in a piecewise linear manner with the mean integral square error (MISE) much less than block pulse function based approximation which always provides staircase solutions.The operational matrices for integration and differentiation in HF domain are also derived and employed for solving non-homogeneous and homogeneous differential equations of the first order as well as state equations. The results are compared with exact solutions, the 4th order Runge-Kutta method and its further improved versions proposed by Simos [6]. The presented HF domain theory is well supported by a few illustrations.     

On a Markoff-like chain

Set {I_r = θ|θ = [a₀, a₁, a₂, …, a_n, …] with a_n ≥ r from some point on}. In the context of I₁ (the set of all irrational numbers) the chain of approximation theorems is the well-known Markoff chain (J. W. S. Cassels, “An Introduction to Diophantine Approximation,” Cambridge Tracts No. 45, Cambridge, 1959). The purpose of this paper is to find the chain of approximation theorems when restricted to I_r with r ≥ 2.     

Ballistic transmission through quasi-periodic shape barrier resonant tunneling structures

A theoretical model is proposed to study the ballistic electron transport for a quasi-periodic multibarrier structure where two different barrier shapes are arranged according to the Thue–Morse sequence. Important tunneling features are revealed form such arrangements. It is noted that the tunneling band spectrum could be fragmented by tailoring the shape of the barriers in the structure. Results for the transmission coefficients and the current densities are compared with the corresponding periodic and single shape barrier arrangements. The quasi-periodic structure consisting of the rectangular and triangular barrier shapes is suggested to be more suitable for the electronic and opto-electronic devices due to its high negative differential conducting effect.     

On the minimum degree,edge-connectivity and connectivity of power graphs of finite groups

In this paper, the minimum degree of power graphs of certain cyclic groups, abelian p-groups, dihedral groups and dicyclic groups are obtained. It is ascertained that the edge-connectivity and minimum degree of power graphs are equal, and consequently, the minimum disconnecting sets of power graphs of the aforementioned groups are determined. In order to investigate the equality of connectivity and minimum degree of power graphs, certain necessary conditions for finite groups and a necessary and su?cient condition for finite cyclic groups are obtained. Moreover, the equality is discussed for the power graphs of abelian p-groups, dihedral groups and dicyclic groups.     

Low dissipative entropy stable schemes using third order WENO and TVD reconstructions

A low dissipative framework is given to construct high order entropy stable flux by addition of suitable numerical diffusion operator into entropy conservative flux. The framework is robust in the sense that it allows the use of high order reconstructions which satisfy the sign property only across the discontinuities. The third order weighted essentially non-oscillatory (WENO) interpolations and high order total variation diminishing (TVD) reconstructions are shown to satisfy the sign property across discontinuities. Third order accurate entropy stable schemes are constructed by using third order WENO and high order TVD reconstructions procedures in the diffusion operator. These schemes are efficient and less diffusive since the diffusion is actuated only in the sign stability region of the used reconstruction which includes discontinuities. Numerical results with constructed schemes for various test problems are given which show the third order accuracy and less dissipative nature of the schemes.     

Comparison of Gelfand-Tsetlin Bases for Alternating and Symmetric Groups

Young’s orthogonal basis is a classical basis for an irreducible representation of a symmetric group. This basis happens to be a Gelfand-Tsetlin basis for the chain of symmetric groups. It is well-known that the chain of alternating groups, just like the chain of symmetric groups, has multiplicity-free restrictions for irreducible representations. Therefore each irreducible representation of an alternating group also admits Gelfand-Tsetlin bases. Moreover, each such representation is either the restriction of, or a subrepresentation of, the restriction of an irreducible representation of a symmetric group. In this article, we describe a recursive algorithm to write down the expansion of each Gelfand-Tsetlin basis vector for an irreducible representation of an alternating group in terms of Young’s orthogonal basis of the ambient representation of the symmetric group. This algorithm is implemented with the Sage Mathematical Software.