• Title/Summary/Keyword: Distributed Computing.

Search Result 1,279, Processing Time 0.028 seconds

Distributed Assumption-Based Truth Maintenance System for Scalable Reasoning (대용량 추론을 위한 분산환경에서의 가정기반진리관리시스템)

  • Jagvaral, Batselem;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.43 no.10
    • /
    • pp.1115-1123
    • /
    • 2016
  • Assumption-based truth maintenance system (ATMS) is a tool that maintains the reasoning process of inference engine. It also supports non-monotonic reasoning based on dependency-directed backtracking. Bookkeeping all the reasoning processes allows it to quickly check and retract beliefs and efficiently provide solutions for problems with large search space. However, the amount of data has been exponentially grown recently, making it impossible to use a single machine for solving large-scale problems. The maintaining process for solving such problems can lead to high computation cost due to large memory overhead. To overcome this drawback, this paper presents an approach towards incrementally maintaining the reasoning process of inference engine on cluster using Spark. It maintains data dependencies such as assumption, label, environment and justification on a cluster of machines in parallel and efficiently updates changes in a large amount of inferred datasets. We deployed the proposed ATMS on a cluster with 5 machines, conducted OWL/RDFS reasoning over University benchmark data (LUBM) and evaluated our system in terms of its performance and functionalities such as assertion, explanation and retraction. In our experiments, the proposed system performed the operations in a reasonably short period of time for over 80GB inferred LUBM2000 dataset.

A Dynamic Reorganization Method using the Hierarchical Structure in the Grid Database (그리드 데이터베이스에서 계층 구조를 이용한 동적 재조직 기법)

  • Cheon, Jong-Hyeon;Jang, Yong-Il;Cho, Sook-Kyoung;Lee, Soon-Jo;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.1 s.16
    • /
    • pp.93-106
    • /
    • 2006
  • A Grid Database is a database management system to process effectively and use the distributed data in a grid computing environment. Spatial data is more important than other general data according to the local characteristics and requires a large storage. The grid database can be used as the optimal system for the management of the spatial data. However, contrary to the conventional distributed database systems, the Grid Database which guarantees the local autonomy has a possibility not to provide an effective system, or it is impossible to use a centralized management environment. In order to allow flexible responses to a dynamically changing environment, it is required to use effectively reorganized method. In this paper, hierarchical reorganization method is presented for dynamic reorganization in a grid database. When the reorganization is conducted, an organizer is created to collect the information of databases. In addition, the organizer which is constructed by the hierarchical structure supports information communication and reorganization, and then it allows the support of regional reorganization operation and effective balance control. The performance assessment of the proposed method shows that the processing capacity is increased after the reorganization.

  • PDF

A Spatial Split Method for Processing of Region Monitoring Queries (영역 모니터링 질의 처리를 위한 공간 분할 기법)

  • Chung, Jaewoo;Jung, HaRim;Kim, Ung-Mo
    • Journal of Internet Computing and Services
    • /
    • v.19 no.1
    • /
    • pp.67-76
    • /
    • 2018
  • This paper addresses the problem of efficient processing of region monitoring queries. The centralized methods used for existing region monitoring query processing assumes that the mobile object periodically sends location-updates to the server and the server continues to update the query results. However, a large amount of location updates seriously degrade the system performance. Recently, some distributed methods have been proposed for region monitoring query processing. In the distributed methods, the server allocates to all objects i) a resident domain that is a subspace of the workspace, and ii) a number of nearby query regions. All moving objects send location updates to the server only when they leave the resident domain or cross the boundary of the query region. In order to allocate the resident domain to the moving object along with the nearby query region, we use a query index structure that is constructed by splitting the workspace recursively into equal halves. However, However, the above index structure causes unnecessary division, resulting in deterioration of system performance. In this paper, we propose an adaptive split method to reduce unnecessary splitting. The workspace splitting is dynamically allocated i) considering the spatial relationship between the query region and the resultant subspace, and ii) the distribution of the query region. We proposed an enhanced QR-tree with a new splitting method. Through a set of simulations, we verify the efficiency of the proposed split methods.

