• Communications for Statistical Applications and Methods
• /
• 제13권1호
• /
• pp.135-140
• /
• 2006

The paper by Paik (1985) introduced a structural property of the designs which was related to the concordance matrix $NN^{t}$ of the design. This special property was termed Property-C. The designs which have Property-C need not calculation of the generalize inverse of C matrix for solution of reduced normal equation. Paik also mentioned that some block designs belong to Property-C. This paper show the Extended Group Divisible designs defined by Hinkelmann (1964) are included in Property-C.

• 대한수학회지
• /
• 제35권3호
• /
• pp.783-791
• /
• 1998

A random vector X on $R^{d}$ with the following properties is constructed: the distribution of X is infinitely divisible and not selfdecomposable, but every linear transformation of X to a lower-dimensional space has a selfdecomposable distribution.

• 충청수학회지
• /
• 제25권4호
• /
• pp.711-715
• /
• 2012

In terms of divisible-like modules, some equivalent conditions for an integral domain R to be a generalized GCD domain are given.

• 대한수학회논문집
• /
• 제17권4호
• /
• pp.647-673
• /
• 2002

There are many models to study topological $R^2$-planes. Unlike topological $R^2$-planes, it is difficult to find models to study topological R$^3$)-spaces. If an 4-dimensional affine plane intersects with R$^3$, we are able to get a geometrical structure on R$^3$ which is similar to R$^3$-space, and called $R^2$-divisible R$^3$-space. Such spatial geometric models is useful to study topological R$^3$-spaces. Hence, we introduce some classes of topological $R^2$-divisible R$^3$-spaces which are induced from 4-dimensional anne planes.

• Communications for Statistical Applications and Methods
• /
• 제11권1호
• /
• pp.169-179
• /
• 2004

Partially balanced diallel cross designs with m-associate classes are defined and two general methods of construction are presented. Two-associate class designs based upon group divisible, triangular, and extended group divisible association schemes obtained using the general methods are also given. Tables of designs for p$\leq$24 are also provided.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 가을 학술발표논문집 Vol.27 No.2 (1)
• /
• pp.599-601
• /
• 2000

분할 가능한 전자 화폐 시스템(divisible e-cash system)은 임의의 금액을 지불할 수 있는 전자 화폐 시스템이다. 현재까지 제안된 가장 효율적인 분할 가능한 전자 화폐 시스템은 Chan, Frankel, Tsiounis가 [9]에서 제시한 시스템이다. 본 논문에서는 Okamoto 시스템[2]의 구조를 그대로 따르면서 인출 프로토콜에 [11]의 방식을 응용한 새로운 분할 가능한 전자 화폐 시스템을 제시한다. 본 논문에서 제시한 시스템은 [9]에서 제시된 시스템보다 효율적인 분할 가능한 전자 화폐 시스템으로서 인출과 지불시에 [9]에서 제시된 시스템보다 더 적은 계산량을 필요로 한다.

• Communications for Statistical Applications and Methods
• /
• 제9권2호
• /
• pp.337-346
• /
• 2002

Complete diallel crosses using group divisible design with m=2 or n=2 and ${\lambda}_1$<${\lambda}_2$ as parameter designs become A-optimal, D-optimal designs. In case of ${\lambda}_2$=${\lambda}_1$+1, this blocked complete diallel crosses become generalized optimal designs.

• 대한수학회보
• /
• 제59권5호
• /
• pp.1289-1304
• /
• 2022

In this note, we show that a strongly 𝜙-ring R is a 𝜙-PvMR if and only if any 𝜙-torsion-free R-module is 𝜙-w-flat, if and only if any GV-torsion-free divisible R-module is nonnil-absolutely w-pure, if and only if any GV-torsion-free h-divisible R-module is nonnil-absolutely w-pure, if and only if any finitely generated nonnil ideal of R is w-projective.

• 방송공학회논문지
• /
• 제10권1호
• /
• pp.83-102
• /
• 2005

The problem of video scheduling is analyzed in the framework of divisible load scheduling. A divisible load can be divided into any number of fractions (parts) and can be processed/computed independently on the processors in a distributed computing system/network, as there are no precedence relationships. In the video scheduling, a frame can be split into any number of fractions (tiles) and can be processed independently on the processors in the network, and then the results are collected to recompose the single processed frame. The divisible load arrives at one of the processors in the network (root processor) and the results of the computation are collected and stored in the same processor. In this problem communication delay plays an important role. Communication delay is the time to send/distribute the load fractions to other processors in the network. and the time to collect the results of computation from other processors by the root processors. The objective in this scheduling problem is that of obtaining the load fractions assigned to each processor in the network such that the processing time of the entire load is a minimum. We derive closed-form expression for the processing time by taking Into consideration the communication delay in the load distribution process and the communication delay In the result collection process. Using this closed-form expression, we also obtain the optimal number of processors that are required to solve this scheduling problem. This scheduling problem is formulated as a linear pro-gramming problem and its solution using neural network is also presented. Numerical examples are presented for ease of understanding.

• 정보처리학회논문지C
• /
• 제8C권6호
• /
• pp.757-764
• /
• 2001

전자상거래가 활발하게 이루어짐으로서 지불수단에 대한 관심이 증가되고 있다. 또한 지불 시스템에 대한 수많은 연구가 진행되고 있다. 특히 사용자의 사생활을 보호하기 위해 익명성을 제공하는 시스템과 이로 인해 발행하는 문제점들을 해결하기 위한 익명성 제어에 관련된 전자화폐 시스템이 연구되고 있다. 그리고 전자화폐의 효율성을 위해서 분할성을 가지는 전자화폐에 대한 연구도 같이 진행되고 있다. 본 논문에서는 분할성과 관련된 기존 방식을 분석하고 익명성 제어에 대한 개념을 살펴본다. 그리고 국내 전자서명 표준인 KCDSA에 은닉서명을 추가한 새로운 은닉 서명 방식을 제안한다. 이를 기반으로 하여 익명성을 유지하며 필요시 신뢰기관의 도움으로 익명성을 제어할 수 있고 전자화폐의 효율적 사용을 위해 분할성 기능을 함께 제공하는 새로운 전자화폐 시스템을 제안한다.