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

23rd International Joint Conference on Artificial Intelligence, IJCAI 2013

作者： Lee, Joohyung Lifschitz, Vladimir Yang, Fangkai School of Computing Informatics and Decision Systems Engineering Arizona State University United States Department of Computer Science Univeristy of Texas at Austin United States

ISBN: (纸本)9781577356332

The action description languages B and C have significant common core. Nevertheless, some expressive possibilities of B are difficult or impossible to simulate in C, and the other way around. The main advantage of B is that it allows the user to give Prolog-style recursive definitions, which is important in applications. On the other hand, B solves the frame problem by incorporating the commonsense law of inertia in its semantics, which makes it difficult to talk about fluents whose behavior is described by defaults other than inertia. In C and in its extension C+, the inertia assumption is expressed by axioms that the user is free to include or not to include, and other defaults can be postulated as well. This paper defines a new action description language, called BC, that combines the attractive features of B and C+. Examples of formalizing commonsense domains discussed in the paper illustrate the expressive capabilities of BC and the use of answer set solvers for the automation of reasoning about actions described in this language.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Discussion

引用

Journal of Quality Technology 2013年第3期45卷 233-235页

作者： RONG PAN School of Computing Informatics and Decision Systems Engineering Arizona State University

Click to increase image sizeClick to decrease image size

关键词： STATISTICS TESTING ACCELERATED life testing

来源：评论

学校读者我要写书评

暂无评论

Proxy based framework for personalized web service composition 11

Proxy based framework for personalized web service compositi...

引用

11th IEEE International Symposium on Autonomous Decentralized systems, ISADS 2013

作者： Xu, Ruzhi Ji, Baitao Chen, Yinong School of Computer Science and Technology Shandong University of Finance and Economics Jinan China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe United States

ISBN: (纸本)9781467350686

Service-oriented computing and Web services are becoming the dominating computing model as internet and cloud computing become pervasive. More and more services with the same functionality are becoming available, and QoS (Quality of Service) is the main factor to differentiate them. The overall QoS of a business process must meet user's requirement. Our study proposes a proxy-based framework to facilitate the dynamic integration of Web services into business process and fast detection of abnormalities. The major functions of our dynamic proxy-based framework include service collection, composition, selection and adaptation. Our study concerns both functionality and QoS characteristics of Web services to identify the optimal business process solutions.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Dimensionality Reduction Assisted Tensor Clustering

Dimensionality Reduction Assisted Tensor Clustering

引用

International Joint Conference on Neural Networks

作者： Yanfeng Sun Junbin Gao Xia Hong Yi Guo Chris J. Harris Beijing Municipal Key Lab of Multimedia and Intelligent Software Technology Beijing University of Technology School of Computing and Mathematics Charles Sturt University School of Systems Engineering University of Reading CSIRO Mathematics Informatics and Statistics Electronics and Computer Science University of Southampton

ISBN: (纸本)9781479914821

This paper is concerned with tensor clustering with the assistance of dimensionality reduction approaches. A class of formulation for tensor clustering is introduced based on tensor Tucker decomposition models. In this formulation, an extra tensor mode is formed by a collection of tensors of the same dimensions and then used to assist a Tucker decomposition in order to achieve data dimensionality reduction. We design two types of clustering models for the tensors: PCA Tensor Clustering model and Non-negative Tensor Clustering model, by utilizing different regularizations. The tensor clustering can thus be solved by the optimization method based on the alternative coordinate scheme. Interestingly, our experiments show that the proposed models yield comparable or even better performance compared to most recent clustering algorithms based on matrix factorization.

关键词： Tensor Tucker Decomposition Tensor Clustering Matrix Factorization Tensor PCA

来源：评论

学校读者我要写书评

暂无评论

Multi-tier energy buffering management for IDCs with heterogeneous energy storage devices

Multi-tier energy buffering management for IDCs with heterog...

引用

International Conference on High Performance computing

作者： Zahra Abbasi Madhurima Pore Ayan Banerjee Sandeep K. S. Gupta Informatics and Decision Systems Engineering School of Computing Tempe Arizona

