Recently, Muramatsu proposed source coding algorithms that use the randomness of a past sequence. The technique of his source coding algorithms is one method of constructing codes from the technique of random coding. By using his technique, we propose a channel coding algorithm with random numbers which can be observed by both the encoder and the decoder where the random numbers are independent of the messages to be transmitted. Then the proposed coding algorithm can transmit messages over a discrete memoryless channel up to the channel capacity with an arbitrarily small decoding error rate and arbitrarily small bits of random numbers per message transmission asymptotically.

Applying the formerly proposed classification framework for first order line search optimization techniques we introduce novel superlinear first order line search methods. Novelty of the methods lies in the line search subproblem. The presented line search subproblem features automatic step length and momentum adjustments at every iteration of the algorithms realizable in a single step calculation. This keeps the computational complexity of the algorithms linear and does not harm the stability and convergence of the methods. The algorithms have none or linear memory requirements and are shown to be convergent and capable of reaching the superlinear convergence rates. They were practically applied to artificial neural network training and compared to the relevant training methods within the same class. The simulation results show satisfactory performance of the introduced algorithms over the standard and previously proposed methods.

Modern spaceborne precision radar altimeters transmit radio signals of a spectrum bandwidth up to 300 MHz, but the bandwidth should be still increased for precise estimation of the roughness of the sea surface. In this research, the influence of the ionosphere on wideband radar signals is investigated and then it is shown that the signals are strongly influenced by the dispersive distortions in the atmosphere of the Earth even in Ku-band. Finally, the allowable bandwidth of a space borne precision radar altimeter signals is estimated, at which we could ignore the presence of these distortions.

Modern video compression usually consists of ME/MC (Motion Estimation/Motion Compensation), transform, and quantization of the transform coefficients. Efficient bit allocation technique to distribute available bits to motion parameters and quantized coefficients is an important part of the whole system. A method that is very complex and/or needs buffering of many future frames is not suitable for real time application. We develop an efficient bit allocation technique that utilizes the estimated effect of allocated bits to motion parameter and quantization on the overall quality. We also propose an hierarchical block based ME/MC technique that requires less computations than classical BMA (Block Matching Algorithm) while offering better motion estimation.

In 1960, the famous computer pioneer J.C.R. Licklider described a vision for human-computer interaction that he called "man-computer symbiosis. " Licklider predicted the development of computer software that would allow people "to think in interaction with a computer in the same way that you think with a colleague whose competence supplements your own. " More than 40 years later, one rarely encounters any computer application that comes close to capturing Licklider's notion of human-like communication and collaboration. We echo Licklider by arguing that true symbiotic interaction requires at least the following three elements: a complementary and effective division of labor between human and machine; an explicit representation in the computer of the user's abilities, intentions, and beliefs; and the utilization of nonverbal communication modalities. We illustrate this argument with various research prototypes currently under development at Mitsubishi Electric Research Laboratories (USA).

A post-wall waveguide-fed parallel plate slotted array is an attractive candidate for high efficiency and mass producible planar array antennas for millimeter wave applications. For the slot design of this large sized array, a periodic boundary wall model based on the assumption of infinite array size and a parallel waveguide is used. In fact, the aperture is large but still finite (10-40 wavelength) and the TEM-like wave is perturbed due to the narrow walls at the periphery of the aperture as well as the slot coupling; antenna efficiency is affected by the size and the aspect ratio of the aperture. All these observations imply the unique defects of oversized waveguide arrays. In this paper, the aperture efficiency of post-wall waveguide arrays is assessed as a function of size and aspect ratio of the aperture for the first time, both in theory and measurement. An effective field analysis for an electrically large oversized waveguide array, developed by the author, is utilized for determining the slot excitation coefficients and aperture illumination. It is predicted that the oversized waveguide array has a potential efficiency of 80-90% if the aperture is larger than 18 wavelength on a side and the gain is more than 30 dBi. A transversely wide aperture generally provides higher efficiency than a longitudinally long aperture, provided a perfectly uniform TEM wave would be launched from the feed waveguide.

A low cost printed omni-directional spiral-mode mono-pole antenna for wireless communication applications has been designed. This antenna has an integrated open-stub to adjust impedance matching. The 10 dB bandwidth is 336 MHz that achieved 13.7 and radiating characteristics are presented.

