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

Design and evaluation of tabu search method for job scheduling in distributed environments

Design and evaluation of tabu search method for job scheduli...

10th Workshop on Advances in Parallel and Distributed Computational Models/22nd IEEE International Parallel and Distributed Processing Symposium

作者： Xhafa, Fatos Carretero, Javier Alba, Enrique Dorronsoro, Bernabe Dept. of Languages and Informatics Systems Polytechnic University of Catalonia Spain Dept. of Languages and Computer Science University of Málaga Spain Faculty of Science Technology and Communication University of Luxembourg Luxembourg Luxembourg

ISBN: (纸本)9781424416936

The efficient allocation of jobs to grid resources is indispensable for high performance grid-based applications. The scheduling problem is computationally hard even when there are no dependencies among jobs. Thus, we present in this paper a new tabu search (TS) algorithm for the problem of batch job scheduling on computational grids. We consider the job scheduling as a bi-objective optimization problem consisting of the minimization of the makespan and flowtime. The bi-objectivity is tackled through a hierarchic approach in which makespan is considered a primary objective and flowtime a secondary one. An extensive experimental study has been first conducted in order to fine-tune the parameters of our TS algorithm. Then, our tuned TS is compared versus two well known TS algorithms in the literature (one of them is hybridized with an ant colony optimization algorithm)for the problem. The computational results show that our TS implementation clearly outperforms the compared algorithms. Finally, we evaluated the performance of our TS algorithm on a new set of instances that better fits with the concept of computational grid. These instances are composed of a higher number of -heterogeneous- machines (up to 256) and emulate the dynamic behavior of these systems.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

Representing a web page as sets of named entities of multiple types - a model and-some preliminary applications 08

Representing a web page as sets of named entities of multipl...

引用

17th International Conference on World Wide Web 2008, WWW'08

作者： Di, Nan Yao, Conglei Duan, Mengcheng Zhu, Jonathan J.H. Li, Xiaoming Dept. of Computer Science and Technology Peking University Beijing 100871 China Dept. of Media and Communication City University of Hong Kong Kowloon Hong Kong State Key Laboratory of Advanced Optical Communication Systems and Networks Peking University Beijing 100871 China

ISBN: (纸本)9781605580852

As opposed to representing a document as a "bag of words" in most information retrieval applications, we propose a model of representing a web page as sets of named entities of multiple types. Specifically, four types of named entities are extracted, namely person, geographic location, organization, and time. Moreover, the relations among these entities are also extracted, weighted, classified and marked by labels. On top of this model, some interesting applications are demonstrated. In particular, we introduce a notion of person-activity, which contains four different elements: person, location, time and activity. With this notion and based on a reasonably large set of web pages, we are able to show how one person's activities can be attributed by time and location, which gives a good idea of the mobility of the person under question.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Representing and validating digital business processes

Representing and validating digital business processes

引用

作者： Bodenstaff, Lianne Ceravolo, Paolo Damiani, Ernesto Fugazza, Cristiano Reed, Karl Wombacher, Andreas Information Systems Group Dept. of Computer Science University of Twente Netherlands Dept. of Information Technologies Università degli Studi Milan Italy Computer Science Dept. LaTrobe University Melbourne Australia School of Computer and Communication Sciences École Polytechnique Fédérale de Lausanne China

来源：评论

学校读者我要写书评

暂无评论

A proposal for bandwidth consumption in FTTH networks in China

A proposal for bandwidth consumption in FTTH networks in Chi...

引用

2008 IEEE PhotonicsGlobal at Singapore, IPGC 2008

作者： Wei, Li Zhenrong, Zhang Linzhen, Xie State Key Laboratory of Advanced Optical Communication Systems and Networks Dept. of Electronics Peking University Beijing 100871 China School of Computer Electronics and Information Guangxi University Guangxi 530004 China

ISBN: (纸本)9781424429059

FTTH development is slow but steady in China. The phenomenon is rooted from some major challenges, such as cost, limited bandwidth in Metro networks, bandwidth consumption behaviours. To address above challenges, FTTH architectures and bandwidth consumption behaviours are studied in the paper. To remove the bandwidth bottleneck between access and Metro networks and reduce cost, LR-PON (Long-Reach Passive Optical Network) is suggested to be applied in two ways in China. For resolving the challenge of bandwidth exhaustion in Metro networks caused by high-capacity consumption in access networks, a new bandwidth scheduling, Bandwidth on Schedule (BoS) is proposed to improve efficiency of bandwidth utilization. In the paper, the proposed solutions to challenges will be helpful to increase the penetration rate of FTTH deployment in China.

