An algorithm for cryptanalysis of certain keystream generators is proposed. The developed algorithm has the following two advantages over other reported ones: it is more powerful, and it can be implemented by a high-speed software or a simple hardware suitable for high parallel architectures. The algorithm is based on error-correction of information bits only (of the corresponding binary block code) with a novel method for construction of the parity-checks, and the employed error-correction procedure is an APP based threshold decoding. Experimental and theoretical analyses of the algorithm performance are presented, and its complexity is evaluated. The proposed algorithm is compared with recently proposed improved fast correlation attacks based on convolutional codes and turbo decoding. The underlying principles, performance and complexity are compared, and the gain obtained with the novel approach is pointed out.

This work describes a novel structural design for nth-order (n2) transconductance and grounded capacitor (Gm-C) filters with multiple loop feedback technology. The proposed design largely focuses on elucidating the relationship between the Gm-C filter structure and the feedback matrix, allowing us to systematically generate and formulate general design equations. The proposed design allows many new interesting filter configurations to be produced alongside some known structures. Furthermore, numerical design examples and simulation results verify the feasibility of the Gm-C filter approach.

This paper presents a new data hiding scheme under fractal image generation via Fourier filtering method for Computer Graphics (CG) applications. The data hiding operations are achieved in the frequency domain and a method similar to QAM used in digital communication is introduced for efficient embedding in order to explore both phase and amplitude components simultaneously. Consequently, this scheme enables us not only to generate a natural terrain surface without loss of fractalness analogous to the conventional scheme, but also to embed larger amounts of data into an image depending on the fractal dimension. This scheme ensures the correct decoding of the embedded data under lossy data compression such as JPEG by controlling the quantization exponent used in the embedding process.

A broadcast distribution system (BDS) is a system for the distribution of digital contents over broadcast channel where the data supplier broadcasts the contents in encrypted form and gives each subscriber a decoder containing a secret decryption key. A traitor is a subscriber who offers the information which allows to decrypt the broadcast. When a pirate decoder is captured, if at least one traitor can be identified from it, a BDS is said to be traitor-tracing. If the data supplier can prevent subscribers from obtaining the contents without recalling their decoders, a BDS is said to be subscriber-excluding. In this paper, we propose an efficient BDS which is both subscriber-excluding and traitor-tracing. We use similar mathematics to a threshold cryptosystem. In the proposed BDS, the maximum number of excluded subscribers reaches the maximum number of traitors in a coalition for which at least one traitor can be identified. We prove that the proposed BDS is secure against ciphertext-only attack if and only if ElGamal cryptosystem is secure against the attack and the discrete logarithm problem is hard. The proposed BDS is the first one which satisfies all the following features: Both subscriber-excluding and traitor-tracing, identifying all the traitors, black box tracing and public key system.

In this paper, we present a computer-aided diagnosis (CAD) system to automatically detect lung cancer candidates at an early stage using a present and a past helical CT screening. We have developed a slice matching algorithm that can automatically match the slice images of a past CT scan to those of a present CT scan in order to detect changes in the lung fields over time. The slice matching algorithm consists of two main process: the process of extraction of the lungs, heart, and descending aorta and the process of matching slices of the present and past CT images using the information of the lungs, heart, and descending aorta. To evaluate the performance of this algorithm, we applied it to 50 subjects (total of 150 scans) screened between 1993 and 1998. From these scans, we selected 100 pairs for evaluation (each pair consisted of scans for the same subject). The algorithm correctly matched 88 out of the 100 pairs. The slice images for the present and past CT scans are displayed in parallel on the CRT monitor. Feature measurements of the suspicious regions are shown on the relevant images to facilitate identification of changes in size, shape, and intensity. The experimental results indicate that the CAD system can be effectively used in clinical practice to increase the speed and accuracy of routine diagnosis.

This paper proposes an algorithm that adaptively estimates time-varying noise variance used in Kalman filtering for real-time speech signal enhancement. In the speech signal contaminated by white noise, the spectral components except dominant ones in high frequency band are expected to reflect the noise energy. Our approach is first to find the dominant energy bands over speech spectrum using LPC. We then calculate the average value of the actual spectral components over the high frequency region excluding the dominant energy bands and use it as the noise variance. The resulting noise variance estimate is then applied to Kalman filtering to suppress the background noise. Experimental results indicate that the proposed approach achieves a significant improvement in terms of speech enhancement over those of the conventional Kalman filtering that uses the average noise power over silence interval only. As a refinement of our results, we employ multiple-Kalman filtering with multiple noise models and improve the intelligibility.

