• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1760-1768
• /
• 2004

A P2P is a method that can share and exchange on digital resources through a direct connection on personnel without a central server. In this paper, we apply a P2P technology to a traditional electronic commerce method so that a seller and a customer can perform a commercial transaction through a direct communication. As such a result, we propose a new e-Commerce model on P2P environment to assure fairness in commercial transactions. To achieve our goal, we put an escrow server which is responsible for guarantee fair contents delivery and payment for the contents between a seller and a customer. When a customer buys content, he first obtains reputation values implicating reliability for the content and refers to these values to determine purchase. The proposed scheme, we can improve the reliability for the purchasing content and provide the fairness to both a seller and a customer simultaneously.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1015-1024
• /
• 2011

Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.

• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.157-172
• /
• 2011

The latest active studies on distributed OLAP to adopt a distributed environment are mainly focused on DHT P2P OLAP and Grid OLAP. However, these approaches have its weak points, the P2P OLAP has limitations to multidimensional range queries in the cloud computing environment due to the nature of structured P2P. On the other hand, the Grid OLAP has no regard for adjacency and time series. It focused on its own sub set lookup algorithm. To overcome the above limits, this paper proposes an efficient central managed P2P approach for a cloud computing environment. When a multi-level hybrid P2P method is combined with an index load distribution scheme, the performance of a multi-dimensional range query is enhanced. The proposed scheme makes the OLAP query results of a user to be able to reused by other users' volatile cube search. For this purpose, this paper examines the combination of an aggregation cube hierarchy tree, a quad-tree, and an interval-tree as an efficient index structure. As a result, the proposed cloud P2P OLAP scheme can manage the adjacency and time series factor of an OLAP query. The performance of the proposed scheme is analyzed by a series of experiments to identify its various characteristics.

• Composites Research
• /
• v.13 no.6
• /
• pp.1-8
• /
• 2000

The fabrication Process of $Al_2O_{3p}$/AC8A composites by pressureless infiltration technique and the effects of additive Mg content and volume fraction of particulate reinforcement on mechanical and wear properties were investigated. It was found that the bending strength decreased with increasing volume fraction of $Al_2O_{3p}$ particles. Whereas hardness increased with volume fraction of $Al_2O_{3p}$ particles. The decrement of strength in case of high volume fraction of $Al_2O_{3p}$ particles was attributed to high porosity level. In terms of additive Mg content, $Al_2O_{3p}$/AC8A composites containing around 5~7wt% of additive Mg indicated the highest strength, and hardness values increased with additive Mg contents. Wear resistance of AC8A alloy were improved by reinforcement of $Al_2O_{3p}$ particles especially at high sliding velocity. Wear property of $Al_2O_{3p}$/AC8A composites and AC8A alloy exhibited different aspects. $Al_2O_{3p}$/AC8A composites indicated more wear loss than AC8A alloy at slow velocity region. However a transition point of wear loss was found at middle velocity region which shows the minimum wear loss and wear loss at high velocity region exhibited almost same value as at slow velocity region, whereas wear loss of AC8A alloy almost linearly increased with sliding velocity. It was found that $Al_2O_{3p}$/AC8A composites containing $Al_2O_{3p}$ volume fraction of 20% exhibited abrasive wear surface regardless of sliding velocity and $Al_2O_{3p}$/AC8A composites containing $Al_2O_{3p}$ volume fraction of 40% showed slightly adhesive wear surface at low sliding velocity, and it progressed to severe wear as increasing the sliding velocity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1783-1789
• /
• 2004

It is evaluated that there is infinit capability of creating new e business using P2P program. but the research for the method to protect the copyright of digital contents is urgent even for development of the p2p service because the problem of copyright protection for digital contents is not solved. Though this article, it can be induced that reliable contents sharing use to a flow fund by secure settlement architecture, user authentication and contents encryption and then it as the problem of copyright fee is solved, it is able to discontinue which trouble with a creation work for copyright fee and protection it's once again as growth of p2p market, p2p protocal is will be grow into a important protocal of advanced network. In this article, When users send digital contants to each other in internet, we proposed the P2P DRM algorism to offer a security function which using the technology of copyright management to use a AES Algorithm based on PKI.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.1209-1219
• /
• 2018

