• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.1
• /
• pp.121-126
• /
• 2013

In the past several years there has been increasing the studies using P2P technology in the distributed system areas. In these P2P systems, the server to support the contents-information have less overloads than the composed system as the server to have resources generally. In this paper, we propose the system to support a social network P2P service based on the social network P2P system. The object of this study was to widen the use of this menu system to determine the price based on visual information by a software agent. Therefore, this system is suitable for micro, small and medium industries in the use of P2P servers and is more usable system interface for owners than previous study.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1279-1300
• /
• 2021

Let P be a finite point set in ℝ² with the set of distance n-chains defined as ∆_n(P) = {(|p₁ - p₂|, |p₂ - p₃|, …, |p_n - p_n+1|) : p_i ∈ P}. We show that for 2 ⩽ n = O_|P|(1) we have ${\mid}{\Delta}_n(P){\mid}{\gtrsim}{\frac{{\mid}P{\mid}^n}{{\log}^{\frac{13}{2}(n-1)}{\mid}P{\mid}}}$. Our argument uses the energy construction of Elekes and a general version of Rudnev's rich-line bound implicit in [28], which allows one to iterate efficiently on intersecting nested subsets of Guth-Katz lines. Let G is a simple connected graph on m = O(1) vertices with m ⩾ 2. Define the graph-distance set ∆_G(P) as ∆_G(P) = {(|p_i - p_j|)_{i,j}∈E(G) : p_i, p_j ∈ P}. Combining with results of Guth and Katz [17] and Rudnev [28] with the above, if G has a Hamiltonian path we have ${\mid}{\Delta}_G(P){\mid}{\gtrsim}{\frac{{\mid}P{\mid}^{m-1}}{\text{polylog}{\mid}P{\mid}}}$.

• Korean Journal of Microbiology
• /
• v.39 no.2
• /
• pp.118-122
• /
• 2003

To develop vector plasmid for the bacteriophage P2-P4 system which is a useful experimental tool for the study of viral capsid assembly, we constructed a new P4-derived vector plasmid starting from P4 ash8 sid71 With recombinant DNA technology, a portion of P4 genome was deleted and tetracyclin resistance gene (terR) was introduced into P4 genome to give P4 selectivity. Resulting P4 ash8(sid71) terR was 12.09 kb long and could be converted to a viable bacteriophage with P2 infection. The burst size of induced bacteriophage form of P4 ash8(sid71) terR was determined. The CsCl buoyant equilibrium density gradient experiment of new P4 derivative suggested the upper limit of packaging capacity in P2-size head.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.23-29
• /
• 2015

The baby-step giant-step algorithm seeks b in a discrete logarithm problem when a,c,p of $a^b{\equiv}c$(mod p) are already given. It does so by dividing p by m block of $m={\lceil}{\sqrt{p}}{\rceil}$ length and letting one giant walk straight toward $a^0$ with constant m strides in search for b. In this paper, I basically reduce $m={\lceil}{\sqrt{p}}{\rceil}$ to p/l, $a^l$ > p and replace a giant with an adult who is designed to walk straight with constant l strides. I also extend the algorithm to allow $2^k$ adults to walk simultaneously. As a consequence, the proposed algorithm quarters the execution time of the basic adult-walk method when applied to $2^k$, (k=2) in the range of $1{\leq}b{\leq}p-1$. In conclusion, the proposed algorithm greatly shorten the step number of baby-step giant-step.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.139-143
• /
• 2005

The P2P is a network environment supporting data exchange which is directly connected peers without limit of existing server-client and intervening central server for resource or offered service with each peer. JXTA is a representative of P2P system. JXTA is a typical distributed computing model that proposed by Sun Microsystems. JXTA that doesn't require centralized services or resources is adaptable in extreme changes of network organization. MANET(Mobile Ad Hoc Network) is a representative wireless network that is composed of mobile nodes without infrastructure. So MANET establishes the path for the communication of each peers and maintains the newest routing information by exchanging routing information. In this paper, we propose a technique of JXTAMAUET which implements JXTA which is the P2P network system from the wireless network which is becoming the foundation of ubiquitous computing. For the performance evaluation of the JXTAMANET, we use simulation.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1706-1715
• /
• 2008

