Computer-aided programming using formally specificed design templates

This paper describes a formal component language, used to support automated component-based program development. The components, referred to as templates, are machine processable, meaning that appropriate tool support, such as retrieval support, can be developed. The templates are highly adaptable, meaning that they can be applied to a wide range of problems. Some of the main features of the language are described, including: higher-order parameters; state variable declarations; specification statements and conditionals; applicability conditions and theories; meta-level place holders; and abstract data structures.

Bioprocess-centered molecular design (BMD) for the efficient production of an interfacially active peptide

The efficient expression and purification of an interfacially active peptide (mLac21) was achieved by using bioprocess-centered molecular design (BMD), wherein key bioprocess considerations are addressed during the initial molecular biology work. The 21 amino acid mLac21 peptide sequence is derived from the lac repressor protein and is shown to have high affinity for the oil-water interface, causing a substantial reduction in interfacial tension following adsorption. The DNA coding for the peptide sequence was cloned into a modified pET-31(b) vector to permit the expression of mLac21 as a fusion to ketosteroid isomerase (KSI). Rational iterative molecular design, taking into account the need for a scaleable bioprocess flowsheet, led to a simple and efficient bioprocess yielding mLac21 at 86% purity following ion exchange chromatography (and >98% following chromatographic polishing). This case study demonstrates that it is possible to produce acceptably pure peptide for potential commodity applications using common scaleable bioprocess unit operations. Moreover, it is shown that BMD is a powerful strategy that can be deployed to reduce bioseparation complexity. (C) 2004 Wiley Periodicals, Inc.

Principles versus artifacts in computer science curriculum design

Computer Science is a subject which has difficulty in marketing itself. Further, pinning down a standard curriculum is difficult-there are many preferences which are hard to accommodate. This paper argues the case that part of the problem is the fact that, unlike more established disciplines, the subject does not clearly distinguish the study of principles from the study of artifacts. This point was raised in Curriculum 2001 discussions, and debate needs to start in good time for the next curriculum standard. This paper provides a starting point for debate, by outlining a process by which principles and artifacts may be separated, and presents a sample curriculum to illustrate the possibilities. This sample curriculum has some positive points, though these positive points are incidental to the need to start debating the issue. Other models, with a less rigorous ordering of principles before artifacts, would still gain from making it clearer whether a specific concept was fundamental, or a property of a specific technology. (C) 2003 Elsevier Ltd. All rights reserved.

Lattice-dome design using a knowledge-based system approach

In the design of lattice domes, design engineers need expertise in areas such as configuration processing, nonlinear analysis, and optimization. These are extensive numerical, iterative, and lime-consuming processes that are prone to error without an integrated design tool. This article presents the application of a knowledge-based system in solving lattice-dome design problems. An operational prototype knowledge-based system, LADOME, has been developed by employing the combined knowledge representation approach, which uses rules, procedural methods, and an object-oriented blackboard concept. The system's objective is to assist engineers in lattice-dome design by integrating all design tasks into a single computer-aided environment with implementation of the knowledge-based system approach. For system verification, results from design examples are presented.

Constructing a class of designs with proportional balance

Text serves as a sequel to 'Computational and Constructive Design Theory,' c1996; containing research papers and surveys of recent research work on design construction and computer-aided study of designs. For researchers in theory of computational designs.

Expansion-based algorithms for finding single pair shortest path on surface

Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning System (CPS), Computer Aided Design (CAD) systems and laser range scanner, surface models axe becoming more and more complex. It is not uncommon that a surface model contains millions of polygons. The single pair shortest path problem is getting harder and harder to solve. Based on the observation that the single pair shortest path is in the locality, we propose in this paper efficient methods by excluding part of the surface model without considering them in the search process. Three novel expansion-based algorithms are proposed, namely, Naive algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global shortest path exists. The search process terminates once the global optimum criteria are satisfied. By reducing the searching region, the performance is improved dramatically in most cases.

Cell compartmentalisation in planctomycetes: novel types of structural organisation for the bacterial cell

The organisation of cells of the planctomycete species Pirellula marina, Isosphaera pallida, Gemmata obscuriglobus, Planctomyces mat-is and Candidatus Brocadia anammoxidans was investigated based on ultrastructure derived from thin-sections of cryosubstituted cells, freeze-fracture replicas, and in the case of Gemmata obscuriglobus and Pirellllla marina, computer-aided 3-D reconstructions from serial sections of cryosubstituted cells. All planctomycete cells display a peripheral ribosome-free region, termed here the paryphoplasm, surrounding the perimeter of the cell, and an interior region including any nucleoid regions as well as ribosome-like particles, bounded by a single intracytoplasmic membrane (ICM), and termed the pirellulosome in Pirellula species. Immunogold labelling and RNase-gold cytochemistry indicates that in planctomycetes all the cell DNA is contained wholly within the interior region bounded by the ICM, and the paryphoplasm contains no DNA but at least some of the cell's RNA. The ICM in Isosphaera pallida and Planctomyces mat-is is invaginated such that the paryphoplasm forms a major portion of the cell interior in sections, but in other planctomycetes it remains as a peripheral zone. In the anaerobic ammonium-oxidising (anammox process) chemoautotroph Candidatus Brocadia anammoxidans the interior region bounded by ICM contains a further internal single-membrane-bounded region, the anam-moxosome. In Gemmata obscuriglobus. the interior ICM-bounded region contains the nuclear body, a double-membrane-bounded region containing the cell's nucleoid and all genomic DNA in addition to some RNA. Shared features of cell compartmentalisation in different planctomycetes are consistent with the monophyletic nature of the planctomycetes as a distinct division of the Bacteria. The shared organisational plan for the planctomycete cell constitutes a new type not known in cells of other bacteria.

The variety of variables in automated real-time refinement

The refinement calculus is a well-established theory for deriving program code from specifications. Recent research has extended the theory to handle timing requirements, as well as functional ones, and we have developed an interactive programming tool based on these extensions. Through a number of case studies completed using the tool, this paper explains how the tool helps the programmer by supporting the many forms of variables needed in the theory. These include simple state variables as in the untimed calculus, trace variables that model the evolution of properties over time, auxiliary variables that exist only to support formal reasoning, subroutine parameters, and variables shared between parallel processes.

Synthesis and complexation properties of some novel lariat-crown ethers

Several new lariat-crown ethers bearing either bridged bisdioxine or tetraoxaadamantane units as chiral substituents are prepared by reacting the corresponding amino-crown ether derivatives with the dimeric alpha-oxoketene, the latter obtained by flash vacuum pyrolysis of a furan-2,3-dione precursor. Complexation properties towards differently charged metal ions are investigated by H-1 NMR titration to obtain complexation constants (K-c-values for potassium/ sodium rhodanides: 480-1100 mol dm(-3)), as well as extraction experiments to explore the metal ion transportation abilities of the new lariat crown derivatives. In particular, a significantly increased ability to transport metal ions from water into chloroform was found with spherical tetraoxaadamantyl derivatives when compared with the free amino-benzocrown ethers.