Radiative interactions in boundary layers

A detailed description of radiative interactions in laminar compressible boundary layers for moderate Mach numbers is presented by way of asymptotic analysis and supporting solutions. The radiation field is described by the differential approximation. While the asymptotic analysis is valid for large N (the ratio of photon mean free path to molecular mean free path) and arbitrary Boltzmann number, Bo (the ratio of convective heat flux to radiation heat flux), the solutions are obtained for Bo [double less-than sign] 1, the case of strong radiative interactions. The asymptotic analysis shows the existence of an optically thin boundary layer for large N and all Bo. For Bo [double less-than sign] 1, two outer regions are observed — one optically thin (at short distances from the leading edge) and the other optically thick (at large distances from the leading edge). An interesting feature not pointed out in the previous literature is the existence of a wall layer at large distances from the leading edge where convective heat flux can be ignored to the leading order of approximation. The radiation field in all cases can be very well approximated by a one-dimensional description. The solutions have been constructed using the ideas of matched asymptotic expansions by approximate analytical procedures and numerical methods. It is shown that, to the leading order of approximation, the radiation slip method yields exactly the same result as the more complicated matching procedure. Both the cases of linear and nonlinear radiation have been considered, the former being of interest in developing approximate methods which are subsequently generalized to handle the nonlinear problem. Detailed results are presented for both cases.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.

Comparing type counts

This work is a case study of applying nonparametric statistical methods to corpus data. We show how to use ideas from permutation testing to answer linguistic questions related to morphological productivity and type richness. In particular, we study the use of the suffixes -ity and -ness in the 17th-century part of the Corpus of Early English Correspondence within the framework of historical sociolinguistics. Our hypothesis is that the productivity of -ity, as measured by type counts, is significantly low in letters written by women. To test such hypotheses, and to facilitate exploratory data analysis, we take the approach of computing accumulation curves for types and hapax legomena. We have developed an open source computer program which uses Monte Carlo sampling to compute the upper and lower bounds of these curves for one or more levels of statistical significance. By comparing the type accumulation from women’s letters with the bounds, we are able to confirm our hypothesis.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

A simple local 3-approximation algorithm for vertex cover

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required. (c) 2009 Elsevier B.V. All rights reserved.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

An optimal local approximation algorithm for max-min linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.

The chemistry of vetivalene-type vetivalene-type naturally-occurring sesquiterpenoids

Vetivalene, 1,4-dimetiiyl-6-isopropylnaphl1tlmlenc(1 ) represents a new sesquiterpene skelcton which 15 presumed to originate from eudesmane by a shift of the angular nicthyl group. Novel sesquiterpenm related to vetivalene have been isolated from plant sources ill ~s c e o ig ears. A suriey dealing xith the chemistry (structure, synthesis and configuration) of members of this interesting new class OF yesquiterpenes, coniprising occidol, risbitinol and the various ernmotinn is presented

The chemistry of vetivalene-type naturally occurring sesqufterpenoids

Vetivalene, 1,4-dimetiiyl-6-isopropylnaphl1tlmlenc(1 ) represents a new sesquiterpene skelcton which 15 presumed to originate from eudesmane by a shift of the angular nicthyl group. Novel sesquiterpenm related to vetivalene have been isolated from plant sources ill ~s c e o ig ears. A suriey dealing xith the chemistry (structure, synthesis and configuration) of members of this interesting new class OF yesquiterpenes, coniprising occidol, risbitinol and the various ernmotinn is presented.

Unified Galerkin- and DAE-Based Approximation of Fractional Order Systems

We consider numerical solutions of nonlinear multiterm fractional integrodifferential equations, where the order of the highest derivative is fractional and positive but is otherwise arbitrary. Here, we extend and unify our previous work, where a Galerkin method was developed for efficiently approximating fractional order operators and where elements of the present differential algebraic equation (DAE) formulation were introduced. The DAE system developed here for arbitrary orders of the fractional derivative includes an added block of equations for each fractional order operator, as well as forcing terms arising from nonzero initial conditions. We motivate and explain the structure of the DAE in detail. We explain how nonzero initial conditions should be incorporated within the approximation. We point out that our approach approximates the system and not a specific solution. Consequently, some questions not easily accessible to solvers of initial value problems, such as stability analyses, can be tackled using our approach. Numerical examples show excellent accuracy. DOI: 10.1115/1.4002516]

