• Title/Summary/Keyword: Complete reuse

Search Result 36, Processing Time 0.033 seconds

Treatment of Organic Wastes and Reuse of Bio-energy from the Anaerobic Digestion - Thermophilic Oxic Precess (혐기성 소화-고온 호기법에 의한 유기성폐기물의 처리와 생성열의 재활용 검토)

  • Yang, Jae-Kyung;Choi, Kyung-Min
    • Journal of the Korea Organic Resources Recycling Association
    • /
    • v.9 no.1
    • /
    • pp.79-89
    • /
    • 2001
  • Anaerobic Digestion - Thermophilic Oxic Process(ADTOP) has been known to be one way reducing and composting of organic wastes without draining or forming excess sludge. It could be completely performed by the evaporation of water using the bio-energy from the microbial degradation of organic. In the present study the complete treatment of Chinese restaurant wastes was conducted and utility of bio-energy produced from the ADTOP was estimated. Base on results, it could be concluded as follows; 1) chinese restaurant wastes could be completely treated using the TOP without draining or excess sludge. Maximum volumetric loading rate was determined as $55.0kg-garbage/m^3$. Input water was almostly evaporated and 90.5% of carboneous organic wastes was conversed to carbondioxide. 2)The optimum volumetric loading rate which is acceptable to maintain over $55^{\circ}C$ in the anaerobic digester was determined as $45kg-garbage/m^3{\cdot}d$. 3) The optimum HRT was at least over 10 days in order to maintain about $50^{\circ}C$ in the anaerobic digester using bio-energy produced from TOP. Therefore the utilization of bio-energy produced from TOP could be used in the process which had long HRT such as the anaerobic digestion. 4) The efficiency of anaerobic digester rate were over 90% by the ADTOP under the organic loading rate of $1.1kg-COD/m^3{\cdot}d$, 50kg-Chinese restaurant garbage and $250{\ell}/m^3{\cdot}min$ of the aeration rate.

  • PDF

Ontology Alignment by Using Discrete Cuckoo Search (이산 Cuckoo Search를 이용한 온톨로지 정렬)

  • Han, Jun;Jung, Hyunjun;Baik, Doo-Kwon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.12
    • /
    • pp.523-530
    • /
    • 2014
  • Ontology alignment is the way to share and reuse of ontology knowledge. Because of the ambiguity of concept, most ontology alignment systems combine a set of various measures and complete enumeration to provide the satisfactory result. However, calculating process becomes more complex and required time increases exponentially since the number of concept increases, more errors can appear at the same time. Lately the focus is on meta-matching using the heuristic algorithm. Existing meta-matching system tune extra parameter and it causes complex calculating, as a consequence, the results in the various data of specific domain are not good performed. In this paper, we propose a high performance algorithm by using DCS that can solve ontology alignment through simple process. It provides an efficient search strategy according to distribution of Levy Flight. In order to evaluate the approach, benchmark data from the OAEI 2012 is employed. Through the comparison of the quality of the alignments which uses DCS with state of the art ontology matching systems.

Indirect Branch Target Address Verification for Defense against Return-Oriented Programming Attacks (Return-Oriented Programming 공격 방어를 위한 간접 분기 목적 주소 검증 기법)

  • Park, Soohyun;Kim, Sunil
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.5
    • /
    • pp.217-222
    • /
    • 2013
  • Return-Oriented Programming(ROP) is an advanced code-reuse attack like a return-to-libc attack. ROP attacks combine gadgets in program code area and make functions like a Turing-complete language. Some of previous defense methods against ROP attacks show high performance overhead because of dynamic execution flow analysis and can defend against only certain types of ROP attacks. In this paper, we propose Indirect Branch Target Address Verification (IBTAV). IBTAV detects ROP attacks by checking if target addresses of indirect branches are valid. IBTAV can defends against almost all ROP attacks because it verifies a target address of every indirect branch instruction. Since IBTAV does not require dynamic execution flow analysis, the performance overhead of IBTAV is relatively low. Our evaluation of IBTAV on SPEC CPU 2006 shows less than 15% performance overhead.

