• 제목/요약/키워드: TREE FEATURE

검색결과 367건 처리시간 0.027초

Measurement and Modeling of Job Stress of Electric Overhead Traveling Crane Operators

  • Krishna, Obilisetty B.;Maiti, Jhareswar;Ray, Pradip K.;Samanta, Biswajit;Mandal, Saptarshi;Sarkar, Sobhan
    • Safety and Health at Work
    • /
    • 제6권4호
    • /
    • pp.279-288
    • /
    • 2015
  • Background: In this study, the measurement of job stress of electric overhead traveling crane operators and quantification of the effects of operator and workplace characteristics on job stress were assessed. Methods: Job stress was measured on five subscales: employee empowerment, role overload, role ambiguity, rule violation, and job hazard. The characteristics of the operators that were studied were age, experience, body weight, and body height. The workplace characteristics considered were hours of exposure, cabin type, cabin feature, and crane height. The proposed methodology included administration of a questionnaire survey to 76 electric overhead traveling crane operators followed by analysis using analysis of variance and a classification and regression tree. Results: The key findings were: (1) the five subscales can be used to measure job stress; (2) employee empowerment was the most significant factor followed by the role overload; (3) workplace characteristics contributed more towards job stress than operator's characteristics; and (4) of the workplace characteristics, crane height was the major contributor. Conclusion: The issues related to crane height and cabin feature can be fixed by providing engineering or foolproof solutions than relying on interventions related to the demographic factors.

퍼지 결정 트리를 이용한 온라인 필기 문자의 계층적 인식 (An Application of Fuzzy Decision Trees for Hierarchical Recognition of Handwriting Symbols)

  • 전병환;김성훈;김재희
    • 전자공학회논문지B
    • /
    • 제31B권3호
    • /
    • pp.132-140
    • /
    • 1994
  • 온라인 필기 문자 인식 시스템 'SCRIPT(Symbol/Character Recognition In Pen-based Technology)'는 조합 가능한 모든 한글과 영어 대문자, 숫자, 그리고 키보드 부호 등 자연스럽게 필기되는 정자체 문자를 인식하기 위한 알고리듬이다. 필기 문자는 동일인이 쓰더라도 형태의 변화가 다양해서 정보의 불확실성을 지니게 된다. 그런데 기존의 결정 트리(decision tree)를 이용한 특징 분석 방법(feature analysis approach)은 효율적이지만 필기의 변형에 약하여 잘못된 선택을 하기 쉽기 때문에, 이러한 단점을 보완할 수 있는 방법이 필요하다. 이 논문에서는 패턴의 계층적(hierarchical)특성에 맞추어 획 자체의 형태와 획간의 위치 관계를 파악하기 위한 두 단계의 퍼지 결정 트리(fuzzy decision trees)를 사용하여 문자 패턴의 특징을 분석하는 방법을 제안한다. 이러한 방법은 다양한 가능성을 저장함으로써 형태의 변형에 강하고 이전의 잘못된 선택을 수정하기 쉬우며, 특히 하위 후보 패턴들에 의한 상위 패턴의 인식률 상승 효과가 매우 크다. 실헌 결과, 한글은 약 91%의 인식률과 약 0.33초의 인식 속도를 나타냈으며, 영어 및 기타 문자는 약 95%의 인식률과 약 0.08초의 인식 속도를 보였다. 이는 퍼지 결정 트리를 적용하지 않은 겨우에 비하여 인식률이 8~18% 정도 향상된 것이다.

  • PDF

이동 객체 데이타베이스에서 KDB-tree의 동적 분할 정책 (The Dynamic Split Policy of the KDB-Tree in Moving Objects Databases)

  • 임덕성;이창헌;홍봉희
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제33권4호
    • /
    • pp.396-408
    • /
    • 2006
  • 시간의 흐름에 따라 누적되는 대용량의 과거 위치를 관리하는 이동 객체 데이타베이스에서 이동 객체의 과거 위치를 효율적으로 검색하기 위해서는 이동 객체의 특성을 고려한 색인 구조가 필요하다. 그러나, 영역 질의 성능이 우수한 다차원 색인인 KDB-tree를 이동 객체 데이타베이스에 적용할 경우 시간 도메인이 증가하는 이동 객체 데이타베이스의 특성으로 인해 공간 도메인 가중 분할이 발생한다. 공간 도메인 가중 분할은 하나의 노드가 차지하는 MBR의 공간 영역이 분할 횟수에 반비례하게 감소되어 시공 간 영역 질의 처리시 색인의 검색 비용을 증가시키는 문제가 있다. 이 논문에서는 이동 객체 데이타베이스에서 시공간 영역 질의를 효율적으로 처리하기 위한 KDB-tree의 동적 분할 정책을 제안한다. 동적 분할 정책은 공간 우선 분할 방법을 적용하는 분할 도메인 선정 방법과 포인터 페이지에서 공간 활용도를 최대화시킬 수 있는 최근 시간 분할 정책, 영역 페이지에서 적용되는 최후 시간 분할 정책으로 구성된다. 제안한 동적 분할 정책의 성능을 평가하기 위해 3DR-tree, MV3R-tree, KDB-tree와의 성능을 비교한다. 영역 질의를 위한 성능 평가에서 동적 분할 정책을 적용한 MKDB-tree는 기존 색인에 비해 평균 30% 이상의 노드 접근 회수를 감소시킨다.

