• 제목/요약/키워드: P.P.A.

검색결과 117,248건 처리시간 0.105초

전처리 검색 기반의 P2P 그룹 검색 알고리즘 (P2P Group Search Algorithm based on Preprocessing Search)

  • 김분희
    • 한국전자통신학회논문지
    • /
    • 제5권5호
    • /
    • pp.522-527
    • /
    • 2010
  • 네트워크로 연결된 환경에서 클라이언트는 서버가 보유한 파일을 요청함으로써 자원을 공유하였으나 서버의 부하로 P2P 시스템이 그 기능을 대신하고 있다. 이러한 P2P 시스템에 관한 성능 향상을 목표로 많은 연구가 진행되고 있다. 본 연구에서는 P2P 검색 시스템을 이용하는 사용자의 사용성 개선 효과를 기반으로 P2P 검색 시스템의 전처리 검색 기반 그룹 검색 알고리즘을 제안한다. 이는 사용자가 검색 용어를 검색 리스트 기반으로 전처리 과정을 거쳐 검색 속도를 높이고자 한다.

REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 2ps OVER GALOIS RINGS

  • Klin-eam, Chakkrid;Sriwirach, Wateekorn
    • 대한수학회보
    • /
    • 제56권1호
    • /
    • pp.131-150
    • /
    • 2019
  • In this paper, we consider the structure of ${\gamma}$-constacyclic codes of length $2p^s$ over the Galois ring $GR(p^a,m)$ for any unit ${\gamma}$ of the form ${\xi}_0+p{\xi}_1+p^2z$, where $z{\in}GR(p^a,m)$ and ${\xi}_0$, ${\xi}_1$ are nonzero elements of the set ${\mathcal{T}}(p,m)$. Here ${\mathcal{T}}(p,m)$ denotes a complete set of representatives of the cosets ${\frac{GR(p^a,m)}{pGR(p^a,m)}}={\mathbb{F}}p^m$ in $GR(p^a,m)$. When ${\gamma}$ is not a square, the rings ${\mathcal{R}}_p(a,m,{\gamma})=\frac{GR(p^a,m)[x]}{{\langle}x^2p^s-{\gamma}{\rangle}}$ is a chain ring with maximal ideal ${\langle}x^2-{\delta}{\rangle}$, where ${\delta}p^s={\xi}_0$, and the number of codewords of ${\gamma}$-constacyclic code are provided. Furthermore, the self-orthogonal and self-dual ${\gamma}$-constacyclic codes of length $2p^s$ over $GR(p^a,m)$ are also established. Finally, we determine the Rosenbloom-Tsfasman (RT) distances and weight distributions of all such codes.

Lq-ESTIMATES OF MAXIMAL OPERATORS ON THE p-ADIC VECTOR SPACE

  • Kim, Yong-Cheol
    • 대한수학회논문집
    • /
    • 제24권3호
    • /
    • pp.367-379
    • /
    • 2009
  • For a prime number p, let $\mathbb{Q}_p$ denote the p-adic field and let $\mathbb{Q}_p^d$ denote a vector space over $\mathbb{Q}_p$ which consists of all d-tuples of $\mathbb{Q}_p$. For a function f ${\in}L_{loc}^1(\mathbb{Q}_p^d)$, we define the Hardy-Littlewood maximal function of f on $\mathbb{Q}_p^d$ by $$M_pf(x)=sup\frac{1}{\gamma{\in}\mathbb{Z}|B_{\gamma}(x)|H}{\int}_{B\gamma(x)}|f(y)|dy$$, where |E|$_H$ denotes the Haar measure of a measurable subset E of $\mathbb{Q}_p^d$ and $B_\gamma(x)$ denotes the p-adic ball with center x ${\in}\;\mathbb{Q}_p^d$ and radius $p^\gamma$. If 1 < q $\leq\;\infty$, then we prove that $M_p$ is a bounded operator of $L^q(\mathbb{Q}_p^d)$ into $L^q(\mathbb{Q}_p^d)$; moreover, $M_p$ is of weak type (1, 1) on $L^1(\mathbb{Q}_p^d)$, that is to say, |{$x{\in}\mathbb{Q}_p^d:|M_pf(x)|$>$\lambda$}|$_H{\leq}\frac{p^d}{\lambda}||f||_{L^1(\mathbb{Q}_p^d)},\;\lambda$ > 0 for any f ${\in}L^1(\mathbb{Q}_p^d)$.

