To enhance safety and traffic efficiency, a driver assistance system and an autonomous vehicle system are being developed. A preceding vehicle recognition method is important to develop such systems. In this paper, a vision-based preceding vehicle recognition method, based on supervised learning from sample images is proposed. The improvement for Modified Quadratic Discriminant Function (MQDF) classifier that is used in the proposed method is also shown. And in the case of road environment recognition including the preceding vehicle recognition, many researches have been reported. However in those researches, a quantitative evaluation with large number of images has rarely been done. Whereas, in this paper, over 1,000 sample images for passenger vehicles, which are recorded on a highway during daytime, are used for an evaluation. The evaluation result shows that the performance in a low order case is improved from the ordinary MQDF. Accordingly, the calculation time is reduced more than 20% by using the proposed method. And the feasibility of the proposed method is also proved, due to the result that the proposed method indicates over 98% as classification rate.

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.

Mobile computing networks make it possible to offer information access to mobile users. In order to transfer data over mobile networks efficiently, appropriate data transmission control methods for mobile terminals must be established. This paper focuses on spot communication systems to transmit data at high speeds between base stations and mobile terminals. It proposes a flexible and efficient data transmission method that is suitable for spot communication systems. The proposed method transfers subsets of the data to the base stations that are best sited relative to the mobile terminal. This helps to reduce the traffic load of the network significantly. Simulation results confirm the validity of the proposed method. Furthermore, the data receiving time of the mobile terminal, which is an important measure in evaluating the Quality of Service (QoS) for data transmission is analyzed. The result shows that the traffic load in the network is reduced significantly while the QoS is well maintained.

In this paper, we describe a distributed transactional workflow system named ICU/COWS, which supports multiple workflow types of large scale enterprises. The system aims to support the whole workflow for large scale enterprises effectively within a single workflow system and the system is designed to satisfy several design goals such as availability, scalability, and reliability. Transactional task and special tasks such as alternative task and compensating task are developed and utilized to achieve the design goals in task model level and the system is constructed with distributed transactional objects to achieve the design goals in distributed system environment. In this paper, structured ad hoc workflow is defined as a special type of ad hoc workflow that should be automated by workflow management system because many benefits can be obtained by automating it and connector facility is proposed as a means to support structured ad hoc workflow effectively. Some characteristics of a workflow system can be identified by monitoring the system behavior on different conditions like workloads or system configurations. An early version of the system has been implemented and the performance data of the system is illustrated.

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.

This paper describes User Attribute with Validity Period extension field of public key certificate and Certificate Verification Service with Time Stamp. The field and service solve the problems of unavailability of the latest revoked certificate information, large size of the revocation information and lack of non-repudiation mechanism of the X. 509 Authentication Framework. The proposed extension field is useful to reduce the revoked certificate information sent from CA of an organization where there are periodical personnel changes. The Certificate Verification Service with Time Stamp is an on-line service providing certificate status and non-repudiation service. The paper shows how the combination of the field and service solves the problems and that the server can serve hundreds of thousands of messaging system users, and the security of the service is also discussed.

There are methods used to test the optical purity of enantiomers; however, most of the simple methods are not precise and more complicated methods are better. As a result, these methods cannot be widely used for industrial purposes. The aim of this research is to design a sensor which can discriminate D-amino acids from L-amino acids. The designed sensor has chiral membranes and uses the technique of impedance change of these chiral membranes to discriminate the amino acids. We used a noise-FFT (Fast Fourier Transform) technique to determine the membrane impedance. When an enantiomer membrane resides in a chiral environment, (E*), diastereomeric interactions (E*-D) and (E*-L) are created, which may differ sufficiently in the arrangement of molecules of the membranes so as to permit the discrimination of optical substances due to the change in membrane characteristics. With increasing concentrations of the amino acids, the membrane resistance changes depended on the optical activity of the amino acids. The results suggest that the impedance changes of the chiral membrane with diastereomeric reaction can be used for the high-performance chemical sensor to measure the optical purity of different substances.

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.

A problem of obtaining an optimal file transfer on a file transmission net N is to consider how to transmit, with a minimum total cost, copies of a certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This problem is NP-hard for a general file transmission net. So far, some class of N on which polynomial time algorithms for obtaining an optimal file transfer are designed has been known. In addition, if we deal with restricted file transfers, i. e. , forest-type file transfers, we can obtain an optimal 'forest-type' file transfer on more general class of N. This paper proves that for such general nets it suffices to consider forest-type file transfers in order to obtain an optimal file transfer.

