159 research outputs found

    Protecting Memories against Soft Errors: The Case for Customizable Error Correction Codes

    Get PDF
    As technology scales, radiation induced soft errors create more complex error patterns in memories with a single particle corrupting several bits. This poses a challenge to the Error Correction Codes (ECCs) traditionally used to protect memories that can correct only single bit errors. During the last decade, a number of codes have been developed to correct the emerging error patterns, focusing initially on double adjacent errors and later on three bit burst errors. However, as the memory cells get smaller and smaller, the error patterns created by radiation will continue to change and thus new codes will be needed. In addition, the memory layout and the technology used may also make some patterns more likely than others. For example, in some memories, there maybe elements that separate blocks of bits in a word, making errors that affect two blocks less likely. Finally, for a given memory, depending on the data stored, some error patterns may be more critical than others. For example, if numbers are stored in the memory, in most cases, errors on the more significant bits have a larger impact. Therefore, for a given memory and application, to achieve optimal protection, we would like to have a code that corrects a given set of patterns. This is not possible today as there is a limited number of code choices available in terms of correctable error patterns and word lengths. However, most of the codes used to protect memories are linear block codes that have a regular structure and which design can be automated. In this paper, we propose the automation of error correction code design for memory protection. To that end, we introduce a software tool that given a word length and the error patterns that need to be corrected, produces a linear block code described by its parity check matrix and also the bit placement. The benefits of this automated design approach are illustrated with several case studies. Finally, the tool is made available so that designers can easily produce custom error correction codes for their specific needs.Jiaqiang Li and Liyi Xiao would like to acknowledge the support of the Fundamental Research Funds for the Central Universities (Grant No. HIT.KISTP.201404), Harbin science and innovation research special fund (2015RAXXJ003), and Special found for development of Shenzhen strategic emerging industries (JCYJ20150625142543456). Pedro Reviriego would like to acknowledge the support of the TEXEO project TEC2016-80339-R funded by the Spanish Ministry of Economy and Competitivity and of the Madrid Community research project TAPIR-CM Grant No. P2018/TCS-4496

    Measurement of solid–liquid mixing quality by using a uniform design method based on image analysis

    Get PDF
    Solid–liquid mixing has been a common industrial process operation. The measurement of solid–liquid mixing quality can help improve the efficiency of related industrial processes, but there is still a lack of an intuitive, accurate, and simple measurement method. As an important indicator to evaluate the solid–liquid mixing quality, the degree of solid suspension and the uniformity of solid distribution are directly related to mass transfer and reaction efficiency. Therefore, it is necessary to study the solid suspension and distribution in a solid–liquid system. In this work, the solid suspension and distribution of a solid–liquid system composed of glass beads–water stirred by the impeller are studied experimentally via digital image processing combined with statistical analysis. Specifically, images of solid–liquid mixing are first obtained using a camera and digitally processed. The area ratio of the solid in the image is proposed to reflect the degree of solid suspension, and the modified L2-star discrepancy (MD) is then used to quantify the uniformity of the solid distribution. Then, the solid–liquid mixing quality can be characterized by combining the area ratio and solid distribution. The feasibility of this method was proved by qualitative analysis of the solid–liquid mixing state and comparison with known studies. In addition, the effects of various stirring factors on the solid distribution were studied and discussed by using the proposed method. The results show that the method proposed in this paper can measure the quality of the solid–liquid mixing state more directly and is effective and accurate. Furthermore, it was used to find the best experimental parameters in this work. This method is also simpler and cheaper than many other methods. It is of great significance to improve the efficiency of chemical and metallurgical and other industrial processes

    A Study of Pulsation properties of 57 Non-Blazhko effect ab-type RR Lyrae stars with homogeneous metallicities from the LAMOST-Kepler/K2 survey

    Full text link
    Homogeneous metallicities and continuous high-precision light curves play key roles in studying the pulsation properties of RR Lyrae stars. By cross-matching with LAMOST DR6, we have determined 7 and 50 Non-Blazhko RRab stars in the Kepler and K2 fields, respectively, who have homogeneous metallicities determined from low-resolution spectra of the LAMOST-Kepler/K2 project. The Fourier Decomposition method is applied to the light curves of these stars provided by the Kepler space based telescope to determine the fundamental pulsation periods and the pulsation parameters. The calculated amplitude ratios of R21, R31 and the phase differences of {\phi}21, {\phi}31 are consistent with the parameters of the RRab stars in both the Globular Clusters and the Large Magellanic Cloud. We find a linear relationship between the phase differences {\phi}21 and {\phi}31, which is in good agreement with the results in previous literature. As far as the amplitude, we find that the amplitude of primary frequency A1 and the total amplitude Atot follow either a cubic or linear relationship. For the rise time RT, we do not find its relevance with the period of the fundamental pulsation mode P1, or Atot and {\phi}21. However, it might follow a linear relationship with R31. Based on the homogeneous metallicities, we have derived a new calibration formula for the relationship of period-{\phi}31-[Fe/H], which agrees well with the previous studies

    Traffic-Aware Multi-Camera Tracking of Vehicles Based on ReID and Camera Link Model

    Full text link
    Multi-target multi-camera tracking (MTMCT), i.e., tracking multiple targets across multiple cameras, is a crucial technique for smart city applications. In this paper, we propose an effective and reliable MTMCT framework for vehicles, which consists of a traffic-aware single camera tracking (TSCT) algorithm, a trajectory-based camera link model (CLM) for vehicle re-identification (ReID), and a hierarchical clustering algorithm to obtain the cross camera vehicle trajectories. First, the TSCT, which jointly considers vehicle appearance, geometric features, and some common traffic scenarios, is proposed to track the vehicles in each camera separately. Second, the trajectory-based CLM is adopted to facilitate the relationship between each pair of adjacently connected cameras and add spatio-temporal constraints for the subsequent vehicle ReID with temporal attention. Third, the hierarchical clustering algorithm is used to merge the vehicle trajectories among all the cameras to obtain the final MTMCT results. Our proposed MTMCT is evaluated on the CityFlow dataset and achieves a new state-of-the-art performance with IDF1 of 74.93%.Comment: Accepted by ACM International Conference on Multimedia 202

    An Efficient ZK Compiler from SIMD Circuits to General Circuits

    Get PDF
    We propose a generic compiler that can convert any zero-knowledge proof for SIMD circuits to general circuits efficiently, and an extension that can preserve the space complexity of the proof systems. Our compiler can immediately produce new results improving upon state of the art. -By plugging in our compiler to Antman, an interactive sublinear-communication protocol, we improve the overall communication complexity for generalcircuits from O(C3/4)\mathcal{O}(C^{3/4}) to O(C1/2)\mathcal{O}(C^{1/2}). Our implementation shows that for a circuit of size 2272^{27}, it achieves up to 83.6Ă—83.6\times improvement on communication compared to the state-of-the-art implementation. Its end-to-end running time is at least 70%70\% faster in a 1010Mbps network. -Using recent results on compressed ÎŁ\Sigma-protocol theory, we obtain a discrete-log-based constant-round zero-knowledge argument with O(C1/2)\mathcal{O}(C^{1/2}) communication and common random string length, improving over the state of the art that has linear-size common random string and requires heavier computation. -We improve the communication of a designated nn-verifier zero-knowledge proof from O(nC/B+n2B2)\mathcal{O}(nC/B+n^2B^2) to O(nC/B+n2)\mathcal{O}(nC/B+n^2). To demonstrate the scalability of our compilers, we were able to extract a commit-and-prove SIMD ZK from Ligero and cast it in our framework. We also give one instantiation derived from LegoSNARK, demonstrating that the idea of CP-SNARK also fits in our methodology
    • …
    corecore