• Title/Summary/Keyword: a fault-tolerant system

Search Result 366, Processing Time 0.025 seconds

Reinforcement Method for Automated Text Classification using Post-processing and Training with Definition Criteria (학습방법개선과 후처리 분석을 이용한 자동문서분류의 성능향상 방법)

  • Choi, Yun-Jeong;Park, Seung-Soo
    • The KIPS Transactions:PartB
    • /
    • v.12B no.7 s.103
    • /
    • pp.811-822
    • /
    • 2005
  • Automated text categorization is to classify free text documents into predefined categories automatically and whose main goals is to reduce considerable manual process required to the task. The researches to improving the text categorization performance(efficiency) in recent years, focused on enhancing existing classification models and algorithms itself, but, whose range had been limited by feature based statistical methodology. In this paper, we propose RTPost system of different style from i.ny traditional method, which takes fault tolerant system approach and data mining strategy. The 2 important parts of RTPost system are reinforcement training and post-processing part. First, the main point of training method deals with the problem of defining category to be classified before selecting training sample documents. And post-processing method deals with the problem of assigning category, not performance of classification algorithms. In experiments, we applied our system to documents getting low classification accuracy which were laid on a decision boundary nearby. Through the experiments, we shows that our system has high accuracy and stability in actual conditions. It wholly did not depend on some variables which are important influence to classification power such as number of training documents, selection problem and performance of classification algorithms. In addition, we can expect self learning effect which decrease the training cost and increase the training power with employing active learning advantage.

Management of Knowledge Abstraction Hierarchy (지식 추상화 계층의 구축과 관리)

  • 허순영;문개현
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.2
    • /
    • pp.131-156
    • /
    • 1998
  • Cooperative query answering is a research effort to develop a fault-tolerant and intelligent database system using the semantic knowledge base constructed from the underlying database. Such knowledge base has two aspects of usage. One is supporting the cooperative query answering Process for providing both an exact answer and neighborhood information relevant to a query. The other is supporting ongoing maintenance of the knowledge base for accommodating the changes in the knowledge content and database usage purpose. Existing studies have mostly focused on the cooperative query answering process but paid little attention on the dynamic knowledge base maintenance. This paper proposes a multi-level knowledge representation framework called Knowledge Abstraction Hierarchy (KAH) that can not only support cooperative query answering but also permit dynamic knowledge maintenance. The KAH consists of two types of knowledge abstraction hierarchies. The value abstraction hierarchy is constructed by abstract values that are hierarchically derived from specific data values in the underlying database on the basis of generalization and specialization relationships. The domain abstraction hierarchy is built on the various domains of the data values and incorporates the classification relationship between super-domains and sub-domains. On the basis of the KAH, a knowledge abstraction database is constructed on the relational data model and accommodates diverse knowledge maintenance needs and flexibly facilitates cooperative query answering. In terms of the knowledge maintenance, database operations are discussed for the cases where either the internal contents for a given KAH change or the structures of the KAH itself change. In terms of cooperative query answering, database operations are discussed for both the generalization and specialization Processes, and the conceptual query handling. A prototype system has been implemented at KAIST that demonstrates the usefulness of KAH in ordinary database application systems.

  • PDF

Rosary : Topology-Aware Structured P2P Overlay Network for CDN System (Rosary : CDN 시스템을 위한 구조화된 토폴러지-인식 P2P 오버레이 네트워크)

  • Shin Soo-Young;Namgoong Jung-ll;Park Soo-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12B
    • /
    • pp.818-830
    • /
    • 2005
  • Recently, Peer-to-Peer (P2P) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network. Content Delivery Network (CDN) is an intermediate layer of infrastructure that helps to efficiently deliver the multimedia content from content providers to clients. In this paper, We propose a topology-aware P2P overlay network for CDN, Rosary, in which CDN servers perform Intra-Pastry and Inter-Pastry routing based on a two-level structured overlay network. This proposed system extends pastry by adapting itself to CDN environments, where a semi-hashing based scheme for Intra-Pastry routing is introduced, and dynamic landmark technology is used to construct the topology-aware overlay network. Through simulations on NS-2, it is shown that Rosary is scalable, efficient, and flexible.

