8,323 research outputs found

    Cleanroom software development

    Get PDF
    The 'cleanroom' software development process is a technical and organizational approach to developing software with certifiable reliability. Key ideas behind the process are well structured software specifications, randomized testing methods and the introduction of statistical controls; but the main point is to deny entry for defects during the development of software. This latter point suggests the use of the term 'cleanroom' in analogy to the defect prevention controls used in the manufacturing of high technology hardware. In the 'cleanroom', the entire software development process is embedded within a formal statistical design, in contrast to executing selected tests and appealing to the randomness of operational settings for drawing statistical inferences. Instead, random testing is introduced as a part of the statistical design itself so that when development and testing are completed, statistical inferences are made about the operation of the system

    Counting Perfect Matchings and the Switch Chain

    Get PDF
    We examine the problem of exactly or approximately counting all perfect matchings in hereditary classes of nonbipartite graphs. In particular, we consider the switch Markov chain of Diaconis, Graham, and Holmes. We determine the largest hereditary class for which the chain is ergodic, and define a large new hereditary class of graphs for which it is rapidly mixing. We go on to show that the chain has exponential mixing time for a slightly larger class. We also examine the question of ergodicity of the switch chain in an arbitrary graph. Finally, we give exact counting algorithms for three classes

    Counting Independent Sets in Cocomparability Graphs

    Get PDF
    We show that the number of independent sets in cocomparability graphs can be counted in linear time, as can counting cliques in comparability graphs. By contrast, counting cliques in cocomparability graphs and counting independent sets in comparability graphs are #P-complete. We extend these results to counting maximal cliques and independent sets. We also consider the fixed-parameter versions of counting cliques and independent sets of given size k. Finally, we combine the results to show that both counting cliques and independent sets in permutation graphs are in linear time

    The analysis and forecasting of male cycling time trial records established within England and Wales.

    Get PDF
    The format of cycling time trials in England, Wales and Northern Ireland, involves riders competing individually over several fixed race distances of 10-100 miles in length and using time constrained formats of 12 and 24 h in duration. Drawing on data provided by the national governing body that covers the regions of England and Wales, an analysis of six male competition record progressions was undertaken to illustrate its progression. Future forecasts are then projected through use of the Singular Spectrum Analysis technique. This method has not been applied to sport-based time series data before. All six records have seen a progressive improvement and are non-linear in nature. Five records saw their highest level of record change during the 1950-1969 period. Whilst new record frequency generally has reduced since this period, the magnitude of performance improvement has generally increased. The Singular Spectrum Analysis technique successfully provided forecasted projections in the short to medium term with a high level of fit to the time series data

    Pmp27 Promotes Peroxisomal Proliferation

    Get PDF
    Peroxisomes perform many essential functions in eukaryotic cells. The weight of evidence indicates that these organelles divide by budding from preexisting peroxisomes. This process is not understood at the molecular level. Peroxisomal proliferation can be induced in Saccharomyces cerevisiae by oleate. This growth substrate is metabolized by peroxisomal enzymes. We have identified a protein, Pmp27, that promotes peroxisomal proliferation. This protein, previously termed Pmp24, was purified from peroxisomal membranes, and the corresponding gene, PMP27, was isolated and sequenced. Prop27 shares sequence similarity with the Pmp30 family in Candida boidinii. Pmp27 is a hydrophobic peroxisomal membrane protein but it can be extracted by high pH, suggesting that it does not fully span the bilayer. Its expression is regulated by oleate. The function of Pmp27 was probed by observing the phenotype of strains in which the protein was eliminated by gene disruption or overproduced by expression from a multicopy plasmid. The strain containing the disruption (3B) was able to grow on all carbon sources tested, including oleate, although growth on oleate, glycerol, and acetate was slower than wild type. Strain 3B contained peroxisomes with all of the enzymes of β-oxidation. However, in addition to the presence of a few modestly sized peroxisomes seen in a typical thin section of a cell growing on oleate-containing medium, cells of strain 3B also contained one or two very large peroxisomes. In contrast, cells in a strain in which Pmp27 was overexpressed contained an increased number of normal-sized peroxisomes. We suggest that Pmp27 promotes peroxisomal proliferation by participating in peroxisomal elongation or fission.

    Analysis of Absorbing Times of Quantum Walks

    Full text link
    Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time.Comment: LaTeX2e, 14 pages, 6 figures, 1 table, figures revised, references added, to appear in Physical Review
    corecore