• 제목/요약/키워드: prime number

검색결과 372건 처리시간 0.022초

동적 XML 데이타 스트링의 안전한 질의 처리를 위한 효율적인 접근제어 레이블링 (Efficient Access Control Labeling for Secure Query Processing on Dynamic XML Data Streams)

  • 안동찬;박석
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제36권3호
    • /
    • pp.180-188
    • /
    • 2009
  • 유비쿼터스 데이타 스트림 환경에서 동적 XML 데이타 스트림에 대한 효율적이고 안전한 접근제어 기법은 최근에 활발한 연구분야가 되어왔다. 본 논문에서 동적 XML 데이타 스트림 환경에서 효율적이고 안전한 접근제어를 위한 향상된 롤-기반 소수 레이블링 기법을 제안한다. 또한 지속적으로 갱신되는 XML 문서의 효율적인 레이블링 기법과 효율적이고 안전한 접근제어를 위한 기존연구의 문제점을 지적한다. 제안하는 향상된 레이블링 기법은 문서가 갱신될 때 다시 레이블링 하지 않고도 노드 사이의 조상-후손 관계와 형제 관계를 유지할 수 있으며, 레이블의 충돌 없이 XML 트리에 임의의 지속적인 노드 삽입 또는 갱신을 지원한다. 또한, 롤-기반 소수 레이블링 기법을 통해 효율적인 접근제어를 구현하였다. 끝으로 본 논문의 제안 방법이 효율적이고 안전함을 실험을 통해 보여줄 것이다.

A NEW CHARACTERIZATION OF ALTERNATING AND SYMMETRIC GROUPS

  • ALAVI S. H.;DANESHKHAW A.
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.245-258
    • /
    • 2005
  • In this paper we prove that the alternating groups A_n, for n = p, p+1, p+2 and symmetric groups $S_n$, for n = p, p+1, where p$\ge$3 is a prime number, can be uniquely determined by their order components. As one of the important consequence of this characterization we show that the simple groups An, where n = p, p+1, P+2 and p$\ge$3 is prime, satisfy in Thompson's conjecture and Shi's conjecture.

ABOUT THE PERIOD OF BELL NUMBERS MODULO A PRIME

  • Car, Mireille;Gallardo, Luis H.;Rahavandrainy, Olivier;Vaserstein, Leonid N.
    • 대한수학회보
    • /
    • 제45권1호
    • /
    • pp.143-155
    • /
    • 2008
  • Let p be a prime number. It is known that the order o(r) of a root r of the irreducible polynomial $x^p-x-l$ over $\mathbb{F}_p$ divides $g(p)=\frac{p^p-1}{p-1}$. Samuel Wagstaff recently conjectured that o(r) = g(p) for any prime p. The main object of the paper is to give some subsets S of {1,...,g(p)} that do not contain o(r).

Synchronous All-Optical Code-Division Multiple-Access Local-Area Networks with Symmetric Codes

  • Lam, Pham Manh;Praepanichawat, Chanikarn
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -2
    • /
    • pp.1109-1112
    • /
    • 2002
  • A non-coherent synchronous all-optical code-division multiple-access (CDMA) network is proposed. In this network, symmetric codes derived from prime sequence codes are used. We present the construction of symmetric codes and show that the pseudo-orthogonality of the new codes is the same as that of the original prime-sequence codes while the cardinality of the new codes is larger than that of the prime sequence codes and the modified prime codes in the same field GF(p). Therefore, an optical CDMA LAN using symmetric codes can have a larger number of potential subscribers. The new codes allow designing fully programmable serial all-optical transmitter and receiver suitable for low-loss, high-capacity, optical CDMA LANs. It is also shown that compared to systems using modified prime codes the proposed system can achieve better BER performance for low received chip optical power.

  • PDF

