• Title/Summary/Keyword: Best Path

Search Result 332, Processing Time 0.026 seconds

A method for Clock Selection in High-Level Synthesis (상위수준 합성에서의 클록 선택 방법)

  • Oh, Ju-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.4 no.2
    • /
    • pp.83-87
    • /
    • 2011
  • Clock selection has a significant impact on the performance and quality of designs in high-level synthesis. Almost systems require that the clock length is required prior to scheduling, the best value of the clock can be found only after evaluating different schedules. In this study, we presents a scheduling method that works simultaneously with synthesis by selecting a clock from a chainable operation set. Our scheduling algorithm is based on list scheduling and executes chaining considering bit level delays based on selected clock period. Experimental results show that our method improves the performance by 18 percent.

A Study on the Dynamic Resource Provisioning in the DiffServ Domain (DiffServ 도메인에서의 동적 자원 할당에 관한 연구)

  • Kim, Jin-Cheol;Lee, Young-Hee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.10b
    • /
    • pp.1613-1616
    • /
    • 2000
  • DiffServ 네트웍 모델은 기존의 Best Effort 서비스를 지원하는 IP 네트웍에 차별화된 서비스를 지원 할 수 있는 IP QoS를 무리없이 도입하기 위하여 제안되었다. DiffServ 네트웍은 IntServ에서와 같은 Scalability 문제를 해소할 수 있도록 Edge-to-Edge QoS를 지원하기 용이한 단순화된 구조를 가지고 있다. 이러한 단순화시킨 네트웍 구조에서 여러 가지 QoS 요구 특성을 가지는 트래픽에게 서비스를 제공하고, 네트웍 자원의 이용 효율을 극대화 하고자 하는 사업자의 요구에 따라 효율적인 자원 할당 방안이 필요하게 된다. 자원 활용의 효율을 제고하기 위해서는 정밀하고 동적인 자원할당 방식을 이용하는 것이 필요하며, 이를 실현하기 위하여 Intra-domain의 Edge-to-Edge Path 상에 있는 노드에서의 트래픽 부하 측정을 바탕으로, DSCP 제어 코드를 사용한 탐색 패킷을 통하여 Intra-domain의 부하 및 자원 할당 수준을 탐색하고, 이를 기반으로 Admission Control을 중심으로 한 Resource Provisioning을 동적으로 수행할 수 있는 메커니즘을 제안한다.

  • PDF

Grapheme-based on-line recognition of cursive korean characters (자소 단위의 온라인 흘림체 한글 인식)

  • 정기철;김상균;이종국;김행준
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.9
    • /
    • pp.124-134
    • /
    • 1996
  • Korean has a large set of characters, and has a two-dimensional formation: each character is composed of graphemes in two dimensions. Whereas connections between characters are rare, connections inside a grapheme and between graphemes happen frequently and these connections generate many cursive strokes. To deal with the large character set and the cursive strokes, using the graphemes as a recognition unit is an efffective approach, because it naturally accommodates the structural characteristics of the characters. In this paper, we propose a grapheme-based on-line recognition method for cursive korean characters. Our method uses a TDNN recognition engine to segment cursive strokes into graphemes and a graph-algorithmic postprocessor based on korean grapheme composition rule and viterbi search algorithm to find the best recognition score path. We experimented the method on freely hand-written charactes and obtained a recognition rate of 94.5%.

  • PDF

Thermal Characteristics Analysis of Pre-Treated Rayon Fibers for Preparing Activated Carbon Fibers (활성탄소섬유 제조시 전처리된 레이온 섬유의 열특성 분석)

  • Choi, Sang Seun;Lee, Soon Hong
    • Journal of the Korean Society of Safety
    • /
    • v.29 no.4
    • /
    • pp.61-72
    • /
    • 2014
  • The aim of this study is to define the condition of optimal pre-treatment for preferable activated carbon fibers (ACFs), which are based on rayon fibers. This paper shows the ideal path of ACFs preparation process; implies that rayon fibers are pre-treated by various solvents with different times before the heating process. The pre-treated rayon fibers finally turned into desirable rayon fiber-based ACFs through optimal pre-treatment condition by heating processes. The thermal analysis method of pre-treated rayon fibers by thermo-gravimetry analyser (TGA) is an idealized tool, which analyzes the best thermal condition of pre-treatment process. Surface morphologies of resulting rayon fibers based ACFs were examined by scanning electron microscope(SEM). The results of TGA and SEM analyses show that the optimal pre-treatment condition for preparing ACFs was clearly defined, in terms of thermal stability and surface morphology.

A Design of Smart Train Route Control System (Smart열차진로제어시스템 설계)

  • Yoon, Yong-Ki;Hwang, Jong-Gyu;Lee, Jae-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2005.07b
    • /
    • pp.1556-1558
    • /
    • 2005
  • As a result of the advancement of radio communications technologies, some investigations are in progress to apply this technologies to a train control system. Most of these investigations are focused on the train safety distance control between a preceding train and a succeeding train, an interlocking system uses train circuits to control the railway path. To make the best use of advantages and improve the safety of radio communications based train control systems, the interlocking system must use radio communications technologies. And the safety level of this system must be equal to track circuit based interlocking systems. This paper describes the train location detection method, the system configuration and the system safety of the new system.

  • PDF