Phylogeny of Korean Isolates of Phytophthora Species Based on Sequence Analysis of Internal Transcribed Spacer of Ribosomal DNA

  • Hong, Seung-Beom;Jee, Hyeong-Jin;Kim, Sang-Hee;Go, Seung-Joo
    • The Plant Pathology Journal
    • /
    • 제16권1호
    • /
    • pp.29-35
    • /
    • 2000
  • The internal transcribed spacer regions (ITS I, 5.8S and ITS II) of the ribosomal DNAs were amplified from Korean isolates of Phytophthora spp. and sequenced to characterize them. Sequences from 33 isolates previously identified as P. boehmeriae, P. cactprum, P. cambivora, P. capsici, P. cinnamomi, P. erythroseptica, P. infestans, P. megasperma, P. melonis, P. nicotianae, P. palmivora and P. sojae were compared with published sequences, and a phylogenetic tree was produced. All isolates belonging to 10 species, P. cactorum, P. cambivora, P. capsici, P. cinnamomi P. citricola, P. infestans, P. nicotianae, P. palmivora and P. sojae were clearly clustered into published isolates of each species above 97% bootstrap value. Cucurbits isolates of Phytophthora previously identified as either P. melonis or P. drechsleri showed distinct evolutionary lineages from the P. megasperma was closely related to isolates of P. cryptogea-P. drechsleri showed distinct evolutionary lineages from the P. cryptogea-P. drechsleri complex group, indicating that P. melonis is a valid species. A Korean isolate of P. megasperma was closely related to isolates of P. erythroseptica showed distant genetic relationship with published isolates of P. erythroseptica (CBS 956.87). It is probable that the two Korean isolates could be genetically different from foreign isolates or misidentified. A grouping of species according to ITS sequence divergence matched, to some degree, the broad classification based on type of papilla. However, a separation of semi-papillate species and papillate species was not wvident in this study.

  • PDF

무선랜 환경에서 모바일 P2P 스트리밍 서비스의 성능 분석 (A Performance Analysis of Mobile P2P Streaming Service on Wireless LAN Environments)

  • 최헌회;김근형
    • 디지털콘텐츠학회 논문지
    • /
    • 제14권1호
    • /
    • pp.25-33
    • /
    • 2013
  • Peer-to-Peer(P2P)구조는 서버에서 많은 트래픽을 유발시키는 서버-클라이언트 구조와 달리 피어(Peer) 간 데이터 조각을 주고받아 서버의 네트워크 대역폭과 컴퓨팅 자원을 절감할 수 있다. P2P 구조는 참여 피어가 많을수록 안정적으로 데이터를 받을 수 있다는 장점을 갖는다. 현재 P2P 트래픽 양은 전 세계 인터넷 트래픽의 약 65%를 차지하고 있으며. 이를 스트리밍 기술에 접목한 다양한 P2P 스트리밍 서비스가 출시되었다. 그러나 기존의 P2P 스트리밍 기술은 유선 네트워크를 기반으로 설계되고 발전되어 왔기 때문에, 최근 널리 보급된 무선 네트워크에서 P2P 스트리밍 기술을 적용하기 위해 피어간 스트림 데이터 전송 알고리즘과 요구사항에 대한 고려가 필요하다. 특히, 피어의 이동성과 무선 패킷 충돌 및 손실로 인한 대역폭의 변동은 모바일 P2P 스트리밍 서비스가 기존의 P2P 스트리밍 서비스와는 다른 문제의 원인이 된다. 따라서 본 논문에서는 802.11n 무선랜 환경에서 P2P 스트리밍 서비스를 적용할 때 미치는 영향과 문제점을 실험을 통해 분석한다.

