extending the boundary of spreadsheet programming: lessons learned from chinese governmental projects

ICSE

Radiation effects on the immiscible polymer blend of nylon1010 and high-impact polystyrene (HIPS) I: Gel/dose curves, mathematical expectation theorem and thermal behaviour

This paper studies the radiation properties of the immiscible blend of nylon1010 and HIPS. The gel fraction increased with increasing radiation dose. The network was found mostly in nylon1010, the networks were also found in both nylon1010 and HIPS when the dose reaches 0.85 MGy or more. We used the Charleby-Pinner equation and the modified Zhang-Sun-Qian equation to simulate the relationship with the dose and the sol fraction. The latter equation fits well with these polymer blends and the relationship used by it showed better linearity than the one by the Charleby-Pinner equation. We also studied the conditions of formation of the network by the mathematical expectation theorem for the binary system. Thermal properties of polymer blend were observed by DSC curves. The crystallization temperature decreases with increasing dose because the cross-linking reaction inhibited the crystallization procession and destroyed the crystals. The melting temperature also reduced with increasing radiation dose. The dual melting peak gradually shifted to single peak and the high melting peak disappeared at high radiation dose. However, the radiation-induced crystallization was observed by the heat of fusion increasing at low radiation dose. On the other hand, the crystal will be damaged by radiation. A similar conclusion may be drawn by the DSC traces when the polymer blends were crystallized. When the radiation dose increases, the heat of fusion reduces dramatically and so does the heat of crystallization. (C) 1999 Elsevier Science Ltd. All rights reserved.

A QUASI-SIMPLEX METHOD FOR STRICTLY CONVEX QUADRATIC PROGRAMMING

本文提出一个不用 Kuhn- Tucker条件而直接搜索严格凸二次规划最优目标点的鲁棒方法 .在搜索过程中 ,目标点沿约束多面体边界上的一条折线移动 .这种移动目标点的思想可以被认为是线性规划单纯形法的自然推广 ,在单纯形法中 ,目标点从一个顶点移到另一个顶点。

油藏数值模拟中的网格粗化和细化技术研究

The grid is a foundation of reservoir description and reservoir simulation. The scale of grid size is vital influence for the precision of reservoir simulation the gridding of reservoir parameters require reasonable interpolation method with computing quickly and accurately. The improved distant weighted interpolation method has many properties, such as logical data points selection, exact interpolation, less calculation and simply programming, and its application can improve the precision of reservoir description and reservoir simulation. The Fractal geologic statistics describes scientifically the distribution law of various geological properties in reservoir. The Fractal interpolation method is applied in grid interpolation of reservoir parameters, and the result more accorded with the geological property and configuration of reservoir, and improved the rationality and quality of interpolation calculation. Incorporating the improved distant weighted interpolation method with Fractal interpolation method during mathematical model of grid-upscaling and grid-downscaling, the softwares of GROUGH(grid-upscaling) and GFINE (grid-downscaling) were developed aiming at the questions of grid-upscaling and grid-downscaling in reservoir description and reservoir simulation. The softwares of GROUGH and GFINE initial applied in the research of fined and large-scale reservoir simulation. It obtained fined distribution of remaining oil applying grid-upscaling and grid-downscaling technique in fined reservoir simulation of Es21-2 Shengtuo oilfield, and provided strongly and scientific basis for integral and comprehensive adjustment. It's a giant tertiary oil recovery pilot area in the alkaline/surfactant/polymer flooding pilot area of west district of Gudao oilfield, and first realized fined reservoir simulation of chemical flooding using grid-upscaling and grid-downscaling technique. It has wide applied foreground and significant research value aiming at the technique of grid-upscaling and grid-downscaling in reservoir description and reservoir simulation.

Advanced Programming Language Features for Executable Design Patterns "Better Patterns Through Reflection

The Design Patterns book [GOF95] presents 24 time-tested patterns that consistently appear in well-designed software systems. Each pattern is presented with a description of the design problem the pattern addresses, as well as sample implementation code and design considerations. This paper explores how the patterns from the "Gang of Four'', or "GOF'' book, as it is often called, appear when similar problems are addressed using a dynamic, higher-order, object-oriented programming language. Some of the patterns disappear -- that is, they are supported directly by language features, some patterns are simpler or have a different focus, and some are essentially unchanged.

