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

5th IEEE International Symposium on Service-Oriented System Engineering, SOSE 2010

作者： Yu, Lian Tsai, Wei-Tek Chen, Xiangji Liu, Linqing Zhao, Yan Tang, Liangjie Zhao, Wei School of Software and Microelectronics Peking University China School of Computing Informatics Decision Systems Engineering Department of Computer Science and Engineering Arizona State University United States Deparment of Computer Science and Technology Tsinghua University Beijing China China Research Center IBM Beijing 100094 China

ISBN: (纸本)9780769540818

Testing-as-a-service (TaaS) is a new model to provide testing capabilities to end users. Users save the cost of complicated maintenance and upgrade effort, and service providers can upgrade their services without impact on the end-users. Due to uneven volumes of concurrent requests, it is important to address the elasticity of TaaS platform in a cloud environment. Scheduling and dispatching algorithms are developed to improve the utilization of computing resources. We develop a prototype of TaaS over cloud, and evaluate the scalability of the platform by increasing the test task load;analyze the distribution of computing time on test task scheduling and test task processing over the cloud;and examine the performance of proposed algorithms by comparing others. © 2010 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Combining rule induction and reinforcement learning: An agent-based vehicle routing

Combining rule induction and reinforcement learning: An agen...

引用

9th International Conference on Machine Learning and Applications, ICMLA 2010

作者： Śniezyński, Bartlomiej Wójcik, Wojciech Gehrke, Jan D. Wojtusiak, Janusz Department of Computer Science AGH University of Science and Technology Krakow Poland Center for Computing and Communication Technologies - TZI Universität Bremen Bremen Germany Machine Learning and Inference Laboratory George Mason University Fairfax VA United States

ISBN: (纸本)9780769543000

Reinforcement learning suffers from inefficiency when the number of potential solutions to be searched is large. This paper describes a method of improving reinforcement learning by applying rule induction in multi-agent systems. Knowledge captured by learned rules is used to reduce search space in reinforcement learning, allowing it to shorten learning time. The method is particularly suitable for agents operating in dynamically changing environments, in which fast response to changes is required. The method has been tested in transportation logistics domain in which agents represent vehicles being routed in a simple road network. Experimental results indicate that in this domain the method performs better than traditional Q-learning, as indicated by statistical comparison. © 2010 IEEE.

关键词： Intelligent agents

来源：评论

学校读者我要写书评

暂无评论

A conceptual framework for the development of applications centred on context and evidence-based practice

A conceptual framework for the development of applications c...

引用

作者： Lopes, Expedito Carlos Schiel, Ulrich Vieira, Vaninha Salgado, Ana Carolina Computing and Systems Department Federal University of Campina Grande Campina Grande Brazil Computer Science Department Federal University of Bahia Salvador Brazil Informatics Center Federal University of Pernambuco Salvador Brazil

ISBN: (纸本)9789898425065

Conceptual frameworks are used to present a preferred approach to an idea or thought. Its use considerably facilitates the productivity of the data modelling phase and hence the development of applications, since it preserves portability and usability across domains. Evidence-Based Practice (EBP), usually employed in Medicine, represents a decision-making process centered on justifications of relevant information. EBP is used in several areas;however, we did not found conceptual models involving EBP that preserves portability and usability across domains. Besides, the decision-making context can have an impact on evidence-based decision-making, but the integration of evidence and context is still an open issue. This work presents a conceptual framework that integrates evidence with context applying it to the conceptual modelling phase for EBP domains. The use of context allows filtering out more useful information. The main contributions of this paper are: incorporation of contextual information into EBP procedures and presentation of the proposed conceptual framework. Also an implementation that uses the filtering of contextual information to support evidence-based decision making in the area of crime prevention is presented to validate the framework.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

PerfExpert: An easy-to-use performance diagnosis tool for HPC applications 10

PerfExpert: An easy-to-use performance diagnosis tool for HP...

引用

Proceedings of the 2010 ACM/IEEE International Conference for High Performance computing, Networking, Storage and Analysis

作者： Burtscher, Martin Kim, Byoung-Do Diamond, Jeff McCalpin, John Koesterke, Lars Browne, James Institute for Computational Engineering and Sciences University of Texas Austin United States Texas Advanced Computing Center University of Texas Austin United States Department of Computer Science University of Texas Austin United States

