• Title/Summary/Keyword: Neighbor conditions

Search Result 94, Processing Time 0.028 seconds

Localization algorithm by using location error compensation through topology constructions (토폴로지 구축을 통한 측정 오차 보정 기반의 위치인식 기법)

  • You, Jin-Ho;Kwon, Young-Goo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.9
    • /
    • pp.2243-2250
    • /
    • 2014
  • In wireless sensor networks(WSNs), geographical routing algorithms can enhance the network capacity. However, in real WSNs, it is difficult for each node to know its physical location accurately. Especially, indoor environments contain various obstacles such as concrete wall, furniture which cause non-line-of-sight(NLOS) conditions. To solve the problem, we propose location error compensation algorithm by using two difference topology constructions. First topology is based on mobile node's location which is obtained from anchor nodes. Second topology is based on mutual distance from neighbor nodes. The proposed algorithm efficiently detects and corrects the location errors and significantly enhances the network performance of geographic routing in the presence of location errors.

Concurrent Mapping and Localization using Range Sonar in Small AUV, SNUUVI

  • Hwang Arom;Seong Woojae;Choi Hang Soon;Lee Kyu Yuel
    • Journal of Ship and Ocean Technology
    • /
    • v.9 no.4
    • /
    • pp.23-34
    • /
    • 2005
  • Increased usage of AUVs has led to the development of alternative navigational methods that use the acoustic beacons and dead reckoning. This paper describes a concurrent mapping and localization (CML) scheme that uses range sonars mounted on SNUUV­I, which is a small test AUV developed by Seoul National University. The CML is one of such alternative navigation methods for measuring the environment that the vehicle is passing through. In addition, it is intended to provide relative position of AUV by processing the data from sonar measurements. A technique for CML algorithm which uses several ranging sonars is presented. This technique utilizes an extended Kalman filter to estimate the location of the AUV. In order for the algorithm to work efficiently, the nearest neighbor standard filter is introduced as the algorithm of data association in the CML for associating the stored targets the sonar returns at each time step. The proposed CML algorithm is tested by simulations under various conditions. Experiments in a towing tank for one dimensional navigation are conducted and the results are presented. The results of the simulation and experiment show that the proposed CML algorithm is capable of estimating the position of the vehicle and the object and demonstrates that the algorithm will perform well in the real environment.

Optimizing shallow foundation design: A machine learning approach for bearing capacity estimation over cavities

  • Kumar Shubham;Subhadeep Metya;Abdhesh Kumar Sinha
    • Geomechanics and Engineering
    • /
    • v.37 no.6
    • /
    • pp.629-641
    • /
    • 2024
  • The presence of excavations or cavities beneath the foundations of a building can have a significant impact on their stability and cause extensive damage. Traditional methods for calculating the bearing capacity and subsidence of foundations over cavities can be complex and time-consuming, particularly when dealing with conditions that vary. In such situations, machine learning (ML) and deep learning (DL) techniques provide effective alternatives. This study concentrates on constructing a prediction model based on the performance of ML and DL algorithms that can be applied in real-world settings. The efficacy of eight algorithms, including Regression Analysis, k-Nearest Neighbor, Decision Tree, Random Forest, Multivariate Regression Spline, Artificial Neural Network, and Deep Neural Network, was evaluated. Using a Python-assisted automation technique integrated with the PLAXIS 2D platform, a dataset containing 272 cases with eight input parameters and one target variable was generated. In general, the DL model performed better than the ML models, and all models, except the regression models, attained outstanding results with an R2 greater than 0.90. These models can also be used as surrogate models in reliability analysis to evaluate failure risks and probabilities.

