• Journal of Korean Society of Transportation
• /
• v.27 no.3
• /
• pp.49-58
• /
• 2009

Four alternative plans for the bus network in Daejeon metropolitan city, which have different hierarchical structure, were proposed : Alternative 1 represents a bus network without hierarchical structure, and Alternative 2, 3, and 4 represent bus networks with primary, intermediate, and advanced hierarchical structures, respectively. Efficiency of the alternative plans were evaluated based on the evaluation index including travel time cost, waiting time cost, and transition penalty cost. The travel time cost was decreased as the level of hierarchical structure gets higher until it reaches the extremely high level. As the level of hierarchical structure get higher, the waiting time cost significantly decreased while the transition penalty cost increased. Collectively, a bus network with hierarchical structure was shown to be more efficient than without it in the light of total travel cost. For the bus network with hierarchical structure, total travel cost shows a concave curve, which implies that there exists an optimal level of hierarchical structure in a bus network.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.8
• /
• pp.718-725
• /
• 2004

The real-time industrial network, often referred to as fieldbus, is an important element for intelligent manufacturing systems. Thus, in order to satisfy the real-time requirements of field devices, numerous fieldbus protocols have been announced. But, the application of fieldbus has been limited due to the high cost of hardware and the difficulty in interfacing with multi-vendor products. Therefore, as an alternative to fieldbus, the computer network technology, especially Ethernet (IEEE 802.3), is being adapted to the industrial environment. However, the crucial technical obstacle for Ethernet is its non-deterministic behavior that makes it inadequate for industrial applications where real-time data have to be delivered within a certain time limit. Recently, the development of switched Ethernet shows a very promising prospect for industrial application due to the elimination of uncertainties in the network operation resulting in much improved performance. This paper focuses on the application of the switched Ethernet with cascade structure for industrial communications. More specifically, this paper presents an analytical performance evaluation of switched Ethernet with cascade structure, and a case study about networked control system.

• Journal of Life Science
• /
• v.16 no.7 s.80
• /
• pp.1097-1103
• /
• 2006

Community structure varies not only in space but also in time. We stand in one position which located at Sinhung-ri, Sacheon-ci and observe the flora of area as time passes. This area begins after disturbance on sites where organisms are already present like secondary succession. In 2001, there are invaded by Trapa japonica, Salvinia natans, and Potamogon cristatus. Four or five years later, this abandoned areas support of clover, pine, and oak, resulting in a shifting pattern of species dominance and diversity through time. Patterns of community structure such as species composition and ecological diversity have shown through seasons and five years, that is the topic of this study. The values of turnover (TO) were changes through time intervals at three regions. The gradual and seemingly directional change in the structure of the community through time from aquatic like to field. Thus, we can observe the process of secondary succession at Sinhung-ri in the very short time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1769-1776
• /
• 2004

Effective keyword extraction is important in the information search system and there are several ways to select proper keyword in many keywords. Among them, DER Structure for AC Algorithm to search single keyword, can search multiple keywords but it has time complexity problem. In this paper, we developed a algorithm, "EDER structure" by expanding standalone search table based on DER structure search method to improve time complexity. We tested the algorithm using 500 text files and found that EDER structure is more efficient than DER structure for AC for keyword posting result and time complexity that 0.2 second for EDER and 0.6 second for DER structure,structure,

• Journal of the Earthquake Engineering Society of Korea
• /
• v.7 no.4
• /
• pp.89-95
• /
• 2003

In this paper, an algorithm to locate and size damage in a complex truss structure using the time domain response is presented. Sampled response data for specific time interval is spatially expanded over the structure to obtain the mean train energy for each element of the structure. The mean strain energy for each element is, in turn, used to build a damage index that represents the ratio of the stiffness parameter of the pre-damaged to the post-damaged structure. The validity of the methodology is demonstrated using data from a numerical example of a space truss structure with simulated damage. Also in the example, the effects of noisy data on the proposed algorithm are examined by adding random noised to the response data.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.145-151
• /
• 2004

