35 resultados para Testes de software
em Indian Institute of Science - Bangalore - Índia
Resumo:
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.
Resumo:
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.
Resumo:
The relative concentrations of the major histones, namely, H1, TH1, H2A, H2B, H3 and H4 are not significantly changed in the testes of the vitamin A-deficient rats, as compared to those in the normal controls. But the testis-specific protein, TP, which is synthesized at the mid-spermatid stage, is markedly reduced in the testes of the deficient rats. On supplementation of the deficient rats with retinyl acetate for 28 days, there was a 50% recovery in the relative concentration of the TP with respect to the total amounts of H1 and TH1.
Resumo:
The cholesterol side-chain cleavage enzyme activity is decreased considerably at the mild stage of vitamin A deficiency in rat testes and ovaries and the decrease in activity becomes more pronounced with progress of deficiency. Supplementation of the deficient rats with retinyl acetate, but not retinoic acid, restores the enzyme activity to normal values. The cholesterol side-chain cleavage enzyme of adrenals is not affected by any of the above treatments.
Resumo:
Histones H1a and H1t are two major linker histone variants present at the pachytene interval of mammalian spermatogenesis. The DNA- and chromatin-condensing properties of these two variants isolated from rat testes were studied and compared with those from rat liver. For this purpose, the histone H1 subtypes were purified from the respective tissues using bath acid and salt extraction procedures, Circular dichroism studies revealed that acid exposure during isolation affects the alpha-helical structure of both the globular domain (in the presence of 1 M NaCl) and the C-terminal lambda-tail (in the presence of 60% trifluoroethanol). The condensation of rat oligonucleosomal DNA, as measured by circular dichroism spectroscopy, by the salt-extracted histone H1 was at least 10 times more efficient than condensation by the acid-extracted histone H1. A site size of 16-20 base pairs was calculated for the salt-extracted histone H1. Among the different histone H1 subtypes, somatic histone H1bdec had the highest DNA-condensing property, followed by histone H1a and histone H1t. All the salt-extracted histones condensed rat oligonucleosomal DNA more efficiently than linear pBR-322 DNA, Histones H1bdec and H1a condensed histone H1-depleted chromatin, prepared from rat liver nuclei, with relatively equal efficiency. On the other hand, there was no condensation of histone H1-depleted chromatin with the testes specific histone H1t. A comparison of the amino acid sequences of histone H1d (rat) and histone H1t (rat) revealed several interesting differences in the occurrence of DNA-binding motifs at the C-terminus. A striking observation is the presence of a direct repeat of an octapeptide motif K(A)T(S)PKKA(S)K(T)K(A) in histone H1d that is absent in histone H1t.
Resumo:
Histones H1a and H1t are two major linker histone variants present at the pachytene interval of mammalian spermatogenesis. The DNA- and chromatin-condensing properties of these two variants isolated from rat testes were studied and compared with those from rat liver. For this purpose, the histone H1 subtypes were purified from the respective tissues using bath acid and salt extraction procedures, Circular dichroism studies revealed that acid exposure during isolation affects the alpha-helical structure of both the globular domain (in the presence of 1 M NaCl) and the C-terminal lambda-tail (in the presence of 60% trifluoroethanol). The condensation of rat oligonucleosomal DNA, as measured by circular dichroism spectroscopy, by the salt-extracted histone H1 was at least 10 times more efficient than condensation by the acid-extracted histone H1. A site size of 16-20 base pairs was calculated for the salt-extracted histone H1. Among the different histone H1 subtypes, somatic histone H1bdec had the highest DNA-condensing property, followed by histone H1a and histone H1t. All the salt-extracted histones condensed rat oligonucleosomal DNA more efficiently than linear pBR-322 DNA, Histones H1bdec and H1a condensed histone H1-depleted chromatin, prepared from rat liver nuclei, with relatively equal efficiency. On the other hand, there was no condensation of histone H1-depleted chromatin with the testes specific histone H1t. A comparison of the amino acid sequences of histone H1d (rat) and histone H1t (rat) revealed several interesting differences in the occurrence of DNA-binding motifs at the C-terminus. A striking observation is the presence of a direct repeat of an octapeptide motif K(A)T(S)PKKA(S)K(T)K(A) in histone H1d that is absent in histone H1t.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
Automatic identification of software faults has enormous practical significance. This requires characterizing program execution behavior and the use of appropriate data mining techniques on the chosen representation. In this paper, we use the sequence of system calls to characterize program execution. The data mining tasks addressed are learning to map system call streams to fault labels and automatic identification of fault causes. Spectrum kernels and SVM are used for the former while latent semantic analysis is used for the latter The techniques are demonstrated for the intrusion dataset containing system call traces. The results show that kernel techniques are as accurate as the best available results but are faster by orders of magnitude. We also show that latent semantic indexing is capable of revealing fault-specific features.
Resumo:
CDS/ISIS is an advanced non-numerical information storage and retrieval software developed by UNESCO since 1985 to satisfy the need expressed by many institutions, especially in developing countries, to be able to streamline their information processing activities by using modern (and relatively inexpensive) technologies [1]. CDS/ISIS is available for MS-DOS, Windows and Unix operating system platforms. The formatting language of CDS/ISIS is one of its several strengths. It is not only used for formatting records for display but is also used for creating customized indexes. CDS/ISIS by itself does not facilitate in publishing its databases on the Internet nor does it facilitate in publishing on CD-ROMs. However, numbers of open source tools are now available, which enables in publishing CDS/ISIS databases on the Internet and also on CD-ROMs. In this paper, we have discussed the ways and means of integrating CDS/ISIS databases with GSDL, an open source digital library (DL) software.
Resumo:
Building flexible constraint length Viterbi decoders requires us to be able to realize de Bruijn networks of various sizes on the physically provided interconnection network. This paper considers the case when the physical network is itself a de Bruijn network and presents a scalable technique for realizing any n-node de Bruijn network on an N-node de Bruijn network, where n < N. The technique ensures that the length of the longest path realized on the network is minimized and that each physical connection is utilized to send only one data item, both of which are desirable in order to reduce the hardware complexity of the network and to obtain the best possible performance.
Resumo:
The Java Memory Model (JMM) provides a semantics of Java multithreading for any implementation platform. The JMM is defined in a declarative fashion with an allowed program execution being defined in terms of existence of "commit sequences" (roughly, the order in which actions in the execution are committed). In this work, we develop OpMM, an operational under-approximation of the JMM. The immediate motivation of this work lies in integrating a formal specification of the JMM with software model checkers. We show how our operational memory model description can be integrated into a Java Path Finder (JPF) style model checker for Java programs.