• 제목/요약/키워드: Data Path

검색결과 3,954건 처리시간 0.033초

조선소 근로자의 근골격계 질환과 관련 요인 간의 경로 분석 (A Path Analysis of Musculoskeletal Disases and Related Factors in Shipbuilding Workers)

  • 박은영;김원호
    • 한국전문물리치료학회지
    • /
    • 제15권3호
    • /
    • pp.53-61
    • /
    • 2008
  • The purpose of this study was to examine the path analysis of factors related to musculoskeletal diseases of shipbuilding workers by considering related factors synthetically. The survey was completed by 1,536 shipbuilding workers and except for poor responses, 1,532 were analyzed. The survey consisted of questions about lifestyle, duration of service, physical and mental stress, and musculoskeletal diseases. The collected data was analyzed with SPSS/PC+ (a descriptive statistics program) and with AMOS 4.0 (a statistical program for path modeling) to test whether the hypothesized path model fitted the collected data. The results of the correlation analysis showed that musculoskeletal disease was associated with duration of service (r=-.095), physical stress (r=.077), and mental stress (r=.602). The results of the hypothesized path model satisfied the criteria required in relation to fitting the collected data. Musculoskeletal disease was directly affected by mental stress but not by physical stress, duration of service and life style. Thus, it is suggested that reducing mental stress is a strategy for the prevention for musculoskeletal disease.

  • PDF

Stability-based On-demand Multi-path Distance Vector Protocol for Edge Internet of Things

  • Dongzhi Cao;Peng Liang;Tongjuan Wu;Shiqiang Zhang;Zhenhu Ning
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권10호
    • /
    • pp.2658-2681
    • /
    • 2023
  • In edge computing scenarios, IoT end devices play a crucial role in relaying and forwarding data to significantly improve IoT network performance. However, traditional routing mechanisms are not applicable to this scenario due to differences in network size and environment. Therefore, it becomes crucial to establish an effective and reliable data transmission path to ensure secure communication between devices. In this paper, we propose a trusted path selection strategy that comprehensively considers multiple attributes, such as link stability and edge cooperation, and selects a stable and secure data transmission path based on the link life cycle, energy level, trust level, and authentication status. In addition, we propose the Stability-based On-demand Multipath Distance Vector (STAOMDV) protocol based on the Ad hoc AOMDV protocol. The STAOMDV protocol implements the collection and updating of link stability attributes during the route discovery and maintenance process. By integrating the STAOMDV protocol with the proposed path selection strategy, a dependable and efficient routing mechanism is established for IoT networks in edge computing scenarios. Simulation results validate that the proposed STAOMDV model achieves a balance in network energy consumption and extends the overall network lifespan.

모바일 싱크를 갖는 무선 센서 네트워크에서 효율적인 데이터 전송경로 유지 방법 (An Efficient Path Maintaining Scheme in the Grid Based Wireless Sensor Networks with a Mobile Sink Node)

  • 윤영섭;조성현;박성한
    • 대한전자공학회논문지TC
    • /
    • 제47권8호
    • /
    • pp.53-60
    • /
    • 2010
  • 본 논문은 무선센서 망에서 소스 노드와 모바일 싱크 노드 간 데이터 전송경로를 효율적으로 관리하는 방법을 제안한다. 제안하는 방법은 최단거리 전송경로를 보장하며, 기존에 형성되었던 경로를 최대한 이용함으로써 경로재설정을 위한 비용을 줄일 수 있다. 실험 결과는 제안하는 방법이 기존 대표적 경로재설정 방법인 CODE와 EADA에 비해 경로 재설정 비용을 약 60% 감소시켰음을 보여준다.

확장 칼만 필터와 경로계획을 이용한 쿼드로터 실외 위치 추정 (Outdoor Localization for a Quad-rotor using Extended Kalman Filter and Path Planning)

  • 김기정;이동주;김윤기;이장명
    • 제어로봇시스템학회논문지
    • /
    • 제20권11호
    • /
    • pp.1175-1180
    • /
    • 2014
  • This paper proposes a new technique that produces improved local information using a low-cost GPS/INS system combined with Extended Kalman Filter and Path Planning when a Quad-rotor flies. In the research, a low-cost GPS is combined with INS by Extended Kalman Filter to improve local information. However, this system has disadvantages in that estimation accuracy is getting worsens when the Quad-rotor flies through the air in a curve and precision of location information is influenced by performance of the used GPS. An algorithm based on Path Planning is adopted to deal with these weaknesses. When the Quad-rotor flies outdoors, a short moving path can be predicted because all short moving paths of quad-rotor can be assumed to be straight. Path planning is used to make the short moving path and determine the closest local information of data of the GPS/INS system to location determined by path planning. Through the foregoing process, improved local data is obtained when the quad-rotor flies, and the performance of the proposed system is verified from various outdoor experiments.