The Influence of the Foreign Infringement to the Maritime Economic Sovereignty upon the Rise of Modern Piracy (외세의 '경제 해양주권' 침해가 현대 해적행위 부상에 미치는 영향 : 소말리아, 예멘, 나이지리아 사례를 중심으로)

  • Jung, Man-sup
    • Maritime Security
    • /
    • v.1 no.1
    • /
    • pp.175-214
    • /
    • 2020
  • Previous studies cannot effectively explain the rise of piracy in Somalia and NIgeria. First, there is a lack of explanation for the process that from a small maritime robbery into a org anized pirate g roup. Second, it is difficult to explain the low level of piracy in countries with extreamly poor conditions, from Somalia to Nigeria. In this study, I argue that the more severe foreign countries infringe on economic maritime sovereignty in vulnerable countries, the higher the intensity and frequency of piracy. If the infringement of economic maritime sovereignty caused by foreign groups occurs in a fragile state, the government could not respond to the acts of foreign groups, resulting in increased damage to maritime people, deteriorating the regional economic situation. As hostility grows, a culture favorable to piracy is created, which is actively utilized by local forces to inspire the people's hostility, and a favorable environment for piracy emerges in a way that responds politically to foreign powers. In Somalia and Nigeria, the infringement of economic maritime sovereignty by foreign groups emerged severe. And based on the stagnation of the local economy and hostility toward foreign groups, favorable conditions were formed for piracy, resulting in the rise of piracy. Meanwhile, Somalia's neighbor, one of the most fragile states in the world, Yemen have not suffered piracy. Also, the foreign infringement to the maritime economic sovereignty has rarely been observed.

  • PDF

Determination of the stage and grade of periodontitis according to the current classification of periodontal and peri-implant diseases and conditions (2018) using machine learning algorithms

  • Kubra Ertas;Ihsan Pence;Melike Siseci Cesmeli;Zuhal Yetkin Ay
    • Journal of Periodontal and Implant Science
    • /
    • v.53 no.1
    • /
    • pp.38-53
    • /
    • 2023
  • Purpose: The current Classification of Periodontal and Peri-Implant Diseases and Conditions, published and disseminated in 2018, involves some difficulties and causes diagnostic conflicts due to its criteria, especially for inexperienced clinicians. The aim of this study was to design a decision system based on machine learning algorithms by using clinical measurements and radiographic images in order to determine and facilitate the staging and grading of periodontitis. Methods: In the first part of this study, machine learning models were created using the Python programming language based on clinical data from 144 individuals who presented to the Department of Periodontology, Faculty of Dentistry, Süleyman Demirel University. In the second part, panoramic radiographic images were processed and classification was carried out with deep learning algorithms. Results: Using clinical data, the accuracy of staging with the tree algorithm reached 97.2%, while the random forest and k-nearest neighbor algorithms reached 98.6% accuracy. The best staging accuracy for processing panoramic radiographic images was provided by a hybrid network model algorithm combining the proposed ResNet50 architecture and the support vector machine algorithm. For this, the images were preprocessed, and high success was obtained, with a classification accuracy of 88.2% for staging. However, in general, it was observed that the radiographic images provided a low level of success, in terms of accuracy, for modeling the grading of periodontitis. Conclusions: The machine learning-based decision system presented herein can facilitate periodontal diagnoses despite its current limitations. Further studies are planned to optimize the algorithm and improve the results.

Pattern Analysis for Urban Spatial Distribution of Traffic Accidents in Jinju (진주시 교통사고의 도시공간분포패턴 분석)

  • Sung, Byeong Jun;Yoo, Hwan Hee
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.22 no.3
    • /
    • pp.99-105
    • /
    • 2014
  • Since traffic accidents account for the highest proportion of the artificial disasters which occur in urban areas along with fire, more scientific an analysis on the causes of traffic accidents and various prevention measures against traffic accidents are needed. In this study, the research selected Jinju-si, which belongs to local small and medium-sized cities as a research target to analyze the characteristics of temporal and spacial distribution of traffic accidents by associating the data of traffic accidents, occurred in 2013 with the causes of traffic accidents and location information that includes occurrence time and seasonal features. It subsequently examines the spatial correlation between traffic accidents and the characteristics of urban space development according to the plans of land using. As a result, the characteristics of accident distribution according to the types of accidents reveal that side right-angle collisions (car versus car) and pedestrian-crossing accident (car versus man) showed the highest clustering in the density analysis and average nearest neighbor analysis. In particular, traffic accidents occurred the most on roads which connect urban central commercial areas, high-density residential areas, and industrial areas. In addition, human damage in damage conditions, clear day in weather condition, dry condition in the road condition, and three-way intersection in the road way showed the highest clustering.

