• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.25-32
• /
• 2023

Decision-making refers to identifying the best alternative among a set of alternatives. When a set of criteria are involved, the decision-making is called multi-criteria decision-making (MCDM). In some cases, the involved criteria may be prioritized by the human decision-maker, which determines the importance degree for each criterion; hence, the decision-making becomes prioritized multi-criteria decision-making. The essence of prioritized MCDM is raking the different alternatives concerning the criteria and selecting best one(s) from the ranked list. This paper introduces a generic multi-level algorithm for ranking multiple alternatives in prioritized MCDM problems. The proposed algorithm is implemented by a decision support system for selecting the most critical short-road requests presented to the transportation ministry in the Kingdom of Saudi Arabia. The ranking results show that the proposed ranking algorithm achieves a good balance between the importance degrees determined by the human decision maker and the score value of the alternatives concerning the different criteria.

• Journal of Korean Society of Transportation
• /
• v.35 no.5
• /
• pp.396-408
• /
• 2017

In Korea, the number of elderly has been increasing rapidly. So it is also expected that the economic activity and the trip frequency of the elderly will increase. On the other hand, elderly related accidents such as falls during walking are steadily increasing and the satisfaction about pedestrian environment of elderly is very low. In this paper, we found one of the reasons for these dissatisfaction in pedestrian facility, which is not considering the walking ability (about 75% of non-elderly person) of the elderly. So, we analyze the kinematic walking characteristics of the elderly with the motion analysis system, when the elderly use stairs. As a result of analysis of various walking variables, the current standard for stairway height in Korean law (18cm) requires excessive force to elderly so it was difficult for elderly to keep the balance of the body in ascending and descending walk of stairs. In this paper, we propose the stair design criteria through the cluster analysis of walking parameters reflecting the gait characteristics of the elderly. This change is not a big for non-elderly person, but it can promote more socioeconomic activities for the elderly.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.141-151
• /
• 2012

This paper suggests more simple algorithm than Hungarian algorithm for assignment problem. Hungarian algorithm selects minimum cost of row and column, and subtracts minimum cost from each cost. Then, performs until the number of minimum lines with 0 equals the number of rows. But, the proposed algorithm selects the minimum cost for each rows only. From the start point with over 2 to the target point with null selects in column, fixes the maximum opportunity cost that the difference of the cost of starting point and target point, and moves the cost less than opportunity cost th more than previous cost. For the 25 balance and 7 unbalance assignment problems, This algorithm gets the optimal solution same as Hungarian algorithm. This algorithm improves the time complexity $O(n^3)$ of Hungarian algorithm to $O(n^2)$, and do not performs the transformation process from unbalance to balance assignment in Hungarian algorithm. Therefore, this algorithm can be alter Hungarian algorithm in assignment problem.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.418-429
• /
• 2001

Recently, a GIS has been applicable to the most important computer applications such as urban information systems and transportation information systems. These applications require spatial operations for an efficient management of a large volume of data. In particular, a spatial join among basic operations has the property that its response time is increased exponentially according to the number of spatial objects included in the operation. Therefore, it is not proper to the systems demanding the fast response time. To satisfy these requirements, the efficient parallel processing of spatial joins has been required. In this paper, the efficient method for creating and allocating tasks to balance statically the load of each processor in a parallel spatial join is presented. A task graph is developed in which a vertex weight is calculated by the cost model I have proposed. Then, it is partitioned through a graph partitioning algorithm. According to the experiments in CC16 parallel machine, our method made an improvement in the static load balance by decreasing the variance of a task execution time on each processor.

• International Area Studies Review
• /
• v.13 no.2
• /
• pp.643-666
• /
• 2009

When it comes to current balance, both of Korea and China enjoy the trade surplus in goods while both countries suffer trade deficit in service. This facts demonstrate that two countries have comparative disadvantages in service industry. In order to identify the international competitiveness of trade in service between Korea and China, several indexes such as TSI, RSCA and IMS was calculated, using the IMF's balance of payments (BOP) statistics as proxy. The results of this analysis are as follows. Korea has a comparative advantage in four sectors (Transportation services, Financial services, Royalties & license fees and Personal cultural recreation), while China has a comparative advantage in five sectors (Travel, Communication services, Insurance services, Computer & information services and Other Business services). Construction services are indeterminate. However, the competitiveness of the two sectors-communication and computer & information-which China has a comparative advantage will be transferred to Korea if some effort to reinforce the competitiveness is added because the gap is being narrowed.

• Journal of Environmental Science International
• /
• v.27 no.10
• /
• pp.845-851
• /
• 2018

In this study, the runoff characteristics of the non-rainfall period were examined using daily rainfall data from 1977 to 2017 and the data of runoff into the dam. Results showed that, the mean runoff decreases with longer non-rainfall periods in the Andong dam basin. The correlation coefficient between non-rainfall days and average runoff reaches 0.85. The results of the analysis of the runoff characteristics during the non-rainfall period, based on the preceding rainfall of Andong dam are as follows. The runoff characteristics of the entire non-rainfall period, shows that, for a rainfall of 1.0 mm or less, the runoff height was larger than the rainfall size and the base runoff larger. The correlation between the antecedent rainfall and runoff height was reached as high as 0.9864 in the 30 ~ 50 mm interval of the antecedent rainfall period, and this is the interval where the linearity of rainfall and runoff was at its maximum in the Andong dam basin. The correlation between the antecedent rainfall and the runoff height reached 0.92 for rainfalls of 100.0 mm. However, for rainfalls of 100.0 mm greater, the correlation between the antecedent rainfall and runoff height during the rainfall period was 0.64, which is relatively small. In this study, we investigated the runoff characteristics of the rainfall period in the Andong dam watershed. As a result, it was confirmed that the mean runoff decreased with rainfall duration. The linearity was found to be weak for rainfall events greater than 100.0 mm. The results of this study can be used as data for water balance analysis and for formulating a water supply plan to establish water resource management of Andong dam.

