• Title/Summary/Keyword: Path Similarity

Search Result 84, Processing Time 0.09 seconds

Intelligent Capacity and Similarity based Super-peer Selection in P2P Network (성능 및 유사도 정보를 이용한 수퍼 피어 선별 기법)

  • Min, Su-Hong;Cho, Dong-Sub
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.159-161
    • /
    • 2006
  • The peer-to-peer (P2P) systems have Brown significantly over last few years due to their hish potential of sharing various resources. Super-peer based P2P systems have been found very effective by dividing the peers into two layers, SP (Super-Peer) and OP (Ordinary-Peer). In this paper, we present ISP2P (Intelligent Super-peer based P2P system), which allows us to choose the best SP. Through analyzing capacity and similarity between SP and OP, we can help OPs to select the most appropriate SP respectively. Proposed system can improve the performance of the average response time by superior SP, reduce the bandwidth cost by small path length due to content similarity and solve frequent SP replacement problem by considering similarity of user behavior.

  • PDF

Obstacles modeling method in cluttered environments using satellite images and its application to path planning for USV

  • Shi, Binghua;Su, Yixin;Zhang, Huajun;Liu, Jiawen;Wan, Lili
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.11 no.1
    • /
    • pp.202-210
    • /
    • 2019
  • The obstacles modeling is a fundamental and significant issue for path planning and automatic navigation of Unmanned Surface Vehicle (USV). In this study, we propose a novel obstacles modeling method based on high resolution satellite images. It involves two main steps: extraction of obstacle features and construction of convex hulls. To extract the obstacle features, a series of operations such as sea-land segmentation, obstacles details enhancement, and morphological transformations are applied. Furthermore, an efficient algorithm is proposed to mask the obstacles into convex hulls, which mainly includes the cluster analysis of obstacles area and the determination rules of edge points. Experimental results demonstrate that the models achieved by the proposed method and the manual have high similarity. As an application, the model is used to find the optimal path for USV. The study shows that the obstacles modeling method is feasible, and it can be applied to USV path planning.

Similarity Measurement of 3D Shapes Using Ray Distances (Ray distance를 이용한 3차원 형상의 유사성 판단)

  • 황태진;정지훈;오헌영;이건우
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.1
    • /
    • pp.159-166
    • /
    • 2004
  • Custom-tailored products are meant by the products having various sizes and shapes to meet the customer's different tastes or needs. Thus fabrication of custom-tailored products inherently involves inefficiency. To minimize this inefficiency, a new paradigm is proposed in this work. In this paradigm, different parts are grouped together according to their sizes and shapes. Then, representative shape of each group is derived and it will be used as the work-piece from which the parts in the group are machined. Once a new product is ordered, the optimal work-piece is selected through making similarity comparisons of new product and each representative shape. Then an effective NC tool-path is generated to machine only the different portions between the work-piece and the ordered product. The efficient machining conditions are also derived from this shape difference. By machining only the different portions between the work-piece and the ordered product, it saves time. Similarity comparison starts with the determination of the closest pose between two shapes in consideration. The closest pose is derived by comparing the ray distances while one shape is virtually rotated with respect to the other. Shape similarity value and overall similarity value calculated from ray distances are used for grouping. A prototype system based on the proposed methodology has been implemented and applied to the grouping and machining of the shoe lasts of various shapes and sizes.

Similarity Measurement of 3D Shapes Using Ray Distances (Ray distance를 이용한 3차원 형상의 유사성 판단)

  • 정지훈;황태진;오헌영;이건우
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.70-73
    • /
    • 2003
  • Custom-tailored products are meant by the products having various sizes and shapes to meet the customer's different tastes or needs. Thus fabrication of custom-tailored products inherently involves inefficiency. To minimize this inefficiency, a new paradigm is proposed in this work. In this paradigm. different paris are grouped together according to their sizes and shapes. Then, representative shape of each group is derived and it will be used as the work-piece from which the parts in the group are machined. Once a new product is ordered, the optimal work-piece is selected through making similarity comparisons of new product and each representative shape. Then an effective NC tool-path is generated to machine only the different portions between the work-piece and the ordered product. The efficient machining conditions are also derived from this shape difference. By machining only the different portions between the work-piece and the ordered product, it saves time. Similarity comparison starts with the determination of the closest pose between two shapes in consideration. The closest pose is derived by comparing the ray distances while one shape is virtually rotated with respect to the other. Shape similarity value and overall similarity value calculated from ray distances are used for grouping. A prototype system based on the proposed methodology has been implemented and applied to the grouping and machining of the shoe lasts of various shapes and sizes.

  • PDF

The Role of Authenticity and Value Similarity for Live-commerce Sellers (라이브 커머스 판매자의 진정성과 가치 유사성의 역할)

  • Inho Hwang
    • The Journal of Information Systems
    • /
    • v.33 no.2
    • /
    • pp.1-25
    • /
    • 2024
  • Purpose Live commerce, a real-time product promotion method using portable hardware, is experiencing significant growth. This approach involves product experts or celebrities endorsing products, providing consumers with valuable information to mitigate uncertainty. This research underscores the significance of the seller's authenticity and their value similarity with consumers in live commerce. The study's first objective enhance the seller's authenticity and elucidate the mechanism that influences purchase intention. The second objective is to demonstrate the interactive effect of value similarity and the seller's authenticity on positively influencing purchase intention. Design/methodology/approach This research utilized previous studies to develop models and hypotheses, focusing on adults experienced in live commerce product purchasing. The study tested the research hypothesis using 330 samples. The study analyzed the path from seller authenticity to purchase intention via structural equation modeling (AMOS 22.0), and also explored the interaction between value similarity and seller authenticity using the Process 3.1 macro. Findings The research validates that the seller's channel activities and external perception amplify the seller's authenticity, influencing purchase intentions. It also affirms that value similarity fosters seller authenticity and interactive effects, thereby boosting purchase intentions. These findings provide insights for devising seller management strategies on live commerce platforms.

