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

International Joint Conference on Neural Networks (IJCNN)

作者： Silva, Thiago C. Zhao, Liang Univ Sao Paulo Inst Math & Comp Sci ICMC Dept Comp Sci BR-13560970 Sao Carlos SP Brazil

ISBN: (纸本)9781424496365

Complex network provides a general scheme for machine learning. In this paper, we propose a competitive learning mechanism realized on large scale networks, where several particles walk in the network and compete with each other to occupy as many nodes as possible. Each particle can perform a random walk by choosing any neighbor to visit, a deterministic walk by choosing to visit the node with the highest domination, or a combination of them. A computational complexity analysis is developed of the proposed algorithm. Computer simulations performed on several real-world data sets, including a large scale data set, reveal attractive results when the model is applied for data clustering problems.

关键词： Algorithm design and analysis Analytical models Computational complexity Computational modeling Machine learning Mathematical model Neural networks competitive learning mechanism complex network complex networks computational complexity computational complexity analysis computer simulation data clustering deterministic algorithms deterministic walk large scale networks learning (artificial intelligence) machine learning network based learning particle competition pattern clustering random processes random walk real-world data sets

来源：评论

学校读者我要写书评

暂无评论

Efficient Local Medium Access 20

Efficient Local Medium Access

引用

32nd ACM Symposium on Parallelism in algorithms and Architectures (SPAA)

作者： Garncarek, Pawel Jurdzinski, Tomasz Kowalski, Dariusz R. Univ Wroclaw Wroclaw Poland Augusta Univ Augusta GA USA SWPS Univ Warsaw Poland

ISBN: (纸本)9781450369350

