2-Dimensional Linear-Stability of Premixed Laminar Flames Under Zero-Gravity

This paper reports on the numerical study of the linear stability of laminar premixed flames under zero gravity. The study specifically addresses the dependence of stability on finite rate chemistry with low activation energy and variable thermodynamic and transport properties. The calculations show that activation energy and details of chemistry play a minor role in altering the linear neutral stability results from asymptotic analysis. Variable specific heat makes a marginal change to the stability. Variable transport properties on the other hand tend to substantially enhance the stability from critical wave number of about 0.5 to 0.20. Also, it appears that the effects of variable properties tend to nullify the effects of non-unity Lewis number. When the Lewis number of a single species is different from unity, as will happen in a hydrogen-air premixed flame, the stability results remain close to that of unity Lewis number.

A note on resolving infeasibility in linear programs by constraint relaxation

We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an infeasible linear program, make it feasible. We show the problem is NP-hard even when the constraint matrix is totally unimodular and prove polynomial-time solvability when the constraint matrix and the right-hand-side together form a totally unimodular matrix.

Interruption and Uncooperativeness in Academic ELF Group Work : An Application of Linear Unit Grammar

This study addresses the challenge of analyzing interruption in spoken interaction. It begins with my observation of eight hours of academic group work among speakers of English as a lingua franca (ELF) in a university course. Unlike the common findings of ELF research which underscore the cooperative orientation of ELF users, this particular group gave strong impressions of interruption and uncooperativeness as they prepared a scientific group presentation. In the effort to investigate these impressions, I found that no satisfactory method exists for systematically identifying and analyzing interruptions. A useful tool was found in Linear Unit Grammar or LUG (Sinclair & Mauranen 2006), which analyzes spoken interaction prospectively as linear text. In the course of transcribing one of the early group work meetings, I developed a model of LUG-based criteria for identifying individual instances of interruption. With this system in place, I was then able to evaluate the aggregate occurrences of interruption in the group work and identify co-occurring interactive features which further influenced the perception of uncooperativeness. Finally, these aggregate statistics directed a return to the data and a contextually sensitive, qualitative analysis. This research cycle illuminates the interactive features which contributed to my own impressions of uncooperativeness, as well as the group members orientations to their own interruptive practice.

Field-dependent changeover from current-to voltage-limiting characteristics by non-linear n-type BaTiO3 ceramics

Non-linear resistors having current-limiting capabilities at lower field strengths, and voltage-limiting characteristics (varistors) at higher field strengths, were prepared from sintered polycrystalline ceramics of (Ba0.6Sr0.4)(Ti0.97Zr0.03)O3+0.3 at % La, and reannealed after painting with low-melting mixtures of Bi2O3 + PbO +B2O3. These types of non-linear characteristics were found to depend upon the non-uniform diffusion of lead and the consequent distribution of Curie points (T c) in these perovskites, resulting in diffuse phase transitions. Tunnelling of electrons across the asymmetric barrier at tetragonak-cubic interfaces changes to tunnelling across the symmetric barrier as the cubic phase is fully stabilized through Joule heating at high field strengths. Therefore the current-limiting characteristics switch over to voltage-limiting behaviour because tunnelling to acceptor-type mid-bandgap states gives way to band-to-band tunnelling.

The Reproducing Kernel DMS-FEM: 3D Shape Functions and Applications to Linear Solid Mechanics

We propose a family of 3D versions of a smooth finite element method (Sunilkumar and Roy 2010), wherein the globally smooth shape functions are derivable through the condition of polynomial reproduction with the tetrahedral B-splines (DMS-splines) or tensor-product forms of triangular B-splines and ID NURBS bases acting as the kernel functions. While the domain decomposition is accomplished through tetrahedral or triangular prism elements, an additional requirement here is an appropriate generation of knotclouds around the element vertices or corners. The possibility of sensitive dependence of numerical solutions to the placements of knotclouds is largely arrested by enforcing the condition of polynomial reproduction whilst deriving the shape functions. Nevertheless, given the higher complexity in forming the knotclouds for tetrahedral elements especially when higher demand is placed on the order of continuity of the shape functions across inter-element boundaries, we presently emphasize an exploration of the triangular prism based formulation in the context of several benchmark problems of interest in linear solid mechanics. In the absence of a more rigorous study on the convergence analyses, the numerical exercise, reported herein, helps establish the method as one of remarkable accuracy and robust performance against numerical ill-conditioning (such as locking of different kinds) vis-a-vis the conventional FEM.

Points-to Analysis as a System of Linear Equations

