Title: Energy Efficient Video Decoding for the Android Operating System
Authors: WenYew Liang, MingFeng Chang, YenLin Chen and ChinFeng Lai
Abstract: Dynamic voltage and frequency scaling (DVFS) is an effective technique for reducing power consumption. Due to the increasing popularity of multimedia applications for portable consumer electronic devices, the importance on reducing their power consumption becomes significant. This paper proposed a table-based DVFS mechanism for frame decoding that reduces the power consumption of a processor by exploiting the frame decoding complexity. A table-based DVFS predictor is used in the frame decoding prediction. This study was implemented in the Android operating system on an Intel PXA27x embedded platform. Experiment results showed that the energy consumption of decoding videos can be reduced from 9% to 17%, whereas the frame drop-rate is less than 3%.
Publish Year: 2013
Published in: ICCE - IEEE
Number of Pages: 2
موضوع: سیستم عامل اندروید (Android Operating System)
Title: An efficient B + -tree design for main-memory database systems with strong access locality
Authors: PeiLun Suei a , Victor CS Lee b,fi , ShiWu Lo c , TeiWei Kuo
Abstract: This paper is motivated by the strong demands of many main-memory database applications with strong locality in data access, such as front-end logistical systems. We propose to adopt an auxiliary-tree approach with an tree-merging algorithm to efficiently handle bursty data insertions with keys in a small range and avoid significant overheads in tree rebalancing. A range-based deletion algorithm is then proposed to process data deletions with strong access locality in a batch fashion. The capability of the proposed approach is evaluated by a series of experiments with a wide range of workloads and a variety of locality patterns, where different tree index structures are compared in terms of the performance and memory space requirements.
Publish Year: 2013
Published in: Information Sciences - Science Direct
Title: Indoor Air Quality Control for Energy-Efficient Buildings Using CO 2 Predictive Model
Authors: Zhu Wang and Lingfeng Wang
Abstract: In this paper, an intelligent control system for indoor air quality in energy-efficient buildings is proposed. The goal of intelligent air quality control for energy-efficient buildings is to maintain the indoor CO 2 concentration in the comfort zone with a minimum amount of energy consumption. In this study, the CO 2 concentration is used as the indicator of indoor air quality and a CO 2 predictive model is utilized to forecast the indoor CO2 concentration. Particle swarm optimization (PSO) is applied to derive the optimal ventilation rate. As compared with the traditional ON/OFF ventilation control system, the performance of the proposed intelligent control system has demonstrated its advantage in terms of energy savings. A case study and corresponding simulation results are detailed in the paper.
Abstract: This paper presents a new algorithm, Function Optimisation by Learning Automata (FOLA), to solve complex function optimisation problems. FOLA consists of multiple automata, in which each automaton undertakes dimensional search on a selected dimension of the solution domain. A search action is taken on a path which is identified in the search space by the path value, and the path value is updated using the values of the states visited in the past, via a state memory that enables better use of the information collected in the optimisation process. In this paper, FOLA is compared with two popularly used particle swarm optimisers and four newly-proposed optimisers, on nine complex multi-modal benchmark functions. The experimental results have shown that in comparison with the other optimisers, FOLA offers better performance for most of the benchmark functions, in terms of its convergence rate and accuracy, and it uses much less computation time to obtain accurate solutions, especially for high-dimensional functions. In order to explore the FOLA s potential for applications, it is also applied to solve an optimal power flow problem of power systems. FOLA is able to minimise the fuel cost and enhance the voltage stability of the power system more efficiently in comparison with the other algorithms.
Publish Year: 2013
Published in: Information Sciences - Science Direct
Title: Augmenting the World using Semantic Web Technologies
Authors: Jens Grubert, Lyndon Nixon, Gerhard Reitmayr
Abstract: Creating and maintaining augmented scenes for mobile Augmented Reality browsers can be a challenging and time consuming task. The timeliness of digital information artifacts connected to changing urban environments require authors to constantly update the structural representations of augmented scenes or to accept that the information will soon be outdated. We present an approach for retrieving multimedia content and relevant web services for mobile Augmented Reality applications at runtime. Using semantic web technologies we are able to postpone the retrieval of actual media items to the moment a user actually perceives an augmented scene. This allows content creators to augment a scene only once and avoid continuous manual updates. We also discuss the tradeoff between runtime content retrieval using Linked Data concepts and decreased control over the scene appearance at the time of authoring that comes along with this approach.
Title: A high abstraction level approach for detecting feature interactions between telecommunication services
Authors: Zohair Chentouf, Ahmed Khoumsi
Abstract: When several telecommunication services are running at the same time, undesirable behaviors may arise, which are commonly called feature interactions. Several methods have been developed for detecting and resolving feature interactions. However, most of these methods are based on detailed models of services, which make them suffer from state space explosion. Moreover, different telecommunication operators cannot cooperate to manage feature interactions by exchanging detailed service models because this violates the confidentiality principle. Our work is a part of the few attempts to develop feature interaction detection methods targeting to avoid or reduce significantly state space explosion. In order to reach this objective, we first develop a so called Cause Restrict language to model subscribers of telecommunication services at a very high abstraction level. A Cause Restrict model of a subscriber provides information such as: what is the cause of what, and what restricts (or forbids) what, and specifies coarsely the frequency of each operation cause or restrict by always or sometimes. Then, we develop a method that detects feature interactions between telecommunication services modeled in the Cause Restrict language. We demonstrate the applicability of our approach by modeling several services and detecting several feature interactions between them. New feature interactions have been detected by our approach.
Publish Year: 2013
Published in: Information Sciences - Science Direct
Authors: Azadeh Farzan Zachary Kincaid, Andreas Podelski
Abstract: The correctness of a sequential program can be shown by the annotation of its control flow graph with inductive assertions. We pro-pose inductive data flow graphs, data flow graphs with incorporated inductive assertions, as the basis of an approach to verifying concurrent programs. An inductive data flow graph accounts for a set of dependencies between program actions in interleaved thread executions, and therefore stands as a representation for the set of concurrent program traces which give rise to these dependencies. The approach first constructs an inductive data flow graph and then checks whether all program traces are represented. The size of the inductive data flow graph is polynomial in the number of data dependencies (in a sense that can be made formal); it does not grow exponentially in the number of threads unless the data dependencies do. The approach shifts the burden of the exponential explosion towards the check whether all program traces are represented, i.e., to a combinatorial problem (over finite graphs).
Title: Minimizing Transmit Power for Cooperative Multicell System with Massive MIMO
Authors: Jinkyu Kang and Joonhyuk Kang
Abstract: We consider the problem of designing transmit beam former and power for downlink cooperative base-station(BS) system with a large antenna arrays. Since the design of the beam forming vector at the transmitter requires high computational complexity, in a large antenna arrays, we utilize the zero-forcing transmit beamformer, which is the simplest form and the optimal performance in a large antenna arrays. Therefore, this paper focuses on the design of power allocation with n¼üxed transmit beam former for minimizing the transmit power while meeting target signal-to-interference-and-noise-ratio(SINR) of each user and power constraints. We consider two scenarios according to the power constraints of cooperative BSs.One scenario is the sum power constraint on the cooperative base-stations. In this case, the cooperative BSs share the total available transmit power. However, each BS exists a maximum availabletransmit power in practical implementations. Thus, we consider amore realistic per BS power constraints. We proposed the solution strategies for both scenarios: For the sum power constraint case,a simple intuitive solution, where the power is allocated withoutregard to the power constraint until the SINR constraints issatisn¼üed, is presented. For the per BS power constraints case, weuse the properties of a large antenna arrays to n¼ünd the solution ofclosed form. We also demonstrate, via numerical simulation, the performance of proposed strategy is convergent to the optimal performance which is achieved by using the iterative algorithm.
Authors: Julia Borghoff, Lars R Knudsen, Gregor Leander, and Sren S Thomsen
Abstract: This paper considers PRESENT-like ciphers with key-dependent S-boxes. We focus on the setting where the same selection of S-boxes is used in every round. One particular variant with 16 rounds, proposed in 2009, is broken in practice in a chosen plaintext/chosen cipher text scenario. Extrapolating these results suggests that up to 28 rounds of such ciphers can be broken. Furthermore, we outline how our attack strategy can be applied to an extreme case where the S-boxes are chosen uniformly at random for each round, and where the bit permutation is key-dependent as well.
Publish Year: 2013
Published in: Journal of Cryptography - Journal of Springer
Title: Visualizing Uncertainty in Multi-resolution Volumetric Data Using Marching Cubes
Authors: J Ma,D Murphy,M Hayes,G Provan
Abstract: Data sets acquired from complex scientific simulation, high precision engineering experiment and high-speed computer network have been exponentially increased, and visualization and analysis of such large-scale of data sets have been identified as a significant challenge to the visualization com-munity. Over the past years many scientists have made at-tempt to address this problem by proposing various data reduction techniques. Consequently the size of data can be reduced and issues associated to the visualization can be improved (e.g. real-time interaction and visual overload).However, during the process of data reduction, the information of original data sets was approximated and potential errors were introduced. It leads to a new problem with regard to the integrity of the data and might mislead users for incorrect decision making. Therefore in this paper we aim to solve the problem by introducing three novel uncertainty visualization methods, which depict both the multi-resolution(MR) approximations of the original data set and the errors associated with each of its low resolution representations. As a result we faithfully represent the MR data sets and allow users to make suitable decisions from the visual output. We applied our techniques on a data set from medical domain to demonstrate their effectiveness and usability.
تبادل
لینک هوشمند
برای تبادل
لینک ابتدا ما
را با عنوان
دانلود مقاله ISI
و آدرس
downloadpaperisi.LXB.ir
لینک
نمایید سپس
مشخصات لینک
خود را در زیر
نوشته . در صورت
وجود لینک ما در
سایت شما
لینکتان به طور
خودکار در سایت
ما قرار میگیرد.
خبرنامه وب سایت:
آمار
وب سایت:
بازدید امروز : 1
بازدید دیروز : 0
بازدید هفته : 8
بازدید ماه : 2661
بازدید کل : 304091
تعداد مطالب : 143
تعداد نظرات : 1
تعداد آنلاین : 1
تبادل
لینک هوشمند
خبرنامه وب سایت:
آمار
وب سایت: