Structural effects on the vaporization of high molecular weight esters

To understand the effect of molecular weight and branching on the heats of vaporization (AH,) and their flow behavior, AH, and viscosity (7) were measured at different temperatures in the high molecular weight ester series: linear flexible di-n-alkyl sebacates and compact branched triglycerides with molecular weight ranging from 300 to 900. AHv" values (AHv corrected to 298 K) have been obtained with experimental AH, and also computed according to the group additivity method; a smaller-CH,- group value of 3.8 kJ mol-' compared to the normal value of 5.0 kJ mol-' is found to give good agreement with the experimental data (within 2-5% error). Both ester series have the same AH," irrespective of their molecular features, namely,shape, flexibility, and polarity, suggesting the coiling of the molecules during vaporization. The segmental motion of these ester series during their flow and its dependence on their molecular features unlike AH,' are demonstrated by the correlation of the enthalpy of activation for viscous flow (AH*) and the ratio AE,/AH* = n (AE, is the energy of vaporization) with molecular weight.

Chronic suppression of testicular function by constant infusion of gonadotropin-releasing hormone agonist and testosterone supplementation in the bonnet monkey (Macaca radiata)

Objective: To study the efficacy of long-term buserelin acetate infusion to desensitize pituitary and block testicular function in adult male monkeys (Macaca radiata). Animals: Proven fertile male monkeys exhibiting normal testicular function. Protocol: Each of the control (n = 5) and experimental monkeys (n = 10) received a fresh miniosmotic pump every 21 days, whereas pumps in controls delivered vehicle of experimentals released 50-mu-g buserelin acetate every 24 hours. On day 170 (renewed every 60 days) a silastic capsule containing crystalline testosterone (T) was implanted in the experimental monkeys. At the end of 3 years, treatment was stopped, and recovery of testicular function and fertility monitored. Results: (1) Treatment resulted in marked reduction of nocturnal but not basal serum T; (2) the pituitary remained desensitized to buserelin acetate throughout the 3-year period; (3) animals were largely azoospermic with occasional oligospermia exhibited by two monkeys; and (4) withdrawal of treatment restored testicular function, with 70% of animals regaining fertility. Conclusion: Long-term infertility (but restorable) can be induced in male monkeys by constant infusion of buserelin acetate and T.

Effect of constant infusion of gonadotropin releasing hormone (GnRH) agonist Buserelin and antagonist CDB 2085 A using osmotic minipumps on testicular function in adult male bonnet monkey (Macaca radiata)

The effect of chronic infusion of gonadotropic hormone agonist Buserelin or antagonist CDB 2085 A for 15 weeks via alzet minipumps in adult male bonnet monkeys was studied. Infusion of Buserelin resulted in a decrease in the difference between serum testosterone values at 22.00 hours and 10.00 hours, decrease in responsiveness to injected Buserelin as judged by change in serum testosterone values from pre-injection values and decrease in sperm counts. Infusion of antagonist resulted in a decrease in the difference between serum testosterone values at 22.00 hours and 10.00 hours.

Critical phenomena in polymer solutions: Scaling of the free energy

The thermodynamics of monodisperse solutions of polymers in the neighborhood of the phase separation temperature is studied by means of Wilson’s recursion relation approach, starting from an effective ϕ4 Hamiltonian derived from a continuum model of a many‐chain system in poor solvents. Details of the chain statistics are contained in the coefficients of the field variables ϕ, so that the parameter space of the Hamiltonian includes the temperature, coupling constant, molecular weight, and excluded volume interaction. The recursion relations are solved under a series of simplifying assumptions, providing the scaling forms of the relevant parameters, which are then used to determine the scaling form of the free energy. The free energy, in turn, is used to calculate the other singular thermodynamic properties of the solution. These are characteristically power laws in the reduced temperature and molecular weight, with the temperature exponents being the same as those of the 3d Ising model. The molecular weight exponents are unique to polymer solutions, and the calculated values compare well with the available experimental data.

Purification of 3,5-Dichlorocatechol 1,2-Dioxygenase, a Nonheme Iron Dioxygenase and a Key Enzyme in the Biodegradation of a Herbicide, 2,4-Dichlorophenoxyacetic acid (2,4-D), from Pseudomonas cepacia CSV90

