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

Coverage-maximization in networks under resource constraints

Physical Review E 2010年第6期81卷 061124-061124页

作者： Subrata Nandi Lutz Brusch Andreas Deutsch Niloy Ganguly Department of Computer Science and Engineering Indian Institute of Technology Kharagpur 721302 India Center for Information Services and High Performance Computing Technical University Dresden 01062 Dresden Germany

Efficient coverage algorithms are essential for information search or dispersal in all kinds of networks. We define an extended coverage problem which accounts for constrained resources of consumed bandwidth B and time T. Our solution to the network challenge is here studied for regular grids only. Using methods from statistical mechanics, we develop a coverage algorithm with proliferating message packets and temporally modulated proliferation rate. The algorithm performs as efficiently as a single random walker but O(B(d−2)/d) times faster, resulting in significant service speed-up on a regular grid of dimension d. The algorithm is numerically compared to a class of generalized proliferating random walk strategies and on regular grids shown to perform best in terms of the product metric of speed and efficiency.

关键词： Statistical mechanics

来源：评论

学校读者我要写书评

暂无评论

CAWD: A Tool for Designing Context-aware Workflows

CAWD: A Tool for Designing Context-aware Workflows

引用

The 2nd International Conference on Software Engineering and Data Mining(IEEE 第二届国际软件工程和数据挖掘学术大会 SEDM 2010)

作者： Abu Zafar Abbasi Muhammad Uzair Ahsan Zubair Ahmed Shaikh Zafar Nasir Department of Computer Science National University of Computer & Emerging Sciences Karachi Pakistan Center for Research in Ubiquitous Computing National University of Computer & Emerging Sciences Kara Department of Computer Science National University of Computer & Emerging Sciences Karachi Pakistan

ISBN: (纸本)9781424473243;9788988678220;9788988678213

Workflow technology has recently been introduced in pervasive and mobile computing due to its inherent capabilities of task coordination and interoperability among heterogeneous resources. Pervasive and mobile applications require context i.e. situation information for adaptation to efficiently achieve goals. Current workflow designers are very useful in designing rigid or evolving process models but provide little or no support for designing context aware workflows. CAWD is a tool that supports design of context aware workflows by providing means for integration and inference of context in workflow models and also provides strategies for dynamic selection, addition or deletion of activities or services. This tool is developed on top of workflow foundation. NET 3.5 and can be used as a standalone application for designing and verifying the developed context aware workflow models. In this paper we describe the architecture and implementation details of this tool supported by an example scenario.

关键词： Context-awareness context-aware workflows workflow designer pervasive computing

来源：评论

学校读者我要写书评

暂无评论

Studying the impact of synchronization frequency on scheduling tasks with dependencies in heterogeneous systems

Studying the impact of synchronization frequency on scheduli...

引用

作者： Andronikos, Theodore Ciorba, Florina M. Riakiotakis, Ioannis Papakonstantinou, George Chronopoulos, Anthony T. Department of Informatics Ionian University Corfu Greece Computing Systems Laboratory Department of Electrical and Computer Engineering National Technical University of Athens Greece Center for Advanced Vehicular Systems Mississippi State University MS United States Department of Computer Science University of Texas at San Antonio 6900 N. Loop 1604 West San Antonio TX 78249 United States

In this work, we develop and evaluate a theoretical model, which we then use to study the impact of the synchronization frequency on the performance of dynamic self-scheduling algorithms. These algorithms are used to parallelize loops with data dependencies on heterogeneous systems. The proposed model uses a formula to estimate the parallel time as a function of the synchronization frequency. Inter-node communication has been proven to be the dominant factor for the performance degradation of applications containing loops with data dependencies. The synchronization mechanism therefore requires careful fine-tuning in order to give the best possible performance. The proposed model determines the optimal synchronization frequency that results in the minimum parallel time. We use this model to study the impact of the synchronization frequency on the parallel execution of a computational kernel from image processing. For this kernel, the synchronization frequency giving the minimum parallel time predicted by our theoretical model was very close to the synchronization frequency giving the least parallel time in practice. We validate our model by extensive comparisons of the theoretically predicted parallel time and synchronization frequency against those obtained from practical experiments. The comparisons show that the proposed model is highly accurate, its predictions for the optimal synchronization frequency being within 0.0250% of the experimentally optimal synchronization frequency in the best case, and within 0.1750% of the experimentally optimal synchronization frequency in the worst case. Finally, the comparisons show that the proposed model improves on a previously existing model in heterogeneous systems, whereas it gives similar results in homogeneous systems. © 2010 Elsevier B.V. All rights reserved.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Using Web-scale N-grams to Improve Base NP Parsing Performance

