Behavioral responses of tilapia (Oreochromis niloticus) to acute fluctuations in dissolved oxygen levels as monitored by computer vision

Behavioral and ventilatory parameters have the possibility of predicting the stress state of fish in vivo and in situ. This paper presents a new image-processing algorithm for quantifying the average swimming speed of a fish school in an aquarium. This method is based on the alteration in projected area caused by the movement of individual fish during frame sequences captured at given time intervals. The image enhancement method increases the contrast between fish and background, and is thus suitable for use in turbid aquaculture water. Behavioral parameters (swimming activity and distribution parameters) and changes in ventilation frequency (VF) of tilapia (Oreochromis niloticus) responded to acute fluctuations in dissolved oxygen (DO) which were monitored continuously in the course of normoxia, falling DO level, maintenance of hypoxia (three levels of 1.5, 0.8 and 0.3 mg l(-1)) and subsequent recovery to normoxia. These parameters responded sensitively to acute variations in DO level; they displayed significant changes (P < 0.05) during severe hypoxia (0.8 and 0.3 mg l(-1) level) compared with normoxic condition, but there was no significant difference under conditions of mild hypoxia (1.5 mg l(-1) level). There was no significant difference in VF between two levels of severe hypoxia 0.8 and 0.3 mg l(-1) level during the low DO condition. The activity and distribution parameters displayed distinguishable differences between the 0.8 and 0.3 mg l(-1) levels. The behavioral parameters are thus capable of distinguishing between different degrees of severe hypoxia, though there were relatively large fluctuations. (c) 2006 Elsevier B.V. All rights reserved.

Use of computer-assisted sperm analysis (CASA) to evaluate the quality of cryopreserved sperm in red seabream (Pagrus major)

In the present study, the quality of post-thaw sperm of red seabream Pagrus major frozen with 6-24% DMSO was investigated. The motility, average path velocity and fertilizing capacity of fresh and their corresponding post-thaw sperm were examined for evaluation of the post-thaw sperm motion characteristics and its association with fertilizing capacity. An analysis of sperm motility before and after cryopreservation has been performed using computer-assisted sperm analysis (CASA). For post-thaw sperm frozen with 12-21% DMSO, the percentages of motile sperm were not significantly (P > 0.05) changed 10 s after activation. Moreover, the main motility pattern and swimming velocity of the motile post-thaw sperm were not significantly (P > 0.05) changed and the progressive linear motion was still the dominant pattern. However, the total motility of post-thaw sperm (72.3 +/- 6.3%) 30 s after activation was (P < 0.05) lower than the corresponding fresh sperm (82.7 +/- 7.2%). Additionally, the fertilizing capacity of post-thaw sperm was investigated with a standardized sperm to egg ratio 500:1. There is a linear regression relationship between the percentage of motile post-thaw sperm and fertilizing capability. These data demonstrate that 12-21% DMSO can provide good protection to the sperm during the freezing-thawing process. (c) 2006 Elsevier B.V. All rights reserved.

森林资源模型仿真研究

A dynamic model is built up by means of system dynamics method for the development offorest resources in Liaoning province.Prediction and strategy research are made for the fo-rest ecology and timber production in 2000 in Liaoning.The impactions of various designson the development of forest resources are understood by adjusting different parameters andadding disturbances to the model.Various parameters are determined according to the dataprovided by Land Dept.and Forestry Dept.of Liaoning province,the data of provincialforest statistics in 1978 is taken as the original values for running model,which is perfor-med on IBM PC/X7 computer in DYNAMO language of system dynamics.

数控自动编程专家系统

本文简要地介绍了数控自动编程专家系统.其中包括:专家系统知识表示的形式;分层次的黑板结构;前向推理求解策略和相应的解释功能;系统针对不同类型的曲线组合,采用不同的独立的知识源(KS)进行处理.由于在知识的处理上采用编码技术,在前向推理求解策略中使用启发信息和“剪技”技术,提高了系统的时空效率.系统中的规划程序能自动规划切削路径.输出供数控车床使用的 NC 代码,并可在显示屏上进行图形显示和切削仿真.目前原型系统已经在 IBM-PC 和 Sun3/60计算机上利用FORTRAN 语言实现.

波动方程叠前深度偏移辛算法及速度建模

