• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.591-594
• /
• 1988

A three-step heuristic algorithm for PLA column folding and row folding of column-folded PLA is presented, which is significantly faster than the earlier works and provides nearly optimal results. The three steps are i) min-cut partition of vertices in the column (or row) intersection graph, ii) determination of products' order using Fiduccia's min-net cut algorithm, and iii) head-tail pairing for column folding, while some heuristics are proposed for deciding row folding pairs. The time complexity of this algorithm is O($n^{2}$log n) compared to the O($n^{3}$) - O($n^{4}$) of the earlier works.$^[2][3][9]$ For a test PLA with 23 inputs, 19 outputs and 52 products, the number of column folding pairs obtained using this algorithm is 20 which is optimal, as compared to 17 in a previous work.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.1
• /
• pp.81-90
• /
• 2004

The state assignment for a finite state machine greatly affects the delay, area, power dissipation, and testabilities of the sequential circuits. In order to improve the testabilities and power consumption, a new state assignment technique . based on m-block partition is introduced in this paper. By the m-block partition algorithm, the dependencies among groups of state variables are minimized and switching activity is further reduced by assigning the codes of the states in the same group considering the state transition probability among the states. In the sequel the length and number of feedback cycles are reduced with minimal switching activity on state variables. It is inherently contradictory problem to optimize the testability and power consumption simultaneously, however our new state assignment technique is able to achieve high fault coverage with less number of scan nfp flops by reducing the number of feedback cycles while the power consumption is kept low upon the low switching activities among state variables. Experiment shows drastic improvement in testabilities and power dissipation for benchmark circuits.

• Kyungpook Mathematical Journal
• /
• v.61 no.4
• /
• pp.679-710
• /
• 2021

