• Title/Summary/Keyword: 유연한 알고리즘

Search Result 443, Processing Time 0.023 seconds

Development of an Algorithm for Automatic Quantity Take-off of Slab Rebar (슬래브 철근 물량 산출 자동화 알고리즘 개발)

  • Kim, Suhwan;Kim, Sunkuk;Suh, Sangwook;Kim, Sangchul
    • Korean Journal of Construction Engineering and Management
    • /
    • v.24 no.5
    • /
    • pp.52-62
    • /
    • 2023
  • The objective of this study is to propose an automated algorithm for precise cutting length of slab rebar complying with regulations such as anchorage length, standard hooks, and lapping length. This algorithm aims to improve the traditional manual quantity take-off process typically outsourced by external contractors. By providing accurate rebar quantity data at BBS(Bar Bending Schedule) level from the bidding phase, uncertainty in quantity take-off can be eliminated and reliance on out-sourcing reduced. In addition, the algorithm allows for early determination of precise quantities, enabling construction firms to preapre competitive and optimized bids, leading to increased profit margins during contract negotiations. The proposed algorithm not only streamlines redundant tasks across various processes, including estimating, budgeting, and BBS generation but also offers flexibility in handling post-contract structural drawing changes. In particular, the proposed algorithm, when combined with BIM, can solve the technical problems of using BIM in the early phases of construction, and the algorithm's formulas and shape codes that built as REVIT-based family files, can help saving time and manpower.

Storage and Retrieval Architecture based on Key-Value Solid State Device (Key-Value Solid State Device 기반의 저장 및 검색 아키텍처)

  • Sun, Yu Xiang;Lee, Yong-Ju
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.1
    • /
    • pp.45-52
    • /
    • 2020
  • This paper proposes a solution for storage and retrieval problems for Resource Description Framework (RDF) data utilizing a key-value Solid State Device (SSD), considering storage, retrieval performance, and security. We propose a two-step compression algorithm to separate logical relationship and true values from RDF data-sets using the key-value SSD. This improves not only compression and storage efficiency but also storage security. We also propose a hybrid retrieval structure based on R∗-tree to enhance retrieval efficiency and implement a sort-merge join algorithm, and discuss factors affecting R∗-tree retrieval efficiency. Finally, we show the proposed approach is superior to current compression, storage, and retrieval approaches, obtaining target results faster while requiring less space, and competitive in terms of versatility, flexibility and security.

Object Detection based on Mask R-CNN from Infrared Camera (적외선 카메라 영상에서의 마스크 R-CNN기반 발열객체검출)

  • Song, Hyun Chul;Knag, Min-Sik;Kimg, Tae-Eun
    • Journal of Digital Contents Society
    • /
    • v.19 no.6
    • /
    • pp.1213-1218
    • /
    • 2018
  • Recently introduced Mask R - CNN presents a conceptually simple, flexible, general framework for instance segmentation of objects. In this paper, we propose an algorithm for efficiently searching objects of images, while creating a segmentation mask of heat generation part for an instance which is a heating element in a heat sensed image acquired from a thermal infrared camera. This method called a mask R - CNN is an algorithm that extends Faster R - CNN by adding a branch for predicting an object mask in parallel with an existing branch for recognition of a bounding box. The mask R - CNN is added to the high - speed R - CNN which training is easy and fast to execute. Also, it is easy to generalize the mask R - CNN to other tasks. In this research, we propose an infrared image detection algorithm based on R - CNN and detect heating elements which can not be distinguished by RGB images. As a result of the experiment, a heat-generating object which can not be discriminated from Mask R-CNN was detected normally.

Efficient Reverse Skyline Processing using Branch-and-Bound (분기한정법을 이용한 효율적인 리버스 스카이라인 질의 처리)

  • Han, Ah;Park, Young-Bae
    • Journal of KIISE:Databases
    • /
    • v.37 no.1
    • /
    • pp.12-21
    • /
    • 2010
  • Recently, "Service of information perspective" that is an important issue is that a company searches customers that interested in certain information and the company offers information to the customers. This service can gain high effects by low cost because of supporting selective information. In most recently, Reverse Skyline using Skyline Approximation(RSSA) is proposed to process services of information provider's perspective. RSSA has problem to defects about waste of processing time and memory. In this paper, Efficient Reverse Skyline(ERSL) Algorithm is proposed for Efficient processing the Skyline. ERSL is new Algorithm using Branch and Bound Skyline(BBS) reduces the waste of processing time and memory. When we execute the variety experimentation to valuation ERSL algorithm's capacity. It is proved the best efficient algorithm among the others because ERSL is flexibly kept the established capacity.

Performance Evaluation of ISA100.11a Superframe Using Deadline Monotonic Scheduling (마감 단조 스케줄링을 사용한 ISA100.11a 슈퍼프레임 성능평가)

  • Saputra, Oka Danil;Shin, Soo Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1338-1345
    • /
    • 2014
  • Recently, wireless technology gains attention for industrial networks due to low cost, flexibility, relatively easy installation and most importantly, solving the rouring issue. ISA100.11a is one of promising standard for wireless industrial networks (WINs). Data traffic in industrial networks are known to be periodic and must satisfy the real-time property namely deadline. Therefore, in this paper, we proposed to apply deadline monotonic scheduling to periodic tasks in ISA100.11a networks and to evaluate the performance of ISA100.11a by checking the schedulability and beacon frame overhead. Simulation results showns, that our proposed scheme can reduces the network overhead while maintaining schedulability as compared to the previous algorithm. In addition, by reducing the network overhead, our proposed scheme can send more data without degrading the overall performance of WINs.

