Jumping numbers of a simple complete ideal in a two-dimensional regular local ring

The multiplier ideals of an ideal in a regular local ring form a family of ideals parametrized by non-negative rational numbers. As the rational number increases the corresponding multiplier ideal remains unchanged until at some point it gets strictly smaller. A rational number where this kind of diminishing occurs is called a jumping number of the ideal. In this manuscript we shall give an explicit formula for the jumping numbers of a simple complete ideal in a two dimensional regular local ring. In particular, we obtain a formula for the jumping numbers of an analytically irreducible plane curve. We then show that the jumping numbers determine the equisingularity class of the curve.

Assessing the integrated sustainability of a public rental housing project from the perspective of complex eco-system

Public rental housing (PRH) projects are the mainstream of China's new affordable housing policies, and their integrated sustainability has a far-reaching effect on medium-low income families' well-being and social stability. However, there are few quantitative researches on the integrated sustainability of PRH projects. Our study tries to fill this gap through proposing an assessment model of the integrated sustainability for PRH projects. First, this paper defines what the sustainability of a PRH project is. Second, after constructing the sustainable system of a PRH project from the perspective of complex eco-system, the paper explores the internal operation mechanism and the coupling mechanism among the ecological, economic and social subsystems. Third, it identifies fourteen indices to represent the sustainability system of a PRH project, including six indices of ecological subsystem, five of economic subsystem and three of social subsystem. Fourth, it qualifies the weights of three subsystems and their internal representative indices. In addition, an assessment model is established through expert surveys and analytic network process (ANP). Finally, the paper carries out an empirical research on a PRH project in Nanjing city of China, followed by suggestions to enhance the integrated sustainability. The sustainability system and its evaluation model proposed in this paper are concise and easy to understand and can provide a theoretical foundation and a scientific basis for the evaluation and optimization of PRH projects.

The purification and properties of peroxidase in Mycobacterium tuberculosis H37Rv and its possible role in the mechanism of action of isonicotinic acid hydrazide

Peroxidase from Mycobacterium tuberculosis H37Rv was purified to homogeneity. The homogeneous protein exhibits catalase and Y (Youatt's)-enzyme activities in addition to peroxidase activity. Further confirmation that the three activities are due to a single enzyme was accomplished by other criteria, such as differential thermal inactivation, sensitivity to different inhibitors, and co-purification. The Y enzyme (peroxidase) was separated from NADase (NAD+ glycohydrolase) inhibitor by gel filtration on Sephadex G-200. The molecular weights of peroxidase and NADase inhibitor, as determined by gel filtration, are 240000 and 98000 respectively. The Y enzyme shows two Km values for both isoniazid (isonicotinic acid hydrazide) and NAD at low and high concentrations. Analysis of the data by Hill plots revealed that the enzyme has one binding site at lower substrate concentrations and more than one at higher substrate concentration. The enzyme contains 6g-atoms of iron/mol. Highly purified preparations of peroxidases from different sources catalyse the Y-enzyme reaction, suggesting that the nature of the reaction may be a peroxidatic oxidation of isoniazid. Moreover, the Y-enzyme reaction is enhanced by O2. Isoniazid-resistant mutants do not exhibit Y-enzyme, peroxidase or catalase activities, and do not take up isoniazid. The Y-enzyme reaction is therefore implicated in the uptake of the drug.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

A study of errors that can occur when weighing infants

When infants are weighed at well baby or infant welfare clinics, the weight change from one visit to the next is used as a guide to the welfare of the child. Infant welfare clinic nurses are expert clinicians who use weight measurements as a rough indicator of well-being only, as it is well known by them that these measurements are fraught with error. This paper calculates the amount of error which was found in repeated tests of weights of infants, and in the weight changes brought about by biological variation. As a result, it is recommended that babies under nine months of age be weighed at clinic visits no less than a fortnight apart, and older infants, at least one month apart. If they are weighed more often, then the weight changes detected will be less than the amount of error which affects the measurements.

Purification and characterization of two cellobiohydrolases from Chaetomium thermophile var. coprophile

Cellobiohydrolases I and II were purified to homogeneity from culture filtrates of a thermophilic fungus, Chaetomium thermophile var. coprophile, by using a combination of ion-exchange and gel filtration chromatographic procedures. The molecular weights of cellobiohydrolase I and II were estimated to be 60000 and 40000 and the enzymes were found to be glycoproteins containing 17 and 22.8% carbohydrate, respectively. The two forms differed in their amino-acid composition mainly with respect to threonine, alanine, methionine and arginine. Antibodies produced against either form of cellobiohydrolases failed to cross-react with the other. The tryptic maps of the two enzymes were found to be different. The temperature optima for cellobiohydrolase I and II were 75 and 70°C, and they were optimally active at pH 5.8 and 6.4, respectively. Both enzymes were stable at higher temperatures and were able to degrade crystalline cellulosic materals.

Thermal gap conductance at low contact pressures (<1 MPa): Effect of gold plating and plating thickness

Thermal contact conductance (TCC) measurements are made on bare and gold plated (<= 0.5 mu m) oxygen free high conductivity (OFHC) Cu and brass contacts in vacuum, nitrogen, and argon environments. It is observed that the TCC in gaseous environment is significantly higher than that in vacuum due to the enhanced thermal gap conductance. It is found that for a given contact load and gas pressure, the thermal gap conductance for bare OFHC Cu contacts is higher than that for gold plated contacts. It is due to the difference in the molecular weights of copper and gold, which influences the exchange of kinetic energy between the gas molecules and contact surfaces. Furthermore, the gap conductance is found to increase with increasing thickness of gold plating. Topography measurements and scanning electron microscopy (SEM) analysis of contact surfaces revealed that surfaces become smoother with increasing gold plating thickness, thus resulting in smaller gaps and consequently higher gap conductance. (C) 2010 Elsevier Ltd. All rights reserved.

Entropy and dynamics of water in hydration layers of a bilayer

We compute the entropy and transport properties of water in the hydration layer of dipalmitoylphosphatidylcholine bilayer by using a recently developed theoretical scheme two-phase thermodynamic model, termed as 2PT method; S.-T. Lin et al., J. Chem. Phys. 119, 11792 (2003)] based on the translational and rotational velocity autocorrelation functions and their power spectra. The weights of translational and rotational power spectra shift from higher to lower frequency as one goes from the bilayer interface to the bulk. Water molecules near the bilayer head groups have substantially lower entropy (48.36 J/mol/K) than water molecules in the intermediate region (51.36 J/mol/K), which have again lower entropy than the molecules (60.52 J/mol/K) in bulk. Thus, the entropic contribution to the free energy change (T Delta S) of transferring an interface water molecule to the bulk is 3.65 kJ/mol and of transferring intermediate water to the bulk is 2.75 kJ/mol at 300 K, which is to be compared with 6.03 kJ/mol for melting of ice at 273 K. The translational diffusion of water in the vicinity of the head groups is found to be in a subdiffusive regime and the rotational diffusion constant increases going away from the interface. This behavior is supported by the slower reorientational relaxation of the dipole vector and OH bond vector of interfacial water. The ratio of reorientational relaxation time for Legendre polynomials of order 1 and 2 is approximately 2 for interface, intermediate, and bulk water, indicating the presence of jump dynamics in these water molecules. (C) 2010 American Institute of Physics. doi:10.1063/1.3494115]

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Vitellins and vitellogenins of Dysdercus koenigii (Heteroptera : Pyrrhocoridae) - identification, purification and temporal pattern

