• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.105-109
• /
• 2006

Hypercube has a regular and hierarchical structure, therefore it can be applied to the development of efficient diagnosis algorithm. Kranakis and Pelc [7] have proposed HYP-DIAG algorithm to implement different method of HADA/IHADA and adaptive cube partition method after embedding the small size of ring that includes all the faulty nodes. In this paper, we propose new method to reduce testing rounds by analyzing the syndrome of RGC-rings gained in the first step of HYP-DIAG and analyze the proposed algorithm.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.4
• /
• pp.415-423
• /
• 2012

This paper specifies on optimized design of wide-band subarray using a Genetic Algorithm. First wide-band radiator was designed at triangle lattice of infinite array structure. It is the radiator of notch type that has a wide-band characteristic of ratio 2:1 between maximum and minimum frequency satisfying active reflection coefficient under -10 dB at boresight. And a Genetic Algorithm was applied to optimize subarray partition of antenna consisting of 1,100 array elements. It was confirmed that an optimized subarray antenna has a 4.5-5.5 dB more improved maximum SLL (Side-Lobe Level) than regular subarray antenna.

• 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.

• Asian-Australasian Journal of Animal Sciences
• /
• v.23 no.4
• /
• pp.530-536
• /
• 2010

Cdc25B is a mitotic regulator that might act as a starter phosphatase to initiate the positive feedback loop at the entry into mitotic (M) phase. In the present study, distribution of Cdc25B mRNA in duodenal mucosa of the chicken was demonstrated by means of in situ hybridization histochemistry (ISHH) using sense and antisense digoxigenin (DIG)-labeled RNA probes. The results showed that there were many labeled cells distributing in the duodenal mucosa of the adult chicken. Of these labeled cells, 81.60${\pm}$9.63% of Cdc25B mRNA positive cells was distributed in the basilar part and mid-portion of the intestinal gland and 36.21${\pm}$8.81% in the middle and basilar portion of villi of the small intestine of the chicken, respectively. Most of these labeled cells were positive in the regions of the stem cell and proliferation. The signals of ISHH decreased from basilar to upper part in the crypt of Lieberkuhn and weakened in the inferior villi of the duodenum. Moreover, the positive signals were both in the cytoplasm and cell nucleus. However, the labeled cells were negative in both the lamina muscularis mucosae and muscular layer. The results of ISHH suggested the existence of Cdc25B mRNA and vigorous proliferation activities in the duodenal mucosa of adult chicken, replenishing the cells which had sloughed off from the superior part of the villus. Our results provide some molecular evidence for a regular pattern of avian intestinal epitheliosis and functional partition and provide an approach to further study of the locations of Cdc25B in the chicken.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.441-449
• /
• 2007

In clustering for image segmentation, large amount of computation and typical segmentation errors have been important problems. In the paper, we suggest a new method for minimizing these problems. Markers in marker-controlled watershed transform represent segmented areas because they are starting-points of extending areas. Thus, clustering restricted by marker pixels can reduce computational complexity. In our proposed method, the markers are selected by Gabor texture energy, and cluster information of them are generated by FCM (fuzzy c-mean) clustering. Generated areas from watershed transform are merged by using cluster information of markers. In the test of Brodatz' texture images, we improved typical partition-errors obviously and obtained less computational complexity compared with previous FCM clustering algorithms. Overall, it also took regular computational time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.830-833
• /
• 2007

In this paper, we implemented a $17{\times}17b$ binary digital multiplier using radix-4 Booth;s algorithmand proposed an efficient testing methodology for the full-custom design. A two-stage pipeline architecture was applied to achieve higher throughput and 4:2 adders were used for regular layout structure in the Wallace tree partition. Several chips were fabricated using LG Semicon 0.6-um 3-Metal N-well CMOS technology. We did fault simulations efficiently using the proposed test method resulting in the reduction of the number of faulty nodes by 88%. The chip contains 9115 transistors and the core area occupies $1135^*1545$ mm2. The functional tests using ATS-2 tester showed that it can operate with 24 MHz clock at 5.0 V at room temperature.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.32 no.2
• /
• pp.167-178
• /
• 2008

