• Title/Summary/Keyword: P.P.A.

Search Result 116,781, Processing Time 0.098 seconds

An Effective Backtracking Search Algorithm for the P2P Resources (효과적인 역 추적 P2P 자원 검색 알고리즘)

  • Kim, Boon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.49-57
    • /
    • 2007
  • The P2P distributed systems are proceeded various studies lively to use the idleness computing resources under the network connected computing environments. It's a general mean to communication from the peer of the shortest downloaded time among same target files to be searched. The P2P search algorithms are very important primary factor to decide a real downloaded time in the criteria to select the peer of a shortest downloaded time. However the peer to give resources could be changed into offline status because the P2P distributed systems have very weakness connection. In these cases. we have a choice to retransmit resources mainly. In this study, we suggested an effective backtracking search algorithm to improve the performance about the request to retransmit the resource.

  • PDF

An Application of MapReduce Technique over Peer-to-Peer Network (P2P 네트워크상에서 MapReduce 기법 활용)

  • Ren, Jian-Ji;Lee, Jae-Kee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.8
    • /
    • pp.586-590
    • /
    • 2009
  • The objective of this paper describes the design of MapReduce over Peer-to-Peer network for dynamic environments applications. MapReduce is a software framework used for Cloud Computing which processing large data sets in a highly-parallel way. Based on the Peer-to-Peer network character which node failures will happen anytime, we focus on using a DHT routing protocol which named Pastry to handle the problem of node failures. Our results are very promising and indicate that the framework could have a wide application in P2P network systems while maintaining good computational efficiency and scalability. We believe that, P2P networks and parallel computing emerge as very hot research and development topics in industry and academia for many years to come.

[Retracted]Effects of emotional labor and job stress on turnover intention among firefighters ([논문철회]소방공무원의 직무스트레스와 감정노동이 이직의도에 미치는 영향)

  • Hyo-Cheol, Lee
    • The Korean Journal of Emergency Medical Services
    • /
    • v.26 no.3
    • /
    • pp.21-35
    • /
    • 2022
  • Purpose: The purpose of this study was to investigate the effects of firefighters' job stress and emotional labor on their turnover intention, and analyze the main factors impacting turnover intention in this context. Methods: Based on a descriptive survey study design, we administered a structured questionnaire among 231 firefighters at one fire station in G metropolitan city from November 13 to 27, 2020. Results: Regarding job stress, participants showed differences based on marital status (p<.05), health status (p<.001), total service period (p<.05), and assignment (p<.05). For emotional labor, a significantly higher rate was observed for female than male firefighters (p<.05), with differences also observed in age (p<.001), health status (p<.001), total service period (p<.05), rank (p<.001), and assignment (p<.05). Further, for turnover intention, significant differences were noted with respect to age (p<.001), education (p<.01), health status (p<.001), total service period (p<.01), work unit (p<.05), rank (p<.001), and assignment (p<.05). A significant correlation was found between job stress and emotional labor and turnover intention. Regarding the factors affecting turnover intention, significant differences were noted based on education, rank, job stress, and emotional labor; the explanatory power was 53.9% (F=13.806, p<.001). Conclusion: Tailored support programs must be developed to ease firefighters' job stress and reduce their emotional labor to facilitate effective manpower management and reduce firefighters' turnover intention.