Two vitellins, VtA and VtB, were purified from the eggs of Dysdercus koenigii by gel filtration and ion exchange chromatography. VtA and VtB have molecular weights of 290 and 260 kDa, respectively. Both Vts are glycolipoproteinaceous in nature. VtA is composed of three polypeptides of M-r 116, 92 and 62 kDa while VtB contained an additional subunit of M-r 40 kDa. All subunits except the 116-kDa subunit are glycolipopolypeptides. Polyclonal antibody raised against VtA (anti-VtA antibody) cross-reacted with VtB and also with vitellogenic haemolymph and ovaries and pre-vitellogenic fat bodies, but not with haemolymph from either adult male, fifth instar female, or pre-vitellogenic females demonstrating sex and stage specificity of the Vts. Immunoblots in the presence of anti-VtA revealed two proteins (of 290 and 260 kDa) in both vitellogenic haemolymph and pre-vitellogenic fat bodies that are recognised as D. koenigii Vgs. In newly emerged females, Vgs appeared on day 1 in fat bodies and on day 3 in haemolymph and ovaries. Vg concentration was maximum on day 2 in fat body, day 4 in haemolymph and day 7 in ovary. Although the biochemical and temporal characteristics of these proteins show similarity to some hemipterans, they are strikingly dissimilar with those of a very closely related species. (C) 1999 Elsevier Science Inc. All rights reserved.

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

Identification of Active Sources in Single-Channel Convolutive Mixtures Using Known Source Models

We address the problem of identifying the constituent sources in a single-sensor mixture signal consisting of contributions from multiple simultaneously active sources. We propose a generic framework for mixture signal analysis based on a latent variable approach. The basic idea of the approach is to detect known sources represented as stochastic models, in a single-channel mixture signal without performing signal separation. A given mixture signal is modeled as a convex combination of known source models and the weights of the models are estimated using the mixture signal. We show experimentally that these weights indicate the presence/absence of the respective sources. The performance of the proposed approach is illustrated through mixture speech data in a reverberant enclosure. For the task of identifying the constituent speakers using data from a single microphone, the proposed approach is able to identify the dominant source with up to 8 simultaneously active background sources in a room with RT60 = 250 ms, using models obtained from clean speech data for a Source to Interference Ratio (SIR) greater than 2 dB.