The Grasping Problem: Toward Task-Level Programming for an Articulated Hand

This report presents a system for generating a stable, feasible, and reachable grasp of a polyhedral object. A set of contact points on the object is found that can result in a stable grasp; a feasible grasp is found in which the robot contacts the object at those contact points; and a path is constructed from the initial configuration of the robot to the stable, feasible final grasp configuration. The algorithm described in the report is designed for the Salisbury hand mounted on a Puma 560 arm, but a similar approach could be used to develop grasping systems for other robots.

Symbolic Mathematical Laboratory

A large computer program has been developed to aid applied mathematicians in the solution of problems in non-numerical analysis which involve tedious manipulations of mathematical expressions. The mathematician uses typed commands and a light pen to direct the computer in the application of mathematical transformations; the intermediate results are displayed in standard text-book format so that the system user can decide the next step in the problem solution. Three problems selected from the literature have been solved to illustrate the use of the system. A detailed analysis of the problems of input, transformation, and display of mathematical expressions is also presented.

The Structure of Mathematical Knowledge

This report develops a conceptual framework in which to talk about mathematical knowledge. There are several broad categories of mathematical knowledge: results which contain the traditional logical aspects of mathematics; examples which contain illustrative material; and concepts which include formal and informal ideas, that is, definitions and heuristics.

The Definition and Implementation of a Computer Programming Language Based on Constraints

The constraint paradigm is a model of computation in which values are deduced whenever possible, under the limitation that deductions be local in a certain sense. One may visualize a constraint 'program' as a network of devices connected by wires. Data values may flow along the wires, and computation is performed by the devices. A device computes using only locally available information (with a few exceptions), and places newly derived values on other, locally attached wires. In this way computed values are propagated. An advantage of the constraint paradigm (not unique to it) is that a single relationship can be used in more than one direction. The connections to a device are not labelled as inputs and outputs; a device will compute with whatever values are available, and produce as many new values as it can. General theorem provers are capable of such behavior, but tend to suffer from combinatorial explosion; it is not usually useful to derive all the possible consequences of a set of hypotheses. The constraint paradigm places a certain kind of limitation on the deduction process. The limitations imposed by the constraint paradigm are not the only one possible. It is argued, however, that they are restrictive enough to forestall combinatorial explosion in many interesting computational situations, yet permissive enough to allow useful computations in practical situations. Moreover, the paradigm is intuitive: It is easy to visualize the computational effects of these particular limitations, and the paradigm is a natural way of expressing programs for certain applications, in particular relationships arising in computer-aided design. A number of implementations of constraint-based programming languages are presented. A progression of ever more powerful languages is described, complete implementations are presented and design difficulties and alternatives are discussed. The goal approached, though not quite reached, is a complete programming system which will implicitly support the constraint paradigm to the same extent that LISP, say, supports automatic storage management.

Inspection Methods in Programming

The work reported here lies in the area of overlap between artificial intelligence software engineering. As research in artificial intelligence, it is a step towards a model of problem solving in the domain of programming. In particular, this work focuses on the routine aspects of programming which involve the application of previous experience with similar programs. I call this programming by inspection. Programming is viewed here as a kind of engineering activity. Analysis and synthesis by inspection area prominent part of expert problem solving in many other engineering disciplines, such as electrical and mechanical engineering. The notion of inspections methods in programming developed in this work is motivated by similar notions in other areas of engineering. This work is also motivated by current practical concerns in the area of software engineering. The inadequacy of current programming technology is universally recognized. Part of the solution to this problem will be to increase the level of automation in programming. I believe that the next major step in the evolution of more automated programming will be interactive systems which provide a mixture of partially automated program analysis, synthesis and verification. One such system being developed at MIT, called the programmer's apprentice, is the immediate intended application of this work. This report concentrates on the knowledge are of the programmer's apprentice, which is the form of a taxonomy of commonly used algorithms and data structures. To the extent that a programmer is able to construct and manipulate programs in terms of the forms in such a taxonomy, he may relieve himself of many details and generally raise the conceptual level of his interaction with the system, as compared with present day programming environments. Also, since it is practical to expand a great deal of effort pre-analyzing the entries in a library, the difficulty of verifying the correctness of programs constructed this way is correspondingly reduced. The feasibility of this approach is demonstrated by the design of an initial library of common techniques for manipulating symbolic data. This document also reports on the further development of a formalism called the plan calculus for specifying computations in a programming language independent manner. This formalism combines both data and control abstraction in a uniform framework that has facilities for representing multiple points of view and side effects.