We present an efficient data structure to obtain the range minima in an away in constant time. Recently, suffix ways are extensively used to search DNA sequences fast in bioinformatics. In constructing suffix arrays, solving the range minima problem is necessary When we construct suffix arrays, we should solve the range minima problem not only in a time-efficient way but also in a space-efficient way. The reason is that DNA sequences consist of millions or billions of bases. Until now, the most efficient data structure to find the range minima in an way in constant time is based on the method that converts the range minima problem in an array into the LCA (Lowest Common Ancestor) problem in a Cartesian tree and then converts the LCA problem into the range minima problem in a specific array. This data structure occupies O( n) space and is constructed in O(n) time. However since this data structure includes intermediate data structures required to convert the range minima problem in an array into other problems, it requires large space (=13n) and much time. Our data structure is based on the method that directly solves the range minima problem. Thus, our data structure requires small space (=5n) and less time in practice. As a matter of course, our data structure requires O(n) time and space theoretically.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.11a
• /
• pp.669-673
• /
• 2007

In this study, real-time hybrid test using a shaking table for the control performance evaluation of a U-shaped TLCD controlling the response of earthquake-excited building structure is experimentally implemented. In the test, the building structure is used as a numerical part, on which a U-shaped TLCD adopted as an experimental part was installed to reduceits response. At first, the force that is acting between a TLCD and building structure is measured from the load cell attached on shaking table and is fed-back to the computer to control the motion of shaking table. Then, the shaking table is so driven that the error between the interface acceleration computed from the numerical building structure with the excitations of earthquake and the fed-back interface force and that measured from the shaking table. The control efficiency of the TLCD used in this paper is experimentally confirmed by implementing this process of shaking table experiment on real-time.

• 유체기계공업학회:학술대회논문집
• /
• 2006.08a
• /
• pp.383-386
• /
• 2006

In this study, we propose a new fast algorithm for calculating short range forces in molecular dynamics, This algorithm uses a new hierarchical tree data structure which has a high adaptiveness to the particle distribution. It can divide a parent cell into k daughter cells and the tree structure is independent of the coordinate system and particle distribution. We investigated the characteristics and the performance of the tree structure according to k. For parallel computation, we used orthogonal recursive bisection method for domain decomposition to distribute particles to each processor, and the numerical experiments were performed on a 32-node Linux cluster. We compared the performance of the oct-tree and developed new algorithm according to the particle distributions, problem sizes and the number of processors. The comparison was performed sing tree-independent method and the results are independent of computing platform, parallelization, or programming language. It was found that the new algorithm can reduce computing cost for a large problem which has a short search range compared to the computational domain. But there are only small differences in wall-clock time because the proposed algorithm requires much time to construct tree structure than the oct-tree and he performance gain is small compared to the time for single time step calculation.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.25 no.4
• /
• pp.523-532
• /
• 2001

A simultaneous measurement of wall vorticity and near-wall streamwise velocity fluctuations has been performed using a V-type wall vorticity probe and an I-type velocity probe to investigate the relation between them. Long-time averaged space-time correlations show that the wall vorticity is highly correlated with a turbulence structure which is tilted from the wall in the streamwise direction and that there is a streamwise vortex pair near the wall. It is shown that a structure correlated with the streamwise wall vorticity is smaller than and prior to a structure correlated with the spanwise wall vorticity. Tilting angles are obtained from the phase shift between the wall vorticity and streamwise velocity fluctuations. The tilting angle of the structure correlated with the streamwise wall vorticity is larger than that of the structure correlated with the spanwise wall vorticity. The convection velocity of the near-wall streamwise velocity fluctuations obtained from the space-time correlation is in good agreement with previous results.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2005.07a
• /
• pp.554-555
• /
• 2005

In this paper, we analyzed a metallurgical structure and arc properties of copper wire when the over-current flows on electric wire. From the results, The fusing current was related to the fusing time(current rising rate per second). In case of the shorter the fusing time, the fusing current was high, and the fusing time of ac type was larger than that of dc type. The copper wire was bent by the increase of current and heated, the beads were scattered around wire with a flash. We could observed the dendrite structure in 'molten wire at ac and dc current type. According as the current rising rate per second is short, the dendrite structure is distributed in surface of wire.