The conventional linear prediction can be viewed as a constrained blind equalization problem that has gained a lot of interests along with development of telecommunication networks. Because the blind equalization or deconvolution is a general framework of the inverse problem, the reliable and faster algorithm is requested in many applications. This paper proposes an orthogonal wavelet transform domain realization of a blind equalization technique termed as EVA, and presents an application to speech analysis. An orthogonal transformation has no influence to the equalization result in general, but we show that a particular wavelet makes the matrix in EVA nearly lower triangular that promotes the faster convergence in the estimation of maximum eigenvalue and its associate vector in EVA iteration. The experiments with the Japanese vowels show that the the proposed method effectively separates the glottis and vocal tract information, hence is promising for speech analysis.

Under a contamination of background sound noises, it seems difficult especially in a real working situation to evaluate various type statistics of only an objective sound signal fluctuation. In many cases of the noise evaluation, some signal processing method have been employed to eliminate the effect of background sound noises by first measuring emitted sound levels. In this study, a new evaluation method of sound level fluctuation is proposed in principle on the basis of the measurement of heterogeneous physical quantity other than sound pressures or sound levels to eliminate the effect of background sound noises. Though the theoretical analysis on acoustical emission caused by a mechanical vibration seems very difficult in a working situation, the sound noise fluctuation emitted only from an objective sound source can be effectively evaluated through its related vibration measurement by employing a fairly unified stochastic method proposed on the basis of a generalized regression analysis between sound and vibration. Here, the regression coefficients are determined by employing the least squares error method to minimize the mean square of estimation error to illustrate well the sound data by means of vibration data. Finally, the effectiveness of proposed method has been experimentally applied to the sound noise evaluation of a jigsaw.

The optimistic consistency scheme has been established with respect to data consistency and availability in distributed systems. The nomadic data consistency model using version vectors to support data versioning for data synchronization and concurrent conflict detection is suitable for an optimistic replication system that supports large-scale wireless networks. This paper describes the architecture and its data consistency model using data versioning and its access domain control targeted for nomadic data sharing systems, such as collaborative works using database and messaging, and the data transfer optimizations of the model. We evaluate our data versioning scheme comparing with a traditional data versioning and the data transfer optimization by estimation and measurement assuming a mobile worker's job. We generate arithmetic formulas for data transfer estimation using the optimizing techniques and apply them to large-scale data sharing configurations in which collaboration groups are dynamically formed and data is exchanged in each group. The data versioning with an access domain increases flexibility in data sharing configurations, such as mobile collaboration systems and client/server type mobile systems. We confirmed that the combination of the general optimizations and the access domain configurations based on our data consistency model is applicable for large-scale mobile data sharing systems.

This paper proposes a medium access control (MAC) protocol for single-hop WDM star-coupler networks, in which the number of stations is larger than the number of channels and the stations have arbitrary distances to the star coupler. The proposed protocol has one control channel for reserving the slots of data channels and several data channels which are used to transmit traffic. This paper also suggests a scheme that accomplishes load balancing among data channels for arbitrary traffic patterns between stations. Since this load balancing scheme diminishes an influence that traffic patterns have on the performance of the proposed MAC protocol, the proposed system is appropriate for systems which have asymmetric traffic intensity between stations. Throughput and mean message delay of the MAC protocol are analyzed using a discrete time Markov process and a D/G/1 queue with batch arrivals. The numerical results show that the performance is improved as the message length increases, the maximum round-trip propagation delay decreases, and the number of data channels increases.

An unbiased estimation method for symmetric noncausal ARMA model parameters is presented. The proposed algorithm works in two steps: first, a spectrally equivalent causal system is identified by lattice whitening filter and then the equivalent noncausal system is reconstructed. For AR system with noise or ARMA system without noise, the proposed method does not need any iteration method nor any optimization procedure. An estimation method of noise variance when the observation is made in noisy situation is discussed. The potential capabilities of the algorithm are demonstrated by using some numerical examples.

In this paper, a scheme to remove clouds and their shadows from remotely sensed images of Landsat TM over land has been proposed. The scheme uses the image fusion technique to automatically recognize and remove contamination of clouds and their shadows, and integrate complementary information into the composite image from multitemporal images. The cloud regions can be detected on the basis of the reflectance differences with the other regions. Based on the fact that shadows smooth the brightness changes of the ground, the shadow regions can be detected successfully by means of wavelet transform. Further, an area-based detection rule is developed in this paper and the multispectral characteristics of Landsat TM images are used to alleviate the computational load. Because the wavelet transform is adopted for the image fusion, artifacts are invisible in the fused images. Finally, the performance of the proposed scheme is demonstrated experimentally.

