• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

• The KIPS Transactions:PartD
• /
• v.14D no.3 s.113
• /
• pp.347-354
• /
• 2007

It is not easy for the customers to search the valuable information on the goods among countless items available in the Internet. In order to save time and efforts in searching the goods the customers want, it is very important for a recommender system to have a capability to predict accurately customers' preferences. In this paper we present a refined neighbor selection algorithm for clustering based collaborative filtering in recommender systems. The algorithm exploits a graph approach and searches more efficiently for set of influential customers with respect to a given customer; it searches with concepts of weighted similarity and ranked clustering. The experimental results show that the recommender systems using the proposed method find the proper neighbors and give a good prediction quality.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.131-140
• /
• 2014

In this paper, we present an efficient implementation of Kruskal's algorithm to obtain a minimum spanning tree. The proposed method utilizes the union-find data structure, reducing the depth of the tree of the node set by making the nodes in the path to root be the child node of the root of combined tree. This method can reduce the depth of the tree by shortening the path to the root and lowering the level of the node. This is an efficient method because if the tree's depth reduces, it could shorten the time of finding the root of the tree to which the node belongs. The performance of the proposed method is evaluated through the graphs generated randomly. The results showed that the proposed method outperformed the conventional method in terms of the depth of the tree.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5A
• /
• pp.466-473
• /
• 2010

Several protocols which are based on tree topology to guarantee the important metrics such as energy efficiency in sensor networks have been proposed. However, studies on the effect of topologies in sensor networks, where base node has a high mobility, are very few. In this paper, we propose a minimum Wiener index tree as a suitable topology to the wireless sensor networks with high mobile base node. The minimum Wiener index spanning tree problem which aims to find a tree with minimum Wiener index from a given weighted graph was proved to be NP-hard. We designed a branch and bound algorithm for this problem. To evaluate the performance of proposed tree, the comparisons with minimum spanning tree in terms of transmission distance, energy consumption during one round, and network lifetime was performed by simulations. Our proposed tree outperformed in transmission distance and energy efficiency but underperformed in lifetime.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.17-24
• /
• 2007

Critical practicality problems are cause to search the presentation and contents according to user request and purpose in previous internet system. Recently, there are a lot of researches about dynamic adaptable ontology based system. We designed ontology based educational system which uses discrete probability and user profile. This system provided advanced usability of contents by ontology and dynamic adaptive model based on discrete probability distribution function and user profile in ontology educational systems. This models represents application domain to weighted direction graph of dynamic adaptive objects and modeling user actions using dynamically approach method structured on discrete probability function. Proposed probability analysis can use that presenting potential attribute to user actions that are tracing search actions of user in ontology structure. This approach methods can allocate dynamically appropriate profiles to user.

• Annals of Clinical Neurophysiology
• /
• v.25 no.2
• /
• pp.93-102
• /
• 2023

Background: We aimed to identify any differences in the structural covariance network based on structural volume and those in the functional network based on cerebral blood flow between the ipsilateral and contralateral hemispheres of pain in patients with episodic migraine without aura. Methods: We prospectively enrolled 27 patients with migraine without aura, all of whom had unilateral migraine pain. We defined the ipsilateral hemisphere as the side of migraine pain. We measured structural volumes on three-dimensional T1-weighted images and cerebral blood flow using arterial spin labeling magnetic resonance imaging. We then analyzed the structural covariance network based on structural volume and the functional network based on cerebral blood flow using graph theory. Results: There were no significant differences in structural volume or cerebral blood flow between the ipsilateral and contralateral hemispheres. However, there were significant differences between the hemispheres in the structural covariance network and the functional network. In the structural covariance network, the betweenness centrality of the thalamus was lower in the ipsilateral hemisphere than in the contralateral hemisphere. In the functional network, the betweenness centrality of the anterior cingulate and paracingulate gyrus was lower in the ipsilateral hemisphere than in the contralateral hemisphere, while that of the opercular part of the inferior frontal gyrus was higher in the former hemisphere. Conclusions: The present findings indicate that there are significant differences in the structural covariance network and the functional network between the ipsilateral and contralateral hemispheres of pain in patients with episodic migraine without aura.

• Journal of Korea Water Resources Association
• /
• v.45 no.4
• /
• pp.393-407
• /
• 2012

This study suggests the results of temporal and spatial variations for rainfall data in the Korean Peninsula. We got the index of the rainfall amount, frequency and extreme indices from 65 weather stations. The results could be easily understood by drawing the graph, and the Mann-Kendall trend analysis was also used to determine the tendency (up & downward/no trend) of rainfall and temperature where the trend could not be clear. Moreover, by using the FARD, frequency probability rainfalls could be calculated for 100 and 200 years and then compared each other value through the moment method, maximum likelihood method and probability weighted moments. The Average Rainfall Index (ARI) which is meant comprehensive rainfalls risk for the flood could be obtained from calculating an arithmetic mean of the RI for Amount (RIA), RI for Extreme (RIE), and RI for Frequency (RIF) and as well as the characteristics of rainfalls have been mainly classified into Amount, Extremes, and Frequency. As a result, these each Average Rainfall Indices could be increased respectively into 22.3%, 26.2%, and 5.1% for a recent decade. Since this study showed the recent climate change trend in detail, it will be useful data for the research of climate change adaptation.

