Watermarking methods that employ orthogonal transformations are very robust against non-geometrical modifications such as lossy compression, but attaining robustness against image translation or cropping is difficult. This report describes a watermarking method that increases robustness against geometrical modifications such as image translation and cropping by embedding watermark data in the frequency component of an image and detecting that data by considering the phase difference of the coefficients that results from translation of the image. Experimental results demonstrate the robustness of this method against both non-geometrical image changes and image translation and cropping.

The paper shows some of benefits of multi-unitary decomposition in signal analysis applications. It is emphasized that decompositions of complex discrete-time signals onto a single basis provide an incomplete and in such way potentially misleading image of the signals in signal analysis applications. It is shown that the multi-unitary decimated filter banks which decompose the analyzed signal onto several bases of the given vector space can serve as a tool which provides a more complete information about the signal and at the same time the filter banks can enjoy efficient polyphase component implementation of maximally decimated, i. e. nonredundant, filter banks. An insight into the multi-unitary signal decomposition is provided. It is shown that the multiple-bases representation leads to an efficient computation of frequency domain representations of signals on a dense not necessarily uniform frequency grid. It is also shown that the multiple-bases representation can be useful in the detection of tones in digital implementations of multifrequency signaling, and in receivers of chirp systems. A proof is provided that there are possible benefits of the multiple-bases representations in de-noising applications.

The MC-CDMA (multi-carrier code division multiple access) technique is known to be appropriate for high data-rate wireless communications such as mobile multimedia communication due to its robustness to multipath fading and its capability of handling high data rates with a simple one-tap equalizer. In this paper, the performance of an MC-CDMA system employing antenna array at the base station in a fading channel is presented. Following the discussion of optimal beamformer not requiring explicit DOA (direction of arrival) or training signals, it is shown that the interference from other users within a cell can be significantly reduced for both reverse link (mobile to base station) and forward link (base station to mobile) using an MC-CDMA with antenna array, thus increasing the system's user-capacity. Computer simulations that demonstrate user-capacity improvement of the proposed approach are discussed.

In this paper, we propose an analytic method for dimensioning traffic descriptors at the leaky bucket-based UPC for VBR MPEG video traffic on ATM networks. We analytically derived cell violation probabilities at the UPC by using a proposed scene-based video traffic model, and then we showed that it was possible to select sets of traffic descriptors that produce the required violation probability. In two example video traces, the numerical results showed that our proposed traffic descriptor dimensioning method well approximated the simulation-based traffic control results of the real video traces. In cases where an effective bandwidth allocation method based on the ON/OFF model was used for the call admission control in the networks, we compared the allocated effective bandwidth to each set of traffic descriptors that produced zero UPC losses.

This paper reports the design and characteristics of an aerial optical drop cable incorporating electric power wires, which was developed for a new π-system. The new system is called the power supply HUB π-system, in which commercial AC electric power is received at a central location of several optical network units (ONUs), and is distributed to each ONU by the aerial optical/electric drop cable. We describe the requirements for the cable, which guarantee a 20-year lifetime. We designed the cross-sectional structure of the cable, based on system requirements and operation requirements, and determined the strength wire type and diameter, based on the optical fiber failure prediction theory and a cable strain requirement. We confirmed that the cables, manufactured as a trial, have stable characteristics, which satisfy the above requirements. The optical/electric drop cables will be introduced in autumn 1999.

