• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.437-449
• /
• 2009

In this paper, we calculate the number of points on elliptic curves $E^{a^3}_0:y^2=x^3+a^3$ over ${\mathbb{F}}_p$ mod 24 and $E^b_0:y^2=x^3+b$ over ${\mathbb{F}}_p$ mod 6, where b is cubic non-residue in ${\mathbb{F}}^*_p$. For example, if p ${\equiv}$ 1 (mod 12) is a prime, and a and a(2t - 3) are quadratic residues modulo p with $3t^2{\equiv}1$ (mod p), then the number of points in $E^{a^3}_0:y^2=x^3+a^3$ is congruent to 0 modulo 24.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.2
• /
• pp.105-111
• /
• 2005

Though GF(2) CA can only handle data with bit units GF(2p) CA can handle data with units more than bit units. In this paper we analyze the state-transition of nongroup cellular automata(CA) with a single attractor over GF(2p). And we propose the constructing method the state-transition diagram of a linear SACA over GF(2p) by using the concept of basic path. Also we propose the state-transition diagram of the nonlinear complemented SACA by using the state-transition diagram of a linear SACA.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.799-818
• /
• 2010

In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic and P2P network partition in mobile ad hoc network (MANET). We propose an approach to construct an efficient unstructured P2P overlay over MANET using underlying cluster-based routing (CBRP). One of the peers in the P2P network is used as a root-peer to connect all peers. Each peer maintains connection with physically closer peers such that it can reach the root-peer. The peer constructs a minimum-spanning tree consisting of itself, its directly connected neighbor peers and 2-hop away neighbor peers to remove far away redundant links and to build an overlay closer to the physical network. Due to on-demand nature of inter-cluster routing of CBRP, the positioning algorithm for MANET is used to retrieve the file by a peer from the source peer via shorter path in the physical network. We can show by simulation that our approach performs better in comparison with the existing approach.

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.369-380
• /
• 2009