• Journal of the Korean Society of Physical Medicine
• /
• v.9 no.1
• /
• pp.45-53
• /
• 2014

PURPOSE: In this study, we tried to find out what kind of exercise was more effective in sleep disorder by comparing melatonin in blood after applying low intensity with high intensity exercise to sleep disordered rats induced by experiment. METHODS: We used male Sprague-Dawley rats which were 8weeks old and weighted 300g. They were supplied with water and food without any restriction. We kept the room temperature at $25^{\circ}C$ and controld the length of day and night in 12 hours blocks, respectively. We divided the rats 60 into 2 groups. To one group we applied low intensity exercise, and to the other we applied high intensity exercise for 15minutes per day over a period of 4 weeks. We extracted the blood from abdominal aorta before, after exercise, moved into EDTA tube, performed centrifugation. We decanted the serum $200{\mu}l$ from the blood into microcentrifuge tube by samples and moved into polypropylene culture tubes with micro pipette. We split enzyme solution $50{\mu}l$ into the tubes with melatonin direct kits and make them react at $37^{\circ}C$ for 2 hours. We split assay buffer $50{\mu}l$ into each tube and mixed melatonin tracer $50{\mu}l$ and melatonin antiserum $50{\mu}l$, respectively. After we made them react in room temperature, we decanted the superficial layer with a centrifuge and measured the activity for 1 minute by competitive method with ${\gamma}$-counter equipment. We draw a standard curve through logit-log graph with CPM(counts per minute) and counted the melatonin by B/B0. We conducted independent t-test to examine the homogeneous of melatonin value of before low-intensity and high-intensity exercise. We performed paired t-test to compare before and after low-intensity and high-intensity exercise, respectively. We carried out independent t-test to compare melatonin value after low-intensity and high-intensity exercise. Significance level was .05. RESULTS: The results were as follows; firstly melatonin was more increased in the group who was exposed to high intensity exercise when we compared before to after high and low intensity exercise, respectively. Secondly, high intensity exercise was more effective than low intensity exercise when we compared the two. CONCLUSION: In conclusion, secretion of melatonin which is the material of sleep improvement could be promoted by high intensity exercise. Low intensity exercise acted as a stress rather than improving sleep and had a negative effect on the secretion of melatonin because the melatonin was affected by stress.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.191-198
• /
• 2013

It is required to transmit data through shorter path between sensor and base node for real time intrusion detection in wireless sensor networks (WSN) with a mobile base node. Because minimum Wiener index spanning tree (MWST) based routing approach guarantees lower average hop count than that of minimum spanning tree (MST) based routing method in WSN, it is known that MWST based routing is appropriate for real time intrusion detection. However, the minimum Wiener index spanning tree problem which aims to find a spanning tree which has the minimum Wiener index from a given weighted graph was proved to be a NP-hard. And owing to its high dependency on certain nodes, minimum Wiener index tree based routing method has a shorter network lifetime than that of minimum spanning tree based routing method. In this paper, we propose a multi-objective ant colony optimization algorithm to tackle these problems, so that it can be used to detect intrusion in real time in wireless sensor networks with a mobile base node. And we compare the results of our proposed method with MST based routing and MWST based routing in respect to average hop count, network energy consumption and network lifetime by simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.165-173
• /
• 2012

Given a connected, weighted, and undirected graph, the Minimum Spanning Tree (MST) should have minimum sum of weights, connected all vertices, and without any cycle taking place. Borůvka Algorithm is firstly suggested as an algorithm to evaluate the MST, but it is not widely used rather than Prim and Kruskal algorithms. Borůvka algorithm selects the Minimum Weight Edge (MWE) from each vertex with distinct weights in $1^{st}$ stage, and selects the MWE from each MSF (Minimum Spanning Forest) in $2^{nd}$ stage. But the cycle check and the number of MSF in $1^{st}$ stage and $2^{nd}$ stage are difficult to implication by computer program even if it is easy to verify visually. This paper suggests the generalized Borůvka Algorithm, This algorithm selects all of the same MWEs for each vertex, then checks the cycle and constructs MSF for ascending sorted MWEs. Kruskal method bring into this process. if the number of MSF greats then 1, this algorithm selects MWE from ascending sorted inter-MSF edges. The generalized Borůvka algorithm is verified its application by being applied to the 7 graphs with the many minimum weights or distinct weight edges for any vertex. As a result, the generalized Borůvka algorithm is less required for cycle verification then the Kruskal algorithm. Therefore, the generalized Borůvka algorithm is more fast to obtain MST then Kruskal algorithm.