Software Crash Study

With the development of personal computers, the user experience has become a vital part of every day work and life of the majority of people on the planet. Hardware components are usually preconfigured and most people tend not to tune them. However, the software environments change much more often because of the configuration by users, the upgrading by vendors and the attacks by hackers. All of those activities can be a factor in the stability of software. In this work, by analyzing a sample of 600,000 machine weeks and around 16,000 applications used on them, we try to derive the relationship between the software environment and the crashes of software. We mainly used association rule mining and analyzed our data on Spark. We also examined the predictability of crashes using the association rules and the difference of predictability between different versions of a same application

Flow induced dissolution of femtoliter surface droplet arrays

The dissolution of liquid nanodroplets is a crucial step in many applied processes, such as separation and dispersion in food industry, crystal formation of pharmaceutical products, concentrating and analysis in medical diagnosis, and drug delivery in aerosols. In this work, using both experiments and numerical simulations, we \textit{quantitatively} study the dissolution dynamics of femtoliter surface droplets in a highly ordered array under a uniform flow. Our results show that the dissolution of femoliter droplets strongly depends on their spatial positions relative to the flow direction, drop-to-drop spacing in the array, and the imposed flow rate. In some particular case, the droplet at the edge of the array can dissolve about 30% faster than the ones located near the centre. The dissolution rate of the droplet increases by 60% as the inter-droplet spacing is increased from 2.5 $\mu$m to 20 $\mu$m. Moreover, the droplets close to the front of flow commence to shrink earlier than those droplets in the center of the array. The average dissolution rate is faster for faster flow. As a result, the dissolution time $T_{i}$ decreases with the Reynolds number Re of the flow as $T_{i}\propto Re^{-3/4}$. The experimental results are in good agreement with numerical simulations where the advection-diffusion equation for the concentration field is solved and the concentration gradient on the surface of the drop is computed. The findings suggest potential approaches to manipulate nanodroplet sizes in droplet arrays simply by dissolution controlled by an external flow. The obtained droplets with varying curvatures may serve as templates for generating multifocal microlens in one array

PI: An open-source software package for validation of the SEQUEST result and visualization of mass spectrum

<p>Abstract</p> <p>Background</p> <p>Tandem mass spectrometry (MS/MS) has emerged as the leading method for high- throughput protein identification in proteomics. Recent technological breakthroughs have dramatically increased the efficiency of MS/MS data generation. Meanwhile, sophisticated algorithms have been developed for identifying proteins from peptide MS/MS data by searching available protein sequence databases for the peptide that is most likely to have produced the observed spectrum. The popular SEQUEST algorithm relies on the cross-correlation between the experimental mass spectrum and the theoretical spectrum of a peptide. It utilizes a simplified fragmentation model that assigns a fixed and identical intensity for all major ions and fixed and lower intensity for their neutral losses. In this way, the common issues involved in predicting theoretical spectra are circumvented. In practice, however, an experimental spectrum is usually not similar to its SEQUEST -predicted theoretical one, and as a result, incorrect identifications are often generated.</p> <p>Results</p> <p>Better understanding of peptide fragmentation is required to produce more accurate and sensitive peptide sequencing algorithms. Here, we designed the software PI of novel and exquisite algorithms that make a good use of intensity property of a spectrum.</p> <p>Conclusions</p> <p>We designed the software PI with the novel and effective algorithms which made a good use of intensity property of the spectrum. Experiments have shown that PI was able to validate and improve the results of SEQUEST to a more satisfactory degree.</p

Microstructural analysis of skeletal muscle force generation during aging.

Human aging results in a progressive decline in the active force generation capability of skeletal muscle. While many factors related to the changes of morphological and structural properties in muscle fibers and the extracellular matrix (ECM) have been considered as possible reasons for causing age-related force reduction, it is still not fully understood why the decrease in force generation under eccentric contraction (lengthening) is much less than that under concentric contraction (shortening). Biomechanically, it was observed that connective tissues (endomysium) stiffen as ages, and the volume ratio of connective tissues exhibits an age-related increase. However, limited skeletal muscle models take into account the microstructural characteristics as well as the volume fraction of tissue material. This study aims to provide a numerical investigation in which the muscle fibers and the ECM are explicitly represented to allow quantitative assessment of the age-related force reduction mechanism. To this end, a fiber-level honeycomb-like microstructure is constructed and modeled by a pixel-based Reproducing Kernel Particle Method (RKPM), which allows modeling of smooth transition in biomaterial properties across material interfaces. The numerical investigation reveals that the increased stiffness of the passive materials of muscle tissue reduces the force generation capability under concentric contraction while maintains the force generation capability under eccentric contraction. The proposed RKPM microscopic model provides effective means for the cellular-scale numerical investigation of skeletal muscle physiology. NOVELTY STATEMENT: A cellular-scale honeycomb-like microstructural muscle model constructed from a histological cross-sectional image of muscle is employed to study the causal relations between age-associated microstructural changes and age-related force loss using Reproducing Kernel Particle Method (RKPM). The employed RKPM offers an effective means for modeling biological materials based on pixel points in the medical images and allow modeling of smooth transition in the material properties across interfaces. The proposed microstructure-informed muscle model enables quantitative evaluation on how cellular-scale compositions contribute to muscle functionality and explain differences in age-related force changes during concentric, isometric and eccentric contractions