An Efficient BotNet Detection Scheme Exploiting Word2Vec and Accelerated Hierarchical Density-based Clustering (Word2Vec과 가속화 계층적 밀집도 기반 클러스터링을 활용한 효율적 봇넷 탐지 기법)

  • Lee, Taeil;Kim, Kwanhyun;Lee, Jihyun;Lee, Suchul
    • Journal of Internet Computing and Services
    • /
    • v.20 no.6
    • /
    • pp.11-20
    • /
    • 2019
  • Numerous enterprises, organizations and individual users are exposed to large DDoS (Distributed Denial of Service) attacks. DDoS attacks are performed through a BotNet, which is composed of a number of computers infected with a malware, e.g., zombie PCs and a special computer that controls the zombie PCs within a hierarchical chain of a command system. In order to detect a malware, a malware detection software or a vaccine program must identify the malware signature through an in-depth analysis, and these signatures need to be updated in priori. This is time consuming and costly. In this paper, we propose a botnet detection scheme that does not require a periodic signature update using an artificial neural network model. The proposed scheme exploits Word2Vec and accelerated hierarchical density-based clustering. Botnet detection performance of the proposed method was evaluated using the CTU-13 dataset. The experimental result shows that the detection rate is 99.9%, which outperforms the conventional method.

Location Tracking and Remote Monitoring system of Home residents using ON/OFF Switches and Sensors (ON/OFF 스위치와 센서를 이용한 홈 거주자의 위치추적 및 원격모니터링 시스템)

  • Ahn Dong-In;Kim Myung-Hee;Joo Su-Chong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.1
    • /
    • pp.66-77
    • /
    • 2006
  • In this paper, we researched the searching and tracking locations of a home resident using ON/OFF switches and sensors and designed a remote monitoring system. As an implementation environment, this system is developed on the base of the distributed object group framework we have developed from previous works. In order to trace the moving locations of a home resident, we firstly showed a home structure which attaches ON/OFF switches and sensors to home appliances and indoor facilities being fixed in home. Whenever a home resident opens/closes these objects, the signals operated from ON/OFF switches and sensors are sent to a home server system. In this time, the real locations of ON/OFF switches and sensors that the signals are being occurred must be the current location that he/she stays. A home server system provides the functionalities that map the real location of a resident in home to virtual location designed on remote desk-tops or terminals like PDAs, and that construct a healthcare database consisted of moving patterns, moving ranges, momentum for analyzing the given searching locations and times Finally, this system provides these information for remotely monitoring services.

Design and Implementation of Automatic Linking Support System for Efficient Generating and Retrieving Integrated Documents Based on Web (웹 통합문서의 효율적 생성과 검색을 위한 자동링크지원 시스템의 설계 및 구축)

  • Lee, Won-Jung;Jung, Eun-Jae;Joo, Su-Chong;Lee, Seung-Yong
    • The KIPS Transactions:PartA
    • /
    • v.10A no.2
    • /
    • pp.93-100
    • /
    • 2003
  • With the advent of distributed computing and Web service technologies, lots of users have been requiring services that can conveniently obtain and/or support well-assembled information based on Web. For this reason, we are to construct Automatic Linking Support Systems for generating Web-based integrated information and supporting retrieval information according to user's various requirements. Our system organization is based on client/server system. A server environment consisted of automatic linking engine that can provide lexical analyzing, query processing and integrated document generating functions, and databases that are made of dictionaries, image and URL contents. Also, client environments consisted of Web editor that can generate integrated documents and Web helper that can retrieve them via automatic linking engine and databases. For client's user-friendly interfaces, web editor and helper programs can directly execute by down leading from a server without setup them before inside clients. For reducing server's overheads, Parts of server's executing modules are distributed to clients on which they can be executing. As an implementation of our system, we use the JDK 1.3, SWING for user interfaces like Web editor and helper, RMI mechanism for interaction between clients and a server, and SQL server 7.0 for database development, respectively. Finally, we showed the access procedures of automatic document linking engine and databases from Web editor or Web helper, and results appearing on their screens.

Stress Analysis of the Corner Part of Ship Structures Using the New Equivalent Curved Beam Theory (신(新) 등가(等價) 곡선(曲線)보 이론(理論)에 의한 선체(船體) Corner부(部)의 응력(應力) 해석(解析))

  • Chang-Doo Jang;Seung-Soo Na
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.29 no.4
    • /
    • pp.193-201
    • /
    • 1992
  • A new equivalent curved beam theory is developed for the analysis of the corner part of ship structures, in which effects of distributed loads and asymmetricity with two or three connected parts are considered. Equivalent loads are obtained from equilibrium conditions between the distributed loads and the member forces and moments at the ends of curved beam. And an equivalent curved beam for the asymmetric structure is obtained by superposing the equivalent symmetric parts which have equivalent stiffness. From the sample calculation, it is found that the results of the new equivalent curved beam theory are well agreed with those of finite element method using membrane elements with little computing time and sufficient accuracy.

  • PDF

