含空值关系数据库中关系代数的实现

本文从空值的完全语义出发,依据空值环境下信息等价和信息相容的含义,全面定义了空值环境下运算结果完备的关系代数运算,并对空值环境下关系代数运算的有效性和完备性进行了讨论。

关系模型中不确定信息与可能信息的引入与处理

In this paper,the traditional relational model is extended in order to express indefinite and maybe information. On the basis of the extended relational model.,the foundamental operations in relational algebra are defined again,and the policy and algorithm for updating relational database are given.

含有空值关系数据库的查询处理

本文在深刻理解空值语义的基础上，给出一种处理占位型空值的方法。讨论了空值环境下关系数据库的查询策略，定义了含三种查询操作的关系代数最小完备集中的关系代数运算，并对查询计算的有效性和完备性进行了分析。

空值环境下含不确定及可能信息关系数据库的查询

本文以［１］中的扩展关系模型为基础在两种元组级的不完全信息──不确定及可能信息中引入属性级的不完全信息空值，使两种不同性质的不完全信息同时出现在同一关系中。为了能够查询到不同种类及不同确定程度的信息，文中制定了这种扩展关系模型上关系的查询策略，定义了能够体现这种策略的最小关系代数运算。

空值环境下关系数据库的更新 Ⅰ：扩展关系模型及基本运算

本文从空值语义及更新操作的关系出发，提出了一种新的扩展关系模型，用以组织更新操作下的含有空值的关系数据库中的信息．同时，定义了这种模型下的基本关系代数运算．为实现空值环境下关系数据库的数据更新奠定了基础。

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

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.

相同知识背景下技能之间迁移机制的研究

Since the middle of 1980's, the mechanisms of transfer of training between cognitive subskills rest on the same body of declarative knowledge has been highly concerned. The dominant theory is theory of common element (Singley & Anderson, 1989) which predict that there will be little or no transfer between subskills within the same domain when knowledge is used in different ways, even though the subskills might rest on a common body of declarative knowledge. This idea is termed as "principle of use specificity of knowledge" (Anderson, 1987). Although this principle has gained some empirical evidence from different domains such as elementary geometry (Neves & Anderson, 1981) and computer programming (McKendree & Anderson, 1987), it is challenged by some research (Pennington et al., 1991; 1995) in which substantially larger amounts of transfer of training was found between substills that rest on a shared declarative knowledge but share little procedures (production rules). Pennington et al. (1995) provided evidence that this larger amounts of transfer are due to the elaboration of declarative knowledge. Our research provide a test of these two different explanation, by considering transfer between two subskills within the domain of elementary geometry and elementary algebra respectively, and the inference of learning method ("learning from examples" and "learning from declarative-text") and subject ability (high, middle, low) on the amounts of transfer. Within the domain of elementary geometry, the two subskills of generating proofs" (GP) and "explaining proofs" (EP) which are rest on the declarative knowledge of "theorems on the characters of parallelogram" share little procedures. Within the domain of elementary algebra, the two subskills of "calculation" (C) and "simplification" (S) which are rest on the declarative knowledge of "multiplication of radical" share some more procedures. The results demonstrate that: 1. Within the domain of elementary geometry, although little transfer was found between the two subskills of GP and EP within the total subjects, different results occurred when considering the factor of subject's ability. Within the high level subjects, significant positive transfer was found from EP to GP, while little transfer was found on the opposite direction (i. e. from GP to EP). Within the low level subjects, significant positive transfer was found from EP to GP, while significant negative transfer was found on the opposite direction. For the middle level subject, little transfer was found between the two subskills. 2. Within the domain of elementary algebra, significant positive transfer was found from S to C, while significant negative transfer was found on the opposite direction (i. e. from C to S), when considering the total subjects. The same pattern of transfer occurred within the middle level subjects and low level subject. Within the high level subjects, no transfer was found between the two subskills. 3. Within theses two domains, different learning methods yield little influence on transfer of training between subskills. Apparently, these results can not be attributed to either common procedures or elaboration of declarative knowledge. A kind of synthetic inspection is essential to construct a reasonable explanation of these results which should take into account the following three elements: (1) relations between the procedures of subskills; (2) elaboration of declarative knowledge; (3) elaboration of procedural knowledge. 排Excluding the factor of subject, transfer of training between subskills can be predicted and explained by analyzing the relations between the procedures of two subskills. However, when considering some certain subjects, the explanation of transfer of training between subskills must include subjects' elaboration of declarative knowledge and procedural knowledge, especially the influence of the elaboration on performing the other subskill. The fact that different learning methods yield little influence on transfer of training between subskills can be explained by the fact that these two methods did not effect the level of declarative knowledge. Protocol analysis provided evidence to support these hypothesis. From this research, we conclude that in order to expound the mechanisms of transfer of training between cognitive subskills rest on the same body of declarative knowledge, three elements must be considered synthetically which include: (1) relations between the procedures of subskills; (2) elaboration of declarative knowledge; (3) elaboration of procedural knowledge.

