Due to the explosive growth of the network technologies, 3D models and animations have led to a great interest in various media. Especially 3D mesh models (3D meshes), which approximate surfaces by polygonal meshes are widely used to model 3D objects. In 1D and 2D signals such as speech, audio, images, video, etc., the signal values are located on "grids", for example the signals of images are defined on pixels. Thus, the errors of such signals can be explicitly defined by differences of the values on the "grids". However since in the 3D meshes, vertices are located on arbitrary positions in a 3D space and are triangulated in arbitrary ways, the grids cannot be defined. This makes it difficult to measure error on the 3D meshes. In this paper, we propose a new numerical method to measure the errors between two different 3D meshes.

This study describes the feasibility of using the penalty-function nonlinear programming neural network method to find the optimal power generating output which minimizes both the costs of generating power and power transmission losses. This method depends on neural network technology in acquiring exterior penalty function. Employing nonlinear function in equality and inequality constraints, the model is established using a neural network and additional objective functions; these additional objective functions expand cost function by using an appropriate penalty function. In this study, a 26-busbar including six generators was used to test the penalty function nonlinear programming neural network method. A comparison with the sequential unconstrained minimization technique (SUMT) demonstrates the reliability and precision of the optimal solution obtained using the new method.

In this letter, we present a normalized least-mean-square algorithm of blind estimator for carrier frequency offset estimation of orthogonal frequency division multiplexing systems. In conjunction with the closed-loop estimate structure, the proposed efficient algorithm eliminates the inter-carrier interference for time varying carrier frequency offset. The proposed algorithm offers faster convergence speed and more accuracy to the carrier frequency offset estimate. Several computer simulation examples are presented for illustrating and effectiveness of the proposed algorithm.

In this letter, we propose a robust IFDD scheme employing an interference canceller, which is used for mitigating interferences from the transmitting signal instead of complex filter bank to reduce the complexity, for the OFDM system using feedback information. According to simulation results, the proposed IFDD OFDM system does not show significant performance degradation but maintains the robustness against the fast time-varying multipath channel, while the TDD OFDM system estimating feedback information from receiving block makes serious performance degradation.

A reduced complexity multiple-input multiple-output (MIMO) equalizer with ordered successive interference cancellation (OSIC) is proposed for combating intersymbol interference (ISI) and cochannel interference (CCI) over frequency-selective multipath channels. It is developed as a reduced-rank realization of the conventional MMSE decision feedback equalizer (DFE). In particular, the MMSE weight vectors at each stage of OSIC are computed based on the generalized sidelobe canceller (GSC) technique and reduced-rank processing is incorporated by using the conjugate gradient (CG) algorithm for reduced complexity implementation. The CG algorithm leads to a best low-rank representation of the GSC blocking matrix via an iterative procedure, which in turn gives a reduced-rank equalizer weight vector achieving the best compromise between ISI and CCI suppression. With the dominating interference successfully cancelled at each stage of OSIC, the number of iterations required for the convergence of the CG algorithm decreases accordingly for the desired signal. Computer simulations demonstrate that the proposed reduced-rank MIMO DFE can achieve nearly the same performance as the full-rank MIMO MMSE DFE with an effective rank much lower than the dimension of the signal-plus-interference subspace.

Optical Character Reader (OCR) incorrect recognition is a serious problem when searching for OCR-scanned documents in databases such as digital libraries. In order to reduce costs, this paper proposes fuzzy retrieval methods for English text containing errors in the recognized text without correcting the errors manually. The proposed methods generate multiple search terms for each input query term based on probabilistic automata which reflect both error-occurrence probabilities and character-connection probabilities. Experimental results of test-set retrieval indicate that one of the proposed methods improves the recall rate from 95.96% to 98.15% at the cost of a decrease in precision from 100.00% to 96.01% with 20 expanded search terms.

The present paper deals with the frequency-dependent finite difference time domain ((FD)2TD) method analysis of the light-beam diffraction from a land/groove recording phase-change (PC) disk model with a metal (Al or Au) reflective layer in order to improve the conventional analysis for PC optical disk models with a perfectly conducting reflective layer. The diffracted fields are numerically calculated for both recorded and non-recorded states of the recording layer, and the comparison of the detected signal characteristics between two states is discussed. The crosstalk between the recording marks on lands and grooves are evaluated and the optimum groove depth is examined for Al,Au and perfectly conducting layer models.

Cochannel interference and multipath propagation reduce the performance of mobile communication systems. Multi-input MLSE with whitening processing can mitigate the influence of the interference and provide path diversity gain. In conventional considerations, however, the required complexity rapidly rises with the number of array elements. In this paper, we propose multi-input MLSE that whitens error signals in the signal space by using a multibeam adaptive array. This scheme can reduce the computational load of multi-input MLSE than the conventional type when using a large-element array. The results of an analysis show that the proposed type is equivalent to conventional one in the sense of the metric and provides less computational complexity.

