• Title/Summary/Keyword: cluster calculation

Search Result 142, Processing Time 0.04 seconds

Web Crawling and PageRank Calculation for Community-Limited Search (커뮤니티 제한 검색을 위한 웹 크롤링 및 PageRank 계산)

  • Kim Gye-Jeong;Kim Min-Soo;Kim Yi-Reun;Whang Kyu-Young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.1-3
    • /
    • 2005
  • 최근 웹 검색 분야에서는 검색 질을 높이기 위한 기법들이 많이 연구되어 왔으며, 대표적인 연구로는 제한 검색, focused crawling, 웹 클러스터링 등이 있다. 그러나 제한 검색은 검색 범위를 의미적으로 관련된 사이트들로 제한할 수 없으며, focused crawling은 질의 시점에 클러스터링하기 때문에 질의 처리 시간이 오래 걸리고, 웹 클러스터링은 많은 웹 페이지들을 대상으로 클러스터링하기 위한 오버헤드가 크다. 본 논문에서는 검색 범위를 특정 커뮤니티로 제한하여 검색 하는 커뮤니티 제한 검색과 커뮤니티를 구하는 방법으로 cluster crawler를 제안하여 이러한 문제점을 해결한다. 또한, 커뮤니티를 이용하여 PageRank를 2단계로 계산하는 방법을 제안한다. 제안된 방법은 첫 번째 과정에서 커뮤니티 단위로 지역적으로 PageRank를 계산한 후, 두 번째 과정에서 이를 바탕으로 전역적으로 PageRank론 계산한다. 제안된 방법은 Wang에 의해 제안된 방법에 비해 PageRank 근사치의 오차를 $59\%$ 정도로 줄일 수 있다.

  • PDF

Calculation on Effect of Impurity Addition on Electronic State of $MnO_2$ Oxide Semiconductor by First Principle Moleculat Orbital Method (제1원리 분자궤도계산법에 의한 $MnO_2$ 산화물 반도체의 전자상태에 미치는 불순물 첨가 효과의 계산)

  • Lee, Dong-Yoon;Kim, Bong-Seo;Song, Jae-Sung;Kim, Hyun-Sik
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2003.11a
    • /
    • pp.99-102
    • /
    • 2003
  • The electronic structure of ${\beta}-MnO_2$ having impurities in the site of Mn was theoretically investigated by $DV-X_{\alpha}$ (the discrete variation $X{\alpha}$) method, which is a sort of the first principle molecular orbital method using Hatre-Fock-Slater approximation. The used cluster model was $[Mn_{14}MO_{56}]^{-52}$ (M = transient metals). Madelung potential and spin polarization were considered for more exact calculations. As results of calculations, the energy levels of all electron included in the model were obtained. The energy band gap and positions of impurity levies were discussed in association with impurity 34 orbital that seriously affect electrical properties of $MnO_2$. It was shown that the energy band gap decreased with the increase of the atomic number of transient metal impurity.

  • PDF

Calculation on Electronic Structure of ZnO with Impurities Belonging to III and IV Family (III, IV족 불순물이 첨가된 ZnO의 전자상태계산)

  • Lee, Dong-Yoon;Kim, Hyun-Ju;Koo, Bo-Kun;Lee, Won-Jae;Song, Jae-Sung
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2004.07a
    • /
    • pp.309-312
    • /
    • 2004
  • The electronic structure of ZnO oxide semiconductor having high optical transparency and good electric conductivity was theoretically investigated by $DV-X_{\alpha}$(the discrete variation $X_{\alpha}$) method, which is a sort of the first principle molecular orbital method using Hatre-Fock-Slater approximation. The electrical and optical properties of ZnO are seriously affected by the addition of impurities. The imnurities are added to ZnO in order to increase the electric conductivity of an electrode without losing optical transparency. In this study, the effect of impurities of III and IV family on the band structure, impurity levels and the density of state of ZnO were investigated. The cluster model used for calculations was $[MZn_{50}O_{53}]^{-2}$(M=elements belonging to III and IV family).

  • PDF

A Study on Light Weight Authentication Method of Distributed Cluster-based IoT Devices (분산 클러스터 기반 IoT 디바이스 경량 인증 방법에 대한 연구)

  • Kim, Sung-hwan;Kim, Young-gon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.2
    • /
    • pp.103-109
    • /
    • 2019
  • Due to the development of ICT technology, the IoT environment for connecting objects in the vicinity to networks and utilizing information about objects in various fields is getting attention, and security threats are also increasing. In order to solve the increasing security problem in IoT environment, we are studying methods that use certificate, encryption, hash calculation and block chain in the private sector. However, the security authentication method which overcomes the performance gap between devices and has compatibility with various devices It has not been proposed yet. In this paper, we propose an authentication method that can achieve wide compatibility by minimizing the influence of IoT device environment.