A novel testing-pad placement method has been developed to greatly improve E-beam observability for multi-level wiring LSIs. In the method, testing pads connecting a lower-metal-layer wire with a top-metal-layer electrode are positioned in the design layout, making removal of the insulator unnecessary. The method features i) pad placement in unoccupied areas in mask patterns to avoid increases in chip size, ii) minimized pad size through the use of stacked vias so that the pads can be placed on as many wire nodes as possible, iii) placement as far as possible from the nearby wires to avoid local field effects, and iv) allocation of one testing pad to one circuit node to minimize the number of testing pads. These measures give us a practical pad-placement method, that has little influence on LSI design. It was shown that the proposed method yielded a dramatic improvement of observability from 13-33% to 88-99% in actual layouts of 0.25-µm ASICs with 20k, 120k, and 390k gates. It was also found that local field effects from nearby wires are negligible for almost all the testing pads. This approach will enable the use of E-beam testing on LSIs made with 0.25-µm technology and the even more sophisticated process technologies to come.

A direct conversion transmitter IC including a proposed frequency doubler, a quadrature modulator, and a 3-bit variable attenuator was fabricated using BiCMOS technology with fT of 12 GHz. This architecture employing frequency doubler is intended for realizing wireless terminals that are low in cost and small in size. The architecture is effective for reducing serious interference between PA and VCO by making the VCO frequency different from that of PA. The proposed frequency doubler comprises a current-driven 90 phase-shifter and an ECL-EXOR circuit for both low power operation and wide input power range of local oscillator (LO). The proposed frequency doubler keeps high output power even when rectangular wave from LO is applied owing to use of the current-driven 90 phase-shifter instead of a voltage-driven 90 phase-shifter. An LO leakage of less than -25 dBc, an image rejection ratio in excess of 45 dBc, and a maximum attenuation of 21 dB were measured. The transmitter IC successfully operates at LO power above -15 dBm and consumes 68 mA from 2.7 V power supply voltage. An active die size is 1.5 mm3 mm.

Lots of self-tuning control schemes have been proposed for tuning the parameters of control systems. Among them, pole-assignment schemes have been widely used for tuning the parameters of control systems with unknown time delays. They are usually classified into two methods, the implicit and the explicit methods according to how to identify the parameters. The latter has an advantage to design a control scheme by taking account of the stability margin and control performance. However, it involves a considerably computational burden to solve a Diophantine equation. A simple scheme is proposed in this paper, which can construct a multivariable self-tuning pole-assignment control system, while taking account of the stability margin and control performance without solving a Diophantine equation.

Recently, mobile computing has received much attention from database community. Sharing information among mobile users is one of the most challenging issues in mobile computing due to user mobility. Replication is a promising technique to this issue. However, adopting replication into mobile computing is a non-trivial task, since we are still facing other problems such as the lack in disk capacity and wireless network bandwidth used by mobile users. We have proposed a dynamic replica allocation strategy called User Majority Replica Allocation (UMRA) that is well suited to the modern architecture of mobile computing environment while avoiding such problems mentioned above. In this paper, we propose two relocation decision policies for UMRA and we provide a cost analysis for them. We also provide a cost analysis for another replica allocation strategy called Static Replica Allocation (SRA) for a comparison purpose.

We introduce a new methodology for designing block ciphers with provable security against differential and linear cryptanalysis. It is based on three new principles: change of the location of round functions, round functions with recursive structure, and substitution boxes of different sizes. The first realizes parallel computation of the round functions without losing provable security, and the second reduces the size of substitution boxes; moreover, the last is expected to make algebraic attacks difficult. This structure gives us a simple and effective method for designing secure and fast block ciphers in hardware as well as in software implementation. Block encryption algorithm MISTY was designed on the basis of this methodology.

This paper discusses a new form of network database access with mobile agent technology, where many small database servers are distributed geographically, and are accessed through dial-up network on-demand. Coined "scattered database access" here, it enables such interesting ways of data access as asynchronous, circulatory, and the-more-you-spend-the-more-you-get kind of access. Databases to be accessed are relational databases, possibly from many different vendors, and PDM databases, also from several vendors. Relational databases, or RDBs, can be accessed by the SQL, an international standard that allows the interoperability of different RDB products in general. On the other hand, PDM databases, the data-stores for Product Data Management software, are not as inter-operable as RDBs, since the product-specific set of APIs has to be used to access them. An SQL-like language and a parser framework have been introduced to solve this problem. By implementing the parser as an object-oriented framework, the workload to adapt to many PDM products has been greatly reduced. The design and preliminary implementation has been carried out in a government-sponsored CALS project in Japan, and has been proven viable in the field, where a large steel-making company gathering information from many subordinate companies around the steel plant, and from other steel companies and equipment manufacturers.