A Study on the Establishment of Housing Performance Criteria for Modular Building (모듈러 건축물의 거주환경 성능기준 설정에 관한 연구;음환경 성능을 중심으로)

  • Ko, Kwang-Il;Kim, Yong-In;Lee, Chan-Sik
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2006.11a
    • /
    • pp.628-631
    • /
    • 2006
  • Modular Construction is a method, which factory-produced units are transferred to on-site and assembled to form complete buildings. It is expected that its demand will increase gradually. Because it has some advantages such as duration reduction, movement, reuse and environmental friendliness etc. For the Modular Construction to be introduced and applied, we needs the objective and reasonable performance criteria. This study presents the acoustic performance criteria of the modular building. For this one, this paper reviews legal standard related to performance, analyzes the performance evaluation and survey on pilot projects. The presented performance criteria can be specifically asked the demand by owner in a design guideline. In addition, it makes designer and general contractor accomplish target performance. Eventually, it can improve the performance of Modular Building.

  • PDF

VLSI architecture design of CAVLC entropy encoder/decoder for H.264/AVC (H.264/AVC를 위한 CAVLC 엔트로피 부/복호화기의 VLSI 설계)

  • Lee Dae-joon;Jeong Yong-jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5C
    • /
    • pp.371-381
    • /
    • 2005
  • In this paper, we propose an advanced hardware architecture for the CAVLC entropy encoder/decoder engine for real time video compression. The CAVLC (Context-based Adaptive Variable Length Coding) is a lossless compression method in H.264/AVC and it has high compression efficiency but has computational complexity. The reference memory size is optimized using partitioned storing method and memory reuse method which are based on partiality of memory referencing. We choose the hardware architecture which has the most suitable one in several encoder/decoder architectures for the mobile devices and improve its performance using parallel processing. The proposed architecture has been verified by ARM-interfaced emulation board using Altera Excalibur and also synthesized on Samsung 0.18 um CMOS technology. The synthesis result shows that the encoder can process about 300 CIF frames/s at 150MHz and the decoder can process about 250 CIF frames/s at 140Mhz. The hardware architectures are being used as core modules when implementing a complete H.264/AVC video encoder/decoder chip for real-time multimedia application.

Validation of ebXML BPSS Instances Based on Semantic Constraints (의미제약 기반의 ebXML BPSS 사례 검증)

  • Kim, Hyoung-Do;Kim, Jong-Woo
    • The Journal of Society for e-Business Studies
    • /
    • v.10 no.4
    • /
    • pp.1-18
    • /
    • 2005
  • In ebXML, a representative framework for electronic commerce, a BPS (Business Process Specification) should be finally defined as an instance of XML-version BPSS for the configuration of B2B (Business to Business) runtime systems . In order to define the instance more complete and consistent, it is required to validate all the semantic constraints on the instance . Due to the limitations of XML Schema constructs, however, current XML-version BPSS fails to specify formal semantic constraints completely. This paper presents how to find, express and reuse BPSS semantic constraints that could not be explicitly defined in the XML-version BPSS. The method facilitates the validation of XML-version BPSS instances easily with some useful guides for fixing violations of semantic constraints. Furthermore, B2B business processes can be standardized and applied more efficiently and effectively.

  • PDF

