• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.117-127
• /
• 2012

Due to the recent expansion of the Web 2.0 -based services, along with the widespread of smartphones, online social network services are being popularized among users. Online social network services are the online community services which enable users to communicate each other, share information and expand human relationships. In the social network services, each relation between users is represented by a graph consisting of nodes and links. As the users of online social network services are increasing rapidly, the SNS are actively utilized in enterprise marketing, analysis of social phenomenon and so on. Social Network Analysis (SNA) is the systematic way to analyze social relationships among the members of the social network using the network theory. In general social network theory consists of nodes and arcs, and it is often depicted in a social network diagram. In a social network diagram, nodes represent individual actors within the network and arcs represent relationships between the nodes. With SNA, we can measure relationships among the people such as degree of intimacy, intensity of connection and classification of the groups. Ever since Social Networking Services (SNS) have drawn increasing attention from millions of users, numerous researches have made to analyze their user relationships and messages. There are typical representative SNA methods: degree centrality, betweenness centrality and closeness centrality. In the degree of centrality analysis, the shortest path between nodes is not considered. However, it is used as a crucial factor in betweenness centrality, closeness centrality and other SNA methods. In previous researches in SNA, the computation time was not too expensive since the size of social network was small. Unfortunately, most SNA methods require significant time to process relevant data, and it makes difficult to apply the ever increasing SNS data in social network studies. For instance, if the number of nodes in online social network is n, the maximum number of link in social network is n(n-1)/2. It means that it is too expensive to analyze the social network, for example, if the number of nodes is 10,000 the number of links is 49,995,000. Therefore, we propose a heuristic-based method for finding the shortest path among users in the SNS user graph. Through the shortest path finding method, we will show how efficient our proposed approach may be by conducting betweenness centrality analysis and closeness centrality analysis, both of which are widely used in social network studies. Moreover, we devised an enhanced method with addition of best-first-search method and preprocessing step for the reduction of computation time and rapid search of the shortest paths in a huge size of online social network. Best-first-search method finds the shortest path heuristically, which generalizes human experiences. As large number of links is shared by only a few nodes in online social networks, most nods have relatively few connections. As a result, a node with multiple connections functions as a hub node. When searching for a particular node, looking for users with numerous links instead of searching all users indiscriminately has a better chance of finding the desired node more quickly. In this paper, we employ the degree of user node vn as heuristic evaluation function in a graph G = (N, E), where N is a set of vertices, and E is a set of links between two different nodes. As the heuristic evaluation function is used, the worst case could happen when the target node is situated in the bottom of skewed tree. In order to remove such a target node, the preprocessing step is conducted. Next, we find the shortest path between two nodes in social network efficiently and then analyze the social network. For the verification of the proposed method, we crawled 160,000 people from online and then constructed social network. Then we compared with previous methods, which are best-first-search and breath-first-search, in time for searching and analyzing. The suggested method takes 240 seconds to search nodes where breath-first-search based method takes 1,781 seconds (7.4 times faster). Moreover, for social network analysis, the suggested method is 6.8 times and 1.8 times faster than betweenness centrality analysis and closeness centrality analysis, respectively. The proposed method in this paper shows the possibility to analyze a large size of social network with the better performance in time. As a result, our method would improve the efficiency of social network analysis, making it particularly useful in studying social trends or phenomena.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.5
• /
• pp.40-52
• /
• 2010

A mobile ad hoc network is instant and heuristic, and it is also vulnerable and volatile. Since topology and route changes are frequent, no single routing protocol designed for a conventional network performs well. Some protocols suffer from significant performance degradation when the number of nodes increases, or when nodes become highly mobile. In this paper we investigate a way to adaptively select a routing protocol that fits to the real-time network conditions. The first phase of our study is to analyze the performances of two classes of routing protocols under various network scenarios. The second phase consists of constructing a routing protocol selection reference. All nodes continue to monitor the status of neighbor nodes and control packets exchanged. Then, the aggregated information is periodically compared against the protocol selection reference. The selected routing protocol is maintained throughout the network until the network property changes substantially. The performance of the proposed algorithm is verified by a set of computer simulations using the OPNET modeler. The experimental results show that selectively changing routing protocol adaptive to the network conditions greatly improves the efficacy of bandwidth utilization.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.2
• /
• pp.93-98
• /
• 2016

For accurate precipitation forecasts the choice of weather factors and prediction method is very important. Recently, machine learning has been widely used for forecasting precipitation, and artificial neural network, one of machine learning techniques, showed good performance. In this paper, we suggest a new method for forecasting precipitation using DBN, one of deep learning techniques. DBN has an advantage that initial weights are set by unsupervised learning, so this compensates for the defects of artificial neural networks. We used past precipitation, temperature, and the parameters of the sun and moon's motion as features for forecasting precipitation. The dataset consists of observation data which had been measured for 40 years from AWS in Seoul. Experiments were based on 8-fold cross validation. As a result of estimation, we got probabilities of test dataset, so threshold was used for the decision of precipitation. CSI and Bias were used for indicating the precision of precipitation. Our experimental results showed that DBN performed better than MLP.

