• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.222-226
• /
• 1999

이 기종의 다중 시스템 환경에서의 트랜잭션 처리는 전체 참여 노드의 성능을 최대로 이용하기 위해 효과적인 트랜잭션의 분배가 반드시 필요하다. 이를 위해 트랜잭션 처리에 의해 발생하는 다양한 부하들을 참조해야 한다. 본 논문에서는 효율적인 트랜잭션 분배를 위해 분산 로킹 정보인 주사본 권한(PCA) 정보를 이용한다. 주사본 권한 정보를 이용해 트랜잭션 처리 데이터의 참조 지역성을 극대화하고, 이를 통해 캐쉬 효과를 증가시킨다. 즉 각 노드에 저장된 데이터를 자신의 노드와 나머지모드에 분배해 캐싱하고 이를 이용해 디스크 접근을 최소화 한다. 트랜잭션 분배기는 전역적인 캐싱 정보를 관리하고 이를 이용해 전체 노드들이 평균적인 트랜잭션 처리율을 유지할 수 있도록 트랜잭션을 분배한다. 제안된 기법의 검증을 위해 트랜잭션 처리 시스템을 웹 기반 환경에서 시뮬레이션할 수 있도록 Simjava를 이용해 모델을 구상한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.186-187
• /
• 2012

본 논문에서는 기존의 표준 동영상 부호기의 산술적 연산 복잡도 및 대역폭을 낮추기 위하여 양자화된 두 영상에서 움직임을 예측하는 고속 영상 부호화 알고리즘을 제안한다. 기존에 제안된 이진 변환 기반 움직임 예측 알고리즘은 표적 영상과 참조 영상의 각 매크로 블록 단위로 가우시안 양자화를 적용한 뒤, 움직임 예측을 수행하기 때문에 블록 단위의 아티팩트로 인한 탐색 성능 저하를 피할 수 없다. 따라서, 우리는 참조 영상의 탐색 영역에 대해 하나의 양자화기를 적용함으로써 보다 정확한 움직임을 예측한다. 또한, 기존 알고리즘이 하나의 가우시안 양자화기를 적용하는 것과 달리, 제안 알고리즘은 데이터 특성 파악에 따른 다양한 확률 모델을 가정한 뒤 각 모델에 적합한 최적의 양자화기를 적용함으로써 블록 매칭 오류를 낮춘다. 실험 결과를 통해 제안 알고리즘이 기존의 이진 변환 기반 움직임 예측 알고리즘에 비해 보다 정확한 움직임 벡터를 예측함을 보인다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.11
• /
• pp.281-288
• /
• 2018

The block chain, which is characterized by a distributed ledger that stores the same data in several places, has various technical features including security and stability. Due to these characteristics, various researches are being conducted on the application of the block chain. In this paper, we consider the issues to be considered for applying the block chain to the Korea Real Estate Administration Intelligence System (KRAS). Based on this, we propose a block chain reference model for KRAS including a system configuration method and a consensus algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.600-601
• /
• 2021

The cyberspace, which is the fifth battle field, should be utilized for multi-domain maneuvering between the cyberspace and the physical space using an electromagnetic spectrum. This becomes a major concept of cyber electronic warfare that combines the characteristics of cyber warfare and electronic warfare. In this study, the concept of cyber electronic warfare is analyzed by using the OSI reference model and examining the threats of the two-layer data link layer.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.165-175
• /
• 2013

Though the number of food franchises has been increased these days, there has not been less success for food franchise than failure. One of the several failures is the distrust between franchisor and franchisee factors because the franchisee thought its franchisor does not make its accounts and operations transparent. In order to resolve it, the large business food franchise has used the ERP system, however, small business franchise has run a very simple information system, which is linked to POS system and consists of simple functions to insert or inquire the result of data on sales and order etc to identify the status of both franchisor and franchisee because of financial difficulties and manpower shortage. Thus, small business franchise needs the cost management between them with low cost for efficient business administration. In this study, we suggest the data reference model (DRM) which covers the cost management system and is able to be linked to any POS system. The DRM is a framework whose primary purpose is to enable information linking and reuse across the any POS-based information systems via the classification, structure, model, exchange and management of data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.398-405
• /
• 2006