We propose a novel formulation of the points-to analysis as a system of linear equations. With this, the efficiency of the points-to analysis can be significantly improved by leveraging the advances in solution procedures for solving the systems of linear equations. However, such a formulation is non-trivial and becomes challenging due to various facts, namely, multiple pointer indirections, address-of operators and multiple assignments to the same variable. Further, the problem is exacerbated by the need to keep the transformed equations linear. Despite this, we successfully model all the pointer operations. We propose a novel inclusion-based context-sensitive points-to analysis algorithm based on prime factorization, which can model all the pointer operations. Experimental evaluation on SPEC 2000 benchmarks and two large open source programs reveals that our approach is competitive to the state-of-the-art algorithms. With an average memory requirement of mere 21MB, our context-sensitive points-to analysis algorithm analyzes each benchmark in 55 seconds on an average.

Exact-Solutions Of Linear Partial-Differential Equations With Variable-Coefficients

Backlund transformations relating the solutions of linear PDE with variable coefficients to those of PDE with constant coefficients are found, generalizing the study of Varley and Seymour [2]. Auto-Backlund transformations are also determined. To facilitate the generation of new solutions via Backlund transformation, explicit solutions of both classes of the PDE just mentioned are found using invariance properties of these equations and other methods. Some of these solutions are new.

On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding

The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.

Data compression by linear prediction for storage and transmission of EEG signals

The EEG time series has been subjected to various formalisms of analysis to extract meaningful information regarding the underlying neural events. In this paper the linear prediction (LP) method has been used for analysis and presentation of spectral array data for the better visualisation of background EEG activity. It has also been used for signal generation, efficient data storage and transmission of EEG. The LP method is compared with the standard Fourier method of compressed spectral array (CSA) of the multichannel EEG data. The autocorrelation autoregressive (AR) technique is used for obtaining the LP coefficients with a model order of 15. While the Fourier method reduces the data only by half, the LP method just requires the storage of signal variance and LP coefficients. The signal generated using white Gaussian noise as the input to the LP filter has a high correlation coefficient of 0.97 with that of original signal, thus making LP as a useful tool for storage and transmission of EEG. The biological significance of Fourier method and the LP method in respect to the microstructure of neuronal events in the generation of EEG is discussed.

Variable Elimination in Linear Constraints

Gauss and Fourier have together provided us with the essential techniques for symbolic computation with linear arithmetic constraints over the reals and the rationals. These variable elimination techniques for linear constraints have particular significance in the context of constraint logic programming languages that have been developed in recent years. Variable elimination in linear equations (Guassian Elimination) is a fundamental technique in computational linear algebra and is therefore quite familiar to most of us. Elimination in linear inequalities (Fourier Elimination), on the other hand, is intimately related to polyhedral theory and aspects of linear programming that are not quite as familiar. In addition, the high complexity of elimination in inequalities has forces the consideration of intricate specializations of Fourier's original method. The intent of this survey article is to acquaint the reader with these connections and developments. The latter part of the article dwells on the thesis that variable elimination in linear constraints over the reals extends quite naturally to constraints in certain discrete domains.

Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Linear electro‐optic dispersion in (‐)‐2‐(α‐methylbenzylamino)‐5‐nitropyridine single crystals

The variation of the linear electro-optic effect in (-)-2-(alpha-methylbenzylamino)-5-nitropyridine with the wavelength of the incident light at room temperature has been measured. The reduced half-wave voltages have been found to have the values 2.1, 2.8, and 6.0 kV at 488, 514.5, and 632.8 nm respectively and the corresponding values of the linear electro-optic coefficient have been evaluated.;The interpretation of the results in terms of the structures of the molecule and the crystal is discussed. The thermal variation of the birefringence has also been investigated and the coefficient for the temperature variation of the refractive index difference is found to have the value (d Delta n/dT)=9.3X10(-5) K-1.

Non-Linear effects of membrane fluctuations in the dilute lamellar phase

The static structure factor of the dilute sterically stabilised lamellar phase is calculated and found to have an Ornstein-Zernike form with a correlation length that diverges at infinite dilution. The relaxation time for concentration fluctuations at large wave number q is shown to go as q-3 with a coefficient independent of the membrane bending rigidity. The membrane fluctuations also give rise to strongly frequency-dependent viscosities at high frequencies.

Practical constant-accuracy linear weir

This paper is concerned with the modifications of the Extended Bellmouth Weir (EBM weir) earlier designed by Keshava Murthy. It is shown that by providing inclined sides (equivalent to providing an inward-trapezoidal weir) over a sector of a circle of radius R, separated by a distance 2t, and depth d, the measurable range of EBM can be considerably enhanced (over 375%). Simultaneously, the other parameters of the weir are optimized such that the reference plane of the weir coincides with its crest making it a constant-accuracy linear weir. Discharge through the aforementioned weir is proportional to the depths of flow measured above the crest of the weir for all heads in the range of 0.5R less-than-or-equal-to h less-than-or-equal-to 7.9R, within a maximum deviation of +/-1% from the theoretical discharge. Experiments with two typical weirs show excellent agreement with the theory by giving a constant-average coefficient of discharge of 0.619