Virtual wavelength path (VWP) is the optical path when a wavelength conversion is possible in a wavelength division multiplexing (WDM) network that is transmission infrastructure for the next generation high speed backbone networks. To achieve efficient design for VWP networks, we must consider VWP routing, wavelength assignment, and wavelength conversion while satisfying many technical constraints of the WDM networks. In this study we propose an integrated model for efficient VWP design in WDM networks. We also develope a 3-phase algorithm, each of which deals with routing, wavelength assignment and route and wavelength reassignment, respectively. In our computational experiments, phase 1 algorithm can solve the problem to the optimality for medium size test networks. Phase 2 algorithm is an efficient heuristic based on a reduced layered network and can give us an effective wavelength assignment. Finally, phase 3 algorithm reconfigure VWP routing and its wavelength assignment to concentrate wavelength conversion nodes in the suggested VWP network.

In this paper we present a new approach to estimate link travel speed based on the hybrid neuro-fuzzy network. It combines the fuzzy ART algorithm for structure learning and the backpropagation algorithm for parameter adaptation. At first, the fuzzy ART algorithm partitions the input/output space using the training data set in order to construct initial neuro-fuzzy inference network. After the initial network topology is completed, a backpropagation learning scheme is applied to optimize parameters of fuzzy membership functions. An initial neuro-fuzzy network can be applicable to any other link where the probe car data are available. This can be realized by the network adaptation and add/modify module. In the network adaptation module, a CBR(Case-Based Reasoning) approach is used. Various experiments show that proposed methodology has better performance for estimating link travel speed comparing to the existing method.

This paper presents an efficient dynamic programming(DP) method, so called EDPAS (Efficient Dynamic Programming Algorithm for Signal), for optimally controlling traffic signal in real-time mode at a single intersection. The objective of EDPAS is to minimize total vehicle delay. It applies reaching method to solve forward DP functional equation, which does not need any priori knowledge on the states of DP network. Two acceleration techniques within reaching method are the main feature of EDPAS. They are devised to eliminate inferior DP states by comparing between states and maintaining incumbent value, resulting in a great amount of computational efficiency. An example is shown to verify the advantage of EDPAS.

Gouge-free tool-path generation is an important issue in mold & die machining and researches on cutter interference avoidance can be found in many articles. One of the various methods is construction of tool-offset surface of cutter-location (CL) surface on which the cutter-center point (CL-point) locates. Provided that the CL surface is represented in a suitable form, cutter-interference avoidance can be performed without the burden of computing CL data for every cutter-contact (CC) point. In the paper, various methods of constructing a CL surface in the z-map form are presented, where z-map is a special form of discrete nonparametric representation in which the height values at grid points on the xy-plane are stored as a 2D array z[i,j].

The soft handoffs between two adjacent MSC's should be employed to support the calls requesting handoffs to an MSC while minimizing the undesirable ping pong phenomenon of back-and-forth handoffs between two adjacent cells in conventional hard handoffs. In this paper, the soft handoff scheme between two MSC's is considered using the trunk between the packet routers for the two MSC's. The trunk network is proposed to support the inter-MSC soft handoff scheme in the service area with many MSC's. The probability that a soft handoff to an adjacent MSC will be blocked due to the shortage of the trunk capacity is derived.

ITS(Intelligent Transportation System) is an advanced system which can effectively handle the current transportation and tragic problems. In order to beneficially apply ITS to the current transportation infrastructure we need a telecommunication technology which guarantees high speed data transmission between the road side units and the on-board units in the vehicles. DSRC(Dedicated Short Range Communication) is considered as a promising technology since it has the capability of two-way communication and can serve to implement various ITS services. In this paper, we study an architecture of telecommunication network far ITS based on DSRC. We use the ISCNA(Information Systems and Communication Networks Architecture) framework for the method of approach. We first analyze the requirements for ITS services using DSRC in Korea, and then establish a logical architecture for the network. We also analyze the types of data and process between the network components. Based on these we propose an architecture for the telecommunication network for ITS. We also briefly discuss the simulation which we perform to validate the proposed network architecture.

Increasing amount of road tragic in 90's has drawn much attention in Korea due to its influence on safety problems. Various types of data analyses are done in order to analyze the relationship between the severity of road traffic accident and driving conditions based on traffic accident records. Accurate results of such accident data analysis can provide crucial information for road accident prevention policy. In this paper, we apply several data fusion, ensemble and clustering algorithms in an effort to increase the accuracy of individual classifiers for the accident severity. An empirical study results indicated that clustering works best for road traffic accident classification in Korea.