This paper proposes applying fast transmit power control (TPC) to the forward link of a direct sequence-code division multi-access (DS-CDMA) cellular system. Orthogonal spreading is assumed at a base station transmitter and coherent RAKE combining is assumed at a mobile station receiver. In DS-CDMA cellular mobile radio, the multiple access interference (MAI) from other cells and background noise limit the forward link capacity. Therefore, to increase the link capacity, fast transmit power control (TPC) can be introduced, which is similar to that developed for the reverse link, i. e. , the transmit powers of forward link channels are independently raised or lowered according to the instantaneous signal-to-background noise plus interference ratios (SIR's) measured at mobile stations. Fast TPC is fast enough to track the multipath fading as well as slow variations in the distance-dependence path loss and shadowing. On the average, the transmit power is increased to a user closer to the cell edge so that the effects of both other-cell MAI and background noise can be reduced while it is decreased to a user closer to the cell center. The effect of the TPC parameters (TPC interval, TPC target value, TPC step size, etc) on the forward link capacity in single- and multi-cell environments is evaluated by computer simulation. It is shown that fast TPC can almost double the forward link capacity in a multi-cell environment.

The outage probability of a forward link DS-CDMA cellular system with fast transmit power control (TPC) based on signal-to-interference ratio (SIR) is investigated. The expression for SIR at the output of RAKE receiver is developed, and the outage probability is evaluated by using Monte Carlo simulation. We consider two kinds of channel models: random delay resolvable path model and tapped delay line model which are suitable models for a few distinct paths channel and highly frequency-selective-channel model, respectively. The outage probability of a system with fast TPC based on SIR is compared to that without fast TPC. The use of orthogonal spreading codes is compared to that of the random spreading codes in terms of outage probability. The effects of the maximum and minimum transmit powers and the dispersive loss of signal power on the outage probability are also investigated.

An analytical solution of the London equation for the weakly coupled grain model of high Tc superconducting thin films has been obtained in the case of finite thickness by taking full account of anisotropic conductivities. Using the solution, we provide general expressions for the transmission-line parameters of high Tc superconducting transmission lines. Dependences of the inductance and resistance on the grain size, coupling strength and film thickness have been numerically evaluated and discussed.

In this paper, we describe our superconducting digital technology that uses Nb/AlOx/Nb Josephson junctions. Superconducting devices have intrinsically superior characteristics than those of semiconductor devices, and Nb/AlOx/Nb junctions have ideal current-voltage characteristics for digital applications. Superconducting devices that use Nb/AlOx/Nb junctions have being actively developed because of their high speed and low power characteristics. Presently, we can fabricate more than twenty thousand junctions on one chip. Using niobium technology, a superconducting 4-kbit RAM has been already successfully developed. We have demonstrated the operation of a network system with a superconducting network chip. Some problems, such as difficulty in high-speed testing, disturbance from trapped magnetic flux and so on, have been overcome by techniques such as a clock-driven testing method, moat structures and so on. The developed technologies, such as the fabrication technology, the design technology for moat structures and so on, must become the basic keys for the development of digital applications based on a single flux quantum device, which will be a promising component for ultra-high speed systems in the twenty-first century.

Inductive Logic Programming (ILP) is a study of machine learning systems that use clausal theories in first-order logic as a representation language. In this paper, we survey theoretical foundations of ILP from the viewpoints of Logic of Discovery and Machine Learning, and try to unify these two views with the support of the modern theory of Logic Programming. Firstly, we define several hypothesis construction methods in ILP and give their proof-theoretic foundations by treating them as a procedure which complets incomplete proofs. Next, we discuss the design of individual learning algorithms using these hypothesis construction methods. We review known results on learning logic programs in computational learning theory, and show that these algorithms are instances of a generic learning strategy with proof completion methods.

This paper surveys recent progress in the investigation of the underlying discrete proximity structures of geometric clustering with respect to the divergence in information geometry. Geometric clustering with respect to the divergence provides powerful unsupervised learning algorithms, and can be applied to classifying and obtaining generalizations of complex objects represented in the feature space. The proximity relation, defined by the Voronoi diagram by the divergence, plays an important role in the design and analysis of such algorithms.

The noise level distribution owing to only a non-stationary working objective machine has been stochastically expressed by reflecting the temporal change of distribution parameters under a generalized regression model especially with aid of the vibration level observation. The proposed method has been applied to a noise evaluation of non-stationarily operated jigsaw.

With the advent of digital video and digital broadcasting, copyright protection of video data has been one of the most important issues. We present in this paper a novel method of digital watermark for video data based on the discrete wavelet transform. In this method, we embed the watermark in the lowest frequency components of each frame in the uncoded video by using a controlled quantization process. The watermark can be extracted directly from the decoded video without access to the original video. Experimental results show that the proposed method gives the watermarked image of better quality and is robust against MPEG coding and re-encoding. Furthermore, we discuss multiple watermarking with regard to the generational copy control for video contents.

A new efficient two-dimensional warping algorithm is presented, in which sub-optimal warping is attained by iterating DP-based local optimization of warp on partially overlapping subplane sequence. From an experimental comparison with a conventional approximation algorithm based on beam search DP, relative superiority of the proposed algorithm is established.

A support system for hepatectomy that allows segmentation of the liver interactively and directly on 3D images was developed. Intuitive 3D images of the liver and its vessels and tumors were drawn with an improved volume-rendering method. Regions supplied with blood by each branch were interactively identified. 3D segments were defined directly on the images using a mouse and excisions were estimated from these interactive inputs.

This paper proposes two topology discovery algorithms for IP networks, namely, a network layer topology discovery algorithm and a link layer topology discovery algorithm. The network layer topology discovery algorithm discovers the subnets and devices in the network of interest and the connections among them. The devices in a subnet can be found by a network layer topology discovery algorithm; however, the connections among the devices cannot be obtained. The link layer topology discovery algorithm is proposed to find the devices in a subnet and the connections among them. The two algorithm are integrated to find the detailed topology map of an IP network. The proposed topology discovery algorithms are implemented based on the Tcl/Tk and Scotty environment. Some implementation details are discussed.

Methods to discover laws are reviewed from among both statistical approach and artificial intelligence approach with more emphasis placed on the latter. Dimensions discussed are variable dependency checking, passive or active data gathering, single or multiple laws discovery, static (equilibrium) or dynamic (transient) behavior, quantitative (numeric) or qualitative or structural law discovery, and use of domain-general knowledge. Some of the representative discovery systems are also briefly discussed in conjunction with the methods used in the above dimensions.

This paper reviews design aspects of computational discovery systems through the analysis of some successful discovery systems. We first review the concept of viewscope/view on data which provides an interpretation of raw data in a specific domain. Then we relate this concept to the KDD process described by Fayyad et al. (1996) and the developer's role in computational discovery due to Langley (1998). We emphasize that integration of human experts and discovery systems is a crucial problem in designing discovery systems and claim together with the analysis of discovery systems that the concept of viewscope/view gives a way for approaching this problem.

We propose a new probabilistic ID-based non-interactive key sharing scheme that has non-separable secret-key functions and a non-separable common-key function. The proposed scheme uses the calculation over modulo-P, modulo-Q and over integer ring for realizing non-separability. This proposed scheme has a large threshold against linear attack by the collusive entities.

We introduce an efficient interpolation attack which gives the tighter upper bound of the complexity and the number of pairs of plaintexts and ciphertexts required for the attack. In the previously known interpolation attack there is a problem in that the required complexity for the attack can be overestimated. We solve this problem by first, finding the actual number of coefficients in the polynomial used in the attack by using a computer algebra system, and second, by finding the polynomial with fewer coefficients by choosing the plaintexts. We apply this interpolation attack to the block cipher SNAKE and succeeded in attacking many ciphers in the SNAKE family. When we evaluate the resistance of a block cipher to interpolation attack, it is necessary to apply the interpolation attack described in this paper.