The IETF Mobile IP defines two multicast options: remote subscription (RS) and bi-direction tunneling (BT). In order to synthesize the strong points of these two IETF multicast options, we propose a hybrid approach, mMOM, which selectively uses two IETF multicast options based on the mobility of mobile hosts. Whenever a mobile host requests its first registration to a certain foreign agent, the corresponding foreign agent starts the service using the BT option. Afterwards, if it requests re-registration to the same foreign agent, the foreign agent considers it to be relatively immobile and continues services using the RS option. We propose a new metric to compare heterogeneous algorithms. Simulation results show that our approach outperforms all others.

Angle-multiplexed holography using four-wave mixing (4WM) was demonstrated with a monolithic photorefractive carbazole trimer. We measured the diffraction efficiency as a function of incident angle of the read beam. The cross-talk was almost negligible at the Bragg angle mismatch of 1. Two figure images were recorded with the different incident angle of the reference beam in the photorefractive carbazole trimer film, and were read out independently by illuminating with the read beam which counter-propagated to the corresponding reference beam.

We consider the services of broadcasting short messages via forward signaling channels in wireless cellular networks. In the provision of such services, the negative effect of short messages on the delivery of delay-sensitive control messages must be restricted. On the other hand, it is desirable to accommodate the users' demands for service enhancements involving timeliness and informativeness. As a way to resolve such conflicting arguments, we present a generic scheme in which a short message may be rejected or removed according to the buffer occupancy at the base station and is split into a number of segments for the transmission across a forward signaling channel. However, the rejection, removal and segmentation exhibit a trade-off among several facets of service enhancements. Thus, for a quantitative evaluation of the scheme and efficient optimization of design parameters, we develop an analytical method to calculate the moments of delay times experienced by control and short messages at a base station. Using the analytical method, we investigate the delay and loss performance of control and short messages with respect to the message load and short message length.

Digitalization in electronic systems requires the electronics devices in de-coupler sets with low impedance at high frequency, and high reliability. A shield strip type line component with aluminum substrate, its surface oxidized dielectric layer and a conducting polymer electrolyte has been developed. The conducting polymers of polypyrrole and poly(3,4-ethylenedioxythiophene) have been formed by direct chemical oxidative polymerization and electrochemical polymerization on a dielectric layer. Thus, the surface of the dielectric layer is covered with conducting polymer films. The structure of the line component is strip line conformation just like a crushed coaxial cable with in-put and out-put terminals surrounded by the conducting polymer electrolyte. Two types of the components, i.e., a large surface area, 10 20 mm, and a small surface area, 4 4 mm, have been fabricated with polypyrrole and poly(3,4-ethylenedioxythiophene), respectively. The dielectric properties of these line components have been investigated with a Impedance/Gain-phase analyzer and a network analyzer. Due to the high conductivity of the polymer electrolytes, the line components demonstrate low impedance at resonance frequency. Regarding the frequency characteristics of the line components, the impedance and ESR at high frequency are lower than those of the conventional capacitors. Furthermore, the transfer coefficients, S21, are three orders lower than those of other capacitors in a wide frequency band from 10 kHz to 6 GHz. The results indicate the excellent characteristics of the line components for the power line de-coupler set at the boundary of the closed circuit unit.

To estimate inner multi-layer tissue conductivity distribution in a cross section of the local tissue by using bioresistance data measured noninvasively on the surface of the tissue, a measurement method using divided electrodes is proposed, where a current electrode is divided into several parts. The method is evaluated by computer simulations using a three-dimension (3D) model and two two-dimension (2D) models. In this paper, conductivity distributions of the simplified (2D) model are analyzed based on a combination of a finite difference method (FDM) and a steepest descent method (SDM). Simulation results show that conductivity values for skin, fat and muscle layers can be estimated with an error less than 0.1%. Even though different strength random noise is added to measured resistance values, the conductivities are estimated with reasonable precise, e.g., the average error is about 4.25% for 10% noise. The configuration of the divided electrodes are examined in terms of dividing pattern and the size of surrounding guard electrodes to confine and control the input currents from the divided electrodes within a cross sectional area in the tissue.

This paper proposes a fast method for the calculation of exponential B-splines sampled at regular intervals. This algorithm is based on a combination of FIR and IIR filters which enables a fast decomposition and reconstruction of a signal. When complex values are selected for the parameters of the exponentials, complex trigonometric functions are obtained. Only the real part of these functions are used for the interpolation of real signals, leading less bandlimited signals when they are compared with the polynomial B-spline counterparts. These characteristics were verified with 1-D and 2-D examples. This paper also discusses the effectiveness of exponential B-splines, when they are applied to image processing.

