• Title/Summary/Keyword: Graph operation

Search Result 172, Processing Time 0.023 seconds

Design & Implementation of Extractor for Design Sequence of DB tables using Data Flow Diagrams (자료흐름도를 사용한 테이블 설계순서 추출기의 설계 및 구현)

  • Lim, Eun-Ki
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.3
    • /
    • pp.43-49
    • /
    • 2012
  • Information obtained from DFD(Data Flow Diagram) are very important in system maintenance, because most legacy systems are analyzed using DFD in structured analysis. In our thesis, we design and implement an extractor for design sequence of database tables using DFD. Our extractor gets DFDs as input data, transform them into a directed graph, and extract design sequence of DB tables. We show practicality of our extractor by applying it to a s/w system in operation.

A Study on the Estimation of Earth Resistivity using Backpropagation Algorithm (역전파알고리즘을 이용한 대피저항율추정에 관한 연구)

  • Park, P.K.;Yu, B.H.;Seok, J.W.;Choi, J.K.;Jung, G.J.;Kim, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 1997.11a
    • /
    • pp.203-205
    • /
    • 1997
  • In this paper, we present a useful method of estimating earth resistivity using BP algorithm in Neural-Networks. From this method, equivalent earth resistivity(EER) can be obtained directly using training data composed of field-measured apparent resistivity and probe distance. This approach can reduce errors which is conventionally raised from manual operation of calculating EER. To evaluate its accuracy and convenience, the result of proposed method is compared to that of conventional methods, graphical($\rho$-a graph) and numerical(CDEGS program), respectively.

  • PDF

A Low power Scheduling and Allocation Algorithm for Multiple Supply Voltage (다중 공급 전압을 이용한 저 전력 스케쥴링 및 할당 알고리듬)

  • 최지영;박남서;안도희
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.2
    • /
    • pp.79-86
    • /
    • 2002
  • This paper presents a low power scheduling and allocation algorithm for multiple supply voltage. The proposed supply voltage scheduling algorithm determines the control step to execute a possible the operation experimentally using another supply voltage level. Also, the switching activity using component library. and the supply voltage allocation method uses the graph coloring technique for low power, the proposed algorithm Proves the effect through various high level benchmark examples to adopt a multiple supply voltage scheduling algorithm for low power.

  • PDF

Design of OpenCV based Finger Recognition System using binary processing and histogram graph

  • Baek, Yeong-Tae;Lee, Se-Hoon;Kim, Ji-Seong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.2
    • /
    • pp.17-23
    • /
    • 2016
  • NUI is a motion interface. It uses the body of the user without the use of HID device such as a mouse and keyboard to control the device. In this paper, we use a Pi Camera and sensors connected to it with small embedded board Raspberry Pi. We are using the OpenCV algorithms optimized for image recognition and computer vision compared with traditional HID equipment and to implement a more human-friendly and intuitive interface NUI devices. comparison operation detects motion, it proposed a more advanced motion sensors and recognition systems fused connected to the Raspberry Pi.

A Resource-constrained Scheduling Algorithm for High-level Synthesis

  • Song, Ho-Jeong;Lee, Jae-Jin;Hwang, In-Jae;Song, Gi-Yong
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1728-1731
    • /
    • 2002
  • Scheduling is assigning each operation in a control/data flow graph(CDFG) to a specific control step. It directly influences the performance of the hardware synthesized. In this paper, we propose an efficient resource-constrained scheduling algorithm assuming that only available silicon area is given. We performed the experiment to evaluate its performance. The results show that our algorithm find the solution with shorter scheduling length compared to the existing methods.

  • PDF

Near-Optimal Algorithm for Group Scheduling in OBS Networks

  • Nhat, Vo Viet Minh;Quoc, Nguyen Hong;Son, Nguyen Hoang
    • ETRI Journal
    • /
    • v.37 no.5
    • /
    • pp.888-897
    • /
    • 2015
  • Group scheduling is an operation whereby control packets arriving in a time slot schedule their bursts simultaneously. Normally, those bursts that are of the same wavelength are scheduled on the same channel. In cases where the support of full wavelength converters is available, such scheduling can be performed on multiple channels for those bursts that are of an arbitrary wavelength. This paper presents a new algorithm for group scheduling on multiple channels. In our approach, to reach a near-optimal schedule, a maximum-weight clique needs to be determined; thus, we propose an additional algorithm for this purpose. Analysis and simulation results indicate that an optimal schedule is almost attainable, while the complexity of computation and that of implementation are reduced.