On the possibility of an alpha-sq omega-type dynamo in a thin layer inside the sun

If the solar dynamo operates in a thin layer of 10,000-km thickness at the interface between the convection zone and the radiative core, using the facts that the dynamo should have a period of 22 years and a half-wavelength of 40 deg in the theta-direction, it is possible to impose restrictions on the values which various dynamo parameters are allowed to have. It is pointed out that the dynamo should be of alpha-sq omega nature, and kinematical calculations are presented for free dynamo waves and for dynamos in thin rectangular slabs with appropriate boundary conditions. An alpha-sq omega dynamo is expected to produce a significant poloidal field which does not leak to the solar surface. It is found that the turbulent diffusity eta and alpha-coefficient are restricted to values within about a factor of 10, the median values being eta of about 10 to the 10th sq cm/sec and alpha of about 10 cm/sec. On the basis of mixing length theory, it is pointed out that such values imply a reasonable turbulent velocity of the order 30 m/s, but rather small turbulent length scales like 300 km.

Characterization and immune response of a protein produced by a cDNA clone of foot and mouth disease virus, type Asia 1 63/72

A 0.9 kb double stranded cDNA of foot and mouth disease virus (FMDV) Type Asia 1, 63/72 was cloned in an expression vector, pUR222. A protein of 38 kd was produced by the clone which reacted with the antibodies raised against the virus. A 20 kd protein which may be derived from the 38 kd protein contained the antigenic epitopes of the protein VP1 of the virus. Injection of 10-20 micrograms of the partially purified 38 and 20 kd proteins or a lysate of cells containing 240 micrograms of the proteins elicited high titers of FMDV specific antibodies in guinea pigs and cattle respectively. Also, at these concentrations, the proteins protected 5 of 8 guinea pigs and 3 of 8 cattle when challenged with a virulent virus.

Activation barriers for d.c. conductivity in ionic glasses: Classical calculations using the small-cluster approximation

A small-cluster approximation has been used to calculate the activation barriers for the d.c. conductivity in ionic glasses. The main emphasis of this approach is on the importance of the hitherto ignored polarization energy contribution to the total activation energy. For the first time it has been demonstrated that the d.c. conductivity activation energy can be calculated by considering ionic migration to a neighbouring vacancy in a smali cluster of ions consisting of face-sharing anion polyhedra. The activation energies from the model calculations have been compared with the experimental values in the case of highly modified lithium thioborate glasses.

Uncoupling Protein 2 and 3 Gene Polymorphisms and Their Association with Type 2 Diabetes in Asian Indians

Background: This study examined the association of -866G/A, Ala55Val, 45bpI/D, and -55C/T polymorphisms at the uncoupling protein (UCP) 3-2 loci with type 2 diabetes in Asian Indians. Methods: A case-control study was performed among 1,406 unrelated subjects (487 with type 2 diabetes and 919 normal glucose-tolerant NGT]), chosen from the Chennai Urban Rural Epidemiology Study, an ongoing population-based study in Southern India. The polymorphisms were genotyped using polymerase chain reaction-restriction fragment length polymorphism and direct sequencing. Haplotype frequencies were estimated using an expectation-maximization algorithm. Linkage disequilibrium was estimated from the estimates of haplotypic frequencies. Results: The genotype (P = 0.00006) and the allele (P = 0.00007) frequencies of Ala55Val of the UCP2 gene showed a significant protective effect against the development of type 2 diabetes. The odds ratios (adjusted for age, sex, and body mass index) for diabetes for individuals carrying Ala/Val was 0.72, and that for individuals carrying Val/Val was 0.37. Homeostasis insulin resistance model assessment and 2-h plasma glucose were significantly lower among Val-allele carriers compared to the Ala/Ala genotype within the NGT group. The genotype (P = 0.02) and the allele (P = 0.002) frequencies of -55C/T of the UCP3 gene showed a significant protective effect against the development of diabetes. The odds ratio for diabetes for individuals carrying CT was 0.79, and that for individuals carrying TT was 0.61. The haplotype analyses further confirmed the association of Ala55Val with diabetes, where the haplotypes carrying the Ala allele were significantly higher in the cases compared to controls. Conclusions: Ala55Val and -55C/T polymorphisms at the UCP3-2 loci are associated with a significantly reduced risk of developing type 2 diabetes in Asian Indians.