KFVS (Kinetic Flux Vector Splitting) on moving grids for unsteady aerodynamics

Accurate numerical solutions to the problems in fluid-structure (aeroelasticity) interaction are becoming increasingly important in recent years. The methods based on FCD (Fixed Computational Domain) and ALE (Alternate Lagrangian Eulerian) to solve such problems suffer from numerical instability and loss of accuracy. They are not general and can not be extended to the flowsolvers on unstructured meshes. Also, global upwind schemes can not be used in ALE formulation thus leads to the development of flow solvers on moving grids. The KFVS method has been shown to be easily amenable on moving grids required in unsteady aerodynamics. The ability of KFMG (Kinetic Flux vector splitting on Moving Grid) Euler solver in capturing shocks, expansion waves with small and very large pressure ratios and contact discontinuities has been demonstrated.

A Ten-microRNA Expression Signature Predicts Survival in Glioblastoma

Glioblastoma (GBM) is the most common and aggressive primary brain tumor with very poor patient median survival. To identify a microRNA (miRNA) expression signature that can predict GBM patient survival, we analyzed the miRNA expression data of GBM patients (n = 222) derived from The Cancer Genome Atlas (TCGA) dataset. We divided the patients randomly into training and testing sets with equal number in each group. We identified 10 significant miRNAs using Cox regression analysis on the training set and formulated a risk score based on the expression signature of these miRNAs that segregated the patients into high and low risk groups with significantly different survival times (hazard ratio HR] = 2.4; 95% CI = 1.4-3.8; p < 0.0001). Of these 10 miRNAs, 7 were found to be risky miRNAs and 3 were found to be protective. This signature was independently validated in the testing set (HR = 1.7; 95% CI = 1.1-2.8; p = 0.002). GBM patients with high risk scores had overall poor survival compared to the patients with low risk scores. Overall survival among the entire patient set was 35.0% at 2 years, 21.5% at 3 years, 18.5% at 4 years and 11.8% at 5 years in the low risk group, versus 11.0%, 5.5%, 0.0 and 0.0% respectively in the high risk group (HR = 2.0; 95% CI = 1.4-2.8; p < 0.0001). Cox multivariate analysis with patient age as a covariate on the entire patient set identified risk score based on the 10 miRNA expression signature to be an independent predictor of patient survival (HR = 1.120; 95% CI = 1.04-1.20; p = 0.003). Thus we have identified a miRNA expression signature that can predict GBM patient survival. These findings may have implications in the understanding of gliomagenesis, development of targeted therapy and selection of high risk cancer patients for adjuvant therapy.

Vibration Signature Analysis Using Artificial Neural Networks

Damage detection by measuring and analyzing vibration signals in a machine component is an established procedure in mechanical and aerospace engineering. This paper presents vibration signature analysis of steel bridge structures in a nonconventional way using artificial neural networks (ANN). Multilayer perceptrons have been adopted using the back-propagation algorithm for network training. The training patterns in terms of vibration signature are generated analytically for a moving load traveling on a trussed bridge structure at a constant speed to simulate the inspection vehicle. Using the finite-element technique, the moving forces are converted into stationary time-dependent force functions in order to generate vibration signals in the structure and the same is used to train the network. The performance of the trained networks is examined for their capability to detect damage from unknown signatures taken independently at one, three, and five nodes. It has been observed that the prediction using the trained network with single-node signature measurement at a suitability chosen location is even better than that of three-node and five-node measurement data.

Optical studies of SN 2009jf: a Type Ib supernova with an extremely slow decline and aspherical signature

Optical UBVRI photometry and medium-resolution spectroscopy of the Type Ib supernova SN 2009jf, during the period from similar to -15 to +250 d, with respect to the B maximum are reported. The light curves are broad, with an extremely slow decline. The early post-maximum decline rate in the V band is similar to SN 2008D; however, the late-phase decline rate is slower than other Type Ib supernovae studied. With an absolute magnitude of M-V = -17.96 +/- 0.19 at peak, SN 2009jf is a normally bright supernova. The peak bolometric luminosity and the energy deposition rate via the 56Ni -> 56Co chain indicate that similar to 0.17+0.03(-0.03) M-circle dot of 56Ni was ejected during the explosion. The He i 5876 A line is clearly identified in the first spectrum of day similar to -15, at a velocity of similar to 16 000 km s-1. The O i] 6300-6364 A line seen in the nebular spectrum has a multipeaked and asymmetric emission profile, with the blue peak being stronger. The estimated flux in this line implies that greater than or similar to 1.34 M-circle dot oxygen was ejected. The slow evolution of the light curves of SN 2009jf indicates the presence of a massive ejecta. The high expansion velocity in the early phase and broader emission lines during the nebular phase suggest it to be an explosion with a large kinetic energy. A simple qualitative estimate leads to the ejecta mass of M-ej = 4-9 M-circle dot and kinetic energy E-K = 3-8 x 1051 erg. The ejected mass estimate is indicative of an initial main-sequence mass of greater than or similar to 20-25 M-circle dot.

Off-line signature verification using genetically optimized weighted features

This paper is concerned with off-line signature verification. Four different types of pattern representation schemes have been implemented, viz., geometric features, moment-based representations, envelope characteristics and tree-structured Wavelet features. The individual feature components in a representation are weighed by their pattern characterization capability using Genetic Algorithms. The conclusions of the four subsystems teach depending on a representation scheme) are combined to form a final decision on the validity of signature. Threshold-based classifiers (including the traditional confidence-interval classifier), neighbourhood classifiers and their combinations were studied. Benefits of using forged signatures for training purposes have been assessed. Experimental results show that combination of the Feature-based classifiers increases verification accuracy. (C) 1999 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Opportunistic splitting for scheduling via stochastic approximation