On 70~(th) SEG Annual meeting, many author have announced their result on the wave equation prestack depth migration. The methods of the wave-field imaging base on wave equation becomes mature and the main direction of seismic imaging. The direction of imaging the complex media has been the main one of the projects that the national "85" and "95" reservoir geophysics key projects and "Knowledge innovation key project of Chinese Academy of Science" have been supported. Furthermore, we began the study for special oil field situation of our nation with the international research groups. Under the background, the author combined the thoughts of symplectic with wave equation pre-stack depth migration, and develops and efficient wave equation pre-stack depth migration method. The purpose of this work is to find out a way to imaging the complex geological goals of Chinese oilfields and form a procedure of seismic data processing. The paper gives the approximation of one way wave equation operator, and shows the numerical results. The comparisons have been made between split-step phase method, Kirchhoff and Ray+FD methods on the pulse response, simple model and Marmousi model. The results shows that the method in this paper has an higher accuracy. Four field data examples have also be given in this paper. The results of field data demonstrate that the method can be usable. The velocity estimation is an important part of the wave equation pre-stack depth migration. A parallel velocity estimation program has been written and tested on the Beowulf clusters. The program can establish a velocity profile automatically. An example on Marmousi model has shown in the third part of the paper to demonstrate the method. Another field data was also given in the paper. Beowulf cluster is the converge of the high performance computer architecture. Today, Beowulf Cluster is a good choice for institutes and small companies to finish their task. The paper gives some comparison results the computation of the wave equation pre-stack migration on Beowulf cluster, IBM-SP2 (24 nodes) in Daqing and Shuguang 3000, and the comparison of their prize. The results show that the Beowulf cluster is an efficient way to finish the large amount computation of the wave equation pre-stack depth migration, especially for 3D.

辛格式波动方程叠前深度偏移及速度建模

On 70~(th) SEG Annual meeting, many author have announced their result on the wave equation pre-stack depth migration. The methods of the wave-field imaging base on wave equation becomes mature and the main direction of seismic imaging. The direction of imaging the complex media has been the main one of the projects that the national "85" and "95" reservoir geophysics key projects and "Knowledge innovation key project of Chinese Academy of Science" have been supported. Furthermore, we began the study for special oil field situation of our nation with the international research groups. Under the background, the author combined the thoughts of symplectic with wave equation pre-stack depth migration, and develops and efficient wave equation pre-stack depth migration method. The purpose of this work is to find out a way to imaging the complex geological goals of Chinese oilfields and form a procedure of seismic data processing. The paper gives the approximation of one way wave equation operator, and shows the numerical results. The comparisons have been made between split-step phase method, Kirchhoff and Ray+FD methods on the pulse response, simple model and Marmousi model. The result shows that the method in this paper has an higher accuracy. Four field data examples have also be given in this paper. The results of field data demonstrate that the method can be usable. The velocity estimation is an important part of the wave equation pre-stack depth migration. A. parallel velocity estimation program has been written and tested on the Beowulf clusters. The program can establish a velocity profile automatically. An example on Marmousi model has shown in the third part of the paper to demonstrate the method. Another field data was also given in the paper. Beowulf cluster is the converge of the high performance computer architecture. Today, Beowulf Cluster is a good choice for institutes and small companies to finish their task. The paper gives some comparison results the computation of the wave equation pre-stack migration on Beowulf cluster, IBM-SP2 (24 nodes) in Daqing and Shuguang3000, and the comparison of their prize. The results show that the Beowulf cluster is an efficient way to finish the large amount computation of the wave equation pre-stack depth migration, especially for 3D.

Computer-assisted automatic peak recognition and result evaluation for analysis of chlorinated hydrocarbons in environmental samples

A data manipulation method has been developed for automatic peak recognition and result evaluation in the analysis of organic chlorinated hydrocarbons with dual-column gas chromatography. Based on the retention times of two internal standards, pentachlorotoluene and decachlorobiphenyl, the retention times of chlorinated hydrocarbons can be calibrated automatically and accurately. It is very convenient to identify the peaks by comparing the retention times of samples with the calibrated retention times calculated from the relative retention indices of standards. Meanwhile, with a suggested two-step evaluation method the evaluation coefficients and the suitable quantitative results of each component can be automatically achieved for practical samples in an analytical system using two columns with different polarities and two internal standards. (C) 2002 Elsevier Science B.V. All rights reserved.

Computer Perception of Three-Dimensional Objects

We first pose the following problem: to develop a program which takes line-drawings as input and constructs three-dimensional objects as output, such that the output objects are the same as the ones we see when we look at the input line-drawing. We then introduce the principle of minimum standard-deviation of angles (MSDA) and discuss a program based on MSDA. We present the results of testing this program with a variety of line- drawings and show that the program constitutes a solution to the stated problem over the range of line-drawings tested. Finally, we relate this work to its historical antecedents in the psychological and computer-vision literature.

Maxwell's Demon, Rectifiers, and the Second Law: Computer Simulation of Smoluchowski's Trapdoor

We have simulated numerically an automated Maxwell's demon inspired by Smoluchowski's ideas of 1912. Two gas chambers of equal area are connected via an opening that is covered by a trapdoor. The trapdoor can open to the left but not to the right, and is intended to rectify naturally occurring variations in density between the two chambers. Our results confirm that though the trapdoor behaves as a rectifier when large density differences are imposed by external means, it can not extract useful work from the thermal motion of the molecules when left on its own.