ISBN: (纸本)9781424475575

HPC systems are notorious for operating at a small fraction of their peak performance, and the ongoing migration to multi-core and multi-socket compute nodes further complicates performance optimization. The readily available performance evaluation tools require considerable effort to learn and utilize. Hence, most HPC application writers do not use them. As remedy, we have developed PerfExpert, a tool that combines a simple user interface with a sophisticated analysis engine to detect probable core, socket, and node-level performance bottlenecks in each important procedure and loop of an application. For each bottleneck, PerfExpert provides a concise performance assessment and suggests steps that can be taken by the programmer to improve performance. These steps include compiler switches and optimization strategies with code examples. We have applied PerfExpert to several HPC production codes on the Ranger supercomputer. In all cases, it correctly identified the critical code sections and provided accurate assessments of their performance. © 2010 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Towards mechanical derivation of Krylov solver libraries

引用

Procedia computer science 2010年第1期1卷 1805-1813页

作者： Victor Eijkhout Paolo Bientinesi Robert van de Geijn Texas Advanced Computing Center The University of Texas at Austin RWTH-Aachen Germany Department of Computer Science The University of Texas at Austin

来源：评论

学校读者我要写书评

暂无评论

Privacy-aware regression modeling of participatory sensing data 10

Privacy-aware regression modeling of participatory sensing d...

引用

8th ACM International Conference on Embedded Networked Sensor Systems, SenSys 2010

作者： Ahmadi, Hossein Pham, Nam Ganti, Raghu Abdelzaher, Tarek Nath, Suman Han, Jiawei Department of Computer Science University of Illinois at Urbana-Champaign United States IBM T. J. Watson Research Center United States Networked Embedded Computing Group Microsoft Research United States

ISBN: (纸本)9781450303446

Many participatory sensing applications use data collected by participants to construct a publicmodel of a system or phenomenon. For example, a health application might compute a model relating exercise and diet to amount of weight loss. While the ultimately computed model could be public, the individual input and output data traces used to construct it may be private data of participants (e.g., their individual food intake, lifestyle choices, and resulting weight). This paper proposes and experimentally studies a technique that attempts to keep such input and output data traces private, while allowing accurate model construction. This is significantly different from perturbation-based techniques in that no noise is added. The main contribution of the paper is to show a certain data transformation at the client side that helps keeping the client data private while not introducing any additional error to model construction. We particularly focus on linear regression models which are widely used in participatory sensing applications. We use the data set from a map-based participatory sensing service to evaluate our scheme. The service in question is a green navigation service that constructs regression models from participant data to predict the fuel consumption of vehicles on road segments. We evaluate our proposed mechanism by providing empirical evidence that: i) an individual data trace is generally hard to reconstruct with any reasonable accuracy, and ii) the regression model constructed using the transformed traces has a much smaller error than one based on additive dataperturbation schemes. Copyright 2010 ACM.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Exploring load balancing in heterogeneous networks by rate distribution

引用

International Journal of Autonomous and Adaptive Communications Systems 2010年第3期3卷 284-307页

作者： Haldar, Kuheli Louha Jun, Jung-Hyun Oliveira, Talmai Agrawal, Dharma P. Department of Computer Science Center for Distributed and Mobile Computing University of Cincinnati Cincinnati OH 45221-0030 United States

In a heterogeneous wireless network (HWN), traffic is distributed primarily by grouping and channelling identical traffic through a particular access point. In this paper, we introduce an effective traffic load balancing scheme for maximising expected throughput in HWNs. Two scenarios are explored. First, we model multiple APs of a HWN as a cascade of independent M/M/1 queues. The expected number of packets in the system is formulated as a convex optimisation problem and solved using a Lagrange multiplier. A recursive approach is used in distributing the traffic to different APs. Then, we model multiple APs as a union of multiple M/M/1 and M/D/1 queues. Here, we minimise the time spent by each job in the system. We use a solver to obtain optimal rate distribution among the networks. Through extensive simulations, we show that distributing the traffic optimally outperforms existing traditional methods of grouping and channelling similar kind of traffic. Copyright © 2010 Inderscience Enterprises Ltd.