A comparison of three design tree based search algorithms for the detection of engineering parts constructed with CATIA V5 in large databases

  • Roj, Robin
    • Journal of Computational Design and Engineering
    • /
    • 제1권3호
    • /
    • pp.161-172
    • /
    • 2014
  • This paper presents three different search engines for the detection of CAD-parts in large databases. The analysis of the contained information is performed by the export of the data that is stored in the structure trees of the CAD-models. A preparation program generates one XML-file for every model, which in addition to including the data of the structure tree, also owns certain physical properties of each part. The first search engine is specializes in the discovery of standard parts, like screws or washers. The second program uses certain user input as search parameters, and therefore has the ability to perform personalized queries. The third one compares one given reference part with all parts in the database, and locates files that are identical, or similar to, the reference part. All approaches run automatically, and have the analysis of the structure tree in common. Files constructed with CATIA V5, and search engines written with Python have been used for the implementation. The paper also includes a short comparison of the advantages and disadvantages of each program, as well as a performance test.

Movement Pattern Recognition of Medaka for an Insecticide: A Comparison of Decision Tree and Neural Network

  • Kim, Youn-Tae;Park, Dae-Hoon;Kim, Sung-Shin
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제7권1호
    • /
    • pp.58-65
    • /
    • 2007
  • Behavioral sequences of the medaka (Oryzias latipes) were continuously investigated through an automatic image recognition system in response to medaka treated with the insecticide and medaka not treated with the insecticide, diazinon (0.1 mg/l) during a 1 hour period. The observation of behavior through the movement tracking program showed many patterns of the medaka. After much observation, behavioral patterns were divided into four basic patterns: active-smooth, active-shaking, inactive-smooth, and inactive-shaking. The "smooth" and "shaking" patterns were shown as normal movement behavior. However, the "shaking" pattern was more frequently observed than the "smooth" pattern in medaka specimens that were treated with insecticide. Each pattern was classified using classification methods after the feature choice. It provides a natural way to incorporate prior knowledge from human experts in fish behavior and contains the information in a logical expression tree. The main focus of this study was. to determine whether the decision tree could be useful for interpreting and classifying behavior patterns of the medaka.

Environmental Factors Affecting Establishment and Expansion of the Invasive Alien Species of Tree of Heaven (Ailanthus altissima) in Seoripool Park, Seoul

  • Lee, Han-Wool;Lee, Chang-Seok
    • Animal cells and systems
    • /
    • 제10권1호
    • /
    • pp.27-40
    • /
    • 2006
  • Tree of heaven (Ailanthus altissima Swingle) as an invasive alien plant, appeared usually in the disturbed locations such as road-side, incised slope, and trampling path-side. They appeared abundantly in the trampling pathside but they did not appear or were rare in the interior of forest. Density and importance value of tree of heaven were proportionate to the relative light intensity measured according to distance from the trampling path toward forest interior and closely related to the breadth of trampling path as well. They were associated with annual, other exotic species or ruderal plants well. Distributional pattern of mature trees of them in the study area and its surrounding environments implied that they were introduced intentionally. Size class distribution of them showed that they are in expansion and artificial interferences such as, installing physical training space and developing hiking course functioned as trigger factors in their invasion and expansion. The results support the facts known generally in relation to invasion and expansion of the invasive alien plants. In this viewpoint, we suggest a management plan that applies ecological restoration principles to address ecosystems infected with tree of heaven by restoring the integral feature of the degraded nature and conserving the remained nature more thoroughly.

