Experimental and Numerical Studies in a Compact Trapped Vortex Combustor: Stability Assessment and Augmentation

Fundamental studies on a compact trapped vortex combustor indicate that cavity injection strategies play a major role on flame stability. Detailed experiments indicate that blow-out occurs for a certain range of cavity air flow velocities. An unsteady RANS-based reacting flow simulation tool has been utilized to study the basic dynamics of cavity vortex for various flow conditions. The phenomenon of flame blow-out at certain intermediate cavity air velocities is explained on the basis of transition from a cavity-stabilized mode to an opposed flow stagnation mode. A novel strategy is proposed for achieving flame stability at all conditions. This involves using a flow guide vane in the path of the main flow to direct a portion of the main flow into the cavity. This seems to result in a desirable dual vortex structure, i.e., a small clockwise vortex behind the vane and large counterclockwise vortex in the cavity. Experimental results show stable flame at all flow conditions with the flow guide vane, and pressure drop is estimated to be within acceptable limits. Cold flow simulations show self-similar velocity profiles for a range of main inlet velocities, and high reverse velocity ratios (-0.3) are observed. Such a high-velocity ratio in the reverse flow shear layer profile leads to enhanced production of turbulence imperative to compact combustors. Reacting flow simulations show even higher reverse velocity ratios (above -0.7) due to flow acceleration. The flame is observed to be stable, even though minor shear layer oscillations are present in the form of vortex shedding. Self-similarity is also observed in reacting flow temperature profiles at combustor exit over the entire range of the mainstream velocity. This indicates that the present configuration holds a promise of delivering robust performance invariant of the flow operating conditions.

Design of compact low pass filter with wide stop band using tri-section stepped impedance resonator

This paper reports the design of a compact low pass filter (LPF) with wide stop band region using trisection stepped impedance resonators in microstrip medium. Experimental results of a low pass filter designed at 1 GHz have been compared against the analytical and EM simulation results for the validation of the design. Results are satisfactorily matching each other. The maximum insertion of the measured filter is 0.2 dB and minimum return loss is 13.5 dB over the pass band. The stop band rejection is better than 20 dB from 1.5 GHz to 4.2 GHz and hence wide stop band performance is achieved. Overall size of the filter is 30 mm x 20 mm x 0.78 mm which is 0.1 lambda x 0.066 lambda. x 0.0026 lambda at 1 GHz. (C) 2011 Elsevier GmbH. All rights reserved.

A general construction of space-time trellis codes for PSK signal sets

The diversity order and coding gain are crucial for the performance of a multiple antenna communication system. It is known that space-time trellis codes (STTC) can be used to achieve these objectives. In particular, we can use STTCs to obtain large coding gains. Many attempts have been made to construct STTCs which achieve full-diversity and good coding gains, though a general method of construction does not exist. Delay diversity code (rate-1) is known to achieve full-diversity, for any number of transmit antennas and any signal set, but does not give a good coding gain. A product distance code based delay diversity scheme (Tarokh, V. et al., IEEE Trans. Inform. Theory, vol.44, p.744-65, 1998) enables one to improve the coding gain and construct STTCs for any given number of states using coding in conjunction with delay diversity; it was stated as an open problem. We achieve such a construction. We assume a shift register based model to construct an STTC for any state complexity. We derive a sufficient condition for this STTC to achieve full-diversity, based on the delay diversity scheme. This condition provides a framework to do coding in conjunction with delay diversity for any signal constellation. Using this condition, we provide a formal rate-1 STTC construction scheme for PSK signal sets, for any number of transmit antennas and any given number of states, which achieves full-diversity and gives a good coding gain.

2.5PN linear momentum flux from inspiralling compact binaries in quasicircular orbits and associated recoil: Nonspinning case

Anisotropic emission of gravitational waves (GWs) from inspiralling compact binaries leads to the loss of linear momentum and hence gravitational recoil of the system. The loss rate of linear momentum in the far-zone of the source (a nonspinning binary system of black holes in quasicircular orbit) is investigated at the 2.5 post-Newtonian (PN) order and used to provide an analytical expression in harmonic coordinates for the 2.5PN accurate recoil velocity of the binary accumulated in the inspiral phase. The maximum recoil velocity of the binary system at the end of its inspiral phase (i.e at the innermost stable circular orbit (ISCO)) estimated by the 2.5PN formula is of the order of 4 km s(-1) which is smaller than the 2PN estimate of 22 km s(-1). Going beyond inspiral, we also provide an estimate of the more important contribution to the recoil velocity from the plunge phase. The maximum recoil velocity at the end of the plunge, involving contributions both from inspiral and plunge phase, for a binary with symmetric mass ratio nu = 0.2 is of the order of 182 km s(-1).

Minimal unsatisfiable sets: Classification and bounds

Proving the unsatisfiability of propositional Boolean formulas has applications in a wide range of fields. Minimal Unsatisfiable Sets (MUS) are signatures of the property of unsatisfiability in formulas and our understanding of these signatures can be very helpful in answering various algorithmic and structural questions relating to unsatisfiability. In this paper, we explore some combinatorial properties of MUS and use them to devise a classification scheme for MUS. We also derive bounds on the sizes of MUS in Horn, 2-SAT and 3-SAT formulas.