This paper reviews analog-circuit researches in the 1990's especially from an academic-side point of view with the aim of pursuing what becomes important in the 21st century. To achieve this aim a large number of articles are surveyed and more than 200 are listed in References.

We propose a blind source separation algorithm for the mixture of finite alphabet sources where sensors are less than sources. The algorithm consists of an update equation of an estimated mixing matrix and enumeration of the inferred sources. We present the bound of a step size for the stability of the algorithm and two methods of assignment of the initial point of the estimated mixing matrix. Simulation results verify the proposed algorithm.

Terahertz radiation imaging has been employed to diagnose the supercurent and vortex distribution in high-Tc superconductive thin film strips. We observe them in the YBCO films patterned into the strip with and without ordered arrays of small antidots. Comparison with the theoretically expected distribution reveals that the present technique can provide a powerful tool for the noncontact, nondestructive, and free-space evaluation of the supercurrent and the vortex distribution with good quantitative agreement. The effect of the antidot formation in the strips is explained by the decrease of the effective critical current. The remanent state after removal of the relatively large magnetic field cannot be explained by the conventional model for the superconductive thin films, and the discrepancy is more notable in the antidot-formed area.

We present a distributed protocol for achieving totally unbiased global coin flipping in the presence of an adversary. We consider a synchronous system of n processors at most t of which may be corrupted and manipulated by a malicious adversary, and assume a complete network where every two processors are connected via a private channel. Our protocol is deterministic and assumes a very powerful adversary. Although the adversary cannot eavesdrop, it is computationally unbounded, capable of rushing and dynamic. This is the same model that is adopted in Yao's global coin flipping protocol, which we use as the base of our protocol. Our protocol tolerates almost n/3 processor failures and terminates in t+4 rounds. The resilience of our protocol is greatly improved from that of Yao's protocol at the slight expense of running time, which is only added just two rounds.

This paper describes an application of a speech translation system to another task/domain in the real-world by using developmental data collected from real-world interactions. The total cost for this task-alteration was calculated to be 9 Person-Month. The newly applied system was also evaluated by using speech data collected from real-world interactions. For real-world speech having a machine-friendly speaking style, the newly applied system could recognize typical sentences with a word accuracy of 90% or better. We also found that, concerning the overall speech translation performance, the system could translate about 80% of the input Japanese speech into acceptable English sentences.

The head tissue heterogeneity required in the spatial peak specific absorption rate (SAR) assessment for portable telephones was investigated by using the FDTD method in conjunction with an MRI-based human head model. The tissue heterogeneity of the head model was changed from one type of tissue to 17 types of tissue. The results showed that, at 900 MHz and 2 GHz, the homogeneous modeling results in an underestimate about 20% for the λ/2 monopole antenna portable telephones and an overestimate to the same extent for the λ/4 monopole or helical antenna portable telephones. A head model with a simple skin-fat-muscle-bone-brain structure seems to be sufficient to obtain a fairly accurate one-gram or ten-gram averaged spatial peak SAR value in computational dosimetry for portable telephone compliance.

This paper shows that nondeterministic sensing semi-one-way simple k-head finite automata are more powerful than nondeterministic sensing one-way simple k-head finite automata for any k2, and sensing semi-one-way simple 2-head finite automata are more powerful than semi-one-way simple 2-head finite automata, which gives an affirmative answer and a partial solution to two open problems on sensing semi-one-way simple multi-head finite automata in Ref.[3].

In this paper, we propose a realtime concatenation technique between basic skeletal motions obtained by the motion capture technique and etc. to generate a lifelike behavior for a humanoid character (avatar). We execute several experiments to show the advantage and the property of our technique and also report the results. Finally, we describe our applied system called WonderSpace which leads participants to the exciting and attractive virtual worlds with humanoid characters in cyberspace. Our concatenation technique has the following features: (1) based on a blending method between a preceding motion and a succeeding motion by a transition function, (2) realizing "smooth transition," "monotone transition," and "equivalent transition" by the transition function called paste function, (3) generating a connecting interval by making the backward and forward predictions for the preceding and succeeding motions, (4) executing the prediction under the hypothesis of "the smooth stopping state" or "the state of connecting motion", (5) controlling the prediction intervals by the parameter indicating the importance of the motion, and (6) realizing realtime calculation.

