• The Korean Journal of Applied Statistics
• /
• v.23 no.5
• /
• pp.883-890
• /
• 2010

Since Fisher's exact test is conducted conditional on the observed value of the margin, there are two kinds of the exact power, the conditional and the unconditional exact power. The conditional exact power is computed at a given value of the margin whereas the unconditional exact power is calculated by incorporating the uncertainty of the margin. Although the sample size is determined based on the unconditional exact power, the actual power which Fisher's exact test has is the conditional power after the experiment is finished. This paper investigates differences between the conditional and unconditional exact power Fisher's exact test. We conclude that such discrepancy is a disadvantage of Fisher's exact test.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.1
• /
• pp.149-155
• /
• 2005

The notion of U-exact sequence (or quasi-exact sequence) of modules was introduced by Davvaz and Parnian-Garamaleky as a generalization of exact sequences. In this paper, we prove further results about quasi-exact sequences. In particular, we give a generalization of Schanuel's Lemma. Also we obtain some relation-ship between quasi-exact sequences and superfluous (or essential) submodules.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.643-657
• /
• 2022

Let R be a ring and S a multiplicative subset of R. An R-module T is called u-S-torsion (u-always abbreviates uniformly) provided that sT = 0 for some s ∈ S. The notion of u-S-exact sequences is also introduced from the viewpoint of uniformity. An R-module F is called u-S-flat provided that the induced sequence 0 → A ⊗_R F → B ⊗_R F → C ⊗_R F → 0 is u-S-exact for any u-S-exact sequence 0 → A → B → C → 0. A ring R is called u-S-von Neumann regular provided there exists an element s ∈ S satisfying that for any a ∈ R there exists r ∈ R such that sα = rα². We obtain that a ring R is a u-S-von Neumann regular ring if and only if any R-module is u-S-flat. Several properties of u-S-flat modules and u-S-von Neumann regular rings are obtained.

• Journal of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.521-536
• /
• 2023

Let R be a commutative ring with identity and S a multiplicative subset of R. In this paper, we introduce and study the notions of u-S-pure u-S-exact sequences and uniformly S-absolutely pure modules which extend the classical notions of pure exact sequences and absolutely pure modules. And then we characterize uniformly S-von Neumann regular rings and uniformly S-Noetherian rings using uniformly S-absolutely pure modules.

• The Mathematical Education
• /
• v.10 no.1
• /
• pp.4-5
• /
• 1972

이 논문은 modules 사이의 homomorphisms의 exact sequence에서 다음과 같은 것을 밝힌 것임. 1. (equation omitted)이 하나의 exact sequence 이고 P가 임의의 R-module일 때 (equation omitted)은 abelian group의 하나의 exact sequence라는 것. 2. (equation omitted)이 exact sequence 이고 P가 임의의 R-modele이면 (equation omitted)는 abelian group의 하나의 exact sequence라는 것.

• Journal of the Korean Statistical Society
• /
• v.20 no.2
• /
• pp.156-161
• /
• 1991

Exact $D_{s}$-efficient designs for the precise estimation of all the coefficients of the quadratic terms are studied in a quadratic response surface model. Efficient exact designs are constructed for 2 q 5 w.r.t. $D_{s}$-optimaity criterion based on Pesotchinsky's(1975) and approximate $D_{s}$-optimal design given in Lim & Studden(1988) . Moreover, they seem to have reasonably good D-efficiencies. Similar idea could apply to q$\geq$6 cases.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2000.11a
• /
• pp.540-545
• /
• 2000

This paper presents the exact dynamic element for composite Timoshenko beam, which is inherently subject both to bending and torsional vibration. The coupling effect between bending and torsional vibrations is rigorouly considered in the derivation of the exact dynamic element. Two examples are provided to validate and illustrate the proposed exact dynamic element matrix for composite Timoshenko beam.

• Communications for Statistical Applications and Methods
• /
• v.16 no.2
• /
• pp.363-372
• /
• 2009

The difference of two independent binomial proportions is frequently of interest in biomedical research. The interval estimation may be an important tool for the inferential problem. Many confidence intervals have been proposed. They can be classified into the class of exact confidence intervals or the class of approximate confidence intervals. Ore may prefer exact confidence interval s in that they guarantee the minimum coverage probability greater than the nominal confidence level. However, someone, for example Agresti and Coull (1998) claims that "approximation is better than exact." It seems that when sample size is large, the approximate interval is more preferable to the exact interval. However, the choice is not clear when sample, size is small. In this note, an exact confidence and an approximate confidence interval, which were recommended by Santner et al. (2007) and Lee (2006b), respectively, are compared in terms of the coverage probability and the expected length.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• Coupled systems mechanics
• /
• v.8 no.6
• /
• pp.537-553
• /
• 2019

In this paper we present geometrically exact Kirchhoff's initially curved planar beam model. The theoretical formulation of the proposed model is based upon Reissner's geometrically exact beam formulation presented in classical works as a starting point, but with imposed Kirchhoff's constraint in the rotated strain measure. Such constraint imposes that shear deformation becomes negligible, and as a result, curvature depends on the second derivative of displacements. The constitutive law is plasticity with linear hardening, defined separately for axial and bending response. We construct discrete approximation by using Hermite's polynomials, for both position vector and displacements, and present the finite element arrays and details of numerical implementation. Several numerical examples are presented in order to illustrate an excellent performance of the proposed beam model.