• Journal of Digital Convergence
• /
• v.15 no.2
• /
• pp.327-334
• /
• 2017

For enhancing network efficiency, various applications/services like CDN and P2P try to utilize content which have previously been cached somewhere. Content-centric networking (CCN) also utilizes data caching functionality. However, dislike CDN/P2P, CCN implements such a function on network nodes. Then, any intermediated nodes can directly respond to request messages for cached data. Hence, it is essential which content is cached as well as which nodes cache transmitted content. Basically, CCN propose for every nodes on the path from the content publisher of transmitted object to a requester to cache the object. However, such an approach is inefficient considering the utilization of cached objects as well as the storage overhead of each node. Hence, various caching mechanisms are proposed to enhance the storage efficiency of a node. In this paper, we analyze the performance of such mechanisms and compare the characteristics of such mechanisms. Also, we analyze content utilization patterns and apply such pattern to caching mechanisms to analyze the practicalism of the caching mechanisms.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.869-882
• /
• 2004

This paper proposes an effective method to create logically consistent and structured requirement model by applying consistency control approach of the formal method to the use-case modeling. This method integrates the multi-perspective scattered requirement segments that may overlap and conflict each other into a structured requirement model. The model structure can be analyzed based on context goal and concerned area overlap analysis. The model consistency can be achieved by using specification overlap-based consistency checking method as an integration vehicle. An experimental application to case study shows that the Proposed method can successfully identify requirement overlaps and inconsistency. It can also transfer multi-viewpoint requirement segments into a consistently integrated use-case model to clarify software behaviors and functionality This method helps users to enhance capability to identify specification inconsistency in the use-case modeling at the early stage of software engineering development. The proposed approach can also facilitate communication between users and developers to ensure customer satisfaction.

• Journal of Satellite, Information and Communications
• /
• v.7 no.2
• /
• pp.80-86
• /
• 2012

The software-based satellite simulator has been developed from the start of the project to resolve the restriction and limitation of using hardware-based software development platform. It enables the development of flight software to be performed continuously since initial phase. The satellite simulator emulates the on-board computer, I/O modules, electronics and payloads, and it can be easily adapted and changed on hardware configuration change. It supports the debugging and test facilities for software engineers to develop flight software. Also the flight software can be loaded without any modification and can be executed as faster than real-time. This paper presents the architecture and design of software-based GEO satellite simulator which has hot-standby redundancy mechanism, and flight software development and test under this environment.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.433-440
• /
• 2014

In this study, a method for the low-carbon active distribution system (ADS) planning is proposed. It takes into account the impacts of both network capacity and demand correlation to the renewable energy accommodation, and incorporates demand response (DR) as an available resource in the ADS planning. The problem is formulated as a mixed integer nonlinear programming model, whereby the optimal allocation of renewable energy sources and the design of DR contract (i.e. payment incentives and default penalties) are determined simultaneously, in order to achieve the minimization of total cost and $CO_2$ emissions subjected to the system constraints. The uncertainties that involved are also considered by using the scenario synthesis method with the improved Taguchi's orthogonal array testing for reducing information redundancy. A novel cuckoo search (CS) is applied for the planning optimization. The case study results confirm the effectiveness and superiority of the proposed method.

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.97-105
• /
• 2004

The reason that an intelligent agent cannot understand the representation of its own perception or activity is caused by the traditional syntactic approach that translates a semantic feature into a simulated string, To implement an autonomously learning intelligent agent, Cohen introduces a experimentally semantic approach that the system learns a contentful representation of physical schema from physically interacting with environment using its own sensors and effectors. We propose that negation is a meta-level schema that enables an agent to recognize its own physical schema, To improve the planner's efficiency, Graphplan introduces the control rule that manipulates the inconsistency between planning operators, but it cannot cognitively understand negation and suffers from redundancy problem. By introducing a negative function not, IPP solves the problem, but its approach is still syntactic and is inefficient in terms of time and space. In this paper, we propose that, to represent a negative fact, a positive atom, which is called opposite concept, is a very efficient technique for implementing an cognitive agent, and demonstrate some empirical results supporting the hypothesis.

