• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.77-83
• /
• 2010

Recently, IT-based environment is changing rapidly as changing in web services platform, evolution of cloud computing environments and expanding the base of a smart market. Accordingly, monitoring development of environment is changing quickly. So a customizable SaaS-based monitoring tool is required to provide monitoring services. It has to support a variety of environmental monitoring and a resource managers with requested information, and by an enhanced monitoring framework in clouding environment of management system. In this paper, the 3D viewer for the management of sensor node management system was designed and built. Through the 3D viewer by enhancing the accessibility and visibility, the sensor network will allow resources to be used efficiently.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.5
• /
• pp.231-242
• /
• 2016

In order to meet rapid changes of Web information, it is necessary to extend the current Web technologies to represent both the valid time and location of each fact and knowledge, and reason their relationships. Until recently, many researches on qualitative temporal reasoning have been conducted in laboratory-scale, dealing with small knowledge bases. However, in this paper, we propose the design and implementation of a parallel qualitative temporal reasoner, MRQUTER, which can make reasoning over Web-scale large knowledge bases. This parallel temporal reasoner was built on a Hadoop cluster system using the MapReduce parallel programming framework. It decomposes the entire qualitative temporal reasoning process into several MapReduce jobs such as the encoding and decoding job, the inverse and equal reasoning job, the transitive reasoning job, the refining job, and applies some optimization techniques into each component reasoning job implemented with a pair of Map and Reduce functions. Through experiments using large benchmarking temporal knowledge bases, MRQUTER shows high reasoning performance and scalability.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.15-20
• /
• 2009

Much amount of data which demand fuzzy information system requires various analysis through the fuzzy set visualization. Therefore, this study proposes how to visualize fuzzy data set using variation of Venn diagram. For the fuzzy data which are related to many topics and have ranking of relation, this way gives results that users want by visualizing intersection, union and complementary set. That is, it visualizes the set of fuzzy data which have many topics at once, or the set of all fuzzy data which has topics, or the set of fuzzy data not related to a topic. Users control these sets by overlapping or piling them; visualized with Venn diagram, which is user-oriented. One distinct advantage of this visualization is the fact that it delivers web documents which users of search engine and web developers want much quickly. Furthermore, its possibility can be expanded to several purposes by using for information retrieval.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.717-721
• /
• 2005

With HTTP/1.0, a single request means a single HTTP connection so that the granular unit of dispatching is the same as real load. But with persistent HTTP connection, multiple requests may arrive on a single TCP connection. Therefore, a scheme that dispatches load at the granularity of individual requests constrains the feasible dispatching policies In this paper we propose a new connection dispatching polity for supporting HTTP/1.1 persistent connections in cluster-based Web servers. When the request of a base html file arrives, the dispatcher gets the subsequent load arriving on that connection using the embedded objects information. After the dispatcher stores the load information in Load Table, the dispatcher employs the connection aging strategy on live persistent connections on the passage of time. The results of simulation show about $1.7\%\~16.8\%$ improved average response time compared to existing WLC algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1524-1531
• /
• 2004

This study analyzes a load balancing technique using Round Robin Algorithm. The study uses two software packages (Packet Capture and Round Robin Test Package) to check packet volume from Virtual Network structure (data generator, virtual server, Server1,2,3), and finds out traffic distribution toward Server1,2 and 3. The functions of implemented Round Robin Load Balancing Monitoring System include round robin testing, system monitoring, and graphical indication of data transmission and packet volume. As the result of the study shows, Round Robin Algorithm allows servers to ensure definite traffic distribution, unless incoming data loads differ much. Although error levels are high in some cases, they were eventually alleviated by repeated tests for a long period of time.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.41-53
• /
• 2001

Multi-distributed web cluster model built for high availability E-Business model exposes internal system nodes on its structural characteristics and has a potential that normal job performance is impossible due to the intentional prevention and attack by an illegal third party. Therefore, the security system which protects the structured system nodes and can correspond to the outflow of information from illegal users and unfair service requirements effectively is needed. Therefore the suggested distributed invasion detection system is the technology which detects the illegal requirement or resource access of system node distributed on open network through organic control between SC-Agents based on the shared memory of SC-Server. Distributed invasion detection system performs the examination of job requirement packet using Detection Agent primarily for detecting illegal invasion, observes the job process through monitoring agent when job is progressed and then judges the invasion through close cooperative works with other system nodes when there is access or demand of resource not permitted.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.6
• /
• pp.237-247
• /
• 2008