Using Web-scale N-grams to Improve Base NP Parsing Performan...

引用

计算语言学第23届国际学术会议

作者： Emily Pitler Shane Bergsma Kenneth Church Computer and Information Science University of Pennsylvania Department of Computing Science University of Alberta Human Language Technology Center of Excellence Johns Hopkins University

We use web-scale N-grams in a base NP parser that correctly analyzes 95.4%of the base NPs in natural ***-scale data improves *** is,there is no data like more *** scales log-linearly with the number of parameters in the model(the number of unique N-grams).The web-scale N-grams are particularly helpful in harder cases,such as NPs that contain conjunctions.

关键词： Using Web-scale N-grams to Improve Base NP Parsing Performance Web

来源：评论

学校读者我要写书评

暂无评论

Test case generation for adequacy of floating-point to fixed-point conversion

Test case generation for adequacy of floating-point to fixed...

引用

作者： Pham, Tuan-Hung Truong, Anh-Hoang Chin, Wei-Ngan Aoshima, Takenobu Department of Software Engineering College of Technology Vietnam National University Hanoi 144 Xuan Thuy Hanoi Viet Nam Department of Computer Science School of Computing National University of Singapore 3 Science Drive 2 Singapore 117543 Singapore Panasonic RandD Center Vietnam No. 1 Lang-Hoa Lac Hanoi Viet Nam

Porting an application written for personal computer to embedded devices requires conversion of floating-point numbers and operations into fixed-point ones. Testing the conversion hence requires the latter be as close as possible to the former. The closeness is orthogonal to code coverage and requires different strategies to generate a test suite that reveals the gap between the two functions. We introduce a new test adequacy criterion and propose several metrics to quantify the closeness of two functions. After that we propose a method to generate a better test suite from a given one for the test adequacy criteria. We also show experimental results on some well-known mathematical functions. © 2010 Elsevier B.V.

关键词： Personal computers

来源：评论

学校读者我要写书评

暂无评论

Digesting online multimedia presentation archives based on visual effects

Digesting online multimedia presentation archives based on v...

引用

5th International Conference on P2P, Parallel, Grid, Cloud and Internet computing, 3PGCIC 2010

作者： Watanabe, Yousuke Wu, Yi Yokota, Haruo Global Scientific Information and Computing Center Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8552 Japan Department of Computer Science Graduate School of Information Science Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8552 Japan

ISBN: (纸本)9780769542379

Online video archives provide a large amount of multimedia presentation contents through the Internet. But, it takes a long time to find what they really want to watch from a lot of presentation videos. We have been developing a system to summarize multiple presentation contents that match given keywords. In this paper, we intends to obtain a interesting digest including visually attractive scenes instead of generating a sketch of presentation contents. We propose methods to calculate the importance of scenes by considering color distribution and animation occurrence. Finally, we evaluate the effectiveness of the proposed methods. © 2010 IEEE.

关键词： Multimedia services

来源：评论

学校读者我要写书评

暂无评论

Supervised reinforcement learning in discrete environment domains

Supervised reinforcement learning in discrete environment do...

引用

World Congress on Nature & Biologically Inspired computing (NaBIC)

作者： Boris Jensen Daniel Ortiz-Arroyo Nareli Cruz-Cortés Francisco Rodríguez-Henríquez Department of Electronic Systems Aalborg University Denmark Center for Computing Research National Polytechnic Institute Mexico Center for Computing Research National Politechnique Institute Mexico Computer Science Department CINVESTAV-IPN Mexico

This paper describes a supervised reinforcement learning-based model for discrete environment domains. The model was tested within the domain of backgammon game. Our results show that a supervised actor-critic based learning model is capable of improving the initial performance and then eventually reach similar performance levels as those obtained by TD-Gammon, an artificial neural network player (ANN) trained by temporal differences.