Quantitative Analysis of Initial Dispersion Condition Effects on Randomness of Magnus Rotor Bomblet (Magnus Rotor 자탄의 초기 방출조건이 분산도에 미치는 영향에 대한 정량적 분석)

  • Bai, Ikhyun
    • Journal of the Korea Society for Simulation
    • /
    • v.28 no.3
    • /
    • pp.83-89
    • /
    • 2019
  • This research describes quantitative effects of initial dispersion conditions upon the dispersion randomness of Magnus rotor bomblets. Ratios of the missile spin rate to the missile velocity, a, flight path angles, ${\gamma}$ and altitudes, h, were changed to investigate their effects on dispersion randomness. Dispersion was analyzed through calculation of 6 degree of freedom motion equation with aerodynamic coefficients from wind tunnel experiments. In order to analyze the randomness, regression analysis is adopted to calculate the coefficient of determination. The optimized ratio of the missile spin rate to the missile velocity and flight path angle were obtained and the dispersion altitudes had more effect on the dispersion diameter and had less effect on dispersion than other parameters.

Fast Heuristic Algorithm for Similarity of Trajectories Using Discrete Fréchet Distance Measure (이산 프레셰 거리 척도를 이용한 궤적 유사도 고속계산 휴리스틱 알고리즘)

  • Park, Jinkwan;Kim, Taeyong;Park, Bokuk;Cho, Hwan-Gue
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.4
    • /
    • pp.189-194
    • /
    • 2016
  • A trajectory is the motion path of a moving object. The advances in IT have made it possible to collect an immeasurable amount of various type of trajectory data from a moving object using location detection devices like GPS. The trajectories of moving objects are widely used in many different fields of research, including the geographic information system (GIS) field. In the GIS field, several attempts have been made to automatically generate digital maps of roads by using the vehicle trajectory data. To achieve this goal, the method to cluster the trajectories on the same road is needed. Usually, the $Fr{\acute{e}}chet$ distance measure is used to calculate the distance between a pair of trajectories. However, the $Fr{\acute{e}}chet$ distance measure requires prolonged calculation time for a large amount of trajectories. In this paper, we presented a fast heuristic algorithm to distinguish whether the trajectories are in close distance or not using the discrete $Fr{\acute{e}}chet$ distance measure. This algorithm trades the accuracy of the resulting distance with decreased calculation time. By experiments, we showed that the algorithm could distinguish between the trajectory within 10 meters and the distant trajectory with 95% accuracy and, at worst, 65% of calculation reduction, as compared with the discrete $Fr{\acute{e}}chet$ distance.

The Parallelization Effectiveness Analysis of K-DRUM Model (분포형 강우유출모형(K-DRUM)의 병렬화 효과 분석)

  • Chung, Sung-Young;Park, Jin-Hyeog;Hur, Young-Teck;Jung, Kwan-Sue
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.18 no.4
    • /
    • pp.21-30
    • /
    • 2010
  • In this paper, the parallel distributed rainfall runoff model(K-DRUM) using MPI(Message Passing Interface) technique was developed to solve the problem of calculation time as it is one of the demerits of the distributed model for performing physical and complicated numerical calculations for large scale watersheds. The K-DRUM model which is based on GIS can simulate temporal and spatial distribution of surface flow and sub-surface flow during flood period, and input parameters of ASCII format as pre-process can be extracted using ArcView. The comparison studies were performed with various domain divisions in Namgang Dam watershed in case of typoon 'Ewiniar' at 2006. The numerical simulation using the cluster system was performed to check a parallelization effectiveness increasing the domain divisions from 1 to 25. As a result, the computer memory size reduced and the calculation time was decreased with increase of divided domains. And also, the tool was suggested in order to decreasing the discharge error on each domain connections. The result shows that the calculation and communication times in each domain have to repeats three times at each time steps in order to minimization of discharge error.

