ZAG100－1000／35型全自动压滤机的研制与应用

介绍了ＺＡＧ１００－１０００／３５型全自动压滤机的研制与应用情况．表明机组主机结构、生产能力、自控水平均比引进产品有所提高，整机性能良好。     

Exact Algorithms for Linear Programming over Algebraic Extensions

Abstract. We study the computational complexity of linear programs with coefficients that are real algebraic numbers under a Turing machine model of computation. After reviewing a method for exact representation of algebraic numbers under the Turing model, we show that the fundamental tasks of comparison and arithmetic can be performed in polynomial time. Our technique for establishing polynomial-time algorithms for comparison and arithmetic is distinct from the usual resultant-based approaches, and has the advantage that it provides a natural framework for analysis of the complexity of computational tasks, such as Gaussian elimination, that involve a sequence of arithmetic operations. Our main contribution is to show that a variant of the ellipsoid method can be used to solve linear programming in time polynomial in the encoding size of the problem coefficients and the degree of any algebraic extension that contains those coefficients.     

Post-stress interface trap generation induced by oxide-field stresswith FN injection

Interface trap generation in nMOS transistors during both stressing and post-stress periods under the conditions of oxide field (dynamic and dc) stress with FN injection is investigated with charge pumping technique. In contrast to the post-stress interface trap generation induced by hot carrier stress which is a logarithmical function of post-stress time, the post-stress interface trap generation induced by oxide-field stress with FN injection first increases with post-stress time but then becomes saturated. The mechanisms for the interface trap generation in both stressing and post-stress periods are described     

Polynomial algorithms for linear programming over the algebraic numbers

We derive a bound on the computational complexity of linear programs whose coefficients are real algebraic numbers. Key to this result is a notion of problem size that is analogous in function to the binary size of a rational-number problem. We also view the coefficients of a linear program as members of a finite algebraic extension of the rational numbers. The degree of this extension is an upper bound on the degree of any algebraic number that can occur during the course of the algorithm, and in this sense can be viewed as a supplementary measure of problem dimension. Working under an arithmetic model of computation, and making use of a tool for obtaining upper and lower bounds on polynomial functions of algebraic numbers, we derive an algorithm based on the ellipsoid method that runs in time bounded by a polynomial in the dimension, degree, and size of the linear program. Similar results hold under a rational number model of computation, given a suitable binary encoding of the problem input.This research was founded by the National Science Foundation under Grant DMS88-10192.     

An ontological metamodel for cyber-physical system safety,security, and resilience coengineering

Software and Systems Modeling - Cyber-physical systems are complex systems that require the integration of diverse software, firmware, and hardware to be practical and useful. This increased...     

Deconvolution of 2D coincident Doppler broadening spectroscopy using the Richardson–Lucy algorithm

Coincident Doppler Broadening Spectroscopy (CDBS) measurements are popular in positron solid-state studies of materials. By utilizing the instrumental resolution function obtained from a gamma line close in energy to the 511 keV annihilation line, it is possible to significantly enhance the quality of the CDBS spectra using deconvolution algorithms. In this paper, we compare two algorithms, namely the Non-Negativity Least Squares (NNLS) regularized method and the Richardson–Lucy (RL) algorithm. The latter, which is based on the method of maximum likelihood, is found to give superior results to the regularized least-squares algorithm and with significantly less computer processing time.     

80-Gb/s InP-based waveguide-integrated photoreceiver

A waveguide-integrated photoreceiver, comprising a waveguide-integrated photodiode and a distributed amplifier, is presented. Its optical to electrical conversion capability for nonreturn to zero modulated data rates up to 80 Gb/s is demonstrated. The receiver optoelectronic integrated circuit was packaged into a pig-tailed module with a 1 mm connector output.