Implementation of A Multiple-agent System for Conference Calling (회의 소집을 위한 다중 에이전트 시스템의 구현)

  • 유재홍;노승진;성미영
    • Journal of Intelligence and Information Systems
    • /
    • v.8 no.2
    • /
    • pp.205-227
    • /
    • 2002
  • Our study is focused on a multiple-agent system to provide efficient collaborative work by automating the conference calling process with the help of intelligent agents. Automating the meeting scheduling requires a careful consideration of the individual official schedule as well as the privacy and personal preferences. Therefore, the automation of conference calling needs the distributed processing task where a separate calendar management process is associated for increasing the reliability and inherent parallelism. This paper describes in detail the design and implementation issues of a multiple-agent system for conference calling that allows the convener and participants to minimize their efforts in creating a meeting. Our system is based on the client-sewer model. In the sewer side, a scheduling agent, a negotiating agent, a personal information managing agent, a group information managing agent, a session managing agent, and a coordinating agent are operating. In the client side, an interface agent, a media agent, and a collaborating agent are operating. Agents use a standardized knowledge manipulation language to communicate amongst themselves. Communicating through a standardized knowledge manipulation language allows the system to overcome heterogeneity which is one of the most important problems in communication among agents for distributed collaborative computing. The agents of our system propose the dates on which as many participants as possible are available to attend the conference using the forward chaining algorithm and the back propagation network algorithm.

  • PDF

An Ontology-based Collaboration System for Service Interoperability (온톨로지 기반의 서비스 상호운용을 위한 협업 시스템)

  • Hwang, Chi-Gon;Moon, Seok-Jae;Jung, Kye-Dong;Choi, Young-Keun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.210-217
    • /
    • 2013
  • The development of collaboration among information systems in accordance with changes in enterprises' business environment brings about the problems of duplication of the existing business services and increase in costs of maintenance. Accordingly, Web service has been suggested as the standard of distributed computing to prevent the duplication of services within the same business domain and to attain the services that are already being utilized. But since the data needed for Web services are not standardized, it is difficult for the users to find services that meet diverse business purposes. In this paper, we construct an ontology-based collaboration system for service interoperability. The ontology can support fusion service by finding services which are existed interdependently under the distributed environment for collaboration processing. The role of the collaborative system includes development, registration and call of services based on ontology. A local systems request collaboration support through the service profile. Collaborative system supports the development of service using the service profiles, represents the semantic association between real data through system ontology, and infers relationship between instances contained in the services. Based on this, we applied the travel booking services for collaboration system. As a result, service can be managed effectively preventing collision in collaborative system, and we verify that the mapping between system is reduced.

Design and Implementation of the Extended SLDS Supporting SDP Master Replication (SDP Master 이중화를 지원하는 확장 SLDS 설계 및 구현)

  • Shin, In-Su;Kang, Hong-Koo;Lee, Ki-Young;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.3
    • /
    • pp.79-91
    • /
    • 2008
  • Recently, with highly Interest In Location-Based Service(LBS) utilizing location data of moving objects, the GALIS(Gracefully Aging Location Information System) which is a cluster-based distributed computing architecture was proposed as a more efficient location management system of moving objects. In the SLDS(Short-term location Data Subsystem) which Is a subsystem of the GALIS, since the SDP(Short-term Data Processor) Master transmits current location data and queries to every SDP Worker, the SDP Master reassembles and sends query results produced by SDP Workers to the client. However, the services are suspended during the SDP Master under failure and the response time to the client is increased if the load is concentrated on the SDP Master. Therefore, in this paper, the extended SLDS was designed and implemented to solve these problems. Though one SDP Master is under failure, the other can provide the services continually, and so the extended SLDS can guarantee the high reliability of the SLDS. The extended SLDS also can reduce the response time to the client by enabling two SDP Masters to perform the distributed query processing. Finally, we proved high reliability and high availability of the extended SLDS by implementing the current location data storage, query processing, and failure takeover scenarios. We also verified that the extended SLDS is more efficient than the original SLDS through the query processing performance evaluation.

  • PDF