Structural learning algorithms are obtained by adding a penalty criterion (usually comes from the network structure) to the conventional criterion of the sum of squared errors and applying the backpropagation (BP) algorithm. This problem can be viewed as a constrained minimization problem. In this paper, we apply the Lagrangian differential gradient method to the structural learning based on the backpropagation-like algorithm. Computational experiments for both artificial and real data show that the improvement of generalization performance and the network optimization are obtained applying the proposed method.

In order to perform the registration of virtual objects in vision-based augmented reality systems, the estimation of the relation between the real and virtual worlds is needed. This paper presents a three-point vision-based registration method for video see-through augmented reality systems using binocular cameras. The proposed registration method is based on a combination of monocular and stereoscopic registration methods. A correction method that performs an optimization of the registration by correcting the 2D positions in the images of the marker feature points is proposed. Also, an extraction strategy based on color information is put forward to allow the system to be robust to fast user's motion. In addition, a quantification method is used in order to evaluate the stability of the produced registration. Timing and stability results are presented. The proposed registration method is proven to be more stable than the standard stereoscopic registration method and to be independent of the distance. Even when the user moves quickly, our developed system succeeds in producing stable three-point based registration. Therefore, our proposed methods can be considered as interesting alternatives to produce the registration in binocular augmented reality systems when only three points are available.

Internet traffic engineering is much important for Internet Service Providers (ISPs) today, since it can be used to fully utilize already deployed network resources. For ISPs, the requirements for traffic engineering should be simple, easy to configure, cost-effective and efficient. Based on these considerations, we propose an algorithm called Web First Adaptive Traffic Engineering (WFATE). Since World Wide Web (WWW) services dominate most of the total Internet traffic and WWW flows are not long-lived, we only apply load balancing to WWW traffic in the algorithm. It can be shown that the number of coexistent WWW flows at an ingress node is almost certainly below a bound, and thus a forward-per-flow mechanism without keeping track of the state of each flow is feasible. This mechanism can balance traffic load at fine granularity and therefore get better performance. Through simulations and performance comparison, it is shown that WFATE is quite efficient, which can improve the network throughput averagely by 26% under the "dense source" traffic pattern and 9% under the "sparse source" traffic pattern.

This paper takes full advantage of polarimetric scattering parameters and total power to classify polarimetric SAR image data. The parameters employed here are total power, polarimetric entropy, and averaged alpha angle (alphabar). Since these parameters are independent each other and represent all the scattering characteristics, they seem to be one of the best combinations to classify Polarimetric Synthetic Aperture Radar (POLSAR) images. Using unsupervised classification scheme with iterative Maximum Likelihood classifier, it is possible to decompose multi-look averaged coherency matrix with complex Wishart distribution effectively. The classification results are shown using Pi-SAR image data set comparing with other representative methods.

We analyze the Lagarias-Odlyzko low-density attack precisely, and show that this low-density attack can be applied to the Chor-Rivest and the Okamoto-Tanaka-Uchiyama cryptosystemes, which are considered to be secure against the low-density attack. According to our analysis, these schemes turn out to be no longer secure against the low-density attack.

This letter shows the performance comparisons of several different rate scheduling schemes for non-real time data service over the uplink of burst switching-based direct sequence code division multiple access (DS/CDMA) system to support the integrated voice/data service. The closed-form solution of optimal scheduling formulation, which minimizes average transmission delay when all of the active data users are transmitting simultaneously, is presented and mathematical analyses with other rate scheduling schemes, which provide efficiency criterion of transmission delay for rate scheduling schemes, are performed. Numerical results show the analyses explicitly.

The concepts of M-convexity and L-convexity, introduced by Murota (1996, 1998) for functions on the integer lattice, extract combinatorial structures in well-solved nonlinear combinatorial optimization problems. These concepts are extended to polyhedral convex functions and quadratic functions on the real space by Murota-Shioura (2000, 2001). In this paper, we consider a further extension to general convex functions. The main aim of this paper is to provide rigorous proofs for fundamental properties of general M-convex and L-convex functions.