We propose a pattern classification model using a selective perception ability of human beings. Generally, human beings recognize an object by putting a selective concentration on it in the region of interest. Much better classification and recognition could be possible by adapting this phenomenon in pattern classification. First, the pattern classification model creates some reference cluster patterns in a usual way. Then it generates an SPM(Selective Perception Map) that reflects the mutual relation of the reference cluster patterns. In the recognition phase, the model applies the SPM as a weight for calculating the distance between an input pattern and the reference patterns. Our experiments show that the proposed classifier with the SPM acquired the better results than other approaches in pattern classification.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.948-955
• /
• 2008

Recently, as the dissemination of the Internet and development of computer network technology, Research is actively underway for realization of the next-generation computing paradigm called Ubiquitous Computing. For realization of Ubiquitous computing, The data recognized from each sensors must be collected on real-time and transferred to applied service so that they may be used as data for providing service to users. However, there are several problem for realization. First, there is no standardization of sensor metadata, interface and event definition. Second, applied service has weak point that difficult of approaching to the data. Third, none interoperability with each platform and protocol. In this paper, we designed Sensor Service Description Language based on XML to resolve problem above. This Language expresses the measurement of the sensor and Service Metadata in the form to be standardized. In addition, we have proposed and development a reference model for USN application service.

• Journal of Korean Library and Information Science Society
• /
• v.48 no.4
• /
• pp.129-151
• /
• 2017

Information modeling that is broadly applied in digital archiving process privides conceptual process that can be used to guide the creation of descriptions for the objects of preservation. However, it has faced with the limitations on substantially applying to the creation of preservation metadata records. This research proposes the concept of Resource Cluster in order to address these problems and efficiently describe the objects of preservation during digital archiving process. It also constructed Preservation Description Framework (PDF) based on RDF in order to substantially manifest preservation descriptions. This framework combines the structure of OAIS Reference Model and Functional Requirements for Bibliographic Records (FRBR) and can be an alternative approach to the creation of preservation metadata in more efficient and effective ways.

• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.115-124
• /
• 2006

XML is rapidly becoming technologies for information exchange and representation. It causes many research issues such as semantic modeling methods, security, conversion far interoperability with other models, and so on. Especially, the most important issue for its practical application is how to achieve the interoperability between XML model and relational model. Until now, many suggestions have been proposed to achieve it. However several problems still remain. Most of all, the exiting methods do not consider implicit referential integrity relations, and it causes incorrect data delivery. One method to do this has been proposed with the restriction where one semantic is defined as only one same name in a given database. In real database world, this restriction cannot provide the application and extensibility. This paper proposes a noble conversion (RDB-to-XML) algorithm based on the similarity checking technique. The key point of our method is how to find implicit referential integrity relations between different field names presenting one same semantic. To resolve it, we define an enhanced implicity referentiai integrity relations extraction algorithm based on a widely used ontology, WordNet. The proposed conversion algorithm is more practical than the previous-similar approach.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1345-1352
• /
• 2010

The structural approach in the signature verification, representing a signature as a structural form of local primitives, shows an excellent performance since it counts in the local characteristics such as local variation, stroke complexity, and etc. However, this method has a problem of template data sizing which can not fix the number of subpatterns comprising a signature. In this paper, we proposed a new algorithm to reduce the signature data into a fixed size by selecting a fixed number of subpatterns which is considered as important parts. As a result, it shows more excellent performance when the fixed sized sub-patterns is applied with local weights extracted from variational characteristics and complexities in local part. And the number of subpatterns representing a signature reference model can be fixed under a certain number of segments determined appropriately.