农村通自来水工程若干技术问题初探

根据在农村通自来水工程实践中积累的经验,提出并较好地解决了农村供水工程的评价标准,设计供水时间的确定,输配水管网设计中的优化等问题,对建好、管好和用好农村自来水工程具有一定的帮助作用.     

Tri-Gate Bulk MOSFET Design for CMOS Scaling to the End of the Roadmap

A tri-gate bulk MOSFET design utilizing a low-aspect-ratio channel is proposed to provide an evolutionary pathway for CMOS scaling to the end of the roadmap. 3-D device simulations indicate that this design offers the advantages of a multi-gate FET (reduced variability in performance and improved scalability) together with the advantages of a conventional planar MOSFET (low substrate cost and capability for dynamic threshold-voltage control).     

Optimal and self‐tuning fusion Kalman filters for discrete‐time stochastic singular systems

Based on the optimal fusion estimation algorithm weighted by scalars in the linear minimum variance sense, a distributed optimal fusion Kalman filter weighted by scalars is presented for discrete‐time stochastic singular systems with multiple sensors and correlated noises. A cross‐covariance matrix of filtering errors between any two sensors is derived. When the noise statistical information is unknown, a distributed identification approach is presented based on correlation functions and the weighted average method. Further, a distributed self‐tuning fusion filter is given, which includes two stage fusions where the first‐stage fusion is used to identify the noise covariance and the second‐stage fusion is used to obtain the fusion state filter. A simulation verifies the effectiveness of the proposed algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

Recrystallization of phenylbutazone using supercritical fluid antisolvent process

Phenylbutazone was recrystallized from its solutions by using a supercritical fluid antisolvent process. It was dissolved in acetone and supercritical carbon dioxide was injected into the solution, thereby inducing supersaturation and particle formation. Variation in the physical properties of the recrystallized phenylbutazone was investigated as a function of the crystallizing temperature and the carbon dioxide injection rate. The recrystallized particles showed cleaner surfaces and more ordered morphology compared to the particles obtained by other methods such as solvent evaporation. X-ray diffraction patterns indicated that the crystallinity of the particles had been modified upon the recrystallization. Differential scanning calorimetry measurement revealed that the crystallizing temperature influenced the thermal stability of the resulting crystals. Larger crystals were produced when the carbon dioxide injection rate was reduced.     

Photochemical reduction of molecular weight and number of double bonds in natural rubber film

Natural rubber (NR) can be degraded depending on various factors such as heat, mechanical force, chemical reaction, and light. Light is a very interesting factor because it can cause the NR to degrade under low temperature and pressure. The photo-degradation of NR films was carried out to investigate the effects of the light and the temperature on the reduction of the weight-average molecular weight (Mw) and the double bonds in the NR films. The NR films, with and without catalysts, titanium dioxide (TiO₂), and potassium persulfate (K₂S₂O₈), were exposed to light from a mercury light bulb at 7,000 and 36,000 lux, and at the temperature of 25 °C and 80 °C for 192 hrs. After exposure, the Mw of the NR films was analyzed by gel permeation chromatography (GPC). Changes in the Mw were used to construct a kinetic model for the process, (1/Mw)=(1/Mw₀)+(kt/2M₀) where k is the rate constant, and M₀ is the Mw of the monomer unit. The linear relationship between 1/Mw and time suggested pseudo first-order processes with random scission. The Mw distribution information from the GPC was used to calculate the number of double bonds in the NR films. The trend of the double bonds reduction curves was quite similar to the result obtained from the calculation from the FTIR spectra. This indicated that this calculation method might possibly be another alternative way to obtain the number of double bonds in the NR.     

Automating application software generation

Many approaches have been proposed to enhance software productivity and reliability. These approaches typically fall into three categories: the engineering approach, the formal approach and the knowledge-based approach. But the optimal gain in software productivity cannot be obtained if one relies on only one of these approaches. This paper describes the work in knowledge-based software engineering conducted by the authors for the past 10 years. The final goal of the research is to develop a paradigm for software engineering which integrates the three approaches mentioned above. A knowledge-based tool which can support the whole process of software development is provided in this paper.     

Self-adjusting the intensity of assortative mating in genetic algorithms

Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA) usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between individuals, in natural systems non-random mating is common, which means that somehow this mechanism has been favored during the evolutionary process. In non-random mating, the individuals mate according to their parenthood or likeness. Previous studies indicate that negative assortative mating (AM)—also known as dissortative mating—, which is a specific type of non-random mating, may improve EAs performance by maintaining the genetic diversity of the population at a higher level during the search process. In this paper we present the Variable Dissortative Mating Genetic Algorithm (VDMGA). The algorithm holds a mechanism that varies the GA’s mating restrictions during the run by means of simple rule based on the number of chromosomes created in each generation and indirectly influenced by the genetic diversity of the population. We compare VDMGA not only with traditional Genetic Algorithms (GA) but also with two preceding non-random mating EAs: the CHC algorithm and the negative Assortative Mating Genetic Algorithm (nAMGA). We intend to study the effects of the different methods in the performance of GAs and verify the reliability of the proposed algorithm when facing an heterogeneous set of landscapes. In addition, we include the positive Assortative Mating Genetic Algorithm (pAMGA) in the experiments in order test both negative and positive AM mechanisms, and try to understand if and when negative AM (or DM) speeds up the search process or enables the GAs to escape local optima traps. For these purposes, an extensive set of optimization test problems was chosen to cover a variety of search landscapes with different characteristics. Our results confirm that negative AM is effective in leading EAs out of local optima traps, and show that the proposed VDMGA is at least as efficient as nAMGA when applied to the range of our problems, being more efficient in very hard functions were traditional GAs usually fail to escape local optima. Also, scalability tests have been made that show VDMGA ability to decrease optimal population size, thus reducing the amount of evaluations needed to attain global optima. We like to stress that only two parameters need to be hand-tuned in VDMGA, thus reducing the tuning effort present in traditional GAs and nAMGA.     

Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method

State space explosion is a key problem in the analysis of finite state systems. The sweep-line method is a state exploration method which uses a notion of progress to allow states to be deleted from memory when they are no longer required. This reduces the peak number of states that need to be stored, while still exploring the full state space. The technique shows promise but has never achieved reductions greater than about a factor of 10 in the number of states stored in memory for industrially relevant examples. This paper discusses sweep-line analysis of the connection management procedures of a new Internet standard, the Datagram Congestion Control Protocol (DCCP). As the intuitive approaches to sweep-line analysis are not effective, we introduce new variables to track progress. This creates further state explosion. However, when used with the sweep-line, the peak number of states is reduced by over two orders of magnitude compared with the original. Importantly, this allows DCCP to be analysed for larger parameter values. Somsak Vanit-Anunchai was partially supported by an Australian Research Council Discovery Grant (DP0559927) and Suranaree University of Technology. Guy Edward Gallasch was supported by an Australian Research Council Discovery Grant (DP0559927).     

Real-time measurement of pointing action by using DSP

This paper presents an approach of measuring in real-time the vector of finger that is pointing to an object. DSP is used in the operation processing unit in order to do the real-time processing. The steps include the extraction of flesh-colored regions from an image, the labeling of the flesh-colored regions, and the detection of two characteristic positions on the finger so that the direction that the finger is pointing at will be calculated. The entire process takes about 29 msec, which makes it possible to have the frame rate of 34 fps. With this frame rate, this measurement approach is considered real-time and promising to be merged into other application systems. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008