Photoirradiation effects on the polymer light-emitting devices (PLEDs) with a semitransparent-Al cathode have been studied. A light-emitting polymers, a poly (p-phenylene vinylene) derivative MDOPPV has been used in this study. Upon photoirradiation, the emission intensity at a constant voltage was rapidly decreased. However, the quantum efficiency of electroluminescence remained constant, indicating the spatial separation between recombination zone and photooxidized defects. On the other hand, the quantum efficiency of photoluminescence rapidly dropped upon similar photoirradation. These can be understood by taking the difference in the spatial distribution and the origin of excitons between electro- and photo-luminescence processes. It was also found that the photooxidation rate of the polymer film whose thickness is ca. 100 nm does not have thickness dependence, suggesting that the photooxidation of the polymer proceeds uniformly throughout the device.

An LMS adaptive digital filter using distributed arithmetic (DA-ADF) has been proposed. Cowan and others proposed the DA adaptive algorithm with offset binary coding for the simple derivation of an algorithm and the use of an odd-symmetry property of adaptive function space (AFS). However, we indicated that a convergence speed of this DA adaptive algorithm degraded extremely by our computer simulations. To overcome these problems, we have proposed the DA adaptive algorithm generalized with two's complement representation and effective architectures. Our DA-ADF has performances of a high speed, small output latency, a good convergence speed, small-scale hardware and lower power dissipation for higher order, simultaneously. In this paper, we analyze a convergence condition of DA adaptive algorithm that has never been considered theoretically. From this analysis, we indicate that the convergence speed is depended on a distribution of eigenvalues of an auto-correlation matrix of an extended input signal vector . Furthermore, we obtain the eigenvalues theoretically. As a result, we clearly show that our DA-ADF has an advantage of the conventional DA-ADF in the convergence speed.

A generic multilevel quality-of-service (QoS) model for distributed multimedia applications is presented. QoS mapping mechanisms are required to translate the QoS parameters among the hierarchical levels. One QoS mapping mechanism based on the spline functions is proposed, hence two splines are compared. One is natural splines and the other is B-splines. QoS measurement experiments were conducted, and it is found that the B-splines give more accurate mapping results than the natural splines once the knots for the splines are selected appropriately.

This paper presents a formal verification method based on logic simulation. In our method, some restricted class of circuits which include data paths can be verified without abstraction of data paths by using symbolic values. Our verifier extracts a transition relation from the state graph (given as a specification) which is expressed using symbolic values, and verifies based on simulation using those symbolic values if the circuit behaves correctly with respect to each transition of the specification. If the verifier terminates with "correct," then it can be guaranteed that for any applicable input vector sequence, the circuit and the specification behaves identically. We have implemented the proposed method on a Unix workstation and verified some FIFO and LIFO circuits by using it.

Semistructured data comprises irregular structure and has no a-priori database schema, therefore we encounter several problems such as inefficient data retrieval and wasteful data storage. To cope with such problems, some schema extraction algorithms over semistructured data have been proposed, in which data is modeled as an unordered tree. However, the order of elements is indispensable for document data, therefore we consider extracting an optimal database schema over an ordered tree. We consider an optimization problem to extract a smallest database schema such that the density of each class is no less than a given threshold, where the density of a class represents a similarity between the type of the class and those of the objects in the class. We first prove that the corresponding decision problem is strongly NP-complete, and show that another version of the problem is strongly NP-hard and belongs to Δ2 P. Then we show that for any r < 3/2, there is no polynomial-time r-approximation algorithm that solves the optimization problem unless P = NP. Finally, we propose a kind of class called bounded class that can be constructed efficiently, then show a polynomial-time algorithm for constructing a database schema by using bounded classes.

We propose a new effective method of managing flash memory space for flash memory-specific file systems based on a log-structured file system. Flash memory has attractive features such as non-volatility and fast I/O speed, but it also suffers from inability to update in situ and from limited usage (erase) cycles. These drawbacks necessitate a number of changes to conventional storage (file) management techniques. Our focus is on lowering cleaning cost and evenly utilizing flash memory cells while maintaining a balance between these two often-conflicting goals. The proposed cleaning method performs well especially when storage utilization and the degree of locality are high. The cleaning efficiency is enhanced by dynamically separating cold data and non-cold data, which is called 'collection operation.' The second goal, that of cycle-leveling, is achieved to the degree that the maximum difference between erase cycles is below the error range of the hardware. Experimental results show that the proposed technique provides sufficient performance for reliable flash storage systems.