통신 품질 향상을 위한 최단 시간 경로 알고리즘 (Quickest Path Algorithm for Improving Quality of Services in Communication Networks)

  • 윤석환;김평중;김진수
    • 품질경영학회지
    • /
    • 제26권1호
    • /
    • pp.192-200
    • /
    • 1998
  • The quickest path problem is one of the important things for quality of services in communication networks. It is to find a path to send a given amount of data from the source to the sink with minimum transmission time, where the transmission time is dependent on both the capacities and the traversal times of the arcs in the network. This is found under the networks that the capacity and the lead time of each ring are predetermined. It is general to solve the quickest path problem using shortest path algorithms. The relevant algorithms proposed till now are based on the capacity of rings in distributed environments. When the configuration of networks is changed, there can be two a, pp.oaches to find the quickest paths. The one is to find new quickest paths, and the other is to update the current quickest paths. As one of the algorithms for the latter, the distributed quickest path update algorithm was proposed. This paper aims to propose the distributed algorithm a, pp.icable to find the quickest path, when the configuration of networks is changed, using the quickest path tree update altorithm, and to verify its possibility of a, pp.ication by analyzing the transmission amount of data from one node to another from the theoretical point of view.

  • PDF

이동 경로 데이터에 기반한 이동 객체의 시공간 위치 예측 기법 (A Spatiotemporal Location Prediction Method of Moving Objects Based on Path Data)

  • 윤태복;박교현;이지형
    • 한국지능시스템학회논문지
    • /
    • 제16권5호
    • /
    • pp.568-574
    • /
    • 2006
  • 사용자에게 적응된 서비스를 제공하기 위하여 환경으로부터 얻어지는 다양한 형태의 데이터를 이용한 다양한 방법이 연구되고 있다. 그 중 과거 이동 경로 자료는 사용자의 현재 이동 위치를 예측하고 이와 관련된 서비스를 제공하는데 유용하게 사용될 수 있다. 본 논문에서는 사용자의 과거 이동 경로의 분석을 통하여 이동중인 사용자의 시공간 위치예측 기술을 제안한다. 환경으로부터 발생한 사용자의 이동 경로를 수집하고, 수집된 데이터에서 이동 경로 선택(Path Selection) 방법을 이용한다. 이동 경로 선택 방법은 이동 중에 발생한 경로의 거리, 시간, 방향의 요소와 동적정합법을 사용하여 유사성(Similarity)을 측정하며 유사성이 가장 높은 경로를 선택한다. 선택된 경로는 시간에 따른 공간 정보 및 위치에 따른 시간 예측 서비스를 위하여 사용가능 하며, 실험을 통하여 유사성이 높은 이동 경로를 선택하는 모습을 확인하였다.

Path planning for autonomous lawn mower tractor

  • Song, Mingzhang;Kabir, Md. Shaha Nur;Chung, Sun-Ok;Kim, Yong-Joo;Ha, Jong-Kyou;Lee, Kyeong-Hwan
    • 농업과학연구
    • /
    • 제42권1호
    • /
    • pp.63-71
    • /
    • 2015
  • Path planning is an essential part for traveling and mowing of autonomous lawn mower tractors. Objectives of the paper were to analyze operation patterns by a skilled farmer, to extract and optimize waypoints, and to demonstrate generation of formatted planned path for autonomous lawn mower tractors. A 27-HP mower tractor was operated by a skilled farmer on grass fields. To measure tractor travel and operation characteristics, an RTK-GPS antenna with a 6-cm RMS error, an inertia motion sensing unit, a gyro compass, a wheel angle sensor, and a mower on/off sensor were mounted on the mower tractor, and all the data were collected at a 10-Hz rate. All the sensor data were transferred through a software program to show the status immediately on the notebook. Planned path was generated using the program parameter settings, mileage and time calculations, and the travel path was plotted using developed software. Based on the human operation patterns, path planning algorithm was suggested for autonomous mower tractor. Finally path generation was demonstrated in a formatted file and graphic display. After optimizing the path planning, a decrease in distance about 13% and saving of the working time about 30% was achieved. Field test data showed some overlap, especially in the turning areas. Results of the study would be useful to implement an autonomous mower tractor, but further research needs to improve the performance.