The Bifurcation Interpreter: A Step Towards the Automatic Analysis of Dynamical Systems

The Bifurcation Interpreter is a computer program that autonomously explores the steady-state orbits of one-parameter families of periodically- driven oscillators. To report its findings, the Interpreter generates schematic diagrams and English text descriptions similar to those appearing in the science and engineering research literature. Given a system of equations as input, the Interpreter uses symbolic algebra to automatically generate numerical procedures that simulate the system. The Interpreter incorporates knowledge about dynamical systems theory, which it uses to guide the simulations, to interpret the results, and to minimize the effects of numerical error.

Distance Metric Between 3D Models and 3D Images for Recognition and Classification

Similarity measurements between 3D objects and 2D images are useful for the tasks of object recognition and classification. We distinguish between two types of similarity metrics: metrics computed in image-space (image metrics) and metrics computed in transformation-space (transformation metrics). Existing methods typically use image and the nearest view of the object. Example for such a measure is the Euclidean distance between feature points in the image and corresponding points in the nearest view. (Computing this measure is equivalent to solving the exterior orientation calibration problem.) In this paper we introduce a different type of metrics: transformation metrics. These metrics penalize for the deformatoins applied to the object to produce the observed image. We present a transformation metric that optimally penalizes for "affine deformations" under weak-perspective. A closed-form solution, together with the nearest view according to this metric, are derived. The metric is shown to be equivalent to the Euclidean image metric, in the sense that they bound each other from both above and below. For Euclidean image metric we offier a sub-optimal closed-form solution and an iterative scheme to compute the exact solution.

Relative Affine Structure: Canonical Model for 3D from 2D Geometry and Applications

We propose an affine framework for perspective views, captured by a single extremely simple equation based on a viewer-centered invariant we call "relative affine structure". Via a number of corollaries of our main results we show that our framework unifies previous work --- including Euclidean, projective and affine --- in a natural and simple way, and introduces new, extremely simple, algorithms for the tasks of reconstruction from multiple views, recognition by alignment, and certain image coding applications.

Activity Zones for Context-Aware Computing

Location is a primary cue in many context-aware computing systems, and is often represented as a global coordinate, room number, or Euclidean distance various landmarks. A user?s concept of location, however, is often defined in terms of regions in which common activities occur. We show how to partition a space into such regions based on patterns of observed user location and motion. These regions, which we call activity zones, represent regions of similar user activity, and can be used to trigger application actions, retrieve information based on previous context, and present information to users. We suggest that context-aware applications can benefit from a location representation learned from observing users. We describe an implementation of our system and present two example applications whose behavior is controlled by users? entry, exit, and presence in the zones.

Application of dynamical Lie algebraic method to atom-diatomic molecule scattering

The dynamical Lie algebraic approach developed by Alhassid and Levine combined with intermediate picture is applied to the study of translational-vibrational energy transfer in the collinear collision between an atom and an anharmonic oscillator. We find that the presence of the anharmonic terms indeed has an effect on the vibrational probabilities of the oscillator. The computed probabilities are in good agreement with those obtained using exact quantum method. It is shown that the approach of dynamical Lie algebra combining with intermediate picture is reasonable in the treating of atom-anharmonic oscillator scattering.