DESIGN AND IMPLEMENTATION OF THE SMALL SATELLITE ON-BOARD COMPUTER SYSTEM : KASCOM (소형위성의 제어를 위한 컴퓨터 시스템의 설계 및 구현)

  • 김기형;김형신;박재현;박규호;최순달
    • Journal of Astronomy and Space Sciences
    • /
    • v.13 no.2
    • /
    • pp.52-66
    • /
    • 1996
  • In this paper, we present the design methodology of KASCOM(KAIST satellite computer), the experimental on-board computer system of KITSAT-2. The design of the on-board computer system should consider the following constraints: operational throughput, fault tolerant input-output, low power, size, weight, and radiation hardness. KASCOM is designed to satisfy these constraints. This paper also presents the implementation and testing details of KASCOM. Finally, the in-orbit operational results are presented. The results show that about 2 SEU errors occur for the program memory(1Mbit SRAM) in a day, while 3.7 SEU errors occur for the data memory(4Mbit SRAM). This implies that high-integrated memories are more susceptible to the radiation environment than low-integrated memories.

  • PDF

Near-Five-Vector SVPWM Algorithm for Five-Phase Six-Leg Inverters under Unbalanced Load Conditions

  • Zheng, Ping;Wang, Pengfei;Sui, Yi;Tong, Chengde;Wu, Fan;Li, Tiecai
    • Journal of Power Electronics
    • /
    • v.14 no.1
    • /
    • pp.61-73
    • /
    • 2014
  • Multiphase machines are characterized by high power density, enhanced fault-tolerant capacity, and low torque pulsation. For a voltage source inverter supplied multiphase machine, the probability of load imbalances becomes greater and unwanted low-order stator voltage harmonics occur. This paper deals with the PWM control of multiphase inverters under unbalanced load conditions and it proposes a novel near-five-vector SVPWM algorithm based on the five-phase six-leg inverter. The proposed algorithm can output symmetrical phase voltages under unbalanced load conditions, which is not possible for the conventional SVPWM algorithms based on the five-phase five-leg inverters. The cause of extra harmonics in the phase voltages is analyzed, and an xy coordinate system orthogonal to the ${\alpha}{\beta}z$ coordinate system is introduced to eliminate low-order harmonics in the output phase voltages. Moreover, the digital implementation of the near-five-vector SVPWM algorithm is discussed, and the optimal approach with reduced complexity and low execution time is elaborated. A comparison of the proposed algorithm and other existing PWM algorithms is provided, and the pros and cons of the proposed algorithm are concluded. Simulation and experimental results are also given. It is shown that the proposed algorithm works well under unbalanced load conditions. However, its maximum modulation index is reduced by 5.15% in the linear modulation region, and its algorithm complexity and memory requirement increase. The basic principle in this paper can be easily extended to other inverters with different phase numbers.

Comparison of Energy Demand in Multi-Story Buckling Restrained Braced Frame and Equivalent SDOF System (다층 비좌굴 가새골조와 등가 단자유도계의 에너지 요구량의 비교)

  • 김진구;원영섭
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.16 no.2
    • /
    • pp.173-182
    • /
    • 2003
  • In equivalent static nonlinear analysis and in energy-based design, the structures are generally transformed into an equivalent SDOF system. In this study the seismic energy demands in multi story structures, such as three-, eight-, and twenty-story steel moment-resisting frames(MRF), buckling restrained braced frames(BRBF) and a damage tolerant braced frame(DTBF), are compared with those of equivalent single degree of freedom(ESDOF) systems. Sixty earthquake ground motions recorded In different soil conditions, which are soft rock, soft soil, and neat fault, were used to compute the input and hysteretic energy demands in model structures. In case the modal mass coefficient is less than 0.8, the effects of higher modes are considered in the process of converting into ESDOF According to the analysis results, the hysteretic and input energies obtained from 3 story and 8 story MRF and DTBF agreed well with the results from analysis of equivalent SDOF systems. However in the 20 story BRBF the results from ESDOF underestimated those obtained from the original structures.