A Study for searching optimized combination of Spent light water reactor fuel to reuse as heavy water reactor fuel by using evolutionary algorithm (진화 알고리즘을 이용한 경수로 폐연료의 중수로 재사용을 위한 최적 조합 탐색에 관한 연구)

  • 안종일;정경숙;정태충
    • Journal of Intelligence and Information Systems
    • /
    • v.3 no.2
    • /
    • pp.1-9
    • /
    • 1997
  • These papers propose an evolutionary algorithm for re-using output of waste fuel of light water reactor system in nuclear power plants. Evolutionary algorithm is useful for optimization of the large space problem. The wastes contain several re-useable elements, and they should be carefully selected and blended to satisfy requirements as input material to the heavy water nuclear reactor system. This problem belongs to a NP-hard like the 0/1 Knapsack problem. Two evolutionary strategies are used as a, pp.oximation algorithms in the highly constrained combinatorial optimization problem. One is the traditional strategy, using random operator with evaluation function, and the other is heuristic based search that uses the vector operator reducing between goal and current status. We also show the method, which performs the feasible teat and solution evaluation by using the vectorized data in problem. Finally, We compare the simulation results of using random operator and vector operator for such combinatorial optimization problems.

  • PDF

Flattening Class Hierarchy for Reorganization of Object-Oriented Software (객체지향 소프트웨어의 재구성을 위한 클래스계층 구조의 평탄화)

  • Hwang, Seok-Hyeong;Yang, Hae-Sul;Park, Jeong-Ho
    • The KIPS Transactions:PartD
    • /
    • v.8D no.6
    • /
    • pp.853-860
    • /
    • 2001
  • In the object-oriented software development, redesigning of classes and reorganizing of class hierarchy structures should be necessary to reduce many of the headaches of object-oriented software design and maintenance. To support this task, in this paper, we propose a theoretical foundation for class hierarchy reorganizations that is relatively complete, correct, formal and easy to understand and use. We introduce the flattened class hierarchy that characterizes the class hierarchy structures in object-oriented software evolution. And we also present an algorithm which transforms a given class hierarchy into the normalized form. The flattened class hierarchy helps us map the inheritance and aggregation paths in a class hierarchy to paths in an object hierarchy that is an instance of the class hierarchy. By applying the algorithm into a given class hierarchy, we can make a new, object-preserved, and flattened class hierarchy that is the cornerstone for reorganization of class hierarchy structure and plays an important role as a bridge on the incremental evolutionary changes and reuse of object-oriented software to reorganize class hierarchies.

  • PDF

A Formal Approach for the Reorganization of Class Hierarchies for the Extension of Object Oriented Applications (객체지향 어플리케이션의 확장을 위한 클래스 계층 구조의 재구성에 대한 정형기법)

  • Hwang, Suk-Hyung;Kim, Dae-Won;Yang, Hae-Sool
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.3
    • /
    • pp.589-602
    • /
    • 1999
  • There are some advantages of developing applications based on the object oriented concepts. One os them is that it is possible to reuse the existing designs and products. This paper provides a formal method for the reorganization of class hierarchies for the object extension in the object oriented design phase. In this paper, we introduce classes, and edges to represent the inheritance and aggregation relationship between classes. Based on the graph, we define an order relation(called the object extension) between class hierarchy graphs. And also we present a set of five basic transformations preserving the object extension relation. The set is proven to be correct and complete. The results of this paper help form a theoretical basis for the extension and reorganization object-oriented application systems.

  • PDF

