• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.605-614
• /
• 2005

We show that an Artinian O-sequence $h_0,h_1,{\cdots},h_{d-1},h_d\;=\;h_{d-1},h_{d+l}\;>\;h_d$ of codimension 3 is not level when $h_{d-1}\;=\;h_d\;=\;d + i\;and\;h{d+1}\;=\;d+(i+1)\;for\;i\;=\;1,\;2,\;and\;3$, which is a partial answer to the question in [9]. We also introduce an algorithm for finding noncancelable Betti numbers of minimal free resolutions of all possible Artinian O-sequences based on the theorem of Froberg and Laksov in [2].

• International Journal of Stem Cells
• /
• v.16 no.1
• /
• pp.36-43
• /
• 2023

Background and Objectives: Lymphoblastoid cell lines (LCLs) deposited from disease-affected individuals could be a valuable donor cell source for generating disease-specific induced pluripotent stem cells (iPSCs). However, generation of iPSCs from the LCLs is still challenging, as yet no effective gene delivery strategy has been developed. Methods and Results: Here, we reveal an effective gene delivery method specifically for LCLs. We found that LCLs appear to be refractory toward retroviral and lentiviral transduction. Consequently, lentiviral and retroviral transduction of OCT4, SOX2, KFL4 and c-MYC into LCLs does not elicit iPSC colony formation. Interestingly, however we found that transfection of oriP/EBNA-1-based episomal vectors by electroporation is an efficient gene delivery system into LCLs, enabling iPSC generation from LCLs. These iPSCs expressed pluripotency makers (OCT4, NANOG, SSEA4, SALL4) and could form embryoid bodies. Conclusions: Our data show that electroporation is an effective gene delivery method with which LCLs can be efficiently reprogrammed into iPSCs.

• The Korean Journal of Zoology
• /
• v.38 no.4
• /
• pp.550-556
• /
• 1995

The c-myc proto-oncogene is Involved In the control of normal cell proliferation and differentiation of many cell lineages. Although it has heen suggested that c-myc may play an important role in the mammalian early development, it Is unclear whether the embryonic c-myc mRNA is originated from zygotic gene expression or stored maternal message. Thus, we have construded expression vectors, In which the 5, flanking sequences including c-myc promoter region and a large non-coding exon I are fused 'sith E. coli lacZ gene that encedes $\beta$-galactosldase as a reporter. As c-myc exon I contains a modulatory sequence, we designed t, vo types of vectors (pcmyc.Gall and pcmyc-Ga12) to examine the role of exon I in c-myc expression. The former contains the complete exon I and the later has a deletion in 40 bp of modulator sequence located In the exon I of c-myc These vectors were microInjected into fertilized one-cell embryos and $\beta$-galactosidase activity was examined by X-gal staining during early embryogenesis. $\beta$-galactosidase activity derived from c-myc promoter was decreased at two-cell stage. The expression level directed by pcmyc- Ga12 was similar to that of pcmyc-Gal1, indicating that the medulatory sequence in exon I may not be Involved at least In the regulation of embryonic c-myc expression. In summary, the present study indicates that the c-myc promoter is functional at the early stage embryo, and the regulation of c-myc expression is under the control of "zygotic" clock of preimplantation mouse embryos.e embryos.

• Journal of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.503-517
• /
• 2016

For positive integers d and n, let $[n]^d$ be the set of all vectors ($a_1,a_2,{\cdots},a_d$), where ai is an integer with $0{\leq}a_i{\leq}n-1$. A subset S of $[n]^d$ is called a Sidon set if all sums of two (not necessarily distinct) vectors in S are distinct. In this paper, we estimate two numbers related to the maximum size of Sidon sets in $[n]^d$. First, let $\mathcal{Z}_{n,d}$ be the number of all Sidon sets in $[n]^d$. We show that ${\log}(\mathcal{Z}_{n,d})={\Theta}(n^{d/2})$, where the constants of ${\Theta}$ depend only on d. Next, we estimate the maximum size of Sidon sets contained in a random set $[n]^d_p$, where $[n]^d_p$ denotes a random set obtained from $[n]^d$ by choosing each element independently with probability p.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2634-2648
• /
• 2020

In this paper, an adaptive sparse singular value decomposition (ASSVD) algorithm is proposed to estimate the signal matrix when only one data matrix is observed and there is high dimensional white noise, in which we assume that the signal matrix is low-rank and has sparse singular vectors, i.e. it is a simultaneously low-rank and sparse matrix. It is a structured matrix since the non-zero entries are confined on some small blocks. The proposed algorithm estimates the singular values and vectors separable by exploring the structure of singular vectors, in which the recent developments in Random Matrix Theory known as anisotropic Marchenko-Pastur law are used. And then we prove that when the signal is strong in the sense that the signal to noise ratio is above some threshold, our estimator is consistent and outperforms over many state-of-the-art algorithms. Moreover, our estimator is adaptive to the data set and does not require the variance of the noise to be known or estimated. Numerical simulations indicate that ASSVD still works well when the signal matrix is not very sparse.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1577-1585
• /
• 1999