Shah, Shin and Tetali [25] initiated the study of queuing systems on the medium access channel with arbitrary interference graph. The graph models dependencies between the channel members - any two connected by an edge are dependent. This problem could be also re-stated as a query system with dependent elements or local scheduling of dependent packets/jobs. In short, if two dependent units, also called stations, want to transmit (or be in the same query, or do jobs in parallel), there is a conflict and none of them succeeds. The problem is particularly challenging, if the units need to make their decisions locally, without any coordination. Prior the paper by Shah, Shin and Tetali [FOCS 2011], the main focus was on the clique graph - even in this simple topology, many problems related to stability remain open. While the solution by Shah, Shin and Tetali [FOCS 2011] is semi-local, as nodes make use of information about interfering neighbors in the graph, we provide the first purely local stable algorithms. In particular, in our algorithms stations make their decision whether to transmit or not based only on looking at their local queues. Based only on this feature, and without using a priori knowledge of topology, we design an algorithm that allows all stations for implicit transferring information to and from all other stations. We use it as a tool for developing universally stable algorithms for the problem of queuing messages - i.e., guaranteeing bounded queues when, on average, less than one independent set is injected per round. The first one is stable in adversarial (worst-case) sense, the second one - in stochastic sense (average-case). We also prove optimality of our algorithm in adversarial sense: no algorithm can be stable against injections with rate rho = 1 (when, on average, one independent set is injected per round). Moreover, for the class of non-adaptive protocols, we show that it is not possible to achieve stability for any injection rate omega (1/lo

关键词： local queuing shared channel multiple-access channel adversarial packet arrivals stability distributed algorithms deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

HoL-blocking Avoidance Routing algorithms in Direct Topologies 16

HoL-blocking Avoidance Routing Algorithms in Direct Topologi...

引用

16th IEEE International Conference on High Performance Computing and Communications HPCC 2014\11th IEEE International Conference on Embedded Software and Systems ICESS 2014\6th International Symposium on Cyberspace Safety and Security CSS 2014

作者： Penaranda, Roberto Gomez, Crispin Engracia Gomez, Maria Lopez, Pedro Duato, Jose Univ Politecn Valencia Valencia Spain Univ Castilla La Mancha Albacete Spain

ISBN: (纸本)9781479961238

Routing is a key parameter in the design of the interconnection network of large parallel computers. Depending on the number of routing options available for each packet, routing algorithms are classified into two different categories: deterministic (one available path) and adaptive (several ones). It is well-known that adaptive routing outperforms deterministic routing. Usually, adaptive routing uses virtual channels to provide routing flexibility and to guarantee deadlock freedom. On the other hand, deterministic routing is simpler and therefore has lower routing delay and does not introduce out-of-order packet delivery. This is why, in this paper, we take the challenge of developing new routing algorithms for direct topologies that exploit virtual channels in an efficient way while still maintaining the good properties of deterministic routing. This is accomplished by tackling one of the main performance degradation contributors of interconnection networks, which is the HoL-blocking effect. To do that, this paper analyzes several simple mechanisms to perform an efficient distribution of packets among virtual channels based on their destination. The resulting deterministic routing mechanisms obtain similar or even better performance than adaptive routing while keeping the simplicity of deterministic routing and guaranteeing in-order delivery of packets by design.

关键词： adaptive algorithms deterministic algorithms Direct topologies Head of line blocking

来源：评论

学校读者我要写书评

暂无评论

Coexistence between the future aeronautical system for continental communication L-DACS and the Distance Measuring Equipment DME

Coexistence between the future aeronautical system for conti...

引用

IEEE 1st AESS European Conference on Satellite Telecommunications (ESTEL)

作者： Neji, Najett de Lacerda, Raul Azoulay, Alain Letertre, Thierry Outtier, Olivier SUPELEC DRE F-91192 Gif Sur Yvette France

ISBN: (纸本)9781467346887;9781467346863

In the last decade, the aeronautical authorities expressed their need to develop a new system for aeronautical radio-communications. The L-band Digital Aeronautical Communication System (L-DACS) is the part of the future system that will be operating in a part of the aeronautical L-band (960-1164 MHz), already occupied by a large number of radio-frequency legacy systems. This paper aims at studying the L-DACS impact on a legacy system, the Distance Measuring Equipment (DME), under two critical situations. Such topics are fundamental in aeronautics, as any communication or radionavigation dysfunction may endanger flight and passengers security. Some obtained results will be used for the L-DACS standardization and its specifications finalization. For the first scenario (air-to-air scenario), we propose a deterministic algorithm to compute the interference level in the frequency domain. Since this seems to be insufficient for the second scenario (co-site scenario), we develop a time-frequency approach to analyze the interference using an aeronautical RFC test-bed that we implemented at Supelec.

关键词： order of interference Legacy systems Coexistence Frequency-domain analysis dimethyl ether deterministic algorithms Astronautics Communication Research L-band flight Radio navigation Radiocommunication continental

来源：评论

学校读者我要写书评

暂无评论

Scheduled Channel Access Using Geographical Classification

Scheduled Channel Access Using Geographical Classification

引用

International Conference on Computing, Networking and Communications (ICNC)

作者： Masilamani, Ashok N. Garcia-Luna-Aceves, J. J. Univ Calif Santa Cruz Dept Comp Engn Santa Cruz CA 95064 USA

ISBN: (纸本)9781467300094

Geographical Classification Multiple Access (GCMA) is introduced for scheduled channel access in large wireless networks. GCMA uses the geo-spatial coordinates of nodes, together with their transmission and interference ranges, to define collision-free transmission schedules using deterministic distributed algorithms. These algorithms require each node to know only the geo-spatial coordinates of its immediate neighbors to derive correct transmission schedules, even in the presence of hidden terminals. The transmission frames in GCMA consist of the minimum number of time slots needed to avoid multiple access interference, given the transmission and interference ranges of the nodes. GCMA is compared against representative examples of alternative approaches to medium access control;the results of the simulation experiments show that GCMA attains higher packet-delivery ratio and better goodput with end-to-end delay comparable to the other protocols.

关键词： access protocols delays deterministic algorithms distributed algorithms interference suppression multi-access systems radio access networks radiofrequency interference scheduling wireless channels

来源：评论

学校读者我要写书评

暂无评论

Contention Resolution in a Non-Synchronized Multiple Access Channel

Contention Resolution in a Non-Synchronized Multiple Access ...

引用

IEEE 27th International Parallel and Distributed Processing Symposium (IPDPS)

作者： De Marco, Gianluca Kowalski, Dariusz R. Univ Salerno I-84084 Fisciano SA Italy Univ Liverpool Liverpool L69 3BX Merseyside England

ISBN: (纸本)9780769549712

Multiple access channel is a well-known communication model that deploys properties of many network systems, such as Aloha multi-access systems, local area Ethernet networks, satellite communication systems, packet radio networks. The fundamental aspect of this model is to provide efficient communication and computation in the presence of restricted access to the communication resource: at most one station can successfully transmit at a time, and a wasted round occurs when more than one station attempts to transmit at the same time. In this work we consider the problem of contention resolution in a multiple access channel in a realistic scenario when up to k stations out of n join the channel at different times. The goal is to let at least one station to transmit alone, which results in successful delivery of the message through the channel. We present three deterministic algorithms: two of them working under some constrained scenarios, and achieving asymptotically optimal time complexity Theta(k log(n/k)), while the third general algorithm accomplishes the goal in time O(k log n log log n).

关键词： Multiple access channel Contention resolution deterministic algorithms Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximate inference in Bayesian networks using binary probability trees

引用

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING 2011年第1期52卷 49-62页

作者： Cano, Andres Gomez-Olmedo, Manuel Moral, Serafin Univ Granada Dept Comp Sci & Artificial Intelligence Higher Tech Sch Comp Sci & Telecommun E-18071 Granada Spain

The present paper introduces a new kind of representation for the potentials in a Bayesian network: binary probability trees. They enable the representation of context-specific independences in more detail than probability trees. This enhanced capability leads to more efficient inference algorithms for some types of Bayesian networks. This paper explains the procedure for building a binary probability tree from a given potential, which is similar to the one employed for building standard probability trees. It also offers a way of pruning a binary tree in order to reduce its size. This allows us to obtain exact or approximate results in inference depending on an input threshold. This paper also provides detailed algorithms for performing the basic operations on potentials (restriction, combination and marginalization) directly to binary trees. Finally, some experiments are described where binary trees are used with the variable elimination algorithm to compare the performance with that obtained for standard probability trees. (C) 2010 Elsevier Inc. All rights reserved.

关键词： Bayesian networks inference Approximate computation Variable elimination algorithm deterministic algorithms Probability trees

来源：评论

学校读者我要写书评

暂无评论

TESTING EQUALITIES OF MULTIPLICATIVE REPRESENTATIONS IN POLYNOMIAL-TIME

TESTING EQUALITIES OF MULTIPLICATIVE REPRESENTATIONS IN POLY...

引用

34th Annual Symposium on Foundations of Computer Science (FOCS 93)

作者： GE, GQ UNIV CALIF BERKELEY DEPT MATHBERKELEYCA 94720

ISBN: (纸本)0818643706

For multiplicative representations /spl Pi//sub i=1//sup k//spl alpha//sub i//sup n(i)/ and /spl Pi//sub j=1//sup l//spl beta//sub j//sup m(j)/ where /spl alpha//sub i/, /spl beta//sub j/ are non-zero elements of some algebraic number field K and n/sub i/, m/sub j/ are rational integers, we present a deterministic polynomial time algorithm that decides whether /spl Pi//sub i=1//sup k//spl alpha//sub i//sup n(i)/ equals /spl Pi//sub j=1//sup l//spl beta//sub j//sup m(j)/. The running time of the algorithm is polynomial in the number of bits required to represent the number field K, the elements /spl alpha//sub i/, /spl beta//sub j/ and the integers n/sub i/, m/sub j/.

关键词： deterministic algorithms polynomial matrices testing equalities multiplicative representations polynomial time nonzero elements algebraic number field rational integers deterministic polynomial time algorithm

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Beeping a Time-Optimal Leader Election 18

Brief Announcement: Beeping a Time-Optimal Leader Election

引用

37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)