Development of IoT-based real-time Toxic Chemical management System (IoT 기반의 실시간 유해 화학물 관리 시스템 개발)

  • Kang, Min-Soo;Ihm, Chunhwa;Jung, Yong-Gyu;Lee, Minho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.5
    • /
    • pp.143-149
    • /
    • 2016
  • Recent accidents caused by toxic chemicals and the social problems caused by frequent. As of 2010, there are more than 100,000 types of deadly toxic chemicals being distributed throughout Korea, and severely intoxicated patients along with an enormous number of patients can be induced at the time of an accident involving deadly toxic chemicals. Internationally, the seriousness of large-scale disasters due to a NBC disaster (nuclear, biologic and chemical disaster) is being highlighted as well. So, we obtain the information of the RFID tag attached to a glass bottle with containing the toxic chemical to transfer the data to the smart device has been studied a system that can monitor the status of the toxic chemical in real time. The proposed system is the information was sent to the main system using a zigbee communication by recognizing the tag vial containing the toxic chemical with the 13.56MHz bandwidths good permeability. User may check the information in real time by utilizing the smart device. However, the error of the system for managing the toxic chemical generates a result that can not be predicted. Failure of the system was detecting the error by using a comparator as this can cause an error. And the detected error proposed a duplex system so that they do not affect the overall system.

A Java Distributed Batch-processing System using Network of Workstation (워크스테이션 네트워크를 이용한 자바 분산 배치 처리 시스템)

  • Jeon, Jin-Su;Kim, Jeong-Seon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.5 no.5
    • /
    • pp.583-594
    • /
    • 1999
  • With the advance of VLSI and network technologies, it has now become a common practice to deploy a various forms of distributed computing environments. A study shows that a lot of network-aware computers are in an idle state for considerable amount of time depending on the types of users and time frames of the day. If we can take the full advantage of those idle computers, we can obtain the enormous combined processing power without further costly investment. In this paper, we present a distributed batch-processing system, called the Java Distributed Batch-processing System (JDBS), which allows us to execute CPU-intensive, independent jobs across a pool of idle workstations on top of extant distributed computing environments. Since JDBS is implemented using a Java programming language, it not only extends the scope of machine types that can be joined to the pool, but makes it a lot easier to build an entire system. Besides, JDBS is scalable and fault-tolerant due to its multi-cluster organization and intelligent strategies. A graphical user interface is also provided to facilitate the registration and unregistration, job submission, and job monitoring.

Quorum Consensus Method based on Ghost using Simplified Metadata (단순화된 메타데이타를 이용한 고스트 기반 정족수 동의 기법의 개선)

  • Cho, Song-Yean;Kim, Tai-Yun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.1
    • /
    • pp.34-43
    • /
    • 2000
  • Replicated data that is used for fault tolerant distributed system requires replica control protocol to maintain data consistency. The one of replica control protocols is quorum consensus method which accesses replicated data by getting majority approval. If site failure or communication link failure occurs and any one can't get quorum consensus, it degrades the availability of data managed by quorum consensus protocol. So it needs for ghost to replace the failed site. Because ghost is not full replica but process which has state information using meta data, it is important to simplify meta data. In order to maintain availability and simplify meta data, we propose a method to use cohort set as ghost's meta data. The proposed method makes it possible to organize meta data in 2N+logN bits and to have higher availability than quorum consensus only with cohort set and dynamic linear voting protocol. Using Markov model we calculate proposed method's availability to analyze availability and compare it with existing protocols.

  • PDF

WiCoin : Wireless LAN Sharing Using Block Chain Technology (와이코인 : 블록체인 기술을 이용한 무선랜 공유)

  • Kim, Woo-Seong;Ryu, Kyoung-Ho;Park, Yang-Jae
    • Journal of Digital Convergence
    • /
    • v.17 no.1
    • /
    • pp.195-201
    • /
    • 2019
  • This paper proposes a blockchain system to share Wireless Local Area Network (WLAN) that recently suffers from mutual interference among increasing devices using unlicensed bands. Blockchain technology can induce cooperation from users by incentivizing them with cryptocurrency like shown in Bitcoin example. In this paper, we describe Blockchain based access mechanism in WLAN instead of conventional authentication based access. Here, users can access any WLAN access point by paying through smart contract while they also receive payment from others. In order to support real-time transaction, we apply proof-of-authority that is realized by Byzantine fault tolerant protocol instead of well-known proof-of-work that requires huge computing power and delay.