• Convergence Security Journal
• /
• v.17 no.4
• /
• pp.11-16
• /
• 2017

MANET composed of only mobile node is applied to various environments because of its advantage which can construct network quickly in emergency situation. However, many routing vulnerabilities are exposed due to the dynamic topology and link failures by the movement of nodes. It can significantly degrade network performance. In this paper, we propose a secure routing protocol based on trust model. The domain-based network structure is used for efficient trust evaluation and management of nodes in the proposed technique. The reliability evaluation of nodes was performed by the discard ratio of control packet and data packet of the nodes. The abnormal nodes are detected by performing traffic check and inspecting of nodes on a path that generates excessive traffic in order to increase the efficiency of routing. It is confirmed through experiments of the proposed technique that data transmission is performed securely even if an attack exists on the path.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.672-677
• /
• 2016

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.267-271
• /
• 2005

The goal of data mining is to extract new and useful knowledge from large scale datasets. As the amount of available data grows explosively, it became vitally important to develop faster data mining algorithms for various types of data. Recently, an interest in developing data mining algorithms that operate on graphs has been increased. Especially, mining frequent patterns from structured data such as graphs has been concerned by many research groups. A graph is a highly adaptable representation scheme that used in many domains including chemistry, bioinformatics and physics. For example, the chemical structure of a given substance can be modelled by an undirected labelled graph in which each node corresponds to an atom and each edge corresponds to a chemical bond between atoms. Internet can also be modelled as a directed graph in which each node corresponds to an web site and each edge corresponds to a hypertext link between web sites. Notably in bioinformatics area, various kinds of newly discovered data such as gene regulation networks or protein interaction networks could be modelled as graphs. There have been a number of attempts to find useful knowledge from these graph structured data. One of the most powerful analysis tool for graph structured data is frequent subgraph analysis. Recurring patterns in graph data can provide incomparable insights into that graph data. However, to find recurring subgraphs is extremely expensive in computational side. At the core of the problem, there are two computationally challenging problems. 1) Subgraph isomorphism and 2) Enumeration of subgraphs. Problems related to the former are subgraph isomorphism problem (Is graph A contains graph B?) and graph isomorphism problem(Are two graphs A and B the same or not?). Even these simplified versions of the subgraph mining problem are known to be NP-complete or Polymorphism-complete and no polynomial time algorithm has been existed so far. The later is also a difficult problem. We should generate all of 2$^n$ subgraphs if there is no constraint where n is the number of vertices of the input graph. In order to find frequent subgraphs from larger graph database, it is essential to give appropriate constraint to the subgraphs to find. Most of the current approaches are focus on the frequencies of a subgraph: the higher the frequency of a graph is, the more attentions should be given to that graph. Recently, several algorithms which use level by level approaches to find frequent subgraphs have been developed. Some of the recently emerging applications suggest that other constraints such as connectivity also could be useful in mining subgraphs : more strongly connected parts of a graph are more informative. If we restrict the set of subgraphs to mine to more strongly connected parts, its computational complexity could be decreased significantly. In this paper, we present an efficient algorithm to mine frequent subgraphs that are more strongly connected. Experimental study shows that the algorithm is scaling to larger graphs which have more than ten thousand vertices.

• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.34-41
• /
• 2011

At present wireless internet access service is available through the 3G network, mobile WiMAX and WiFi anytime and anywhere. In this environment where there are various networks, users should be able to select specific networks depending on different situations. And it is necessary to provide mobility support between homogeneous and between heterogenous networks. Given this situation, the many proposals have been presented to link 3G, which has the largest service area among various networks, with mobile WiMAX(IEEE 802.16e), or with WiFi(IEEE 802.11). But, recently, with the increasing volume of wireless internet use and wireless internet data, due to the advents of net-book, e-book and smart phone, the service area of WiFi and mobile WiMAX has rapidly expanded. Especially, the availability of real-time application such as internet phone has led to the relative shrinking of the proportion of 3G mobile communication network giving conventional voice service, and enlargement of those of wireless internet access networks like WiFi and mobile WiMAX. This paper suggests a handover scheme based on PMIPv6, whitch support mobility between WiFi and mobile WiMAX, and minimizes handover delay. In this scheme, the mobile node has a dual stack structure composed of two interfaces-WiFi and mobile WiMAX. Since WiFi dose not support mobility, it is suggested that the mobile node have the capacity to deal with handover signaling between gateway in case of handover between homogeneous networks. This handover scheme, suggested comparing with current handovers between homogeneous networks, has proved, in its analytic evaluation, to be able to reduce handover, transmission, and signaling overhead.