We provide a direct proof of the following theorem of Kalton, Hollenbeck, and Verbitsky [7]: let H be the Hilbert transform and let a, b be real constants. Then for 1 < p < ${\infty}$ the norm of the operator aI + bH from $L^p(\mathbb{R})$ to $L^p(\mathbb{R})$ is equal to $$\({\max_{x{\in}{\mathbb{R}}}}{\frac{{\mid}ax-b+(bx+a){\tan}{\frac{\pi}{2p}}{\mid}^p+{\mid}ax-b-(bx+a){\tan}{\frac{\pi}{2p}}{\mid}^p}{{\mid}x+{\tan}{\frac{\pi}{2p}}{\mid}^p+{\mid}x-{\tan}{\frac{\pi}{2p}}{\mid}^p}}\)^{\frac{1}{p}}$$. Our proof avoids passing through the analogous result for the conjugate function on the circle, as in [7], and is given directly on the line. We also provide new approximate extremals for aI + bH in the case p > 2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.728-733
• /
• 2009

An ubiquitous environment has features like peer-to-peer and nomadic environments. Such features can be represented by peer-to-peer systems and mobile ad-hoc networks. P2P systems and MANETs share similar features, appealing for implementing P2P systems in MANET environment. However, if a P2P system designed for wired networks was applied to mobile ad-hoc environment, its performance was not good enough. Subsequently, this paper proposes a P2P system to improve performance using cross-layer design and the goodness of a node as a peer by using routing metric and P2P metric to choose favorable peers to connect. It also utilizes proactive approach for distributing peer information. The simulation results showed that the proposed system produced better performance in query success rate, query response time and energy consumption by reducing the routing path length.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2143-2159
• /
• 2011

The hybrid architecture of content delivery networks (CDN) and peer-to-peer overlay networks (P2P) is a promising technology enables effective real-time streaming services. It complements the advantages of quality control and reliability in a CDN, and the scalability of a P2P system. With real-time streaming services, however, high connection setup and media delivery latency are becoming the critical issues in deploying the CDN-P2P system. These issues result from biased peer selection without location awareness or content awareness, and can lead to significant service disruption. To reduce service disruption latency, we propose a group-based CDN-P2P hybrid architecture (iCDN-P2P) with a location/content-aware selection of peers. Specifically, a SuperPeer network makes a location-aware peer selection by employing a content addressable network (CAN) to distribute channel information. It also manages peers with content awareness, forming a group of peers with the same channel as the sub-overlay. Through a performance evaluation, we show that the proposed architecture outperforms the original CDN-P2P hybrid architecture in terms of connection setup delay and media delivery time.

• Kyungpook Mathematical Journal
• /
• v.48 no.1
• /
• pp.15-24
• /
• 2008

Let $N{\geq}1$ and p > 1. Let ${\Omega}$ be a domain of $\mathbb{R}^N$. In this article we shall establish Kato's inequalities for quasilinear degenerate elliptic operators of the form $A_pu$ = divA(x,$\nabla$u) for $u{\in}K_p({\Omega})$, ), where $K_p({\Omega})$ is an admissible class and $A(x,\xi)\;:\;{\Omega}{\times}\mathbb{R}^N{\rightarrow}\mathbb{R}^N$ is a mapping satisfying some structural conditions. If p = 2 for example, then we have $K_2({\Omega})\;= \;\{u\;{\in}\;L_{loc}^1({\Omega})\;:\;\partial_ju,\;\partial_{j,k}^2u\;{\in}\;L_{loc}^1({\Omega})\;for\;j,k\;=\;1,2,{\cdots},N\}$. Then we shall prove that $A_p{\mid}u{\mid}\;\geq$ (sgn u) $A_pu$ and $A_pu^+\;\geq\;(sgn^+u)^{p-1}\;A_pu$ in D'(${\Omega}$) with $u\;\in\;K_p({\Omega})$. These inequalities are called Kato's inequalities provided that p = 2. The class of operators $A_p$ contains the so-called p-harmonic operators $L_p\;=\;div(\mid{{\nabla}u{\mid}^{p-2}{\nabla}u)$ for $A(x,\xi)={\mid}\xi{\mid}^{p-2}\xi$.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.1
• /
• pp.21-28
• /
• 2006

This paper describes the design and implementation of video conference system using hybrid type P2P(Peer to Peer). The proposed video conference system has hybrid type P2P architecture based on a client-server and P2P(Peer to Peer), where client-server is used for exchange of account management, client list and status information and P2P is used for the real time video conference. The proposed video conference system decreases the traffic of server, and cuts down the load of a network. Because the multimedia data is decentralized to client by P2P. Also, this system is tested by the multi-party video conference system using communication protocol and application software through high speed networks.