Energy buffering, has been proposed to store renewable energy and low cost electricity in Energy Storage Devices (ESDs) and use it judiciously to reduce electricity bill in Internet data centers. Recent research have considered long term variation in electricity price, renewable power and workload and have shown the efficiency of energy buffering in reducing electricity bill. However, these aspects of data centers exhibit both long and short term variation. Further, there is inherent heterogeneity in ESD physical characteristics (e.g., charging and discharging rates). We hypothesize that a multi-tier energy buffering management can leverage the heterogeneity in ESD characteristics and better optimize utilization of renewable energy and low-cost power in presence of both short and long term variabilities in a data center. This paper proposes an analytical study of multi-tier workload and energy buffering management technique that frames each tier as an optimization problem and solves them in an online and proactive way using Receding Horizon Control (RHC). Our study shows that multi-tier energy buffering management increases the utilization of the renewables by upto two times compared to one-tier management.

关键词： Batteries Power demand Electrostatic discharges Renewable energy sources Servers Electricity

来源：评论

学校读者我要写书评

暂无评论

创建软件定义网络中的进程级纵深防御体系结构

引用

软件学报 2014年第10期25卷 2251-2265页

作者：崔竞松郭迟陈龙张雅娜 Dijiang HUANG 武汉大学计算机学院湖北武汉430072 软件工程国家重点实验室(武汉大学) 湖北武汉430072 武汉大学卫星定位导航技术研究中心湖北武汉430079 中山大学(珠海校区)移动信息工程学院广东珠海519000 School of Computing Informatics and Decision Systems Engineering Arizona State University AZ USA

云计算因其资源的弹性和可拓展性,在为用户提供各项服务时,相对于传统方式占据了先机.在用户考虑是否转向云计算时,一个极其重要的安全风险是:攻击者可以通过共享的云资源对云用户发起针对虚拟机的高效攻击.虚拟机作为云服务的基本资源... 详细信息

云计算因其资源的弹性和可拓展性,在为用户提供各项服务时,相对于传统方式占据了先机.在用户考虑是否转向云计算时,一个极其重要的安全风险是:攻击者可以通过共享的云资源对云用户发起针对虚拟机的高效攻击.虚拟机作为云服务的基本资源,攻击者在攻击或者租用了某虚拟机之后,通过在其中部署恶意软件,并针对云内其他虚拟机发起更大范围的攻击行为,如分布式拒绝服务型攻击.为防止此种情况的发生,提出基于软件定义网络的纵深防御系统,以及时检测可疑虚拟机并控制其发出的流量,抑制来自该虚拟机的攻击行为并减轻因攻击所受到的影响.该系统以完全无代理的非侵入方式检测虚拟机状态,且基于软件定义网络,对同主机内虚拟机间或云主机间的网络流量进行进程级的监控.实验结果表明了该系统的有效性.

关键词：无代理技术内网防火墙虚拟机纵深防御网络虚拟化软件定义网络

来源：评论

学校读者我要写书评

暂无评论

Randomized post-optimization for t-restrictions

引用

作者： Colbourn, Charles J. Nayeri, Peyman School of Computing Informatics and Decision Systems Engineering Arizona State University P.O. Box 878809 Tempe AZ 85287-8809 United States

ISBN: (纸本)9783642368981

Search, test, and measurement problems in sparse domains often require the construction of arrays in which every t or fewer columns satisfy a simply stated combinatorial condition. Such t-restriction problems often ask for the construction of an array satisfying the t-restriction while having as few rows as possible. Combinatorial, algebraic, and probabilistic methods have been brought to bear for specific t-restriction problems;yet in most cases they do not succeed in constructing arrays with a number of rows near the minimum, at least when the number of columns is small. To address this, an algorithmic method is proposed that, given an array satisfying a t-restriction, attempts to improve the array by removing rows. The key idea is to determine the necessity of the entry in each cell of the array in meeting the t-restriction, and repeatedly replacing unnecessary entries, with the goal of producing an entire row of unnecessary entries. Such a row can then be deleted, improving the array, and the process can be iterated. For certain t-restrictions, it is shown that by determining conflict graphs, entries that are necessary can nonetheless be changed without violating the t-restriction. This permits a richer set of ways to improve the arrays. The efficacy of these methods is demonstrated via computational results. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Constructing an Embodied Interaction for Concept Mapping

Constructing an Embodied Interaction for Concept Mapping

引用

15th International Conference on Human-Computer Interaction, HCI International 2013

作者： Danielescu, Andreea Savio-Ramos, Caroline Sadauskas, John School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ United States Mary Lou Fulton Teachers College Arizona State University Tempe AZ United States

ISBN: (纸本)9783642394751

