GRDB: A general purpose relational database system

This article discusses the design and development of GRDB (General Purpose Relational Data Base System) which has been implemented on a DEC-1090 system in Pascal. GRDB is a general purpose database system designed to be completely independent of the nature of data to be handled, since it is not tailored to the specific requirements of any particular enterprise. It can handle different types of data such as variable length records and textual data. Apart from the usual database facilities such as data definition and data manipulation, GRDB supports User Definition Language (UDL) and Security definition language. These facilities are provided through a SEQUEL-like General Purpose Query Language (GQL). GRDB provides adequate protection facilities up to the relation level. The concept of “security matrix” has been made use of to provide database protection. The concept of Unique IDentification number (UID) and Password is made use of to ensure user identification and authentication. The concept of static integrity constraints has been used to ensure data integrity. Considerable efforts have been made to improve the response time through indexing on the data files and query optimisation. GRDB is designed for an interactive use but alternate provision has been made for its use through batch mode also. A typical Air Force application (consisting of data about personnel, inventory control, and maintenance planning) has been used to test GRDB and it has been found to perform satisfactorily.

Air-fleet and maintenance facility planning

This paper describes the use of simulation in the planning and operation of a small fleet of aircraft typical of the air force of a developing country. We consider a single flying base, where the opera tionally ready aircraft are stationed, and a repair depot, where the planes are overhauled. The measure of effectiveness used is "system availability, the percentage of airplanes that are usable. The system is modeled in GPSS as a cyclic queue process. The simulation model is used to perform sensitivity analyses and to validate the principal assumptions of the analytical model on which the simulation model is based.

Systems analysis for planning of air fleets and maintenance facilities

The high cost and extraordinary demands made on sophisticated air defence systems, pose hard challenges to the managers and engineers who plan the operation and maintenance of such systems. This paper presents a study aimed at developing simulation and systems analysis techniques for the effective planning and efficient operation of small fleets of aircraft, typical of the air force of a developing country. We consider an important aspect of fleet management: the problem of resource allocation for achieving prescribed operational effectiveness of the fleet. At this stage, we consider a single flying-base, where the operationally ready aircraft are stationed, and a repair-depot, where the planes are overhauled. An important measure of operational effectiveness is ‘ availability ’, which may be defined as the expected fraction of the fleet fit for use at a given instant. The tour of aircraft in a flying-base, repair-depot system through a cycle of ‘ operationally ready ’ and ‘ scheduled overhaul ’ phases is represented first by a deterministic flow process and then by a cyclic queuing process. Initially the steady-state availability at the flying-base is computed under the assumptions of Poisson arrivals, exponential service times and an equivalent singleserver repair-depot. This analysis also brings out the effect of fleet size on availability. It defines a ‘ small ’ fleet essentially in terms of the important ‘ traffic ’ parameter of service rate/maximum arrival rate.A simulation model of the system has been developed using GPSS to study sensitivity to distributional assumptions, to validate the principal assumptions of the analytical model such as the single-server assumption and to obtain confidence intervals for the statistical parameters of interest.

A queuing approach for inventory planning with batch ordering in multi-echelon supply chains

This paper presents stylized models for conducting performance analysis of the manufacturing supply chain network (SCN) in a stochastic setting for batch ordering. We use queueing models to capture the behavior of SCN. The analysis is clubbed with an inventory optimization model, which can be used for designing inventory policies . In the first case, we model one manufacturer with one warehouse, which supplies to various retailers. We determine the optimal inventory level at the warehouse that minimizes total expected cost of carrying inventory, back order cost associated with serving orders in the backlog queue, and ordering cost. In the second model we impose service level constraint in terms of fill rate (probability an order is filled from stock at warehouse), assuming that customers do not balk from the system. We present several numerical examples to illustrate the model and to illustrate its various features. In the third case, we extend the model to a three-echelon inventory model which explicitly considers the logistics process.

Singularity-free path planning for the Stewart platform manipulator