A MapReduce-based nearest neighbor approach for big-data-driven traffic flow prediction

In big-data-driven traffic flow prediction systems, the robustness of prediction performance depends on accuracy and timeliness. This paper presents a new MapReduce-based nearest neighbor (NN) approach for traffic flow prediction using correlation analysis (TFPC) on a Hadoop platform. In particular, we develop a real-time prediction system including two key modules, i.e., offline distributed training (ODT) and online parallel prediction (OPP). Moreover, we build a parallel k-nearest neighbor optimization classifier, which incorporates correlation information among traffic flows into the classification process. Finally, we propose a novel prediction calculation method, combining the current data observed in OPP and the classification results obtained from large-scale historical data in ODT, to generate traffic flow prediction in real time. The empirical study on real-world traffic flow big data using the leave-one-out cross validation method shows that TFPC significantly outperforms four state-of-the-art prediction approaches, i.e., autoregressive integrated moving average, Na&iuml;ve Bayes, multilayer perceptron neural networks, and NN regression, in terms of accuracy, which can be improved 90.07% in the best case, with an average mean absolute percent error of 5.53%. In addition, it displays excellent speedup, scaleup, and sizeup

An efficient MapReduce-based parallel clustering algorithm for distributed traffic subarea division

Traffic subarea division is vital for traffic system management and traffic network analysis in intelligent transportation systems (ITSs). Since existing methods may not be suitable for big traffic data processing, this paper presents a MapReduce-based Parallel Three-Phase K -Means (Par3PKM) algorithm for solving traffic subarea division problem on a widely adopted Hadoop distributed computing platform. Specifically, we first modify the distance metric and initialization strategy of K -Means and then employ a MapReduce paradigm to redesign the optimized K -Means algorithm for parallel clustering of large-scale taxi trajectories. Moreover, we propose a boundary identifying method to connect the borders of clustering results for each cluster. Finally, we divide traffic subarea of Beijing based on real-world trajectory data sets generated by 12,000 taxis in a period of one month using the proposed approach. Experimental evaluation results indicate that when compared with K -Means, Par2PK-Means, and ParCLARA, Par3PKM achieves higher efficiency, more accuracy, and better scalability and can effectively divide traffic subarea with big taxi trajectory data

An Accurate and Efficient Time Delay Estimation Method of Ultra-High Frequency Signals for Partial Discharge Localization in Substations

Partial discharge (PD) localization in substations based on the ultra-high frequency (UHF) method can be used to efficiently assess insulation conditions. Localization accuracy is affected by the accuracy of the time delay (TD) estimation, which is critical for PD localization in substations. A review of existing TD estimation methods indicates that there is a need to develop methods that are both accurate and computationally efficient. In this paper, a novel TD estimation method is proposed to improve both accuracy and efficiency. The TD is calculated using an improved cross-correlation algorithm based on full-wavefronts of array UHF signals, which are extracted using the minimum cumulative energy method and zero-crossing points searching methods. The cross-correlation algorithm effectively suppresses the TD error caused by differences between full-wavefronts. To verify the method, a simulated PD source test in a laboratory and a field test in a 220 kV substation were carried out. The results show that the proposed method is accurate even in case of low signal-to-noise ratio, but with greatly improved computational efficiency

The Devil is the Classifier: Investigating Long Tail Relation Classification with Decoupling Analysis

Long-tailed relation classification is a challenging problem as the head classes may dominate the training phase, thereby leading to the deterioration of the tail performance. Existing solutions usually address this issue via class-balancing strategies, e.g., data re-sampling and loss re-weighting, but all these methods adhere to the schema of entangling learning of the representation and classifier. In this study, we conduct an in-depth empirical investigation into the long-tailed problem and found that pre-trained models with instance-balanced sampling already capture the well-learned representations for all classes; moreover, it is possible to achieve better long-tailed classification ability at low cost by only adjusting the classifier. Inspired by this observation, we propose a robust classifier with attentive relation routing, which assigns soft weights by automatically aggregating the relations. Extensive experiments on two datasets demonstrate the effectiveness of our proposed approach. Code and datasets are available in https://github.com/zjunlp/deepke