In the food, beverage and cosmetic industry and so on, odor sensing systems instead of human sensory test are demanded. We have developed odor sensing systems using QCM (quartz crystal microbalance) sensor array and pattern recognition method. Since the properties of the sensors depend on the gas sorption characteristics of the sensing films coated on them, the optimum films according to target odors should be selected. In this study, we tried to select sensing films appropriate for discrimination of slightly different apple flavors. The examples of typical apple flavors were prepared blending 9 compounds. The sensing films were extracted from various kinds of materials such as lipid, stationary phase material of GC (gas chromatography) and cellulose. The selection method under the condition of the small number of measurements was studied. We analyzed the data of steady-state sensor responses in terms of the Euclidean distance, and the films appropriate for apple flavor discrimination were successfully selected.

In this paper, using a standard propagation model, the performance evaluation of a code-division-multiple-access (CDMA) cellular system with high data rate services for the reverse and forward links is investigated. In the approach, we propose "Equivalent Load" to estimate two cases of the system termed as the static analysis and the dynamic analysis. Performance measures of the static analysis obtained include the system capacity plane, outage probability and throughput. Performance measures of the dynamic analysis obtained include the allowed maximum data rate and the constraint set between the load situation and the data rate. We also estimate the effects of the power control on the system.

This paper presents a heuristic graph coloring algorithm named MIPS_CLR, a MInimal-state Processing Search algorithm for the graph CoLoRing problem. Given a graph G(V, E), the goal of this NP-complete problem is to find a color assignment to every vertex in V such that any pair of adjacent vertices must not receive the same color but also the total number of colors should be minimized. The graph coloring problem has been widely studied due to its large number of practical applications in various fields. In MIPS_CLR, a construction stage first generates an initial minimal state composed of as many as colored vertices by a simple greedy algorithm, after a maximal clique of G is found by a maximum clique algorithm. Then, a refinement stage iteratively seeks a solution state while keeping minimality in terms of a cost function by a minimal-state transition method. In this method, the schemes of a best color selection, a random color selection, a color assignment shuffle, and a gradual color expansion are used together to realize the discrete descent search with hill-climbing capabilities. The performance of MIPS_CLR is evaluated through solving DIMACS benchmark graph instances, where the solution quality is generally better than existing algorithms while the computation time is comparable with the best existing one. In particular, MIPS_CLR provides new lower bound solutions for several instances. The simulation results confirm the extensive search capability of our MIPS_CLR approach for the graph coloring problem.

Path loss and delay profile characteristics of the 3-GHz band are measured and compared for line-of-sight (LOS) and non-line-of-sight (NLOS) paths in a suburban residential area. For the LOS path, the path loss increases as a function of distance squared; and hence the propagation is considered as the free space propagation. For the NLOS paths, it is found that corner losses occur ranging from 28 to 40 dB, and subsequent losses increase as a function of distance squared, but in case of there are open spaces, spaces between the rows of houses or roads intersecting LOS road, the increase was small. The delay spread for the LOS path increased in proportion to power of the distance; and the exponents ranging from 1.9 to 2.9 is found smaller than in urban areas. The delay spreads for the NLOS paths were several times greater than that for the LOS path, and the rate of delay spread increase with distance was found to be several orders of magnitude greater for NLOS paths than the LOS path.

A simple but efficient method to improve readability of discrete pseudo time-frequency representations (TFRs) of nonstationary signals by the reassignment of the representations in discrete frequency dimension is presented. The method does not rely on the nonzero time derivative of the window function employed in the estimation of pseudo TFR. This property of the reassignment method is advantageous because the method can provide an improved readability in the situation when a known reassignment method is unefficient. The reassignment of the TFRs of corrupted signals is discussed. Numerical examples are included to illustrate the performance of the proposed method.