In light of the increasing number of computer applications that rely heavily on multimedia data, the database community has focused on the management and retrieval of multidimensional data. Nearest Neighbor queries (NN queries) have been widely used to perform content-based retrieval (e.g., similarity search) in multimedia applications. Incremental NN (INN) query is a kind of NN queries and can also be used when the number of the NN objects to be retrieved is not known in advance. This paper points out the weaknesses of the existing INN search algorithms and proposes a new one, called Batch-Incremental Nearest Neighbor search algorithm (denoted B-INN search algorithm), which can be used to process the INN query efficiently. The B-INN search algorithm is different from the existing INN search algorithms in that it does not employ the priority queue that is used in the existing INN search algorithms and is very CPU and memory intensive for large databases in high-dimensional spaces. And it incrementally reports b(b > 1) objects simultaneously (Batch-Incremental), whereas the existing INN search algorithms report the neighbors one by one. In order to implement the B-INN search, a new search (called k-d-NN search) with a new pruning strategy is proposed. Performance tests indicate that the B-INN search algorithm clearly outperforms the existing INN search algorithms in high-dimensional spaces.

In many cryptographic applications, a large-order finite field is used as a definition field, and accordingly, many researches on a fast implementation of such a large-order extension field are reported. This paper proposes a definition field Fpm with its characteristic p a pseudo Mersenne number, the modular polynomial f(x) an irreducible all-one polynomial (AOP), and using a suitable basis. In this paper, we refer to this extension field as an all-one polynomial field (AOPF) and to its basis as pseudo polynomial basis (PPB). Among basic arithmetic operations in AOPF, a multiplication between non-zero elements and an inversion of a non-zero element are especially time-consuming. As a fast realization of the former, we propose cyclic vector multiplication algorithm (CVMA), which can be used for possible extension degree m and exploit a symmetric structure of multiplicands in order to reduce the number of operations. Accordingly, CVMA attains a 50% reduction of the number of scalar multiplications as compared to the usually adopted vector multiplication procedure. For fast realization of inversion, we use the Itoh-Tsujii algorithm (ITA) accompanied with Frobenius mapping (FM). Since this paper adopts the PPB, FM can be performed without any calculations. In addition to this feature, ITA over AOPF can be composed with self reciprocal vectors, and by using CVMA this fact can also save computation cost for inversion.

Affine arithmetic is a kind of interval arithmetic defined by Stolfi et al. In affine arithmetic, it is difficult to realize the efficient nonlinear binomial operations. The purpose of this letter is to propose a new dividing method which is able to supply more suitable evaluation than the old dividing method. And this letter also shows the efficiency of the new dividing method by numerical examples.

For suppressing inter symbol interference, the support vector machine mutliuser detector (SVM-MUD) was adopted as a nonlinear method in direct sequence code division multiple access (DS-CDMA) signals transmitted through multipath channels. To solve the problems of the complexity of SVM-MUD model and the number of support vectors, based on recursive least squares support vector machine (RLS-SVM) and Riemannian geometry, a new algorithm for nonlinear multiuser detector is proposed. The algorithm introduces the forgetting factor to get the support vectors at the first training samples, then, uses Riemannian geometry to train the support vectors again and gets less improved support vectors. Simulation results illustrated that the algorithm simplifies SVM-MUD model at the cost of only a little more bit error rate and decreases the computational complexity. At the same time, the algorithm has an excellent effect on suppressing multipath interference.

The authors have established new switching architecture of all optical WDM network suitable for the application of video transmission. In this paper, emphasis is put on a setup of a wavelength connection based on contiguous wave-band pool and we have proposed new Wave-Band Routing and Assignment (WBRA) method which provides simple switching and high speed wavelength assignment. Assuming the environment without wavelength convertor, our wave-band switching scheme is applied to several network topologies for performance evaluation. Then effectiveness and feasibility of this scheme are confirmed from a viewpoint of the number of required wavelengths. Simulation results indicate that our proposal scheme attains lower number of required wavelengths as compared to the fixed wave-band scheme. Assuming to use wavelength convertors, we have also evaluated the situation that the number of hops is restricted.

This paper describes a new training method of average voice model for speech synthesis in which arbitrary speaker's voice is generated based on speaker adaptation. When the amount of training data is limited, the distributions of average voice model often have bias depending on speaker and/or gender and this will degrade the quality of synthetic speech. In the proposed method, to reduce the influence of speaker dependence, we incorporate a context clustering technique called shared decision tree context clustering and speaker adaptive training into the training procedure of average voice model. From the results of subjective tests, we show that the average voice model trained using the proposed method generates more natural sounding speech than the conventional average voice model. Moreover, it is shown that voice characteristics and prosodic features of synthetic speech generated from the adapted model using the proposed method are closer to the target speaker than the conventional method.