关键词： Lagrange multipliers

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Density-Based Outlier Detection

Privacy Preserving Density-Based Outlier Detection

引用

WRI International Conference on Communications and Mobile computing, CMC

作者： Zaisheng Dai Liusheng Huang Youwen Zhu Wei Yang National High Performance Computing Center Department of Computer Science and Technology University of Science and Technology Hefei China

ISBN: (纸本)9781424463275

Outlier detection can find its tremendous applications in areas such as intrusion detection, fraud detection, and image processing. Among many outlier detection algorithms, LOF is a very important density-based algorithm in which one critical step is to find the k-distance neighbors. In some privacy preserving circumstances, the cooperation between data holders is necessary while the privacy of the participators should be guaranteed. In this paper, we focus on privacy preserving LOF. We propose a novel algorithm for privacy preserving k-distance neighbors search. Combining it with other secure multiparty computation techniques, we detect outliers by LOF in a privacy preserving way.

关键词： Data privacy Detection algorithms Data mining Intrusion detection Image processing Mobile communication Mobile computing Quantum computing High performance computing computer science

来源：评论

学校读者我要写书评

暂无评论

Fixed-parameter tractable combinatorial algorithms for metabolic networks alignments

Fixed-parameter tractable combinatorial algorithms for metab...

引用

10th IEEE International Conference on Data Mining Workshops, ICDMW 2010

作者： Cheng, Qiong Wei, Jinpeng Zelikovsky, Alexander Ogihara, Mitsunori Department of Computer Science Center for Computational Science University of Miami 1365 Memorial Drive Coral Gables FL 33146-4245 United States School of Computing and Information Science Florida International University ECS 354 11200 SW 8th St. Miami FL 33199 United States Department of Computer Science Georgia State University Atlanta GA 30303 United States

ISBN: (纸本)9780769542577

The accumulation of high-throughput genomic and proteomic data allows for the reconstruction of the increasingly large and complex metabolic networks. In order to analyze accumulated data and reconstructed networks, it is critical to identify network patterns and evolutionary relations between metabolic networks. But even finding similar networks is computationally challenging. Based on the property of gene duplication and function sharing in biological network, we have formulated the network alignment problem which asks the optimal vertex-to-vertex mapping allowing path contraction, vertex deletion, and vertex insertions. In this paper we present fixed parameter tractable combinatorial algorithms, which take into account the enzymes' functions and the similarity of arbitrary network topologies such as trees and arbitrary graphs wit hallowing the different types of vertex deletions. The proposed algorithms are fixed parameter tractable in the liner or square of the size of feedback vertex set respectively for the case of disallowing or allowing the deletions. We have developed the web service tool MetNetAligner which aligns metabolic networks. We evaluated our results by the randomizedP-Value computation. In the computation, we followed two standard randomization procedures and further developed two other random graph generators which keep the more stringent and consistent topology constraints. By comparing their distribution of the significant alignment pairs, we observed that the more stringent constraints in the topology the random graph generator has, the more pairs of significant alignments there exist. We also performed pair wise mapping of all pathways for four organisms and found a set of statistically significant pathway similarities. We have applied the network alignment to identifying pathway holes which are resulted by inconsistency and missing enzymes. MetNetAligner is available at http://\\***:8080/MinePW/pages/gmapping/*** Two rand

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Heralding single photons without spectral factorability

引用

Physical Review A 2010年第4期82卷 043826-043826页

作者： Yu-Ping Huang Joseph B. Altepeter Prem Kumar Department of Electrical Engineering & Computer Science Center for Photonic Communication and Computing Northwestern University 2145 Sheridan Road Evanston Illinois 60208-3118 USA

Recent efforts to produce single photons via heralding have relied on creating spectrally factorable two-photon states in order to achieve both high purity and high production rate. Through a careful multimode analysis, we find, however, that spectral factorability is not necessary. Utilizing single-mode detection, a similar or better performance can be achieved with nonfactorable states. This conclusion rides on the fact that even when using a broadband filter, a single-mode measurement can still be realized, as long as the coherence time of the triggering photons exceeds the measurement window of the on-off detector.

关键词： Photons

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：