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

A routing strategy for metropolis vehicular communications

International Conference on Information Networking, ICOIN 2004

作者： Liu, Genping Lee, Bu-Sung Seet, Boon-Chong Foh, Chuan-Heng Wong, Kai-Juan Lee, Keok-Kee Centre for Multimedia and Network Technology School of Computer Engineering Singapore Network Technology Research Centre Research TechnoPlaza Nanyang Technological University 4th Storey Nanyang Avenue 639798 Singapore Institute for Computing Systems Architecture Informatics University of Edinburgh JCMB Mayfield Road EdinburghEH9 3JZ United Kingdom

ISBN: (纸本)3540230343

One of the major issues that affect the performance of mobile ad hoc networks (MANET) is routing. Recently, position-based routing for MANET is found to be a very promising routing strategy for inter-vehicular communication systems (IVCS). However, position-based routing for IVCS in a built-up city environment faces greater challenges because of potentially more uneven distribution of vehicular nodes, constrained mobility, and difficult signal reception due to radio obstacles such as high-rise buildings. This paper proposes a new position-based routing scheme called Anchor-based Street and Traffic Aware Routing (A-STAR), designed specifically for IVCS in a city environment. Unique to A-STAR is the usage of information on city bus routes to identify an anchor path with high connectivity for packet delivery. Along with a new recovery strategy for packets routed to a local maximum, the proposed protocol shows significant performance improvement in a comparative simulation study with other similar routing approaches. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Stars

来源：评论

学校读者我要写书评

暂无评论

Performance of new broadcast forwarding criteria in MANET

引用

International Conference on Information Networking, ICOIN 2004

作者： Zhu, Lijuan Lee, Bu-Sung Seet, Boon-Chong Wong, Kai-Juan Liu, Genping Huang, Shell-Ying Lee, Keok-Kee Centre for Multimedia and Network Technology School of Computer Engineering Singapore Network Technology Research Centre Research TechnoPlaza Nanyang Technological University 4th Storey Nanyang Avenue 639798 Singapore Institute for Computing Systems Architecture Informatics University of Edinburgh JCMB Mayfield Road EdinburghEH9 3JZ United Kingdom

ISBN: (纸本)3540230343

In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce in MANET environment. The problem is to find the ideal forward node set so as to minimize the bandwidth consumed, which is a NP-Complete problem. In this paper we will investigate three dominant node approximation algorithms: dominant pruning, total dominant pruning and partial dominant pruning algorithm. An extension to the original algorithms, modified termination criteria, is proposed. Simulation results show that the new termination criteria ensure the same coverage using a reduced number of forward nodes. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Preface 4th

引用

4th International Conference on Rough Sets and Current Trends in computing, RSCTC 2004

作者： Tsumoto, Shusaku Slowiski, Roman Komorowski, Jan Grzymala-Busse, Jerzy W. Shimane University School of Medicine Department of Medical Informatics 89-1 Enya-cho Izumo Shimane Japan Poznan University of Technology Institute of Computing Science Piotrowo 3a Poznan Poland Uppsala University The Linnaeus Centre for Bioinformatics BMC Box 598 Husargatan 3 Uppsala Sweden University of Kansas Department of Electrical Engineering and Computer Science LawrenceKS United States

来源：评论

学校读者我要写书评

暂无评论

Enhancing performance of the IEEE 802.11 distributed coordination function via packet bursting

Enhancing performance of the IEEE 802.11 distributed coordin...

引用

IEEE Globecom Workshops

作者： V. Vitsas P. Chatzimisios A.C. Boucouvalas P. Raptis K. Paparrizos D. Kleftouris Department of Information Technology Technological Education Institute Thessaloniki Greece Multimedia Communications Research Group School of Design Engineering and Computing Bournemouth University Poole UK Department of Applied Informatics University of Macedonia Thessaloniki Greece

During the past few years, wireless local area networks (WLANs) have become extremely popular. The IEEE 802.11 protocol is the dominating standard for WLANs employing the distributed coordination function (DCF) as its essential medium access control (MAC) mechanism. This paper presents a simple and accurate analysis using Markov chain modelling to compute IEEE 802.11 DCF performance, in the absence of hidden stations and transmission errors. This mathematical analysis calculates in addition to the throughput efficiency, the average packet delay and the packet drop probability for both the basic access and RTS/CTS medium access schemes. The derived analysis, which takes into account packet retry limits, is validated by comparison with OPNET simulation results. The mathematical model is used to study the effectiveness of the RTS/CTS scheme at high data rates and the performance improvements of transmitting a burst of packets after winning the contention for medium access. Packet bursting considerably increases both throughput and packet delay performance but lowers the short-term fairness on medium access.

关键词： Media Access Protocol Throughput Delay Wireless LAN Access protocols Performance analysis Mathematical analysis Probability Analytical models Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Robust object matching using a modified version of the hausdorff measure

引用

International Journal of Image and Graphics 2002年第3期2卷 361-373页

作者： Wang, Yaming Baciu, George School of Informatics and Electronics Zhejiang Institute of Science and Technology 88 Wenyi Road Hangzhou310033 China GAMA Laboratory Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong

The Hausdorff distance (HD) between planar sets of points is known to be an effective measure for determining the degree of resemblance between binary images. In this paper, we analyze the conventional HD measure and propose a new Robust HD (RHD) measure. The proposed RHD measure takes into account not only the location information of the edge points, but also other factors such as the total number of the edge points whose nearest neighbors are within a specified directed distance, spurious edge segments defined by a small number of points, outliers, and occlusions. Experimental results for both synthetic and real images show that the proposed RHD measure is more efficient than the conventional HD measure. © 2002 World Scientific Publishing Company.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