• Journal of Veterinary Clinics
• /
• v.33 no.5
• /
• pp.278-285
• /
• 2016

Epidemiological studies have shown the association between transportation of live animals and the potential transmission of infectious disease between premises. This finding was also observed in the 2014-2015 foot-and-mouth disease (FMD) outbreak in Korea. Furthermore, slaughterhouses played a key role in the global spread of the FMD virus during the epidemic. In this context, in-depth knowledge of the structure of direct and indirect contact between slaughterhouses is paramount for understanding the dynamics of FMD transmission. But the social network structure of vehicle movements to slaughterhouses in Korea remains unclear. Hence, the aim of this study was to configure a social network topology of vehicle movements between slaughterhouses for a better understanding of how they are potentially connected, and to explore whether FMD outbreaks can be explained by the network properties constructed in the study. We created five monthly directed networks based on the frequency and chronology of on- and off-slaughterhouse vehicle movements. For the monthly network, a node represented a slaughterhouse, and an edge (or link) denoted vehicle movement between two slaughterhouses. Movement data were retrieved from the national Korean Animal Health Integrated System (KAHIS) database, which tracks the routes of individual vehicle movements using a global positioning system (GPS). Electronic registration of livestock movements has been a mandatory requirement since 2013 to ensure traceability of such movements. For each of the five studied networks, the network structures were characterized by small-world properties, with a short mean distance, a high clustering coefficient, and a short diameter. In addition, a strongly connected component was observed in each of the created networks, and this giant component included 94.4% to 100% of all network nodes. The characteristic hub-and-spoke type of structure was not identified. Such a structural vulnerability in the network suggests that once an infectious disease (such as FMD) is introduced in a random slaughterhouse within the cohesive component, it can spread to every other slaughterhouse in the component. From an epidemiological perspective, for disease management, empirically derived small-world networks could inform decision-makers on the higher potential for a large FMD epidemic within the livestock industry, and could provide insights into the rapid-transmission dynamics of the disease across long distances, despite a standstill of animal movements during the epidemic, given a single incursion of infection in any slaughterhouse in the country.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.189-196
• /
• 2004

Most of the recent researches for ATM switches have been based on multistage interconnection network known as regularity and self-routing property. These networks can switch packets simultaneously and in parallel. However, they are blocking networks in the sense that packet is capable of collision with each other Mainly Banyan network have been used for structure. There are several ways to reduce the blocking or to increase the throughput of banyan-type switches: increasing the internal link speeds, placing buffers in each switching node, using multiple path, distributing the load evenly in front of the banyan network and so on. Therefore, this paper proposes the use of recirculating shuffle-exchange network to reduce the blocking and to improve hardware complexity. This structures are recirculating shuffle-exchange network as simplified in hardware complexity and Rank network with tree structure which send only a packet with highest priority to the next network, and recirculate the others to the previous network. after it decides priority number on the Packets transferred to the same destination, The transferred Packets into banyan network use the function of self routing through decomposition and composition algorithm and all they arrive at final destinations. To analyze throughput, waiting time and packet loss ratio according to the size of buffer, the probabilities are modeled by a binomial distribution of packet arrival. If it is 50 percentage of load, the size of buffer is more than 15. It means the acceptable packet loss ratio. Therefore, this paper simplify the hardware complexity as use of recirculating shuffle-exchange network instead of bitonic sorter.

• Journal of Korea Water Resources Association
• /
• v.45 no.2
• /
• pp.203-215
• /
• 2012