Let $X,X_1,X_2,\;{\cdots}$ be identically distributed and negatively associated random variables with mean zeros and positive, finite variances. We prove that, if $E{\mid}X_1{\mid}^r$ < ${\infty}$, for 1 < p < 2 and r > $1+{\frac{p}{2}}$, and $lim_{n{\rightarrow}{\infty}}n^{-1}ES^2_n={\sigma}^2$ < ${\infty}$, then $lim_{{\epsilon}{\downarrow}0}{\epsilon}^{{2(r-p}/(2-p)-1}{\sum}^{\infty}_{n=1}n^{{\frac{r}{p}}-2-{\frac{1}{p}}}E\{{{\mid}S_n{\mid}}-{\epsilon}n^{\frac{1}{p}}\}+={\frac{p(2-p)}{(r-p)(2r-p-2)}}E{\mid}Z{\mid}^{\frac{2(r-p)}{2-p}}$, where $S_n\;=\;X_1\;+\;X_2\;+\;{\cdots}\;+\;X_n$ and Z has a normal distribution with mean 0 and variance ${\sigma}^2$.

• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.477-482
• /
• 2010

Recently, advanced Internet applications such as Internet telephone, multimedia streaming, and file sharing have appeared. Especially, P2P or web-based file sharing applications have been notorious for their illegal usage of contents and massive traffic consumption by a few users. This paper presents a novel method to identify the P2P or web-based file names with traffic monitoring. For this purpose, we have utilized the Korean decoding method on the IP packet payload. From experiments, we have shown that the file names requested by BitTorrent, Clubbox, and Tple applications could be correctly identified.

• Korean Journal of Clinical Laboratory Science
• /
• v.49 no.2
• /
• pp.128-134
• /
• 2017

Der p 1 and Der p 2 are essential allergens of house dust mite associated with the development of asthma. In the present study, we examined whether Der p 1 and Der p 2 induce a release of S100A8 and S100A9 in monocytes, which are involved in the regulatory mechanism of neutrophil apoptosis. We found that Der p 1 and Der p 2 significantly increased the secretion of S100A8 and S100A9 in normal monocytes. Moreover, S100A8 and S100A9 strongly suppressed the spontaneous apoptosis of normal and asthmatic neutrophils. The inhibitory effect of S100A9 was stronger than that of S100A8, and asthmatic neutrophils showed a higher inhibitory effect than normal neutrophils. S100A8 and S100A9 induced activation of Lyn, Akt, and ERK in a time-dependent manner. These findings elucidate the roles of Der p 1 and Der p 2 in the interaction between monocytes and neutrophils, as well as contributing to our knowledge of the pathogenesis of allergic diseases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.73-85
• /
• 2004

SIn this paper, we introduce our experience for designing and implementing new concept of a global XML-based Peer-to-Peer (P2P) engine to support various P2P applications, and interconnection among PC, Web and mobile computing environments. The proposed P2P engine can support to heterogeneous data exchanges and web interconnection by facilitating with the text-base XML while message exchange are necessary. It is also to provide multi-level security functions as well as to apply different types of security algorithms. The system consist of four modules; a message dispatcher to scheduling and filtering the message, a SecureNet to providing security services and data transmission, a Discovery Manager to constructing peer-to-peer networking, and a Repository Manager to processing data management including XML documents. As a feasibility test, we implement various P2P services such as chatting as a communication service, white-board as an authoring tool set during collaborative working, and a file system as a file sharing service. We also compared the proposed system to a Gnutella in order to measure performance of the systems.

• Archives of Pharmacal Research
• /
• v.27 no.2
• /
• pp.199-205
• /
• 2004

Cytochrome P450 (P450) 1 enzymes such as P450 1A1, 1A2, and 181 are known to be involved in the oxidative metabolism of various procarcinogens and are regarded as important target enzymes for cancer chemoprevention. Previously, several hydroxystilbene compounds were reported to inhibit P450 1 enzymes and were rated as candidate chemopreventive agents. In this study, we investigated the inhibitory effect of 2-[2-(3,5-dimethoxyphenyl)vinyl]-thiophene (DMPVT), produced from the chemical modification of oxyresveratrol, on the activities of P450 1 enzymes. The inhibitory potential by DMPVT on the P450 1 enzyme activity was evaluated with the Escherichia coli membranes of the recombinant human cytochrome P450 1A1, 1A2, or 1B1 coexpressed with human NADPH-P450 reductase. DMPVT significantly inhibited ethoxyresorufin O-deethylation (EROD) activities with $IC_{50}$ values of 61, 11, and 2 nM for 1A1, 1A2, and 1B1, respectively. The EROO activity in OMBA-treated rat lung microsomes was also significantly inhibited by OMPVT in a dose-dependent manner. The modes of inhibition by DMPVT were non-competitive for all three P450 enzymes. The inhibition of P450 1B1-mediated EROD activity by OMPVT did not show the irreversible mechanism-based effect. The loss of EROD activity in P450 1B1 with OMPVT incubation was not blocked by treatment with the trapping agents such as glutathione, N-acetylcysteine, or dithiothreitol. Taken together, the results suggested DMPVT to be a strong noncompetitive inhibitor of human P450 1 enzymes that should be considered as a good candidate for a cancer chemopreventive agent in humans.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.421-426
• /
• 2007

The problem of vertex labeling with a condition at distance two in a graph, is a variation of Hale's channel assignment problem, which was first explored by Griggs and Yeh. For positive integer $p{\geq}q$, the ${\lambda}_{p,q}$-number of graph G, denoted ${\lambda}(G;p,q)$, is the smallest span among all integer labellings of V(G) such that vertices at distance two receive labels which differ by at least q and adjacent vertices receive labels which differ by at least p. Van den Heuvel and McGuinness have proved that ${\lambda}(G;p,q){\leq}(4q-2){\Delta}+10p+38q-24$ for any planar graph G with maximum degree ${\Delta}$. In this paper, we studied the upper bound of ${\lambda}_{p,q}$-number of some planar graphs. It is proved that ${\lambda}(G;p,q){\leq}(2q-1){\Delta}+2(2p-1)$ if G is an outerplanar graph and ${\lambda}(G;p,q){\leq}(2q-1){\Delta}+6p-4q-1$ if G is a Halin graph.

• Journal of the Korean Chemical Society
• /
• v.31 no.1
• /
• pp.94-97
• /
• 1987

In a converting reaction of $p-bromo-\alpha-diethylaminoacetophenone$ (1a) and $p-bromo-\alpha-piperidinoacetophenone$ (1b) with KCN and $(NH_4)_2CO_3$, to hydantoin, the expected 5-(p-bromophenyl)-5-diethylaminomethylhydantion (2a) and 5-(p-bromophenyl)-5-piperidinomethylhydantoin (2b) were not formed. Diethylaminomethyl group and piperidinomethyl group were eliminated and p,p'-dibromodiphenylhydantil (4), which might be formed through dimerization of 5-(bromophenyl)-hydantoin (3), and p-bromobenzoic acid (5), which was formed through a degradation of 5-(bromophenyl)-hydantoin, were obtained. In the case of $p-bromo-\alpha-morpholinoacetophenone$ (1c), the expected 5-(p-bromophenyl)-5-morpholinomethylhydantoin (2c) was formed.