A Study on the Prediction of Yard Tractors Required by Vessels Arriving at Container Terminal (컨테이너터미널 입항 선박별 야드 트랙터 소요량 예측에 관한 연구)

  • Cho, Hyun-Jun;Shin, Jae-Young
    • Journal of Korea Port Economic Association
    • /
    • v.37 no.4
    • /
    • pp.33-40
    • /
    • 2021
  • Currently, the shipping and port industries are implementing strategies to improve port processing capabilities through the expansion and efficient operation of port logistics resources to survive fierce competition with rapidly changing trends. The calculation of the port's processing capacity is determined by the loading and unloading equipment installed at the dock, and the port's processing capacity can be improved through various methods, such as additional deployment of logistics resources or efficient operation of resources in use. However, it is difficult to expect an improvement effect in a short period of time because the additional deployment of logistics resources is clearly limited in time is clear. Therefore, it is a feasible way to find an efficient operation method for resources being used to improve processing capacity. Domestic ports are also actively promoting informatization and digitalization with the development of the 4th industrial revolution technology. However, the calculation of the number of Y/T (Yard Tractor) assignments in the current unloading process depends on expert experience, and related previous studies also focus on the allocations of Y/T or Calculation of the total number of Y/T required. Therefore, this study analyzed the factors affecting the number of Y/T allocations using the loading and unloading information of incoming ships, and based on this, cluster analysis, regression analysis, and deep neural network(DNN) model were used.

Benchmark Results of a Monte Carlo Treatment Planning system (몬데카를로 기반 치료계획시스템의 성능평가)

  • Cho, Byung-Chul
    • Progress in Medical Physics
    • /
    • v.13 no.3
    • /
    • pp.149-155
    • /
    • 2002
  • Recent advances in radiation transport algorithms, computer hardware performance, and parallel computing make the clinical use of Monte Carlo based dose calculations possible. To compare the speed and accuracies of dose calculations between different developed codes, a benchmark tests were proposed at the XIIth ICCR (International Conference on the use of Computers in Radiation Therapy, Heidelberg, Germany 2000). A Monte Carlo treatment planning comprised of 28 various Intel Pentium CPUs was implemented for routine clinical use. The purpose of this study was to evaluate the performance of our system using the above benchmark tests. The benchmark procedures are comprised of three parts. a) speed of photon beams dose calculation inside a given phantom of 30.5 cm$\times$39.5 cm $\times$ 30 cm deep and filled with 5 ㎣ voxels within 2% statistical uncertainty. b) speed of electron beams dose calculation inside the same phantom as that of the photon beams. c) accuracy of photon and electron beam calculation inside heterogeneous slab phantom compared with the reference results of EGS4/PRESTA calculation. As results of the speed benchmark tests, it took 5.5 minutes to achieve less than 2% statistical uncertainty for 18 MV photon beams. Though the net calculation for electron beams was an order of faster than the photon beam, the overall calculation time was similar to that of photon beam case due to the overhead time to maintain parallel processing. Since our Monte Carlo code is EGSnrc, which is an improved version of EGS4, the accuracy tests of our system showed, as expected, very good agreement with the reference data. In conclusion, our Monte Carlo treatment planning system shows clinically meaningful results. Though other more efficient codes are developed such like MCDOSE and VMC++, BEAMnrc based on EGSnrc code system may be used for routine clinical Monte Carlo treatment planning in conjunction with clustering technique.

  • PDF

A Hierarchical Cluster Tree Based Fast Searching Algorithm for Raman Spectroscopic Identification (계층 클러스터 트리 기반 라만 스펙트럼 식별 고속 검색 알고리즘)

  • Kim, Sun-Keum;Ko, Dae-Young;Park, Jun-Kyu;Park, Aa-Ron;Baek, Sung-June
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.3
    • /
    • pp.562-569
    • /
    • 2019
  • Raman spectroscopy has been receiving increased attention as a standoff explosive detection technique. In addition, there is a growing need for a fast search method that can identify raman spectrum for measured chemical substances compared to known raman spectra in large database. By far the most simple and widely used method is to calculate and compare the Euclidean distance between the given spectrum and the spectra in a database. But it is non-trivial problem because of the inherent high dimensionality of the data. One of the most serious problems is the high computational complexity of searching for the closet spectra. To overcome this problem, we presented the MPS Sort with Sorted Variance+PDS method for the fast algorithm to search for the closet spectra in the last paper. the proposed algorithm uses two significant features of a vector, mean values and variance, to reject many unlikely spectra and save a great deal of computation time. In this paper, we present two new methods for the fast algorithm to search for the closet spectra. the PCA+PDS algorithm reduces the amount of computation by reducing the dimension of the data through PCA transformation with the same result as the distance calculation using the whole data. the Hierarchical Cluster Tree algorithm makes a binary hierarchical tree using PCA transformed spectra data. then it start searching from the clusters closest to the input spectrum and do not calculate many spectra that can not be candidates, which save a great deal of computation time. As the Experiment results, PCA+PDS shows about 60.06% performance improvement for the MPS Sort with Sorted Variance+PDS. also, Hierarchical Tree shows about 17.74% performance improvement for the PCA+PDS. The results obtained confirm the effectiveness of the proposed algorithm.