Ddo, a Generic and Efficient Framework for MDD-Based Optimization

This paper presents ddo, a generic and efficient library to solve constraint optimization problems with decision diagrams. To that end, our framework implements the branch-and-bound approach which has recently been introduced by Bergman et al., (2016) to solve dynamic programs to optimality. Our library allowed us to successfully reproduce the results of Bergman et al. for MISP, MCP and MAX2SAT while using a single generic library. As an additional benefit, our ddo library is able to exploit parallel computing for its purpose without imposing any constraint on the user (apart from memory safety). Ddo is released as an open source rust library (crate) alongside with its companion example programs to solve the aforementioned problems. To the best of our knowledge, this is the first public implementation of a generic library to solve combinatorial optimization problems with branch-and-bound MDD.

Comparison of Lithium-Ion Battery Models for Simulating Storage Systems in Distributed Power Generation

Lithium-ion batteries are well known in numerous commercial applications. Using accurate and efficient models, system designers can predict the behavior of batteries and optimize the associated performance management. Model-based development comprises the investigation of electrical, electro-chemical, thermal, and aging characteristics. This paper focuses on the analysis of models describing the electrical behavior. In particular, it investigates how cell voltage and state of charge can be determined with sufficient accuracy for a given load profile. For this purpose, the Thevenin-based, the Rint, and the Shepherd’s models, as well as a generic library model of an electronic circuit simulation software package, are compared. The procedure for determining model parameters is discussed in detail. All models are evaluated for the application in the analysis of distributed power generation. The validation is carried out by comparing simulation and measurement results with the help of a case study.

Design and Implementation of a Novel Bit-Parallel Systolic Multiplier Over GF(2m) for Irreducible Pentanomials

Cryptography in current digital world offers integrity and confidentiality of data being transferred over a communication network. Modern cryptography provides such security through cryptographic algorithms which mainly involve multiplication operation in finite fields. Since the finite field multiplication operation is a computationally intensive operation, various algorithms and architectures are proposed in the literature to obtain efficient finite field multiplications in both hardware and software. In this paper, a modified interleaved multiplication algorithm to perform multiplication of two finite field elements over GF(2m) for pentanomials is derived from a conventional interleaved multiplication algorithm using a novel Pre-Computation (PC) technique to reduce the computational complexity of the algorithm. Consequently, an m-bit systolic multiplier for pentanomials (SMP) is designed by employing the proposed algorithm. Hardware and delay complexity analysis is performed and comparison of the proposed SMP structure with similar multipliers available in the literature is presented. The SMP structure achieves about 28% improvement in hardware for [Formula: see text] when compared with the best multiplier available in the literature. The functionality of the proposed SMP structure is verified by implementing on a field-programmable gate array (FPGA) Virtex-7 (XC7V2000TFLG1925-2) prototype board and synthesizing in application specific integrated circuit (ASIC) using Synopsys Design Vision compiler with 90[Formula: see text]nm generic library. It can be observed from FPGA and ASIC implementation results that the proposed SMP structure shows improvement in area and power consumption when compared with similar multipliers available in the literature.

Process architecture development using Riva and ARIS: comparative study

Purpose Business process modeling has been given great attention due to its crucial role in developing computer-based systems that support (and automate) organizational processes. In information systems, building the right process architecture is vital, since a poor division of organizational processes can lead to complex designs or incoherent structure. Moreover, process architecture acts as a “big picture” of what the organization does, and represents dynamic relationships between the existing processes, which, in turn, helps understand how the organization works (Ould, 2005). The paper aims to discuss these issues. Design/methodology/approach This paper discusses the derivation of a process architecture diagram (PAD) using the Riva method in detail, in contrast to the PAD developed using Architecture of Integrated Information Systems (ARIS). The information system selected as an example for this comparative study is in the context of academic libraries, embedding various yet generic library processes. Findings Organizational process architecture provides a basis for business management, based on specific framework supported by integrated tools and methods (Kozina, 2006). ARIS and Riva process architecture methods can be used to visualize and document organizational processes. Understanding the merits and weaknesses of each method is essential to identify possible areas of application. Research limitations/implications The processes selected were generic in most academic libraries not taking into consideration special personalized processes. These can be added though. Practical implications Both techniques are feasible and can be used to view and analyze library processes, allowing bridging the gap between theory and practice. Originality/value A number of process architecture methods are available, however, few studies focused on assessing these methods, and comparing some of them to find out how easy they are to be used in particular contexts, and whether they can be standardized.