4,140 research outputs found
Motion estimation and CABAC VLSI co-processors for real-time high-quality H.264/AVC video coding
Real-time and high-quality video coding is gaining a wide interest in the research and industrial community for different applications. H.264/AVC, a recent standard for high performance video coding, can be successfully exploited in several scenarios including digital video broadcasting, high-definition TV and DVD-based systems, which require to sustain up to tens of Mbits/s. To that purpose this paper proposes optimized architectures for H.264/AVC most critical tasks, Motion estimation and context adaptive binary arithmetic coding. Post synthesis results on sub-micron CMOS standard-cells technologies show that the proposed architectures can actually process in real-time 720 Ă 480 video sequences at 30 frames/s and grant more than 50 Mbits/s. The achieved circuit complexity and power consumption budgets are suitable for their integration in complex VLSI multimedia systems based either on AHB bus centric on-chip communication system or on novel Network-on-Chip (NoC) infrastructures for MPSoC (Multi-Processor System on Chip
Optimal Location of Energy Storage Systems with Robust Optimization
The integration of intermittent sources of energy and responsive loads in distribution system make the traditional deterministic optimization-based optimal power flow no longer suitable for finding the optimal control strategy for the power system operation. This paper presents a tool for energy storage planning in the distribution network based on AC OPF algorithm that uses a convex relaxation for the power flow equations to guarantee exact and optimal solutions with high algorithmic performances and exploits robust optimization approach to deal with the uncertainties related to renewables and demand. The proposed methodology is applied for storage planning on a distribution network that is representative of a class of networks
On using content addressable memory for packet classiïŹcation
Packet switched networks such as the Internet require packet classiïŹcation at every hop in order to ap-ply services and security policies to trafïŹc ïŹows. The relentless increase in link speeds and trafïŹc volume imposes astringent constraints on packet classiïŹcation solutions. Ternary Content Addressable Memory (TCAM) devices are favored by most network component and equipment vendors due to the fast and de-terministic lookup performance afforded by their use of massive parallelism. While able to keep up with high speed links, TCAMs suffer from exorbitant power consumption, poor scalability to longer search keys and larger ïŹlter sets, and inefïŹcient support of multiple matches. The research community has responded with algorithms that seek to meet the lookup rate constraint with greater efïŹciency through the use of com-modity Random Access Memory (RAM) technology. The most promising algorithms efïŹciently achieve high lookup rates by leveraging the statistical structure of real ïŹlter sets. Due to their dependence on ïŹlter set characteristics, it is difïŹcult to provision processing and memory resources for implementations that support a wide variety of ïŹlter sets. We show how several algorithmic advances may be leveraged to im-prove the efïŹciency, scalability, incremental update and multiple match performance of CAM-based packet classiïŹcation techniques without degrading the lookup performance. Our approach, Label Encoded Content Addressable Memory (LECAM), represents a hybrid technique that utilizes decomposition, label encoding, and a novel Content Addressable Memory (CAM) architecture. By reducing the number of implementation parameters, LECAM provides a vehicle to carry several of the recent algorithmic advances into practice. We provide a thorough overview of CAM technologies and packet classiïŹcation algorithms, along with a detailed discussion of the scaling issues that arise with longer search keys and larger ïŹlter sets. We also provide a comparative analysis of LECAM and standard TCAM using a collection of real and synthetic ïŹlter sets of various sizes and compositions
Distributed Online Modified Greedy Algorithm for Networked Storage Operation under Uncertainty
The integration of intermittent and stochastic renewable energy resources
requires increased flexibility in the operation of the electric grid. Storage,
broadly speaking, provides the flexibility of shifting energy over time;
network, on the other hand, provides the flexibility of shifting energy over
geographical locations. The optimal control of storage networks in stochastic
environments is an important open problem. The key challenge is that, even in
small networks, the corresponding constrained stochastic control problems on
continuous spaces suffer from curses of dimensionality, and are intractable in
general settings. For large networks, no efficient algorithm is known to give
optimal or provably near-optimal performance for this problem. This paper
provides an efficient algorithm to solve this problem with performance
guarantees. We study the operation of storage networks, i.e., a storage system
interconnected via a power network. An online algorithm, termed Online Modified
Greedy algorithm, is developed for the corresponding constrained stochastic
control problem. A sub-optimality bound for the algorithm is derived, and a
semidefinite program is constructed to minimize the bound. In many cases, the
bound approaches zero so that the algorithm is near-optimal. A task-based
distributed implementation of the online algorithm relying only on local
information and neighbor communication is then developed based on the
alternating direction method of multipliers. Numerical examples verify the
established theoretical performance bounds, and demonstrate the scalability of
the algorithm.Comment: arXiv admin note: text overlap with arXiv:1405.778
Applying Operations Research techniques to planning of train shunting
In this paper, we discuss a model-based algorithmic approach for supporting planners in the creation of shunt plans for passenger trains. The approach provides an example of a mathematical model and a corresponding solution approach for model based support. We introduce a four-step solution approach and we discuss how the planners are supported by this approach. Finally, we present computational results for these steps and give some suggestions for further research.A* search;railway optimization;real world application;routing
Optimal Sizing and Power Management Strategies of Islanded Microgrids for Remote Electrification Systems
Over the past few years, electrification of remote communities with an efficient utilization of on-site energy resources has entered a new phase of evolution. However, the planning tools and studies for the remote microgrids are considered inadequate. Moreover, the existing techniques have not taken into account the impact of reactive power on component sizes. Thus, this thesis concentrates on optimal sizing design of an islanded microgrid (IMG), which is composed of renewable energy resources (RERs), battery energy storage system (BESS), and diesel generation system (DGS), for the purpose of electrifying off-grid communities. Owing to the utilization of both BESS and DGS, four power management strategies (PMSs) are modeled upon analyzing the impacts of reactive power to chronologically simulate the IMG. In this work, two single-objective optimization (SOO) and two multiobjective optimization (MOO) approaches are developed for determining the optimal component sizes in an IMG. Chronological simulation and an enumeration-based search technique are adopted in the first SOO approach. Then, an accelerated SOO approach is proposed by adopting an improved piecewise aggregate approximation (IPAA)-based time series and a genetic algorithm (GA). Next, an adaptive weighted sum (AWS) method, in conjunction with an enumeration search technique, is adopted in a bi-objective optimization approach. Finally, an elitist non-dominated sorting GA-II (NSGA-II) technique is proposed for MOO of the IMG by introducing three objective functions. The enumeration-based SOO approach ensures a global optimum, determines the optimal sizes and PMSs simultaneously, and offers a realistic solution. The accelerated SOO approach significantly reduces the central processing unit (CPU) time without largely deviating the life cycle cost (LCC). The bi-objective optimal sizing approach generates a large number of evenly spread trade-off solutions both in regular and uneven regions upon adopting the LCC and renewable energy penetration (REP) as the objective functions. Using the MOO approach, one can produce a diversified set of Pareto optimal solutions, for both the component sizes and PMSs, at a reduced computational effort. The effectiveness of the proposed approaches is demonstrated by simulation studies in the MATLAB/Simulink software environment
A comparative analysis of algorithms for satellite operations scheduling
Scheduling is employed in everyday life, ranging from meetings to manufacturing and operations among other activities. One instance of scheduling in a complex real-life setting is space mission operations scheduling, i.e. instructing a satellite to perform fitting tasks during predefined time periods with a varied frequency to achieve its mission goals. Mission operations scheduling is pivotal to the success of any space mission, choreographing every task carefully, accounting for technological and environmental limitations and constraints along with mission goals.;It remains standard practice to this day, to generate operations schedules manually ,i.e. to collect requirements from individual stakeholders, collate them into a timeline, compare against feasibility and available satellite resources, and find potential conflicts. Conflict resolution is done by hand, checked by a simulator and uplinked to the satellite weekly. This process is time consuming, bears risks and can be considered sub-optimal.;A pertinent question arises: can we automate the process of satellite mission operations scheduling? And if we can, what method should be used to generate the schedules? In an attempt to address this question, a comparison of algorithms was deemed suitable in order to explore their suitability for this particular application.;The problem of mission operations scheduling was initially studied through literature and numerous interviews with experts. A framework was developed to approximate a generic Low Earth Orbit satellite, its environment and its mission requirements. Optimisation algorithms were chosen from different categories such as single-point stochastic without memory (Simulated Annealing, Random Search), multi-point stochastic with memory (Genetic Algorithm, Ant Colony System, Differential Evolution) and were run both with and without Local Search.;The aforementioned algorithmic set was initially tuned using a single 89-minute Low Earth Orbit of a scientific mission to Mars. It was then applied to scheduling operations during one high altitude Low Earth Orbit (2.4hrs) of an experimental mission.;It was then applied to a realistic test-case inspired by the European Space Agency PROBA-2 mission, comprising a 1 day schedule and subsequently a 7 day schedule - equal to a Short Term Plan as defined by the European Space Agency.;The schedule fitness - corresponding to the Hamming distance between mission requirements and generated schedule - are presented along with the execution time of each run. Algorithmic performance is discussed and put at the disposal of mission operations experts for consideration.Scheduling is employed in everyday life, ranging from meetings to manufacturing and operations among other activities. One instance of scheduling in a complex real-life setting is space mission operations scheduling, i.e. instructing a satellite to perform fitting tasks during predefined time periods with a varied frequency to achieve its mission goals. Mission operations scheduling is pivotal to the success of any space mission, choreographing every task carefully, accounting for technological and environmental limitations and constraints along with mission goals.;It remains standard practice to this day, to generate operations schedules manually ,i.e. to collect requirements from individual stakeholders, collate them into a timeline, compare against feasibility and available satellite resources, and find potential conflicts. Conflict resolution is done by hand, checked by a simulator and uplinked to the satellite weekly. This process is time consuming, bears risks and can be considered sub-optimal.;A pertinent question arises: can we automate the process of satellite mission operations scheduling? And if we can, what method should be used to generate the schedules? In an attempt to address this question, a comparison of algorithms was deemed suitable in order to explore their suitability for this particular application.;The problem of mission operations scheduling was initially studied through literature and numerous interviews with experts. A framework was developed to approximate a generic Low Earth Orbit satellite, its environment and its mission requirements. Optimisation algorithms were chosen from different categories such as single-point stochastic without memory (Simulated Annealing, Random Search), multi-point stochastic with memory (Genetic Algorithm, Ant Colony System, Differential Evolution) and were run both with and without Local Search.;The aforementioned algorithmic set was initially tuned using a single 89-minute Low Earth Orbit of a scientific mission to Mars. It was then applied to scheduling operations during one high altitude Low Earth Orbit (2.4hrs) of an experimental mission.;It was then applied to a realistic test-case inspired by the European Space Agency PROBA-2 mission, comprising a 1 day schedule and subsequently a 7 day schedule - equal to a Short Term Plan as defined by the European Space Agency.;The schedule fitness - corresponding to the Hamming distance between mission requirements and generated schedule - are presented along with the execution time of each run. Algorithmic performance is discussed and put at the disposal of mission operations experts for consideration
- âŠ