搜索结果: 1-10 共查到“数学 Storage”相关记录10条 . 查询时间(0.328 秒)
Operation and configuration of a storage portfolio via convex optimization
Convex optimization Predictive control Energy management systems
font style='font-size:12px;'>
2015/8/7
We consider a portfolio of storage devices which is used to modify a commodity flow so as to minimize an average cost function. The individual storage devices have different parameters that characteri...
Efficient and optimal binary Hopfield associative memory storage using minimum probability flow
Efficient and optimal binary associative memory storage minimum probability flow Adaptation and Self-Organizing Systems
font style='font-size:12px;'>
2012/4/26
We present an algorithm to store binary memories in a Hopfield neural network using minimum probability flow, a recent technique to fit parameters in energy-based probabilistic models. In the case of ...
Operations-Based Planning for Placement and Sizing of Energy Storage in a Grid With a High Penetration of Renewables
Operations-Based Energy Storage High Penetration of Renewables Optimization and Control
font style='font-size:12px;'>
2011/8/29
Abstract: As the penetration level of transmission-scale time-intermittent renewable generation resources increases, control of flexible resources will become important to mitigating the fluctuations ...
Quasi-stationary workload in a Lévy-driven storage system
L´ evy processes storage systems quasi-stationary distribution Laplace transforms
font style='font-size:12px;'>
2011/1/21
In this paper we analyze the quasi-stationary workload of a L´evy-driven storage system.
More precisely, assuming the system is in stationarity, we study its behavior conditional on the event t...
Storage option an Analytic approach
Storage option Analytic approach
font style='font-size:12px;'>
2010/11/10
The mathematical problem of the static storage optimization is formulated and solved by means of a variational analysis. The solution obtained in implicit form is shedding light on the most important ...
Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
Repair-by-Transfer Non-achievability Interior Points Storage-Bandwidth Tradeoff
font style='font-size:12px;'>
2010/11/17
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, r...
Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks
Eavesdropping Adversarial Attacks
font style='font-size:12px;'>
2010/12/6
We address the problem of securing distributed storage systems against eavesdropping and adversarial attacks. An important aspect of these systems is node failures over time, ecessitating, thus, a rep...
Rebuilding for Array Codes in Distributed Storage Systems
Rebuilding Array Codes Distributed Storage Systems
font style='font-size:12px;'>
2010/12/8
In distributed storage systems that use coding,the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repairing an erased node ...
A heuristic approach for solving serially distributed storage depots under power-of-two policy
Multistage inventory control Serial inventory-distribution systems
font style='font-size:12px;'>
2010/9/10
In this study, we present the problem of shipping a single-product from a single supply origin, through storage depots, to a single demand destination by trucks, ships, etc. and aim to minimize the su...
iew of a coding scheme in information storage techniques
Piecewise maps Coding scheme
font style='font-size:12px;'>
2010/9/15
This paper deals with coding scheme, first step in storage of information. Information storage techniques use one and two dimensional piecewise maps, this method consists in associating stable and uns...