Quantitative structure-property relationships for colour reagents and their colour reactions with cerium using computational neural networks

Quantitative structure-activity/property relationships (QSAR/QSPR) studies have been exploited extensively in the designs of drugs and pesticides, but few such studies have been applied to the design of colour reagents. In this work, the topological indices A(x1)-A(x3) suggested in this laboratory were applied to multivariate analysis in structure-property studies. The topological indices of 43 phosphone bisazo derivatives of chromotropic acid were calculated. The structure-property relationships between colour reagents and their colour reactions with cerium were studied using A(x1-Ax3) indices with satisfactory results. The purpose of this work was to establish whether QSAR can be used to predict the contrasts of colour reactions and in the longer term to be a helpful tool in colour reagent design.

Quantitative structure-property relationships for colour reagents and their colour reactions with ytterbium using regression analysis and computational neural networks

In this paper, the new topological indices A(x1)-A(x3) suggested in our laboratory and molecular connectivity indices have been applied to multivariate analysis in structure-property studies. The topological indices of twenty asymmetrical phosphono bisazo derivatives of chromotropic acid have been calculated. The structure-property relationships between colour reagents and their colour reactions with ytterbium have been studied by A(x1)-A(x3) indices and molecular connectivity indices with satisfactory results. Multiple regression analysis and neural networks were employed simultaneously in this study.

QUANTITATIVE STRUCTURE-ACTIVITY-RELATIONSHIPS FOR TOXICITY OF PHENOLS USING REGRESSION-ANALYSIS AND COMPUTATIONAL NEURAL NETWORKS

