• Journal of Digital Contents Society
• /
• v.13 no.3
• /
• pp.451-457
• /
• 2012

Recently, as the use of real time traffic information of a car navigation system increases rapidly with the development of Intelligent Transportation Systems (ITS), path search is getting more important. Previous algorithms, however, are mostly for the shortest distance searching and provide route information using static distance and time information. Thus they could not provide the most optimal route at the moment which changes dynamically according to traffic. Accordingly, in this study, Semantic Shortest Path algorithm with Reduction ratio & Distance(SSP_RD) is proposed to solve this problem. Additionally, a routing model based on velocity reduction ratio and distance and a dynamic route link map are proposed.

• Journal of Navigation and Port Research
• /
• v.33 no.9
• /
• pp.609-614
• /
• 2009

The traffic of tug/barges which are carrying construction materials, large plants for harbor development, or offshore structures has recently increased in the coast of Korea. The west and south coast of Korea are always congested due to a lot of islands and traffic concentration. Specially tug/barges have higher probability of marine accidents due to their bad maneuverability than others. Considering the operational circumstance and maneuverability, this study was to develop a wide-area monitoring and control system for tug/barges in the coastal area of Korea. The system was made in the form of three program modules i.e. navigation analysis program module, monitoring and control program module, database module. And seven functions were programmed to monitor and control the tug/barges efficiently. These are ship information search, tug/barge information and track management, designated area and safe navigation zone management, fairway management, accident data management, warning of danger, safety information management.

• The Journal of Korean Obstetrics and Gynecology
• /
• v.32 no.3
• /
• pp.73-85
• /
• 2019

Objectives: The purpose of this study was to analyze efficacy and safety of Korean Medicine treatment for traffic accidents during pregnancy. Methods: We investigated the studies on Korean Medicine treatment for traffic accidents during pregnancy via searching through PUBMED, the Cochrane Library, CNKI, and domestic search engines and a total of 6 studies were selected. Results: The major complaints of traffic accidents during pregnancy were low back pain, neck pain and gastrointestinal symptoms. And there were vaginal bleeding and pruritus vulvae in the complaints. All of the studies were given acupuncture treatment for symptom relief, and chuna, herbal acupuncture and cupping were administered. Herbal medicine was also performed, and the most prescribed herbal medicine was Antaeeum-gamibang. All cases reported as traffic accidents during pregnancy showed a reduction in symptoms, normal pregnancy maintenance and delivery, and no miscarriage were reported. Conclusions: Korean Medicine treatment is an effective and safe treatment option for traffic accidents during pregnancy. Further systematic studies are needed to establish the basis for Korean Medicine treatment for traffic accidents during pregnancy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.7
• /
• pp.993-1000
• /
• 2002

In this paper, we design the CORBA-based Mobile Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(below node) routing schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent m()del that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separates the existing mobile agent object by mobile agent including only agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it reduces the required time for round works of mobile agent through the optimal path search of migration nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.550-554
• /
• 2002

In this paper, we design the CORBA-based Mobile-Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(node) muting schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent model that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separated by mobile agent including oかy agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it can reduce the required time for round works of mobile agent through the optimal path search of migration nodes.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.217-221
• /
• 2010

As the appearances of various new mobile devices and the explosive growth of mobile device users, many researches related to mobile P2P systems have been proceeded actively. In this paper, we propose a new search algorithm for the double-layered super peer system in the mobile environment. For the proposed search algorithm, we divide the entire experiment region into a grid of cells, each of which has the same size. The grid is configured properly by considering the communication range of a mobile device and the number of peers in the system. The proposed search algorithm is a partial flooding search method based on the directions of cells involved with the search. It reduces successfully the network traffic, but shows a low search hit ratio. To enhance the search hit ratio, we introduce a bridge-peer table for a super peer and utilize an n-way search. The experimental results show that the proposed algorithm made an average of 20~30% reduction in the number of message packets over the double-layered system. The success ratio was also improved about 2~5% over the double-layered system.

• Science of Emotion and Sensibility
• /
• v.20 no.1
• /
• pp.115-132
• /
• 2017

Differences in reaction time and accuracy were compared among driver groups of middle-, old-, and stroke old-age drivers using various reaction time tasks including simple reaction task, 2-choice task, 4-choice task with different stimuli eccentricity, search task, and moving target detection task. The results can be summarized as followings. First, although overall reaction time tended to be slowed with age and stroke, stroke old drivers showed significantly slower reaction time than the other driver groups when the stimuli were presented in a large eccentricity. Second, differences in reaction time for 2-choice task and moving target detection task seemed to be determined mainly by participants' simple reaction time. Third, the search task which required temporary retention of previously presented stimuli was found to be more sensitive in discriminating difference in reaction time between middle-age drivers and old-age drivers (including stroke old drivers). Fourth, reaction accuracy of old (and stroke old) drivers decreased when more stimuli alternatives were presented and temporary retention for stimuli was required. Altogether, memory demand in reaction time task can be sensitive to evaluate performance for different age groups, whereas size of useful field of view for brain stroke.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.481-490
• /
• 2006

In a super-peer based P2P network, The network is clustered and each cluster is managed by a special peer, called a super-peer which has information of all peers in its cluster. This clustered P2P model is known to have efficient information search and less traffic load. In this paper, we first estimate the message traffic cost caused by peer's query, join and update actions within a cluster as well as between the clusters and with these values, we present the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.rks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.854-861
• /
• 2003

In this paper, we proposed the fuzzy control algorithm for efficient buffer control about traffic that is connected in ATM networks. The proposed Fuzzy control algorithm has total traffic arrival ratio, buffer occupancy ratio and Fuzzy set to search for dynamic service rates in server. That is, is based on Fuzzy logic according to the arrival ratio of total traffic and buffer occupancy ratio that is happened and reasoning. Then, made reasoning result control service rates in server about traffic that is connected with defuzzification value. Performance analysis result: it was confirmed that with the proposed scheme, performance improves at cell loss rate, when compared with the existing PBS scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.199-202
• /
• 2009

The optimal path on real road network has been changed by traffic flow of roads frequently. Therefore a path finding system to find the optimal path on real network should consider traffic flow of roads that is changed on real time. The most of existing path finding methods do not consider traffic flow of roads and do not also perform efficiently if they use traffic information. In this paper, we propose an abstraction method of real road network based on the Terminal Based Navigation System (TBNS) with technique such as TPEG. TBNS can be able to provides quality of path better than before as using traffic information that is transferred by TPEG. The proposed method is to abstract real network as simple graph in order to use traffic information. It is composed boundary nodes based on real nodes, all boundary nodes that have the same of connection are merged together. The result of path finding on an abstract graph diminishes the search space.