• Title/Summary/Keyword: 확률적 거리함수

Search Result 60, Processing Time 0.023 seconds

Characterization of Ecological Networks on Wetland Complexes by Dispersal Models (분산 모형에 따른 습지경관의 생태 네트워크 특성 분석)

  • Kim, Bin;Park, Jeryang
    • Journal of Wetlands Research
    • /
    • v.21 no.1
    • /
    • pp.16-26
    • /
    • 2019
  • Wetlands that provide diverse ecosystem services, such as habitat provision and hydrological control of flora and fauna, constitute ecosystems through interaction between wetlands existing in a wetlandscape. Therefore, to evaluate the wetland functions such as resilience, it is necessary to analyze the ecological connectivity that is formed between wetlands which also show hydrologically dynamic behaviors. In this study, by defining wetlands as ecological nodes, we generated ecological networks through the connection of wetlands according to the dispersal model of wetland species. The characteristics of these networks were then analyzed using various network metrics. In the case of the dispersal based on a threshold distance, while a high local clustering is observed compared to the exponential dispersal kernel and heavy-tailed dispersal model, it showed a low efficiency in the movement between wetlands. On the other hand, in the case of the stochastic dispersion model, a low local clustering with high efficiency in the movement was observed. Our results confirmed that the ecological network characteristics are completely different depending on which dispersal model is chosen, and one should be careful on selecting the appropriate model for identifying network properties which highly affect the interpretation of network structure and function.

Performance Analysis of Random Resource Selection in LTE D2D Discovery (LTE D2D 디스커버리에서 무작위 자원 선택 방법에 대한 성능 분석)

  • Park, Kyungwon;Kim, Joonyoung;Jeong, Byeong Kook;Lee, Kwang Bok;Choi, Sunghyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.3
    • /
    • pp.577-584
    • /
    • 2017
  • Long Term Evolution device-to-device (LTE D2D) is a key technology to mitigate data traffic load in a cellular system. It facilitates direct data exchange between neighboring users, which is preceded by D2D discovery. Each device advertises its presence to neighboring devices by broadcasting its discovery message. In this paper, we develop a mathematical analysis to assess the probability that discovery messages are successfully transmitted at the D2D discovery stage. We make use of stochastic geometry for modeling spatial statistics of nodes in a two dimensional space. It reflects signal to noise plus interference ratio (SINR) degradation due to resource collision and in-band emission, which leads to the discovery message reception probability being modeled as a function of the distance between the transmitter and the receiver. Numerical results verify that the newly developed analysis accurately estimates discovery message reception probabilities of nodes at the D2D discovery stage.

An explicit solution of residence time distribution for analyzing one-dimensional solute transport in streams (하천에서 1차원 오염물질 거동 해석을 위한 정체시간분포의 양해적 해석해)

  • Byunguk Kim;Siyoon Kwon;Il Won Seo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.518-518
    • /
    • 2023
  • 자연하천에서 오염물질의 혼합 거동은 비균일한 지형학적 요인으로 인해 매우 복잡한 특성을 나타낸다. 일반적으로 오염물질 거동 모델링에서는 수체에서의 혼합을 Fick의 법칙에 따라 유속에 의한 이송과 난류에 의한 확산으로 계산하고, 국부적인 정체현상 등에 의한 non-Fickian 혼합을 야기하는 하천의 특성을 기하학적 지형 형상으로 구현하여 실제 현상에 근접한 혼합 거동을 재현한다. 하지만 계산의 효율성을 위하여 모델링의 차원을 낮추는 경우, 하천의 지형을 경계조건으로 고려할 수 없게 된다. 특히, 1차원 모델링의 경우 하천의 비균일성을 무시하고 1개의 유선으로 간주하며, 이 경우 non-Fickian 물질이동 해석을 위한 추가적인 현상학적 해석이 필요하다. 지난 50년간, non-Fickian 물질이동 해석을 위한 다양한 현상학적 모형이 제시되어 왔다. 하천을 흐름영역과 정체영역으로 구분하고 두 개의 영역 사이의 물질교환 속도를 모델링하거나, Random walk 개념으로 물질이 이동하는 경우와 이동하지 않는 경우를 확률론적으로 모델링하거나, 물질이 정체되었을 때 다시 빠져나오는 시간을 모델링하는 경우가 그 예이다. 본 연구에서는 선행연구에서 제시한 음함수 형태의 현상학적 모형을 기반으로, 수치적 반복계산 없이 상류 경계에서 임의의 형태의 농도곡선(shape-free breakthrough curve)을 갖는 오염물질운(cloud)이 일정 거리를 유하하며 발생하는 변화를 예측할 수 있는 해를 제시한다. 본 연구의 방법론은 추적법(routing procedure)을 활용한 Fickian 혼합 해석, 전달함수(transfer function) 형태의 정체시간분포 해석, 그리고 라플라스 도메인에서의 해석해 유도를 포함한다. 본 연구에서 제시된 해는 2020년 경상북도 김천시에 위치한 감천의 4.5 km 구간에서 수행한 추적자 실험의 현장 자료를 통해 정확도를 검증하여 타당성을 입증하였다.

  • PDF