• Journal of The Korean Association of Information Education
• /
• v.1 no.1
• /
• pp.38-48
• /
• 1997

This study is an attempt to present a usage of the Web as CAI in the classroom and to give a direction to the future education in the face of information age. Characteristcs of information society, current curriculum, educational and teacher education are first analyzed in this article. The features of internet and 'Web are then summarized to present benefits of usage in the classroom as a CAI tool. The literature shows several characteristics of information society as follows : a technological computer, a provision and sharing of information, multi functional society, a participative democracy', an autonomy, a time value..A problem solving and 4 Cs(e.g., cooperation, copying, communication, creativity) are newly needed in this learning environment. The Internet is a large collection of networks that are tied together so that users can share their vast resources, a wealth of information, and give a key to a successful, efficient. individual study over a time and space. The 'Web increases an academic achievement, a creativity, a problem solving, a cognitive thinking, and a learner's motivation through an easy access to : documents available on the Internet, files containing programs, pictures, movies, and sounds from an FTP site, Usenet newsgroups, WAIS seraches, computers accessible through telnet, hypertext document, Java applets and other multimedia browser enhancements, and much more, In the Web browser will be our primary tool in searching for information on the Internet in this information age.

• Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
• /
• 2001.06a
• /
• pp.1062-1062
• /
• 2001

The concept of “precision agriculture” or “site-specific farming” is usually confined to the fields of soil science, crop science and agronomy. However, because plants grow in soil, animals eat plants, and humans eat animal products, it could be argued (perhaps with some poetic licence) that the fields of feed quality, animal nutrition and animal production should also be considered in this context. NIR spectroscopy has proved over the last 20 years that it can provide a firm foundation for quality measurement across all of these fields, and with the continuing developments in instrumentation, computer capacity and software, is now a major cog in the wheel of precision agriculture. There have been a few giant leaps and a lot of small steps in the impact of NIR on the animal world. These have not been confined to the amazing advances in hardware and software, although would not have occurred without them. Rapid testing of forages, grains and mixed feeds by NIR for nutritional value to livestock is now commonplace in commercial laboratories world-wide. This would never have been possible without the pioneering work done by the USDA NIR Forage Research Network in the 1980's, following the landmark paper of Norris et al. in 1976. The advent of calibration transfer between instruments, algorithms which utilize huge databases for calibration and prediction, and the ability to directly scan whole grains and fresh forages can also be considered as major steps, if not leaps. More adventurous NIR applications have emerged in animal nutrition, with emphasis on estimating the functional properties of feeds, such as in vivo digestibility, voluntary intake, protein degradability and in vitro assays to simulate starch digestion. The potential to monitor the diets of grazing animals by using faecal NIR spectra is also now being realized. NIR measurements on animal carcasses and even live animals have also been attempted, with varying degrees of success, The use of discriminant analysis in these fields is proving a useful tool. The latest giant leap is likely to be the advent of relatively low-cost, portable and ultra-fast diode array NIR instruments, which can be used “on-site” and also be fitted to forage or grain harvesters. The fodder and livestock industries are no longer satisfied with what we once thought was revolutionary: a 2-3 day laboratory turnaround for fred quality testing. This means that the instrument needs to be taken to the samples rather than vice versa. Considerable research is underway in this area, but the challenge of calibration transfer and maintenance of instrument networks of this type remains. The animal world is currently facing its biggest challenges ever; animal welfare, alleged effects of animal products on human health, environmental and economic issues are difficult enough, but the current calamities of BSE and foot and mouth disease are “the last straw” NIR will not of course solve all these problems, but is already proving useful in some of these areas and will continue to do so.

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.127-136
• /
• 2010

A wireless sensor network(WSN) which roles as a mediator between living environment and computers in ubiquitous computing is very essential research area. Due to the constraint that sensor nodes should work in very resource-restricted circumstances, an operating system that can manage resources effectively is demanded. Also, a sensor network should be able to deal with many events quickly and simultaneously in order to respond to various physical changes in outer environment. The Sensor Network Operating System such as TinyOS, MANTIS and NanoQplus is much designed so that it can satisfy such requirement. But, for programmers who develop application program for sensor networks, they have lack of frameworks which the development is easily possible from restricted development environment. In this paper for this, we implemented a state machine framework apt for responsive systems in NanoQplus which is multi-thread-based sensor network operating system. In addition we propose an event broker module(EBM) for effective event dispatching, a message data structure for message sharing among state machines, and an execution module that handles messages and their queue and performs state transition of the machines. Furthermore, we could do the development more easily an application program with a state-based framework by developing CASE tools.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1134-1141
• /
• 1999

