Derivation of sorting programs

Program synthesis for critical applications has become a viable alternative to program verification. Nested resolution and its extension are used to synthesize a set of sorting programs from their first order logic specifications. A set of sorting programs, such as, naive sort, merge sort, and insertion sort, were successfully synthesized starting from the same set of specifications

Theory and ontology for sharing temporal knowledge

Using current technology, the sharing or re-using of knowledge-bases is very difficult, if not impossible. ARPA has correctly recognized the problem and funded a knowledge sharing initiative. One of the outcomes of this project is a formal language called Knowledge Interchange Format (KIF) for representing knowledge that could be translated into other languages. Capturing and representing design knowledge and reasoning with them have become very important for NASA who is a pioneer of innovative design of unique products. For upgrading an existing design for changing technology, needs, or requirements, it is essential to understand the design rationale, design choices, options and other relevant information associated with the design. Capturing such information and presenting them in the appropriate form are part of the ongoing Design Knowledge Capture project of NASA. The behavior of an object and various other aspects related to time are captured by the appropriate temporal knowledge. The captured design knowledge will be represented in such a way that various groups of NASA who are interested in various aspects of the design cycle should be able to access and use the design knowledge effectively. To facilitate knowledge sharing among these groups, one has to develop a very well defined ontology. Ontology is a specification of conceptualization. In the literature several specific domains were studied and some well defined ontologies were developed for such domains. However, very little, or no work has been done in the area of representing temporal knowledge to facilitate sharing. During the ASEE summer program, I have investigated several temporal models and have proposed a theory for time that is flexible to accommodate the time elements, such as, points and intervals, and is capable of handling the qualitative and quantitative temporal constraints. I have also proposed a primitive temporal ontology using which other relevant temporal ontologies can be built. I have investigated various issues of sharing knowledge and have proposed a formal framework for modeling the concept of knowledge sharing. This work may be implemented and tested in the software environment supplied by Knowledge Based System, Inc

Capturing design knowledge

A scheme is proposed to capture the design knowledge of a complex object including functional, structural, performance, and other constraints. Further, the proposed scheme is also capable of capturing the rationale behind the design of an object as a part of the overall design of the object. With this information, the design of an object can be treated as a case and stored with other designs in a case base. A person can then perform case-based reasoning by examining these designs. Methods of modifying object designs are also discussed. Finally, an overview of an approach to fault diagnosis using case-based reasoning is given

All feasible plans using temporal reasoning

An interval-based temporal reasoning algorithm is applied to planning problems. The generation of all feasible temporal plans and its importance are discussed

Scheduling System Assessment, and Development and Enhancement of Re-engineered Version of GPSS

The objective of this project is two-fold. First to provide an evaluation of a commercially developed version of the ground processing scheduling system (GPSS) for its applicability to the Kennedy Space Center (KSC) ground processing problem. Second, to work with the KSC GPSS development team and provide enhancement to the existing software. Systems reengineering is required to provide a sustainable system for the users and the software maintenance group. Using the LISP profile prototype code developed by the GPSS reverse reengineering groups as a building block, we have implemented the resource deconfliction portion of GPSS in common LISP using its object oriented features. The prototype corrects and extends some of the deficiencies of the current production version, plus it uses and builds on the classes from the development team's profile prototype

Identification of the B-Raf/Mek/Erk MAP kinase pathway as a target for all-trans retinoic acid during skin cancer promotion

<p>Abstract</p> <p>Background</p> <p>Retinoids have been studied extensively for their potential as therapeutic and chemopreventive agents for a variety of cancers, including nonmelanoma skin cancer (NMSC). Despite their use for many years, the mechanism of action of retinoids in the prevention of NMSC is still unclear. In this study we have attempted to understand the chemopreventive mechanism of all-<it>trans </it>retinoic acid (ATRA), a primary biologically active retinoid, in order to more efficiently utilize retinoids in the clinic.</p> <p>Results</p> <p>We have used the 2-stage dimethylbenzanthracene (DMBA)/12-<it>O</it>-tetradecanoylphorbol-13-acetate (TPA) mouse skin carcinogenesis model to investigate the chemopreventive effects of ATRA. We have compared the gene expression profiles of control skin to skin subjected to the 2-stage protocol, with or without ATRA, using Affymetrix 430 2.0 DNA microarrays. Approximately 49% of the genes showing altered expression with TPA treatment are conversely affected when ATRA is co-administered. The activity of these genes, which we refer to as 'counter-regulated', may contribute to chemoprevention by ATRA. The counter-regulated genes have been clustered into functional categories and bioinformatic analysis has identified the B-Raf/Mek/Erk branch of the MAP kinase pathway as one containing several genes whose upregulation by TPA is blocked by ATRA. We also show that ATRA blocks signaling through this pathway, as revealed by immunohistochemistry and Western blotting. Finally, we found that blocking the B-Raf/Mek/Erk pathway with a pharmacological inhibitor, Sorafenib (BAY43-9006), induces squamous differentiation of existing skin SCCs formed in the 2-stage model.</p> <p>Conclusion</p> <p>These results indicate that ATRA targets the B-Raf/Mek/Erk signaling pathway in the 2-stage mouse skin carcinogenesis model and this activity coincides with its chemopreventive action. This demonstrates the potential for targeting the B-Raf/Mek/Erk pathway for chemoprevention and therapy of skin SCC in humans. In addition our DNA microarray results provide the first expression signature for the chemopreventive effect of ATRA in a mouse skin cancer model. This is a potential source for novel targets for ATRA and other chemopreventive and therapeutic agents that can eventually be tested in the clinic.</p

Experience with extended DC parallelism of connection graphs

[[notice]]補正完畢[[journaltype]]國

Parallel deduction of connection graphs

[[notice]]補正完畢[[booktype]]紙

Constraints

this paper, we propose an ontology for representing quantitative first order temporal constraints. This logic that we propose in this paper uses instant and interval structures as primitives and has the expressive power of the popular temporal logics of Shoham&apos;s [9] and BTK&apos;s [4]. The advantage of our logic is that it uses the syntactic structures that explicitly implements the semantics of the temporal structures, such as, true throughout an interval (tt), or true at a point (at). Therefore, developing efficient inference rules and proof procedures for this logic is relatively easy. This paper is organized as the following: In section 2, we introduce the representation of temporal knowledge. In section 3 we introduce our temporal constraint language providing its syntax and semantics. The paper is concluded with a summary and a discussion in section 4. 2 Representation of Temporal Knowledg

Issues on Synchronizing when Propagating Temporal Constraints

: Synchronization plays a major role in several applications including parallel programs, process control and scheduling. In this paper we address the issues in propagating and synchronizing temporal constraints for the purpose of projecting temporal distance. We start with a very simple temporal model for project planning, and then we improve the model to address varying duration of a task and as well as varying environment that may affect the duration of a task. Keywords: temporal reasoning, metric bounds, approximate reasoning, conditional temporal constraints. Introduction Many research efforts in temporal reasoning were concerned with representation of time and reasoning with temporal constraints. The reasoning with temporal constraints primarily has dual purposes: for checking the satisfiability of the temporal constraints, and for obtaining the temporal relation between a given pair of temporal primitives of the representation. Many applications use either one or both modes o..