This paper addresses the problem of singularity-free path planning for the six-degree-of-freedom parallel manipulator known as the Stewart platform manipulator. Unlike serial manipulators, the Stewart platform possesses singular configurations within the workspace where the manipulator is uncontrollable. An algorithm has been developed to construct continuous paths within the workspace of the manipulator by avoiding singularities and ill-conditioning. Given two end-poses of the manipulator, the algorithm finds out safe (well-conditioned) via points and plans a continuous path from the initial pose to the final one. When the two end-poses belong to different branches and no singularity-free path is possible, the algorithm indicates the impossibility of a valid path. A numerical example has also been presented as illustration of the path planning strategy.

Telomere structure, replication and length maintenance

Telomeres are the termini of linear eukaryotic chromosomes consisting of tandem repeats of DNA and proteins that bind to these repeat sequences. Telomeres ensure the complete replication of chromosome ends, impart protection to ends from nucleolytic degradation, end-to-end fusion, and guide the localization of chromosomes within the nucleus. In addition, a combination of genetic, biochemical, and molecular biological approaches have implicated key roles for telomeres in diverse cellular processes such as regulation of gene expression, cell division, cell senescence, and cancer. This review focuses on recent advances in our understanding of the organization of telomeres, telomere replication, proteins that bind telomeric DNA, and the establishment of telomere length equilibrium.

Importance of amino-terminus in maintenance of oligomeric structure of cytosolic serine hydroxymethyltransferase

The role of the amino and carboxyl-terminal regions of cytosolic serine hydroxymethyltransferase (SHMT) in subunit assembly and catalysis was studied using six amino-terminal (lacking the first 6, 14, 30, 49, 58, and 75 residues) and two carboxyl-terminal (lacking the last 49 and 185 residues) deletion mutants. These mutants were constructed from a full length cDNA clone using restriction enzyme/PCR-based methods and overexpressed in Escherichia coli. The overexpressed proteins, des-(A1-K6)-SHMT and des-(A1- W14)-SHMT were present in the soluble fraction and they were purified to homogeneity. The deletion clones, for des-(A1–V30)-SHMT and des-(A1–L49)-SHMT were expressed at very low levels, whereas des-(A1–R58)-SHMT, des-(A1–G75)-SHMT, des-(Q435–F483)-SHMT and des-(L299-F483)-SHMT mutant proteins were not soluble and formed inclusion bodies. Des-(A1–K6)-SHMT and des-(A1–W14)-SHMT catalyzed both the tetrahydrofolate-dependent and tetrahydrofolate-independent reactions, generating characteristic spectral intermediates with glycine and tetrahydrofolate. The two mutants had similar kinetic parameters to that of the recombinant SHMT (rSHMT). However, at 55 °C, the des-(A1–W14)-SHMT lost almost all the activity within 5 min, while at the same temperature rSHMT and des-(A1–K6)-SHMT retained 85% and 70% activity, respectively. Thermal denaturation studies showed that des-(A1–W14)-SHMT had a lower apparent melting temperature (52°C) compared to rSHMT (56°C) and des-(A1–K6)-SHMT (55 °C), suggesting that N-terminal deletion had resulted in a decrease in the thermal stability of the enzyme. Further, urea induced inactivation of the enzymes revealed that 50% inactivation occurred at a lower urea concentration (1.2 ± 0.1 M) in the case of des-(A1–W14)-SHMT compared to rSHMT (1.8 ±0.1 M) and des-(A1–K6)-SHMT (1.7 ±0.1 M). The apoenzyme of des-(A1- W14)-SHMT was present predominantly in the dimer form, whereas the apoenzymes of rSHMT and des-(A1–K6)-SHMT were a mixture of tetramers (≈75% and ≈65%, respectively) and dimers. While, rSHMT and des-(A1–K6)-SHMT apoenzymes could be reconstituted upon the addition of pyridoxal-5'-phosphate to 96% and 94% enzyme activity, respectively, des-(A1–W14)-SHMT apoenzyme could be reconstituted only upto 22%. The percentage activity regained correlated with the appearance of visible CD at 425 nm and with the amount of enzyme present in the tetrameric form upon reconstitution as monitored by gel filtration. These results demonstrate that, in addition to the cofactor, the N-terminal arm plays an important role in stabilizing the tetrameric structure of SHMT.