关键词： Variable speed drives Computational modeling Games Encoding

来源：评论

学校读者我要写书评

暂无评论

SWISE: Semantic Web based intelligent search engine

SWISE: Semantic Web based intelligent search engine

引用

International Conference on Information and Emerging Technologies, ICIET

作者： Faizan Shaikh Usman A. Siddiqui Iram Shahzadi Syed I. Jami Zubair A. Shaikh Department of Computer Science National University of Computer and Emerging Sciences Karachi Pakistan Center for Research in Ubiquitous Computing National University of Computer and Emerging Sciences Karachi Pakistan

Most of the search engines search for keywords to answer the queries from users. The search engines usually search web pages for the required information. However they filter the pages from searching unnecessary pages by using advanced algorithms. These search engines can answer topic wise queries efficiently and effectively by developing state-of-art algorithms. However they are vulnerable in answering intelligent queries from the user due to the dependence of their results on information available in web pages. The main focus of these search engines is solving these queries with close to accurate results in small time using much researched algorithms. However, it shows that such search engines are vulnerable in answering intelligent queries using this approach. They either show inaccurate results with this approach or show accurate but (could be) unreliable results. With the keywords based searches they usually provide results from blogs (if available) or other discussion boards. The user cannot have a satisfaction with these results due to lack of trusts on blogs etc. To get the trusted results search engines require searching for pages that maintain such information at some place. This requires including domain knowledge in the web pages to help search engines in answering intelligent queries. The layered model of Semantic Web provides solution to this problem by providing tools and technologies to enable machine readable semantics in current web contents.

关键词： Search engines Ontologies Semantics Resource description framework Web pages

来源：评论

学校读者我要写书评

暂无评论

Generating synthetic meta-data for georeferenced video management 10

Generating synthetic meta-data for georeferenced video manag...

引用

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems

作者： Ay, Sakire Arslan Kim, Seon Ho Zimmermann, Roger Department of Computer Science University of Southern California Los Angeles CA 90089 United States Integrated Media Systems Center University of Southern California Los Angeles CA 90089 United States School of Computing National University of Singapore Singapore 117417 Singapore

ISBN: (纸本)9781450304283

Recently various sensors, such as GPS and compass devices, can be cost-effectively manufactured and this allows their deployment in conjunction with mobile video cameras. Hence, recorded clips can automatically be annotated with geospa-tial information and the resulting georeferenced videos may be used in various Geographic Information System (GIS) applications. However, the research community is lacking large-scale and realistic test datasets of such sensor-fused information to evaluate their techniques since collecting real-world test data requires considerable time and effort. To fill this void, we propose an approach for generating synthetic video meta-data with realistic geospatial properties for mobile video management research. We highlight the essential aspects of the georeferenced video meta-data and present an approach to simulate the behavioral patterns of mobile cameras in the synthetic data. The data generation process can be customized through user parameters for a variety of GIS applications that use mobile videos. We demonstrate the feasibility and applicability of the proposed approach by providing comparisons with real-world data. © 2010 ACM.

关键词： Geographic information systems

来源：评论

学校读者我要写书评

暂无评论

Textual Entailment and anaphora resolution

Textual Entailment and anaphora resolution

引用

International Conference on Advanced computer Theory and Engineering, ICACTE

作者： Partha Pakray Sivaji Bandyopadhyay Alexander Gelbukh Computer Science & Engineering Department Jadavpur University Kolkata India Center of Computing Research National Polytechnic Institute Mexicali Mexico

Textual entailment has been recently defined as a common solution for modeling language variability in different NLP tasks. Textual Entailment is formally defined as a relationship between a coherent text T and a language expression, the hypothesis H. T is said to entail H (T → H) if the meaning of H can be inferred from the meaning of T. An entailment function e(T,H) thus maps an entailment pair T-H to a true value (i.e., true if the relationship holds, false otherwise). Alternatively, e(T,H) can be also intended as a probabilistic function mapping the pair T-H to a real value between 0 and 1, expressing the confidence with which a human judge or an automatic system estimate the relationship to hold.

关键词： Probabilistic logic Pragmatics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：