In this paper we propose a content-based image retrieval method that can search large image databases efficiently by color, texture, and shape content. Quantized RGB histograms and the dominant triple (hue, saturation, and value), which are extracted from quantized HSV joint histogram in the local image region, are used for representing global/local color information in the image. Entropy and maximum entry from co-occurrence matrices are used for texture information and edge angle histogram is used for representing shape information. Relevance feedback approach, which has coupled proposed features, is used for obtaining better retrieval accuracy. Simulation results illustrate the above method provides 77.5 percent precision rate without relevance feedback and increased precision rate using relevance feedback for overall queries. We also present a new indexing method that supports fast retrieval in large image databases. Tree structures constructed by k-means algorithm, along with the idea of triangle inequality, eliminate candidate images for similarity calculation between query image and each database image. We find that the proposed method reduces calculation up to average 92.9 percent of the images from direct comparison.

A flexible disk grinding process model has been implemented with varying disk orientation with respect to workpiece surface along with variable feed rate. Before implementing arbitrary disk orientation and translation, disk angle and feed rate variation have been implemented. The disk angle was changed with constant angular velocity only in the entrance stage. The effect of the variable feed rate was added to the geometric schematic. The feed rate was changed either from the entrance stage or from the between edges stage and process performance was evaluated. Effect of changing both angle end feed rate has been also analyzed. Disk trend showing actual disk deflection has also been visualized.

Most of the previous works on classical location models are based on the assumption that the value(or utilities) of inventory remains constants over time. In this study a special case of location problem is studied for both ameliorating and deteriorating items in two-echelon supply-chain management such as agricultural and fishery products. The objective of this study is to determine the minimum number of storage facilities among a discrete set of location sites so that the probability for each customer to be covered is not less than a critical value. We have formulated this problem using stochastic set-covering problem which can be solved by 0-1 programming method. Also we developed a computer program and applied to a set of problems for fish culture storage and distribution centers and the sample results well show the impact of ameliorating and deteriorating rate on the location problem. For the further study, a graphical user-interface with visualization for input and output is needed to be developed.

In this work, a deadlock avoidance strategy is proposed in order to effectively handle conflicts and deadlocks occurring in zone-control AGV (Automated Guided Vehicle) systems. The basic idea is based on Capacity-designated Directed Graph (CDG) theory that was developed to avoid from deadlocks in manufacturing systems. However, to enforce the effectiveness of detecting impending and restricted deadlocks, AGV routings are explicitly described in Extended Directed Graph (EDG). From EDG, a non-conservative deadlock-avoidance strategy is derived. The superiority of the proposed strategy lies on the applicability to diverse AGV path configurations using zone control. Also, because of its insensibility and robustness, it can be effectively used when the system has randomness and stochastic nature.

The current study examines principles to develop universal design guidelines for manufacturing information and communication devices. The study surveyed inconveniences disabled people experience in the information and communication environment with current technology and design, and suggested abbreviated universal design guidelines. Design guidelines should reduce those inconveniences detected through the task analysis and GOMS modelling of the usage by disabled people. Design and functional features of mobile phones were examined since they quickly became essential communication tools for both disabled and non-disabled people alike. Design issues were examined in controls, input methods, and output methods in terms of human factors and ergonomics. It is expected that both governments and manufacturers can save costs to produce and manufacture special assistive devices for disabled people by implementing universal design in their communication products. Since it is becoming the international trend, application of the universal design should be enforced to all communication and information devices by government for the higher quality of life for all groups of user.

Among the standards of CALS, CITIS(Contractor Integrated Technical Information Service) is a standard in information share procedure which manages all data and services occurred between a contractor and a purchaser. CITIS services have some security problems like authentication problem and repudiation problem, when they are implemented using the Internet. To solve these problems, CITIS needs a user certificate system which can allow to access important information only to qualified users. This paper proposed a PKI(Public Key Infrastructure) Certificate Authority for CITIS, and created a real User Certificate System which can be adjusted to circumstances of real CITIS.

This paper presents a new approach which uses $A^*$ search and genetic algorithms for solving large scale multi-objective shortest path problem. The focus of this paper is motivated by the problem of finding Pareto optimal paths for an advanced traveler information system(ATIS) in the context of intelligent transportation system(ITS) application. The individual description, the decoding rule, the selection strategy and the operations of crossover and mutation are proposed for this problem. The keynote points of the algorithm are how to represent individuals and how to calculate the fitness of each individual. The high performance of the proposed algorithm is demonstrated by computer simulations.

The purpose of this paper is to design the menu of mobile phone based on the impression engineering. Free response survey analysis was used to collect impression data on mobile phone functions with time interval. Simultaneity analysis was applied to finding the relationship among selected impression. We cluster a set of the related impression so as to design the menu of a mobile phone accordingly. This research is expected to contribute to the improvement of customer satisfaction by reflecting customer's impression in the process of product design.