Content-Based Indexing and Retrieval in Large Image Databases

  • Cha, Guang-Ho;Chung, Chin-Wan
    • Journal of Electrical Engineering and information Science
    • /
    • 제1권2호
    • /
    • pp.134-144
    • /
    • 1996
  • In this paper, we propose a new access method, called the HG-tree, to support indexing and retrieval by image content in large image databases. Image content is represented by a point in a multidimensional feature space. The types of queries considered are the range query and the nearest-neighbor query, both in a multidimensional space. Our goals are twofold: increasing the storage utilization and decreasing the area covered by the directory regions of the index tree. The high storage utilization and the small directory area reduce the number of nodes that have to be touched during the query processing. The first goal is achieved by absorbing splitting if possible, and when splitting is necessary, converting two nodes to three. The second goal is achieved by maintaining the area occupied by the directory region minimally on the directory nodes. We note that there is a trade-off between the two design goals, but the HG-tree is so flexible that it can control the trade-off. We present the design of our access method and associated algorithms. In addition, we report the results of a series of tests, comparing the proposed access method with the buddy-tree, which is one of the most successful point access methods for a multidimensional space. The results show the superiority of our method.

  • PDF

Automatic Detection of Dead Trees Based on Lightweight YOLOv4 and UAV Imagery

  • Yuanhang Jin;Maolin Xu;Jiayuan Zheng
    • Journal of Information Processing Systems
    • /
    • 제19권5호
    • /
    • pp.614-630
    • /
    • 2023
  • Dead trees significantly impact forest production and the ecological environment and pose constraints to the sustainable development of forests. A lightweight YOLOv4 dead tree detection algorithm based on unmanned aerial vehicle images is proposed to address current limitations in dead tree detection that rely mainly on inefficient, unsafe and easy-to-miss manual inspections. An improved logarithmic transformation method was developed in data pre-processing to display tree features in the shadows. For the model structure, the original CSPDarkNet-53 backbone feature extraction network was replaced by MobileNetV3. Some of the standard convolutional blocks in the original extraction network were replaced by depthwise separable convolution blocks. The new ReLU6 activation function replaced the original LeakyReLU activation function to make the network more robust for low-precision computations. The K-means++ clustering method was also integrated to generate anchor boxes that are more suitable for the dataset. The experimental results show that the improved algorithm achieved an accuracy of 97.33%, higher than other methods. The detection speed of the proposed approach is higher than that of YOLOv4, improving the efficiency and accuracy of the detection process.

퍼지 k-Nearest Neighbors 와 Reconstruction Error 기반 Lazy Classifier 설계 (Design of Lazy Classifier based on Fuzzy k-Nearest Neighbors and Reconstruction Error)

  • 노석범;안태천
    • 한국지능시스템학회논문지
    • /
    • 제20권1호
    • /
    • pp.101-108
    • /
    • 2010
  • 본 논문에서는 퍼지 k-NN과 reconstruction error에 기반을 둔 feature selection을 이용한 lazy 분류기 설계를 제안하였다. Reconstruction error는 locally linear reconstruction의 평가 지수이다. 새로운 입력이 주어지면, 퍼지 k-NN은 local 분류기가 유효한 로컬 영역을 정의하고, 로컬 영역 안에 포함된 데이터 패턴에 하중 값을 할당한다. 로컬 영역과 하중 값을 정의한 우에, feature space의 차원을 감소시키기 위하여 feature selection이 수행된다. Reconstruction error 관점에서 우수한 성능을 가진 여러 개의 feature들이 선택 되어 지면, 다항식의 일종인 분류기가 하중 최소자승법에 의해 결정된다. 실험 결과는 기존의 분류기인 standard neural networks, support vector machine, linear discriminant analysis, and C4.5 trees와 비교 결과를 보인다.

그래프 분류 기반 특징 선택을 활용한 작물 수확량 예측 (Crop Yield Estimation Utilizing Feature Selection Based on Graph Classification)

  • 옴마킨;이성근
    • 한국전자통신학회논문지
    • /
    • 제18권6호
    • /
    • pp.1269-1276
    • /
    • 2023
  • 작물 수확량 예측은 토양, 비, 기후, 대기 및 이들의 관계와 같은 다양한 측면으로 인해 다국적 식사와 강력한 수요에 필수적이며, 기후 변화는 농업 생산량에 영향을 미친다. 본 연구에서는 온도, 강수량, 습도 등의 데이터 세트를 운영한다. 현재 연구는 농부와 농업인을 지원하기 위해 다양한 분류기를 사용한 기능 선택에 중점을 두고 있다. 특징 선택 접근법을 활용한 작물 수확량 추정은 96% 정확도를 나타내었다. 특징 선택은 기계학습 모델의 성능에 영향을 미친다. 현재 그래프 분류기의 성능은 81.5%를 나타내며, 특징 선택이 없는 Random Forest 회귀 분석은 78%의 정확도를 나타냈다. 또한, 특징 선택이 없는 의사결정 트리 회귀 분석은 67%의 정확도를 유지하였다. 본 논문은 제시된 10가지 알고리즘을 대상으로 특징 선택 중요성에 대한 실험결과를 나타내었다. 이러한 결과는 작물 분류 연구에 적합한 모델을 선택하는 데 도움이 될 것으로 기대된다.