This paper presents upper bounds on the average bit error rate (BER) of coherent detection of PSK and differential detection of DPSK with adaptive arrays in fading environments. A model where a line of sight (LOS) component and Rayleigh distributed scattering components arrive at a receiver with specific arrival angles is used considering the correlation of signal between multiple antennas. The upper bounds are expressed in a simple matrix form using signal and interference-plus-noise correlation matrices. Examples for the case of 4-element adaptive arrays are given to illustrate the tightness and the application of this upper bounds.

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.

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.

In this paper, a modified neural network approach called the Guided Neural Network is proposed for the longitudinal dynamics identification of a vehicle using the well-known gradient descent algorithm. The main contribution of this paper is to take account of the known information about the system in identification and to enhance the convergence of the identification errors. In this approach, the identification is performed in two stages. First, the Guiding Network is utilized to obtain an approximate dynamic characteristics from the known information such as nonlinear models or expert's experiences. Then the errors between the plant and Guiding Network are compensated using the Compensating Network with the gradient descent algorithm. With this approach, the convergence speed of the identification error can be enhanced and more accurate dynamic model can be obtained. The proposed approach is applied to the longitudinal dynamics identification of a vehicle and the resultant performance enhancement is given.

This paper has two parts. In the first part of the paper, we note the property that under the para perspective camera projection model of a camera, the set of 2D images produced by a 3D point can be optimally represented by two lines in the affine space (α-β space). The slope of these two lines are same, and we observe that this constraint is exactly the same as the epipolar line constraint. Using this constraint, the equation of the epipolar line can be derived. In the second part of the paper, we use the "same slope" property of the lines in the α-β space to derive the affine structure of the human face. The input to the algorithm is not limited to an image sequence of a human head under rigid motion. It can be snapshots of the human face taken by the same or different cameras, over different periods of time. Since the depth variation of the human face is not very large, we use the para perspective camera projection model. Using this property, we reformulate the (human) face structure reconstruction problem in terms of the much familiar multiple baseline stereo matching problem. Apart from the face modeling aspect, we also show how we use the results for reprojecting human faces in identification tasks.

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 this paper, a method of fusing ground-based laser range image and CCD images for the reconstruction of textured 3D urban object is proposed. An acquisition system is developed to capture laser range image and CCD images simultaneously from the same platform. A registration method is developed using both laser range and CCD images in a coarse-to-fine process. Laser range images are registered with an assumption on sensor's setup, which aims at robustly detecting an initial configuration between the sensor's coordinate system of two views. CCD images are matched to refine the accuracy of the initial transformation, which might be degraded by improper sensor setup, unreliable feature extraction, or limited by low spatial resolution of laser range image. Textured 3D model is generated using planar faces for vertical walls and triangular cells for ground surface, trees and bushes. Through an outdoor experiment of reconstructing a building using six views of laser range and CCD images, it is demonstrated that textured 3D model of urban objects can be generated in an automated manner.

We developed a new water repellent coating consisting of PTFE particles dispersed in PVDF resin. This coating exhibited a contact angle of 150 degrees. By ice accreting test, the intensity of reflected microwave on the water-repellent coated plate did not decrease, whereas that on uncoated one decreased.

File system buffers provide memory space for data being transferred to and from disk and act as caches for the recently used blocks, and the buffer manager usually reads ahead data blocks to minimize the number of disk accesses. However, if several multimedia files with different consumption rates are accessed simultaneously from the file system in which LRU buffer replacement strategy is used, the read-ahead blocks of the low rate file are unloaded from memory to be used for loading a data block of a high data rate file, therefore they should be reloaded again into memory from disk when these blocks are actually referenced. This paper proposes and implements a new buffer cache management scheme for a multimedia file system and analyzes the performance of the proposed scheme by modifying the file system kernel of FreeBSD. In this proposed scheme, initially, some buffers are allocated to each opened multimedia file, privately, then these buffers are reused for other data blocks of that file when they are loaded from the disk. Moreover, the number of private buffers allocated for the file is dynamically adjusted according to its data rate. An admission control scheme is also proposed to prevent opening of a new file which may cause overloads in the file system. Experimental results comparing proposed scheme with the original FreeBSD and a simple CTL-based model show that the proposed buffer management scheme could support the realtime play back of several multimedia files with various data rates concurrently without helps of a realtime CPU and disk scheduling.

We have reviewed recent progress on arrayed waveguide gratings for DWDM applications. AWGs can be used to realize not only mux/demux filters with various channel spacings, but also highly integrated optical components.

In this paper, we propose the majority algorithm to choose the connection weights for the neural networks with quantized connection weights of 1 and 0. We also obtained the layered network to solve the parity problem with the input of arbitrary number N through an application of this algorithm. The network can be expected to have the same ability of generalization as the network trained with learning rules. This is because it is possible to decide the connection weights, regardless of the size of the training set. One can decide connection weights without learning according to our case study. Thus, we expect that the proposed algorithm may be applied for a real-time processing.