To provide a bounded-delay service with an end-to-end delay guarantee and utilize network efficiently, the admission control functions in a network require an adequate per-switch delay allocation policy to allocate end-to-end delay requirement to a set of local switches. This letter present an optimal delay allocation policy, according to a deterministic traffic model, and a rate-controlled scheduler. Empirical results indicate that the proposed policy perform better than EQ allocation policy, using the admission load region as index.

This paper theoretically analyzed the performance of the RAKE combining (in the time domain), maximal ratio combining (in the spatial domain), and two-dimensional RAKE combining (in the spatial and time domains) techniques for multipath fading environments, where multipath waves are distributed in the spatial and time domains. The analysis was based on a diversity combining technique that employed the eigenvalues of the covariance matrix between branch signals. It was found that the performance of the fading mitigation was normalized by the beamwidth of an array antenna, for various parameters such as the number of antenna elements, angular spread, and angle of arrival.

In order to realize universal service access of mobile users on the global telecommunication environment, we have to consider the scalable networking architecute based on the distributed object computing technologies. In this paper, we apply TINA to the promising networking architecture, and propose TINA-based scalable model for realizing personal mobility service, which especially focuses on making access to telecommunication services from any legacy systems that do not support such the new environment, using a downloadable module in an end terminal, as well as considering load balance of a whole system. Our proposed model also focuses on exchanging personal infomation of mobile users between different administrative domains, by separating the already-specified user profile information objects into two parts, which are the domain-common part and domain-specific part, and propose secure exchange procedure.

In long-haul wavelength-division-multiplexed (WDM) transmission systems, signals with shorter and longer wavelengths have self-phase modulation group-velocity-dispersion (SPM-GVD) penalty caused by to the dispersion slope even after the dispersion-compensation at the receiver has been optimized. As a countermeasure, we have already proposed both pre-compensation and post-compensation of chromatic dispersion at the transmitter and receiver for each channel. This method can decrease the channel variation of path-averaged chromatic dispersion along the transmission line, and it can improve the eye opening of the waveform after transmission. We investigated the optimized parameter of chromatic dispersion and chirping at the transmitter. The optimized pre-dispersion compensation parameter R was about 50%. The optimized chirping parameter α was about 3 when the signal wavelength was less than the mean zero-dispersion wavelength. In a single-channel, 5.3-Gbit/s NRZ signal transmission experiment over a 4,760-km straight line, this method decreased SPM-GVD penalty. In a 32-channel, 5.3-Gbit/s WDM transmission experiment over 9,879 km using a circulating loop, this method improved Q-factors for the 1st and 32nd channels by more than 1.5 dB.

This paper presents a new method for statistical modelling of prosody control in speech synthesis. The proposed method, which is referred to as Constrained Tree Regression (CTR), can make suitable representation of complex effects of control factors for prosody with a moderate amount of learning data. It is based on recursive splits of predictor variable spaces and partial imposition of constraints of linear independence among predictor variables. It incorporates both linear and tree regressions with categorical predictor variables, which have been conventionally used for prosody control, and extends them to more general models. In addition, a hierarchical error function is presented to consider hierarchical structure in prosody control. This new method is applied to modelling of speech segmental duration. Experimental results show that better duration models are obtained by using the proposed regression method compared with linear and tree regressions using the same number of free parameters. It is also shown that the hierarchical structure of phoneme and syllable durations can be represented efficiently using the hierarchical error function.

Identification of motion parameters is an important issue in image restoration of a linear motion blur. Based on the human visual-motion sensing properties, an integrated approach with some known image processing techniques is proposed to the estimation of the direction and extent of motion on a linear motion blurred image. Experimental results confirm the feasibility of our approach.