SOME 4-TOTAL PRIME CORDIAL LABELING OF GRAPHS

  • PONRAJ, R.;MARUTHAMANI, J.;KALA, R.
    • Journal of applied mathematics & informatics
    • /
    • 제37권1_2호
    • /
    • pp.149-156
    • /
    • 2019
  • Let G be a (p, q) graph. Let $f:V(G){\rightarrow}\{1,2,{\ldots},k\}$ be a map where $k{\in}{\mathbb{N}}$ and k > 1. For each edge uv, assign the label gcd(f(u), f(v)). f is called k-Total prime cordial labeling of G if ${\mid}t_f(i)-t_f(j){\mid}{\leq}1$, $i,j{\in}\{1,2,{\ldots},k\}$ where $t_f$(x) denotes the total number of vertices and the edges labelled with x. A graph with a k-total prime cordial labeling is called k-total prime cordial graph. In this paper we investigate the 4-total prime cordial labeling of some graphs.

A Study on the Relationship between Properties of the Elliptic Curves and Performance of Elliptic Curve Method (ECM)

  • Jizhe Cui;Shin, Seung-won;Park, Jong-Uk
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2000년도 춘계정기학술대회 e-Business를 위한 지능형 정보기술 / 한국지능정보시스템학회
    • /
    • pp.475-478
    • /
    • 2000
  • Recently encryption algorithms based on difficulties of factorization have been used with popularization. Prime number factorizations are progressed rapidly. In this paper, characteristics of elliptic curve are analyzed and generation of elliptic curves suitable for prime number factorization is discussed.

  • PDF

CHARACTERIZATIONS OF A KRULL RING R[X]

  • Chang, Gyu-Whan
    • 대한수학회보
    • /
    • 제38권3호
    • /
    • pp.543-549
    • /
    • 2001
  • We show that R[X] is a Krull (Resp. factorial) ring if and only if R is a normal Krull (resp, factorial) ring with a finite number of minimal prime ideals if and only if R is a Krull (resp. factorial) ring with a finite number of minimal prime ideals and R(sub)M is an integral domain for every maximal ideal M of R. As a corollary, we have that if R[X] is a Krull (resp. factorial) ring and if D is a Krull (resp. factorial) overring of R, then D[X] is a Krull (resp. factorial) ring.

  • PDF

ON THE DENOMINATOR OF DEDEKIND SUMS

  • Louboutin, Stephane R.
    • 대한수학회보
    • /
    • 제56권4호
    • /
    • pp.815-827
    • /
    • 2019
  • It is well known that the denominator of the Dedekind sum s(c, d) divides 2 gcd(d, 3)d and that no smaller denominator independent of c can be expected. In contrast, here we prove that we usually get a smaller denominator in S(H, d), the sum of the s(c, d)'s over all the c's in a subgroup H of order n > 1 in the multiplicative group $(\mathbb{Z}/d\mathbb{Z})^*$. First, we prove that for p > 3 a prime, the sum 2S(H, p) is a rational integer of the same parity as (p-1)/2. We give an application of this result to upper bounds on relative class numbers of imaginary abelian number fields of prime conductor. Finally, we give a general result on the denominator of S(H, d) for non necessarily prime d's. We show that its denominator is a divisor of some explicit divisor of 2d gcd(d, 3).

A DENSITY THEOREM RELATED TO DIHEDRAL GROUPS

  • Arya Chandran;Kesavan Vishnu Namboothiri;Vinod Sivadasan
    • 대한수학회보
    • /
    • 제61권3호
    • /
    • pp.611-619
    • /
    • 2024
  • For a finite group G, let 𝜓(G) denote the sum of element orders of G. If ${\psi}^{{\prime}{\prime}}(G)\,=\,{\frac{\psi(G)}{{\mid}G{\mid}^2}}$, we show here that the image of 𝜓'' on the class of all Dihedral groups whose order is twice a composite number greater than 4 is dense in $[0,\,{\frac{1}{4}}]$. We also derive some properties of 𝜓'' on the class of all dihedral groups whose order is twice a prime number.