• Journal of Korea Multimedia Society
• /
• v.13 no.10
• /
• pp.1494-1505
• /
• 2010

A variety of sounds take place in medium and small-sized manufactories producing many kinds of parts in a small quantity with one press. We developed the identification system for the quality of parts using HTM(Hierarchical Temporal Memory)-based sound recognition. HTM is the theory that the operation principle of human brain's neocortex is applied to computer, suggested by Jeff Hopkins. This theory memorizes temporal and spatial patterns hierarchically about the real world, which is known for its cognitive power superior to the previous recognition technologies in many cases. By applying the HTM model to the sound recognition, we developed the identification system for the quality of molding parts. In order to verify its performance we recorded the various sounds at the moment of producing parts in the real factory, constructed the HTM network of sound, and then identified the quality of parts by repeating learning and training. It reveals that this system gets an excellent and accurate results at the noisy factory.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.149-157
• /
• 2012

In WSN environment, the sensor nodes collect sensed data, and transmit data to the BS. BS is difficult to trust the data from unauthenticated nodes. Therefore, many papers have been proposed about the node authentication and the safety of data. In the AM-E paper, data is delivered after node authentication. In this time, the sensor nodes are directly communicated to BS the AREQ/AREP message for authentication. Therefore, the sensor nodes consume more energy for authentication. Also, noes communicate directly with the BS for authentication will have problem due to the limited energy of nodes. In this paper, the same security with AM-E is supported, Furthermore, to minimize the energy consumption, IDE based hierarchical node authentication protocol is proposed. Compared with AM-E, the number of alive nodes is increased about 39%. Thus, the entire network life time is extended and energy efficiency is improved.

• Journal of Sensor Science and Technology
• /
• v.24 no.1
• /
• pp.41-46
• /
• 2015

In this work, pure hierarchical ZnO structure was prepared using a simple hydrothermal method, and Ag nanoparticles doped hierarchical ZnO structure was synthesized uniformly through photochemical route. The reduced graphene oxide (rGO) has been synthesized by typical Hummer's method and reduced by hydrazine. Prepared Ag/ZnO nanostructures are uniformly dispersed on the surface of rGO sheets using ultrasonication process. The synthesized samples were characterized by SEM, TEM, EDS, XRD and PL spectra. The average size of prepared ZnO microspheres was around $2{\sim}3{\mu}m$ and showed highly uniform. The average size of doped-Ag nanoparticles was 50 nm and decorated into ZnO/rGO network. The $C_2H_2$ gas sensing properties of as-prepared products were investigated using resistivity-type gas sensor. Ag/ZnO-rGO based sensors exhibited good performances for $C_2H_2$ gas in comparison with the Ag/ZnO. The $C_2H_2$ sensor based on Ag/ZnO-rGO had linear response property from 3~1000 ppm of $C_2H_2$ concentration at working temperature of $200^{\circ}C$. The response values with 100 ppm $C_2H_2$ at $200^{\circ}C$ were 22% and 78% for Ag/ZnO and Ag/ZnO-rGO, respectively. In additions, the sensor still shows high sensitivity and quick response/recovery to $C_2H_2$ under high relative humidity conditions. Moreover, the device shows excellent selectivity towards to $C_2H_2$ gas at optimal working temperature of $200^{\circ}C$.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.11-19
• /
• 2011

In this paper, Service Boundary Line approximation method is proposed to improve the accuracy of aggregated link state information for source routing in transport networks that conduct hierarchical QoS routing. The proposed method is especially useful for aggregating links that have both delay and bandwidth as their QoS parameters. This method selects the main path weight in the network and transports the data to the external networks together with the aggregation information, reducing information distortion caused from the loss of some path weight during aggregation process. In this paper, the main path weight is defined as outlier. Service Boundary Line has 2k+5parameters. k is the number of outliers. The number of storage spaces of Service Boundary Line changes according to the number of outliers. Simulation results show that our approximation method requires a storage space that 1.5-2 times larger than those in other known techniques depending on outlier selection method, but its information accuracy of proposed method in the ratio between storage space and information accuracy is higher.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.859-876
• /
• 2010

In this paper, we propose a hierarchical application traffic classification system as an alternative means to overcome the limitations of the port number and payload based methodologies, which are traditionally considered traffic classification methods. The proposed system is a new classification model that hierarchically combines a binary classifier SVM and Support Vector Data Descriptions (SVDDs). The proposed system selects an optimal attribute subset from the bi-directional traffic flows generated by our traffic analysis system (KU-MON) that enables real-time collection and analysis of campus traffic. The system is composed of three layers: The first layer is a binary classifier SVM that performs rapid classification between P2P and non-P2P traffic. The second layer classifies P2P traffic into file-sharing, messenger and TV, based on three SVDDs. The third layer performs specialized classification of all individual application traffic types. Since the proposed system enables both coarse- and fine-grained classification, it can guarantee efficient resource management, such as a stable network environment, seamless bandwidth guarantee and appropriate QoS. Moreover, even when a new application emerges, it can be easily adapted for incremental updating and scaling. Only additional training for the new part of the application traffic is needed instead of retraining the entire system. The performance of the proposed system is validated via experiments which confirm that its recall and precision measures are satisfactory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.504-521
• /
• 2016