In this paper, a simple blind algorithm for a beamforming antenna is proposed. This algorithm exploits the property of cyclostationary signals whose cyclic autocorrelation function depends on delay as well as frequency. The cost function is the mean square error between the delay product of the beamformer output and a complex exponential. Exploiting the delay greatly reduces the possibility of capturing undesired signals. Through analysis of the minima of the non-quadratic cost function, conditions to extract a single signal are derived. Application of this algorithm to code-division multiple-access systems is considered, and it is shown through simulation that the desired signal can be extracted by appropriately choosing the delay as well as the frequency.

The notion of k-wise independent permutations has several applications. From the practical point of view, it often suffices to consider almost (i.e., ε-approximate) k-wise independent permutation families rather than k-wise independent permutation families, however, we know little about how to construct families of ε-approximate k-wise independent permutations of small size. For any n > 0, let Sn be the set of all permutations on {0,1,..., n - 1}. In this paper, we investigate the size of families of ε-approximate k-wise independent permutations and show that (1) for any constant ε 0, if a family Sn of permutations is ε-approximate k-wise independent, then || n(n - 1) (n - k + 1) if ε< 1; || {n(n - 1) (n - k + 1)}/(1 +ε) otherwise; (2) for any constant 0< ε 1, there exists a family Sn of ε-approximate k-wise independent permutations such that || = ; (3) for any constant ε> 0 and any n = pm - 1 with p prime, it is possible to construct a polynomial time samplable family Sn of ε-approximate pairwise independent permutations such that || = O(n(n - 1)/ε); (4) for any constant ε> 0 and any n = pm with p prime, it is possible to construct a polynomial time samplable family Sn of ε-approximate 3-wise independent permutations such that || = O(n(n - 1)(n - 2)/ε). Our results are derived by combinatorial arguments, i.e., probabilistic methods and linear algebra methods.

We presented a wall charge controlled ac PDP driving method which has advantages of less number of sub-fields and no dynamic false contours compared to the conventional driving method. In this method, a sub-field exhibited different light intensity according to the initial wall charge quantity set during the address period. Even though one can set 10 different wall charge states by changing the data pulse widths, we decided to define three states, 'on,' 'half-on,' and 'off.' By adding one state, the number of sub-field required to achieve 243 gray levels was reduced from 8 to 5. Furthermore, one can realize seven sub-fields, 255 gray level, complete stretched-out coding with which one can eliminate the dynamic false contours. Since this method can reduce number of sub-fields, it is suitable for higher resolution PDP's with more scan lines.

This paper describes an adaptive fingerprint-sensing scheme for a user authentication system with a fingerprint sensor LSI to obtain high-quality fingerprint images suitable for identification. The scheme is based on novel evaluation indexes of fingerprint-image quality and adjustable analog-to-digital (A/D) conversion. The scheme adjusts dynamically an A/D conversion range of the fingerprint sensor LSI while evaluating the image quality during real-time fingerprint-sensing operation. The evaluation indexes pertain to the contrast and the ridgelines of a fingerprint image. The A/D conversion range is adjusted by changing quantization resolution and offset. We developed a fingerprint sensor LSI and a user authentication system to evaluate the adaptive fingerprint-sensing scheme. The scheme obtained a fingerprint image suitable for identification and the system achieved an accurate identification rate with 0.36% of the false rejection rate (FRR) at 0.075% of the false acceptance rate (FAR). This confirms that the scheme is very effective in achieving accurate identification.

We propose a method for reducing the size of a share in visual secret sharing schemes. The proposed method does not cause the leakage and the loss of the original image. The quality of the recovered image is almost same as that of previous schemes.

In a two-microphone approach, interchannel differences in time (ICTD) and interchannel differences in sound level (ICLD) have generally been used for sound source localization. But those cues are not effective for vertical localization in the median plane (direct front). For that purpose, spectral cues based on features of head-related transfer functions (HRTF) have been investigated, but they are not robust enough against signal variations and environmental noise. In this paper, we use a "profile" as a cue while using a combination of reflectors specially designed for vertical localization. The observed sound is converted into a profile containing information about reflections as well as ICTD and ICLD data. The observed profile is decomposed into signal and noise by using template profiles associated with sound source locations. The template minimizing the residual of the decomposition gives the estimated sound source location. Experiments show this method can correctly provide a rough estimate of the vertical location even in a noisy environment.