This paper investigates a hierarchical property based on the number of inkdots in the accepting powers of sublogarithmic space-bounded multi-inkdot two-way alternating Turing machines with only universal states. For each k1 and any function L(n), let strong-2UTMk(L(n)) (weak-2UTMk(L(n))) be the class of sets accepted by strongly (weakly) L(n) space-bounded k-inkdot two-way alternating Turing machines with only universal states. We show that for each k1, strong-2UTMk+1(log log n) - weak-2UTMk(o(log n)) Ø.

For distributed multimedia applications, the development of adaptive QoS (quality of service) management mechanisms is needed to guarantee various and changeable end-to-end QoS requirements. In this paper, we propose an adaptive QoS management framework based on multi-agent systems. In this framework, QoS management mechanisms are divided into two phases, the flow establishment and renegotiation phase and the media-transfer phase. An adaptation to system resource changes and various user requirements is accomplished by direct or indirect collaborations of the agents in each phase. In the flow establishment and renegotiation phase, application agents determine optimal resource allocation with QoS negotiations to maximize the total users' utility. In the media-transfer phase, stream agents collaborate to adjust each stream QoS reactively. In addition, personal agents help a novice user to specify stream QoS without any a priori knowledge of QoS. To make the interworking of agents tractable, a QoS mapping mechanism is needed to translate the QoS parameters from level to level, since the expression of QoS differs from level to level. As an example of multimedia application based on the proposed framework, a one-way video system is designed. The experimental results of computer simulation show the validity of the proposed framework.

A passive branched optical network unified for broadcasting and communication utilizing a set of Fabry-Perot etalons with different cavity lengths is proposed and its basic operation including thermal stability of broadcasting channel is demonstrated. It is confirmed that a high transmission frequency in common for a pair of fiber Fabry-Perot etalons is always found however environmental temperature changes.

The term pilot pollution in IS-95 CDMA systems is used to indicate that a large number of equally strong pilot signals is present. Those pilots compete with each other to become the serving one and this causes a very high rotation of pilot leadership at the mobile station. As a consequence, the signaling rate on the traffic channel increases, thus degrading the call quality. We present a method of alleviating the pilot pollution problem by means of repeaters. Simulation studies have been carried out on an actual CDMA network suffering from pilot pollution and the results have been verified by field trials. They indicate that repeaters can effectively improve call quality by altering the spacial distribution of pilot signal strength.

Private information retrieval for k 1 databases (denoted by (k,l)-PIR for short) is a protocol that (1) a user sends an l tuple query to each of k noncommunicating replicated databases; (2) each database responds the user with an answer corresponding to the l tuple query; (3) the user privately retrieve any single bit out of the n bits of data stored in k databases. 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 wishes to get. In general, the efficiency of (k,l)-PIR is measured by the total amount of bits exchanged between the user and the k databases, but few about its lower bounds are known except for restricted cases. In this paper, we classify (k,l)-PIR into a linear type, a multilinear type, and an affine type with respect to the relationship between queries to each database (made by the user) and answers to the user (made by each database), and show that (1) the lower bound for the communication complexity of any multilinear type (k,l)-PIR is Ω(n1/(l+1)) (Theorem 3.1); (2) the lower bound for the communication complexity of any linear type (k,l)-PIR is Ω(n) (Corollary 3.2); (3) the lower bound for the communication complexity of any affine type (k,l)-PIR is Ω(n1/(l+1)) (Theorem 4.2).

The capability of frequency-swept cross-borehole radar to detect an empty rectangular cylinder embedded in a dielectric medium is simulated numerically by employing the boundary element method. The frequency loci providing the strongest double dips in the received signal pattern are plotted as functions of the observation distance and the cross-sectional width. It is found that, regardless of the shape of the rectangular cross-section, the strongest double dips become double nulls in the near-field region.