Recently, energy harvesting technology has been integrated into wireless sensor networks to ameliorate the nodes' energy limitation problem. In theory, the wireless sensor node equipped with an energy harvesting module can work permanently until hardware failures happen. However, due to the change of power supply, the traditional hierarchical network routing protocol can not be effectively adopted in energy harvesting wireless sensor networks. In this paper, we improve the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol to make it suitable for the energy harvesting wireless sensor networks. Specifically, the cluster heads are selected according to the estimation of nodes' harvested energy and consumed energy. Preference is given to the nodes with high harvested energy while taking the energy consumption rate into account. The utilization of harvested energy is mathematically formulated as a max-min optimization problem which maximizes the minimum energy conservation of each node. We have proved that maximizing the minimum energy conservation is an NP-hard problem theoretically. Thus, a polynomial time algorithm has been proposed to derive the near-optimal performance. Extensive simulation results show that our proposed routing scheme outperforms previous works in terms of energy conservation and balanced distribution.

• Korean Management Science Review
• /
• v.31 no.1
• /
• pp.1-15
• /
• 2014

As the scarcity of natural resources has become apparent, the recycling industry has emerged as a promising one for its growth potential. Yet, the recycling industry still remains undeveloped and inefficient for various reasons. In this study, we focus on firms' recycling processes to understand the current status of recycling firms' value creation activities. With respect to the adopted recycling processes, we empirically investigate the differences in firm characteristics and firm performance. We use the data from Keco (Korea Environment Cooperation) which annually conducts a survey of recycling firms in Korea. We exclusively consider the whole group of plastic recycling industry in order to control for a possible bias in firm performance, stemming from the heterogeneity in processing and recycling of materials other than plastics. We review the descriptive statistics from the sample firms and conduct a series of hierarchical regression analyses. The results show that most of the firms in this industry adopt physical transformation processes with a low-level technology. These firms with physical transformation processes are smaller in size and produce entry level items which do not secure higher margins. The results indicate that the recycling industry largely comprises low value added firms which lack economies of scale and resources for R&D. For the stable growth of the industry, recycling firms must create sustainable values through implementation of technology-driven processes and improvement in product quality. In addition, the government should help build a reliable reverse logistic network, lower the entry barriers, and provide necessary funding for the SMEs in the recycling industry.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.101-108
• /
• 2009

Since the use of wireless communication instruments was standardized, users expect to be provided with seamless information whenever and wherever they use the instruments. Also, some technology is required to satisfy the users' needs which will cover their mobility. To support the mobility of host, the Internet Engineering Task Force (lETF) Mobile IP Working Group proposed a protocol called MIPv6 (Mobile IPv6). But in the case of the existing MIPv6, sometimes Mobile Node cannot receive data packet if Handover occurs although it is a temporal phenomenon. For solving these Handover problems, there are many methods like FMIPv6 (Fast Handover for Mobile IPv6) and HMIPv6 (Hierarchical Mobile IPv6) have been suggested. This paper suggested the use of Dual Buffer of Access Point and an effective way of registration as a way of reducing delayed time caused by Handover. Also, it analyzed and compare the existing MIPv6 with a proposed scheme concerning delayed time of Handover. Finally, the main objective of this paper is to proposed scheme that can reduce the delayed time of Handover compare to the existing MIPv6.

• Journal of Digital Convergence
• /
• v.11 no.7
• /
• pp.185-192
• /
• 2013

The purpose of this study is to set the relationship between each parts that forms the engine of an automobile based on the 3D visualization technology which is able to be learned according to the skill of the operator in the industry field and to recommend the auto parts using a task ontology. A visualization method was proposed by structuring the complex knowledge by signifying the link and the node in forms of a network and using SOM which can be shown in the form of 3 dimension. In addition, by using is-a Relationship-based hierarchical Taxonomy setting the relationship between each of the parts that forms the engine of an automobile, to allow a recommendation using a weighted value possible. By providing and placing the complex knowledge in the 3D space to the user for an opportunity of more realistic and intuitive navigation, when randomly selecting the automobile parts, it allows the recommendation of the parts having a close relationship with the corresponding parts for easy assembly and to know the importance of usage for the automobile parts without any special expertise.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.139-144
• /
• 2007

The mobile terminal's frequent changes to the access point introduce significant network overhead in mobile IP networks. To solve this problem, we introduce a hierarchical structure with consideration given to the dynamic value of neighbor scope in IP regional registration[1]. When a mobile terminal moves within the neighbor given by the scope value, it makes registration locally without registration with its home agent. We analyze the algorithm mathematically and show the numerical results. As a result, optimization of the scope value for the localized registration under the hierarchical structure makes the proposed scheme outperform the standard mobile IP protocol[2]. This can be explained from the fact that there is only local registration for terminal's movement within the scope region. Moreover, as the signaling cost for home agent increases, the proposed scheme becomes more advantageous.