This paper presents a new mobility protocol that supports multiple namespaces on IPv6 networks. Our proposed protocol framework allows a mobile node to specify a correspondent node by a name that is defined in any namespace as a node identifier. This technique removes certain restrictions on the space of node identifiers and allows mobile nodes to communicate with each other regardless of their location. Mobile nodes negotiate a pseudo node identifier, which is unique between the two nodes, with a correspondent node that is identified by the name. We make this pseudo node identifier compatible with the IPv6 address format; we can thus use existing IPv6 applications with our proposed mobility framework. This framework is based on Location Independent Network Architecture (LINA), and provides mobility support in a simple fashion and with low protocol overhead. We also demonstrate how to provide anonymity to our mobility protocol by using a dynamic pseudo node identifier. Our prototype implementation shows minimal overhead compared to a conventional IPv6 implementation.

This paper describes a method of test data compression for a given test set using statistical encoding. In order to maximize the effectiveness of statistical encoding, the method first converts some specified input values in the test set to unspecified ones without losing fault coverage, and then reassigns appropriate logic values to the unspecified inputs. Experimental results for ISCAS-89 benchmark circuits show that the proposed method can on the average reduce the test data volume to less than 25% of that required for the original test set.

To realize the hardware object which facilitates the application development in the reconfigurable computing system, a hardware module (HwModule) is proposed and implemented. To access the circuit in the HwModule from the standard PC without detailed knowledge of the hardware, an object manager (ObjectManager) is also implemented. With the help of the ObjectManager, the programmers can use the hardware objects like the usual software objects. The HwModule is applied to the image matching, and the easiness of the application development for the HwModule is confirmed.

In this paper a new adaptive multi-input multi-output (MIMO) channel estimation and multiuser detection algorithm based kernel space iterative inversion is proposed. The functions of output signals are mapped from a low dimensional space to a high dimensional reproducing kernel Hilbert space. The function of the output signals is represented as a linear combination of a set of basis functions, and a Mercer kernel function is constructed by the distribution function. In order to avoid finding the function f(.) and g(.), the correlation among the output signals is calculated in the low dimension space by the kernel. Moreover, considering the practical application, the algorithm is extended to online iteration of mixture system. The computer simulation results illustrated that the new algorithm increase the performance of channel estimation, the global convergence, and the system stability.

This paper deals with the statistical modeling of a Time-Frequency Series of Speech (TFSS), obtained by Short-Time Fourier Transform (STFT) analysis of the speech signal picked up by a linear microphone array with two elements. We have attempted to find closer match between the distribution of the TFSS and theoretical distributions like Laplacian Distribution (LD), Gaussian Distribution (GD) and Generalized Gaussian Distribution (GGD) with parameters estimated from the TFSS data. It has been found that GGD provides the best models for real part, imaginary part and polar magnitudes of the time-series of the spectral components. The distribution of the polar magnitude is closer to LD than that of the real and imaginary parts. The distributions of the real and imaginary parts of TFSS correspond to strongly LD. The phase of the TFSS has been found uniformly distributed. The use of GGD based model as PDF in the fixed-point Frequency Domain Independent Component Analysis (FDICA) provides better separation performance and improves convergence speed significantly.

A time-domain equalization (TEQ) algorithm is presented to shorten the effective channel impulse response to increase the transmission efficiency of the 54 Mbps IEEE 802.11a orthogonal frequency division multiplexing (OFDM) system. In solving the linear equation Aw = B for the optimum TEQ coefficients, A is shown to be Hermitian and positive definite. The LDLT and LU decompositions are used to factorize A to reduce the computational complexity. Simulation results show high performance gains at a data rate of 54 Mbps with moderate orders of TEQ finite impulse response (FIR) filter. The design and implementation of the algorithm in field programmable gate array (FPGA) are also presented. The regularities among the elements of A are exploited to reduce hardware complexity. The LDLT and LU decompositions are combined in hardware design to find the TEQ coefficients in less than 4 µs. To compensate the effective channel impulse response, a radix-4 pipeline fast Fourier transform (FFT) is implemented in performing zero forcing equalization. The hardware implementation information is provided and simulation results are compared to mathematical values to verify the functionalities of the chips running at 54 Mbps.

Automata based image compression methods exploit similarities in the images to reduce the amount of memory to the essential. Our cellular automata methods are motivated due to the fact that they may be used to create images on liquid crystal displays when we add some computational functionality to the displays. For this purpose we consider image generation methods in cellular automata with some reasonable restrictions and get a representation where the color values of the images can be derived directly from the single cell states. We are interested in the capabilities of such devices and provide some benefits of this representation in image compression, even in higher dimensions.

The descriptional complexity of iterative arrays (IAs) is studied. Iterative arrays are a parallel computational model with a sequential processing of the input. It is shown that IAs when compared to deterministic finite automata or pushdown automata may provide savings in size which are not bounded by any recursive function, so-called non-recursive trade-offs. Additional non-recursive trade-offs are proven to exist between IAs working in linear time and IAs working in real time. Furthermore, the descriptional complexity of IAs is compared with cellular automata (CAs) and non-recursive trade-offs are proven between two restricted classes. Finally, it is shown that many decidability questions for IAs are undecidable and not semidecidable.