Games with a uniqueness property 19

引用

19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002

作者： Aida, Shin Crasmaru, Marcel Regan, Kenneth Watanabe, Osamu Graduate School of Human Informatics Nagoya Univ Japan Dept. of Mathematical and Computing Sciences Tokyo Institute of Technology Japan Dept. of Computer Science State Univ. of New York Buffalo United States

ISBN: (纸本)9783540432838

For two-player games of perfect information such as Chess, we introduce "uniqueness" properties to describe game positions in which a winning strategy (should one exist) is forced to be unique. Depending on how uniqueness is forced, and whether it applies to both players, the uniqueness property is classified as (bi-) weak, (bi-) strong, or global. We prove that any reasonable two-player game G is extendable to a game G∗ with the bi-strong uniqueness property, so that e.g., QBF remains PSPACE-complete under this restriction. For global uniqueness, we introduce a simple game GUPQBF over Boolean formulas with this property, and prove that any reasonable two-player game with global uniqueness is reducible to this game. On the other hand, we also show that GUPQBF resides in "small" counting classes believed properly contained in PSPACE. Our results give a new characterization to some complexity classes such as PSPACE and EXPTIME. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems 18th

引用

18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001

作者： Aida, Shin Schuler, Rainer Tsukiji, Tatsuie Watanabe, Osamu School of Informatics Sciences Nagoya University Nagoya464-8601 Japan Dept. of Mathematical and Computing Sciences Tokyo Institute of Technology Tokyo152-8552 Japan

ISBN: (纸本)9783540416951

In this paper we separate many-one reducibility from truth-table reducibility for distributional problems in DistNP under the hypothesis that P ≠ NP. As a first example we consider the 3-Satisfiability problem (3SAT) with two different distributions on 3CNF formulas. We show that 3SAT using a version of the standard distribution is truth-table reducible but not many-one reducible to 3SAT using a less redundant distribution unless P = NP. We extend this separation result and define a distributional complexity class C with the following properties: (1) C is a subclass of DistNP, this relation is proper unless P = NP. (2) C contains DistP, but it is not contained in AveP unless DistNP Í AveZPP. (3) C has a £mp-complete set. (4) C has a £ttp-complete set that is not £mp-complete unless P = NP. This shows that under the assumption that P 6 ≠ NP, the two completeness notions differ on some non-trivial subclass of DistNP. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Achieving a world-wide Software Engineering Profession: A report on the CSEET 2001 workshop

引用

Education and Information Technologies 2001年第4期6卷 267-293页

作者： Barrie Thompson, J. Edwards, Helen M. Jovanovic, Vladan Layzell, Paul McDermid, John Williams, Norman S.W. School of Computing Engineering and Technology University of Sunderland Informatics Centre Sunderland SR6 ODD United Kingdom University of Detroit Mercy United States University of Manchester Institute of Science and Technology Manchester United Kingdom University of York York United Kingdom Professional Engineers Ontario Ontario Canada

The prime aim of the workshop was to provide a forum to consider the global dimensions of a Software Engineering profession and determine the relevance and usefulness of an initiative concerning the harmonization of professional standards which had been produced under the auspices of the International Federation of Information Processing. In particular the workshop addressed: the current situation with regard to certification and/or licensing in different countries, the drivers and constraints regarding Software Engineering Professionalism, the extent to which world-wide Software Engineering Professionalism is achievable (particularly in the light of IFIP's proposals regarding harmonization), and possible strategy(ies) that would assist in achieving such world-wide Software Engineering Professionalism. A pre workshop survey was carried out at the conference and the results of this are reported. The two staged operation and results of the workshop are then detailed. Initial position statements are summarised and the conclusions from the four separate subgroups that operated within each of the two stages are reported. Finally the major points from a general discussion on what the future goals and strategies for achieving a recognised profession should be are presented followed by the overall conclusion of the workshop participants. © 2001 Kluwer Academic Publishers.

关键词： Global level Harmonization IFIP Professionalism Software engineering

来源：评论

学校读者我要写书评

暂无评论

Dust & magnet: Multivariate information visualization using a magnet metaphor

引用

Information Visualization 1997年第4期4卷 239-256页

作者： Yi, Ji Soo Melton, Rachel Stasko, John Jacko, Julie A. Laboratory for Human–Computer Interaction and Health Care Informatics School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta GA United States College of Computing/GVU Center Georgia Institute of Technology Atlanta GA United States

The use of multivariate information visualization techniques is intrinsically difficult because the multidimensional nature of data cannot be effectively presented and understood on real-world displays, which have limited dimensionalities. However, the necessity to use these techniques in daily life is increasing as the amount and complexity of data grows explosively in the information age. Thus, multivariate information visualization techniques that are easier to understand and more accessible are needed for the general population. In order to meet this need, the present paper proposes Dust & Magnet, a multivariate information visualization technique using a magnet metaphor and various interactive techniques. The intuitive magnet metaphor and subsequent interactions facilitate the ease of learning this multivariate information visualization technique. A visualization tool such as Dust & Magnet has the potential to increase the acceptance of and utility for multivariate information by a broader population of users who are not necessarily knowledgeable about multivariate information visualization techniques. © 2005, SAGE Publications. All rights reserved.

关键词： interaction magnet metaphor Multivariate information visualization

来源：评论

学校读者我要写书评

暂无评论

Transactions on Rough Sets XII 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： James F. Peters Andrzej Skowron Roman Słowiński Pawan Lingras Duoqian Miao Shusaku Tsumoto

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：