Terminal-Pair Availability Evaluation in Irreducible Structure Communication Networks (비가략(非可略) 구조를 갖는 네트워크의 단점간 가용도 평가)

  • Lee, Jun-Hyuk;Kim, Kyoung-Mok;Oh, Young-Hwan
    • Journal of Applied Reliability
    • /
    • v.8 no.4
    • /
    • pp.181-192
    • /
    • 2008
  • In this paper, we proposed effective algorithm that do Availability of communication network account using total probability formula. Use path tracing method about PSTN linked with MSC in WCDMA considering occasion that do not consider mobility of terminal and Availability did account. First, express minimum path series gathering by structure function after network that do modeling by stochastic graph for communication network saves all minimal path sets between particular two abutments and we gain Availability value in angular variable after express structure function by Boolean operation form and Availability between two abutments did account.

  • PDF

Optimum Layout Model of Lift Car for Improving Productivity in High-rise Building Exterior Finishing Work (마감공사 생산성 향상을 위한 리프트 카 최적배치 모델)

  • Lee, Dongmin;Lim, Hyunsu;Kim, Taehoon;Cho, Hunhee;Kang, Kyung-In
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2013.05a
    • /
    • pp.171-172
    • /
    • 2013
  • An operation planning of lift car is crucial in tall building construction especially it's arrangement plans, because it is related with transportation distance of finishing materials affecting construction productivity. Since tall building construction, composed of complicating and huge plane have complex traffic lines of finishing materials, to determine the position of lift car empirically or intuitively has limits. Therefore this paper suggest an optimum layout model of lift car minimizing the transportation distance both at site-level and floor-level using Graph theory and Dijkstra algorithm.

  • PDF

Knowledge-based Decision Support System for Process Planning in the Electric Motor Manufacturing (전동기 제조업의 지식기반 공정계획 지원시스템에 관한 연구)

  • Song, Jung-Su;Kim, Jae-Gyun;Lee, Jae-Man
    • IE interfaces
    • /
    • v.11 no.2
    • /
    • pp.159-176
    • /
    • 1998
  • In the motor manufacturing system with the properties of short delivery and order based production, the process plan is performed individually for each order by the expert of process plan after the completion of the detail design process to satisfy the specification to be required by customer. Also it is hard to establish the standard process plan in reality because part routings and operation times are varied for each order. Hence, the production planner has the problem that is hard to establish the production schedule releasing the job to the factory because there occurs the big difference between the real time to be completed the process plan and the time to be required by the production planner. In this paper, we study the decision supporting system for the process plan based on knowledge base concept. First, we represent the knowledge of process planner as a database model through the modified POI-Feature graph. Then we design and implement the decision supporting system imbedded in the heuristic algorithm in the client/server environment using the ORACLE relational database management system.

  • PDF

A flow-directed minimal path sets method for success path planning and performance analysis

  • Zhanyu He;Jun Yang;Yueming Hong
    • Nuclear Engineering and Technology
    • /
    • v.56 no.5
    • /
    • pp.1603-1618
    • /
    • 2024
  • Emergency operation plans are indispensable elements for effective process safety management especially when unanticipated events occur under extreme situations. In the paper, a synthesis framework is proposed for the integration success path planning and performance analysis. Within the synthesis framework, success path planning is implemented through flow-directed signal tracing, renaming and reconstruction from a complete collection of Minimal Path Sets (MPSs) that are obtained using graph traversal search on GO-FLOW model diagram. The performance of success paths is then evaluated and prioritized according to the task complexity and probability calculation of MPSs for optimum action plans identification. Finally, an Auxiliary Feed Water System of Pressurized Water Reactor (PWR-AFWS) is taken as an example system to demonstrate the flow-directed MPSs search method for success path planning and performance analysis. It is concluded that the synthesis framework is capable of providing procedural guidance for emergency response and safety management with optimal success path planning under extreme situations.