• Journal of Korean Society of Transportation
• /
• v.11 no.1
• /
• pp.87-103
• /
• 1993

The subject this paper is the signal control strategy under oversaturated conditions. The nature of traffic control for oversaturation is essentially different from the standard control modes. While under non-saturated situation traffic control is needed for the sake of safety and efficiency, the throughput is essential under oversaturated conditions. Therefore berth objective and strategies differ. For an oversaturated stream the cycle time and the signal offset are thought to be of rather secondary importance. For this case the green split may well be the most important control variable to serve the excessive demand. Up to now, however, most efforts have concentrated on the strategy with the concept which lies just on the extension of Webster's. "Green-split Coordination Strategy for Over-Saturated Networks", presents newly contrived three types of strategies named Forward-coordination, Backward-coordination and Network-coordination respectively and describes the algorithms with the evaluations. The forward coordination strategy treats the forward wave of flow between two signals. The aim is to prevent the outbreak of queue due to the accumulation of temporary excess of demand in near-saturation or saturation flow. The backward coordination strategy treats the backward rave of flow between two signals. The goal is to prevent the waste of green time caused by the exit block at the upstream signal. for this purpose a feedback regulation is provided of the upstream green-split so that the inflow-outflow balance is kept zero. The resultant surplus of green time is alloted to other signal stages. Also here the examination is made of the appropriate value of the feedback control parameter. The network coordination strategy is operated to maximize the network throughput in a specific direction applying a bang-bang control at the bottleneck intersection. This is a type of intervenient control for policy reasons. For this strategy the green-split coordinations, particuarly the backward coordination, are essential as the tactical elements. In order to evaluate the preposed strategies those are compared with the latest existing strategy called saturation-degree-ratio control by the simulation experiments in an assumed 4$\times$4 grid network. The results are satisfactory showing a 10-15% reduction in delays and a 15% increase in network capacity.

• Journal of the Korean Society of Physical Medicine
• /
• v.14 no.4
• /
• pp.71-80
• /
• 2019

PURPOSE: This study examined whether a task-oriented training program is an effective intervention to improve the body function, activity, and participation of children with cerebral palsy (CP). METHODS: Ten children with CP (7-13 years old) performed a task-oriented training program for eight weeks (three sessions per week, 30 minutes each). The taskoriented training program consisted of eight activities. The subjects' body function was assessed using a handheld dynamometer, goniometer, Modified Ashworth Scale (MAS), Balance Performance Monitor (BPM), and the Bruininks-Oseretsky Test of Motor Proficiency (BOTMP). The subjects' activity and participation were assessed using the Gross Motor Function Measure (GMFM) and Timed Up and Go (TUG) test. RESULTS: Task-oriented training provided significant improvements in the subjects' body function. The subjects improved the bilateral isometric muscle strength of the hip flexors, extensors and abductors, knee flexors and extensors, and ankle dorsi- and plantar flexors (p<.05). Bilateral passive hip flexion, abduction, and external rotation, knee flexion, and ankle dorsi- and plantar flexion were also increased (p<.05). In addition, the MAS score of the hip adductors decreased (p<.05) and the BOTMP score increased after training (p<.05). The subjects' activity and participation also improved significantly after training, increasing the GMFM score (p<.05) and decreasing the TUG score (p<.05). On the other hand, the BPM score did not change after training. CONCLUSION: This study suggests that a task-oriented training program can be an effective intervention to improve the body function, activity, and participation for children with CP.

• Journal of Korean Society of Transportation
• /
• v.24 no.6 s.92
• /
• pp.55-64
• /
• 2006

Pedestrians and vehicle users ate competing for limited space in urban streets. Therefore, strategical planning and design should be considered to balance the needs placed on urban streets. The study suggested a way to put this concept in to practice by comparing level of service(LOS) of pedestrians and vehicles in the planning and design stage. Also. the study considered the priority among two users basing on the land use characteristics and the functional hierarchy of the streets. In order to overcome the lack or prediction or survey of pedestrian demands in design process, new pedestrian LOS applicable to sidewalk design was suggested based on the comfort linked with the physical limitation. The comparison of the suggested way and the existing way provided at the end of the paper.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.43-54
• /
• 2004

This study analyzes characteristics and applicability of genetic algorithms and genetic operators to optimize highway alignments. Genetic algorithms, one of artificial intelligence techniques, are fast and efficient search algorithms for generating, evaluation and finding optimal highway alignment alternatives. The performance of genetic algorithms as an optimal search tool highly depends on genetic operators that are designed as a problem-specific. This study adopts low mutation operators(uniform mutation operator, straight mutation operator, non-uniform mutation operator whole non-uniform mutation operator) to explore whole search spaces, and four crossover operators(simple crossover operator, two-point crossover operator, arithmetic crossover operator, heuristic crossover operator) to exploit food characteristics of the best chromosome in previous generations. A case study and a sensitivity analysis have shown that the eight problem-specific operators developed for optimizing highway alignments enhance the search performance of genetic algorithms, and find good solutions(highway alignment alternatives). It has been also found that a mixed and well-combined use of mutation and crossover operators is very important to balance between pre-matured solutions when employing more crossover operators and more computation time when adopting more mutation operators.