In this paper, we report on the automatic recognition of Japanese broadcast-news speech. We have been working on largevocabulary continuous speech recognition (LVCSR) for Japanese newspaper speech transcription and have achieved good performance. We have recently applied our LVCSR system to transcribing Japanese broadcast-news speech. We extended the vocabulary from 7k words to 20k words and tr...

One designing challenge in the scheduling of broadcast in wireless ad hoc networks is to reduce broadcast redundancy and provide high reachability, simultaneously. In this paper, we propose a broadcasting algorithm in wireless ad hoc networks. The algorithm uses two-hop neighbourhood information to construct the broadcast tree, in which the information can be gathered via exchanging ‘hello’ mes...

This paper addresses the problem of broadcasting messages in a reliable and totally ordered manner when processes and channels may crash and recover, or crash and never recover. We present a suite of specifications of reliable and total order broadcast primitives and we describe algorithms that implement those specifications. Our approach is modular and incremental. It is modular in the sense t...

It is well-known that consensus (one-set agreement) and total order broadcast are equivalent in asynchronous systems prone to process crash failures. Considering wait-free systems, this article addresses and answers the following question: which is the communication abstraction that “captures” k-set agreement? To this end, it introduces a new broadcast communication abstraction, called k-BO-Bro...

The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (BCM, for short) endowed with p processors and k communication channels. We begin by presenting an optimal off-line routing algorithm using nk broadcast rounds for any k, p, and n. We then go on to develop an on-line ro...

We define and describe a model for coordination of distributed processes or components based on associative broadcast. Associative broadcast encapsulates processes with an associative interface. The associative interface includes a profile, which specifies the current state of the component. Each message is sent with a conditional expression (selector), which evaluates to true for specific inst...

This paper presents a method to cope with reliable broadcasting in faulty hypercubes using local safety information. A new definition, broadcast subcube, is introduced, with which various techniques are proposed to improve performance of the broadcast algorithm. Local safety information is well used in the fault-tolerant broadcast algorithm by considering only safety of the broadcast subcube. A...

This paper proposes a tree-based adaptive broadcasting (TAB) algorithm for data dissemination to improve data access efficiency. The proposed TAB algorithm first constructs a broadcast tree to determine the broadcast frequency of each data and splits the broadcast tree into some broadcast wood to generate the broadcast program. In addition, this paper develops an analytical model to derive the ...

The broadcast population coverage has increased to 96% in china. Information services by radio have wide coverage, low cost, easy to grass-roots farmers to accept etc. characteristics. In order to play the better role of broadcast information service in rural area, the author R & D agricultural information service system based on addressable broadcast, which transformed from traditional broadca...

Data broadcasting is a scalable mechanism to disseminate information to a large number of mobile clients in a wireless environment. This paper concerns the development of a data broadcast system in a wireless environment. The broadcast data is retrieved from a central database server. We apply three different data broadcast schemes in the following order: first, we implement a filtering techniq...