• Journal of Korean Society for Quality Management
• /
• v.47 no.3
• /
• pp.537-552
• /
• 2019

Purpose: The development of information technology makes it easy to utilize high-dimensional categorical data. In this regard, the purpose of this study is to propose a novel method to select the proper categorical variables in high-dimensional categorical data. Methods: The proposed feature selection method consists of three steps: (1) The first step defines the goodness-to-pick measure. In this paper, a categorical variable is relevant if it has relationships among other variables. According to the above definition of relevant variables, the goodness-to-pick measure calculates the normalized conditional entropy with other variables. (2) The second step finds the relevant feature subset from the original variables set. This step decides whether a variable is relevant or not. (3) The third step eliminates redundancy variables from the relevant feature subset. Results: Our experimental results showed that the proposed feature selection method generally yielded better classification performance than without feature selection in high-dimensional categorical data, especially as the number of irrelevant categorical variables increase. Besides, as the number of irrelevant categorical variables that have imbalanced categorical values is increasing, the difference in accuracy between the proposed method and the existing methods being compared increases. Conclusion: According to experimental results, we confirmed that the proposed method makes it possible to consistently produce high classification accuracy rates in high-dimensional categorical data. Therefore, the proposed method is promising to be used effectively in high-dimensional situation.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.3
• /
• pp.382-391
• /
• 2019

The naval combat system is a distributed system in which various subsystems are integrated and operated together. The integrated management system(IMS) is a software system for systematically and consistently managing the application software which control and operate various devices in such a combat system. Since the malfunction or failure of such an IMS can disable the entire combat system, the IMS is more important than other application software of the combat system. In this paper, we propose a method to guarantee the stable and correct operation of the combat system. To this end, we propose a redundancy scheme composed of one leader and several followers so as to tolerate the failure situation of the IMS. We also propose a leader selection algorithm to select a new leader when the leader fails and can no longer perform its role. To verify the validity of the study, we verify the fault tolerance behavior of the system and the accuracy of the leader selection algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.11
• /
• pp.443-450
• /
• 2018

Crohn's disease, which is recently increasing in Korea, may be seen throughout the gastrointestinal tract and cause various symptoms. In particular, Crohn's disease is especially difficult to diagnose with several symptoms similar to other ulcerative colonic diseases. Thus, some studies are underway to distinguish two or more similar diseases. However, the previous studies have not described the procedural diagnosis process of it, which may lead to over-examination in the process. Therefore, we propose a diagnosis process of Crohn's disease based on the analysis of redundancy, sequential linkage and decision point in the diagnosis of Crohn's disease, so that it enables to identify ulcerative colonic diseases with symptoms similar to Crohn's disease. Finally, we can distinguish the colon diseases that have symptoms similar to Crohn's disease and help diagnose Crohn's disease effectively by defining the proposed process-oriented association as an ontology. Applying the proposed ontology to 5 cases showed that more accurate diagnosis was possible and in one case it could be diagnosed even with fewer tests.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.8
• /
• pp.259-268
• /
• 2022

With prosperous usage of cloud services to improve management efficiency due to the explosive increase in data volume, various cryptographic techniques are being applied in order to preserve data privacy. In spite of the vast computing resources of cloud systems, decrease in storage efficiency caused by redundancy of data outsourced from multiple users acts as a factor that significantly reduces service efficiency. Among several approaches on privacy-preserving data deduplication over encrypted data, in this paper, the research results for improving efficiency of encrypted data deduplication using trusted execution environment (TEE) published in the recent USENIX ATC are analysed in terms of security and efficiency of the participating entities. We present a way to improve the stability of a key-managing server by integrating it with individual clients, resulting in secure deduplication without independent key servers. The experimental results show that the communication efficiency of the proposed approach can be improved by about 30% with the effect of a distributed key server while providing robust security guarantees as the same level of the previous research.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.