Propagation of quasi-simple waves in a compressible rotating atmosphere

A class of self-propagating linear and nonlinear travelling wave solutions for compressible rotating fluid is studied using both numerical and analytical techiques. It is shown that, in general, a three dimensional linear wave is not periodic. However, for some range of wave numbers depending on rotation, horizontally propagating waves are periodic. When the rotation ohgr is equal to $$\sqrt {(\gamma - 1)/(4\gamma )}$$ , all horizontal waves are periodic. Here, gamma is the ratio of specific heats. The analytical study is based on phase space analysis. It reveals that the quasi-simple waves are periodic only in some plane, even when the propagation is horizontal, in contrast to the case of non-rotating flows for which there is a single parameter family of periodic solutions provided the waves propagate horizontally. A classification of the singular points of the governing differential equations for quasi-simple waves is also appended.

A Non Quasi-Static Small Signal Model for Long Channel Symmetric DG MOSFET

We propose a compact model for small signal non quasi static analysis of long channel symmetric double gate MOSFET The model is based on the EKV formalism and is valid in all regions of operation and thus suitable for RF circuit design Proposed model is verified with professional numerical device simulator and excellent agreement is found well beyond the cut-off frequency

Analysing local algorithms in location-aware quasi-unit-disk graphs

A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.

A quasi-steady performance prediction model for dynamic characteristics of a volute pump

A performance prediction model generally applicable for volute-type centrifugal pumps has been extended to predict the dynamic characteristics of a pump during its normal starting and stopping periods. Experiments have been conducted on a volute pump with different valve openings to study the dynamic behaviour of the pump during normal start-up and stopping, when a small length of discharge pipeline is connected to the discharge flange of the pump. Such experiments have also been conducted when the test pump was part of a hydraulic system, an experimental rig, where it is pumping against three similar pumps, known as supply pumps, connected in series, with the supply pumps kept idle or running. Instantaneous rotational speed, flowrate, and delivery and suction pressures of the pump were recorded and it was observed in all the tested cases that the change of pump behaviour during the transient period was quasi-steady, which validates the quasi-steady approach presented in this paper. The nature of variation of parameters during the transients has been discussed. The model-predicted dynamic head-capacity curves agree well with the experimental data for almost all the tested cases.

Spin state and exchange in the quasi-one-dimensional antiferromagnet KFeS2

We report the optical spectra and single crystal magnetic susceptibility of the one-dimensional antiferromagnet KFeS2. Measurements have been carried out to ascertain the spin state of Fe3+ and the nature of the magnetic interactions in this compound. The optical spectra and magnetic susceptibility could be consistently interpreted using a S = 1/2 spin ground state for the Fe3+ ion. The features in the optical spectra have been assigned to transitions within the d-electron manifold of the Fe3+ ion, and analysed in the strong field limit of the ligand field theory. The high temperature isotropic magnetic susceptibility is typical of a low-dimensional system and exhibits a broad maximum at similar to 565 K. The susceptibility shows a well defined transition to a three dimensionally ordered antiferromagnetic state at T-N = 250 K. The intra and interchain exchange constants, J and J', have been evaluated from the experimental susceptibilities using the relationship between these quantities, and chi(max), T-max, and T-N for a spin 1/2 one-dimensional chain. The values are J = -440.71 K, and J' = 53.94 K. Using these values of J and J', the susceptibility of a spin 1/2 Heisenberg chain was calculated. A non-interacting spin wave model was used below T-N. The susceptibility in the paramagnetic region was calculated from the theoretical curves for an infinite S = 1/2 chain. The calculated susceptibility compares well with the experimental data of KFeS2. Further support for a one-dimensional spin 1/2 model comes from the fact that the calculated perpendicular susceptibility at 0K (2.75 x 10(-4) emu/mol) evaluated considering the zero point reduction in magnetization from spin wave theory is close to the projected value (2.7 x 10(-4) emu/mol) obtained from the experimental data.

Quasi-Orthogonal Design and Performance Analysis of Amplify-And-Forward Relay Networks with Multiple-Antennas

This paper is on the design and performance analysis of practical distributed space-time codes for wireless relay networks with multiple antennas terminals. The amplify-andforward scheme is used in a way that each relay transmits a scaled version of the linear combination of the received symbols. We propose distributed generalized quasi-orthogonal space-time codes which are distributed among the source antennas and relays, and valid for any number of relays. Assuming M-PSK and M-QAM signals, we derive a formula for the symbol error probability of the investigated scheme over Rayleigh fading channels. For sufficiently large SNR, this paper derives closed-form average SER expression. The simplicity of the asymptotic results provides valuable insights into the performance of cooperative networks and suggests means of optimizing them. Our analytical results have been confirmed by simulation results, using full-rate full-diversity distributed codes.

A fast quasi-Newton method for semi-supervised SVM

