An efficient reliable broadcasting protocol for wireless mobile ad hoc networks

The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion, to which we refer as the broadcast storm problem. This paper proposes an efficient reliable broadcasting protocol by taking care of the potential broadcast storm problem that could occur in the medium-access level. Existing protocols are either unreliable, or reliable but based on a too costly approach. Our protocol differs from existing protocols by adopting a low-cost broadcast, which does not guarantee reliability, as a basic operation. The reliability is ensured by additional acknowledgement and handshaking. Simulation results do justify the efficiency of the proposed protocol.     

A survey on approaches to gridification

The Grid shows itself as a globally distributed computing environment, in which hardware and software resources are virtualized to transparently provide applications with vast capabilities. Just like the electrical power grid, the Grid aims at offering a powerful yet easy‐to‐use computing infrastructure to which applications can be easily ‘plugged’ and efficiently executed. Unfortunately, it is still very difficult to Grid‐enable applications, since current tools force users to take into account many details when adapting applications to run on the Grid. In this paper, we survey some of the recent efforts in providing tools for easy gridification of applications and propose several taxonomies to identify approaches followed in the materialization of such tools. We conclude this paper by describing common features among the proposed approaches, and by pointing out open issues and future directions in the research and development of gridification methods. Copyright © 2007 John Wiley & Sons, Ltd.     

日本移动通信频率选择技术动向

本文介绍日本在移动通信中频率选择的技术动向以及开展移动通信频率资源的几项措施。     

计算几何与并行算法

本文首先介绍了计算几何的基本概念,论述了计算几何的四个基本问题,即几何搜索问题、相交问题、邻接问题及凸壳问题。然后重点分析了凸壳构造问题,介绍了其最佳串行算法、及相应的并行算法。接着对一些计算几何的串行及并行算法进行了分析比较。最后提出了笔者对新一代并行计算机系统上设计计算几何并行算法的看法。     

面向智能计算的记忆结构理论综述

本文从智能计算角度出发，对记忆的总体结构、信息表征及记忆模型等方面的理论作一综述。并在分析、比较了这些理论与ＡＩ中的相关理论差异的基础上，对面向智能计算的记忆理论研究方法与方向作了扼要讨论。     

与性能相关的容错计算系统可靠性指标

对于某些容错计算系统，由于成功与故障之间没有明确的界限，用传统的可靠性指标难以准确地评价其容错性能，为此一些学者提出了若干与性能相关的可靠性指标。本文将这些指标概括成三类（即基于瞬时性能的指标、基于累积收益的指标和率模可靠性指标）加以介绍，并简要介绍了它们的求解方法。     

Echolocation — From range to outline segments

A ring of ultrasonic sensors mounted on a mobile robot is used to map a room. The sensors are modelled with an arc model: the object causing the reflection lies on an arc with radius equal to the range and arc angle equal to twice the beam angle. By fusing sensing with motion, a surface is displayed as a sequence of arcs. In this paper, the algorithm for obtaining outline segments from the arcs is presented.     

Analysis of a conjugated infinite element method for acoustic scattering

This work is devoted to a study of a conjugated infinite element method for Helmholtz problems in exterior domains. A formulation of this method with Lagrange multipliers defined on (semi-)infinite space is presented and analyzed in a domain decomposition context. The implementation aspects of this method in a parallel industrial acoustic software (SYSNOISE) are described in details. Numerical results show the computational efficiency of this method on acoustic scattering problems.     

Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler

This paper presents distributed self-stabilizing algorithms for the maximal independent and the minimal dominating set problems. Using an unfair distributed scheduler the algorithms stabilizes in at most max{3n−5,2n} resp. 9n moves. All previously known algorithms required O(n²) moves.     

广义de Bruijn多计算机互连网络

（ｄ，ｍ）ｄｅ Ｂｒｕｉｊｎ多计算机系统互连网络限制网络的规模必须为ｄ＾ｍ。本文把（ｄ，ｍ）ｄｅ Ｂｒｕｉｊｎ网络推广到了任意顶点情形，提出了广义ｄｅ Ｂｒｕｉｊｎ网络，研究了广义ｄｅ Ｂｒｕｉｊｎ网络的自路由性质，设计了路由算法，研究了广义ｄｅ Ｂｒｕｉｊｎ网络顶点度的性质和容错特性。