In this paper, we propose detection methods for gradual scene changes such as dissolve, pan, and zoom. The proposal method to detect a dissolve region uses scene features based on spatial statistics of the image. The spatial statistics to define shot boundaries are derived from squared means within each local area. We also propose a method of the camera motion detection using four representative motion vectors in the background. Representative motion vectors are derived from macroblock motion vectors which are directly extracted from MPEG streams. To reduce the implementation time, we use DC sequences rather than fully decoded MPEG video. In addition, to detect the gradual scene change region precisely, we use all types of the MPEG frames(I, P, B frame). Simulation results show that the proposed detection methods perform better than existing methods.

• Journal of Power Electronics
• /
• v.13 no.6
• /
• pp.939-954
• /
• 2013

The Direct Torque Control (DTC) technique for Permanent Magnet Synchronous Motors (PMSM) is receiving increased attention due to its simplicity and robust dynamic response when compared with other control techniques. The classical switching table based DTC results in large flux and torque ripples in the motors. Several studies have been reported in the literature on classical DTC. However, there are only limited studies that actually discuss or evaluate the classical DTC. This paper proposes, novel switching table / DTC methods for PMSMs to reduce torque ripples. In this paper, two DTC schemes are proposed. The six sector and twelve sector methodology is considered in DTC scheme I and DTC scheme II, respectively. In both DTC schemes a simple modification is made to the classical DTC structure. The two level inverter available in the classical DTC is eliminated by replacing it with a three level Neutral Point Clamped (NPC) inverter. To further improve the performance of the proposed DTC scheme I, the available 27 voltage vectors are allowed to form different groups of voltage vectors such as Large - Zero (LZ), Medium - Zero (MZ) and Small - Zero (SZ), where as in DTC scheme II, all of the voltage vectors are considered to form a switching table. Based on these groups, a novel switching table is proposed. The proposed DTC schemes are comparatively investigated with the classical DTC and existing literatures through theory analysis and computer simulations. The superiority of the proposed DTC method is also confirmed by experimental results. It can be observed that the proposed techniques can significantly reduces the torque ripples and improves the quality of current waveform when compared with traditional and existing methods.

• Communications of the Korean Mathematical Society
• /
• v.9 no.2
• /
• pp.279-284
• /
• 1994

Let R = ($r_1$, $r_2$, …, $r_{m}$) and S = ($s_1$, $s_2$, …, $s_{n}$ ) be positive integral vectors satisfying $r_1$＋ $r_2$＋…＋ $r_{m}$ = $s_1$＋ $s_2$＋ㆍㆍㆍ＋ $s_{n}$ , and let U(R, S) denote the class of all m $\times$ n matrices A = [$_a{ij}$ ] where $a_{ij}$ = 0 or 1 such that (equation omitted) = $r_{i}$ , (equation omitted) = $s_{j}$ , i = 1, ㆍㆍㆍ, m, j = 1, ㆍㆍㆍ, n.(omitted)

• Journal of the Korean Statistical Society
• /
• v.12 no.2
• /
• pp.61-68
• /
• 1983

A parallel flats fraction for the $3^n$ factorial experiment is defined as the union of flats, ${t$\mid$At=C_i(mod 3)}, i=1,2,\cdot,f$, in EG(n,3) and is symbolically written as At=C where A is of rank r. The A matrix partitions the effects into u+1 alias sets where $u=(3^{n-r}-1)/2$. For each alias set the f flats produce an alias component permutation matrix (ACPM) with elements from $S_3$. In this paper, a detection vector of the ACPM was constructed for each combination of k or fewer two-factor interactions. Also the relationship between the detection vectors has been shown.

• Honam Mathematical Journal
• /
• v.33 no.1
• /
• pp.115-120
• /
• 2011

Given vectors x and y in a separable complex Hilbert space $\cal{H}$, an interpolating operator is a bounded operator A such that Ax = y. We show the following : Let Alg$\cal{L}$ be a tridiagonal algebra on a separable complex Hilbert space H and let x = ($x_i$) and y = ($y_i$) be vectors in H. Then the following are equivalent: (1) There exists an invertible operator A = ($a_{kj}$) in Alg$\cal{L}$ such that Ax = y. (2) There exist bounded sequences $\{{\alpha}_n\}$ and $\{{{\beta}}_n\}$ in $\mathbb{C}$ such that for all $k\in\mathbb{N}$, ${\alpha}_{2k-1}\neq0,\;{\beta}_{2k-1}=\frac{1}{{\alpha}_{2k-1}},\;{\beta}_{2k}=\frac{\alpha_{2k}}{{\alpha}_{2k-1}\alpha_{2k+1}}$ and $$y_1={\alpha}_1x_1+{\alpha}_2x_2$$ $$y_{2k}={\alpha}_{4k-1}x_{2k}$$ $$y_{2k+1}={\alpha}_{4k}x_{2k}+{\alpha}_{4k+1}x_{2k+1}+{\alpha}_{4k+2}x_{2k+2}$$.