1000 resultados para rescreening rates


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Heteronuclear multiple-quantum coherence relaxation rate are calculated for the individual transitions of the S spin in an AIS nuclear spin system assuming that the heteronucleus (S spin) has relaxation contributions from both intramolecular dipole-dipole and chemical shift anisotropy relaxation. The individual multiplet components of the heteronuclear zero- and double-quantum coherences are shown to have different transverse relaxation rates. The cross-correlation between the two relaxation mechanisms is shown to be the dominant cause of the calculated differential line broadening. Experimental data are presented using as an example a uniformly 15N labelled sample of human epidermal growth factor.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Theta(1) time units per histogram sample on a random geometric graph with noise-free links. The delay in computation is Theta(root n) time units. We further extend our approach to a network with noisy links. While the refresh rate remains Theta(1) time units per sample, the delay increases to Theta(root n log n). The number of transmissions in both cases is Theta(n) per histogram sample. The achieved Theta(1) refresh rate for PAC histogram computation is a significant improvement over the refresh rate of Theta(1/log n) for histogram computation in noiseless networks. We achieve this by operating in the supercritical thermodynamic regime where large pathways for communication build up, but the network may have more than one component. The largest component however will have an arbitrarily large fraction of nodes in order to enable approximate computation of the histogram to the desired level of accuracy. Operation in the supercritical thermodynamic regime also reduces energy consumption. A key step in the proof of our achievability result is the construction of a connected component having bounded degree and any desired fraction of nodes. This construction may also prove useful in other communication settings on the random geometric graph.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A remarkable difference is observed in the rates of [3,3]-sigmatropic rearrangement of aryl 4,6-di-O-acetyl-2,3-dideoxy-D-erythro-hex-2-enopyranosides 1 and 2; the slower reactivity of the alpha-isomers is consistent with AM1 calculated transition state energetics of model systems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Evolution of crystallographic texture during high strain rate deformation in FCC materials with different stacking fault energy (Ni, Cu, and Cu-10Zn alloy) has been studied. The texture evolved in FCC materials at these strain rates show little dependence on the Stacking Fault Energy and the amount of deformation. Copper shows an anomalous behavior that is attributed to the ease of cross slip and continuous Dynamic Recrystallization that are operative under the experimental conditions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The evolution of microstructure and texture during room temperature compression of commercially pure Ti with four different initial orientations were studied under quasi-static and dynamic loading conditions. At a low strain rate (epsilon)over dot = 3 x 10(-4) s(-1) the different initial textures yielded the same end texture, despite different microstructural evolution in terms of twin boundaries. High strain rate deformation at (epsilon)over dot = 1.5 x 10(3) s(-1) was characterized by extensive twinning and evolution of a texture that was similar to that at low strain rate with minor differences. However, there was a significant difference in the strength of the texture for different orientations that was absent for low strain rate deformed samples at high strain rate. A viscoplastic self-consistent model with a secant approach was used to corroborate the experimental results by simulation. (C) 2011 Published by Elsevier Ltd. on behalf of Acta Materialia Inc.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Experiments were conducted on the oxygen transfer coefficient, k(L)a(20), through surface aeration in geometrically similar square tanks, with a rotor of diameter D fitted with six flat blades. An optimal geometric similarity of various linear dimensions, which produced maximum k(L)a(20) for any rotational speed of rotor N by an earlier study, was maintained. A simulation equation uniquely correlating k = k(L)a(20)(nu/g(2))(1/3) (nu and g are kinematic viscosity of water and gravitational constant, respectively), and a parameter governing the theoretical power per unit volume, X = (ND2)-D-3/(g(4/3)nu(1/3)), is developed. Such a simulation equation can be used to predict maximum k for any N in any size of such geometrically similar square tanks. An example illustrating the application of results is presented. Also, it has been established that neither the Reynolds criterion nor the Froude criterion is singularly valid to simulate either k or K = k(L)a(20)/N, simultaneously in all the sizes of tanks, even through they are geometrically similar. Occurrence of "scale effects" due to the Reynolds and the Froude laws of similitude on both k and K are also evaluated.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the problem of compression via homomorphic encoding of a source having a group alphabet. This is motivated by the problem of distributed function computation, where it is known that if one is only interested in computing a function of several sources, then one can at times improve upon the compression rate required by the Slepian-Wolf bound. The functions of interest are those which could be represented by the binary operation in the group. We first consider the case when the source alphabet is the cyclic Abelian group, Zpr. In this scenario, we show that the set of achievable rates provided by Krithivasan and Pradhan [1], is indeed the best possible. In addition to that, we provide a simpler proof of their achievability result. In the case of a general Abelian group, an improved achievable rate region is presented than what was obtained by Krithivasan and Pradhan. We then consider the case when the source alphabet is a non-Abelian group. We show that if all the source symbols have non-zero probability and the center of the group is trivial, then it is impossible to compress such a source if one employs a homomorphic encoder. Finally, we present certain non-homomorphic encoders, which also are suitable in the context of function computation over non-Abelian group sources and provide rate regions achieved by these encoders.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We report the first synthesis of hyperbranched polyacetals via a melt transacetalization polymerization process. The process proceeds via the self-condensation of an AB(2) type monomer carrying a hydroxyl group and a dimethylacetal unit; the continuous removal of low boiling methanol drives the equilibrium toward polymer formation. Because of the susceptibility of the acetal linkage to hydrolysis, the polymer degrades readily under mildly acidic conditions to yield the corresponding hydroxyl aldehyde as the primary product. Furthermore, because of the unique topology of hyperbranched structures, the rate of polymer degradation was readily tuned by changing just the nature of the end-groups alone; instead of the dimethylacetal bearing monomer, longer chain dialkylacetals (dibutyl and dihexyl) monomers yielded hyperbranched polymers carrying longer alkyl groups at their molecular periphery. The highly branched topology and the relatively high volume fraction of the terminal alkyl groups resulted in a significant lowering of the ingress rates of the aqueous reagents to the loci of degradation, and consequently the degradation rates of the polymers were dramatically influenced by the hydrophobic nature of the terminal alkyl substituents. The simple synthesis and easy tunability of the degradation rates make these materials fairly attractive candidates for use as degradable scaffolds.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The growth and dissolution dynamics of nonequilibrium crystal size distributions (CSDs) can be determined by solving the governing population balance equations (PBEs) representing reversible addition or dissociation. New PBEs are considered that intrinsically incorporate growth dispersion and yield complete CSDs. We present two approaches to solving the PBEs, a moment method and a numerical scheme. The results of the numerical scheme agree with the moment technique, which can be solved exactly when powers on mass-dependent growth and dissolution rate coefficients are either zero or one. The numerical scheme is more general and can be applied when the powers of the rate coefficients are non-integers or greater than unity. The influence of the size dependent rates on the time variation of the CSDs indicates that as equilibrium is approached, the CSDs become narrow when the exponent on the growth rate is less than the exponent on the dissolution rate. If the exponent on the growth rate is greater than the exponent on the dissolution rate, then the polydispersity continues to broaden. The computation method applies for crystals large enough that interfacial stability issues, such as ripening, can be neglected. (C) 2002 Elsevier Science B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Throughput analysis of bulk TCP downloads in cases where all WLAN stations are associated at the same rate with the AP is available in the literature. In this paper,we extend the analysis to TCP uploads for the case of multirate associations. The approach is based on a two-dimensional semi- Markov model for the number of backlogged stations. Analytical results are in excellent agreement with simulations performed using QUALNET 4.5.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The theory of phase formation is generalised for any arbitrary time dependence of nucleation and growth rates. Some sources of this time dependence are time-dependent potential inputs, ohmic drop and the ingestion effect. Particular cases, such as potentiostatic and, especially, linear potential sweep, are worked out for the two limiting cases of nucleation, namely instantaneous and progressive. The ohmic drop is discussed and a procedure for this correction is indicated. Recent results of Angerstein-Kozlowska, Conway and Klinger are critically investigated. Several earlier results are deduced as special cases. Evans' overlap formula is generalised for the time-dependent case and the equivalence between Avrami's and Evans' equations established.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper addresses the problem of maximum margin classification given the moments of class conditional densities and the false positive and false negative error rates. Using Chebyshev inequalities, the problem can be posed as a second order cone programming problem. The dual of the formulation leads to a geometric optimization problem, that of computing the distance between two ellipsoids, which is solved by an iterative algorithm. The formulation is extended to non-linear classifiers using kernel methods. The resultant classifiers are applied to the case of classification of unbalanced datasets with asymmetric costs for misclassification. Experimental results on benchmark datasets show the efficacy of the proposed method.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The relations for the growth and consumption rates of a layer with finite thickness as an end member and the product phases in the interdiffusion zone are developed. We have used two different methodologies, the diffusion based and the physico-chemical approach to develop the same relations. We have shown that the diffusion based approach is rather straightforward; however, the physico-chemical approach is much more versatile than the other method. It was found that the position of the marker plane becomes vague in the second stage of the interdiffusion process in pure A thin layer/B couple, where two phases grow simultaneously.