Creating learning experiences that are meaningful and motivational is crucial in learning. Research demonstrates that effectively organizing ideas via concept maps allows students to view prior knowledge with new perspectives. Recently, embodied computation has emerged as an effective means of meeting educational objectives due to its intuitive, gesture-based control and to its promotion of associating knowledge with physical events. Unfortunately, a majority of systems tailored for such interaction are expensive prototypes. However, the release of depth cameras has brought embodied interaction into the commercial realm, allowing users' bodies to "become" controllers. This research presents a novel, low cost system that provides embodied interaction with a computer and depth camera, through which learners can create concept maps with gestures. Current work involves defining intuitive gestural controls. Future work will involve evaluating the system for use in a classroom with the aim to create opportunities to easily incorporate embodiment into collaborative learning. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Performance, energy characterizations and architectural implications of an emerging mobile platform benchmark suite - MobileBench

Performance, energy characterizations and architectural impl...

引用

IEEE International Workshop/Symposium on Workload Characterization

作者： Dhinakaran Pandiyan Shin-Ying Lee Carole-Jean Wu School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe Arizona

In this paper, we explore key microarchitectural features of mobile computing platforms that are crucial to the performance of smart phone applications. We create and use a selection of representative smart phone applications, which we call MobileBench that aid in this analysis. We also evaluate the effectiveness of current memory subsystem on the mobile platforms. Furthermore, by instrumenting the Android framework, we perform energy characterization for MobileBench on an existing Samsung Galaxy S III smart phone. Based on our energy analysis, we find that application cores on modern smart phones consume significant amount of energy. This motivates our detailed performance analysis centered at the application cores. Based on our detailed performance studies, we reach several key findings. (i) Using a more sophisticated tournament branch predictor can improve the branch prediction accuracy but this does not translate to observable performance gain. (ii) Smart phone applications show distinct TLB capacity needs. Larger TLBs can improve performance by an avg. of 14%. (iii) The current L2 cache on most smart phone platform experiences poor utilization because of the fast-changing memory requirements of smart phone applications. Using a more effective cache management scheme improves the L2 cache utilization by as much as 29.3% and by an avg. of 12%. (iv) Smart phone applications are prefetching-friendly. Using a simple stride prefetcher can improve performance across MobileBench applications by an avg. of 14%. (v) Lastly, the memory bandwidth requirements of MobileBench applications are moderate and well under current smart phone memory bandwidth capacity of 8.3 GB/s. With these insights into the smart phone application characteristics, we hope to guide the design of future smart phone platforms for lower power consumptions through simpler architecture while achieving high performance.

关键词： Radiation detectors Marine vehicles Smart phones Prefetching History

来源：评论

学校读者我要写书评

暂无评论

A heat kernel based cortical thickness estimation algorithm

A heat kernel based cortical thickness estimation algorithm

引用

3rd International Workshop on Multimodal Brain Image Analysis, MBIA 2013, Held in Conjunction with the 16th International Conference on Medical Image computing and Computer Assisted Intervention, MICCAI 2013

作者： Wang, Gang Zhang, Xiaofeng Su, Qingtang Chen, Jiannong Wang, Lili Ma, Yunyan Liu, Qiming Xu, Liang Shi, Jie Wang, Yalin School of Computer Science and Technology Ludong University China School of Computing Informatics and Decision Systems Engineering Arizona State University United States School of Physics and Photoelectric Ludong University China School of Mathematics and Statistics Science Ludong University China

ISBN: (纸本)9783319021256

Cortical thickness estimation in magnetic resonance imaging (MRI) is an important technique for research on brain development and neurodegenerative diseases. This paper presents a heat kernel based cortical thickness estimation algorithm, which is driven by the graph spectrum and the heat kernel theory, to capture the grey matter geometry information in the in vivo brain MR images. First, we use the harmonic energy function to establish the tetrahedral mesh matching with the MR images and generate the Laplace-Beltrami operator matrix which includes the inherent geometric characteristics of the tetrahedral mesh. Second, the isothermal surfaces are computed by the finite element method with the volumetric Laplace-Beltrami operator and the direction of the steamline is obtained by tracing the maximum heat transfer probability based on the heat kernel diffusion. Thereby we can calculate the cerebral cortex thickness information between the point on the outer surface and the corresponding point on the inner surface. The method relies on intrinsic brain geometry structure and the computation is robust and accurate. To validate our algorithm, we apply it to study the thickness differences associated with Alzheimer's disease (AD) and mild cognitive impairment (MCI) on the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset. Our preliminary experimental results in 151 subjects (51 AD, 45 MCI, 55 controls) show that the new algorithm successfully detects statistically significant difference among patients of AD, MCI and healthy control subjects. The results also indicate that the new method may have better performance than the Freesurfer software. © 2013 Springer International Publishing.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：