The objective of this study is to develop a catchment hydrologic cycle assessment model which can assess the impact of urban development and designing water cycle improvement facilities. Developed model might contribute to minimize the damage caused by urban development and to establish sustainableurban environments. The existing conceptual lumped models have a potential limitation in their capacity to simulate the hydrologic impacts of land use changes and assess diverse urban design. The distributed physics-based models under active study are data demanding; and much time is required to gather and check input data; and the cost of setting up a simulation and computational demand are required. The Catchment Hydrologic Cycle Assessment Tool (hereinafter the CAT) is a water cycle analysis model based on physical parameters and it has a link-node model structure. The CAT model can assess the characteristics of the short/long-term changes in water cycles before and after urbanization in the catchment. It supports the effective design of water cycle improvement facilities by supplementing the strengths and weaknesses of existing conceptual parameter-based lumped hydrologic models and physical parameter-based distributed hydrologic models. the model was applied to Seolma-cheon catchment, also calibrated and validated using 6 years (2002~2007) hourly streamflow data in Jeonjeokbigyo station, and the Nash-Sutcliffe model efficiencies were 0.75 (2002~2004) and 0.89 (2005~2007).

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.2
• /
• pp.62-73
• /
• 2022

As the competition among the autonomous vehicle (AV, here after) developers are getting fierce, Korean government has been supporting developers by deregulating safety standards and providing financial subsidies. Recently, some OEMs announced their plans to market Lv3 and Lv4 automated driving systems. However, these market changes raised concern among public road management sectors for monitoring road conditions and alleviating hazardous conditions for AVs and human drivers. In this regards, the authors proposed a methodology for monitoring road infrastructure to identify hazardous factors for AVs and categorizing the hazards based on their level of impact. To evaluate the degrees of the harm on AVs, the authors suggested a methodology for managing road hazard factors based on vehicle performance features including vehicle body, sensors, and algorithms. Furthermore, they proposed a method providing AVs and road management authorities with potential risk information on road by delivering them on the monitoring map with node and link structure.

• Korean Journal of Heritage: History & Science
• /
• v.52 no.3
• /
• pp.172-187
• /
• 2019

Knowledge of intangible cultural heritage is usually disseminated through word-of-mouth and actions rather than written records. Thus, people assemble to teach others about it and form communities. Accordingly, to understand and spread information about intangible cultural heritage properly, it is necessary to understand not only their attributes but also a community's relational characteristics. Community members include specialized transmitters who work under the auspices of institutions, and general transmitters who enjoy intangible cultural heritage in their daily lives. They converse about intangible cultural heritage in close relationships. However, to date, research has focused only on professionals. Thus, this study focused on the roles of general transmitters of intangible cultural heritage information by investigating intangible cultural heritage communities centering around Jeongseon Arirang; a social network analysis was performed. Regarding the research objectives presented in the introduction, the main findings of the study are summarized as follows. First, there were 197 links between 74 members of the Jeongseon Arirang Transmission Community. One individual had connections with 2.7 persons on average, and all were connected through two steps in the community. However, the density and the clustering coefficient were low, 0.036 and 0.32, respectively; therefore, the cohesiveness of this community was low, and the relationships between the members were not strong. Second, 'Young-ran Yu', 'Nam-gi Kim' and 'Gil-ja Kim' were found to be the prominent figures of the Jeongseon Arirang Transmission Community, and the central structure of the network was concentrated around these three individuals. Being located in the central structure of the network indicates that a person is popular and ranked high. Also, it means that a person has an advantage in terms of the speed and quantity of the acquisition of information and resources, and is in a relatively superior position in terms of bargaining power. Third, to understand the replaceability of the roles of Young-ran Yu, Nam-gi Kim, and Gil-ja Kim, who were found to be the major figures through an analysis of the central structure, structural equivalence was profiled. The results of the analysis showed that the positions and roles of Young-ran Yu, Nam-gi Kim, and Gil-ja Kim were unrivaled and irreplaceable in the Jeongseon Arirang Transmission Community. However, considering that these three members were in their 60s and 70s, it seemed that it would be necessary to prepare measures for the smooth maintenance and operation of the community. Fourth, to examine the subgroup hidden in the network of the Jeongseon Arirang Transmission Community, an analysis of communities was conducted. A community refers to a subgroup clearly differentiated based on modularity. The results of the analysis identified the existence of four communities. Furthermore, the results of an analysis of the central structure showed that the communities were formed and centered around Young-ran Yu, Hyung-jo Kim, Nam-gi Kim, and Gil-ja Kim. Most of the transmission TAs recommended by those members, students who completed a course, transmission scholarship holders, and the general members taught in the transmission classes of the Jeongseon Arirang Preservation Society were included as members of the communities. Through these findings, it was discovered that it is possible to maintain the transmission genealogy, making an exchange with the general members by employing the present method for the transmission of Jeongseon Arirang, the joint transmission method. It is worth paying attention to the joint transmission method as it overcomes the demerits of the existing closed one-on-one apprentice method and provides members with an opportunity to learn their masters' various singing styles. This study is significant for the following reasons: First, by collecting and examining data using a social network analysis method, this study analyzed phenomena that had been difficult to investigate using existing statistical analyses. Second, by adopting a different approach to the previous method in which the genealogy was understood, looking at oral data, this study analyzed the structures of the transmitters' relationships with objective and quantitative data. Third, this study visualized and presented the abstract structures of the relationships among the transmitters of intangible cultural heritage information on a 2D spring map. The results of this study can be utilized as a baseline for the development of community-centered policies for the protection of intangible cultural heritage specified in the UNESCO Convention for the Safeguarding of Intangible Cultural Heritage. To achieve this, it would be necessary to supplement this study through case studies and follow-up studies on more aspects in the future.