A Study on the Readaptation of the Women Who have Engaged in Prostitution - A Grounded Theory Approach - (탈성매매여성들의 사회적응에 대한 연구 - 근거이론 방법 접근 -)

  • Kim, Young-sook;Lee, Keun-moo;An, Jun-ri
    • Korean Journal of Social Welfare Studies
    • /
    • no.37
    • /
    • pp.429-455
    • /
    • 2008
  • The purpose of this study is to generate a substantive theory that accounts for the social readaptation of the women who have engaged in prostitution and propose a practical program for them. We used the grounded theory developed by Strauss and Corbin(1990). Raw data were collected through the in-depth interview, documents and observation. We used constant comparative method for the data analysis. The nine women who had the exprience of prostitution have participated in this study. As a result of the data analysis, in open coding were generated 116 concepts, 29 subcategories and 12 categories, In axial coding the outcomes of a paradigm model were as follows. The causal conditions were named 'hostile environment' and 'the self endowed stigma'. The phenomenon turned out to be 'living as an anonymous being'. The contextual conditions were named 'cohesion of family', 'being pushed' and 'shrinked emotion'. The intervening conditions were presented to be 'desire of self restoration as a social being', 'reactionary reconstruction'. The action/interaction strategies turned out to be 'shifting of social status', 'neighbor alliance'. The consequences were presented to be 'psychological wayfarer' and 'tentacular living'. In selective coding we found a core category, 'repetition of leaving and returning from the life world'. Based on the phenomenon, two types of participants life attitudes were found as follows : present hesitating type, self concealing type. Following the adove results, We finally suggested the need to develope a community oriented case management model.

Optimization of field Application Conditions of the Multistage Convergent Photographing Technique for the Measurement of Joint Orientation on Rock Slope (암반사면 절리의 방향성 측정을 위한 수렴다중촬영기법의 현장 적용성 연구)

  • Kim, Jong-Hoon;Kim, Jae-Dong
    • Tunnel and Underground Space
    • /
    • v.19 no.1
    • /
    • pp.31-42
    • /
    • 2009
  • One set of hardware system of guide point method (GP method), modified from the multistage convergent photographing technique, was developed to interpret the geometrical characteristics of Joints photogrammetrically on rock slope. Before the field application of the hardware system, the level of errors and constraints that ran be acceptable in the field measurement has been severely investigated in the laboratory and the optimum photographing scheme was analyzed. The range of the most suitable convergence angle between two cameras was $25^{\circ}{\sim}150^{\circ}$ and the photographing distance was about 5.5 m when using a 2 M pixel digital camera. An extended analyzing technique, which was newly developed in this study, was applied to the field measurement to magnify the benefits of GP method. This technique can be applied when survey for the wide range of rock surface is necessary. The global coordinates of ground control points for the neighbor photographing area ran be introduced without any preparation from the previous photographed area using this technique. It could reduce phographing time in the field.

Experiments of Unmanned Underwater Vehicle's 3 Degrees of Freedom Motion Applied the SLAM based on the Unscented Kalman Filter (무인 잠수정 3자유도 운동 실험에 대한 무향 칼만 필터 기반 SLAM기법 적용)

  • Hwang, A-Rom;Seong, Woo-Jae;Jun, Bong-Huan;Lee, Pan-Mook
    • Journal of Ocean Engineering and Technology
    • /
    • v.23 no.2
    • /
    • pp.58-68
    • /
    • 2009
  • The increased use of unmanned underwater vehicles (UUV) has led to the development of alternative navigational methods that do not employ acoustic beacons and dead reckoning sensors. This paper describes a simultaneous localization and mapping (SLAM) scheme that uses range sonars mounted on a small UUV. A SLAM scheme is an alternative navigation method for measuring the environment through which the vehicle is passing and providing the relative position of the UUV. A technique for a SLAM algorithm that uses several ranging sonars is presented. This technique utilizes an unscented Kalman filter to estimate the locations of the UUV and surrounding objects. In order to work efficiently, the nearest neighbor standard filter is introduced as the data association algorithm in the SLAM for associating the stored targets returned by the sonar at each time step. The proposed SLAM algorithm was tested by experiments under various three degrees of freedom motion conditions. The results of these experiments showed that the proposed SLAM algorithm was capable of estimating the position of the UUV and the surrounding objects and demonstrated that the algorithm will perform well in various environments.

Pre-Computation Based Selective Probing (PCSP) Scheme for Distributed Quality of Service (QoS) Routing with Imprecise State Information

  • Lee Won-Ick;Lee Byeong-Gi
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.70-84
    • /
    • 2006
  • We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.