A fixed-grid finite element based enthalpy formulation for generalized phase change problems: role of superficial mushy region

The enthalpy method is primarily developed for studying phase change in a multicomponent material, characterized by a continuous liquid volume fraction (phi(1)) vs temperature (T) relationship. Using the Galerkin finite element method we obtain solutions to the enthalpy formulation for phase change in 1D slabs of pure material, by assuming a superficial phase change region (linear (phi(1) vs T) around the discontinuity at the melting point. Errors between the computed and analytical solutions are evaluated for the fluxes at, and positions of, the freezing front, for different widths of the superficial phase change region and spatial discretizations with linear and quadratic basis functions. For Stefan number (St) varying between 0.1 and 10 the method is relatively insensitive to spatial discretization and widths of the superficial phase change region. Greater sensitivity is observed at St = 0.01, where the variation in the enthalpy is large. In general the width of the superficial phase change region should span at least 2-3 Gauss quadrature points for the enthalpy to be computed accurately. The method is applied to study conventional melting of slabs of frozen brine and ice. Regardless of the forms for the phi(1) vs T relationships, the thawing times were found to scale as the square of the slab thickness. The ability of the method to efficiently capture multiple thawing fronts which may originate at any spatial location within the sample, is illustrated with the microwave thawing of slabs and 2D cylinders. (C) 2002 Elsevier Science Ltd. All rights reserved.

Cyclic Prefix Based Cooperative Sequential Spectrum Sensing Algorithms for OFDM

This paper considers the problem of spectrum sensing in cognitive radio networks when the primary user is using Orthogonal Frequency Division Multiplexing (OFDM). For this we develop cooperative sequential detection algorithms that use the autocorrelation property of cyclic prefix (CP) used in OFDM systems. We study the effect of timing and frequency offset, IQ-imbalance and uncertainty in noise and transmit power. We also modify the detector to mitigate the effects of these impairments. The performance of the proposed algorithms is studied via simulations. We show that sequential detection can significantly improve the performance over a fixed sample size detector.

Automatic decomposition of unstructured meshes employing genetic algorithms for parallel FEM computations

Parallel execution of computational mechanics codes requires efficient mesh-partitioning techniques. These mesh-partitioning techniques divide the mesh into specified number of submeshes of approximately the same size and at the same time, minimise the interface nodes of the submeshes. This paper describes a new mesh partitioning technique, employing Genetic Algorithms. The proposed algorithm operates on the deduced graph (dual or nodal graph) of the given finite element mesh rather than directly on the mesh itself. The algorithm works by first constructing a coarse graph approximation using an automatic graph coarsening method. The coarse graph is partitioned and the results are interpolated onto the original graph to initialise an optimisation of the graph partition problem. In practice, hierarchy of (usually more than two) graphs are used to obtain the final graph partition. The proposed partitioning algorithm is applied to graphs derived from unstructured finite element meshes describing practical engineering problems and also several example graphs related to finite element meshes given in the literature. The test results indicate that the proposed GA based graph partitioning algorithm generates high quality partitions and are superior to spectral and multilevel graph partitioning algorithms.

Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

Improved preprocessing methods for modulo scheduling algorithms

Instruction scheduling with an automaton-based resource conflict model is well-established for normal scheduling. Such models have been generalized to software pipelining in the modulo-scheduling framework. One weakness with existing methods is that a distinct automaton must be constructed for each combination of a reservation table and initiation interval. In this work, we present a different approach to model conflicts. We construct one automaton for each reservation table which acts as a compact encoding of all the conflict automata for this table, which can be recovered for use in modulo-scheduling. The basic premise of the construction is to move away from the Proebsting-Fraser model of conflict automaton to the Muller model of automaton modelling issue sequences. The latter turns out to be useful and efficient in this situation. Having constructed this automaton, we show how to improve the estimate of resource constrained initiation interval. Such a bound is always better than the average-use estimate. We show that our bound is safe: it is always lower than the true initiation interval. This use of the automaton is orthogonal to its use in modulo-scheduling. Once we generate the required information during pre-processing, we can compute the lower bound for a program without any further reference to the automaton.

Phenobarbitone-mediated translocation of the cytosolic proteins interacting with the 5 '-proximal region of rat liver CYP2B1/B2 gene into the nucleus

The positive element (PE) (-69 to -98 bp) within the 5'-proximal region of the CYP2B1B2 gene (+1 to -179 bp) of rat liver is essential for phenobarbitone (PB) response and gives a single major complex with the rat liver cytosol in gel shift analysis. This complex corresponds to complex I (top) of the three complexes given by the nuclear extracts. PB treatment of rats leads to a decrease in complex I formation with the cytosol and PE and an increase in the same with the nuclear extract in gel shift analysis. Both the changes are counteracted by simultaneous okadaic acid administration. The nuclear protein giving rise to complex I has been isolated and has an M-r of 26 kDa. The cytosolic counterpart consists of two species, 26 and 28 kDa, as revealed by Southwestern blot analysis using labeled PE. It is concluded that PB treatment leads to the translocation accompanied by processing of the cytosolic protein species into the nucleus that requires protein dephosphorylation. It is suggested that PB may exert a global regulation on the transcription of many genes by modulating the phosphorylation status of different protein factors involved in transcriptional regulation. (C) 2002 Elsevier Science (USA).

Unsymmetrical aryl disulfides with excellent transparency in the visible region for second order nonlinear optics

Several unsymmetrically substituted aromatic donor acceptor disulfides have been synthesized and analysed for their second order nonlinear optical properties. These molecules exhibit moderately high first hyperpolarizability (beta) with excellent transparency in the visible region. Most of the unsymmetrical disulfides have a cut-off wavelength below 420 nm. Calculations show that the molecules have an asymmetric charge distribution around the disulfide bond which is responsible for their high beta values. These results provide motivation for the design and synthesis of nonlinear optical chromophores with multiple disulfide bonds for large second order nonlinearity and excellent visible transparency.

The central region of meso-3,4-diphenylhexane-2,5-dione

As with 1,2-diphenylethane (dpe), X-ray crystallographic methods measure the central bond in meso-3,4-diphenylhexane-2,5-done (dphd) as significantly shorter than normal for an sp(3)-sp(3) bond. The same methods measure the benzylic (ethane C-Ph) bonds in dphd as unusually long for sp(3)-sp(2) liaisons. Torsional motions of the phenyl rings about the C-Ph bonds have been proposed as the artifacts behind the result of a 'short' central bond in dpe. While a similar explanation can, presumably, hold for the even 'shorter' central bond in dphd, it cannot account for the 'long' C-Ph bonds. The phenyl groups, departing much from regular hexagonal shape, adopt highly skewed conformations with respect to the plane constituted by the four central atoms. It is thought that-the thermal motions of the phenyl rings, conditioned by the potential wells in which they are ensconced in the unit cell, are largely libratory around their normal axes. In what appears to be a straightforward explanation under the 'rigid-body' concept, it appears that these libratory motions of the phenyl rings, that account, at the same time, for the 'short' central bond, are the artifacts behind the 'long' measurement of the C-Ph bonds. These motions could be superimposed on torsional motions analogous to those proposed in the case of dpe. An inspection of the ORTEP diagram from the 298 K data on dphd clearly suggests these possibilities. Supportive evidence for these qualitative explanations from an analysis of the differences between the mean square displacements of C(1) and C(7)/C(1a) and C(7a) based on the 'rigid-body model' is discussed. (C) 2002 Elsevier Science B.V. All rights reserved.

Recombination Drives Genetic Diversification of Streptococcus dysgalactiae Subspecies equisimilis in a Region of Streptococcal Endemicity

Infection of the skin or throat by Streptococcus dysgalactiae subspecies equisimilis (SDSE) may result in a number of human diseases. To understand mechanisms that give rise to new genetic variants in this species, we used multi-locus sequence typing (MLST) to characterise relationships in the SDSE population from India, a country where streptococcal disease is endemic. The study revealed Indian SDSE isolates have sequence types (STs) predominantly different to those reported from other regions of the world. Emm-ST combinations in India are also largely unique. Split decomposition analysis, the presence of emm-types in unrelated clonal complexes, and analysis of phylogenetic trees based on concatenated sequences all reveal an extensive history of recombination within the population. The ratio of recombination to mutation (r/m) events (11:1) and per site r/m ratio (41:1) in this population is twice as high as reported for SDSE from non-endemic regions. Recombination involving the emm-gene is also more frequent than recombination involving housekeeping genes, consistent with diversification of M proteins offering selective advantages to the pathogen. Our data demonstrate that genetic recombination in endemic regions is more frequent than non-endemic regions, and gives rise to novel local SDSE variants, some of which may have increased fitness or pathogenic potential.

CUSUM Based Distributed Detection in WSNs

We are concerned with the situation in which a wireless sensor network is deployed in a region, for the purpose of detecting an event occurring at a random time and at a random location. The sensor nodes periodically sample their environment (e.g., for acoustic energy),process the observations (in our case, using a CUSUM-based algorithm) and send a local decision (which is binary in nature) to the fusion centre. The fusion centre collects these local decisions and uses a fusion rule to process the sensors’ local decisions and infer the state of nature, i.e., if an event has occurred or not. Our main contribution is in analyzing two local detection rules in combination with a simple fusion rule. The local detection algorithms are based on the nonparametric CUSUMprocedure from sequential statistics. We also propose two ways to operate the local detectors after an alarm. These alternatives when combined in various ways yield several approaches. Our contribution is to provide analytical techniques to calculate false alarm measures, by the use of which the local detector thresholds can be set. Simulation results are provided to evaluate the accuracy of our analysis. As an illustration we provide a design example. We also use simulations to compare the detection delays incurred in these algorithms.

Low complexity Bit allocation algorithms for AAC encoding

We have developed two reduced complexity bit-allocation algorithms for MP3/AAC based audio encoding, which can be useful at low bit-rates. One algorithm derives optimum bit-allocation using constrained optimization of weighted noise-to-mask ratio and the second algorithm uses decoupled iterations for distortion control and rate control, with convergence criteria. MUSHRA based evaluation indicated that the new algorithm would be comparable to AAC but requiring only about 1/10 th the complexity.

Efficient Algorithms for Combinatorial Auctions with Volume Discounts Arising in Web Service Composition

Web services are now a key ingredient of software services offered by software enterprises. Many standardized web services are now available as commodity offerings from web service providers. An important problem for a web service requester is the web service composition problem which involves selecting the right mix of web service offerings to execute an end-to-end business process. Web service offerings are now available in bundled form as composite web services and more recently, volume discounts are also on offer, based on the number of executions of web services requested. In this paper, we develop efficient algorithms for the web service composition problem in the presence of composite web service offerings and volume discounts. We model this problem as a combinatorial auction with volume discounts. We first develop efficient polynomial time algorithms when the end-to-end service involves a linear workflow of web services. Next we develop efficient polynomial time algorithms when the end-to-end service involves a tree workflow of web services.

Faster Algorithms for Incremental Topological Ordering.Robert Tarjan

We present two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm takes O(m 1/2) amortized time per arc and our second algorithm takes O(n 2.5/m) amortized time per arc, where n is the number of vertices and m is the total number of arcs. For sparse graphs, our O(m 1/2) bound improves the best previous bound by a factor of logn and is tight to within a constant factor for a natural class of algorithms that includes all the existing ones. Our main insight is that the two-way search method of previous algorithms does not require an ordered search, but can be more general, allowing us to avoid the use of heaps (priority queues). Instead, the deterministic version of our algorithm uses (approximate) median-finding; the randomized version of our algorithm uses uniform random sampling. For dense graphs, our O(n 2.5/m) bound improves the best previously published bound by a factor of n 1/4 and a recent bound obtained independently of our work by a factor of logn. Our main insight is that graph search is wasteful when the graph is dense and can be avoided by searching the topological order space instead. Our algorithms extend to the maintenance of strong components, in the same asymptotic time bounds.