For many military and civilian large-scale, real-world systems of interest, data are first acquired asynchronously, i. e. at irregular intervals of time, at geographically-dispersed sites, processed utilizing decision-making algorithms, and the processed data then disseminated to other appropriate sites. The term real-world refers to systems under computer control that relate to everyday life and are beneficial to the society in the large. The traditional approach to such problems consists of designing a central entity which collects all data, executes a decision making algorithm sequentially to yield the decisions, and propagates the decisions to the respective sites. Centralized decision making algorithms are slow and highly vulnerable to natural and artificial catastrophes. Recent literature includes successful asynchronous, distributed, decision making algorithm designs wherein the local decision making at every site replaces the centralized decision making to achieve faster response, higher reliability, and greater accuracy of the decisions. Two key issues include the lack of an approach to synthesize asynchronous, distributed, decision making algorithms, for any given problem, and the absence of a comparative analysis of the quality of their decisions. This paper proposes MFAD, a Mathematical Framework for Asynchronous, Distributed Systems, that permits the description of centralized decision-making algorithms and facilities the synthesis of distributed decision-making algorithms. MFAD is based on the Kohn-Nerode distributed hybrid control paradigm. It has been a belief that since the centralized control gathers every necessary data from all entities in the system and utilizes them to compute the decisions, the decisions may be "globally" optimal. In truth, however, as the frequency of the sensor data increases and the environment gets larger, dynamic, and more complex, the decisions are called into question. In the distributed decision-making system, the centralized decision-making is replaced by those of the constituent entities that aim at minimizing a Lagrangian, i. e. a local, non-negative cost criterion, subject to the constraints imposed by the global goal. Thus, computations are carried out locally, utilizing locally obtained dataand appropriate information that is propagated from other sites. It is hypothesized that with each entity engaged in optimizing its individual behavior, asynchronously, concurrently, and independent of other entities, the distributed system will approach "global" optimal behavior. While it does not claim that such algorithms may be synthesized for all centralized real-world systems, this paper implements both the centralized and distributed paradigms for a representative military battlefield command, control, and communication (C3) problem. It also simulates them on a testbed of a network of workstations for a comparative performance evaluation of the centralized and decentralized paradigms in the MFAD framework. While the performance results indicate that the decentralized approach consistently outperforms the centralized scheme, this paper aims at developing a quantitative evaluation of the quality of decisions under the decentralized paradigm. To achieve this goal, it introduces a fundamental concept, embodied through a hypothetical entity termed "Perfect Global Optimization Device (PGOD)," that generates perfect or ideal decisions. PGOD possesses perfect knowledge, i. e. the exact state information of every entity of the entire system, at all times, unaffected by delay. PGOD utilizes the same decision-making algorithm as the centralized paradigm and generates perfect globally-optimal decisions which, though unattainable, provide a fundamental and absolute basis for comparing the quality of decisions. Simulation results reveal that the quality of decisions in the decentralized paradigm are superior to those of the centralized approach and that they approach PGOD's decisions.

The orbital portrait of quasi-periodic oscillation shows transition like change with the amplitude of external force in periodically forced van der Pol oscillator. This phenomenon originates from frequency pulling between self-sustained and periodic external oscillations induced by the frequency shift of former. We estimate this shift and succeed in deriving the transition points at which the portrait changes.

The propagation characteristic of 670 nm laser light on the array of 10 µm diameter polystyrene micro-sphere was studied. For the linearly arranged array of micro-spheres from one to 12, the propagated light intensity was decreased from 700 mV to 45 mV. However, the propagated light intensity in the air was significantly decreased and it became 2 mV at 60 µm from the optical fiber light source. For the micro-sphere array on the curvilinear line, the light intensity at 12th micro-sphere became 35 mV. This fact means the light was propagated almost same as that on the linear line. Whereas it is expected that three dimensionally crossing optical wave-guide is possible to be fabricated by arranging the micro-spheres.