Single-Query Probabilistic Roadmap Planning Algorithm using Remembering Exploration Method (기억-탐험 방법을 이용한 단일-질의 확률 로드맵 계획 알고리즘)

  • Kim, Jung-Tae;Kim, Dae-Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.4
    • /
    • pp.487-491
    • /
    • 2010
  • In this paper we propose a new single-query path planning algorithm for working well in high-dimensional configuration space. With the notice of the similarity between single-query algorithms with exploration algorithms, we propose a new path planning algorithm, which applies the Remembering Exploration method, which is one of exploration algorithms, to a path-planning problem by selecting a node from a roadmap, finding out the neighbor nodes from the node, and then inserting the neighbor nodes into the roadmap, recursively. For the performance comparison, we had experiments in 2D and 3D environments and compared the time to find out the path. In the results our algorithm shows the superior performance than other path planning algorithms.

Method of Benchmarking Route Choice Based on the Input-similarity Using DEA and SOM (DEA와 SOM을 이용한 투입 요소 유사성 기반의 벤치마킹 경로 선택 방법에 관한 연구)

  • Park, Jae-Hun;Bae, Hye-Rim;Lim, Sung-Mook
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.36 no.1
    • /
    • pp.32-41
    • /
    • 2010
  • DEA(Data Envelopment Analysis) is the relative efficiency measure among homogeneous DMU(Decision- Making Units) which can be used to useful tool to improve performance through efficiency evaluation and benchmarking. However, the general case of DEA was considered as unrealistic since it consists a benchmarking regardless of DMU characteristic by input and output elements and the high efficiency gap in benchmarking for inefficient DMU. To solve this problem, stratification method for benchmarking was suggested, but simply presented benchmarking path in repeatedly applying level. In this paper, we suggest a new method that inefficient DMU can choice the optimal path to benchmark the most efficient DMU base on the similarity among the input elements. For this, we propose a route choice method that combined a stratification benchmarking algorithm and SOM (Self-Organizing Map). An implementation on real environment is also presented.

EKF based Mobile Robot Indoor Localization using Pattern Matching (패턴 매칭을 이용한 EKF 기반 이동 로봇 실내 위치 추정)

  • Kim, Seok-Young;Lee, Ji-Hong
    • The Journal of Korea Robotics Society
    • /
    • v.7 no.1
    • /
    • pp.45-56
    • /
    • 2012
  • This paper proposes how to improve the performance of CSS-based indoor localization system. CSS based localization utilizes signal flight time between anchors and tag to estimate distance. From the distances, the 3-dimensional position is calculated through trilateration. However the error in distance caused from multi-path effect transfers to the position error especially in indoor environment. This paper handles a problem of reducing error in raw distance information. And, we propose the new localization method by pattern matching instead of the conventional localization method based on trilateration that is affected heavily on multi-path error. The pattern matching method estimates the position by using the fact that the measured data of near positions possesses a high similarity. In order to gain better performance of localization, we use EKF(Extended Kalman Filter) to fuse the result of CSS based localization and robot model.

A Ranking Technique of XML Documents using Path Similarity for Expanded Query Processing (확장된 질의 처리를 위해 경로간 의미적 유사도를 고려한 XML 문서 순위화 기법)

  • Kim, Hyun-Joo;Park, So-Mi;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.37 no.2
    • /
    • pp.113-120
    • /
    • 2010
  • XML is broadly using for data storing and processing. XML is specified its structural characteristic and user can query with XPath when information from data document is needed. XPath query can process when the tern and structure of document and query is matched with each other. However, nowadays there are lots of data documents which are made by using different terminology and structure therefore user can not know the exact idea of target data. In fact, there are many possibilities that target data document has information which user is find or a similar ones. Accordingly user query should be processed when their term usage or structural characteristic is slightly different with data document. In order to do that we suggest a XML document ranking method based on path similarity. The method can measure a semantic similarity between user query and data document using three steps which are position, node and relaxation factors.

A Detection Method of Position of ON/OFF-Switch (ON/OFF-스위치의 위치 인식 방법)

  • Cho, Byung-Mo;Lee, Kwon-Yeon;Son, Myung-Sik
    • Journal of IKEEE
    • /
    • v.11 no.1 s.20
    • /
    • pp.30-37
    • /
    • 2007
  • This paper proposes a detection method of position of OFF-switch. Each switch has the parallel path with a serial combination of passive element, its parallel path has each different frequency characteristics. Frequency characteristic of ON-switch reveals a flat spectrum irrelevant to frequency characteristic of passive element connected in parallel to its each terminal and frequency characteristic of OFF-switch reveals the same characteristic as one of passive element connected in parallel. Detection of position of OFF-switch is done by measuring the similarity of each spectrum corresponding to frequency characteristic of passive element connected in parallel to OFF-switch. The measure of their similarity is to calculate Euclidean distance between their test spectrum and reference spectrum. The spectrum with the smallest distance among reference spectrum is recognized as the spectrum of OFF-switch. The real time digital signal processing system is implemented to detect the position of OFF-switch by using spectrum matching.

  • PDF