• Journal of Korean Society for Atmospheric Environment
• /
• v.30 no.5
• /
• pp.504-509
• /
• 2014

Twenty-five stations of the urban monitoring network in Seoul were assessed with a focus on surveillance function of the exceedances of 8-hour ozone and 24-hour $PM_{10}$ standards. The two standards were selected because their attainment rates were particularly low. Two hierarchical cluster analyses were performed to group stations with similar atmospheric environments-one using daily highest 8-hour [$O_3+NO_2$], 8-hour $O_3$ concentrations plus corresponding 8-hour $NO_2$ concentrations considering the interconversion of $O_3$ and $NO_2$, and the other using 24-hour $PM_{10}$ concentrations. An index to measure higher concentration and exceedances of the standards was introduced. Within a cluster, sufficiently high score was assigned to the trends station or the station with higher index. Scores for $O_3+NO_2$ and $PM_{10}$ of a given station were added and ranked in the descending order to determine the relative importance.

• Journal of KIISE:Software and Applications
• /
• v.33 no.10
• /
• pp.877-885
• /
• 2006

Recently it is proposed that the Bayesian networks used as conversational agent for topic inference is useful but the Bayesian networks require much time to model, and the Bayesian networks also have to be modified when the scripts, the database for conversation, are added or modified and this hinders the scalability of the agent. This paper presents a method to improve the scalability of the agent by constructing the Bayesian network from scripts automatically. The proposed method is to model the structure of Bayesian networks hierarchically and to utilize Noisy-OR gate to form the conditional probability distribution table (CPT). Experimental results with ten subjects confirm the usefulness of the proposed method.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.13 no.1
• /
• pp.69-76
• /
• 1999

This paper proposed a design of intelligent supervisory control systems for maintenance of highway traffic information equiprrent and processing algorithm of equiprrent fault data. The fault data of highway traffic equipment are transmitted from rerrnte supervisory controller to central supervisory system by real time, the transmitted fault data are anaIyzed the characteristic using evaluation algorithm of fault data in central supervisory system. The evaluation algorithm includes a neural network and fault knowlOOge-base for processing the multi-generated fault data. For validating the evaluation algorithm of intelligent supervisory control systems, the rrethod of analysis used to the five pattern of binary signal by transmitted real time and the opTclting user-interface constructed in central supervisory system.

• Journal of Information Technology Services
• /
• v.9 no.3
• /
• pp.95-106
• /
• 2010

Many researches have been performed to increase energy-efficiency in wireless sensor networks. One of primary research topics is about clustering protocols, which are adopted to configure sensor networks in the form of hierarchical structures by grouping sensor nodes into a cluster. However, legacy clustering protocols do not propose detailed methods from the perspective of implementation to determine a cluster's boundary and configure a cluster, and to communicate among clusters. Moreover, many of them involve assumptions inappropriate to apply those to a sensor field. In this paper, we have designed and implemented a new T-Clustering (Top-down Clustering) protocol, which takes into considerations a node's density, a distance between cluster heads, and remained energy of a node all together. Our proposal is a sink-node oriented top-down clustering protocol, and can form uniform clusters throughout the network. Further, it provides re-clustering functions according to the state of a network. In order to verify our protocol's feasibility, we have implemented and experimented T-Clustering protocol on Crossbow's MICAz nodes which are executed on TinyOS 2.0.2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.253-259
• /
• 2008

Because a sensor node in wireless sensor networks is battery operated and energy constrained, reducing energy consumption of each node is one of important issues. The clustering technique can make network topology be hierarchical and reduce energy consumption of each sensor node. In this paper, we propose an efficient clustering mechanism considering overlap avoidance in wireless sensor networks. The proposed method consists of three parts. The first is to elect cluster heads considering each node's energy. Then clusters are formed by using signal strength in the second phase. Finally we can reduce the cluster overlap problem derived from two or more clusters. In addition, this paper includes performance evaluation of our algorithm. Simulation results show that network lifetime was extended up to 75 percents than LEACH and overlapped clusters are decreased down to nearly zero percents.

• The Journal of Information Systems
• /
• v.28 no.1
• /
• pp.73-96
• /
• 2019