Using the METHONTOLOGY Approach to a Graduation Screen Ontology Development: An Experiential Investigation of the METHONTOLOGY Framework

  • Park, Jin-Soo;Sung, Ki-Moon;Moon, Se-Won
    • Asia pacific journal of information systems
    • /
    • v.20 no.2
    • /
    • pp.125-155
    • /
    • 2010
  • Ontologies have been adopted in various business and scientific communities as a key component of the Semantic Web. Despite the increasing importance of ontologies, ontology developers still perceive construction tasks as a challenge. A clearly defined and well-structured methodology can reduce the time required to develop an ontology and increase the probability of success of a project. However, no reliable knowledge-engineering methodology for ontology development currently exists; every methodology has been tailored toward the development of a particular ontology. In this study, we developed a Graduation Screen Ontology (GSO). The graduation screen domain was chosen for the several reasons. First, the graduation screen process is a complicated task requiring a complex reasoning process. Second, GSO may be reused for other universities because the graduation screen process is similar for most universities. Finally, GSO can be built within a given period because the size of the selected domain is reasonable. No standard ontology development methodology exists; thus, one of the existing ontology development methodologies had to be chosen. The most important considerations for selecting the ontology development methodology of GSO included whether it can be applied to a new domain; whether it covers a broader set of development tasks; and whether it gives sufficient explanation of each development task. We evaluated various ontology development methodologies based on the evaluation framework proposed by G$\acute{o}$mez-P$\acute{e}$rez et al. We concluded that METHONTOLOGY was the most applicable to the building of GSO for this study. METHONTOLOGY was derived from the experience of developing Chemical Ontology at the Polytechnic University of Madrid by Fern$\acute{a}$ndez-L$\acute{o}$pez et al. and is regarded as the most mature ontology development methodology. METHONTOLOGY describes a very detailed approach for building an ontology under a centralized development environment at the conceptual level. This methodology consists of three broad processes, with each process containing specific sub-processes: management (scheduling, control, and quality assurance); development (specification, conceptualization, formalization, implementation, and maintenance); and support process (knowledge acquisition, evaluation, documentation, configuration management, and integration). An ontology development language and ontology development tool for GSO construction also had to be selected. We adopted OWL-DL as the ontology development language. OWL was selected because of its computational quality of consistency in checking and classification, which is crucial in developing coherent and useful ontological models for very complex domains. In addition, Protege-OWL was chosen for an ontology development tool because it is supported by METHONTOLOGY and is widely used because of its platform-independent characteristics. Based on the GSO development experience of the researchers, some issues relating to the METHONTOLOGY, OWL-DL, and Prot$\acute{e}$g$\acute{e}$-OWL were identified. We focused on presenting drawbacks of METHONTOLOGY and discussing how each weakness could be addressed. First, METHONTOLOGY insists that domain experts who do not have ontology construction experience can easily build ontologies. However, it is still difficult for these domain experts to develop a sophisticated ontology, especially if they have insufficient background knowledge related to the ontology. Second, METHONTOLOGY does not include a development stage called the "feasibility study." This pre-development stage helps developers ensure not only that a planned ontology is necessary and sufficiently valuable to begin an ontology building project, but also to determine whether the project will be successful. Third, METHONTOLOGY excludes an explanation on the use and integration of existing ontologies. If an additional stage for considering reuse is introduced, developers might share benefits of reuse. Fourth, METHONTOLOGY fails to address the importance of collaboration. This methodology needs to explain the allocation of specific tasks to different developer groups, and how to combine these tasks once specific given jobs are completed. Fifth, METHONTOLOGY fails to suggest the methods and techniques applied in the conceptualization stage sufficiently. Introducing methods of concept extraction from multiple informal sources or methods of identifying relations may enhance the quality of ontologies. Sixth, METHONTOLOGY does not provide an evaluation process to confirm whether WebODE perfectly transforms a conceptual ontology into a formal ontology. It also does not guarantee whether the outcomes of the conceptualization stage are completely reflected in the implementation stage. Seventh, METHONTOLOGY needs to add criteria for user evaluation of the actual use of the constructed ontology under user environments. Eighth, although METHONTOLOGY allows continual knowledge acquisition while working on the ontology development process, consistent updates can be difficult for developers. Ninth, METHONTOLOGY demands that developers complete various documents during the conceptualization stage; thus, it can be considered a heavy methodology. Adopting an agile methodology will result in reinforcing active communication among developers and reducing the burden of documentation completion. Finally, this study concludes with contributions and practical implications. No previous research has addressed issues related to METHONTOLOGY from empirical experiences; this study is an initial attempt. In addition, several lessons learned from the development experience are discussed. This study also affords some insights for ontology methodology researchers who want to design a more advanced ontology development methodology.