• Title/Summary/Keyword: 근사분산

Search Result 161, Processing Time 0.032 seconds

Distributed and Range-Free Acoustic Source Localization Techniques in Wireless Sensor Networks (센서네트워크에서 Range-free 기반의 분산 음원위치 판별 기법)

  • You, Young-Bin;Cha, Ho-Jung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11b
    • /
    • pp.571-573
    • /
    • 2005
  • 본 논문에서는 수동형 위치 판별 시스템의 대표적인 음원위치 판별 알고리즘을 제안한다. 제안하는 알고리즘은 무선 센서 네트워크에 최적화 되어있으며, 일반적인 무선 센서 네트워크에서 사용되는 노드와 마이크만 요구되며 추가적인 장비를 필요로 하지 않는다. 제안하는 시스템은 동일한 노드에 분산된 알고리즘을 이용하여 각 노드는 이벤트 발생시에 동적으로 추정 Grid를 생성한 후 이 Grid를 이용하여 추정치를 산정하고 이를 종합하여 최종적으로 2차원 평면에서의 음원의 위치를 판별한다. 제안하는 시스템의 위치판별 알고리즘은 Range-free방식으로 생성된 Grid를 각 노드가 음파를 감지한 시각을 바탕으로 영역별로 근사한다. 시스템은 실제 MicaZ 노드에 구현되었으며 제한된 하드웨어와 자원만을 바탕으로 높은 복잡도를 지니는 음원탐지시스템을 구축하였다.

  • PDF

Query Allocation Method for Efficient Distributed Processing of an Approximate k-Nearest Neighbor Query (효과적인 근사 k-최근접 분산 처리를 위한 질의 할당 기법)

  • Choi, Do-Jiin;Lim, Jong-Tae;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2018.05a
    • /
    • pp.9-10
    • /
    • 2018
  • 모바일 기기의 대중화 및 위치 인식 기술의 발달로 다양한 위치 기반 서비스가 제공되고 있다. 많은 위치 기반 서비스에서는 현재 위치에서 가장 가까운 k개의 아이템을 찾는 k-최근접 질의가 빈번하게 활용되고 있다. 본 논문에서는 효율적인 k-최근접 분산 질의 처리를 질의 할당 기법을 제안한다. 질의 처리 할당을 위해 질의 통계 값을 활용한 질의 모형을 정의하고 규칙 기반의 질의 할당을 수행한다. 성능 평가를 통해 제안하는 기법의 우수성을 보인다.

  • PDF

Identification of Cluster with Composite Mean and Variance (합성된 평균과 분산을 가진 군집 식별)

  • Kim, Seung-Gu
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.3
    • /
    • pp.391-401
    • /
    • 2011
  • Consider a cluster, so called a 'son cluster', whose mean and variance is composed of the means and variances of both clusters called as a 'father cluster' and a 'mother cluster'. In this paper, a method for identifying each of three clusters is provided by modeling the relationship with father and mother clusters. Under the normal mixture model, the parameters are estimated via EM algorithm. We were able to overcome the problems of estimation using ECM approximation. Numerical examples show that our method can effectively identify the three clusters, so called a 'family of clusters'.

Distributed Genetic Algorithm using aster/slave model for the TSP (TSP를 위한 마스터/슬레이브 모델을 이용한 분산유전 알고리즘)

  • Jung-Sook Kim
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.2
    • /
    • pp.185-190
    • /
    • 2002
  • As the TSP(Traveling Salesman Problem) belongs to the class of NP-complete problems, various techniques are required for finding optimum or near optimum solution to the TSP. This paper designs a distributed genetic algorithm in order to reduce the execution time and obtain more near optimal using multi-slave model for the TSP. Especially, distributed genetic algorithms with multiple populations are difficult to configure because they are controlled by many parameters that affect their efficiency and accuracy. Among other things, one must decide the number and the size of the populations (demes), the rate of migration, the frequency of migrations, and the destination of the migrants. In this paper, I develop random dynamic migration rate that controls the size and the frequency of migrations. In addition to this, I design new migration policy that selects the destination of the migrants among the slaves

  • PDF

Estimable functions of mixed models (혼합모형의 추정가능함수)

  • Choi, Jaesung
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.2
    • /
    • pp.291-299
    • /
    • 2016
  • This paper discusses how to establish estimable functions when there are fixed and random effects in design models. It proves that estimable functions of mixed models are not related to random effects. A fitting constants method is used to obtain sums of squares due to random effects and Hartley's synthesis is used to calculate coefficients of variance components. To test about the fixed effects the degrees of freedom associated with divisor are determined by means of the Satterthwaite approximation.

