243 research outputs found

    L’américanité du roman québécois

    Get PDF

    Pulsed plasmoid electric propulsion

    Get PDF
    A method of electric propulsion is explored where plasmoids such as spheromaks and field reversed configurations (FRC) are formed and then allowed to expand down a diverging conducting shell. The plasmoids contain a toroidal electric current that provides both heating and a confining magnetic field. They are free to translate because there are no externally supplied magnetic fields that would restrict motion. Image currents in the diverging conducting shell keep the plasmoids from contacting the wall. Because these currents translate relative to the wall, losses due to magnetic flux diffusion into the wall are minimized. During the expansion of the plasma in the diverging cone, both the inductive and thermal plasma energy are converted to directed kinetic energy producing thrust. Specific impulses can be in the 4000 to 20000 sec range with thrusts from 0.1 to 1000 Newtons, depending on available power

    Read or improv

    Get PDF

    Constrained Dynamic Programming and Supervised Penalty Learning Algorithms for Peak Detection in Genomic Data

    Get PDF
    Peak detection in genomic data involves segmenting counts of DNA sequence reads aligned to different locations of a chromosome. The goal is to detect peaks with higher counts, and filter out background noise with lower counts. Most existing algorithms for this problem are unsupervised heuristics tailored to patterns in specific data types. We propose a supervised framework for this problem, using optimal changepoint detection models with learned penalty functions. We propose the first dynamic programming algorithm that is guaranteed to compute the optimal solution to changepoint detection problems with constraints between adjacent segment mean parameters. Implementing this algorithm requires the choice of penalty parameter that determines the number of segments that are estimated. We show how the supervised learning ideas of Rigaill et al. (2013) can be used to choose this penalty. We compare the resulting implementation of our algorithm to several baselines in a benchmark of labeled ChIP-seq data sets with two dierent patterns (broad H3K36me3 data and sharp H3K4me3 data). Whereas baseline unsupervised methods only provide accurate peak detection for a single pattern, our supervised method achieves state-of-the-art accuracy in all data sets. The log-linear timings of our proposed dynamic programming algorithm make it scalable to the large genomic data sets that are now common. Our implementation is available in the PeakSegOptimal R package on CRAN

    Generalized Functional Pruning Optimal Partitioning (GFPOP) for Constrained Changepoint Detection in Genomic Data

    Get PDF
    We describe a new algorithm and R package for peak detection in genomic data sets using constrained changepoint algorithms. These detect changes from background to peak regions by imposing the constraint that the mean should alternately increase then decrease. An existing algorithm for this problem exists, and gives state-of-the-art accuracy results, but it is computationally expensive when the number of changes is large. We propose the GFPOP algorithm that jointly estimates the number of peaks and their locations by minimizing a cost function which consists of a data fitting term and a penalty for each changepoint. Empirically this algorithm has a cost that is O(Nlog(N))O(N \log(N)) for analysing data of length NN. We also propose a sequential search algorithm that finds the best solution with KK segments in O(log(K)Nlog(N))O(\log(K)N \log(N)) time, which is much faster than the previous O(KNlog(N))O(KN \log(N)) algorithm. We show that our disk-based implementation in the PeakSegDisk R package can be used to quickly compute constrained optimal models with many changepoints, which are needed to analyze typical genomic data sets that have tens of millions of observations

    Usage of NASA's Near Real-Time Solar and Meteorological Data for Monitoring Building Energy Systems Using RETScreen International's Performance Analysis Module

    Get PDF
    This paper describes building energy system production and usage monitoring using examples from the new RETScreen Performance Analysis Module, called RETScreen Plus. The module uses daily meteorological (i.e., temperature, humidity, wind and solar, etc.) over a period of time to derive a building system function that is used to monitor building performance. The new module can also be used to target building systems with enhanced technologies. If daily ambient meteorological and solar information are not available, these are obtained over the internet from NASA's near-term data products that provide global meteorological and solar information within 3-6 days of real-time. The accuracy of the NASA data are shown to be excellent for this purpose enabling RETScreen Plus to easily detect changes in the system function and efficiency. This is shown by several examples, one of which is a new building at the NASA Langley Research Center that uses solar panels to provide electrical energy for building energy and excess energy for other uses. The system shows steady performance within the uncertainties of the input data. The other example involves assessing the reduction in energy usage by an apartment building in Sweden before and after an energy efficiency upgrade. In this case, savings up to 16% are shown
    corecore