• Journal of the Korea Society of Computer and Information
• /
• v.21 no.10
• /
• pp.107-114
• /
• 2016

In this paper, we propose the building method for the unified IoT service platform between the variety of legacy systems with the heterogeneous structures and the operating environments. To accommodate the structural diversity of legacy systems, we develop a virtual integrated structure and interface abstracting method. By this, the new platform can use the data sources of the legacy systems as if the data source is in the new platform. In a manner without modification of the legacy systems with performing minimum tasks, we proposes a model that can be integrated without affecting the availabilities of the legacy systems.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.79-86
• /
• 2009

The tuple of constraint database consists of constraint logical formula and it could process the presentation and query of the constraint database simply. Query operation processing shall include the constraint formula between related tuple such as selection, union, intersection of spatial data through the constraint database. However, this could produce the increasing of duplicated or unnecessary data. Hence, it will drive up the cost as per quality. This paper identified problems regarding query processing result in the constraint database. Also this paper suggested the tuple minimization summary method for result relation and analyzed the effects for efficient query processing. We were able to identify that the effectiveness of the query processing was enhanced by eliminating unnecessary constraint formula of constraint relation using the tuple minimization method.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.441-447
• /
• 2001

The problem of query rewriting using views has interested in the context of data integration where source data is described by the views on global relations. When the query and views are of the form of conjunctive queries, the rewriting is a union of conjunctive queries each of which is contained in the original query and consists of only views. Most previous methods for query rewriting using views are 2-step algorithms. In the first step, they identify the views that are useful in rewriting and in the second step they construct all correct rewritings by combining the views that gained in the first step. The larger the number of selected views in the first step, the larger the number of candidate rewritings in the second step. We want to minimize the number of selected views in the first step by defining stringent conditions for a view to be participated in rewritings. In this paper, first we offer a necessary condition for the existence of a rewriting that includes a view. For the common case that predicate repetitions are not allowed in the bodies of views, we show that our algorithm for testing the condition is done in a polynomial-time. Second, we offer an algorithm to construct contained rewritings using the view instances that are computed in the first step. The exponential containment-mapping test in the second step is not needed in our algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2576-2590
• /
• 2020

The fundamental reason why most SQL injection detection methods are difficult to use in practice is the low reusability of the implementation code. This paper presents a reusable SQL injection detection method for Java Web applications based on AOP (Aspect-Oriented Programming) and dynamic taint analysis, which encapsulates the dynamic taint analysis processes into different aspects and establishes aspect library to realize the large-grained reuse of the code for detecting SQL injection attacks. A metamodel of aspect library is proposed, and a management tool for the aspect library is implemented. Experiments show that this method can effectively detect 7 known types of SQL injection attack such as tautologies, logically incorrect queries, union query, piggy-backed queries, stored procedures, inference query, alternate encodings and so on, and support the large-grained reuse of the code for detecting SQL injection attacks.

• The Korean Journal of Pain
• /
• v.34 no.3
• /
• pp.271-287
• /
• 2021

Background: Postoperative pain management is crucial for patients undergoing total knee arthroplasty (TKA). There have been many recent clinical trials on post-TKA peripheral nerve block; however, they have reported inconsistent findings. In this meta-analysis, we aimed to comprehensively analyze studies on post-TKA analgesia to provide evidence-based clinical suggestions. Methods: We performed a computer-based query of PubMed, Embase, the Cochrane Library, and the Web of Science to retrieve related articles using neurothe following search terms: nerve block, nerve blockade, chemodenervation, chemical neurolysis, peridural block, epidural anesthesia, extradural anesthesia, total knee arthroplasty, total knee replacement, partial knee replacement, and others. After quality evaluation and data extraction, we analyzed the complications, visual analogue scale (VAS) score, patient satisfaction, perioperative opioid dosage, and rehabilitation indices. Evidence was rated using the Grading of Recommendations Assessment, Development, and Evaluation approach. Results: We included 16 randomized controlled trials involving 981 patients (511 receiving peripheral nerve block and 470 receiving epidural block) in the final analysis. Compared with an epidural block, a peripheral nerve block significantly reduced complications. There were no significant between-group differences in the postoperative VAS score, patient satisfaction, perioperative opioid dosage, and rehabilitation indices. Conclusions: Our findings demonstrate that the peripheral nerve block is superior to the epidural block in reducing complications without compromising the analgesic effect and patient satisfaction. Therefore, a peripheral nerve block is a safe and effective postoperative analgesic method with encouraging clinical prospects.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.127-129
• /
• 2003

최근 GPS기능을 탑재한 휴대폰ㆍPDA등의 모바일 장치를 사용하여 위치 기반 서비스 (LBS : Location Based Service)를 이용하는 사용자가 급증하고 있다. 이에 대용량의 공간 데이터베이스에 대해 효율적 검색을 가능하게 하기 위한 색인이 필요하다. 공간 데이터베이스를 위한 다차원 공간 색인 기법으로는 R-Tree가 널리 사용되고 있다. 기존의 R-Tree를 이용한 검색은 질의 영역과 관계없는 공간 데이터까지 검색하는 고비용의 연산이 요구되며, 사용자의 질의 위치 단위(Granularity)를 고려하지 않아 사용자의 빠른 검색 응답시간 및 질의 영역에 대한 정확한 공간 객체 검색에 대해 충족하지 못한다. 이에 본 논문에서는 임의의 셀 안에 존재하는 공간 데이터가 자신이 속한 노드의 전체 MBR(Union MBR)영역과 셀 영역에 따라 셀 레벨 값을 구성하는 CLR-Tree(Cell Leveling R-Tree)를 제안한다. CLR-Tree를 사용할 경우 사용자의 질의 영역 셀 레벨 값과 데이터베이스에 저장된 공간 데이터의 셀 레벨 값을 비교한 뒤 겹침 연산 대상이 되는 공간 객체 수를 줄임으로써 검색 시간을 향상시킬 수 있다.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.23-37
• /
• 2004

Location Based Services(LBSs) in mobile environments become very popular recently. For efficient LBSs, spatial database management systems must need a spatial indexing scheme such as R-trees in order to manage the huge spatial database. However, it may need unnecessary disk accesses since it needs to access objects which are not actually concerned to user's location-based queries. In this paper, to support the location-based queries efficiently, we propose a CLR-tree(Cell Leveling R-tree) in which a dynamic cell is built up within the minimum bounding rectangle of R-trees' node. The cell level of nodes is compared with the query's cell level in location-based query processing and determines the minimum search space. Also, we propose the insertion, split, deletion, and search algorithms for CRL-trees. From the experimental results, we see that a CLR-tree is able to decrease $5{\sim}20%$ of disk accesses from those of R-trees. So, a CLR-tree can be used for fast accessing spatial objects to user's location-based queries in LBSs.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1519-1533
• /
• 2004

When Web-based special retrieval systems for scientific field extremely restrict the expression of user's information request, the process of the information content analysis and that of the information acquisition become inconsistent. In this paper, we apply the fuzzy retrieval model to solve the high time complexity of the retrieval system by constructing a reduced term set for the term's relatively importance degree. Furthermore, we perform a cluster retrieval to reflect the user's Query exactly through the similarity relation matrix satisfying the characteristics of the fuzzy compatibility relation. We have proven the performance of a proposed re-ranking model based on the similarity union of the fuzzy retrieval model and the document cluster retrieval model.