• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.109-115
• /
• 2008

In the P2P distributed system, such peers don't always keep on-line status. P2P systems are different from the ordinary systems that such peers are organically operated as the elements of system. In this case, users using P2P system are able to loss the reliability. At this point, many P2P studies are tried to resolve these problems. In this paper, we suggest a P2P search algorithm for multidirectional processing about the resources to be downloading. In existing studies, the loading rate is very high to select new resources supported peer, so we suggest new solution in this study.

• Asian Pacific Journal of Cancer Prevention
• /
• v.13 no.9
• /
• pp.4315-4320
• /
• 2012

Background: The P53 tumor suppressor gene plays a pivotal role in maintaining cellular homeostasis by preventing the propagation of genome mutations. P53 in its transcriptionally active form is capable of activating distinct target genes that contribute to either apoptosis or growth arrest, like P21. However, the MDM2 gene is a major negative regulator of P53. Single nucleotide polymorphisms (SNP) in codon Arg72Pro of P53 results in impairment of the tumor suppressor activity of the gene. A similar effect is caused by a SNP in codon 31 of P21. In contrast, a SNP in position 309 of MDM2 results in increased expression due to substitution of thymine by guanine. All three polymorphisms have been associated with increased risk of tumorigenesis. Aim of the study: We aimed to study the prevalence of SNPs in the P53 pathway involving the three genes, P53, P21 and MDM2, among acute myeloid leukemia (AML) patients and to compare it to apparently normal healthy controls for assessment of impact on risk. Results: We found that the P21 ser31arg heterozygous polymorphism increases the risk of AML (P value=0.017, OR=2.946, 95% CI=1.216-7.134). Although the MDM2 309G allele was itself without affect, it showed a synergistic effect with P21 ser/arg polymorphism (P value=0.003, OR=6.807, 95% CI=1.909-24.629). However, the MDM2 309T allele abolish risk effect of the P21 polymorphic allele (P value=0.71). There is no significant association of P53 arg72pro polymorphism on the risk of AML. Conclusion: We suggest that SNPs in the P53 pathway, especially the P21 ser31arg polymorphism and combined polymorphisms especially the P21/MDM2 might be genetic susceptibility factors in the pathogenesis of AML.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.139-145
• /
• 2012

Generally, Quicksort selects the pivot from leftmost, rightmost, middle, or random location in the array. This paper suggests Quicksort using middle range pivot $P_0$ and continually divides into 2. This method searches the minimum value $L$ and maximum value $H$ in the length n of list $A$. Then compute the initial pivot key $P_0=(H+L)/2$ and swaps $a[i]{\geq}P_0$,$a[j]<P_0$ until $i$=$j$ or $i$>$j$. After the swap, the length of list $A_0$ separates in two lists $a[1]{\leq}A_1{\leq}a[j]$ and $a[i]{\leq}A_2{\leq}a[n]$ and the pivot values are selected by $P_1=P_0/2$, $P_2=P_0+P_1$. This process repeated until the length of partial list is two. At the length of list is two and $a$[1]>$a$[2], swaps as $a[1]{\leftrightarrow}a[2]$. This method is simpler pivot key process than Quicksort and improved the worst-case computational complexity $O(n^2)$ to $O(n{\log}n)$.

• 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.

• 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.

• 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.

• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.25-33
• /
• 2002

The efficiency of the data share service of P2P method is decided by the maintaining guard method of a sharing list, This paper suggests the data sharing system of the P2P base that it should retain a shared data list at a client, The Server at a proposed system guards inclusively client. divided into several groups and at each individual group, a client appointed the TopHost uses the method guarding a free share list of a applicating group, The TopHost designs to execute it relating with server in case of the mergence and the division of a group as well as a maintaining management of a data share list, The efficiency of the suggested system regard the maintaining guard of groups formed of a client of the appropriate level of a kernel and exams examination to measure it through a really executed data share service.

• Biomedical Science Letters
• /
• v.7 no.2
• /
• pp.65-70
• /
• 2001

We have carried out PCR reactions to investigate if cytochrome P450 (P450) enzymes (1A1, 1A2, 2C8, 2E1 and 3A4), which are well hewn to be the key enzymes in detoxification process and/or synthesis of steroids in the liver, are expressed in the human brain, too. P450 1A1, 2C8 and 2E1 were expressed clearly. However, P450 1A2 and 3A4 were not detectable. Their expression levels in the human brain could be extremely low or they were not expressed at all. One base substitution at nucleotide 290 (A->G) was identified in P450 1A1. It is suspected to be an individual polymorphism. Our results should contribute to the better understanding of the role of cytochrome P450 enzymes in the human brain.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.2
• /
• pp.62-64
• /
• 2006

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 based unstructured P2P systems have been found very effective by dividing the peers into two layers, super-peer and ordinary-peer Super-peers deal with all queries instead of ordinary-peers. The existing P2P systems assume all super-peers have equal responsibility and capabilities even if all super-peers have relative advantages and disadvantages. In this paper, we suggest the ISP2P (Intelligent Super-peer based P2P) which allows to select the best super peer to ordinary-peers. We classify super peers according as the capacity of an ordinary-peer a super-peer. We show that these considerations could improve the performance of the response time and Provide higher quality results to all peers in the network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.669-675
• /
• 2008

For an odd prime p, n=4k and $d=((p^2k+1)/2)^2$, there are $(p^{2k}+1)/2$ distinct decimated sequences, s(dt+1), $0{\leq}l<(p^{2k}+1)/2$, of a p-ary m-sequence, s(t) of period $p^n-1$. In this paper, it is shown that the cross-correlation function between s(t) and s(dt+l) takes the values in $\{-1,-1{\pm}\sqrt{p^n},-1+2\sqrt{p^n}\}$ and their, cross-correlation distribution is also derived.