Finding a Second Best Coverage Path (차선최단거리유지 이동경로 찾기)

  • Na, Hyeon-Suk;Kim, Jung-Hee
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10b
    • /
    • pp.457-462
    • /
    • 2007
  • 사용자가 가능한 센서 가까이에서 이동하는 문제를 최단거리유지문제라 하며, 무선 연결의 안정성을 높이기 위해서 두 개의 센서로부터 가까이에 위치하여 사용자가 움직이는 이동경로를 차선최단거리유지이동경로라고 한다. 이 논문에서는 주어진 센서들의 집합 U와 시작점 s, 끝점 t가 주어질 때, s에서 t까지 이르는 경로로서, 가장 가까운 두 개의 센서까지의 거리가 최소인 차선최단거리유지이동경로를 찾는 $O((c^2n+e)log(c^2n))$-시간 알고리즘을 제시한다. 여기서 c는 집합 U의 하나의 사이트가 갖는 최대 보로노이 선분의 개수이다.

  • PDF

Investigation of Optimization Nesting Systems on a Board (판재 최적절단 시스템에 관한 연구)

  • Rhee, Zhang-Kyu;Lee, Sun-Kon;Jo, Dae-Hee;Kim, Bong-Gak
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2008.11a
    • /
    • pp.649-658
    • /
    • 2008
  • This paper investigates the optimal nesting system for a board. A hybrid method is used to search the optimal solution for rectangular nesting problem. This method is composed of heuristic approach algorithm. An engineer's experience of board nesting in which a loss occurred to sheet because of various individual error and diffidence. So, item layout at resource sheet were evaluated in engineering algorithm logic in which specially designed was installed. The nesting system consists of Lisp and Visual Basic. The system was controlled by AutoCAD so as to best item batch path test.

  • PDF

A feasibility study of the Iranian Sun mather type plasma focus source for neutron capture therapy using MCNP X2.6, Geant4 and FLUKA codes

  • Nanbedeh, M.;Sadat-Kiai, S.M.;Aghamohamadi, A.;Hassanzadeh, M.
    • Nuclear Engineering and Technology
    • /
    • v.52 no.5
    • /
    • pp.1002-1007
    • /
    • 2020
  • The purpose of the current study was to evaluate a spectrum formulation set employed to modify the neutron spectrum of D-D fusion neutrons in a IS plasma focus device using GEANT4, MCNPX2.6, and FLUKA codes. The set consists of a moderator, reflector, collimator and filters of fast neutron and gamma radiation, which placed on the path of 2.45 MeV neutron energy. The treated neutrons eliminate cancerous tissue with minimal damage to other healthy tissue in a method called neutron therapy. The system optimized for a total neutron yield of 109 (n/s). The numerical results indicate that the GEANT4 code for the cubic geometry in the Beam Shaping Assembly 3 (BSA3) is the best choice for the energy of epithermal neutrons.

Efficient Processing of Spatial Preference Queries in Spatial Network Databases

  • Cho, Hyung-Ju;Attique, Muhammad
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.2
    • /
    • pp.210-224
    • /
    • 2019
  • Given a positive integer k as input, a spatial preference query finds the k best data objects based on the scores (e.g., qualities) of feature objects in their spatial neighborhoods. Several solutions have been proposed for spatial preference queries in Euclidean space. A few algorithms study spatial preference queries in undirected spatial networks where each edge is undirected and the distance between two points is the length of the shortest path connecting them. However, spatial preference queries have not been thoroughly investigated in directed spatial networks where each edge has a particular orientation that makes the distance between two points noncommutative. Therefore, in this study, we present a new method called ALPS+ for processing spatial preference queries in directed spatial networks. We conduct extensive experiments with different setups to demonstrate the superiority of ALPS+ over conventional solutions.

DECISION SUPPORT SYSTEM FOR OPTIMAL SELECTION OF HAUL ROUTES BASED ON TIME SLOTS IN EARTHMOVING OPERATION

  • Sang-Hyeok Kang;Kyeong-Geun Baik;Hyun-Gi Baek;Hyeong-Gi Park;Jong-Won Seo
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.1134-1139
    • /
    • 2009
  • Haul routes for earthmoving operation need to be carefully selected because the decision on the haul routes could make a significant difference in the project's cost and time. This paper proposes a decision support system for improving productivity of earthmoving operation that helps construction managers choose the best haul routes of trucks based on time slots. Also, a methodology for optimal selection of haul routes considering traffic conditions and topographic conditions of the routes is explained. Raster data model is used to find an available shortest path based on cost weighted distance. A system was developed on a geographic information system environment for efficient database management and easy manipulation of graphical data. A real-world case study was conducted to verify the applicability of the proposed system.

  • PDF