• Title/Summary/Keyword: Processing step

Search Result 1,686, Processing Time 0.033 seconds

Design and Implementation of Distribution in Distributed Object-Oriented Databases (분산 객체지향 데이타베이스에서 분산 설계 및 구현)

  • Lee, Soon-Mi;Park, Hea-Sook;Ha, Yan
    • The KIPS Transactions:PartB
    • /
    • v.11B no.5
    • /
    • pp.611-618
    • /
    • 2004
  • This paper addresses the design and implementation of class distribution in distributed object-oriented databases. The proposed strategy of distribution consists of two-step design of fragments. One is class fragmentation and the other is allocation of fragments. In step of class fragmentation, we have defined partitioning algorithms to reflect the characteristics of object-oriented databases such as method, inheritance and composite-object. In step of allocation, we have defined the objective function for allocation considering system operating cost including storage, query processing and communication and implemented it using Genetic Algorithm.

Variable Time Step Simulation and Analysis of Hydraulic Control Systems using Transmission Line Modeling (전달관로 모델링을 이용한 유압제어 시스템의 가변 시간스텝 시뮬레이션 및 해석)

  • Hwang, Un-Gyu;Jo, Seung-Ho
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.5
    • /
    • pp.843-850
    • /
    • 2002
  • This paper presents a simulation method using the transmission line modeling to reduce simulation runtime of hydraulic control systems. This method is based on separating the system components each other using the transmission line elements prior to simulation, which leads to divide the simulated system into several subsystems suitable for an even more efficient integration. It can also handle nonlinearities and discontinuities without flag signal when restarting integration. By applying variable integration timestep to parallel hydraulic circuits via parallel processing, it is shown that simulation run-time can be reduced significantly compared with that of Runge Kutta method.

A Note on Computing the Crisp Order Context of a Fuzzy Formal Context for Knowledge Reduction

  • Singh, Prem Kumar;Kumar, Ch. Aswani
    • Journal of Information Processing Systems
    • /
    • v.11 no.2
    • /
    • pp.184-204
    • /
    • 2015
  • Fuzzy Formal Concept Analysis (FCA) is a mathematical tool for the effective representation of imprecise and vague knowledge. However, with a large number of formal concepts from a fuzzy context, the task of knowledge representation becomes complex. Hence, knowledge reduction is an important issue in FCA with a fuzzy setting. The purpose of this current study is to address this issue by proposing a method that computes the corresponding crisp order for the fuzzy relation in a given fuzzy formal context. The obtained formal context using the proposed method provides a fewer number of concepts when compared to original fuzzy context. The resultant lattice structure is a reduced form of its corresponding fuzzy concept lattice and preserves the specialized and generalized concepts, as well as stability. This study also shows a step-by-step demonstration of the proposed method and its application.

A Study on the Flame Monitoring System Development (화염감시 시스템 개발에 관한 연구)

  • 백운보;황이철;이승종
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.2
    • /
    • pp.60-66
    • /
    • 2004
  • Increased energy costs have placed demands for improved combustion efficiency, high equipment availability, low maintenance and safe operation. Simultaneously low NOx modification, installed due to stricter environmental legislations, require very careful combustion management. The flame diagnostics system has been developed specially to meet these requirements. We aimed at gaining the relationship between burner flame image and emissions such as NOx and unburned carbon in furnace by utilizing the image processing method. For the first step of development, its possibility test was undertaken with bench furnace. The test proceeded to the second step with pilot furnace, the system was observed to be effective for evaluating the combustion conditions.

Flame Image Analysis Systems for Combustion Conditions Monitoring (연소상태 감시용 화염 영상분석 시스템)

  • 백운보;한성현
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.499-502
    • /
    • 2003
  • Increase energy costs have placed demands for improved combustion efficiency, high equipment availability, low maintenance and safe operation. Simultaneously low NOx modification, installed due to stricter environmental legislation, require very careful combustion management. We aimed at gaining the relationship between burner flame image and emissions such as NOx and unburned carbon in furnace by utilizing the image processing method. For the first step of development, its possibility test was undertaken with bench furnace. The test proceeded to the second step with pilot furnace, the system was observed to be effective for evaluating the combustion conditions. By using this technology, it is possible to perform continuous monitoring of the combustion conditions and instant detection of individual changes for each burner to prevent future loss of ignition.

  • PDF