作者： Dufoulon, Fabien Burman, Janna Beauquier, Joffroy Univ Paris Saclay Univ Paris Sud CNRS LRI Orsay France

ISBN: (纸本)9781450357951

The beeping model is an extremely restrictive broadcast communication model that relies only on carrier sensing. In this model, we solve the deterministic leader election problem with an asymptotically optimal round complexity. Using this result, we obtain an asymptotically optimal randomized leader election algorithm for anonymous networks, as well as improved algorithms for symmetry-breaking and communication primitives. The techniques that we introduce give a new insight as to how local constraints on the exchangeable messages can result in efficient algorithms, when dealing with the beeping model.

关键词： distributed algorithms leader election beeping model time complexity deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

A low-complexity navigation algorithm for a scalable autonomous firefighting vehicle

A low-complexity navigation algorithm for a scalable autonom...

引用

5th Student Conference on Research and Development

作者： Harwayne-Gidansky, Jared Sudano, Michael Cooper Union Adv Sci & Art Dept Elect & Comp Engn New York NY 10003 USA Cooper Union Adv Sci & Art Dept Mech Engn New York NY 10003 USA

ISBN: (纸本)9781424414697

The design and implementation of a low cost, scalable autonomous vehicle that detects, approaches, and extinguishes a heat source while avoiding obstacles in its path is presented. This design was implemented by using a low-complexity, deterministic algorithm. The algorithm, in addition to being scalable, has minimal hardware requirements. The completed robot is a proof of concept prototype, to demonstrate the reliability of using this algorithm in autonomous robots for combating a variety of fires.

关键词： control systems deterministic algorithms mechatronics mobile robot motion-planning robot sensing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：