Some Aspects of the Kobayashi and Carath,odory Metrics on Pseudoconvex Domains

The purpose of this article is to consider two themes, both of which emanate from and involve the Kobayashi and the Carath,odory metric. First, we study the biholomorphic invariant introduced by B. Fridman on strongly pseudoconvex domains, on weakly pseudoconvex domains of finite type in C (2), and on convex finite type domains in C (n) using the scaling method. Applications include an alternate proof of the Wong-Rosay theorem, a characterization of analytic polyhedra with noncompact automorphism group when the orbit accumulates at a singular boundary point, and a description of the Kobayashi balls on weakly pseudoconvex domains of finite type in C (2) and convex finite type domains in C (n) in terms of Euclidean parameters. Second, a version of Vitushkin's theorem about the uniform extendability of a compact subgroup of automorphisms of a real analytic strongly pseudoconvex domain is proved for C (1)-isometries of the Kobayashi and Carath,odory metrics on a smoothly bounded strongly pseudoconvex domain.

Radial infall of two compact objects: 2.5-post-Newtonian linear momentum flux and associated recoil

The loss rate of linear momentum from a binary system composed of compact objects (radially falling towards each other under mutual gravitational influence) has been investigated using the multipolar post-Minkowskian approach. The 2.5PN accurate analytical formula for the linear momentum flux is provided, in terms of the separation of the two objects, in harmonic coordinates, both for a finite and an infinite initial separation. The 2.5PN formulas for the linear momentum flux are finally used to estimate the recoil velocity accumulated during a premerger phase of the binary evolution.

Piecewise Linearization Technique for Compact Charge Modeling of Independent DG MOSFET

Charge linearization techniques have been used over the years in advanced compact models for bulk and double-gate MOSFETs in order to approximate the position along the channel as a quadratic function of the surface potential (or inversion charge densities) so that the terminal charges can be expressed as a compact closed-form function of source and drain end surface potentials (or inversion charge densities). In this paper, in case of the independent double-gate MOSFETs, we show that the same technique could be used to model the terminal charges quite accurately only when the 1-D Poisson solution along the channel is fully hyperbolic in nature or the effective gate voltages are same. However, for other bias conditions, it leads to significant error in terminal charge computation. We further demonstrate that the amount of nonlinearity that prevails between the surface potentials along the channel actually dictates if the conventional charge linearization technique could be applied for a particular bias condition or not. Taking into account this nonlinearity, we propose a compact charge model, which is based on a novel piecewise linearization technique and shows excellent agreement with numerical and Technology Computer-Aided Design (TCAD) simulations for all bias conditions and also preserves the source/drain symmetry which is essential for Radio Frequency (RF) circuit design. The model is implemented in a professional circuit simulator through Verilog-A, and simulation examples for different circuits verify good model convergence.

Badly approximable numbers and vectors in Cantor-like sets

We show that a large class of Cantor-like sets of R-d, d >= 1, contains uncountably many badly approximable numbers, respectively badly approximable vectors, when d >= 2. An analogous result is also proved for subsets of R-d arising in the study of geodesic flows corresponding to (d+1)-dimensional manifolds of constant negative curvature and finite volume, generalizing the set of badly approximable numbers in R. Furthermore, we describe a condition on sets, which is fulfilled by a large class, ensuring a large intersection with these Cantor-like sets.

Inclusion of body doping in compact models for fully-depleted common double gate MOSFET adapted to gate-oxide thickness asymmetry

Since it is difficult to find the analytical solution of the governing Poisson equation for double gate MOSFETs with the body doping term included, the majority of the compact models are developed for undoped-body devices for which the analytical solution is available. Proposed is a simple technique to included a body doping term in such surface potential based common double gate MOSFET models also by taking into account any differences between the gate oxide thickness. The proposed technique is validated against TCAD simulation and found to be accurate as long as the channel is fully depleted.

Rainbow connection number and connected dominating sets

The rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree delta, the rainbow connection number is upper bounded by 3n/(delta + 1) + 3. This solves an open problem from Schiermeyer (Combinatorial Algorithms, Springer, Berlin/Hiedelberg, 2009, pp. 432437), improving the previously best known bound of 20n/delta (J Graph Theory 63 (2010), 185191). This bound is tight up to additive factors by a construction mentioned in Caro et al. (Electr J Combin 15(R57) (2008), 1). As an intermediate step we obtain an upper bound of 3n/(delta + 1) - 2 on the size of a connected two-step dominating set in a connected graph of order n and minimum degree d. This bound is tight up to an additive constant of 2. This result may be of independent interest. We also show that for every connected graph G with minimum degree at least 2, the rainbow connection number, rc(G), is upper bounded by Gc(G) + 2, where Gc(G) is the connected domination number of G. Bounds of the form diameter(G)?rc(G)?diameter(G) + c, 1?c?4, for many special graph classes follow as easy corollaries from this result. This includes interval graphs, asteroidal triple-free graphs, circular arc graphs, threshold graphs, and chain graphs all with minimum degree delta at least 2 and connected. We also show that every bridge-less chordal graph G has rc(G)?3.radius(G). In most of these cases, we also demonstrate the tightness of the bounds.

Maximum weight independent sets in hole- and dart-free graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n(3))-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n(4))-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs. (C) 2012 Elsevier B.V. All rights reserved.