A Fast Interest Point Detection Method in SURF Algorithm (SURF알고리듬에서의 고속 특징점 검출 방식)

  • Hwang, In-So;Eom, Il-Kyu;Moon, Yong-Ho;Ha, Seok-Wun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.1
    • /
    • pp.49-55
    • /
    • 2015
  • In this paper, we propose a fast interest point detection method using SURF algorithm. Since the SURF algorithm needs a great computations to detect the interest points and obtain the corresponding descriptors, it is not suitable for real-time based applications. In order to overcome this problem, the interest point detection step is parallelized by OpenMP and SIMD based on analysis of the scale space representation process and localization one in the step. The simulation results demonstrate that processing speed is enhanced about 55% by applying the proposed method.

A Design and the Efficient Operation of Systolic Array for Polyadic-Nonserial Dynamic Programming Processing (Polyadic-Nonserial 동적 프로그래밍 처리를 위한 시스토릭 어레이의 설계 및 효율적인 운영)

  • 우종호;한광선
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.8
    • /
    • pp.1178-1186
    • /
    • 1989
  • In this paper, a systolic array for polyadic-nonserial DP problems is designed, the performance is analyzed and the efficient operating method is proposed. The algorithm is transformed to remove the broadcasting and global communication paths in the data dependence step by step. The transformed algorithm is mapping to the systolic array using the method proposed by D. I. Moldovan. The designed array is homogenous, had the processing elements of (n+1)/2 and 2n computation time ( n is the size of problem). In case of being many problems to process, the efficiency of array can be upward by inputing the problems successively. The interval between the initiations of two successive proboem instances is [n/2]+1 and the speed-up is about 4. The processor utilizations of each case are calculated.

  • PDF

New Links between mRNA Polyadenylation and Diverse Nuclear Pathways

  • Di Giammartino, Dafne Campigli;Manley, James L.
    • Molecules and Cells
    • /
    • v.37 no.9
    • /
    • pp.644-649
    • /
    • 2014
  • The 3' ends of most eukaryotic messenger RNAs must undergo a maturation step that includes an endonuc-leolytic cleavage followed by addition of a polyadenylate tail. While this reaction is catalyzed by the action of only two enzymes it is supported by an unexpectedly large number of proteins. This complexity reflects the necessity of coordinating this process with other nuclear events, and growing evidence indicates that even more factors than previously thought are necessary to connect 3' processing to additional cellular pathways. In this review we summarize the current understanding of the molecular machinery involved in this step of mRNA maturation, focusing on new core and auxiliary proteins that connect polyadenylation to splicing, DNA damage, transcription and cancer.

An Efficient Resource-constrained Scheduling Algorithm (효율적 자원제한 스케줄링 알고리즘)

  • 송호정;정회균;황인재;송기용
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2001.06a
    • /
    • pp.73-76
    • /
    • 2001
  • High-level synthesis generates a structural design that implements the given behavior and satisfies design constraints for area, performance, power consumption, packaging, testing and other criteria. Thus, high-level synthesis generates that register-transfer(RT) level structure from algorithm level description. High-level synthesis consist of compiling, partitioning, scheduling. In this paper, we proposed the efficient scheduling algorithm that find the number of the functional unit and scheduling into the minimum control step with silicon area resource constrained.

  • PDF

A Study for Efficient Multiple Access Protocol in Wireless LAN (무선 랜의 효율적인 다중억세스 프로토콜에 대한 연구)

  • Seo, Ju-Ha;Cho, Churl-Hee
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.3
    • /
    • pp.382-389
    • /
    • 1995
  • In this paper, we propose an efficient transmission schedule which can be used in indoor wireless LAN. It reduces considerably the time delay and increases the throughput by reusing the bandwidth. We describe the architecture of the wireless LAN, the algorithm of step-by-step allocation of time slot reusing the resource and the results of the computer simulation.

  • PDF