Despite the fact that chogakpos are part of our wonderful Kyubang(the women's quarters in the Chosun Dynasty) culture with their own unique beauty and artistic values, there has been no scientific and objective proof of their aesthetic values. Once they are proved for their beauty through scientific analysis, they will be recognized worldwide along with our unique culture. The methodology included a review of related literature and theses along with magazines, periodicals, and Internet books. The analysis of lines parting, the dimensions of chogakpos were carried out over 108 pieces introduced in Old Pojagis by Heo Dong-hwa. As for line parting, the dimensions of chogakpos were measured to see if the golden and Geumgang ratio could be applied and to discover their unique partition ratio. As a result, there was the presence of the golden ratio applied to them with the golden curves from golden triangles and rectangles also found therein. The Yeoijumunbo confirmed that there was the golden ratio between the radius of a circle and a side of a regular decagon inscribed in the circle. The common line ratio among the squares, isosceles triangles, wanes, and overlapping rectangles was around 1:1.31, which means that there was a unique line ratio in the traditional chogakpos. Furthermore, the ratio of 1:1.31 was close to the Geumgang ratio commonly used in the traditional buildings of Korea.

• Communications of the Korean Mathematical Society
• /
• v.31 no.2
• /
• pp.217-227
• /
• 2016

Let X be a nonempty set, and let $\mathfrak{F}=\{Y_i:i{\in}I\}$ be a family of nonempty subsets of X with the properties that $X={\bigcup}_{i{\in}I}Y_i$, and $Y_i{\cap}Y_j={\emptyset}$ for all $i,j{\in}I$ with $i{\neq}j$. Let ${\emptyset}{\neq}J{\subseteq}I$, and let $T^{(J)}_{\mathfrak{F}}(X)=\{{\alpha}{\in}T(X):{\forall}i{\in}I{\exists}_j{\in}J,Y_i{\alpha}{\subseteq}Y_j\}$. Then $T^{(J)}_{\mathfrak{F}}(X)$ is a subsemigroup of the semigroup $T(X,Y^{(J)})$ of functions on X having ranges contained in $Y^{(J)}$, where $Y^{(J)}:={\bigcup}_{i{\in}J}Y_i$. For each ${\alpha}{\in}T^{(J)}_{\mathfrak{F}}(X)$, let ${\chi}^{({\alpha})}:I{\rightarrow}J$ be defined by $i{\chi}^{({\alpha})}=j{\Leftrightarrow}Y_i{\alpha}{\subseteq}Y_j$. Next, we define two congruence relations ${\chi}$ and $\widetilde{\chi}$ on $T^{(J)}_{\mathfrak{F}}(X)$ as follows: $({\alpha},{\beta}){\in}{\chi}{\Leftrightarrow}{\chi}^{({\alpha})}={\chi}^{({\beta})}$ and $({\alpha},{\beta}){\in}\widetilde{\chi}{\Leftrightarrow}{\chi}^{({\alpha})}{\mid}_J={\chi}^{({\alpha})}{\mid}_J$. We begin this paper by studying the regularity of the quotient semigroups $T^{(J)}_{\mathfrak{F}}(X)/{\chi}$ and $T^{(J)}_{\mathfrak{F}}(X)/{\widetilde{\chi}}$, and the semigroup $T^{(J)}_{\mathfrak{F}}(X)$. For each ${\alpha}{\in}T_{\mathfrak{F}}(X):=T^{(I)}_{\mathfrak{F}}(X)$, we see that the equivalence class [${\alpha}$] of ${\alpha}$ under ${\chi}$ is a subsemigroup of $T_{\mathfrak{F}}(X)$ if and only if ${\chi}^{({\alpha})}$ is an idempotent element in the full transformation semigroup T(I). Let $I_{\mathfrak{F}}(X)$, $S_{\mathfrak{F}}(X)$ and $B_{\mathfrak{F}}(X)$ be the sets of functions in $T_{\mathfrak{F}}(X)$ such that ${\chi}^{({\alpha})}$ is injective, surjective and bijective respectively. We end this paper by investigating the regularity of the subsemigroups [${\alpha}$], $I_{\mathfrak{F}}(X)$, $S_{\mathfrak{F}}(X)$ and $B_{\mathfrak{F}}(X)$ of $T_{\mathfrak{F}}(X)$.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.43-50
• /
• 2008

Various studies are being conducted to achieve efficient routing and reduce energy consumption in wireless sensor networks where energy replacement is difficult. Among routing mechanisms, the clustering technique has been known to be most efficient. The clustering technique consists of the elements of cluster construction and data transmission. The elements that construct a cluster are repeated in regular intervals in order to equalize energy consumption among sensor nodes in the cluster. The algorithms for selecting a cluster head node and arranging cluster member nodes optimized for the cluster head node are complex and requires high energy consumption. Furthermore, energy consumption for the data transmission elements is proportional to $d^2$ and $d^4$ around the crossover region. This paper proposes a means of reducing energy consumption by increasing the efficiency of the cluster construction elements that are regularly repeated in the cluster technique. The proposed approach maintains the number of sensor nodes in a cluster at a constant level by equally partitioning the region where nodes with density considerations will be allocated in cluster construction, and reduces energy consumption by selecting head nodes near the center of the cluster. It was confirmed through simulation experiments that the proposed approach consumes less energy than the LEACH algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.5
• /
• pp.895-907
• /
• 2020

With the recent increasing influence of multimedia content other than the text-based content, services that help to process information in content brings us great convenience. These services' representative features are searching and masking the sensitive data. It is not difficult to find the solutions that provide searching and masking function for text information and image. However, even though we recognize the necessity of the technology for searching and masking a part of the audio data, it is not easy to find the solution because of the difficulty of the technology. In this study, we propose web application that provides searching and masking functions for audio data using audio partitioning method. While we are achieving the research goal, we evaluated several speech to text conversion APIs to choose a proper API for our purpose and developed regular expressions for searching sensitive information. Lastly we evaluated the accuracy of the developed searching and masking feature. The contribution of this work is in design and implementation of searching and masking a sensitive information from the audio data by the various functionality proving experiments.