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

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Tianyi Xing Hongbin Liang Dijiang Huang Lin X. Cai School of Computing Informatics and Decision Systems Engineering Arizona State University USA School of Information Science and Technology Southwest Jiaotong University China Department of Electrical Engineering Princeton University USA

ISBN: (纸本)9781467321723

With Internet environment is getting optimized and users preferring mobile communications, Cloud Service Providers (CSP) aim to provide services to users depending on their geographic locations with higher service availability and faster access speed. Mobile cloud computing falls into this category, where mobile users can move around and request cloud services at any given geographic locations. To build such a geographic-based mobile cloud services, an effective mobile cloud resource allocation and service request scheduling scheme is highly desired. To this end, the presented service request scheduling scheme takes a comprehensive approach by considering system parameters from both CSP and mobile users such as computation, energy, connectivity, service payment, mobile users' satisfaction, etc. Finally, the performance evaluation of the proposed scheduling scheme is evaluated through simulations where the results show that the presented scheme achieves better system overall gain compared to traditional over-provisioning approaches.

关键词： Mobile communication Mobile handsets Cloud computing Resource management Processor scheduling Servers Computer architecture

来源：评论

学校读者我要写书评

暂无评论

DICB: Dynamic Intelligent Customizable Benign Pricing Strategy for Cloud computing

DICB: Dynamic Intelligent Customizable Benign Pricing Strate...

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Wei-Tek Tsai Guanqiu Qi Department of Computer Science and Technology Tsinghua University Beijing China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA

ISBN: (纸本)9781467328920

As cloud services need a fair pricing for both service providers and customers. If the price is too high, the customer may not use it, if the price is too low, service providers have less incentive to develop services. This paper proposes a novel pricing framework for cloud services using game theory (Cournot Duopoly, Cartel, and Stackelberg models) and data mining techniques (clustering and classification, e.g., SVM (Support Vector Machine)) to determine optimal prices for cloud services. The framework is dynamic because the price is determined based on recent usage data and available resources, it is also intelligent as it takes into various economic models into consideration, it is benign because it considers two conflicting parties, service providers and consumers, into consideration at the same time, and it is customizable based on various pricing strategies proposed by service providers and usage patterns as exhibited by consumers. Linear regression is used in various game theory models to determine the optimal price. A global pricing union (GPU) framework is proposed to achieve the best practice of game theory models. Based on the proposed technique, this paper applies this pricing framework to a case study in cloud services, and demonstrates that the prices obtained meet the requirement of traditional supply-demand analysis. In other words, the price obtained is good enough.

关键词： Pricing Cloud computing Graphics processing unit Companies Production Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

On region-based fault tolerant design of distributed file storage in networks

On region-based fault tolerant design of distributed file st...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Sujogya Banerjee Shahrzad Shirazipourazad Arunabha Sen Computer Science and Engineering Program School of Computing Informatics and Decision System Engineering Arizona State University Tempe AZ USA

ISBN: (纸本)9781467307734;9781467307758

Distributed storage of data files in different nodes of a network enhances the reliability of the data by offering protection against node failure. In the (N,K),N ≥ K file distribution scheme, from a file F of size |F|, N segments of size |F|/K are created in such a way that it is possible to reconstruct the entire file, just by accessing any K segments. For the reconstruction scheme to work it is essential that the K segments of the file are stored in nodes that are connected in the network. However in case of node failures the network might become disconnected (i.e., split into several connected components). We focus on node failures that are spatially-correlated or region-based. Such failures are often encountered in disaster situations or natural calamities where only the nodes in the disaster zone are affected. The goal of this research is to devise a file segment distribution scheme so that, even if the network becomes disconnected due to any region fault, at least one of the largest connected components will have at least K distinct file segments with which to reconstruct the entire file. The distribution scheme will also ensure that the total storage requirement is minimized. We provide an optimal solution through Integer Linear Programming and an approximation solution with a guaranteed performance bound of O(ln n) to solve the problem for any arbitrary network. The performance of the approximation algorithm is evaluated by simulation on two real networks.