Optical Properties of Plasmons in a GaAs/AlxGa1-xAs Multiple Quantum Well Under Electric and Magnetic Fields (전기장과 자기장하의 GaAs/AlxGa1-xAs 다중 양자 우물 내 플라즈몬의 광학적 속성)

  • Ahn, Hyung Soo;Lee, Sang Chil;Kim, Suck Whan
    • New Physics: Sae Mulli
    • /
    • v.68 no.11
    • /
    • pp.1183-1191
    • /
    • 2018
  • The plasmon behaviors in a superlattice of $GaAs/Al_xGa_{1-x}As$ multiple quantum wells with a half-parabolic confining potential due to different dielectric interfaces are studied under magnetic and electric fields perpendicular and parallel to the superlattice axis by using a previously published theoretical framework. From the density-density correlation functions by considering the intrasubband and the inter-subband transitions under the random phase approximation, we calculate the dispersion energies of the surface and the bulk states as functions of the composition of the multiple quantum well structure and of the magnetic field strength and the average electric field strength over the quantum well. The Raman intensities for various magnetic field strengths and average electric field strengths over the quantum well are also obtained as a function of the energy of the incoming light for these states.

Determination of optical constants for organic light emitting material of Alq3 using Forouhi-Bloomer dispersion relations (포로히-블루머(Forouhi-Bloomer) 분산식을 이용한 유기발광물질 Alq3의 광학 상수 결정)

  • 정부영;우석훈;이석목;황보창권
    • Korean Journal of Optics and Photonics
    • /
    • v.14 no.1
    • /
    • pp.1-7
    • /
    • 2003
  • We determined the optical constants of organic light emitting material of Alq$_3$ in a spectral range between 1.5 and 6 eV using the physical model introduced by Forouhi and Bloomer[Phys. Rev. B 34, pp. 7018-7026, 1986.]. The initial parameters of $A_i,\;B_i,\;C_i$ of Forouhi-Bloomer dispersion relations were determined from the absorption peaks and widths of absorption spectra of the Alq$_3$ film. The refractive index of substrate, a fused silica, is derived from the Sellmeier equation with the measured transmittance and reflectance spectra. Then, the complex refractive index and thickness of the Alq$_3$ film were calculated by use of a nonlinear least square fitting program with the Forouhi-Bloomer dispersion relation and the measured transmittance and reflectance spectra.

Distributed AI Learning-based Proof-of-Work Consensus Algorithm (분산 인공지능 학습 기반 작업증명 합의알고리즘)

  • Won-Boo Chae;Jong-Sou Park
    • The Journal of Bigdata
    • /
    • v.7 no.1
    • /
    • pp.1-14
    • /
    • 2022
  • The proof-of-work consensus algorithm used by most blockchains is causing a massive waste of computing resources in the form of mining. A useful proof-of-work consensus algorithm has been studied to reduce the waste of computing resources in proof-of-work, but there are still resource waste and mining centralization problems when creating blocks. In this paper, the problem of resource waste in block generation was solved by replacing the relatively inefficient computation process for block generation with distributed artificial intelligence model learning. In addition, by providing fair rewards to nodes participating in the learning process, nodes with weak computing power were motivated to participate, and performance similar to the existing centralized AI learning method was maintained. To show the validity of the proposed methodology, we implemented a blockchain network capable of distributed AI learning and experimented with reward distribution through resource verification, and compared the results of the existing centralized learning method and the blockchain distributed AI learning method. In addition, as a future study, the thesis was concluded by suggesting problems and development directions that may occur when expanding the blockchain main network and artificial intelligence model.

A Hashing Method Using PCA-based Clustering (PCA 기반 군집화를 이용한 해슁 기법)

  • Park, Cheong Hee
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.6
    • /
    • pp.215-218
    • /
    • 2014
  • In hashing-based methods for approximate nearest neighbors(ANN) search, by mapping data points to k-bit binary codes, nearest neighbors are searched in a binary embedding space. In this paper, we present a hashing method using a PCA-based clustering method, Principal Direction Divisive Partitioning(PDDP). PDDP is a clustering method which repeatedly partitions the cluster with the largest variance into two clusters by using the first principal direction. The proposed hashing method utilizes the first principal direction as a projective direction for binary coding. Experimental results demonstrate that the proposed method is competitive compared with other hashing methods.

A New Method of Estimating the Buried Location and Extracting Approximate image of Underground Structures using Ground Penetrating Radar (지하 탐사용 레이다를 이용한 지하 구조물의 위치 파악법 및 근사 이미지 추출법)

  • 김동호;이승학;김채영
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.4
    • /
    • pp.565-574
    • /
    • 2000
  • A new ground penetrating radar imaging method for the estimation of buried artificial structures location and their approximate shapes in dispersive lossy ground is investigated. Fundamental idea is based on estimating delayed time and amplitude retrieval coefficients from scattered signals by buried scatterers. Using absolute value integration of each scanning site not only improve the accuracy of measured scattered signal, but also offers convenient ways to extract the image of buried structures. Multi-term Debye model was employed to describe a dispersive and lossy ground medium. We used the finite difference time domain method to discretize the wave equation in continuous form into the machine suitable form. This imaging method uses a new wave path tracing technique in time domain, which is helpful to identify the exact position of buried structures against the ground surface fluctuations.

  • PDF