In a super-peer based P2P network, the network is clustered and each cluster is managed by a special peer, which is called a super-peer. A Super-peer has information of all the peers in its cluster. This type of clustered P2P model is known to have efficient information search and less traffic load than unclustered P2P model. In this paper, we compute the message traffic cost incurred by peers' query, join and update actions within a cluster as well as between the clusters. With these values, we estimate the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.7
• /
• pp.293-302
• /
• 2013

Home network providers have many worries about providing home network services with an expandable, reliable, flexible and low-cost structure according to the expanding market environment. The existing client-server system has various problems such as complexity and high costs in providing home network services. In this paper we propose the P2P-SIP structure. P2P communication terminal supporting access of distributed resources provides functions which the existing SIP-based network devices have. Because diverse terminals in a home network access through networks, also, partitioning network domains with home gateways to manage, and applying the network-based PMIPv6(Proxy Mobile IPv6) technology considering mobility of terminals would help to have a more efficient home network structure. Especially, the proposed P2P-SIP structure proves itself as a very efficient structure to have an outstanding expandability among different home networks in a region, and to reduce maintenance costs.

• Korean Journal of Crystallography
• /
• v.10 no.1
• /
• pp.51-55
• /
• 1999

Cesium titanium(III) pyrophosphate 화합물인 CsTiP2O7을 합성하고 X절 회절법을 이용하여 그 결정구조를 해석하였다. 이물질은 단사정계의 P21/a 공간군으로 결정화되었고 a=8.369(2) , b=10.208(2) , c=7.752(1) , β=104.77(2)o, V=640.4(2) 3, and Z=4이다. 이 물질의 구조는 모서리를 공유하고 있는 TiO6 팔면체와 P2O7 pyrophosphate group들로 구성된 framework로 구성되어 있으며 그 결과로 형성된 tunnel 안에는 Cs+이온이 존재한다. CsTiP2O7은 ATiP2O7(A=K, Rb)와 KAIP2O7 그리고 AMoP2O7(A=K, Rb, Cs)등 다른 +3금속 pyrophosphate들로 유사한 구조를 가지고 있다. 이 물질은 [Cs+][Ti3+][P2O74-]의 식으로 표현할 수 있다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.11
• /
• pp.471-474
• /
• 2013

In this paper, we propose a distributed parent peer selection method to construct an efficient peer-to-peer(P2P) network topology by considering the capacity of a peer and the hop distance from a data source to the peer. To achieve this goal, we propose a method to combine the two performance metrics to calculate the probability that a peer becomes a parent peer. Using the probability, we propose a method to select a parent peer stochastically by making use of the state information of the neighboring peers that each peer maintains. Through simulation studies, we show that the proposed method drives high capacity peers to support more children peers and makes the diameter of the P2P network shorter than the other methods.

• The Journal of the Korea Contents Association
• /
• v.17 no.1
• /
• pp.662-672
• /
• 2017

Recently, with the development of mobile devices and near field communication, mobile P2P networks have been actively studied to improve the limits of the existing centralized processing system. A peer has limited components such as batteries, memory and storage spaces in mobile P2P networks. The trust of a peer should be discriminated in order to share reliable contents in mobile P2P networks. In this paper, we propose a trust discrimination scheme considering limited resources in mobile P2P environments. The proposed scheme discriminates the trust of a peer by direct rating values using the rating information of the peer and indirect rating values by the other peers. The recent update time is included in the rating information. The proposed scheme reduces the redundant rating information by comparing the recent update times of the rating information. It is shown through performance evaluation that the proposed scheme reduces the number of messages and improves the accuracy of trust over the existing scheme.