关键词： Image color analysis Color Approximation algorithms Robustness Approximation methods Layout Encoding

来源：评论

学校读者我要写书评

暂无评论

A Cost-Effective Intelligent Configuration Model in Cloud computing

A Cost-Effective Intelligent Configuration Model in Cloud Co...

引用

International Conference on Distributed computing systems Workshop

作者： Wei-Tek Tsai Guanqiu Qi Yinong Chen Department of Computer Science and Technology Tsinghua University Beijing China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA

Cloud computing environments provide a resource pool for customers for their processing, storage and networking needs. It is necessary for customers to choose desirable configuration from vast resources available in the cloud. This paper proposes a heuristic model to choose a cloud configuration for efficient use. Trend analysis in data mining is used to predict the future trend and assist provisioning. The model is experimented with Intel power 32 core machine and in Azure cloud. Both environments demonstrated that the proposed model provided effective solutions.

关键词： Program processors Computational modeling Memory Cloud computing System performance Predictive models Data mining

来源：评论

学校读者我要写书评

暂无评论

Translation + pendaphonics = movement modulated media 12

Translation + pendaphonics = movement modulated media

引用

ACM Special Interest Group on Computer Graphics and Interactive Techniques Conference, SIGGRAPH'12

作者： Lahey, Byron Burleson, Winslow Streb, Elizabeth Arizona State University School of Arts Media and Engineering 699 S. Mill Ave. Tempe AZ 85281 United States Arizona State University School of Computing Informatics and Decision Systems Engineering P.O. Box 878809 Tempe AZ 85287-8809 United States 51 North 1st Street Brooklyn NY 11211 United States

ISBN: (纸本)9781450316750

Translation is a multimedia dance performed on a vertical wall filed with the projected image of a lunar surface. Pendaphonics is a low-cost, versatile, and robust motion-sensing hardware-software system integrated with the rigging of Translation to detect the dancers' motion and provide real-time control of the virtual moonscape. Replacing remotely triggered manual cues with high-resolution, real-time control by the performers expands the expressive range and ensures synchronization of feedback with the performers' movements. This project is the first application of an ongoing collaboration between the Motivational Environments Research Group at Arizona State University (ASU) and STREB Extreme Action Company. © 2012 ACM.

关键词： Real time control

来源：评论

学校读者我要写书评

暂无评论

A Semantic Triplet Based Story Classifier

A Semantic Triplet Based Story Classifier

引用

International Conference on Advances in Social Network Analysis and Mining, ASONAM

作者： Betul Ceran Ravi Karad Ajay Mandvekar Steven R. Corman Hasan Davulcu School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA Hugh Downs School of Human Communication Arizona State University Tempe AZ USA

A story is defined as “an actor(s) taking action(s) that culminates in a resolution(s).” In this paper, we investigate the utility of standard keyword based features, statistical features based on shallow-parsing (such as density of POS tags and named entities), and a new set of semantic features to develop a story classifier. This classifier is trained to identify a paragraph as a “story,” if the paragraph contains mostly story(ies). Training data is a collection of expert-coded story and non-story paragraphs from RSS feeds from a list of extremist web sites. Our proposed semantic features are based on suitable aggregation and generalization of ; triplets that can be extracted using a parser. Experimental results show that a model of statistical features alongside memory-based semantic linguistic features achieves the best accuracy with a Support Vector Machine (SVM) classifier.

关键词： Feature extraction Semantics Accuracy Organizations Support vector machines Humans Standards organizations

来源：评论

学校读者我要写书评

暂无评论

Zero-knowledge proofs of retrievability

引用

Science China(Information Sciences) 2011年第8期54卷 1608-1617页

作者： AHN Gail-Joon School of Computing Informatics and Decision Systems Engineering Arizona State University

Proof of retrievability (POR) is a technique for ensuring the integrity of data in outsourced storage *** this paper,we address the construction of POR protocol on the standard model of interactive proof *** propose the first interactive POR scheme to prevent the fraudulence of prover and the leakage of verified *** also give full proofs of soundness and zero-knowledge properties by constructing a polynomial-time rewindable knowledge extractor under the computational Diffie-Hellman *** particular,the verification process of this scheme requires a low,constant amount of overhead,which minimizes communication complexity.