사용자 편의적 소셜 네트워크 공동구매 P2P 시스템 (Joint Buying P2P System for User Convenient Social Network)

  • 김분희
    • 한국전자통신학회논문지
    • /
    • 제6권6호
    • /
    • pp.915-920
    • /
    • 2011
  • P2P 기술은 분산 환경에서 효율적으로 자원을 공유할 수 있는 개념으로 연구가 많이 진행되고 있다. 이러한 P2P 시스템에서 컨텐츠 정보 제공의 역할을 하는 서버와 피어들로 구성된 P2P 시스템은 일반적인 자원 보유 서버로 구성된 시스템에 비해 서버의 부하가 적다. 본 논문에서는 음식 메뉴를 제공함에 있어서 소셜 네트워크 기반의 공동 구매 정보와 연계되어 시기 선택의 편의를 제공하는 P2P 시스템을 제안한다. 소셜 네트워크 기반의 공동 구매 정보와 가격 알림 정보는 P2P 시스템을 이용하는 피어에 의해 제공되고, 이러한 중계 정보는 P2P 서버에 의해 제공된다.

차별화된 성능 기반을 이용한 Hybrid P2P 시스템 (An Intelligent Performance based Hybrid P2P System for Distributed Resource Sharing)

  • 민수홍;조동섭
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.292-294
    • /
    • 2005
  • The emerging peer-to-peer (P2P) model has recently gained a significant attention due to its high potential of sharing various resources among networked users. Super-peer unstructured P2P systems have been found very effective by dividing the peers into two layers, super-peer and edge peer. Super peer deal with all Queries instead of edge peers. The existing P2P systems assume all super peers have equal roles and capabilities. However, all super peers don't so that edge peers should select the best super peer in order to handle Queries well. In this paper, we suggest the ISP2P (Intelligent Super-peer based P2P) which allows to select the best super peer to the edge peers. We classify super peers according as the capacity of a edge peer to a super peer. We show that considering the quality of a edge peer to a super peer can improve the performance of the response time and bandwidth.

  • PDF

P2P(peer-to-peer) 모델의 e비즈니스 적용 가능성에 관한 연구 (A Study on the Possibility of Applying Peer-to-Peer(P2P) Model to e-Business)

  • 문형남
    • 통상정보연구
    • /
    • 제6권3호
    • /
    • pp.63-79
    • /
    • 2004
  • Peer-to-peer(P2P) has potential strength and possible factors which enable it to develop toward a new business by supplementing the limitation of the existing central server-type network. In various business sectors, various attempts have already been made to apply P2P. The computing power which was possible to be formed through peer-to-peer networking will become a powerful tools for expanding toward new business area depending the utilization methods by sector. Although the technology-centric P2P concept is a major interest now, its development direction will head toward service-centric P2P concept for satisfying desires of end-users(individual peers) for reliable contents and improving their purchasing convenience. But the solution requisites should be solved for the efficient application of P2P to business such as the establishment of and supplement for the industrial standard and legal system for P2P, the enhancement of peers recognition of P2P. Presently e-commerce using P2P is being implemented by a few enterprises locally by means of B2C. But if many enterprises enter this type of e-commerce, and the standardization of peer programmes, goods and documents is made, it will be able to be extended to B2B. Also it seems that it can be utilized in international transactions as well as in domestic transactions. So there is much room for the application of P2P to be extended further. Also there has been presented the necessity for related industries to support their work with theories and for academic studies to be made actively to set the direction of its development. It is hoped that multi-angled and in-depth studies on the utilization of P2P and various attempts to application of it to business be made on the basis of this study. For the development of P2P, continuous study and attempts are needed. The field of P2Ps application is very large and it will become a powerful tool, depending upon its application methods.

  • PDF

A Design of P2P Cloud System Using The Super P2P

  • Jung, Yean-Woo;Cho, Seongsoo;Lee, Jong-Yong;Jeong, KyeDong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제7권1호
    • /
    • pp.42-48
    • /
    • 2015
  • Generally, the current commercial cloud system is hosted by the centralization large datacenter. However, the other clouding forms existed and one of them is the P2P cloud. The P2P Cloud is a distributed systems, is freedom to join and leave and is possible to provide the IaaS. Commonly, P2P Cloud System is based on Pure-P2P System. Since a number of connection paths exist, it has a high reliability and easily scalability of the network. However, there are disadvantages of the slow rate of route because of looking up the all peers in order to search for the peer. In this paper, it proposes the P2P cloud system based on super-peer P2P. Super-peer P2P system has fast routing time, because of searching for cluster unit and it also can has high reliability and high scalability. We designs the super Peer cloud service and proposes the system model and Resource Allocation Algorithm for IaaS in Super peer P2P environment.