SOME CLASSES OF MULTIVALENT FUNCTIONS WITH NEGATIVE COEFFICIENTS I

  • AUOF, M.K.;DARWISH, H.E.
    • Honam Mathematical Journal
    • /
    • v.16 no.1
    • /
    • pp.119-135
    • /
    • 1994
  • Let $Q_{n+p-1}(\alpha)$ denote the- dass of functions $$f(z)=z^{P}-\sum_{n=0}^\infty{a_{(p+k)}z^{p+k}$$ ($a_{p+k}{\geq}0$, $p{\in}N=\left{1,2,{\cdots}\right}$) which are analytic and p-valent in the unit disc $U=\left{z:{\mid}z:{\mid}<1\right}$ and satisfying $Re\left{\frac{D^{n+p-1}f(\approx))^{\prime}}{pz^{p-a}\right}>{\alpha},0{\leq}{\alpha}<1,n>-p,z{\in}U.$ In this paper we obtain sharp results concerning coefficient estimates, distortion theorem, closure theorems and radii of p-valent close-to- convexity, starlikeness and convexity for the class $Q_{n+p-1}$ ($\alpha$). We also obtain class preserving integral operators of the form $F(z)=\frac{c+p}{z^{c}}\int_{o}^{z}t^{c-1}f(t)dt.$ c>-p $F\left(z\right)=\frac{c+p}{z^{c}}\int_{0}^{z} t^{c-1}f\left(t \right)dt. \qquad c>-p$ for the class $Q_{n+p-1}$ ($\alpha$). Conversely when $F(z){\in}Q_{n+p-1}(\alpha)$, radius of p-valence of f(z) has been determined.

  • PDF

A Study on Location-based Routing Technique for Improving the Performance of P2P in MANET (MANET에서 P2P 성능 향상을 위한 위치기반 라우팅 기법에 관한 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.2
    • /
    • pp.37-45
    • /
    • 2015
  • The technology development of MANET and dissemination of P2P services has been made very widely. In particular, the development of many application services for the integration of P2P services in MANET has been made actively. P2P networks are commonly used because of the advantages of efficient use of network bandwidth and rapid information exchange. In P2P network, the infrastructure managing each node in the middle does not exist and each node is a structure playing a role as the sender and receiver. Such a structure is very similar to the structure of the MANET. However, it is difficult to provide reliable P2P service due to the high mobility of mobile nodes. In this paper, we propose location-based routing technique in order to provide efficient file sharing and management between nodes. GMN managing the group is elected after network is configured to the area of a certain size. Each node is assigned an identifier of 12 bit dynamically to provide routing which uses location information to the identifier. ZGT is managed in the GMN in order to provide management of group nodes and distributed cache information. The distributed cache technique is applied to provide a rapid retrieval of the sharing files in the each node. The excellent performance of the proposed technique was confirmed through experiments.

WEAKLY DENSE IDEALS IN PRIVALOV SPACES OF HOLOMORPHIC FUNCTIONS

  • Mestrovic, Romeo;Pavicevic, Zarko
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.2
    • /
    • pp.397-420
    • /
    • 2011
  • In this paper we study the structure of closed weakly dense ideals in Privalov spaces $N^p$ (1 < p < $\infty$) of holomorphic functions on the disk $\mathbb{D}$ : |z| < 1. The space $N^p$ with the topology given by Stoll's metric [21] becomes an F-algebra. N. Mochizuki [16] proved that a closed ideal in $N^p$ is a principal ideal generated by an inner function. Consequently, a closed subspace E of $N^p$ is invariant under multiplication by z if and only if it has the form $IN^p$ for some inner function I. We prove that if $\cal{M}$ is a closed ideal in $N^p$ that is dense in the weak topology of $N^p$, then $\cal{M}$ is generated by a singular inner function. On the other hand, if $S_{\mu}$ is a singular inner function whose associated singular measure $\mu$ has the modulus of continuity $O(t^{(p-1)/p})$, then we prove that the ideal $S_{\mu}N^p$ is weakly dense in $N^p$. Consequently, for such singular inner function $S_{\mu}$, the quotient space $N^p/S_{\mu}N^p$ is an F-space with trivial dual, and hence $N^p$ does not have the separation property.

Cloud P2P OLAP: Query Processing Method and Index structure for Peer-to-Peer OLAP on Cloud Computing (Cloud P2P OLAP: 클라우드 컴퓨팅 환경에서의 Peer-to-Peer OLAP 질의처리기법 및 인덱스 구조)

  • Joo, Kil-Hong;Kim, Hun-Dong;Lee, Won-Suk
    • 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.

COMBINATORIAL PROOF FOR e-POSITIVITY OF THE POSET OF RANK 1

  • Lee, Jaejin
    • Korean Journal of Mathematics
    • /
    • v.16 no.3
    • /
    • pp.425-437
    • /
    • 2008
  • Let P be a poset and G = G(P) be the incomparability graph of P. Stanley [7] defined the chromatic symmetric function $X_{G(P)}$ which generalizes the chromatic polynomial ${\chi}_G$ of G, and showed all coefficients are nonnegative in the e-expansion of $X_{G(P)}$ for a poset P of rank 1. In this paper, we construct a sign reversing involution on the set of special rim hook P-tableaux with some conditions. It gives a combinatorial proof for (3+1)-free conjecture of a poset P of rank 1.

  • PDF

The Study on the effects of hemodynamics in sleep deprivation (수면 박탈이 혈동태에 끼치는 영향)

  • Kim Gyeong-Cheul
    • Journal of Society of Preventive Korean Medicine
    • /
    • v.3 no.1
    • /
    • pp.125-145
    • /
    • 1999
  • The effects of Wang-ttum, Magnetic Water, Magnetic field and Sibjeondaebotang on hemodynamics in sleep deprivation were studied. The results as follows; 1. In case of Wang-ttum operated group, significant changes were observed at 12 p.m., 2 a.m., 4 a.m. in maximum blood pressure for the first and second overnight stay and at 2 a.m. for the third and, respectively, average blood pressure at 12 p.m., 2 a.m. for the 1st and 2nd overnight stay, minimum blood pressure at 10 p.m.. 12 p.m.. 2 a.m. for the 1st overnight stay and at 10 p.m., 12 p.m. for the 2nd and at 12 p.m. for the 3rd, pulse rate at 12 p.m., 2 a.m., 4 a.m., 6 a.m., for 1st and 2nd and at 2 a.m., 4 a.m. for the 3rd and 4th, TP-KS at 12 p.m., 2 a.m., 4 a.m., 6 a.m. for the 1st and 2nd and at 2 a.m., 4 a.m., 6 a.m. for the 3rd, PRP at 10 p.m., 12 p.m., 2 a.m., 4 a.m., 6 a.m. for the 1st and 2nd and at 12 p.m., 2 a.m., 4 a.m. for the 3rd and at 2 a.m., 4 a.m. for the 4th, TPR at 10 p.m., 12 p.m., 2 a.m., 4 a.m., 6 a.m. from 1st to 4th overnight stay. 2. In case of taking magnetic water group, significant changes were observed at 2 a.m., 4 a.m. in pulse rate for the 1st overnight stay and, respectively, PRP at 2 a.m. for the 1st, TRP at 10 p.m., 12 p.m., 2 a.m., 4 a.m., 6 a.m. for the 1st and 4th. 3. In case of attaching magnet group, TPR was significantly observed at 10 p.m. for the 1st overnight stay. 4. In case of medicating Sibjeondaebotang group, significant changes were observed at 10 p.m., 12 p.m., 2 a.m., 4 a.m., 6 a.m. in maximum blood pressure for the 1st and 2nd overnight stay and at 12 p.m., 2 a.m., 4 a.m., 6 a.m. for the 3rd and at 2 a.m., 4 a.m., 6 a.m. for the 4th and, respectively, average blood pressure at 10 p.m., 12 p.m. for the 1st and 2nd and at 10 p.m. for the 3rd and 4th, minimum blood pressure at 10 p.m., 12 p.m. from 1st to 4th, pulse rate at 2 a.m., 4 a.m., 6 a.m. from 1st to 3rd and at 2 a.m., 4 a.m. for the 4th, TP-KS at 10 p.m., 12 p.m., 2 a.m., 4a.m., 6 a.m. for the 1st and at 10 p.m., 2 a.m., 4 a.m., 6 a.m. for the 2nd and at 2 a.m., 4 a.m., 6 a.m. for the 3rd and at 6 a.m. for the 4th, PRP at 12 p.m., 2 a.m., 4 a.m., 6 a.m. for the 1st and at 10 p.m., 12 p.m., 2 a.m., 4 a.m., 6 a.m. for the 2nd and 3rd and at 12 p.m., 2 a.m., 4 a.m., 6 a.m. for the 4th, TPR at 10 p.m., 12 p.m., 2 a.m., 4 a.m., 6 a.m. from 1st to 4th. As mentioned obove, the effects of Wangttum and Sibjeondaebotang on hemodynamics in sleep deprivation were observed both the impulse of SIM-YANG and mutual function of QI-HYOL. The effects of Magnetic water and Magnetic field were observed the side of mutual function of QI-HYOL.

  • PDF

A study of real-time media streaming delivery over P2P networks (P2P 환경에서 실시간 미디어스트리밍의 전송에 관한 연구)

  • Liu Xu-dong;Jo In-June
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.538-541
    • /
    • 2006
  • Recently researches of P2P media streaming have been actively published, but the research what kind of P2P overlay networks are better to delivering media data has not been attended. This paper designs a P2P streaming media system model. In this system, we constructs a Half-Structure P2P overlay protocol based on node's capability as the infrastructure of streaming application, which utilizes the heterogeneity of the nodes to maintain topology, presents a active contents diffusing algorithm and Two-stage search algorithm, make it possible for nodes in P2P system to collect information according their capacity and reduces the number of forwarding packet compared with flooding. Also, we give an optimal scheme to scheduling media data.

  • PDF