Informally, private information retrieval for k 1 databases (k-PIR) is an interactive scheme that enables a user to make access to (separated) k replicated copies of a database and privately retrieve any single bit out of the n bits of data stored in the database. In this model, "privacy" implies that the user retrieves the bit he is interested in but releases to each database nothing about which bit he really tries to get. Chor et. al. proposed 2-PIR with communication complexity 12 n1/32 that is based on the covering codes. Then Ambainis recursively extended the scheme by Chor et. al. and showed that for each k 2, there exists k-PIR with communication complexity at most ckn1/(2k-1) some constant ck > 0. In this paper, we relax the condition for the covering codes and present time-efficient 2-PIR with communication complexity 12 n1/3. In addition, we generally formulate the recursive scheme by Ambainis and show that for each k 4, there exists k-PIR with communication complexity at most ck' n1/(2k-1) for some constant ck' << ck.

This paper proposes the first provably secure multi-signature schemes under the random oracle model. The security of our schemes can be proven in the sense of concrete security in Ref. [13]. The proposed schemes are efficient if the random oracle is replaced by practical hash functions. The essential techniques in our proof of security are the optimal reduction from breaking the corresponding identification to breaking signatures (ID Reduction Technique), and the hierarchical heavy row lemmas used in the concrete reduction from solving the primitive problem to breaking the identification scheme.

In a DC 50 V/3.3 A circuit, the spatial distributions of the spectral intensities of breaking arcs near the cathode for silver contacts were measured on the contact surfaces of three different shapes: flat and spherical (1 mm radius and 2 mm radius) and the arc temperature and the metal-vapor quantity were calculated from the spectral intensities. The influence of the contact shape on the arc temperature and the metal-vapor quantity were also examined, as well as the arc tracks on the contact surfaces and the gain and loss of the contacts. Findings show the distributions of spectral intensities are non-symmetrical from the beginning to the extinction of the breaking arc for the flat contact: However, they are symmetrical in the latter half of the breaking in spite of the number of breaking arcs and the shape of contact surface for the spherical contact. The relationship between the area of the arc tracks on the cathode and the shape of contact surface is the same as the relationship between the existent areas of measured spectra and the shape of the contact surface. For the spherical contacts, the arc temperature and the metal-vapor quantity are affected a little by the radius of the curved of contact surface and the number of breaking arcs. However, the longer the arc duration, the higher the metal-vapor quantity is in the latter period of the breaking arc. For the flat contacts, the metal-vapor quantity is lower than those for the spherical contacts. The gain and loss of the contacts are less and the arc duration is shorter for the flat contact than for the spherical contact.

To provide users with database-like query interfaces on HTML data, several systems have been developed to extract structures from HTML pages. Among them, tree-like structures and path expressions are the most popular modeling and navigating tools, respectively. Although path expressions are straightforward in representing top-down search patterns, they provide very limited help in representing bottom-up and in-breadth search patterns. In this paper, a lattice model is proposed to store Web data. The model provides an integrated mechanism to store text, linking information, HTML hierarchy, and sequence order of HTML data. By incorporating lattice operators with comprehension syntax, we show that the query language can represent top-down, bottom-up, and in-breadth searching patterns with uniform operators. It will be also shown that lattice comprehensions can represent all operators of path expressions, except Kleen closure.

This paper describes a way of implementing a conceptual model for temporal data on a commercial object database system. The implemented version is provided as a class library. The library enables applications to handle temporal data. Any application can employ the library because it does not depend on specific applications. Furthermore, we propose an enhanced version of Time Index. The index efficiently processes event queries in particular. These queries search time intervals in which given events are all valid. We also investigate the effectiveness of the enhanced Time Index.

Space reservation is important in allocating and releasing storage space in DBMSs to support recoverable actions. Since most existing space reservation methods are designed to perform well when few data pages have spaces reserved by more than one transaction, they are not suitable for some of the newly emerging applications, such as workflow and inventory control systems. In these applications, many concurrent transactions frequently insert and delete records into/from a relatively small table. This paper proposes a new space reservation method that performs well for these types of applications by extending the lock control structures to keep detailed and up-to-date information in a reserved state. This paper also shows, by simulation, that the new method performs better than existing ones for applications in which many concurrent transactions frequently insert and delete records into/from a table, and even for applications where data pages rarely have space reserved by more than one transaction.

A packet-based leaky-bucket algorithm functions like the early packet discard (EPD), and accepts a newly arriving packet if the probability that all the cells of the packet are accepted is high. We derive some performance characteristics of the cell and packet arrival processes that are accepted by the leaky-bucket algorithm. From these analyses, a method to determine the values of the parameters of the leaky-bucket algorithm and certain relations between this leaky-bucket algorithm and the generic cell rate algorithm (GCRA) are obtained.

This paper introduces a material management system for newspapers that was developed for The Yomiuri Shimbun. Material transferred to the system is stored in a material database and sent to terminals located in the related sections. The material can be processed effectively just by checking information on the terminals. Special requirements for this system will be discussed first in the paper, then problem-solving will be explored.