Interval arithmetic is able to be applied when we include the ranges of various functions. When we include them applying the interval arithmetic, the serious problem that the widths of the range inclusions increase extremely exists. In range inclusion of polynomials particularly, Horner's method and Alefeld's method are well known as the conventional methods which mitigates this problem. The purpose of this paper is to propose the new methods which are able to mitigate this problem more efficiently than the conventional methods. And in this paper, we show and compare the efficiencies of the new methods by some numerical examples.

The bi-level digital video, because of its simplicity and compactness, can be utilized to provide for a quick and faithful preview of its original content. The proposed bi-level digital video compression technique exploits the context-based probabilistic estimation model towards adaptive pixel prediction which can be used towards generating residual image frames which may then be Run-Length-Rice coded. Towards promoting error-resiliency and random-access, each bi-level digital video frame may be typed into either intra- or inter- picture format. The proposed technique can be seen, in comparison to existing JBIG compression technologies in simulation runs, to provide added temporal redundancy removal.

In this paper, we discuss the performance of a basic scheme to support network mobility. Network mobility arises when an entire network segment, such as a network inside a vehicle, changes its topological location and thus its access point to the fixed backbone network. Mechanisms to support network mobility are necessary to maintain sessions. The approach followed by the IETF (NEMO Basic Support) and us (B-ORC) is to establish a bi-directional tunnel between the mobile network and the Internet. As we show, this bi-directional tunnel is a performance bottleneck and leads to single points of failure. In order to address the issues of the existing mobile network architecture, we propose enhanced operations of the basic mobile network protocol to achieve reliability and efficiency: (1) multiple bi-directional tunnels between the mobile network and the Internet, and (2) policy-based routing. The proposed operations could be realized by extending the existing architecture and protocol. The performance of various multihoming configurations is evaluated based on the implementation of our own basic scheme. The evaluation criteria are delay, throughput and latency. The results are encouraging and show we can achieve a better throughput.

In this paper, we present a flexible distributed computing system in which it is very easy to add required computing components at any time. The system is an Internet-based solution, and mainly developed by Java and XML. Moreover, by implementing a new configuration of computing information that is setting up Public Information and Private Information, the system can accommodate various computing requests, and facilitate a flexible design. Additionally, to show the practical merit, as an example of signal processing, we presented how to apply our proposed system to selection of a suitable artificial neural network.

Non-repudiation is a basic security requirement for electronic business applications to protect against a sender's false denial of having created and sent a message. Typically non-repudiation protocols are constructed based on digital signatures. However, there has been no theoretical treatment of such non-repudiation protocols. In this paper, we provide a formal security definition of non-repudiation protocols and analyze the security of a signature-based protocol. Our security definition and analysis are based on Canetti's framework of universally composable security.

We present a learning algorithm of the Hopfield neural network for minimizing edge crossings in linear drawings of nonplanar graphs. The proposed algorithm uses the Hopfield neural network to get a local optimal number of edge crossings, and adjusts the balance between terms of the energy function to make the network escape from the local optimal number of edge crossings. The proposed algorithm is tested on a variety of graphs including some "real word" instances of interconnection networks. The proposed learning algorithm is compared with some existing algorithms. The experimental results indicate that the proposed algorithm yields optimal or near-optimal solutions and outperforms the compared algorithms.

A simple and efficient context modeling technique (CM-WDR) is proposed to improve the performance of the wavelet difference reduction (WDR) algorithm for image compression. The CM-WDR employs an adaptive scanning order by context modeling. The PSNR improvement over WDR ranges from 0.1 to 1.5 dB at various bitrates.

A mathematical theory is proposed based on the concept of functional analysis, suitable for operation of network systems extraordinarily complicated and diversified on large scales, through connected-block structures. Fundamental conditions for existence and evaluation of system behaviors of such network systems are obtained in a form of fixed point theorem for system of nonlinear mappings.

Simply-typed term rewriting systems (STRSs) are an extension of term rewriting systems. STRSs can be naturally handle higher order functions, which are widely used in existing functional programming languages. In this paper we design recursive and lexicographic path orders, which can efficiently prove the termination of STRSs. Moreover we discuss an application to the dependency pair and the argument filtering methods, which are very effective and efficient support methods for proving termination.

We propose a novel method for Web page grouping based only on hyperlink information. Because of the explosive growth of the World Wide Web, page grouping is expected to provide a general grasp of the Web for effective information search and netsurfing. The Web can be regarded as a gigantic digraph where pages are vertices and links are arcs. Our grouping method is a generalization of decomposition into strongly connected components, in which each group is constructed as a subset of a strongly connected component. Moreover, group sizes can be controlled by adjusting a parameter, called the threshold parameter. We call the resulting groups parameterized connected components (PCCs). The algorithm is simple and admits parallelization. Notably, we apply Dijkstra's shortest path algorithm in our grouping method. This paper also includes experimental results for 15 million Web pages, which show the contribution of our method to efficient Web surfer navigation.

In this paper, we propose a new counting scheme for m n contingency tables. Our scheme is a modification of Dyer and Greenhill's scheme for two rowed contingency tables. We can estimate not only the sizes of error, but also the sizes of the bias of the number of tables obtained by our scheme, on the assumption that we have an approximate sampler.

Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a self-stabilizing heuristic solution to the problem. Our algorithm is constructed by four layered modules (sub-algorithms): construction of a shortest path forest, transformation of the network, construction of a minimum spanning tree, and pruning unnecessary links and processes. Competitiveness is 2(1-1/l), where l is the number of leaves of optimal solution.