Foundations of Actor Semantics

The actor message-passing model of concurrent computation has inspired new ideas in the areas of knowledge-based systems, programming languages and their semantics, and computer systems architecture. The model itself grew out of computer languages such as Planner, Smalltalk, and Simula, and out of the use of continuations to interpret imperative constructs within A-calculus. The mathematical content of the model has been developed by Carl Hewitt, Irene Greif, Henry Baker, and Giuseppe Attardi. This thesis extends and unifies their work through the following observations. The ordering laws postulated by Hewitt and Baker can be proved using a notion of global time. The most general ordering laws are in fact equivalent to an axiom of realizability in global time. Independence results suggest that some notion of global time is essential to any model of concurrent computation. Since nondeterministic concurrency is more fundamental than deterministic sequential computation, there may be no need to take fixed points in the underlying domain of a power domain. Power domains built from incomplete domains can solve the problem of providing a fixed point semantics for a class of nondeterministic programming languages in which a fair merge can be written. The event diagrams of Greif's behavioral semantics, augmented by Baker's pending events, form an incomplete domain. Its power domain is the semantic domain in which programs written in actor-based languages are assigned meanings. This denotational semantics is compatible with behavioral semantics. The locality laws postulated by Hewitt and Baker may be proved for the semantics of an actor-based language. Altering the semantics slightly can falsify the locality laws. The locality laws thus constrain what counts as an actor semantics.

Structure and Interpretation of Computer Programs

"The Structure and Interpretation of Computer Programs" is the entry-level subject in Computer Science at the Massachusetts Institute of Technology. It is required of all students at MIT who major in Electrical Engineering or in Computer Science, as one fourth of the "common core curriculum," which also includes two subjects on circuits and linear systems and a subject on the design of digital systems. We have been involved in the development of this subject since 1978, and we have taught this material in its present form since the fall of 1980 to approximately 600 students each year. Most of these students have had little or no prior formal training in computation, although most have played with computers a bit and a few have had extensive programming or hardware design experience. Our design of this introductory Computer Science subject reflects two major concerns. First we want to establish the idea that a computer language is not just a way of getting a computer to perform operations, but rather that it is a novel formal medium for expressing ideas about methodology. Thus, programs must be written for people to read, and only incidentally for machines to execute. Secondly, we believe that the essential material to be addressed by a subject at this level, is not the syntax of particular programming language constructs, nor clever algorithms for computing particular functions of efficiently, not even the mathematical analysis of algorithms and the foundations of computing, but rather the techniques used to control the intellectual complexity of large software systems.

Evaluation of nonlinear chromatographic performance by frontal analysis using a simple multi-plate mathematical model

A multi-plate (NIP) mathematical model was proposed by frontal analysis to evaluate nonlinear chromatographic performance. One of its advantages is that the parameters may be easily calculated from experimental data. Moreover, there is a good correlation between it and the equilibrium-dispersive (E-D) or Thomas models. This shows that it can well accommodate both types of band broadening that is comprised of either diffusion-dominated processes or kinetic sorption processes. The MP model can well describe experimental breakthrough curves that were obtained from membrane affinity chromatography and column reversed-phase liquid chromatography. Furthermore, the coefficients of mass transfer may be calculated according to the relationship between the MP model and the E-D or Thomas models. (C) 2004 Elsevier B.V. All rights reserved.

On Genetic Programming and Knowledge Discovery in Transcriptome

Rowland, J. J. (2004) On Genetic Programming and Knowledge Discovery in Transcriptome Data. Proc. IEEE Congress on Evolutionary Computation, Portland, Oregon. pp 158-165. ISBN 0-7803-8515-2