Biodegradation of chlorpyrifos by either single or combined cultures of some soilborne plant pathogenic fungi

Biodegradation of chlorpyrifos was studied in liquid culture media amended with either single or combined eight different plant pathogenic fungi isolated from the continuous cropping wheat fields. The average recovery of chlorpyrifos from the liquid media was found to be 86.1%. The detection limit of chlorpyrifos by the analytical method used was 19 ppb. Data showed that the growth of mixed fungi at concentrations up to 200 ppm of chlorpyrifos was higher than in the control treatment. Chlorpyrifos concentrations declined in the medium of combined fungi more than it did in the medium of any single fungus with increase in the incubation period. The amount of chlorpyrifos recovered was 79.8 ppm (39.9%) in the combined fungal cultures after 21 days. However, those recovered from the media of Fusarium graminearum, F. oxysporum, Rhizoctonia solani, Cladosporium cladosporiodes, Cephalosporium sp., Trichoderma viridi, Alternaria alternata, and Cladorrhinum brunnescens, ranged from 48.0 to 74.8%. The half-life value (T1/2) for chlorpyrifos was 15.8 day in the medium amended with mixed fungi. However, for the single cultures it ranged from 19.3 to 33.0 day.     

Comment and discussion on digital processing of PD pulses

Some of the more salient aspects of the digital processing technology of PD signals are examined. Most of the efforts in this field are concentrated on the application of digital analyzers for pulse height analysis, pattern recognition and identification of the physical phenomena. It is demonstrated that errors in the signal processing unit can lead to dominant mistakes in the interpretation of the test results     

Characterization and optimization of linearly tapered slot antenna pattern

A parametric study of linearly tapered slot antenna (LTSA) in air and a method for optimization of its pattern are presented. A method of moments code is utilized to investigate the behavior of LTSA’s as the length, height and the taper angle varies. It is shown that the antenna pattern can be improved using a top layer of dielectric material with varying permittivity.     

Evaluation of multicast routing algorithms for real-timecommunication on high-speed networks

Multicast (MC) routing algorithms capable of satisfying the quality of service (QoS) requirements of real-time applications will be essential for future high-speed networks. We compare the performance of all of the important MC routing algorithms when applied to networks with asymmetric link loads. Each algorithm is judged based on the quality of the MC trees it generates and its efficiency in managing the network resources. Simulation results over random networks show that unconstrained algorithms are not capable of fulfilling the QoS requirements of real-time applications in wide-area networks. Simulations also reveal that one of the unconstrained algorithms, reverse path multicasting (RPM), is quite inefficient when applied to asymmetric networks. We study how combining routing with resource reservation and admission control improves the RPM's efficiency in managing the network resources. The performance of one semiconstrained heuristic, MSC, three constrained Steiner tree (CST) heuristics, Kompella, Pasquale, and Polyzos (1992), constrained adaptive ordering (CAO), and bounded shortest multicast algorithm (BSMA), and one constrained shortest path tree (CSPT) heuristic, the constrained Dijkstra heuristic (CDKS) are also studied. Simulations show that the semiconstrained and constrained heuristics are capable of successfully constructing MC trees which satisfy the QoS requirements of real-time traffic. However, the cost performance of the heuristics varies. The BSMA's MC trees are lower in cost than all other constrained heuristics. Finally, we compare the execution times of all algorithms, unconstrained, semiconstrained, and constrained     

Theory of a novel voltage-sustaining layer for power devices

The theory of a novel voltage-sustaining layer for power devices, called a Composite Buffer layer (CB-layer for short) is proposed. The CB-layer can be implemented in several ways, one particular implementation is used here, which consists of alternating n- and p-type regions, that are parallel to the direction of the applied electric field. In the off-state, the fields induced by the depletion charges of both region types compensate each other to allowing the doping in both n-regions and p-regions to be very high without causing a reduction of the breakdown voltage. In the onstate the heavy doping ensures the voltage drop is very low and that the saturation current density high. A simple relationship between the specific on-resistance and R_on and the sustaining voltage V_B can be shown to be R_on=2.53 × 10⁻⁷bV_B^1.23 ωcm², where the breadth b (in μm) of each region is much smaller than the thickness W. The design method of the CB-layer is discussed in some detail. The simulation results are shown to be in perfect agreement with the theory. The structure has application to a wide variety of different power devices. An RMOST structure has been used to demonstrate the benefits of the technique in the paper, for which excellent performance is demonstrated.     

Cit-CSP及其应用

介绍了Cit-CSP--Cit/E-commerce信息安全保障平台子系统，并阐述了它所提供的消息摘要、块加密、加密(公钥)、签名和MAC等功能和服务。     

基于加载算法的室内无线信道OFDM接收机的性能

本文研究了无线局域网中使信号频谱得到优化的一种简单OFDM子载波加载算法。此算法基于边缘自适应（Margin Adaptive）加载准则及其在室内无线信道上的性能。     

Microscale and mesoscale discrete models for dynamic fracture of structures built of brittle material

In this work we present the discrete models for dynamic fracture of structures built of brittle materials. The models construction is based on Voronoi cell representation of the heterogeneous structure, with the beam lattice network used to model the cohesive and compressive forces between the neighboring cells. Each lattice component is a geometrically exact shear deformable beam which can describe large rigid body motion and the most salient fracture mechanisms. The latter can be represented through the corresponding form of the beam constitutive equations, which are derived either at microscale with random distribution of material properties or at a mesoscale with average deterministic values. The proposed models are also placed within the framework of dynamics, where special attention is paid to constructing the lattice network mass matrix as well as the corresponding time-stepping schemes. Numerical simulations of compression and bending tests is given to illustrate the models performance.     

Optimal task allocation in hypercube multiprocessor ensembles

Criteria are established to determine the optimal policy for allocating a set of uniform tasks onto a multiprocessor hypercube ensemble. It is shown that the optimal policy depends on the ratio of computation to intertask communication required by the distributed program, and that based on this ratio, tasks should be placed either all on one processor or uniformly distributed over the largest possible hypercube.     

Concurrent Cholesky factorization of positive definite banded Hermitian-matrices

First the Cholesky factorization is extended to cover uniformly partitioned banded positive definite matrices of rank n which may be real symmetric or Hermitian. Then two stratagems are given for the use of the algorithm in concurrent machines where the number of processing elements is less than required to factor the matrix in as few serial steps as possible, and where uniformly high efficiency is expected from all processing elements. Expressions are given for the efficiency factor e appearing in the speed-up expression g = eN, and these are specialized for the N node hypercube machine as a function of partition size s, the number N of processing elements of the hypercube machine, and the cost μ of interelement transmission relative to computation. It is shown that efficiency factor e is inversely proportional to μ/s, and that e is almost independent of N when N is large and μ/s = 0. The task is completed in n/s serial steps with no limit on n. The half bandwidth b of the matrix is 2Ns.