This paper presents a child verb learning model mainly based on syntactic bootstrapping. The model automatically learns 4-5-year-old children's linguistic knowledge of verbs, including subcategorization frames and thematic roles, using a text in dialogue format. Subcategorization frame acquisition of verbs is guided by the assumption of the existence of nine verb prototypes. These verb prototypes are extracted based on syntactic bootstrapping and some psycholinguistic studies. Thematic roles are assigned by syntactic bootstrapping and other psycholinguistic hypotheses. The experiments are performed on the data from the CHILDES database. The results show that the learning model successfully acquires linguistic knowledge of verbs and also suggest that psycholinguistic studies of child verb learning may provide important hints for linguistic knowledge acquisition in natural language processing (NLP).

The current paper proposes a new method for reducing the computational overhead of fine-to-coarse multi-resolution motion estimation (MRME) on the finest resolution level based on limiting the search region used to consider the motion vectors from the coarsest resolution subband. Half-pel accuracy motion estimation (HPAME) is used in the baseband to achieve an exact motion vector, which has a significant influence on the reconstructed image. However, since this method involves a high computational overhead, the use of selective interpolation is suggested to reduce the computational overhead. The proposed method uses HPAME to estimate exact motion vectors in the baseband, then based on the characteristics of these motion vectors, the motion vectors in the higher frequency subbands are selectively estimated. That is, motion vectors in the higher frequency subbands are only estimated for those blocks with half-pixel accuracy motion vectors in the baseband. Experimental results show that the proposed algorithm can produce better image quality results than the conventional algorithms.

Many researches have been conducted on the recognition of Thai characters. Different approaches, such as neural network, syntactic, and structural methods, have been proposed. However, the success in recognizing Thai characters is still limited, compared to English characters. This paper proposes an approach to recognize the printed Thai characters using the hybrid of global feature, local features, fuzzy membership function and the neural network. The global feature classifies all characters into seven main groups. Then the local features and the neural network are applied to identify the characters.

This paper describes a new approach to the digital watermarking of motion pictures dedicatedly for the MPEG-4 video coding, which intends to enhance the error detection ability. The conventional method lacks not only the detection ability but also the compatibility with video decoders widely used today. Thus in this approach the digital watermarks are to be embedded into the quantized DCT (Discrete Cosine Transform) coefficients for the error detection, where the prevention of the picture quality degradation is also attempted. Experimental results are shown to demonstrate that the error detection ability of the proposed approach is significantly improved, as compared with that of the conventional method, and that the degradation of the picture quality by the watermarking is extremely small.

It have been one open and significant topic for real-time applications to enhance the processing-speed of Boltzmann machines for long time. One effective way of solution of this problem is the augmentation of probability of neurons' state move. In this paper, a novel method, called a rejectionless method, was proposed and introduced into the Boltzmann machines for this augmentation. This method has a feature of independence on the ratio of neurons' state move. The efficiency of this method for speed-up was confirmed with the experiments of TSP and graph problem.

Since the invention of the RSA scheme, a lot of public-key encryption and signature schemes based on the intractability of integer factoring have been proposed. Most employ integers of the form N = p q, such as the RSA scheme, but some employ integers of the form N = pr q. It has been reported that RSA decryption speed can be greatly improved by using N = pr q integers for large r. On the other hand, Boneh et al. proposed a novel integer factoring method for integers such as N = pr q for large r. This factoring algorithm, the so-called Lattice Factoring Method, is based on the LLL-algorithm. This paper proposes a new method for factoring integers of the form N = pr q for large r and gives a new characterization of r such that factoring integers N = pr q is easier. More precisely, the proposed method strongly depends on the size and smoothness of the exponent, r. The theoretical consideration of and implementation of our method presented in this paper show that if r satisfies a certain condition our method is faster than both Elliptic Curve Method and Lattice Factoring Method. In particular, the theoretical consideration in this paper mainly employs the techniques described in the excellent paper by Adleman, Pomerance and Rumely that addresses primality testing.

Cutoff frequencies and the modal fields in hollow conducting waveguides of arbitrary cross section are frequently calculated by the method of solving integral equations. This paper presents some improvements for the method by the integral equations. The improved method can calculate the cutoff frequencies and the modal fields only by using the real number, and this method can remove extraneous roots when calculating the cutoff frequencies. The former method calculates the cutoff frequency and the fields only at the cutoff frequency, but the improved method can calculate the fields at arbitrary phase constants.

In this letter, we propose a spatially adaptive image restoration algorithm, using local statistics. The local variance, mean and maximum value are utilized to constrain the solution space. These parameters are computed at each iteration step using partially restored image. A parameter defined by the user determines the degree of local smoothness imposed on the solution. The resulting iterative algorithm exhibits increased convergence speed when compared with the non-adaptive algorithm. In addition, a smooth solution with a controlled degree of smoothness is obtained. Experimental results demonstrate the capability of the proposed algorithm.