关键词： cryptography integrity of outsourced data proofs of retrievability interactive protocol zero- knowledge soundness rewindable knowledge extractor

来源：评论

学校读者我要写书评

暂无评论

electric transportation

引用

IEEE POWER & ENERGY MAGAZINE 2011年第4期9卷 14-16页

作者： Fahimi, Babak Wang, Jianhui School of Computing Informatics Decision Systems Engineering Arizona State University Tempe AZ

Rising energy prices, concerns about climate change, and growing political implications in providing reliable access to petroleum has reignited the quest for electrified transportation around the globe. Considering the fact that over 77 million land vehicles were manufactured in 2010 alone, the transformation to an all-electric automotive industry, or even a more realistic 10% electrification by the year 2020, will have a profound impact on the world economy; electricity generation, transmission, and distribution capacity; and environmental priorities.

关键词： Special issues and sections Electric vehicles Environmental factors Fuel economy Economics Energy resources

来源：评论

学校读者我要写书评

暂无评论

Survivable Virtual Infrastructure Mapping in Virtualized Data Centers

Survivable Virtual Infrastructure Mapping in Virtualized Dat...

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Jielong Xu Jian Tang Kevin Kwiat Weiyi Zhang Guoliang Xue Department of Electrical Engineering and Computer Science at Syracuse University Air Force Research Lab (AFRL) AT&T Labs Research School of Computing Informatics and Decision Systems Engineering at Arizona State University

In a virtualized data center, survivability can be enhanced by creating redundant Virtual Machines (VMs) as backup for VMs such that after VM or server failures, affected services can be quickly switched over to backup VMs. To enable flexible and efficient resource management, we propose to use a service-aware approach in which multiple correlated VMs and their backups are grouped together to form a Survivable Virtual Infrastructure (SVI) for a service or a tenant. A fundamental problem in such a system is to determine how to map each SVI to a physical data center network such that operational costs are minimized subject to the constraints that each VM's resource requirements are met and bandwidth demands between VMs can be guaranteed before and after failures. This problem can be naturally divided into two sub-problems: VM Placement(VMP) and Virtual Link Mapping (VLM). We present a general optimization framework for this mapping problem. Then we present an efficient algorithm for the VMP sub problem as well as a polynomial-time algorithm that optimally solves the VLM sub problem, which can be used as subroutines in the framework. We also present an effective heuristic algorithm that jointly solves the two sub problems. It has been shown by extensive simulation results based on the real VM data traces collected from the green data center at Syracuse University that compared with the First Fit Descending (FFD) and single shortest path based baseline algorithm, both our VMP+VLM algorithm and joint algorithm significantly reduce the reserved bandwidth, and yield comparable results in terms of the number of active servers.

关键词： Servers Bandwidth Heuristic algorithms Cloud computing Joining processes Virtual machining

来源：评论

学校读者我要写书评

暂无评论

Product Design Optimization With Simulation-Based Reliability Analysis

Product Design Optimization With Simulation-Based Reliabilit...

引用

2012 International Conference on Quality, Reliability, Risk, Maintenance, and Safety engineering & The 3rd International Conference on Maintenance engineering (2012质量,可靠性,风险,维修性及安全性工程国际会议(QR2MSE 2012 & ICME 2012))

作者： Rong Pan Xiaotian Zhuang Qing Sun School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe A Beijing Institute of Technology China Shenhua Huanghua harbor Administration Corp. Bohai New Area C

ISBN: (纸本)9781467307864

Evaluating probabilistic constraints plays a very important role in the reliability-based design optimization (RBDO).Traditional Monte Carlo simulation-based approach can provide a high accuracy but with low *** this paper,a subset simulation-based reliability analysis approach is provided to address the efficiency *** method is also compared with the typical MPP-based method.

关键词： reliability-based design optimization subset simulation,most probable point

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：