Experimental Studies on the Mechanics of Cohesive Frictional Granular Media

The mechanical behaviour of cohesive-frictional granular materials is a combination of the strength pervading as intergranular friction (represented as an angle of internal friction - Phi), and the cohesion (C) between these particles. Most behavioral or constitutive models of this class of granular materials comprise of a cohesion and frictional component with no regard to the length scale i.e. from the micro structural models through the continuum models. An experimental study has been made on a model granular material, viz. angular sand with different weights of binding agents (varying degrees of cohesion) at multiple length scales to physically map this phenomenon. Cylindrical specimen of various diameters - 10, 20, 38, 100, 150 mm (and with an aspect ratio of 2) are reconstituted with 2, 4 and 8% by weight of a binding agent. The magnitude of this cohesion is analyzed using uniaxial compression tests and it is assumed to correspond to the peak in the normalized stress-strain plot. Increase in the cohesive strength of the material is seen with increasing size of the specimen. A possibility of ``entanglement'' occurring in larger specimens is proposed as a possible reason for deviation from a continuum framework.

Ranking of global climate models for India using multicriterion analysis

Eleven GCMs (BCCR-BCCM2.0, INGV-ECHAM4, GFDL2.0, GFDL2.1, GISS, IPSL-CM4, MIROC3, MRI-CGCM2, NCAR-PCMI, UKMO-HADCM3 and UKMO-HADGEM1) were evaluated for India (covering 73 grid points of 2.5 degrees x 2.5 degrees) for the climate variable `precipitation rate' using 5 performance indicators. Performance indicators used were the correlation coefficient, normalised root mean square error, absolute normalised mean bias error, average absolute relative error and skill score. We used a nested bias correction methodology to remove the systematic biases in GCM simulations. The Entropy method was employed to obtain weights of these 5 indicators. Ranks of the 11 GCMs were obtained through a multicriterion decision-making outranking method, PROMETHEE-2 (Preference Ranking Organisation Method of Enrichment Evaluation). An equal weight scenario (assigning 0.2 weight for each indicator) was also used to rank the GCMs. An effort was also made to rank GCMs for 4 river basins (Godavari, Krishna, Mahanadi and Cauvery) in peninsular India. The upper Malaprabha catchment in Karnataka, India, was chosen to demonstrate the Entropy and PROMETHEE-2 methods. The Spearman rank correlation coefficient was employed to assess the association between the ranking patterns. Our results suggest that the ensemble of GFDL2.0, MIROC3, BCCR-BCCM2.0, UKMO-HADCM3, MPIECHAM4 and UKMO-HADGEM1 is suitable for India. The methodology proposed can be extended to rank GCMs for any selected region.

Suspensions of polymer-grafted nanoparticles with added polymers-Structure and effective pair-interactions

We present the results of combined experimental and theoretical (molecular dynamics simulations and integral equation theory) studies of the structure and effective interactions of suspensions of polymer grafted nanoparticles (PGNPs) in the presence of linear polymers. Due to the absence of systematic experimental and theoretical studies of PGNPs, it is widely believed that the structure and effective interactions in such binary mixtures would be very similar to those of an analogous soft colloidal material-star polymers. In our study, polystyrene-grafted gold nanoparticles with functionality f = 70 were mixed with linear polystyrene (PS) of two different molecular weights for obtaining two PGNP: PS size ratios, xi = 0.14 and 2.76 (where, xi = M-g/M-m, M-g and M-m being the molecular weights of grafting and matrix polymers, respectively). The experimental structure factor of PGNPs could be modeled with an effective potential (Model-X), which has been found to be widely applicable for star polymers. Similarly, the structure factor of the blends with xi = 0.14 could be modeled reasonably well, while the structure of blends with xi = 2.76 could not be captured, especially for high density of added polymers. A model (Model-Y) for effective interactions between PGNPs in a melt of matrix polymers also failed to provide good agreement with the experimental data for samples with xi = 2.76 and high density of added polymers. We tentatively attribute this anomaly in modeling the structure factor of blends with xi = 2.76 to the questionable assumption of Model-X in describing the added polymers as star polymers with functionality 2, which gets manifested in both polymer-polymer and polymer-PGNP interactions especially at higher fractions of added polymers. The failure of Model-Y may be due to the neglect of possible many-body interactions among PGNPs mediated by matrix polymers when the fraction of added polymers is high. These observations point to the need for a new framework to understand not only the structural behavior of PGNPs but also possibly their dynamics and thermo-mechanical properties as well. (C) 2015 AIP Publishing LLC.