A Cost-Effective and Accurate COA Defuzzifier Without Multipliers and Dividers (승산기 및 제산기 없는 저비용 고정밀 COA 비퍼지화기)

  • 김대진;이한별;강대성
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.2
    • /
    • pp.70-81
    • /
    • 1998
  • This paper proposes an accurate and cost-effective COA defuzzifier of fuzzy logic controller (FLC). The accuracy of the proposed COA defuzzifier is obtained by involving both membership values and spans of membership functions in calculating a crisp value. The cost-effectiveness of the proposed COA defuzzifier is obtained by replacing the division in the COA defuzzifier by finding an equilibrium point of both the left and right moments. The proposed COA defuzzifier has two disadvantages that it ncreases the hardware complexity due to the additional multipliers and it takes a lot of computation time to find the moment equilibrium point. The first disadvantage is overcome by replacing the multipliers with the stochastic AND operations. The second disadvantage is alleviated by using a coarse-to-fine searching algorithm that accelerates the finding of moment equilibrium point. Application of the proposed COA defuzzifier to the truck backer-upper control problem is performed in the VHDL simulation and the control accuracy of the proposed COA defuzzifier is compared with that of the conventional COA defuzzifier in terms of average tracing distance.

  • PDF

Adaptive prototype generating technique for improving performance of a p-Snake (p-Snake의 성능 향상을 위한 적응 원형 생성 기법)

  • Oh, Seung-Taek;Jun, Byung-Hwan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.4
    • /
    • pp.2757-2763
    • /
    • 2015
  • p-Snake is an energy minimizing algorithm that applies an additional prototype energy to the existing Active Contour Model and is used to extract the contour line in the area where the edge information is unclear. In this paper suggested the creation of a prototype energy field that applies a variable prototype expressed as a combination of circle and straight line primitives, and a fudge function, to improve p-Snake's contour extraction performance. The prototype was defined based on the parts codes entered and the appropriate initial contour was extracted in each primitive zones acquired from the pre-processing process. Then, the primitives variably adjusted to create the prototype and the contour probability based on the distance to the prototype was calculated through the fuzzy function to create the prototype energy field. This was applied to p-Snake to extract the contour from 100 images acquired from various small parts and compared its similarity with the prototype to find that p-Snake made with the adaptive prototype was about 4.6% more precise than the existing Snake method.

Performance Analysis of Coded FSK System for Multi-hop Wireless Sensor Networks (멀티 홉 무선 센서 네트워크를 위한 부호화된 FSK 시스템의 성능 해석)

  • Oh, Kyu-Tae;Roh, Jae-Sung
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.408-414
    • /
    • 2007
  • Research advances in the areas of micro-sensor device and wireless network technology, has made it possible to develop energy efficient and low cost wireless sensor nodes. In this paper, the forward error control (FEC) scheme for lower power consumption and excellent BER(Bit Error Rate) performance during transmission propose in multi-hop wireless sensor network based on FSK modem. The FEC technique uses extra processing power related to encoding and decoding, it is need complex functions to be built into the sensor node. The probability of receiving a correct bit and codeword for relaying a frame over h nodes to the sink node is calculated as a function of channel parameter, number of hops, number of bits transmitted and the distance between the different nodes.

  • PDF

Performance Evaluation of Wireless Network based on Mobile Multi-hop (모바일 다중 홉 기반의 무선 네트워크의 성능 평가)

  • Roh, Jae-Sung;Kim, Wan-Tae
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.6
    • /
    • pp.634-639
    • /
    • 2008
  • In mobile communication networks, the main power consumption is due to the actual transmissions power. Therefore, power efficiency network structures have gained considerable importance in mobile multi-hop systems and networks in recent years. In this paper, the performance of mobile multi-hop wireless system with M-QAM signal and forward error control (FEC) technique are analyzed The FEC technique uses extra processing power related to encoding and decoding, it is need complex functions to be built into the communication node. The probability of receiving a correct bit and codeword for relaying a data frame over h hop relay station to the final station is evaluated as a function of channel parameter and number of hops, and the distance between the different station.

  • PDF

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.278-280
    • /
    • 2012
  • We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.

  • PDF

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.225-232
    • /
    • 2013
  • In this paper, we introduce a method that can be used to select the position of head node for context-awareness information. The validity of the head node optimal location is saving the energy in the path according to the clustering. It is important how to elect one of the relay node for energy efficiency routing. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution during the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. The proposed ECOPS (Energy Conserving Optimal path Schedule) algorithm that contextual information is contributed for head node selection in topology protocols. This proposed algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election technique show improving the entire node lifetime and network in management the network from simulation results.

A Appropriate Flux Generating Conditions for Semiconductor Etching Simulation (반도체 식각 전산모사에 적합한 플럭스 생성 조건)

  • Jeong, Seunghan;Gwun, Oubong;Shin, Seongsik
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.3
    • /
    • pp.105-115
    • /
    • 2015
  • In semiconductor etching simulation, The source modeling for generating plasma species is required. In this paper, we modeled the source of plasma etching process with probability distribution and the feature profile with simple geometry objects, then got the flux on the feature profile. The distance between the source and the cell on the modeling parameters of the source, there are a number of particles to be emitted from a source, there is a number (area of the cell) of the cell on the profile with additional parameters to give the calculation of flux. The flux error ratio on both gaussian(Incident Flux) and cosine probability distribution(Incident Neutral Flux) is much decreased as the number of ray is increased but the processing time is more increased than that. The increase of the number of cell and distance makes increase the flux error ratio and the processing time moderately. In view of the processing time through the experimental results in this paper, it is possible to analogize the calculation of appropriate fluxes.