An enzyme which cleaves the benzene ring of 3,5-dichiorocatechol has been purified to homogeneity from Pseudomonas cepacia CSV90, grown with 2,4-dichlorophenoxyacetic acid (2,4-D) as the sole carbon source. The enzyme was a nonheme ferric dioxygenase and catalyzed the intradiol cleavage of all the examined catechol derivatives, 3,5-dichlorocatechol having the highest specificity constant of 7.3 μM−1 s−1 in an air-saturated buffer. No extradiol-cleaving activity was observed. Thus, the enzyme was designated as 3,5-dichlorocatechol 1,2-dioxygenase. The molecular weight of the native enzyme was ascertained to be 56,000 by light scattering method, while the Mr value of the enzyme denatured with 6 M guanidine-HCl or sodium dodecyl sulfate was 29,000 or 31,600, respectively, suggesting that the enzyme was a homodimer. The iron content was estimated to be 0.89 mol per mole of enzyme. The enzyme was deep red and exhibited a broad absorption spectrum with a maximum at around 425 nm, which was bleached by sodium dithionite, and shifted to 515 nm upon anaerobic 3,5-dichlorocatechol binding. The catalytic constant and the Km values for 3,5-dichlorocatechol and oxygen were 34.7 s−1 and 4.4 and 652 μM, respectively, at pH 8 and 25°C. Some heavy metal ions, chelating agents and sulfhydryl reagents inhibited the activity. The NH2-terminal sequence was determined up to 44 amino acid residues and compared with those of the other catechol dioxygenases previously reported.

Minimum weight design of fiber-reinforced laminated composite structures with maximum stress and Tsai-Wu failure criteria

In this article, a minimum weight design of carbon/epoxy laminates is carried out using genetic algorithms. New failure envelopes have been developed by the combination of two commonly used phenomenological failure criteria, namely Maximum Stress (MS) and Tsai-Wu (TW) are used to obtain the minimum weight of the laminate. These failure envelopes are the most conservative failure envelope (MCFE) and the least conservative failure envelope (LCFE). Uniaxial and biaxial loading conditions are considered for the study and the differences in the optimal weight of the laminate are compared for the MCFE and LCFE. The MCFE can be used for design of critical load-carrying composites, while the LCFE could be used for the design of composite structures where weight reduction is much more important than safety such as unmanned air vehicles.

3-Dimensional laminar boundary-layer in a constant-pressure diverging

larity solution is obtained for laminar 3D constant pressure flow with lateral streamline divergence. The similarity solution is shown to reduce to a Blasius solution for 2D flow over a flat plate. Measurements of velocity profiles are made to compare the similarity solution and are found to be in excellent agreement with the prediction

On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding

The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.

Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems

For an n(t) transmit, n(r) receive antenna system (n(t) x nr system), a full-rate space time block code (STBC) transmits min(n(t), n(r)) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any n(r), with reduced ML-decoding complexity is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. By puncturing the symbols of the STBC, full rate designs can be obtained for n(r) < 4. For any value of n(r), the proposed design offers the least ML-decoding complexity among known codes. The proposed design is comparable in error performance to the well known Perfect code for 4 transmit antennas while offering lower ML-decoding complexity. Further, when n(r) < 4, the proposed design has higher ergodic capacity than the punctured Perfect code. Simulation results which corroborate these claims are presented.

Queued Cooperative Wireless Networks With Rateless Codes

Cooperative communication using rateless codes, in which the source transmits an infinite number of parity bits to the destination until the receipt of an acknowledgment, has recently attracted considerable interest. It provides a natural and efficient mechanism for accumulating mutual information from multiple transmitting relays. We develop an analysis of queued cooperative relay systems that combines the communication-theoretic transmission aspects of cooperative communication using rateless codes over Rayleigh fading channels with the queuing-theoretic aspects associated with buffering messages at the relays. Relay cooperation combined with queuing reduces the message transmission times and also helps distribute the traffic load in the network, which improves throughput significantly.

Practical constant-accuracy linear weir

This paper is concerned with the modifications of the Extended Bellmouth Weir (EBM weir) earlier designed by Keshava Murthy. It is shown that by providing inclined sides (equivalent to providing an inward-trapezoidal weir) over a sector of a circle of radius R, separated by a distance 2t, and depth d, the measurable range of EBM can be considerably enhanced (over 375%). Simultaneously, the other parameters of the weir are optimized such that the reference plane of the weir coincides with its crest making it a constant-accuracy linear weir. Discharge through the aforementioned weir is proportional to the depths of flow measured above the crest of the weir for all heads in the range of 0.5R less-than-or-equal-to h less-than-or-equal-to 7.9R, within a maximum deviation of +/-1% from the theoretical discharge. Experiments with two typical weirs show excellent agreement with the theory by giving a constant-average coefficient of discharge of 0.619

Code Generation Paradigms On Optical Orthogonal And Other Codes In a Fiber Optic CDMA Lan

Code Division Multiple Access (CDMA) techniques, by far, had been applied to LAN problems by many investigators, An analytical study of well known algorithms for generation of Orthogonal codes used in FO-CDMA systems like those for prime, quasi-Prime, Optical Orthogonal and Matrix codes has been presented, Algorithms for OOCs like Greedy/Modified Greedy/Accelerated Greedy algorithms are implemented. Many speed-up enhancements. for these algorithms are suggested. A novel Synthetic Algorithm based on Difference Sets (SADS) is also proposed. Investigations are made to vectorise/parallelise SADS to implement the source code on parallel machines. A new matrix for code families of OOCs with different seed code-words but having the same (n,w,lambda) set is formulated.