Search results for "Hardware_MEMORYSTRUCTURES"
showing 10 items of 64 documents
Resistive communications based on neuristors
2017
Memristors are passive elements that allow us to store information using a single element per bit. However, this is not the only utility of the memristor. Considering the physical chemical structure of the element used, the memristor can function at the same time as memory and as a communication unit. This paper presents a new approach to the use of the memristor and develops the concept of resistive communication.
Evolution of application-specific cache mappings
2020
Reconfigurable caches offer an intriguing opportunity to tailor cache behavior to applications for better run-times and energy consumptions. While one may adapt structural cache parameters such as cache and block sizes, we adapt the memory-address-to-cache-index mapping function to the needs of an application. Using a LEON3 embedded multi-core processor with reconfigurable cache mappings, a metaheuristic search procedure, and MiBench applications, we show in this work how to accurately compare non-deterministic performances of applications and how to use this information to implement an optimization procedure that evolves application-specific cache mappings for the LEON3 multi-core processo…
From local structure to nanosecond recrystallization dynamics in AgInSbTe phase-change materials
2010
Phase-change optical memories are based on the astonishingly rapid nanosecond-scale crystallization of nanosized amorphous 'marks' in a polycrystalline layer. Models of crystallization exist for the commercially used phase-change alloy Ge(2)Sb(2)Te(5) (GST), but not for the equally important class of Sb-Te-based alloys. We have combined X-ray diffraction, extended X-ray absorption fine structure and hard X-ray photoelectron spectroscopy experiments with density functional simulations to determine the crystalline and amorphous structures of Ag(3.5)In(3.8)Sb(75.0)Te(17.7) (AIST) and how they differ from GST. The structure of amorphous (a-) AIST shows a range of atomic ring sizes, whereas a-GS…
Check in–check out intervention for supporting pupils’ behaviour: effectiveness and feasibility in Finnish schools
2018
Check In–Check Out (CICO) is a support programme for students with externalising problem behaviours. This study implemented in Finland is one of the first reports on the application of CICO in the European context. An experimental, multiple-baseline, single-case design is used to examine the effects of the CICO intervention on the problem behaviour and appropriate behaviour of three general education primary school pupils. The similarity of the observation data and the information provided in daily report card (DRC) are investigated to gauge the validity of the DRC assessments. The fidelity and social validity of the intervention are also analysed. CICO reduced problem behaviour in all pupi…
Upport vector machines for nonlinear kernel ARMA system identification.
2006
Nonlinear system identification based on support vector machines (SVM) has been usually addressed by means of the standard SVM regression (SVR), which can be seen as an implicit nonlinear autoregressive and moving average (ARMA) model in some reproducing kernel Hilbert space (RKHS). The proposal of this letter is twofold. First, the explicit consideration of an ARMA model in an RKHS (SVM-ARMA 2k) is proposed. We show that stating the ARMA equations in an RKHS leads to solving the regularized normal equations in that RKHS, in terms of the autocorrelation and cross correlation of the (nonlinearly) transformed input and output discrete time processes. Second, a general class of SVM-based syste…
Corruption in banks: A bibliometric review and agenda
2020
Abstract This paper is a bibliometric review of 819 articles, between 1969 and 2019, on corruption in banks. We identified six research streams: (1) the determinants of banks’ lending corruption; (2) the impact of corruption on banks’ lending and operational risk; (3) the impact of bank corruption on firms; (4) the impact of political connections on bank corruption; (5) the impact of corporate governance and regulations on bank corruption; and (6) the manipulation of the inter-bank offered rate. We recommend an anti-corruption architecture system and an extension in theoretical frameworks related to corruption in banks. We propose 20 future research questions.
Euclid Preparation. XIV. The Complete Calibration of the Color–Redshift Relation (C3R2) Survey: Data Release 3
2021
Stanford, S. A., et al.
Probabilistic Logic under Coherence‚ Model−Theoretic Probabilistic Logic‚ and Default Reasoning in System P
2016
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model-theoretic probabilistic reasoning and to default reasoning in System P. In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System P. That is, we provide a new probabilistic semantics for System P, which neither uses infinitesimal probabilities nor atomic bound (or bi…
Application of kolmogorov complexity to inductive inference with limited memory
1995
A b s t r a c t . We consider inductive inference with limited memory[l]. We show that there exists a set U of total recursive functions such that U can be learned with linear long-term memory (and no short-term memory); U can be learned with logarithmic long-term memory (and some amount of short-term memory); if U is learned with sublinear long-term memory, then the short-term memory exceeds arbitrary recursive function. Thus an open problem posed by Freivalds, Kinber and Smith[l] is solved. To prove our result, we use Kolmogorov complexity.
Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs
2017
Parity RAIDs are used to protect storage systems against disk failures. The idea is to add redundancy to the system by storing the parity of subsets of disks on extra parity disks. A simple two-dimensional scheme is the one in which the data disks are arranged in a rectangular grid, and every row and column is extended by one disk which stores the parity of it.In this paper we describe several two-dimensional parity RAIDs and analyse, for each of them, the probability for dataloss given that f random disks fail. This probability can be used to determine the overall probability using the model of Hafner and Rao. We reduce subsets of the forest counting problem to the different cases and show…