Paradigms for Structure in an Amorphous Computer

Recent developments in microfabrication and nanotechnology will enable the inexpensive manufacturing of massive numbers of tiny computing elements with sensors and actuators. New programming paradigms are required for obtaining organized and coherent behavior from the cooperation of large numbers of unreliable processing elements that are interconnected in unknown, irregular, and possibly time-varying ways. Amorphous computing is the study of developing and programming such ultrascale computing environments. This paper presents an approach to programming an amorphous computer by spontaneously organizing an unstructured collection of processing elements into cooperative groups and hierarchies. This paper introduces a structure called an AC Hierarchy, which logically organizes processors into groups at different levels of granularity. The AC hierarchy simplifies programming of an amorphous computer through new language abstractions, facilitates the design of efficient and robust algorithms, and simplifies the analysis of their performance. Several example applications are presented that greatly benefit from the AC hierarchy. This paper introduces three algorithms for constructing multiple levels of the hierarchy from an unstructured collection of processors.

An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer

Amorphous computing is the study of programming ultra-scale computing environments of smart sensors and actuators cite{white-paper}. The individual elements are identical, asynchronous, randomly placed, embedded and communicate locally via wireless broadcast. Aggregating the processors into groups is a useful paradigm for programming an amorphous computer because groups can be used for specialization, increased robustness, and efficient resource allocation. This paper presents a new algorithm, called the clubs algorithm, for efficiently aggregating processors into groups in an amorphous computer, in time proportional to the local density of processors. The clubs algorithm is well-suited to the unique characteristics of an amorphous computer. In addition, the algorithm derives two properties from the physical embedding of the amorphous computer: an upper bound on the number of groups formed and a constant upper bound on the density of groups. The clubs algorithm can also be extended to find the maximal independent set (MIS) and $Delta + 1$ vertex coloring in an amorphous computer in $O(log N)$ rounds, where $N$ is the total number of elements and $Delta$ is the maximum degree.

The Computer as Coach: An Athletic Paradigm for Intellectual Education

Over the next five years, computer games will find their way into a vast number of American homes, creating a unique educational opportunity: the development of "computer coaches" for the serious intellectual skills required by some of these games. From the player's perspective, the coach will provide advice regarding strategy and tactics for better play. But, from the perspective of the coach, the request for help is an opportunity to tutor basic mathematical, scientific or other kinds of knowledge that the game exercises.

A Coupled Multi-ALU Processing Node for a Highly Parallel Computer

This report describes Processor Coupling, a mechanism for controlling multiple ALUs on a single integrated circuit to exploit both instruction-level and inter-thread parallelism. A compiler statically schedules individual threads to discover available intra-thread instruction-level parallelism. The runtime scheduling mechanism interleaves threads, exploiting inter-thread parallelism to maintain high ALU utilization. ALUs are assigned to threads on a cycle byscycle basis, and several threads can be active concurrently. Simulation results show that Processor Coupling performs well both on single threaded and multi-threaded applications. The experiments address the effects of memory latencies, function unit latencies, and communication bandwidth between function units.

Design and Evaluation of the Hamal Parallel Computer

Parallel shared-memory machines with hundreds or thousands of processor-memory nodes have been built; in the future we will see machines with millions or even billions of nodes. Associated with such large systems is a new set of design challenges. Many problems must be addressed by an architecture in order for it to be successful; of these, we focus on three in particular. First, a scalable memory system is required. Second, the network messaging protocol must be fault-tolerant. Third, the overheads of thread creation, thread management and synchronization must be extremely low. This thesis presents the complete system design for Hamal, a shared-memory architecture which addresses these concerns and is directly scalable to one million nodes. Virtual memory and distributed objects are implemented in a manner that requires neither inter-node synchronization nor the storage of globally coherent translations at each node. We develop a lightweight fault-tolerant messaging protocol that guarantees message delivery and idempotence across a discarding network. A number of hardware mechanisms provide efficient support for massive multithreading and fine-grained synchronization. Experiments are conducted in simulation, using a trace-driven network simulator to investigate the messaging protocol and a cycle-accurate simulator to evaluate the Hamal architecture. We determine implementation parameters for the messaging protocol which optimize performance. A discarding network is easier to design and can be clocked at a higher rate, and we find that with this protocol its performance can approach that of a non-discarding network. Our simulations of Hamal demonstrate the effectiveness of its thread management and synchronization primitives. In particular, we find register-based synchronization to be an extremely efficient mechanism which can be used to implement a software barrier with a latency of only 523 cycles on a 512 node machine.