Qualitative Analysis of MOS Circuits

With the push towards sub-micron technology, transistor models have become increasingly complex. The number of components in integrated circuits has forced designer's efforts and skills towards higher levels of design. This has created a gap between design expertise and the performance demands increasingly imposed by the technology. To alleviate this problem, software tools must be developed that provide the designer with expert advice on circuit performance and design. This requires a theory that links the intuitions of an expert circuit analyst with the corresponding principles of formal theory (i.e. algebra, calculus, feedback analysis, network theory, and electrodynamics), and that makes each underlying assumption explicit.

Natural Language Input for a Computer Problem Solving System

The STUDENT problem solving system, programmed in LISP, accepts as input a comfortable but restricted subset of English which can express a wide variety of algebra story problems. STUDENT finds the solution to a large class of these problems. STUDENT can utilize a store of global information not specific to any one problem, and may make assumptions about the interpretation of ambiguities in the wording of the problem being solved. If it uses such information or makes any assumptions, STUDENT communicates this fact to the user. The thesis includes a summary of other English language questions-answering systems. All these systems, and STUDENT, are evaluated according to four standard criteria. The linguistic analysis in STUDENT is a first approximation to the analytic portion of a semantic theory of discourse outlined in the thesis. STUDENT finds the set of kernel sentences which are the base of the input discourse, and transforms this sequence of kernel sentences into a set of simultaneous equations which form the semantic base of the STUDENT system. STUDENT then tries to solve this set of equations for the values of requested unknowns. If it is successful it gives the answers in English. If not, STUDENT asks the user for more information, and indicates the nature of the desired information. The STUDENT system is a first step toward natural language communication with computers. Further work on the semantic theory proposed should result in much more sophisticated systems.

Zoneamento agroecológico do Município de Aquidauana - MS.

A Embrapa Solos, em parceria com a Secretaria de Estado de Desenvolvimento Agrário, da Produção, da Indústria, do Comércio e do Turismo - SEPROTUR, realizou o Zoneamento Agroecológico do Estado do Mato Grosso do Sul - Fase II - com objetivo de contribuir na indicação de áreas passíveis de exploração agrícola sustentável. No desenvolvimento desse trabalho foram considerados aspectos legais, restrições ambientais, potencial das culturas, aspectos do clima, de geomorfologia e dos solos, todos integrados em ambiente de sistema de informação geográfica com apoio de algebra de mapas, no intuito de avaliar a adequabilidade de uso das terras e apresentar uma proposição de planejamento de uso e ocupação das terras. Os foram consolidados por município e dão origem a esse boletim de pesquisa. No município de Aquidauana, as terras indicadas para o uso com lavouras somam cerca de 870 km², o que equivale a aproximadamente 23% da área total do município, sendo que, destas, 92% apresentam declividade inferior a 8%. As áreas recomendadas para pastagem equivalem a 54% e as áreas recomendadas para pastagem especial a aproximadamente 8% da área do município que corresponde a algo como 294 km². Nestas unidades é fundamental avaliar-se criteriosamente a utilização de pastagens nestas terras quando essas ainda se encontram sob cobertura vegetal, visto que, praticamente 40% destas terras ainda permanecem com vegetação natural em seus diversos graus de conservação. As terras recomendadas para conservação dos recursos naturais e/ou recuperação ambiental equivalem a menos de 475 km², as quais constituem áreas de alta fragilidade ambiental e/ou apresentam restrições legais de uso como áreas de preservação permanente. As áreas identificadas como zonas recomendadas para recuperação ambiental equivalem a 112 km² e constituem áreas de moderada a alta fragilidade ambiental e/ou que apresentam restrições legais de uso e que já foram desmatadas para o uso com pastagens/agricultura. Desconsiderando as terras de Pantanal, a área do município de Aquidauana apresenta um alto grau de ação antrópica das terras, onde mais de 75% das terras sendo utilizadas com pastagens e/ou com agricultura, enquanto que apenas 25% ainda apresentam certo grau de preservação.