Predictive Traffic Control Scheme of ABR Service (ABR 서비스를 위한 예측 트래픽 제어모델)

  • 오창윤;임동주;배상현
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.2
    • /
    • pp.307-312
    • /
    • 2000
  • Asynchronous transfer mode(ATM) is flexible to support the various multimedia communication services such as data, voice, and image by applying asynchronous time-sharing and statistical multiplexing techniques to the existing data communication. ATM service is categorized to CBR, VBR, UBR, and ABR according to characteristics of the traffic and a required service qualities. Among them, ABR service guarantees a minimal bandwidth and can transmit cells at a maximum transmission rate within the available bandwidth. To minimize the cell losses in transmission and switching, a feedback information in ATM network is used to control the traffic. In this paper, predictive control algorithms are proposed for the feedback information. When the feedback information takes a long propagation delay to the backward nodes, ATM switch can experience a congestion situation from the queue length increases, and a high queue length fluctuations in time. The control algorithms proposed in this paper provides predictive control model using slop changes of the queue length function and previous data of the queue lengths. Simulation shows the effectiveness result of the proposed control algorithms.

  • PDF

Improvement of Tag Collection Performance for Active RFID Systems (능동형 RFID 시스템을 위한 태그 수집 성능 개선)

  • Yoon, Won-Ju;Chung, Sang-Hwa;Moon, Young-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.518-527
    • /
    • 2008
  • Tag collection is one of the major functions in Radio Frequency Identification (RFID) systems. IS0/IEC 18000-7 defines the tag collection algorithm using the anti-collision algorithm, based on the framed slotted ALOHA for active RFID systems. However, it has inefficiency problems that reduce tag collection performance by deciding non-optimum slot size or using point-to-point commands to put collected tags to sleep. In this paper, we propose two mechanisms to overcome the inefficiency problems and improve tag collection performance: 1) a new slot size decision mechanism to allow the reader to choose the optimum slot size flexibly and 2) a broadcast-based sleep mechanism to put collected tags to sleep effectively. We also implemented an active RFID system, composed of an active RFID reader and multiple tags, and the reader is designed to maximize tag collection performance when the proposed mechanisms are applied. In experiments, we evaluated the tag collection performance using one reader and 50 tags in the real-world environment. The experimental results show that when two mechanisms are applied and the initial number of slots is chosen appropriately, the performance of the proposed tag collection algorithm is greatly enhanced, compared with that of the standard.

A Study on Service Composition Using Case-Based Reasoning (사례 기반 추론을 이용한 서비스 컴포지션 연구)

  • Kim, Kun-Su;Lee, Dong-Hoon;Park, Doo-Kyung;Lee, Jee-Hyong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.2
    • /
    • pp.175-182
    • /
    • 2008
  • Context-aware service environment should provide many kinds of services according to users' requests. Users want a great variety of services. In response to their demands the service provider should make a new service every time. But making a new service every time may be inefficient even for a small number of users' requests. So, there are studies on how to efficiently support various and complex requests fFom users. In many researches, service compositions have lately attracted considerable attention. However, existing researches have mainly focused on Web services. So they are not proper to rapidly providing services in response to users' requests, especially In context-aware service environment. This paper proposes a rapid service composition using case-based reasoning. For evaluating the proposed algorithm we implement 'purchasing seTvice agent'. With this system, we compare our algorithm and the existing service composition algorithms.

A Camera Based Traffic Signal Generating Algorithm for Safety Entrance of the Vehicle into the Joining Road (차량의 안전한 합류도로 진입을 위한 단일 카메라 기반 교통신호 발생 알고리즘)

  • Jeong Jun-Ik;Rho Do-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.4 s.310
    • /
    • pp.66-73
    • /
    • 2006
  • Safety is the most important for all traffic management and control technology. This paper focuses on developing a flexible, reliable and real-time processing algorithm which is able to generate signal for the entering vehicle at the joining road through a camera and image processing technique. The images obtained from the camera located beside and upon the road can be used for traffic surveillance, the vehicle's travel speed measurement, predicted arriving time in joining area between main road and joining road. And the proposed algorithm displays the confluence safety signal with red, blue and yellow color sign. The three methods are used to detect the vehicle which is driving in setted detecting area. The first method is the gray scale normalized correlation algorithm, and the second is the edge magnitude ratio changing algorithm, and the third is the average intensity changing algorithm The real-time prototype confluence safety signal generation algorithm is implemented on stored digital image sequences of real traffic state and a program with good experimental results.

Using Genetic Algorithms in Wireless Mesh Network Routing Protocol Design (유전 알고리즘을 이용한 무선 메쉬 네트워크에서의 라우팅 프로토콜 설계)

  • Yoon, Chang-Pyo;Ryou, Hwang-Bin
    • The KIPS Transactions:PartC
    • /
    • v.18C no.3
    • /
    • pp.179-186
    • /
    • 2011
  • Wireless Mesh Network technology refers to the technology which establishes wireless network whose transmission speed is similar to that of the wire system, and provides more enhanced flexibility in the building of network, compared to the existing wired network. In addition, it has the feature of less mobility and less restriction from the energy effect. However, there follow many considerations such as system overhead in the case of setting or the selection of multi-path. Accordingly, the focus is on the design and optimization of network which can reflect this network feature and the technology to establish path. This paper suggests the methods on the programming of path in Wireless Mesh Network routing by applying the evaluation value of node service, making use of the loss rate of data, the hop count of bandwidth and link and the traffic status of node, considering the performance of link and load in the fitness evaluation function, in order to respond to the programming of multi-path effectively.