关键词： Fiber to the x

来源：评论

学校读者我要写书评

暂无评论

Power efficient resilience and lifetime in wireless ad-hoc networks

Power efficient resilience and lifetime in wireless ad-hoc n...

引用

1st ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing 2008, FOWANC'08

作者： Berend, Daniel Segal, Michael Shpungin, Hanan Depts. of Mathematics and of Computer Science Ben-Gurion University of the Negev Beer-Sheva 84105 Israel Dept. of Communication Systems Engineering Ben-Gurion University of the Negev Beer-Sheva 84105 Israel Dept. of Computer Science Ben-Gurion University of the Negev Beer-Sheva 84105 Israel

ISBN: (纸本)9781605581491

The temporary and unfixed physical topology of a wireless ad-hoc network is determined by the distribution of the wireless nodes as well as the transmission power (range) assignment of each node. This paper studies asymmetric power assignments for which the induced communication graph is k-strongly connected, while minimizing the total energy assigned (which is NP-Hard) and maximizing the network lifetime. We show that our power assignment algorithm from [9] achieves a bicriteria approximation of (O(k). O(k √logn kα(n))) with high probability for the minimal total cost/maximal network (respectively) lifetime problem in the plane in the case of arbitrary battery charges. The same algorithm is an (O(k), O(l))-approximation in the case of uniform batteries. To the best of our knowledge, this is the first attempt to provide a bicriteria approximation factor for the total power assignment cost and the network lifetime under the k-fault resilience criterion. We provide some results for the linear power assignment algorithm in [30] as well. In addition, we extend the static algorithms above to support dynamic node insert/ delete operations in O(logn) time for the linear case and an expected O(k poly log n) amortized time in the plane. Copyright 2008 ACM.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

A new form of network coded cooperative transmission for multiple access channels

A new form of network coded cooperative transmission for mul...

引用

2008 IEEE Military communications Conference, MILCOM 2008 - Assuring Mission Success

作者： Ding, Zhiguo Leung, Kin K. Goeckel, Dennis L. Towsley, Don Department of Communication Systems Lancaster United Kingdom Electrical Engineering Department Imperial College London United Kingdom Dept. of Electrical and Computer Engineering University of Massachusetts Amherst MA United States Dept. of Computer Science University of Massachusetts Amherst MA United States

ISBN: (纸本)9781424426775

Recently cooperative diversity has received a lot of attention as an effective and low-cost technique to combat multipath fading and enhance transmission reliability. However, many existing cooperative protocols suffer some loss of ergodic capacity due to the extra bandwidth resource consumed by relay transmission. Motivated by such a fact, network coding, a technique well known for its capability to increase system throughput, is proposed in this paper to be combined with cooperative diversity for uplink transmissions. The dynamic nature of multipath propagation has been efficiently utilized by applying a distributed strategy of relay selection. Two kinds of information-theoretic metrics, outage and ergodic capacities, are developed for the proposed transmission scheme to assist performance evaluation. The developed analytical results, shown to fit well with Monte-Carlo simulation, demonstrate that the proposed protocol can achieve better system robustness and larger system throughput simultaneously than comparable schemes. ©2008 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Improving reliability in multi-hop body sensor networks

Improving reliability in multi-hop body sensor networks

引用

2nd International Conference on Sensor Technologies and Applications, SENSORCOMM 2008

作者： Braem, Bart Latré, Benoît Blondia, Chris Moerman, Ingrid Demeester, Piet PATS Research Group Dept. of Mathematics and Computer Science University of Antwerp - IBBT Middelheimlaan 1 B-2020 Antwerp Belgium Broadband Communication Networks Group Dept. of Information Technology Ghent University - IBBT Gaston Crommenlaan 8 bus 201 9050 Gent Belgium

ISBN: (纸本)9780769533308