• Journal of Intelligence and Information Systems
• /
• v.20 no.1
• /
• pp.49-65
• /
• 2014

Word of Mouth (WOM) is a behavior used by consumers to transfer or communicate their product or service experience to other consumers. Due to the popularity of social media such as Facebook, Twitter, blogs, and online communities, electronic WOM (e-WOM) has become important to the success of products or services. As a result, most enterprises pay close attention to e-WOM for their products or services. This is especially important for movies, as these are experiential products. This paper aims to identify the network factors of an online movie community that impact box office revenue using social network analysis. In addition to traditional WOM factors (volume and valence of WOM), network centrality measures of the online community are included as influential factors in box office revenue. Based on previous research results, we develop five hypotheses on the relationships between potential influential factors (WOM volume, WOM valence, degree centrality, betweenness centrality, closeness centrality) and box office revenue. The first hypothesis is that the accumulated volume of WOM in online product communities is positively related to the total revenue of movies. The second hypothesis is that the accumulated valence of WOM in online product communities is positively related to the total revenue of movies. The third hypothesis is that the average of degree centralities of reviewers in online product communities is positively related to the total revenue of movies. The fourth hypothesis is that the average of betweenness centralities of reviewers in online product communities is positively related to the total revenue of movies. The fifth hypothesis is that the average of betweenness centralities of reviewers in online product communities is positively related to the total revenue of movies. To verify our research model, we collect movie review data from the Internet Movie Database (IMDb), which is a representative online movie community, and movie revenue data from the Box-Office-Mojo website. The movies in this analysis include weekly top-10 movies from September 1, 2012, to September 1, 2013, with in total. We collect movie metadata such as screening periods and user ratings; and community data in IMDb including reviewer identification, review content, review times, responder identification, reply content, reply times, and reply relationships. For the same period, the revenue data from Box-Office-Mojo is collected on a weekly basis. Movie community networks are constructed based on reply relationships between reviewers. Using a social network analysis tool, NodeXL, we calculate the averages of three centralities including degree, betweenness, and closeness centrality for each movie. Correlation analysis of focal variables and the dependent variable (final revenue) shows that three centrality measures are highly correlated, prompting us to perform multiple regressions separately with each centrality measure. Consistent with previous research results, our regression analysis results show that the volume and valence of WOM are positively related to the final box office revenue of movies. Moreover, the averages of betweenness centralities from initial community networks impact the final movie revenues. However, both of the averages of degree centralities and closeness centralities do not influence final movie performance. Based on the regression results, three hypotheses, 1, 2, and 4, are accepted, and two hypotheses, 3 and 5, are rejected. This study tries to link the network structure of e-WOM on online product communities with the product's performance. Based on the analysis of a real online movie community, the results show that online community network structures can work as a predictor of movie performance. The results show that the betweenness centralities of the reviewer community are critical for the prediction of movie performance. However, degree centralities and closeness centralities do not influence movie performance. As future research topics, similar analyses are required for other product categories such as electronic goods and online content to generalize the study results.