Quantitative structure-toxicity models were developed that directly link the molecular structures of a et of 50 alkYlated and/or halogenated phenols with their polar narcosis toxicity, expressed as the negative logarithm of the IGC50 (50% growth inhibitor

Impact of difference accuracy on computational properties of vertical grids for a nonhydrostatic model

Starting from nonhydrostatic Boussinesq approximation equations, a general method is introduced to deduce the dispersion relationships. A comparative investigation is performed on inertia-gravity wave with horizontal lengths of 100, 10 and 1 km. These are examined using the second-order central difference scheme and the fourth-order compact difference scheme on vertical grids that are currently available from the perspectives of frequency, horizontal and vertical component of group velocity. These findings are compared to analytical solutions. The obtained results suggest that whether for the second-order central difference scheme or for the fourth-order compact difference scheme, Charny-Phillips and Lorenz ( L) grids are suitable for studying waves at the above-mentioned horizontal scales; the Lorenz time-staggered and Charny-Phillips time staggered (CPTS) grids are applicable only to the horizontal scales of less than 10 km, and N grid ( unstaggered grid) is unsuitable for simulating waves at any horizontal scale. Furthermore, by using fourth-order compact difference scheme with higher difference precision, the errors of frequency and group velocity in horizontal and vertical directions produced on all vertical grids in describing the waves with horizontal lengths of 1, 10 and 100 km cannot inevitably be decreased. So in developing a numerical model, the higher-order finite difference scheme, like fourth-order compact difference scheme, should be avoided as much as possible, typically on L and CPTS grids, since it will not only take many efforts to design program but also make the calculated group velocity in horizontal and vertical directions even worse in accuracy.

Response of chlorophyll fluorescence to dynamic light in three alpine species differing in plant architecture

A study was carried out to examine the effect of dynamic photosynthetically active photon flux density (PPFD) on photoinhibition and energy use in three herbaceous species, prostrate Saussurea superba, erect-leaved S. katochaete, and half-erect-leaved Gentiana straminea, from the Qinghai-Tibet Plateau. Chlorophyll fluorescence response was measured under each of three sets of high-low PPFD combinations: 1700-0, 1400-300, and 1200-500 mu mol m(-2) s(-1), illuminating in four dynamic frequencies: 1, 5, 15, and 60 cycles per 2 h. The total light exposure time was 2h and the integrated PPFD was the same in all treatments. The highest frequency of PPFD fluctuation resulted in the lowest photochemical activity, the highest level of non-photochemical quenching, and the greatest decrease of F-v/F-m (maximal photochemical efficiency of PSII). The 5 and 15 cycles per 2h treatments resulted in higher photochemical activity than the 1 cycle per 2h treatment. The 1700-0 PPFD combination led to the lowest photochemical activity and more serious photoinhibition in all species. S. superba usually exhibited the highest photochemical activity and CO2 uptake rate, the lowest reduction of F-v/F-m,F- and the smallest fraction of energy in thermal dissipation. With similar fractions of thermal dissipation, S. katochaete had relatively less photoinhibition than G. straminea owing to effective F-o quenching. The results suggest that high frequency of fluctuating PPFD generally results in photoinhibition, which is more serious under periods of irradiation with high light intensity. (c) 2005 Elsevier B.V. All rights reserved.

Photosynthetic depression in relation to plant architecture in two alpine herbaceous species

The Qinghai-Tibet Plateau is characterized by extremely high radiation, which may induce down-regulation of photosynthesis in plants living in this alpine ecosystem. To clarify whether photoinhibition occurs in the alpine environment and to discern its underlying mechanisms, we examined photosynthetic gas exchange and fluorescence emission in response to the changes in photosynthetic photon flux density (PPFD) and leaf temperature under natural regimes for two herbaceous species: prostrate Saussurea superba and erect-leaved Saussurea katochaete from altitude 3250 m on the Qinghai-Tibet Plateau. S. superba intercepted a higher maximum PPFD and experienced much higher leaf temperature than the erect-leaved S. katochaete. S. superba exhibited a much higher light saturation point for photosynthesis than S. katochaete. Under controlled conditions, the former species had higher CO2 uptake rates and neither species showed obvious photosynthetic down-regulation at high PPFD. Under natural environmental conditions, however, apparent photoinhibition, indicated by reduced electron transport rate (ETR), was evident at high PPFD for both species. After a night frost, the photochemistry of S. katochaete was depressed markedly in the early morning and recovered by mid-day. After a frost-free night, it was high in the morning and low at noon due to high radiation. S. superba did not respond to the night frost in terms of daytime photochemical pattern. In both species, photochemical depression was aggravated by high leaf temperature and the erect species was more sensitive to high temperature. This study suggests that the high radiation on the Qinghai-Tibet Plateau is likely to induce rapidly reversible photoinhibition, which is related closely to plant architecture. Photochemistry in the prostrate species seems able to tolerate higher PPFD, without obvious suppression, than the erect species. (C) 2003 Elsevier Science B.V. All rights reserved.

基于OS／2的客户／服务器体系结构

本文阐述了客户／服务器计算的特点，介绍了ＯＳ／２２·１操作系统为客户／服务器计算模式所提供的各类支持。最后，就以ＯＳ／２为操作系统构建客户／服务器结构的可能模式进行了分析与讨论。

积分偏移的计算几何与并行实现

The Second Round of Oil & Gas Exploration needs more precision imaging method, velocity vs. depth model and geometry description on Complicated Geological Mass. Prestack time migration on inhomogeneous media was the technical basic of velocity analysis, prestack time migration on Rugged surface, angle gather and multi-domain noise suppression. In order to realize this technique, several critical technical problems need to be solved, such as parallel computation, velocity algorithm on ununiform grid and visualization. The key problem is organic combination theories of migration and computational geometry. Based on technical problems of 3-D prestack time migration existing in inhomogeneous media and requirements from nonuniform grid, parallel process and visualization, the thesis was studied systematically on three aspects: Infrastructure of velocity varies laterally Green function traveltime computation on ununiform grid, parallel computational of kirchhoff integral migration and 3D visualization, by combining integral migration theory and Computational Geometry. The results will provide powerful technical support to the implement of prestack time migration and convenient compute infrastructure of wave number domain simulation in inhomogeneous media. The main results were obtained as follows: 1. Symbol of one way wave Lie algebra integral, phase and green function traveltime expressions were analyzed, and simple 2-D expression of Lie algebra integral symbol phase and green function traveltime in time domain were given in inhomogeneous media by using pseudo-differential operators’ exponential map and Lie group algorithm preserving geometry structure. Infrastructure calculation of five parts, including derivative, commutating operator, Lie algebra root tree, exponential map root tree and traveltime coefficients , was brought forward when calculating asymmetry traveltime equation containing lateral differential in 3-D by this method. 2. By studying the infrastructure calculation of asymmetry traveltime in 3-D based on lateral velocity differential and combining computational geometry, a method to build velocity library and interpolate on velocity library using triangulate was obtained, which fit traveltime calculate requirements of parallel time migration and velocity estimate. 3. Combining velocity library triangulate and computational geometry, a structure which was convenient to calculate differential in horizontal, commutating operator and integral in vertical was built. Furthermore, recursive algorithm, for calculating architecture on lie algebra integral and exponential map root tree (Magnus in Math), was build and asymmetry traveltime based on lateral differential algorithm was also realized. 4. Based on graph theory and computational geometry, a minimum cycle method to decompose area into polygon blocks, which can be used as topological representation of migration result was proposed, which provided a practical method to block representation and research to migration interpretation results. 5. Based on MPI library, a process of bringing parallel migration algorithm at arbitrary sequence traces into practical was realized by using asymmetry traveltime based on lateral differential calculation and Kirchhoff integral method. 6. Visualization of geological data and seismic data were studied by the tools of OpenGL and Open Inventor, based on computational geometry theory, and a 3D visualize system on seismic imaging data was designed.

地下水流动数值模拟的并行计算方法研究

Numerical modeling of groundwater is very important for understanding groundwater flow and solving hydrogeological problem. Today, groundwater studies require massive model cells and high calculation accuracy, which are beyond single-CPU computer’s capabilities. With the development of high performance parallel computing technologies, application of parallel computing method on numerical modeling of groundwater flow becomes necessary and important. Using parallel computing can improve the ability to resolve various hydro-geological and environmental problems. In this study, parallel computing method on two main types of modern parallel computer architecture, shared memory parallel systems and distributed shared memory parallel systems, are discussed. OpenMP and MPI (PETSc) are both used to parallelize the most widely used groundwater simulator, MODFLOW. Two parallel solvers, P-PCG and P-MODFLOW, were developed for MODFLOW. The parallelized MODFLOW was used to simulate regional groundwater flow in Beishan, Gansu Province, which is a potential high-level radioactive waste geological disposal area in China. 1. The OpenMP programming paradigm was used to parallelize the PCG (preconditioned conjugate-gradient method) solver, which is one of the main solver for MODFLOW. The parallel PCG solver, P-PCG, is verified using an 8-processor computer. Both the impact of compilers and different model domain sizes were considered in the numerical experiments. The largest test model has 1000 columns, 1000 rows and 1000 layers. Based on the timing results, execution times using the P-PCG solver are typically about 1.40 to 5.31 times faster than those using the serial one. In addition, the simulation results are the exact same as the original PCG solver, because the majority of serial codes were not changed. It is worth noting that this parallelizing approach reduces cost in terms of software maintenance because only a single source PCG solver code needs to be maintained in the MODFLOW source tree. 2. P-MODFLOW, a domain decomposition–based model implemented in a parallel computing environment is developed, which allows efficient simulation of a regional-scale groundwater flow. The basic approach partitions a large model domain into any number of sub-domains. Parallel processors are used to solve the model equations within each sub-domain. The use of domain decomposition method to achieve the MODFLOW program distributed shared memory parallel computing system will process the application of MODFLOW be extended to the fleet of the most popular systems, so that a large-scale simulation could take full advantage of hundreds or even thousands parallel processors. P-MODFLOW has a good parallel performance, with the maximum speedup of 18.32 (14 processors). Super linear speedups have been achieved in the parallel tests, indicating the efficiency and scalability of the code. Parallel program design, load balancing and full use of the PETSc were considered to achieve a highly efficient parallel program. 3. The characterization of regional ground water flow system is very important for high-level radioactive waste geological disposal. The Beishan area, located in northwestern Gansu Province, China, is selected as a potential site for disposal repository. The area includes about 80000 km2 and has complicated hydrogeological conditions, which greatly increase the computational effort of regional ground water flow models. In order to reduce computing time, parallel computing scheme was applied to regional ground water flow modeling. Models with over 10 million cells were used to simulate how the faults and different recharge conditions impact regional ground water flow pattern. The results of this study provide regional ground water flow information for the site characterization of the potential high-level radioactive waste disposal.

Message-Driven Processor Architecture: Verson 11

The Message-Driven Processor is a node of a large-scale multiprocessor being developed by the Concurrent VLSI Architecture Group. It is intended to support fine-grained, message passing, parallel computation. It contains several novel architectural features, such as a low-latency network interface, extensive type-checking hardware, and on-chip memory that can be used as an associative lookup table. This document is a programmer's guide to the MDP. It describes the processor's register architecture, instruction set, and the data types supported by the processor. It also details the MDP's message sending and exception handling facilities.

Computational Vision: A Critical Review

We review the progress made in computational vision, as represented by Marr's approach, in the last fifteen years. First, we briefly outline computational theories developed for low, middle and high-level vision. We then discuss in more detail solutions proposed to three representative problems in vision, each dealing with a different level of visual processing. Finally, we discuss modifications to the currently established computational paradigm that appear to be dictated by the recent developments in vision.

Computational Consequences of Agreement and Ambiguity in Natural Language

The computer science technique of computational complexity analysis can provide powerful insights into the algorithm-neutral analysis of information processing tasks. Here we show that a simple, theory-neutral linguistic model of syntactic agreement and ambiguity demonstrates that natural language parsing may be computationally intractable. Significantly, we show that it may be syntactic features rather than rules that can cause this difficulty. Informally, human languages and the computationally intractable Satisfiability (SAT) problem share two costly computional mechanisms: both enforce agreement among symbols across unbounded distances (Subject-Verb agreement) and both allow ambiguity (is a word a Noun or a Verb?).

Intelligence Without Reason

Computers and Thought are the two categories that together define Artificial Intelligence as a discipline. It is generally accepted that work in Artificial Intelligence over the last thirty years has had a strong influence on aspects of computer architectures. In this paper we also make the converse claim; that the state of computer architecture has been a strong influence on our models of thought. The Von Neumann model of computation has lead Artificial Intelligence in particular directions. Intelligence in biological systems is completely different. Recent work in behavior-based Artificial Intelligenge has produced new models of intelligence that are much closer in spirit to biological systems. The non-Von Neumann computational models they use share many characteristics with biological computation.

Principles, Opportunism and Seeing in Design: A Computational Approach

This thesis introduces elements of a theory of design activity and a computational framework for developing design systems. The theory stresses the opportunistic nature of designing and the complementary roles of focus and distraction, the interdependence of evaluation and generation, the multiplicity of ways of seeing over the history of a design session versus the exclusivity of a given way of seeing over an arbitrarily short period, and the incommensurability of criteria used to evaluate a design. The thesis argues for a principle based rather than rule based approach to designing documents. The Discursive Generator is presented as a computational framework for implementing specific design systems, and a simple system for arranging blocks according to a set of formal principles is developed by way of illustration. Both shape grammars and constraint based systems are used to contrast current trends in design automation with the discursive approach advocated in the thesis. The Discursive Generator is shown to have some important properties lacking in other types of systems, such as dynamism, robustness and the ability to deal with partial designs. When studied in terms of a search metaphor, the Discursive Generator is shown to exhibit behavior which is radically different from some traditional search techniques, and to avoid some of the well-known difficulties associated with them.

Towards an Example-Based Image Compression Architecture for Video-Conferencing

This paper consists of two major parts. First, we present the outline of a simple approach to very-low bandwidth video-conferencing system relying on an example-based hierarchical image compression scheme. In particular, we discuss the use of example images as a model, the number of required examples, faces as a class of semi-rigid objects, a hierarchical model based on decomposition into different time-scales, and the decomposition of face images into patches of interest. In the second part, we present several algorithms for image processing and animation as well as experimental evaluations. Among the original contributions of this paper is an automatic algorithm for pose estimation and normalization. We also review and compare different algorithms for finding the nearest neighbors in a database for a new input as well as a generalized algorithm for blending patches of interest in order to synthesize new images. Finally, we outline the possible integration of several algorithms to illustrate a simple model-based video-conference system.