Data definition and manipulation languages for a CAD database

In this paper the main features of ARDBID (A Relational Database for Interactive Design) have been described. An overview of the organization of the database has been presented and a detailed description of the data definition and manipulation languages has been given. These have been implemented on a DEC 1090 system.

NUVIEW:software for display and interactive manipulation of nucleic acid models

The NUVIEW software package allows skeletal models of any double helical nucleic acid molecule to be displayed out a graphics monitor and to apply various rotations, translations and scaling transformations interactively, through the keyboard. The skeletal model is generated by connecting any pair of representative points, one from each of the bases in the basepair. In addition to the above mentioned manipulations, the base residues can be identified by using a locator and the distance between any pair of residues can be obtained. A sequence based color coded display allows easy identification of sequence repeats, such as runs of Adenines. The real time interactive manipulation of such skeletal models for large DNA/RNA double helices, can be used to trace the path of the nucleic acid chain in three dimensions and hence get a better idea of its topology, location of linear or curved regions, distances between far off regions in the sequence etc. A physical picture of these features will assist in understanding the relationship between base sequence, structure and biological function in nucleic acids.

Temperature and Stress Controlled Surface Manipulation in Ni-Al Nano-Layers

In the present paper the effects of temperature and high strain rate loading on the formation of various surface patterns in Ni-Al nano-layers are discussed. Effects of boundary conditions on the B2 -> BCT phase transformation in the nano-layer are also discussed. This study is aimed at developing several interesting patterned surface structures in Ni-Al nanolayer by controlling the phase transformation temperature and mechanical loading.

Manipulation of the Hydration Levels in Minerals of Sodium Cadmium Bisulfate toward the Design of Functional Materials

Several variants of hydrated sodium cadmium bisulfate, Na(2)Cd(2)(SO(4))(3) center dot 3H(2)O, Na(2)Cd(SO(4))(2) center dot 2H(2)O, and Na(2)Cd(SO(4))(2) center dot 4H(2)O have been synthesized, and their thermal properties followed by phase transitions have been invesigated. The formation of these phases depends on the stochiometry and the time taken for crystallization from water. Na(2)Cd(2)(SO(4))(3)center dot 3H(2)O, which crystallizes in the trigonal system, space group P3c, is grown from the aqueous solution in about four weeks. The krohnkite type mineral Na(2)Cd(SO(4))(2) center dot 2H(2)O and the mineral astrakhanite, also known as blodite, Na(2)Cd (SO(4))(2)center dot 4H(2)O, crystallize concomittantly in about 24 weeks. Both these minerals belong to the monoclinic system(space group P2(1)/c). Na(2)Cd(2)(SO(4))(3)center dot 3H(2)O loses water completely when heated to 250 degrees C and transforms to a dehydrated phase (cubic system, space group I (4) over bar 3d) whose structure has been established using ab initio powder diffration techniques. Na(2)Cd(SO(4))(2)center dot 2H(2)O transforms to alpha-Na(2)Cd(SO(4))(2) (space group C2/c) on heating to 150 degrees C which is a known high ionic conductor and remains intact over prolonged periods of exposure to moisture (over six months). However, when alpha-Na(2)Cd(SO(4))(2) is heated to 570 degrees C followed by sudden quenching in liquid nitrogen beta-Na(2)Cd(SO(4))(2) (P2(1)/c) is formed. beta-Na(2)Cd(SO(4))(2) takes up water from the atmosphere and gets converted completely to the krohnkite type mineral in about four weeks. Further, beta-Na(2)Cd(SO(4))(2) has a conductivity behavior comparable to the a-form up to 280 degrees C, the temperature required for the transformation of the beta- to alpha-form. These experiments demonstrate the possibility of utilizing the abundantly available mineral sources as precursors to design materials with special properties.

Modeling of wheeled mobile robots using dextrous manipulation kinematics