XML 데이타 색인을 위한 경로 분할 기법 (A Path Partitioning Technique for Indexing XML Data)

  • 김종익;김형주
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제31권3호
    • /
    • pp.320-330
    • /
    • 2004
  • XML에 대한 질의 언어는 데이타 그래프 내의 경로를 이용하여 질의를 표현한다. 특히, 경로에 패턴 (예를 들어, 정규식)을 사용함으로써, 데이타의 구조를 정확히 알지 못하더라도 질의가 가능하도록 한다. 이때, 패턴을 이용하는 질의는 데이타 그래프의 탐색범위를 크게 넓히게 된다. 기존의 XML색인 기법은 질의의 탐색범위를 줄이기 위해 데이타 그래프 내의 서로 동일한 경로들을 하나로 묶어 작은 크기의 색인 그래프를 생성하는 방법을 이용한다. 하지만 이러한 색인들은 많은 경우 색인의 크기가 데이터 그래프의 크기만큼 증가하게 되어 질의의 탐색범위를 줄이지 못하고, 따라서 효율적인 질의 처리를 보장하지 못한다. 본 논문에서는 데이타 내에 존재하는 모든 경로를 분할(partitioning)하고 질의 처리 시 질의에 맞는 분할 영역을 빠르게 찾아낼 수 있는 색인 그래프를 제안한다. 본 논문에서 제안하는 색인 그래프는 데이터 그래프의 크기와 상관없이 색인 그래프의 크기를 조절할 수 있다. 따라서 색인 그래프의 크기를 작게 구성함으로써 색인 그래프 탐색 비용을 크게 줄일 수 있다. 본 논문에서는, 실험을 통해 기존의 그래프 기반색인 기법들보다 본 논문의 색인 기법이 보다 효율적임을 보이고 색인의 크기 변화에 따른 성능 변화에 대해 알아본다.

Vulnerable Path Attack and its Detection

  • She, Chuyu;Wen, Wushao;Ye, Quanqi;Zheng, Kesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권4호
    • /
    • pp.2149-2170
    • /
    • 2017
  • Application-layer Distributed Denial-of-Service (DDoS) attack is one of the leading security problems in the Internet. In recent years, the attack strategies of application-layer DDoS have rapidly developed. This paper introduces a new attack strategy named Path Vulnerabilities-Based (PVB) attack. In this attack strategy, an attacker first analyzes the contents of web pages and subsequently measures the actual response time of each webpage to build a web-resource-weighted-directed graph. The attacker uses a Top M Longest Path algorithm to find M DDoS vulnerable paths that consume considerable resources when sequentially accessing the pages following any of those paths. A detection mechanism for such attack is also proposed and discussed. A finite-state machine is used to model the dynamical processes for the state of the user's session and monitor the PVB attacks. Numerical results based on real-traffic simulations reveal the efficiency of the attack strategy and the detection mechanism.

복합형상 및 다중경로에 대한 Exit Burr 판별 알고리듬의 개발- 스플라인을 포함한 Exit Burr의 해석 - (Development of Exit Burr Identification Algorithm on Multiple Feature Workpiece and Multiple Tool Path)

  • 김지환;이장범;김영진
    • 산업공학
    • /
    • 제18권3호
    • /
    • pp.247-252
    • /
    • 2005
  • In the automated production environment in the present days, the minimization of manual operation becomes a very important factor in increasing the efficiency of the production system. The exit burr produced through the milling operation on the edge of workpiece usually requires manual deburring process to enhance the level of precision of the resulting product. So far, researchers have developed various methods to understand the formation of exit burr in cutting process. One method to analytically identify the formation of exit burr was to use the geometrical information of CAD and CAM data used in automated machining. This method, in turn, generated the information resulting from the analysis such as burr type, cutting region, and exit angle. Up to now, the geometrical data were restricted to the single feature and single path. In this paper, a method to deal with the complicated geometric features such as line segment, arc, hole, and spline will be presented and validated using the field data. This method also deals with the complex workpiece shape which is a combination of multiple features. As for the cutting path, multiple tool path is analyzed in order to simulate the real cutting process. All this analysis is combined into a Windows based software and real data are used to validate the program in the conclusion.