检索结果-内蒙古大学图书馆

International Conference on Advanced Information Networking and Applications (AINA)

作者： William Voorsluys Rajkumar Buyya Cloud Computing and Distributed Systems (CLOUDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

Cloud computing providers are now offering their unused resources for leasing in the spot market, which has been considered the first step towards a full-fledged market economy for computational resources. Spot instances are virtual machines (VMs) available at lower prices than their standard on-demand counterparts. These VMs will run for as long as the current price is lower than the maximum bid price users are willing to pay per hour. Spot instances have been increasingly used for executing compute-intensive applications. In spite of an apparent economical advantage, due to an intermittent nature of biddable resources, application execution times may be prolonged or they may not finish at all. This paper proposes a resource allocation strategy that addresses the problem of running compute-intensive jobs on a pool of intermittent virtual machines, while also aiming to run applications in a fast and economical way. To mitigate potential unavailability periods, a multifaceted fault-aware resource provisioning policy is proposed. Our solution employs price and runtime estimation mechanisms, as well as three fault-tolerance techniques, namely check pointing, task duplication and migration. We evaluate our strategies using trace-driven simulations, which take as input real price variation traces, as well as an application trace from the Parallel Workload Archive. Our results demonstrate the effectiveness of executing applications on spot instances, respecting QoS constraints, despite occasional failures.

关键词： Fault tolerance Fault tolerant systems Checkpointing Runtime Virtual machining Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Preemption-aware Admission Control in a Virtualized Grid Federation

Preemption-aware Admission Control in a Virtualized Grid Fed...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Mohsen Amini Salehi Bahman Javadi Rajkumar Buyya Cloud Computing and Distributed Systems (CLOUDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

Many applications in federated Grids have quality-of-service (QoS) constraints such as deadline. Admission control mechanisms assure QoS constraints of the applications by limiting the number of user requests accepted by a resource provider. However, in order to maximize their profit, resource owners are interested in accepting as many requests as possible. In these circumstances, the question that arises is: what is the effective number of requests that can be accepted by a resource provider in a way that the number of accepted external requests is maximized and, at the same time, QoS violations are minimized. In this paper, we answer this question in the context of a virtualized federated Grid environment, where each Grid serves requests from external users along with its local users and requests of local users have preemptive priority over external requests. We apply analytical queuing model to address this question. Additionally, we derive a preemption-aware admission control policy based on the proposed model. Simulation results under realistic working conditions indicate that the proposed policy improves the number of completed external requests (up to 25%). In terms of QoS violations, the 95% confidence interval of the average difference with other policies is between (14.79%, 18.56%).

关键词： Admission control Mathematical model Equations Analytical models Time factors Queueing analysis

来源：评论

学校读者我要写书评

暂无评论

Visualization techniques for large datasets

引用

Journal of engineering Science and Technology Review 2012年第1期5卷 72-76页

作者： Michalos, M. Tselenti, P. Nalmpantis, S.L. School of Computing Information Systems and Mathematics Kingston University London United Kingdom Department of Electrical Engineering Kavala Institute of Technology Kavala Greece

In order to improve understanding and working with data, visualizing information is without a doubt the best method to implement. Data visualization as a term unites the established field of scientific visualization and the more recent field of information visualization. The goal of data visualization is to provide the viewer an aggregated representation of available data by taking into account human's visual system and its influence to comprehension. Spotting trends, seeing patterns and identifying outliers are some of the human's visual system processes that are being manipulated in order to make data more accessible and appealing. This procedure of graphical representations creation helps engaging data exploration and even more, data extraction. Along with computer and graphical engineering, visualizations have grown and reached a very satisfactory level of variations and techniques, indulging even the most exacting data facilitators whether they are researchers, computer scientists, statisticians etc. A variety of data visualization software has been developed the last decades but Stanford University's Protovis is by far the most distinguished tool to do the job. Below, a study is presented on data visualization's purpose and prospects and how these became a necessity through time. © 2012 Kavala Institute of Technology.

关键词： Data visualization

来源：评论

学校读者我要写书评

暂无评论

CUDA implementation of the algorithm for simulating the epidemic spreading over large networks

CUDA implementation of the algorithm for simulating the epid...

引用

Proceedings of the International Convention MIPRO

作者： Matija Šošić Mile Šikić Faculty of Electrical Engineering and Computing Zagreb Croatia Bioinformatics Institute Agency for Science Technology and Research Singapore Department of Electronic Systems and Information Processing Faculty of Electrical Engineering and Computing Zagreb Croatia

Preventing and controlling of epidemics in human or computer networks is a top problem. This paper presents an implementation of the algorithm that simulates the epidemic spreading in networks, using CUDA (Compute Unified Device Architecture) technology. Spreading of the epidemics over the network is modeled by a discrete SIR (Susceptible - Infected - Recovered) model. This implementation enables selection of starting node and monitoring the epidemic spread in each cycle. In comparison to a common CPU implementation, the CUDA implementation achieves about 10× faster execution time, which is of high significance to running tests on larger networks. The implementation was tested on real social networks consisting of more than 5 million nodes. Hence, we belive this implementation can have a practical value in analysis of the epidemic spreading over large networks.

关键词： Graphics processing unit Instruction sets Arrays Computational modeling Load modeling Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Fault detection in a wastewater treatment plant based on neural networks and PCA

Fault detection in a wastewater treatment plant based on neu...

引用

Mediterranean Conference on Control and Automation (MED)

作者： M.J. Fuente D. Garcia-Alvarez G.I. Sainz-Palmero P. Vega Department of Systems Engineering and Control University of Valladolid Valladolid Spain Department of Computing and Automation ETSII University of Sakamanca Bejar Salamanca Spain

In this paper, a neural network PCA method that integrates neural networks (NN) and principal component analysis (PCA) is used to detect faults in a wastewater treatment plant. The neural networks are used to calculate a non-linear and dynamic model of the process in normal operating conditions. PCA is used to generate monitoring charts based on the residuals calculated as the difference between the process measurements and the output of the networks. It can evaluate the current performance of the process and detects the faults. This technique has been applied to the simulation of a benchmark of a biological wastewater treatment process, a highly non-linear process. The simulation results clearly show the advantages of using this NNPCA monitoring in comparison with classical PCA monitoring.

关键词： Principal component analysis Monitoring Wastewater treatment Modeling Artificial neural networks Fault detection

来源：评论

学校读者我要写书评

暂无评论

Isotropic Hashing 12

Isotropic Hashing

引用

Annual Conference on Neural Information Processing systems

作者： Weihao Kong Wu-Jun Li Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China

ISBN: (纸本)9781627480031

Most existing hashing methods adopt some projection functions to project the o-riginal data into several dimensions of real values, and then each of these projected dimensions is quantized into one bit (zero or one) by thresholding. Typically, the variances of different projected dimensions are different for existing projection functions such as principal component analysis (PCA). Using the same number of bits for different projected dimensions is unreasonable because larger-variance dimensions will carry more information. Although this viewpoint has been widely accepted by many researchers, it is still not verified by either theory or experiment because no methods have been proposed to find a projection with equal variances for different dimensions. In this paper, we propose a novel method, called isotropic hashing (IsoHash), to learn projection functions which can produce projected dimensions with isotropic variances (equal variances). Experimental results on real data sets show that IsoHash can outperform its counterpart with different variances for different dimensions, which verifies the viewpoint that projections with isotropic variances will be better than those with anisotropic variances.

关键词： dimensions VARIANCES hashing principal components analysis Comment Isotropic Dataset numerical invariant projection function Drill bits

来源：评论

学校读者我要写书评

暂无评论

Design of CIC compensators with SPT coefficients based on interval analysis

Design of CIC compensators with SPT coefficients based on in...

引用

35th International Convention on Information and Communication Technology, Electronics and Microelectronics, MIPRO 2012

作者： Pecotic, Matija Glavinic Molnar, Goran Vucic, Mladen Siemens CMT D. D. Heinzelova 70a Zagreb HR10000 Croatia Department of Electronic Systems and Information Processing Faculty of Electrical Engineering and Computing University of Zagreb Unska 3 Zagreb HR10000 Croatia

ISBN: (纸本)9789532330724

The simplest multiplierless decimation filter is the cascaded-integrator- comb (CIC) filter. However, the magnitude response of this filter has a high passband droop, which is not tolerable in many applications. The droop can be reduced by the filter called CIC compensator. In this paper, we present a method for the design of finite-impulse-response CIC compensators whose coefficients are expressed as the sums of powers of two (SPT). The method is based on the minimax error criterion. To obtain the SPT coefficients, we use a global optimization technique which is based on the interval analysis. The proposed compensators are multiplierless and result in wide compensation bands. Therefore, they are suitable for application in software radio receivers operating with low decimation factors. © 2012 MIPRO.

关键词： Impulse response

来源：评论

学校读者我要写书评

暂无评论

Performance Metrics for a Biomolecular Step Response

Performance Metrics for a Biomolecular Step Response

引用

IEEE Annual Conference on Decision and Control

作者： Shaunak Sen Richard M. Murray Department of Electrical Engineering Indian Institute of Technology Delhi Control and Dynamical Systems Department of Computing and Mathematical Sciences Division of Engineering and Applied Sciences California Institute of Technology

ISBN: (纸本)9781467320658

Establishing performance metrics is a key part of a systematic design process. In particular, specifying metrics useful for quantifying performance in the ongoing efforts towards biomolecular circuit design is an important problem. Here we address this issue for the design of a fast biomolecular step response that is uniform across different cells and widely different environmental conditions using a combination of simple mathematical models and experimental measurements using single-cell time-lapse microscopy. We evaluate two metrics, the difference of the step response from an ideal step and the relative difference between multiple realizations of the step response, that can provide a single number to measure performance. We use a model of protein production-degradation to show that these performance metrics correlate with response features of speed and noise. Finally, we work through an experimental methodology to estimate these metrics for step responses that have been acquired for inducible protein expression circuits in E. coli. These metrics will be useful to evaluate biomolecular step responses, as well as for setting similar performance measures for other design goals.

关键词： Step response Performance metrics Metronidazole design target CIRCUIT DESIGN Escherichia coli

来源：评论

学校读者我要写书评

暂无评论

Gesture profile forweb services: An event-driven architecture to support gestural interfaces for smart environments 3rd

Gesture profile forweb services: An event-driven architectur...

引用

3rd International Joint Conference on Ambient Intelligence, AmI 2012

作者： Vatavu, Radu-Daniel Chera, Cătălin-Marian Tsai, Wei-Tek University Stefan cel Mare of Suceava Suceava720229 Romania Computer Science Department Politehnica University of Bucharest Romania School of Computing Informatics and Decision Systems Engineering Arizona State University TempeAZ85287 United States Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9783642348976

Gestural interfaces have lately become extremely popular due to the introduction on the market of low-cost acquisition devices such as iPhone, Wii, and Kinect. Such devices allow practitioners to design, experiment, and evaluate novel interfaces and interactions for new smart environments. However, gesture recognition algorithms are currently the appanage of machine learning experts which sometimes leaves AmI practitioners dealing with complex pattern recognition techniques instead of focusing on prototyping ambient interactions. To address this problem, we propose GPWS (Gesture Profile forWeb Services), a service-oriented architecture (SOA) designed to assist implementation of gestural interfaces. By providing gesture recognition as a web service, we leverage easy and fast adoption of gestural interfaces for various platforms and environments through simple service discovery and composition mechanisms. We discuss two GPWS designs based on SOA 1.0 and SOA 2.0 standards, analyze their performance, and demonstrate GPWS for a gesture-controlled smart home application. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Analysis of sound field distribution for room acoustics: From the point of view of hardware implementation

Analysis of sound field distribution for room acoustics: Fro...

引用

15th International Conference on Digital Audio Effects, DAFx 2012

作者： Yiyu, Tan Inoguchi, Yasushi Sato, Yukinori Otani, Makoto Iwaya, Yukio Matsuoka, Hiroshi Tsuchiya, Takao Research Center for Advanced Computing Infrastructure Japan Institute of Science and Technology Ishikawa Japan Faculty of Engineering Shinshu University Nagano Japan Faculty of Engineering Tohoku Gakuin University Japan Research Institute of Electrical Communication Tohoku University Sendai Japan Department of Information Systems Design Doshisha University Kyoto Japan

Analysis of sound field distribution is a data-intense and memory-intense application. To speed up calculation, an alternative solution is to implement the analysis algorithms by FPGA. This paper presents the related issues for FPGA based sound field analysis system from the point of view of hardware implementation. Compared with other algorithms, the OCTA-FDTD algorithm consumes 49 slices in FPGA, and the system updates 536.2 million elements per second. In system architecture, the system based on the parallel architecture benefits from fast computation since the sound pressures of all elements are obtained and updated at a clock cycle. But it consumes more hardware resources, and a small sound space is simulated by a FPGA chip. In contrast, the system based on the time-sharing architecture extends the simulated sound area by expense of computation speed since the sound pressures are calculated element by element.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：