Photoacoustic spectroscopy (PAS) has recently received much attention especially for plant photosynthesis research, because this technique is capable of performing non-destructive measurement without any pre-treatment of specimens. So far we have developed a PAS system equipped with an open photoacoustic cell (OPC), which allows in situ and in vivo measurements of plant photosynthesis of intact undetached leaves. In this study, we have measured photosynthesis reaction using OPC and developed a Confocal Scanning Photoacoustic Microscopy (CSPAM) system, in which PAS is combined with confocal scanning laser microscopy. The system allows simultaneous measurement of acoustic signal and another signal such as fluorescence, and also gives two- and three- dimensional intensity distributions of these signals, thereby giving two- and three- dimensional information about photosynthetic activity of plants.

Thin films of carbon (C)-sulfur (S) compound were formed by plasma CVD (PCVD) at the special chemical condition. The reactor has a parallel plate electrode system and was operated at a discharge frequency of 13.56 MHz with using a mixture gas of argon (Ar), methane (CH4) and SF6. The deposition was performed on a substrate placed on the grounded electrode. Atomic composition of the film was observed to depend on the gas mixture ratio. The sulfur atom density was increased up to 30% with using a mixture gas at a pressure of 0.1 Torr and at a flow rate of 20, 20 and 50 SCCM for Ar, CH4 and SF6, respectively. It was expected that the C-S compounds were deposited under the condition of F atom elimination by forming HF.

In conventional methods for detecting vanishing points and vanishing lines, the observed feature points are clustered into collections that represent different lines. The multiple lines are then detected and the vanishing points are detected as points of intersection of the lines. The vanishing line is then detected based on the points of intersection. However, for the purpose of optimization, these processes should be integrated and be achieved simultaneously. In the present paper, we assume that the observed noise model for the feature points is a two-dimensional Gaussian mixture and define the likelihood function, including obvious vanishing points and a vanishing line parameters. As a result, the above described simultaneous detection can be formulated as a maximum likelihood estimation problem. In addition, an iterative computation method for achieving this estimation is proposed based on the EM (Expectation Maximization) algorithm. The proposed method involves new techniques by which stable convergence is achieved and computational cost is reduced. The effectiveness of the proposed method that includes these techniques can be confirmed by computer simulations and real images.

As a flexible way to accommodate a variety of services, a number of spreading bands are now considered in International Mobile Telecommunications-2000 (IMT-2000) systems and more than two (overlaid) bands can be operated simultaneously in CDMA systems. Capacity estimation in CDMA systems is an important issue in performance analysis and call admission control (CAC), which is closely related to power control. This study derives the reverse link capacity of signal-to-interference ratio (SIR)-based power-controlled overlaid multiband CDMA systems in single and multiple cell environments. The weighted-aggregated data rate is introduced as the link capacity, which can reflect different spreading bandwidths and different QoS requirements. Various combinations of 5, 10, and 20 MHz subsystems are compared to one another in view of the maximum weighted-aggregated data rate. The impact of pulse shaping on CAC and the effect of multiple traffic accommodation on link capacity are also investigated.

In visual servoing, most studies are concerned with robotic application with known objects. In this paper, the problem of controlling a motion by visual servoing around an unknown object is addressed. In this case, the approach is interpreted as an initial step towards a perception goal of an unmodeled object. The main goal is to perform motion with regard to the object in order to discover several viewpoint of the object. An adaptive visual servoing scheme is proposed to perform such task. The originality of our work is based on the choice and extraction of visual features in accordance with motions to be performed. The notion of invariant feature is introduced to control the navigational task around the unknown object. During experimentation, a cartesian robot connected to a real time vision system is used. A CCD camera is mounted on the end effector of the robot. The experimental results present a linkage of desired motion around different kind of objects.

We have fabricated a static induction transistor structure by using copper phthalocyanine (CuPc) films. Its layer-structure is Au(drain)/CuPc/Al(gate)/CuPc/Au(source)/glass. The source-drain current is controlled by the Al gate bias-voltage when the drain voltage is positive but is almost independent of it when the drain voltage is negative. The current-voltage characteristics are governed by the space-charge-limited conduction which depends on shallow traps.