We study the tensor product algebra P_k(x₁) ⊗ P_k(x₂) ⊗ ⋯ ⊗ P_k(x_m), where P_k(x) is the partition algebra defined by Jones and Martin. We discuss the centralizer of this algebra and corresponding Schur-Weyl dualities and also index the inequivalent irreducible representations of the algebra P_k(x₁) ⊗ P_k(x₂) ⊗ ⋯ ⊗ P_k(x_m) and compute their dimensions in the semisimple case. In addition, we describe the Bratteli diagrams and branching rules. Along with that, we have also constructed the RS correspondence for the tensor product of m-partition algebras which gives the bijection between the set of tensor product of m-partition diagram of P_k(n₁) ⊗ P_k(n₂) ⊗ ⋯ ⊗ P_k(n_m) and the pairs of m-vacillating tableaux of shape [λ] ∈ Γ_k^m, Γ_k^m = {[λ] = (λ₁, λ₂, …, λ_m)|λ_i ∈ Γ_k, i ∈ {1, 2, …, m}} where Γ_k = {λ_i ⊢ t|0 ≤ t ≤ k}. Also, we provide proof of the identity $(n_1n_2{\cdots}n_m)^k={\sum}_{[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$ f^[λ]m_k^[λ] where m_k^[λ] is the multiplicity of the irreducible representation of $S{_{n_1}}{\times}S{_{n_2}}{\times}....{\times}S{_{n_m}}$ module indexed by ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$, where f^[λ] is the degree of the corresponding representation indexed by ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$ and ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}=\{[{\lambda}]=({\lambda}_1,{\lambda}_2,{\ldots},{\lambda}_m){\mid}{\lambda}_i{\in}{\Lambda}^k_{n_i},i{\in}\{1,2,{\ldots},m\}\}$ where ${\Lambda}^k_{n_i}=\{{\mu}=({\mu}_1,{\mu}_2,{\ldots},{\mu}_t){\vdash}n_i{\mid}n_i-{\mu}_1{\leq}k\}$.

• Journal of the Korean Applied Science and Technology
• /
• v.22 no.4
• /
• pp.339-348
• /
• 2005

On the analysis of triacylglycerol (TG) from the kernels of Acanthopanax sessiliflorus by reversed phase-HPLC, it was separated into three main fractions of PN 44, 46 and 48, according to partition number (PN). On the contrary, it could be clearly classified into seven fractions of SMM, MMM, SMD, MMD, SDD, MDD and MDT by silver ion-HPLC by the number of double bond in the acyl chains of TG species. But resolution of so-called critical pairs of TG molecular species such as molecular pairs of $P_eLL$ $[C_{18:1{\omega}12}/(C_{18:2{\omega}6)2}]$ and OLL $[C_{18:1{\omega}9}/(C_{18:2{\omega}6)2}]$ and OOL $[(C_{18:1{\omega}9)2}/C_{18:2{\omega}6]$, and $P_eP_eL$ $[(C_{18:2{\omega}12)2}/C_{18:1{\omega}6]$ was not achieved $(P_e;$ petroselinic acid, L; linoleic acid, O; oleic acid). On the other hand, TG extracted from Aralia continentalis kernels were also fractionated into seven groups of SSM, SMM, MMM, SMD, MMD, SDD and MDD (S; saturated acid, M; monoenoic acid, D; dienoic acid) by silver ion-HPLC, although it's were classified into three groups of PN 44, 46 and 48 by reversed phase-HPLC. The fractions of SMM, MMM, MMD and MDD were divided into two subfractions, respectively; the fractions of SMM, MMM, MMD and MDD were resolved into the subfraction of $PP_e/P_e$ and POO (critical pairs from each other), that of $P_e/P_e/P_e$ and OOO, that of $P_e/P_e/L$ and OOL, and that of $P_e/L/L$ and OLL.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.6
• /
• pp.11-20
• /
• 1997

This paper proposes a modified dynamic programming for finding the correspondence between right and left images. A dynamic programming is based on the intensity of images for stereo matching. But htis method is intended to mismatch at uniformed intensity region. To reduce thd mismatching, the stereo images are segmented to various regions with respective uniform intensity, and the different cost function has applied to the segmented region during the dynamci programming. Cost function costains jump cost. And jump cost included two parameter .alpha. and .beta. which have influence on minimum cost path. Experimental results show that the 3D shape of some stereo pairs cna be finely obtained by this proposed algorithm.

• YAKHAK HOEJI
• /
• v.27 no.2
• /
• pp.125-131
• /
• 1983

Whether ($AB_{w}$) may be neglected against ($A_{w}^{+}$) in the calculation of the extraction coefficient of ion-pairs was criticized by both experiments and theoretical consideration, where ($AB_{w}$) and ($A_{w}^{+}$) mean the molar concentration of ion-pair AB and cation $A^{+}$ in the aqueous phase. Ion-pair complexes were partitioned between phosphate buffer (pH 7.4) and n-octanol. Tetrabutylammonium, isopropamide and methylene blue were selected as cations and benzoic acid, p-toluenesulfonic acid, salicylic acid and taurodeoxycholic acid were selected as counter ions (anions). As a result, conventional methods which assume no existence of ($AB_{w}$) were proven to lack generality. The equation proposed in my earlier report was confirmed to be valid as a general method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.4
• /
• pp.429-438
• /
• 1986

In this paper we have designed and implemented a real-time, full-duplex SBC (sub-band coding) codec at 16kbps using a high speed digital signal processor, NEC 7720. The SBC codec employs a QMF(quadrature mirror filter) filter bank based on the tree structures of two-band analysis-synthesis pairs to partition speech signal into 4 octabe bands. Computer simulation has been done to investigate the effect of fixed-point computation of the NEC 7720. Three different performance measures, the conventional signal-to-noise ratio, the informal listening test, and an LPC(linear predictive coding)distance measure, have been used in this simulation. The necessary parameters have been optimized through the simulation. The developed hardware and software have been tested in real-time operation using a hardware emulator.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.15-23
• /
• 2004

Westfeld analyzed a sequential LSB embedding steganography effectively through the $\chi$$^2$statistical test which measures the frequencies of PoVs(pairs of values). Fridrich also proposed another statistical analysis, so-called RS steganalysis by which the embedding message rate can be estimated. This method is based on the partition of pixels as three groups; Regular, Singular, Unusable groups. In this paper, we propose a new steganographic scheme which preserves the above two statistics. The proposed scheme embeds the secret message in the innocent image by randomly adding one to real pixel value or subtracting one from it, then adjusts the statistical measures to equal those of the original image.

• The Plant Pathology Journal
• /
• v.40 no.2
• /
• pp.205-217
• /
• 2024

Brown rot disease, caused by Monilinia spp., poses a significant threat to pome and stone fruit crops globally, resulting in substantial economic losses during pre- and post-harvest stages. Monilinia fructigena, M. laxa, and M. fructicola are identified as the key agents responsible for brown rot disease. In this study, we employed the amplified fragment length polymorphism (AFLP) method to assess the genetic diversity of 86 strains of Monilinia spp. isolated from major stone fruit cultivation regions in South Korea. Specifically, strains were collected from Chungcheong, Gangwon, Gyeonggi, Gyeongsang, and Jeolla provinces (-do). A comparative analysis of strain characteristics, such as isolation locations, host plants, and responses to chemical fungicides, was conducted. AFLP phylogenetic classification using 20 primer pairs revealed the presence of three distinct groups, with strains from Jeolla province consistently forming a separate group at a high frequency. Furthermore, M. fructicola was divided into three groups by the AFLP pattern. Principal coordinate analysis and PERMANOVA were applied to compare strain information, such as origin, host, and fungicide sensitivity, revealing significant partition patterns for AFLP according to geographic origin and host plants. This study represents the utilization of AFLP methodology to investigate the genetic variability among M. fructicola isolates, highlighting the importance of continuous monitoring and management of variations in the brown rot pathogen.

• The Journal of the Korea Contents Association
• /
• v.9 no.4
• /
• pp.34-44
• /
• 2009

Integrating 3D data acquired in multiple views is one of the most important techniques in 3D modeling. However, due to the presence of surface scanning noise and the modification of vertices consisting of surface, the existing integration methods are inadequate to some applications. In this paper, we propose a method of integrating surfaces by using the local surface topology. We first find all boundary vertex pairs satisfying a prescribed geometric condition on adjacent surfaces and then compute 2D planes suitable to each vertex pairs. Using each vertex pair and neighbouring boundary vertices projected to their 2d plane, we produce polygons and divide them to the triangles which will be inserted to empty space between the adjacent surfaces. A proposed method use local surface topology and not modify the vertices consisting of surface to integrate several of surfaces to one surface, so that it is robust and simple. We also integrate the transformed textures to a 2D image plane computed by using a cylindrical projection to composite 3D textured model. The textures will be integrated according to the partition lines which considering attribute of face object. Experimental results on real object data show that the suggested method is simple and robust.