15,416 research outputs found

    Towards Fast and Scalable Private Inference

    Full text link
    Privacy and security have rapidly emerged as first order design constraints. Users now demand more protection over who can see their data (confidentiality) as well as how it is used (control). Here, existing cryptographic techniques for security fall short: they secure data when stored or communicated but must decrypt it for computation. Fortunately, a new paradigm of computing exists, which we refer to as privacy-preserving computation (PPC). Emerging PPC technologies can be leveraged for secure outsourced computation or to enable two parties to compute without revealing either users' secret data. Despite their phenomenal potential to revolutionize user protection in the digital age, the realization has been limited due to exorbitant computational, communication, and storage overheads. This paper reviews recent efforts on addressing various PPC overheads using private inference (PI) in neural network as a motivating application. First, the problem and various technologies, including homomorphic encryption (HE), secret sharing (SS), garbled circuits (GCs), and oblivious transfer (OT), are introduced. Next, a characterization of their overheads when used to implement PI is covered. The characterization motivates the need for both GCs and HE accelerators. Then two solutions are presented: HAAC for accelerating GCs and RPU for accelerating HE. To conclude, results and effects are shown with a discussion on what future work is needed to overcome the remaining overheads of PI.Comment: Appear in the 20th ACM International Conference on Computing Frontier

    Compositional Probabilistic Model Checking with String Diagrams of MDPs

    Full text link
    We present a compositional model checking algorithm for Markov decision processes, in which they are composed in the categorical graphical language of string diagrams. The algorithm computes optimal expected rewards. Our theoretical development of the algorithm is supported by category theory, while what we call decomposition equalities for expected rewards act as a key enabler. Experimental evaluation demonstrates its performance advantages.Comment: 32 pages, Extended version of a paper in CAV 202

    Meso-scale FDM material layout design strategies under manufacturability constraints and fracture conditions

    Get PDF
    In the manufacturability-driven design (MDD) perspective, manufacturability of the product or system is the most important of the design requirements. In addition to being able to ensure that complex designs (e.g., topology optimization) are manufacturable with a given process or process family, MDD also helps mechanical designers to take advantage of unique process-material effects generated during manufacturing. One of the most recognizable examples of this comes from the scanning-type family of additive manufacturing (AM) processes; the most notable and familiar member of this family is the fused deposition modeling (FDM) or fused filament fabrication (FFF) process. This process works by selectively depositing uniform, approximately isotropic beads or elements of molten thermoplastic material (typically structural engineering plastics) in a series of pre-specified traces to build each layer of the part. There are many interesting 2-D and 3-D mechanical design problems that can be explored by designing the layout of these elements. The resulting structured, hierarchical material (which is both manufacturable and customized layer-by-layer within the limits of the process and material) can be defined as a manufacturing process-driven structured material (MPDSM). This dissertation explores several practical methods for designing these element layouts for 2-D and 3-D meso-scale mechanical problems, focusing ultimately on design-for-fracture. Three different fracture conditions are explored: (1) cases where a crack must be prevented or stopped, (2) cases where the crack must be encouraged or accelerated, and (3) cases where cracks must grow in a simple pre-determined pattern. Several new design tools, including a mapping method for the FDM manufacturability constraints, three major literature reviews, the collection, organization, and analysis of several large (qualitative and quantitative) multi-scale datasets on the fracture behavior of FDM-processed materials, some new experimental equipment, and the refinement of a fast and simple g-code generator based on commercially-available software, were developed and refined to support the design of MPDSMs under fracture conditions. The refined design method and rules were experimentally validated using a series of case studies (involving both design and physical testing of the designs) at the end of the dissertation. Finally, a simple design guide for practicing engineers who are not experts in advanced solid mechanics nor process-tailored materials was developed from the results of this project.U of I OnlyAuthor's request

    Topological Characterization of Consensus Solvability in Directed Dynamic Networks

    Full text link
    Consensus is one of the most fundamental problems in distributed computing. This paper studies the consensus problem in a synchronous dynamic directed network, in which communication is controlled by an oblivious message adversary. The question when consensus is possible in this model has already been studied thoroughly in the literature from a combinatorial perspective, and is known to be challenging. This paper presents a topological perspective on consensus solvability under oblivious message adversaries, which provides interesting new insights. Our main contribution is a topological characterization of consensus solvability, which also leads to explicit decision procedures. Our approach is based on the novel notion of a communication pseudosphere, which can be seen as the message-passing analog of the well-known standard chromatic subdivision for wait-free shared memory systems. We further push the elegance and expressiveness of the "geometric" reasoning enabled by the topological approach by dealing with uninterpreted complexes, which considerably reduce the size of the protocol complex, and by labeling facets with information flow arrows, which give an intuitive meaning to the implicit epistemic status of the faces in a protocol complex

    Scaling Transformer to 1M tokens and beyond with RMT

    Full text link
    This technical report presents the application of a recurrent memory to extend the context length of BERT, one of the most effective Transformer-based models in natural language processing. By leveraging the Recurrent Memory Transformer architecture, we have successfully increased the model's effective context length to an unprecedented two million tokens, while maintaining high memory retrieval accuracy. Our method allows for the storage and processing of both local and global information and enables information flow between segments of the input sequence through the use of recurrence. Our experiments demonstrate the effectiveness of our approach, which holds significant potential to enhance long-term dependency handling in natural language understanding and generation tasks as well as enable large-scale context processing for memory-intensive applications

    Energy Management of Grid-Connected Microgrids, Incorporating Battery Energy Storage and CHP Systems Using Mixed Integer Linear Programming

    Get PDF
    In this thesis, an energy management system (EMS) is proposed for use with battery energy storage systems (BESS) in solar photovoltaic-based (PV-BESS) grid-connected microgrids and combined heat and power (CHP) applications. As a result, the battery's charge/discharge power is optimised so that the overall cost of energy consumed is minimised, considering the variation in grid tariff, renewable power generation and load demand. The system is modelled as an economic load dispatch optimisation problem over a 24-hour time horizon and solved using mixed integer linear programming (MILP) for the grid-connected Microgrid and the CHP application. However, this formulation requires information about the predicted renewable energy power generation and load demand over the next 24 hours. Therefore, a long short-term memory (LSTM) neural network is proposed to achieve this. The receding horizon (RH) strategy is suggested to reduce the impact of prediction error and enable real-time implementation of the energy management system (EMS) that benefits from using actual generation and demand data in real-time. At each time-step, the LSTM predicts the generation and load data for the next 24 h. The dispatch problem is then solved, and the real-time battery charging or discharging command for only the first hour is applied. Real data are then used to update the LSTM input, and the process is repeated. Simulation results using the Ushant Island as a case study show that the proposed online optimisation strategy outperforms the offline optimisation strategy (with no RH), reducing the operating cost by 6.12%. The analyses of the impact of different times of use (TOU) and standard tariff in the energy management of grid-connected microgrids as it relates to the charge/discharge cycle of the BESS and the optimal operating cost of the Microgrid using the LSTM-MILP-RH approach is evaluated. Four tariffs UK tariff schemes are considered: (1) Residential TOU tariff (RTOU), (2) Economy seven tariff (E7T), (3) Economy ten tariff (E10T), and (4) Standard tariff (STD). It was found that the RTOU tariff scheme gives the lowest operating cost, followed by the E10T tariff scheme with savings of 63.5% and 55.5%, respectively, compared to the grid-only operation. However, the RTOU and E10 tariff scheme is mainly used for residential applications with the duck curve load demand structure. For community grid-connected microgrid applications except for residential-only communities, the E7T and STD, with 54.2% and 39.9%, respectively, are the most likely options offered by energy suppliers. The use of combined heat and power (CHP) systems has recently increased due to their high combined efficiency and low emissions. Using CHP systems in behind-the-meter applications, however, can introduce some challenges. Firstly, the CHP system must operate in load-following mode to prevent power export to the grid. Secondly, if the load drops below a predefined threshold, the engine will operate at a lower temperature and hence lower efficiency, as the fuel is only half-burnt, creating significant emissions. The aforementioned issues may be solved by combining CHP with a battery energy storage system. However, the dispatch of CHP and BESS must be optimised. Offline optimisation methods based on load prediction will not prevent power export to the grid due to prediction errors. Therefore, a real-time EMS using a combination of LSTM neural networks, MILP, and RH control strategy is proposed. Simulation results show that the proposed method can prevent power export to the grid and reduce the operational cost by 8.75% compared to the offline method. The finding shows that the BESS is a valuable asset for sustainable energy transition. However, they must be operated safely to guarantee operational cost reduction and longer life for the BESS

    Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem

    Full text link
    For typical first-order logical theories, satisfying assignments have a straightforward finite representation that can directly serve as a certificate that a given assignment satisfies the given formula. For non-linear real arithmetic with transcendental functions, however, no general finite representation of satisfying assignments is available. Hence, in this paper, we introduce a different form of satisfiability certificate for this theory, formulate the satisfiability verification problem as the problem of searching for such a certificate, and show how to perform this search in a systematic fashion. This does not only ease the independent verification of results, but also allows the systematic design of new, efficient search techniques. Computational experiments document that the resulting method is able to prove satisfiability of a substantially higher number of benchmark problems than existing methods

    Adiabatic technique based low power synchronous counter design

    Get PDF
    The performance of integrated circuits is evaluated by their design architecture, which ensures high reliability and optimizes energy. The majority of the system-level architectures consist of sequential circuits. Counters are fundamental blocks in numerous very large-scale integration (VLSI) applications. The T-flip-flop is an important block in synchronous counters, and its high-power consumption impacts the overall effectiveness of the system. This paper calculates the power dissipation (PD), power delay product (PDP), and latency of the presented T flip-flop. To create a 2-bit synchronous counter based on the novel T flip-flops, a performance matrix such as PD, latency, and PDP is analyzed. The analysis is carried out at 100 and 10 MHz frequencies with varying temperatures and operating voltages. It is observed that the presented counter design has a lesser power requirement and PDP compared to the existing counter architectures. The proposed T-flip-flop design at the 45 nm technology node shows an improvement of 30%, 76%, and 85% in latency, PD, and PDP respectively to the 180 nm node at 10 MHz frequency. Similarly, the proposed counter at the 45 nm technology node shows 96% and 97% improvement in power dissipation, delay, and PDP respectively compared to the 180 nm at 10 MHz frequency
    • …
    corecore