Importance of the amino terminus in maintenance of oligomeric structure of sheep liver cytosolic serine hydroxymethyltransferase

The Role Of The Amino And Carboxyl-Terminal Regions Of Cytosolic Serine Hydroxymethyltransferase (SHMT) In Subunit Assembly And Catalysis Was Studied Using Sis Amino-Terminal (Lacking The First 6, 14, 30, 49, 58, And 75 Residues) And Two Carboxyl-Terminal (Lacking The Last 49 And 185 Residues) Deletion Mutants. These Mutants Were Constructed From A Full Length Cdna Clone Using Restriction Enzyme/PCR-Based Methods And Overexpressed In Escherichia Coli. The Overexpressed Proteins, Des-(A1-K6) SHMT And Des-(A1-W14)-SHMT Were Present In The Soluble Fraction And They Were Purified To Homogeneity. The Deletion Clones, For Des-(A1-V30)-SHMT And Des-(A1-L49)-SHMT Were Expressed At Very Low Levels, Whereas Des-(A1-R58)-SHMT, Des-/A1-G75)-SHMT, Des-(Q435-F483)-SHMT And Des-(L299-F483)-SHMT Mutant Proteins Were Not Soluble And Formed Inclusion Bodies. Des-(A1-K6)-SHMT And Des-(A1-W14)-SHMT Catalyzed Both The Tetrahydrofolate-Dependent And Tetrahydrofolate-Independent Reactions, Generating Characteristic Spectral Intermediates With Glycine And Tetrahydrofolate. The Two Mutants Had Similar Kinetic Parameters To That Of The Recombinant SHMT (Rshmt). However, At 55 Degrees C, The Des-(A1-W14)-SHMT Lost Almost All The Activity Within 5 Min, While At The Same Temperature Rshmt And Des-(A1-K6)-SHMT Retained 85% And 70% Activity, Respectively. Thermal Denaturation Studies Showed That Des-(A1-W14)-SHMT Had A Lower Apparent Melting Temperature (52 Degrees C) Compared To Rshmt (56 Degrees C) And Des-(A1-K6)-SHMT (55 Degrees C), Suggesting That N-Terminal Deletion Had Resulted In A Decrease In The Thermal Stability Of The Enzyme. Further Urea Induced Inactivation Of The Enzymes Revealed That 50% Inactivation Occurred At A Lower Urea Concentration (1.2+/-0.1 M) In The Case Of Des-(A1-W14)-SHMT Compared To Rshmt (1.8+/-0.1 M) And Des-(A1 -K6)-SHMT (1.7+/-0.1 M). The Apoenzyme Of Des-/A1-K6)-SHMT Was Present Predominantly In The Dimer Form, Whereas The Apoenzymes Of Rshmt And Des-(A1-K6)-SHMT Were A Mixture Of Tetramers (Approximate To 75% And Approximate To 65%, Respectively) And Dimers. While, Rshmt And Des-(A1-K6)-SHMT Apoenzymes Could Be Reconstituted Upon The Addition Of Pyridoxal-5'-Phosphate To 96% And 94% Enzyme Activity, Respectively Des-(A1-W14)-SHMT Apoenzyme Could Be Reconstituted Only Upto 22%. The Percentage Activity Refined Correlated With The Appearance Of Visible CD At 425 Nm And With The Amount Of Enzyme Present In The Tetrameric Form Upon Reconstitution As Monitored By Gel Filtration. These Results Demonstrate That, In Addition To The Cofactor, The N-Terminal Arm Plays An Important Role In Stabilizing The Tetrameric Structure Of SHMT.

A Jacobian-Based Algorithm for Planning Attitude Maneuvers Using Forward and Reverse Rotations