Body Sensor networks are an interesting emerging application of wireless sensor networks to improve healthcare and the Quality of Life. Current research has mainly focused on single-hop networks, although some works clearly show advantages of multi-hop architectures. In this paper, we model probabilistic connectivity in such multi-hop body sensor networks. Instead of using a circular coverage area, a more accurate model is defined based on the path loss along the human body. Further, we propose improvements to CICADA, a cross-layer multi-hopprotocol that handles both medium access and the routing of data in BSNs. CICDA is slot-based and uses schemes to allocate these slots. Preliminary results for two reliability improvements are given: randomization of the schemes and repeating the schemes received from a parent node. We show that these improvements positively affect the throughput of the network and lead to fewer retransmissions. In both cases, the energy consumption of the nodes is hardly influenced. © 2008 IEEE.

关键词： Body sensor networks

来源：评论

学校读者我要写书评

暂无评论

Text knowledge mining: An alternative to text data mining

Text knowledge mining: An alternative to text data mining

引用

IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008

作者： Sánchez, D. Martin-Bautista, M.J. Blanco, I. De La Torre, C. Justicia Dept. Computer Science and A.I. University of Granada E.T.S.I.I.T. C/Periodista Daniel Saucedo Aranda s/n 18071 Granada Spain Center of Informatics and Communication Networks University of Granada 18071 Granada Spain

ISBN: (纸本)9780769535036

In this paper we introduced an alternative view of text mining and we review several alternative views proposed by different authors. We propose a classification of text mining techniques into two main groups: techniques based on inductive inference, that we call text data mining (TDM, comprising most of the existing proposals in the literature), and techniques based on deductive or abductive inference, that we call text knowledge mining (TKM). To our knowledge, the TKM view of text mining is new though, as we shall show, several existing techniques could be considered in this group. We discuss about the possibilities and challenges of TKM techniques. We also discuss about the application of existing theories in possible future research in this field. © 2008 IEEE.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

Representing and validating digital business processes

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2008年 4891卷 219-246页

作者： Bodenstaff, Lianne Ceravolo, Paolo Damiani, Ernesto Fugazza, Cristiano Reed, Karl Wombacher, Andreas Information Systems Group Dept. of Computer Science University of Twente Netherlands Dept. of Information Technologies Universit degli Studi Milan Italy Computer Science Dept LaTrobe University Melbourne Australia School of Computer and Communication Sciences Ecole Polytechnique F´ed´erale de Lausanne Switzerland

来源：评论

学校读者我要写书评

暂无评论

Space and Speed Tradeoffs in TCAM Hierarchical Packet Classification

Space and Speed Tradeoffs in TCAM Hierarchical Packet Classi...

引用

IEEE Princeton Section Sarnoff Symposium

作者： Alex Kesselman Kirill Kogan Sergey Nemzer Michael Segal Google Inc USA Cisco Systems Netanya Israel Communication Systems Engineering Dept. Ben Gurion University Beer-Sheva Israel School of Computer Science Tel Aviv University Israel Compugen Ltd. Tel Aviv Israel

Hierarchical packet classification is a crucial mechanism necessary to support many Internet services such as Quality of Service (QoS) provisioning, traffic policing, and network intrusion detection. Using Ternary Content Addressable Memories (TCAMs) to perform high-speed packet classification has become the de facto standard in industry. TCAMs compare packet headers against all rules in a classification database concurrently and thus provide high throughput unparalleled by software-based solutions. However, the complexity of packet classification policies have been growing rapidly as number of services deployed on the Internet continues to increase. High TCAM memory requirement for complex hierarchical policies is a major issue as TCAMs have very limited capacity. In this paper we consider two optimization problems of dual nature: the first problem is to minimize the number of TCAM entries subject to the constraint on the maximum number of levels in the policy hierarchy; the second problem is to minimize the number of levels in the policy hierarchy subject to the constraint on the maximum number of TCAM entries. We propose efficient dynamic programming algorithms for these problems, which reduce the TCAM memory requirement. To the best of our knowledge, this is the first work to study the fundamental tradeoff between the TCAM space and the number of lookups for hierarchical packet classification. Our algorithms do not require any modifications to existing TCAMs and are thus relatively easy to deploy.

关键词： Web and internet services Quality of service Telecommunication traffic Intrusion detection Associative memory Databases Throughput Constraint optimization Dynamic programming Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：