A virtual screening is the process of reducing an unmanageable number of compounds to a limited number of compounds for the target of interest by means of computational techniques such as molecular docking. And it is one of a large-scale scientific application that requires large computing power and data storage capability. Previous applications or softwares for molecular docking such as AutoDock, FlexX, Glide, DOCK, LigandFit, ViSION were developed to be run on a supercomputer, a workstation, or a cluster-computer. However the virtual screening using a supercomputer has a problem that a supercomputer is very expensive and the virtual screening using a workstation or a cluster-computer requires a long execution time. Thus we propose a service-based virtual screening system using Grid computing technology which supports a large data intensive operation. We constructed 3-dimensional chemical molecular database for virtual screening. And we designed a resource broker and a data broker for supporting efficient molecular docking service and proposed various services for virtual screening. We implemented service based virtual screening system with DOCK 5.0 and Globus 3.2 toolkit. Our system can reduce a timeline and cost of drug or new material design.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1519-1522
• /
• 2003

기존의 웹 문서나 컨텐츠들의 표현적 한계를 극복하기 위한 방안으로 메타 데이터에 관한 다양한 연구가 수행되어졌고 그 결과의 산물중에 가장 대표적인 것으로 XML을 들 수 있다. XML은 문서의 내용뿐 아니라 구조까지도 기술할 수 있는 장점을 통해 향후 정보 교환에 핵심적인 역할을 할 것으로 기대되어지고 있으며 이에 따라 XML 문서를 효율적으로 저장하고 검색하기 위한 다양한 연구가 진행되고 있다. BitCube는 Bit-wise 연산이 가능한 3차원 비트맵 인덱싱을 사용하여 XML 문서들의 구조적 유사성에 따라 클러스터링하고 사용자의 질의에 대한 처리를 수행하는 인덱싱 기법으로 그것의 빠른 성능을 입증하였다. 그러나 BitCube의 클러스터링은 XML 문서의 경로에 중점을 둔 것이므로 클러스터와 경로가 담고 있는 실제 단어들간에는 연관성이 없으므로 3차원 비트맵 인덱스는 하나의 평면을 제외한 모든 평면이 굉장히 높은 공간 사용량을 갖는 회소행렬이 된다. 본 논문에서는 늘어나는 방대한 문서의 양으로 인한 시스템의 성능 저하를 막고 안정적인 성능을 유지할 수 있도록 기존 연산의 성능을 저하시키지 않으면서 공간을 최소화 할 수 있는 연결 리스트틀 설계하고 3차원 비트맵 인덱스를 연결 리스트로 재구성하는 방법을 제시한다.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2007.11a
• /
• pp.892-898
• /
• 2007

This study aims to implement an efficient process management system for small and medium sized(local) construction companies and a performance management system for the Korean construction industry. The process management system by Lean Construction is Web 2.0 platform-based and creates clusters with numerous general contractors and sub-contractors, which will enable mutually organic process management. Plus, this system will enable them to compare project performance management by analyzing it during or after a project by collecting and accumulating lots of data occurring in pursuit of a project. These performance management cases will be of help in process planning during similar upcoming projects. This study is expected to somewhat reduce the burden of implementing a complicated process management protocol and system that Korean small and medium sized (local) construction companies experience with their web-based process management, and is supposed to realize accurate performance management with highly reliable data which are significantly accumulated within the database.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.87-103
• /
• 2009

Grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because Grid middleware does not have common sharable information system. In order to use Grid computing environment efficiently which consists of various Grid middlewares, it is necessary to have application-independent information system which can share information description and services, and expand them easily. Thus, in this paper, we propose a semantic information system framework based on web services and ontology for Grid computing environment, called WebSIS. It makes application and middleware developer easy to build sharable and extensible information system which is easy to share information description and can provide ontology based platform-independent information services. We present efficient ontology based information system architecture through WebSIS. Discovering appropriate resource for task execution on Grid needs more high-level information processing because Grid computing environment is more complex than other traditional distributed computing environments and has various considerations which are needed for Grid task execution. Thus, we design and implement resource information system and services by using WebSIS which enables high-level information processing by ontology reasoning and semantic-matching, for automation of task execution on Grid.