Purpose The purpose of this study is to examine the effect of communication-structure characteristics on performance in online collaboration using the data from Github, one of representative open source software development platforms. We analyze the impact of in-degree/out-degree centralization and reciprocity of communication network on collaboration performance in each project. In addition, we investigate the moderating effect of owner types, an individual developer or an organization. Design/methodology/approach We collect the data of 838 Github projects, and conduct social network analysis for measuring in-degree/out-degree centralization and reciprocity as independent variables. With these variables, hierarchical regression analysis is employed on the relationship between the characteristics of communication structure and collaborative performance. Findings Our results show that for the project owned by an organization, the centralized structure of communication is not associated with the collaboration performance. In addition, the reciprocity is positively related to the collaboration performance. On the other hand, for the project owned by an individual developer, the centralized structure of communication is positively related to the performance, and the reciprocity does not show the positive relationship on the performance.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.17-32
• /
• 2023

Centralized hierarchical routing protocols are often used to solve the problems of uneven energy consumption and short network life in wireless sensor networks (WSNs). Clustering and cluster head election have become the focuses of WSNs. In this paper, an energy balanced clustering routing algorithm optimized by sine cosine algorithm (SCA) is proposed. Firstly, optimal cluster head number per round is determined according to surviving node, and the candidate cluster head set is formed by selecting high-energy node. Secondly, a random population with a certain scale is constructed to represent a group of cluster head selection scheme, and fitness function is designed according to inter-cluster distance. Thirdly, the SCA algorithm is improved by using monotone decreasing convex function, and then a certain number of iterations are carried out to select a group of individuals with the minimum fitness function value. From simulation experiments, the process from the first death node to 80% only needs about 30 rounds. This improved algorithm balances the energy consumption among nodes and avoids premature death of some nodes. And it greatly improves the energy utilization and extends the effective life of the whole network.

• Journal of KIISE:Information Networking
• /
• v.37 no.3
• /
• pp.167-174
• /
• 2010

Recently the distributed topology control algorithm for constructing the Recrystallization Topology in the unstructured peer-to-peer network was proposed. In this paper, we prove that such a hierarchical topology is a scale-free power-law network. We present a model of a construction process of the distributed protocol, and analyze it based on a mean-field approximation and the continuum theory, so that we show that the constructed Recrystallization Topology is a scale-free network. In the proposed model, all nodes are born with some initial attractiveness and the system incorporates the rewiring of some links at every time step. Some old links are removed with the anti-preferential probability, and some new links are added with preferential probability. In other words, according to the distributed algorithm, each node makes connections to the more-preferential nodes having higher hit-ratio than other nodes, while it disconnects the anti-preferential nodes having lesser hit-ratio. This gives a realistic description of the local processes forming the recrystallization topology in unstructured peer-to-peer network. We calculate analytically the degree distribution. The analytic result indicates that the constructed network is a scale-free network, of which the scaling exponent is 3.

• The Journal of the Korea Contents Association
• /
• v.17 no.2
• /
• pp.543-554
• /
• 2017

We tried to get useful information from social network analysis on the transaction network for the companies in Busan, Ulsan, Kyong-nam region using more than 80 thousand company transaction data obtained from Korean enterprise data (KED). We found that there are 282 clusters having more than 3 companies when we made clusters composed of the companies having the transactions with each other as the first transaction partners in the region. Most of clusters have a major big company with most of sales in the clusters and have the member companies without the transaction with other cluster's member companies so that they have closed and hierarchical transaction pattern. Analysing the transaction network using the network index, we know that there are small medium size companies playing the central role in the regional transaction network and a few clusters have many transactions with other clusters. Also we found that there are very rare sale transactions to the companies outside the region and many purchasing transactions from the companies outside the region. Policy makers need to try to diversify the transaction patterns and to use the exceptional companies and clusters as the levers.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.820-829
• /
• 2006

Wireless sensor networks consisting of hundreds to thousands of nodes are expected to be increasingly deployed in coming years, as they enable reliable monitoring and analysis of physical worlds. These networks have unique features that are very different from traditional networks, e.g., the numerous numbers of nodes, limitation in power, processing, and memory. Due to these unique features of wireless sensor networks, sensor data management including querying becomes a challenging problem. Furthermore, due to wide popularization of the Internet and its facility in use, it is generally accepted that an unattended network can be efficiently managed and monitored over the Internet. In particular, in order to more efficiently query and manage data in a sensor network. in this paper, the architecture of a sensor gateway including web-based query server is presented and its implementation detail is illustrated. The presented web-based gateway is largely divided into two important parts: Internet part and sensor network part. The sensor network part plays an important role of handling a variety of sensor networks, including flat or hierarchical network architecture, by using internally layered architecture for efficiently querying and managing data in a sensor network. In addition, the Internet part provides a modular gateway function for favorable exchange between the sensor network and Internet.