a constraint solver and its application to path feasibility analysis

Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.

structuring and manipulating hand-drawn concept maps

Concept maps are an important tool to knowledge organization,representation, and sharing. Most current concept map tools do not provide full support for hand-drawn concept map creation and manipulation, largely due to the lack of methods to recognize hand-drawn concept maps. This paper proposes a structure recognition method. Our algorithm can extract node blocks and link blocks of a hand-drawn concept map by combining dynamic programming and graph partitioning and then build a concept-map structure by relating extracted nodes and links. We also introduce structure-based intelligent manipulation technique of hand-drawn concept maps. Evaluation shows that our method has high structure recognition accuracy in real time, and the intelligent manipulation technique is efficient and effective.

In situ annealing treatment and In-doping of GaN epilayers grown by MOVPE

The effects of in situ annealing treatment in the initial growth stage and In-doping during growth of the GaN on the material properties were investigated. GaN was grown by LP-MOVPE. In situ annealing reduced the full-width at half-maximum (FWHM) of X-ray rocking curves and reduced etch pit density of GaN films. It improved the optical properties of the epilayer. Undoped and In-doped GaN films of initial growth stage were investigated. It was found that morphology and optical properties were improved in In-doped samples. (C) 2000 Elsevier Science B.V. All rights reserved.

Synthesis and luminescence of CdS/ZnS core/shell nanocrystals

CdS/ZnS core/shell nanocrystals were prepared from an aqueous/alcohol medium. A red shift of the absorption spectrum and an increase of the room temperature photoluminescence intensity accompanied shell growth.

Solving MIN UR problem by triangle evolution algorithm with archiving and niche techniques

In this paper, as an extension of minimum unsatisfied linear relations problem (MIN ULR), the minimum unsatisfied relations (MIN UR) problem is investigated. A triangle evolution algorithm with archiving and niche techniques is proposed for MIN UR problem. Different with algorithms in literature, it solves MIN problem directly, rather than transforming it into many sub-problems. The proposed algorithm is also applicable for the special case of MIN UR, in which it involves some mandatory relations. Numerical results show that the algorithm is effective for MIN UR problem and it outperforms Sadegh's algorithm in sense of the resulted minimum inconsistency number, even though the test problems are linear.

PLC在长焊缝激光拼焊系统中的应用

介绍了长焊缝激光拼焊系统的工作原理和控制要求。针对长焊缝激光拼焊的难点,提出了焊缝塑性成形原理,采用碾压轮对板材焊缝进行碾压预处理提高定位精度。阐述了牵引电机同步控制原理和碾压轮力控制原理。详细介绍了该系统的组成和工作原理,确定了以三菱PLC为核心的长焊缝激光拼焊的控制系统,说明了其硬件组成、软件设计和控制系统的抗干扰措施。

基于PLC的激光拼焊生产线控制系统设计

本文介绍了基于PLC的激光拼焊生产线控制系统。分析了激光拼焊生产工艺过程,针对激光拼焊生产过程中多工作单元相互协调和工业过程复杂等特点,开发了基于三菱PLC的控制系统,介绍了系统的软硬件设计方法。该系统能够完成上料、定位、压紧、焊接、检测、下料以及废料处理功能,实现了激光拼焊生产线的全自动化,具有较高的安全性和稳定性。

基于工业PC和PLC技术的料架指示系统

本文介绍了一个应用于变速箱装配生产线的料架指示系统的主要功能,阐述了系统的硬件结构和软件设计思想。

PLCß介导的钙调腺苷酸环化酶在突触可塑性相关基因转录中的作用和FE65对海马依赖学习及LTP的调节

Gene regulation is required for activity-dependent changes in synaptic plasticity and remodeling. The metabotropic glutamate receptors (mGluRs) contribute to different brain functions, including learning/memory, mental disorders, drug addiction, and persistent pain in the CNS. We found that Gp I mGluRs activate PLCß through Gq and then lead to activation of several calcium-dependent signaling pathways, including ERK, which play an important role in gene transcription. These findings support a calcium-dependent role for Gq in release of Calcium and activation of calcium-stimulated adenylyl cyclases I in activity-dependent transcription in response to application of group I metabotropic glutamate receptors agonist and may provide insights into group I mGluRs-dependent synaptic plasticity through MAP kinases signaling. Moreover, the present study investigated the transcription-dependent changes of Arc in response to the activation of group I mGluRs and suggested the central role of ERK1/2 in group I mGluR-mediated Arc transcription. Further, we selected APP-interaction protein FE65 to investigate the mechanism of transcription-related process in synaptic plasticity. FE65 is expressed predominantly in the brain, and interacts with the C-terminal domain of β-amyloid precursor protein (APP). We examined hippocampus-dependent memory and in vivo long-term potentiation (LTP) at the CA1 synapses with the isoform-specific FE65 knock-out (p97FE65-/-) mice. p97FE65 knock-out mice showed impaired short-term memory for both TDPA and CFC when tested 10min after training, which is transcription-independent. Consistently, at the Schaffer collateral-CA1 synapses, p97FE65 knock-out mice showed defective early phase LTP. These results demonstrate novel roles of FE65 in synaptic plasticity, acquisition, and retention for certain forms of memory formation.

Supporting Reuse and Evolution in Software Design

Program design is an area of programming that can benefit significantly from machine-mediated assistance. A proposed tool, called the Design Apprentice (DA), can assist a programmer in the detailed design of programs. The DA supports software reuse through a library of commonly-used algorithmic fragments, or cliches, that codifies standard programming. The cliche library enables the programmer to describe the design of a program concisely. The DA can detect some kinds of inconsistencies and incompleteness in program descriptions. It automates detailed design by automatically selecting appropriate algorithms and data structures. It supports the evolution of program designs by keeping explicit dependencies between the design decisions made. These capabilities of the DA are underlaid bya model of programming, called programming by successive elaboration, which mimics the way programmers interact. Programming by successive elaboration is characterized by the use of breadth-first exposition of layered program descriptions and the successive modifications of descriptions. A scenario is presented to illustrate the concept of the DA. Technques for automating the detailed design process are described. A framework is given in which designs are incrementally augmented and modified by a succession of design steps. A library of cliches and a suite of design steps needed to support the scenario are presented.

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.

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 Role of Programming in the Formulation of Ideas

Classical mechanics is deceptively simple. It is surprisingly easy to get the right answer with fallacious reasoning or without real understanding. To address this problem we use computational techniques to communicate a deeper understanding of Classical Mechanics. Computational algorithms are used to express the methods used in the analysis of dynamical phenomena. Expressing the methods in a computer language forces them to be unambiguous and computationally effective. The task of formulating a method as a computer-executable program and debugging that program is a powerful exercise in the learning process. Also, once formalized procedurally, a mathematical idea becomes a tool that can be used directly to compute results.

SodaBot: A Software Agent Environment and Construction System

This thesis presents SodaBot, a general-purpose software agent user-environment and construction system. Its primary component is the basic software agent --- a computational framework for building agents which is essentially an agent operating system. We also present a new language for programming the basic software agent whose primitives are designed around human-level descriptions of agent activity. Via this programming language, users can easily implement a wide-range of typical software agent applications, e.g. personal on-line assistants and meeting scheduling agents. The SodaBot system has been implemented and tested, and its description comprises the bulk of this thesis.