Abstract—This document introduces a new kinematic simulation of a wheeled mobile robot operating on uneven terrain. Our modeling method borrows concepts from dextrous manipulation. This allows for an accurate simulation of the way 3-dimensional wheels roll over a smooth ground surface. The purpose of the simulation is to validate a new concept for design of off-road wheel suspensions, called Passive Variable Camber (PVC). We show that PVC eliminates kinematic slip for an outdoor robot. Both forward and inverse kinematics are discussed and simulation results are presented.

Whole arm manipulation using closed and hybrid planar chains: A kinematic study

This paper studies planar whole arm manipulation of a circular object using closed loop and hybrid manipulators. The manipulation is simple with fewer degrees of actuation than the task space. This is an useful operation if the initial and final positions of the object are on the same surface. Closed loop manipulator is a 4/5 bar mechanism. In hybrid manipulators a open loop manipulator with 3/4 links is attached to the floating link of 4/5 bar mechanism. The mobility analysis is carried out to find the connectivity of the object with reference to frame. The manipulation (forward kinematics) starts from a given configuration of the object and the manipulator. In hybrid manipulators determination of initial configuration involves inverse kinematics of open loop manipulator. The input joint velocities are used to demonstrate the manipulation. Conditions are specified for prehensile manipulation.

COMPOSITE AND MULTI-SCALE COMPLIANT MECHANISMS FOR MANIPULATION AND MECHANICAL CHARACTERIZATION

In this paper, we integrate two or more compliant mechanisms to get enhanced functionality for manipulating and mechanically characterizing the grasped objects of varied size (cm to sub-mm), stiffness (1e5 to 10 N/m), and materials (cement to biological cells). The concepts of spring-lever (SL) model, stiffness maps, and non-dimensional kinetoelastostatic maps are used to design composite and multi-scale compliant mechanisms. Composite compliant mechanisms comprise two or more different mechanisms within a single elastic continuum while multi-scale ones possess the additional feature of substantial difference in the sizes of the mechanisms that are combined into one. We present three applications: (i) a composite compliant device to measure the failure load of the cement samples; (ii) a composite multi-scale compliant gripper to measure the bulk stiffness of zebrafish embryos; and (iii) a compliant gripper combined with a negative-stiffness element to reduce the overall stiffness. The prototypes of all three devices are made and tested. The cement sample needed a breaking force of 22.5 N; the zebrafish embryo is found to have bulk stiffness of about 10 N/m; and the stiffness of a compliant gripper was reduced by 99.8 % to 0.2 N/m.

Falcon: A Graph Manipulation Language for Heterogeneous Systems

Graph algorithms have been shown to possess enough parallelism to keep several computing resources busy-even hundreds of cores on a GPU. Unfortunately, tuning their implementation for efficient execution on a particular hardware configuration of heterogeneous systems consisting of multicore CPUs and GPUs is challenging, time consuming, and error prone. To address these issues, we propose a domain-specific language (DSL), Falcon, for implementing graph algorithms that (i) abstracts the hardware, (ii) provides constructs to write explicitly parallel programs at a higher level, and (iii) can work with general algorithms that may change the graph structure (morph algorithms). We illustrate the usage of our DSL to implement local computation algorithms (that do not change the graph structure) and morph algorithms such as Delaunay mesh refinement, survey propagation, and dynamic SSSP on GPU and multicore CPUs. Using a set of benchmark graphs, we illustrate that the generated code performs close to the state-of-the-art hand-tuned implementations.

Kernelization complexity of possible winner and coalitional manipulation problems in voting