In this paper, we implement an optical code division multiple access(OCDMA) system and analyze the performance of the implemented system. In the implemented system, a transmitter encodes input data into optical pulses by using laser diode, and spreads the encoded pulses in an encoder which consists of 4 stage delay lines. The decoder which is the same structure as that of encoder delays and combines the spreaded pulses, and thus recovers the original data. At first, we discuss the auto- and cross-correlations of OCDMA signals under both environments of single user and multi-users, and then verify the simulation results with experimental results. We also evaluate the effect of a number of stages of delay line and code length on the system performance through computer simulations. As experimental results we can see that if the decoder have the same configuration as that of encoder, the peak auto-correlation characteristics can be achieved, and thus we can recover the original data from received data. As simulation results we can see that although bit error rate decreases as code length decreases or the number of stage of delay line increases, it is difficult to implement the system because the pulse width becomes narrow. From the results, we can apply CDMA technologies to optical communication networks.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.691-700
• /
• 2003

Due to the fast development of wire&wireless internet and computer hardware, more and more internet services are being developed, such as Internet broadcast, VoD (Video On Demand), etc. So QoS (Qualify of Service) is essentially needed to guarantee the quality of these services. Traditional Internet is Best-Effort service in which all packets are transported in FIFO (First In First Out) style. However, FIFO is not suitable to guarantee the quality of some services, so more research in QoS router and QoS protocol are needed. Researched QoS router and protocol are high cost and inefficient because the existing infra is not used. To solve this problem, a new QoS control method, named Network Adaptive QoS, is introduced and applied to client/server-based streaming systems. Based on network bandwidth monitoring mechanism, network adaptive QoS control method can be used in wire&wireless networks to support QoS in real-time streaming system. In order to reduce application cost, the existing streaming service is used in NAQoS. A new module is integrated into the existing server and client. So the router and network line are not changed. By simulation in heavy traffic network conditions, we proved that stream cannot be seamless without network adaptive QoS method.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.9
• /
• pp.381-392
• /
• 2013

During the last decade, the multitude of advances attained in terminal computers, along with the introduction of mobile hand-held devices, and the deployment of high speed networks have led to a recent surge of interest in Quality of Service (QoS) for video applications. The main difficulty is that mobile devices experience disparate channel conditions, which results in different rates and patterns of packet loss. One way of making more efficient use of network resources in video services over wireless channels with heterogeneous characteristics to heterogeneous types of mobile device is to use a scalable video coding (SVC). An SVC divides a video stream into a base layer and a single or multiple enhancement layers. We have to ensure that the base layer of the video stream is successfully received and decoded by the subscribers, because it provides the basis for the subsequent decoding of the enhancement layer(s). At the same time, a system should be designed so that the enhancement layer(s) can be successfully decoded by as many users as possible, so that the average QoS is as high as possible. To accommodate these characteristics, we propose an efficient transmission scheme which incorporates SVC-aware dual-channel repetition to improve the perceived quality of services. We repeat the base-layer data over two channels, with different characteristics, to exploit transmission diversity. On the other hand, those channels are utilized to increase the data rate of enhancement layer data. This arrangement reduces service disruption under poor channel conditions by protecting the data that is more important to video decoding. Simulations show that our scheme safeguards the important packets and improves perceived video quality at a mobile device.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.406-416
• /
• 2001

Single path routing schemes using dynamic routing metric amy find out the dynamic network status and recompute paths to keep the traffic from the highly loaded regions of the network. This type of routing approach, however, may lead to a routing oscillation, and further, it cannot exploit multi-paths that may frequently exist in the real network. We propose a multipath routing scheme with dynamic load balancing, called MP-DLB, which is capable of reducing the overhead incurred by the multipath routing with dynamic load balancing approach while taking advantage of the high routing performance provided by the approach. According to the analysis of Internet packet traces which show that a high percentage of network traffic is destined for a small number of networks, MP-DLB applies the multipath routing with dynamic load balancing only to a limited subset of all the destinations in the network. For the rest of the destinations, it applies traditional single path routing scheme. This approach may reduce overall routing overheads by limiting the number of destinations to apply the more complicated routing scheme while it can keep the routing performance high by providing efficient routing for the most significant traffic in the routing performance. A series of simulations are done to analyze the performance of MP-DLB. The simulation results show that MP-DLB may effectively cope with the congestion and achieve high routing performance by distributing traffic streams that are generated from varying sources and heading toward a specific hot destination over multi-paths.