Due to its wide applicability, semi-supervised learning is an attractive method for using unlabeled data in classification. In this work, we present a semi-supervised support vector classifier that is designed using quasi-Newton method for nonsmooth convex functions. The proposed algorithm is suitable in dealing with very large number of examples and features. Numerical experiments on various benchmark datasets showed that the proposed algorithm is fast and gives improved generalization performance over the existing methods. Further, a non-linear semi-supervised SVM has been proposed based on a multiple label switching scheme. This non-linear semi-supervised SVM is found to converge faster and it is found to improve generalization performance on several benchmark datasets. (C) 2010 Elsevier Ltd. All rights reserved.

Ultrasonic evaluation of delamination in quasi-isotropic CFRP laminates subjected to low-velocity impact

Ultrasonic C-Scan is used very often to detect flaws and defects in the composite components resulted during fabrication and damages resulting from service conditions. Evaluation and characterization of defects and damages of composites require experience and good understanding of the material as they are distinctly different in composition and behavior as compared to conventional metallic materials. The failure mechanisms in composite materials are quite complex. They involve the interaction of matrix cracking, fiber matrix interface debonding, fiber pullout, fiber fracture and delamination. Generally all of them occur making the stress and failure analysis very complex. Under low-velocity impact loading delamination is observed to be a major failure mode. In composite materials the ultrasonic waves suffer high acoustic attenuation and scattering effect, thus making data interpretation difficult. However these difficulties can be overcome to a greater extent by proper selection of probe, probe parameter settings like pulse width, pulse amplitude, pulse repetition rate, delay, blanking, gain etc., and data processing which includes image processing done on the image obtained by the C-Scan.

Effect of scaling on the non-quasi-static behaviour of the MOSFET for RF ICs

The effect of scaling (1 μm to 0.09 μm) on the non-quasi-static (NQS) behaviour of the MOSFET has been studied using process and device simulation. It is shown that under fixed gate (Vgs) and drain (Vds) bias voltages, the NQS transition frequency (fNQS) scales as 1/Leff rather than 1/L2eff due to the velocity saturation effect. However, under the practical scaling guidelines, considering the scaling of supply voltage as well, fNQS shows a turn around effect at the sub 100 nm regime. The relation between unity gain frequency (ft) and fNQS is also evaluated and it is shown that ft and fNQS have similar trends with scaling.

Quasi-static crack tip fields in rate-sensitive FCC single crystals

In this work, the effects of loading rate, material rate sensitivity and constraint level on quasi-static crack tip fields in a FCC single crystal are studied. Finite element simulations are performed within a mode I, plane strain modified boundary layer framework by prescribing the two term (K-T) elastic crack tip field as remote boundary conditions. The material is assumed to obey a rate-dependent crystal plasticity theory. The orientation of the single crystal is chosen so that the crack surface coincides with the crystallographic (010) plane and the crack front lies along 101] direction. Solutions corresponding to different stress intensity rates K., T-stress values and strain rate exponents m are obtained. The results show that the stress levels ahead of the crack tip increase with K. which is accompanied by gradual shrinking of the plastic zone size. However, the nature of the shear band patterns around the crack tip is not affected by the loading rate. Further, it is found that while positive T-stress enhances the opening and hydrostatic stress levels ahead of crack tip, they are considerably reduced with imposition of negative T-stress. Also, negative T-stress promotes formation of shear bands in the forward sector ahead of the crack tip and suppresses them behind the tip.

Smoothed functional and Quasi-Newton algorithms for routing in multi-stage queueing network with constraints

We consider the problem of optimal routing in a multi-stage network of queues with constraints on queue lengths. We develop three algorithms for probabilistic routing for this problem using only the total end-to-end delays. These algorithms use the smoothed functional (SF) approach to optimize the routing probabilities. In our model all the queues are assumed to have constraints on the average queue length. We also propose a novel quasi-Newton based SF algorithm. Policies like Join Shortest Queue or Least Work Left work only for unconstrained routing. Besides assuming knowledge of the queue length at all the queues. If the only information available is the expected end-to-end delay as with our case such policies cannot be used. We also give simulation results showing the performance of the SF algorithms for this problem.

Quasi-based hierarchical clustering for land cover mapping using satellite images

This paper presents an improved hierarchical clustering algorithm for land cover mapping problem using quasi-random distribution. Initially, Niche Particle Swarm Optimization (NPSO) with pseudo/quasi-random distribution is used for splitting the data into number of cluster centers by satisfying Bayesian Information Criteria (BIC). Themain objective is to search and locate the best possible number of cluster and its centers. NPSO which highly depends on the initial distribution of particles in search space is not been exploited to its full potential. In this study, we have compared more uniformly distributed quasi-random with pseudo-random distribution with NPSO for splitting data set. Here to generate quasi-random distribution, Faure method has been used. Performance of previously proposed methods namely K-means, Mean Shift Clustering (MSC) and NPSO with pseudo-random is compared with the proposed approach - NPSO with quasi distribution(Faure). These algorithms are used on synthetic data set and multi-spectral satellite image (Landsat 7 thematic mapper). From the result obtained we conclude that use of quasi-random sequence with NPSO for hierarchical clustering algorithm results in a more accurate data classification.