In the POSSIBLE WINNER problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences to linear preferences. Previous work has provided, for many common voting rules, fixed parameter tractable algorithms for the POSSIBLE WINNER problem, with number of candidates as the parameter. However, the corresponding kernelization question is still open and in fact, has been mentioned as a key research challenge 10]. In this paper, we settle this open question for many common voting rules. We show that the POSSIBLE WINNER problem for maximin, Copeland, Bucklin, ranked pairs, and a class of scoring rules that includes the Borda voting rule does not admit a polynomial kernel with the number of candidates as the parameter. We show however that the COALITIONAL MANIPULATION problem which is an important special case of the POSSIBLE WINNER problem does admit a polynomial kernel for maximin, Copeland, ranked pairs, and a class of scoring rules that includes the Borda voting rule, when the number of manipulators is polynomial in the number of candidates. A significant conclusion of our work is that the POSSIBLE WINNER problem is harder than the COALITIONAL MANIPULATION problem since the COALITIONAL MANIPULATION problem admits a polynomial kernel whereas the POSSIBLE WINNER problem does not admit a polynomial kernel. (C) 2015 Elsevier B.V. All rights reserved.

Implementation of Art1 and Art2 Artificial Neural Networks on Ring and Mesh Architectures

The Artificial Neural Networks (ANNs) are being used to solve a variety of problems in pattern recognition, robotic control, VLSI CAD and other areas. In most of these applications, a speedy response from the ANNs is imperative. However, ANNs comprise a large number of artificial neurons, and a massive interconnection network among them. Hence, implementation of these ANNs involves execution of computer-intensive operations. The usage of multiprocessor systems therefore becomes necessary. In this article, we have presented the implementation of ART1 and ART2 ANNs on ring and mesh architectures. The overall system design and implementation aspects are presented. The performance of the algorithm on ring, 2-dimensional mesh and n-dimensional mesh topologies is presented. The parallel algorithm presented for implementation of ART1 is not specific to any particular architecture. The parallel algorithm for ARTE is more suitable for a ring architecture.

Generalized Query-By-Rule: a heterogeneous database query language

This paper describes the design and implementation of a high-level query language called Generalized Query-By-Rule (GQBR) which supports retrieval, insertion, deletion and update operations. This language, based on the formalism of database logic, enables the users to access each database in a distributed heterogeneous environment, without having to learn all the different data manipulation languages. The compiler has been implemented on a DEC 1090 system in Pascal.

ADAMIS: a database for medical information systems

This paper describes the design and implementation of ADAMIS (‘A database for medical information systems’). ADAMIS is a relational database management system for a general hospital environment. Apart from the usual database (DB) facilities of data definition and data manipulation, ADAMIS supports a query language called the ‘simplified medical query language’ (SMQL) which is completely end-user oriented and highly non-procedural. Other features of ADAMIS include provision of facilities for statistics collection and report generation. ADAMIS also provides adequate security and integrity features and has been designed mainly for use on interactive terminals.

Access path query language for relational database systems

Database management systems offer a very reliable and attractive data organization for fast and economical information storage and processing for diverse applications. It is much more important that the information should be easily accessible to users with varied backgrounds, professional as well as casual, through a suitable data sublanguage. The language adopted here (APPLE) is one such language for relational database systems and is completely nonprocedural and well suited to users with minimum or no programming background. This is supported by an access path model which permits the user to formulate completely nonprocedural queries expressed solely in terms of attribute names. The data description language (DDL) and data manipulation language (DML) features of APPLE are also discussed. The underlying relational database has been implemented with the help of the DATATRIEVE-11 utility for record and domain definition which is available on the PDP-11/35. The package is coded in Pascal and MACRO-11. Further, most of the limitations of the DATATRIEVE-11 utility have been eliminated in the interface package.

Implementation of an interactive relational graphics database

The benefits that accrue from the use of design database include (i) reduced costs of preparing data for application programs and of producing the final specification, and (ii) possibility of later usage of data stored in the database for other applications related to Computer Aided Engineering (CAE). An INTEractive Relational GRAphics Database (INTERGRAD) based on relational models has been developed to create, store, retrieve and update the data related to two dimensional drawings. INTERGRAD provides two languages, Picture Definition Language (PDL) and Picture Manipulation Language (PML). The software package has been implemented on a PDP 11/35 system under the RSX-11M version 3.1 operating system and uses the graphics facility consisting of a VT-11 graphics terminal, the DECgraphic 11 software and an input device, a lightpen.