We consider the problem of scheduling a wireless channel among multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Modified kinetic flux vector splitting (m-KFVS) method for compressible flows

To resolve many flow features accurately, like accurate capture of suction peak in subsonic flows and crisp shocks in flows with discontinuities, to minimise the loss in stagnation pressure in isentropic flows or even flow separation in viscous flows require an accurate and low dissipative numerical scheme. The first order kinetic flux vector splitting (KFVS) method has been found to be very robust but suffers from the problem of having much more numerical diffusion than required, resulting in inaccurate computation of the above flow features. However, numerical dissipation can be reduced by refining the grid or by using higher order kinetic schemes. In flows with strong shock waves, the higher order schemes require limiters, which reduce the local order of accuracy to first order, resulting in degradation of flow features in many cases. Further, these schemes require more points in the stencil and hence consume more computational time and memory. In this paper, we present a low dissipative modified KFVS (m-KFVS) method which leads to improved splitting of inviscid fluxes. The m-KFVS method captures the above flow features more accurately compared to first order KFVS and the results are comparable to second order accurate KFVS method, by still using the first order stencil. (C) 2011 Elsevier Ltd. All rights reserved.

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs

Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].

Spin Probe Signature of Freezing in Water Slow Cooling Experiment: Our Observation is Global or Local?

First systematic spin probe ESR study of water freezing has been conducted using TEMPOL and TEMPO as the probes. The spin probe signature of the water freezing has been described in terms of the collapse of narrow triplet spectrum into a single broad line. This spin probe signature of freezing has been observed at an anomalously low temperature when a milimoler solution of TEMPOL is slowly cooled from room temperature. A systematic observation has revealed a spin probe concentration dependence of these freezing and respective melting points. These results can be explained in terms of localization of spin probe and liquid water,most probably in the interstices of ice grains, in an ice matrix. The lowering of spin probe freezing point, along with the secondary evidences, like spin probe concentration dependence of peak-to-peak width in frozen limit signal, indicates a possible size dependence of these localizations/entrapments with spin probe concentration. A weak concentration dependence of spin probe assisted freezing and melting points, which has been observed for TEMPO in comparison to TEMPOL, indicates different natures of interactions with water of these two probes. This view is also supported by the relaxation behavior of the two probes.

Calculation of the front part of the sonic boom signature for a Maneuvering aerofopil

The sonic boom at a large distance from its source consists of a leading shock, a trailing shock and a one parameter family of nonlinear wavefronts in between these shocks. A new ray theoretical method using a shock ray theory and a weakly nonlinear lay theory has been used to obtain the shock fronts and wavefronts respectively, for a maneuvering aerofoil in a homogeneous medium. This method introduces a one parameter family of Cauchy problems to calculate the shock and wave fronts emerging from the surface of the aerofoil. These problems are solved numerically to obtain the leading shock front and the nonlinear wavefronts emerging from the front portion of the aerofoil.

Signature of a silver phase percolation threshold in microscopically phase separated ternary Ge0.15Se0.85-xAgx (0≤x≤0.20) glasses

Temperature modulated alternating differential scanning calorimetric studies show that Se rich Ge0.15Se0.85−xAgx (0 x 0.20) glasses are microscopically phase separated, containing Ag2Se phases embedded in a Ge0.15Se0.85 backbone. With increasing silver concentration, Ag2Se phase percolates in the Ge–Se matrix, with a well-defined percolation threshold at x = 0.10. A signature of this percolation transition is shown up in the thermal behavior, as the appearance of two exothermic crystallization peaks. Density, molar volume, and microhardness measurements, undertaken in the present study, also strongly support this view of percolation transition. The superionic conduction observed earlier in these glasses at higher silver proportions is likely to be connected with the silver phase percolation.

Evolution of 1/f α noise during electromigration stressing of metal film: Spectral signature of electromigration process

In this paper we report a systematic study of low-frequency 1/fα resistance fluctuation in a metal film at different stages of electromigration. The resistance fluctuation (noise) measurement was carried out in presence of a dc electromigration stressing current. We observe that in addition to the increase in the spectral power SV(f), the frequency dependence of the spectral power changes as the electromigration process progresses and the exponent α starts to change from 1 to higher value closer to 1.5. We interpret this change in α as arising due to an additional contribution to the spectral power with a 1/f3/2 component, which starts to contribute as the electromigration process progresses. This additional component SV(f) ∼ 1/f3/2 has been suggested to originate from long range diffusion that would accompany any electromigration process. The experimental observation finds support in a model simulation, where we also find that the enhancement of noise during electromigration stressing is accompanied by a change in spectral power frequency dependence.

An operator-splitting finite element method for the efficient parallel solution of multidimensional population balance systems

A finite element method for solving multidimensional population balance systems is proposed where the balance of fluid velocity, temperature and solute partial density is considered as a two-dimensional system and the balance of particle size distribution as a three-dimensional one. The method is based on a dimensional splitting into physical space and internal property variables. In addition, the operator splitting allows to decouple the equations for temperature, solute partial density and particle size distribution. Further, a nodal point based parallel finite element algorithm for multi-dimensional population balance systems is presented. The method is applied to study a crystallization process assuming, for simplicity, a size independent growth rate and neglecting agglomeration and breakage of particles. Simulations for different wall temperatures are performed to show the effect of cooling on the crystal growth. Although the method is described in detail only for the case of d=2 space and s=1 internal property variables it has the potential to be extendable to d+s variables, d=2, 3 and s >= 1. (C) 2011 Elsevier Ltd. All rights reserved.