We developed a phase controlled magnetron (PCM) with high DC-RF conversion efficiency and with phase control to steer a microwave beam in order to realize the final space Solar Power Station (SPS) system. For the PCM, we use injection locking technique and PLL feedback to anode current. We can stabilize and control a frequency and a phase of a microwave of the PCM. However, we have a power loss after the PCM for the SPS use because of a size of the antenna (> km) and of a microwave power (> GW). In order to decrease power loss after PCM, we newly propose a concept of "sub phase shifter" which can change only 1 or 2 bits of a phase and has low loss. We can keep high beam collection efficiency when we control a beam to a twice larger direction in the SPS system. With this concept, we developed a PCM array called SPORTS (Space Power Radio Transmission System) in FY2000 and FY2001 in Kyoto University.

Microwave Power Transmission (MPT) technology is one of the most essential parts for Solar Power Station/Satellite (SPS). We study on application of magnetrons as DC-RF converters for the MPT transmitting system. Magnetrons cost much cheaper, have much higher DC-RF efficiency over 70% and much lighter system weight per 1 watt RF output than semiconductor amplifiers although they have wider bandwidth of the fundamental frequency and spurious noises in various frequencies. Spurious noises are radiated from the transmitting system and interfere in the other communication systems both in space and on the Earth. The objective of this study is the improvement of the spurious noises generated from magnetrons. Experimentally, magnetrons driven by DC stabilized power supply had not only narrower bandwidth of the fundamental frequency but also lower spurious noise levels when filament current is turned off than when it is turned on. Some spurious noises are probably caused by the intermodulation between the low frequency spurious noises, which frequency is below 1 GHz, and the fundamental or the harmonics. We also verified that the harmonics levels of the measured magnetron in our measurement system were below -70 dBc, which are comparable to or better than those of some semiconductor amplifiers, and that the harmonics were not improved greatly when the filament current was turned off because the source of the harmonics is the distortion of the fundamental.

A new formula on the Hermite expansion is presented in an explicit form. An application of the formula is given to a random boundary value problem: a plane wave reflection from a flat plane, of which position is randomly distributed in the normal direction, is presented. Several numerical results are given for a verification of the formula and for a discussion of the exact behavior of the fluctuation part of the reflection power.

The OptIPuter is a radical distributed visualization, teleimmersion, data mining and computing architecture. Observing that the exponential growth rates in bandwidth and storage are now much higher than Moore's Law, this major new project of several universities--currently six in the US and one in Amsterdam--exploits a new world of computing in which the central architectural element is optical networking. This transition is caused by the use of parallelism, as in supercomputing a decade ago. However, this time the parallelism is in multiple wavelengths of light, or lambdas, on single optical fibers, creating a LambdaGrid. Providing applications-centric middleware to control the LambdaGrid on a regional and global scale is a key goal of the OptIPuter and StarLight Optical Switching projects.

This paper presents a new modulation scheme for Very-High Speed Digital Subscriber Lines (VDSL) modem, featuring a Multi-Code Multi-Carrier Code Division Multiple Access (MC2-CDMA) modulation. The system takes advantage from both the CDMA modulation and the Multi-Carrier transmission, and furthermore the channel throughput is increased adopting a multi-code approach. Starting from an overview of this novel scheme, encompassing the transmitter, channel and receiver description, a brief review of the equalization techniques is also considered and a proper bit-loading algorithm is derived to find out the achievable overall channel rate. The aim of this paper, besides introducing this novel scheme, is to demonstrate its suitability for a VDSL environment, where the achievable channel rate represents a real challenge. By means of a further optimisation, a general improvement of the system performance with respect to the standardized Discrete Multi Tone (DMT) modulation is also demonstrated.

This paper presents an algorithm for fingerprint image restoration using Digital Reaction-Diffusion System (DRDS). The DRDS is a model of a discrete-time discrete-space nonlinear reaction-diffusion dynamical system, which is useful for generating biological textures, patterns and structures. This paper focuses on the design of a fingerprint restoration algorithm that combines (i) a ridge orientation estimation technique using an iterative coarse-to-fine processing strategy and (ii) an adaptive DRDS having a capability of enhancing low-quality fingerprint images using the estimated ridge orientation. The phase-only image matching technique is employed for evaluating the similarity between an original fingerprint image and a restored image. The proposed algorithm may be useful for person identification applications using fingerprint images.