Algorithms for planning quasistatic attitude maneuvers based on the Jacobian of the forward kinematic mapping of fully-reversed (FR) sequences of rotations are proposed in this paper. An FR sequence of rotations is a series of finite rotations that consists of initial rotations about the axes of a body-fixed coordinate frame and subsequent rotations that undo these initial rotations. Unlike the Jacobian of conventional systems such as a robot manipulator, the Jacobian of the system manipulated through FR rotations is a null matrix at the identity, which leads to a total breakdown of the traditional Jacobian formulation. Therefore, the Jacobian algorithm is reformulated and implemented so as to synthesize an FR sequence for a desired rotational displacement. The Jacobian-based algorithm presented in this paper identifies particular six-rotation FR sequences that synthesize desired orientations. We developed the single-step and the multiple-step Jacobian methods to accomplish a given task using six-rotation FR sequences. The single-step Jacobian method identifies a specific FR sequence for a given desired orientation and the multiple-step Jacobian algorithm synthesizes physically feasible FR rotations on an optimal path. A comparison with existing algorithms verifies the fast convergence ability of the Jacobian-based algorithm. Unlike closed-form solutions to the inverse kinematics problem, the Jacobian-based algorithm determines the most efficient FR sequence that yields a desired rotational displacement through a simple and inexpensive numerical calculation. The procedure presented here is useful for those motion planning problems wherein the Jacobian is singular or null.

Multiobjective Analysis of Irrigation Planning in River Basin Development

A river basin that is extensively developed in the downstream reaches and that has a high potential for development in the upper reaches is considered for irrigation planning. A four-reservoir system is modeled on a monthly basis by using a mathematical programing (LP) formulation to find optimum cropping patterns, subject to land, water, and downstream release constraints. The model is applied to a fiver basin in India. Two objectives, maximizing net economic benefits and maximizing irrigated cropped area, considered in the model are analyzed in the context of multiobjective planning, and the tradeoffs are discussed.

Optimal irrigation planning in river basin development: The case of the Upper Cauvery river basin

The study deals with the irrigation planning of the Cauvery river basin in peninsular India which is extensively developed in the downstream reaches and has a high potential for development in the upper reaches. A four-reservoir system is modelled on a monthly basis by using a mathematical programming (LP) formulation to find optimum cropping patterns, subject to land, water and downstream release constraints, and applied to the Cauvery basin. Two objectives, maximizing net economic benefits and maximizing irrigated cropped area, considered in the model are analysed in the context of multiobjective planning and the trade-offs discussed.

Ant colony optimization for reporting cell planning in mobile computing using selective paging strategy

Location management problem that arise in mobile computing networks is addressed. One method used in location management is to designate sonic of the cells in the network as "reporting cells". The other cells in the network are "non-reporting cells". Finding an optimal set of reporting cells (or reporting cell configuration) for a given network. is a difficult combinatorial optimization problem. In fact this is shown to be an NP-complete problem. in an earlier study. In this paper, we use the selective paging strategy and use an ant colony optimization method to obtain the best/optimal set of reporting cells for a given a network.

Optimal maintenance and replacement via a semi-Markov decision model

Optimal bang-coast maintenance policies for a machine, subject to failure, are considered. The approach utilizes a semi-Markov model for the system. A simplified model for modifying the probability of machine failure with maintenance is employed. A numerical example is presented to illustrate the procedure and results.

Optimal maintenance policy for equipment subject to random deterioration and random failure A modern control theory approach.

The stochastic version of Pontryagin's maximum principle is applied to determine an optimal maintenance policy of equipment subject to random deterioration. The deterioration of the equipment with age is modelled as a random process. Next the model is generalized to include random catastrophic failure of the equipment. The optimal maintenance policy is derived for two special probability distributions of time to failure of the equipment, namely, exponential and Weibull distributions Both the salvage value and deterioration rate of the equipment are treated as state variables and the maintenance as a control variable. The result is illustrated by an example

A Modified Dubins Method for Optimal Path Planning of a Miniature Air Vehicle Converging to a Straight Line Path

This paper presents a Dubins model based strategy to determine the optimal path of a Miniature Air Vehicle (MAV), constrained by a bounded turning rate, that would enable it to fly along a given straight line, starting from an arbitrary initial position and orientation. The method is then extended to meet the same objective in the presence of wind which has a magnitude comparable to the speed of the MAV. We use a modification of the Dubins' path method to obtain the complete optimal solution to this problem in all its generality.