Incentive compatible mechanisms for group ticket allocation in software maintenance services

A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or more engineers is generally taken by the lead, based on customer delivery deadlines and a guided complexity assessment from each maintenance engineer. The key challenge in such a scenario is two folds, un-truthful (hiked up) elicitation of ticket complexity by each engineer to the lead and the decision of allocating the ticket to a group of engineers who will solve the ticket with in customer deadline. The decision of allocation should ensure Individual and Coalitional Rationality along with Coalitional Stability. In this paper we use game theory to examine the issue of truthful elicitation of ticket complexities by engineers for solving ticket as a group given a specific customer delivery deadline. We formulate this problem as strategic form game and propose two mechanisms, (1) Division of Labor (DOL) and (2) Extended Second Price (ESP). In the proposed mechanisms we show that truth telling by each engineer constitutes a Dominant Strategy Nash Equilibrium of the underlying game. Also we analyze the existence of Individual Rationality (IR) and Coalitional Rationality (CR) properties to motivate voluntary and group participation. We use Core, solution concept from co-operative game theory to analyze the stability of the proposed group based on the allocation and payments.

A Case Study in Matching Service Descriptions to Implementations in an Existing System

A number of companies are trying to migrate large monolithic software systems to Service Oriented Architectures. A common approach to do this is to first identify and describe desired services (i.e., create a model), and then to locate portions of code within the existing system that implement the described services. In this paper we describe a detailed case study we undertook to match a model to an open-source business application. We describe the systematic methodology we used, the results of the exercise, as well as several observations that throw light on the nature of this problem. We also suggest and validate heuristics that are likely to be useful in partially automating the process of matching service descriptions to implementations.

Mining Unit Tests for Discovery and Migration of Math APIs

Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance. The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called MATHFINDER, combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version. We perform extensive evaluation of MATHFINDER (1) for API discovery, where math algorithms are to be implemented from scratch and (2) for API migration, where client programs utilizing a math API are to be migrated to another API. We evaluated the precision and recall of MATHFINDER on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using MATHFINDER for API discovery, the programmers who used MATHFINDER finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used MATHFINDER to migrate Weka, a popular machine learning library. Overall, our evaluation shows that MATHFINDER is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.

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 Survey Of Software Dependability

This paper presents on overview of the issues in precisely defining, specifying and evaluating the dependability of software, particularly in the context of computer controlled process systems. Dependability is intended to be a generic term embodying various quality factors and is useful for both software and hardware. While the developments in quality assurance and reliability theories have proceeded mostly in independent directions for hardware and software systems, we present here the case for developing a unified framework of dependability—a facet of operational effectiveness of modern technological systems, and develop a hierarchical systems model helpful in clarifying this view. In the second half of the paper, we survey the models and methods available for measuring and improving software reliability. The nature of software “bugs”, the failure history of the software system in the various phases of its lifecycle, the reliability growth in the development phase, estimation of the number of errors remaining in the operational phase, and the complexity of the debugging process have all been considered to varying degrees of detail. We also discuss the notion of software fault-tolerance, methods of achieving the same, and the status of other measures of software dependability such as maintainability, availability and safety.

Software simulation of the EEG

The literature contains many examples of digital procedures for the analytical treatment of electroencephalograms, but there is as yet no standard by which those techniques may be judged or compared. This paper proposes one method of generating an EEG, based on a computer program for Zetterberg's simulation. It is assumed that the statistical properties of an EEG may be represented by stationary processes having rational transfer functions and achieved by a system of software fillers and random number generators.The model represents neither the neurological mechanism response for generating the EEG, nor any particular type of EEG record; transient phenomena such as spikes, sharp waves and alpha bursts also are excluded. The basis of the program is a valid ‘partial’ statistical description of the EEG; that description is then used to produce a digital representation of a signal which if plotted sequentially, might or might not by chance resemble an EEG, that is unimportant. What is important is that the statistical properties of the series remain those of a real EEG; it is in this sense that the output is a simulation of the EEG. There is considerable flexibility in the form of the output, i.e. its alpha, beta and delta content, which may be selected by the user, the same selected parameters always producing the same statistical output. The filtered outputs from the random number sequences may be scaled to provide realistic power distributions in the accepted EEG frequency bands and then summed to create a digital output signal, the ‘stationary EEG’. It is suggested that the simulator might act as a test input to digital analytical techniques for the EEG, a simulator which would enable at least a substantial part of those techniques to be compared and assessed in an objective manner. The equations necessary to implement the model are given. The program has been run on a DEC1090 computer but is suitable for any microcomputer having more than 32 kBytes of memory; the execution time required to generate a 25 s simulated EEG is in the region of 15 s.

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

Performance reliability of high-maintenance systems

The time–history of the performance of a system is treated as a stochastic corrective process, in which deterioration due to aging is counteracted at brief maintenance checks. Using a diffusion approximation for the deterioration, simple models are proposed for describing maintenance either by component replacement or by performance restoration. Equilibrium solutions of the models show that the performance has a probability distribution with exponential tails: the uncritical use of Gaussians can grossly underestimate the probability of poor performance. The proposed models are supported by recent observational evidence on aircraft track-keeping errors, which are shown to follow the modified exponential distribution derived here. The analysis also brings out the relation between the deterioration characteristics of the system and the intensity of the maintenance effort required to achieve a given performance reliability.

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.

NUPARM and NUCGEN: software for analysis and generation of sequence dependent nucleic acid structures

Software packages NUPARM and NUCGEN, are described, which can be used to understand sequence directed structural variations in nucleic acids, by analysis and generation of non-uniform structures. A set of local inter basepair parameters (viz. tilt, roll, twist, shift, slide and rise) have been defined, which use geometry and coordinates of two successive basepairs only and can be used to generate polymeric structures with varying geometries for each of the 16 possible dinucleotide steps. Intra basepair parameters, propeller, buckle, opening and the C6...C8 distance can also be varied, if required, while the sugar phosphate backbone atoms are fixed in some standard conformation ill each of the nucleotides. NUPARM can be used to analyse both DNA and RNA structures, with single as well as double stranded helices. The NUCGEN software generates double helical models with the backbone fixed in B-form DNA, but with appropriate modifications in the input data, it can also generate A-form DNA ar rd RNA duplex structures.

Software Pipelined Execution of Stream Programs on GPUs

The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multi-core architectures. This model allows programmers to specify the structure of a program as a set of filters that act upon data, and a set of communication channels between them. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on modern Graphics Processing Units (GPUs), as they support abundant parallelism in hardware. In this paper, we describe the challenges in mapping StreamIt to GPUs and propose an efficient technique to software pipeline the execution of stream programs on GPUs. We formulate this problem - both scheduling and assignment of filters to processors - as an efficient Integer Linear Program (ILP), which is then solved using ILP solvers. We also describe a novel buffer layout technique for GPUs which facilitates exploiting the high memory bandwidth available in GPUs. The proposed scheduling utilizes both the scalar units in GPU, to exploit data parallelism, and multiprocessors, to exploit task and pipelin parallelism. Further it takes into consideration the synchronization and bandwidth limitations of GPUs, and yields speedups between 1.87X and 36.83X over a single threaded CPU.