• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.2
• /
• pp.63-75
• /
• 1993

As the CMOS technology becomes the most dominant circuit realization method, the cost problem for the test which includes both the transistor-level FET stuck-on and stuck-off faults and the gatelevel stuck-at faults becomes more and more serious. In accordance, this paper proposes a test set and its generation algorithm, which handles both the transistor-level faults and the gate-level faults, thus can unify the test steps during the IC design and fabrication procedure. This algorithm uses only the logic equation of the given logic function as the input resource without referring the transistor of gate circuit. Also, the resultant test set from this algorithm can improve in both the complexity of the generation algorithm and the time to apply the test as well as unify the test steps in comparing the existing methods.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.11
• /
• pp.140-148
• /
• 1993

High Integration ratio of CMOS circuits incredily increases the test cost during the design and fabrication processes because of the FET fault(Stuck-on faults and Stuck-off faults) which are due to the operational characteristics of CMOS circuits. This paper proposes a test generation algorithm for an arbitrarily large CMOS circuit, which can unify the test steps during the design and fabrication procedure and be applied to both static and dynaic circuits. This algorithm uses the logic equations set for the subroutines resulted from arbitrarily dividing the full circuit hierarchically or horizontally. Also it involves a driving procedure from output stage to input stage, in which to drive a test set corresponding to a subcircuit, only the subcircuits connected to that to be driven are used as the driving resource. With this algorithm the test cost for the large circuit such as VLSI can be reduced very much.

• Language and Information
• /
• v.6 no.1
• /
• pp.71-89
• /
• 2002

This paper proposes that concession should be analysed in terms of inferences based on the likelihood of event occurrence and that an alternative set of events should be presupposed in such inferences. In order to give an empirical content to this proposal this paper discusses the pragmatic aspects of the English word even and the Korean morpheme -lafo and claims that the notion of likelihood is the basis of the pragmatic inference of concession and the quasi-universal quantification erect. It is also claimed that unexpectedness, which is conceptually tied to concession, on the other hand, pertains to the same kind of pragmatic inference but presupposes the existence of an alternative set of individuals instead of an alternative set of situations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.153-161
• /
• 2022

This paper analyzes the economic effects when platform provider including CP contributes to broadband universal service and uses broadband bandwidth providing high quality network service. In this model, the contribution rate of broadband universal service is determined by ISP and platform provider sets its price of contents. The main results are as follows. First, the traffic usages is less than social optimum when the market of contents is monopoly. The sum of contribution fee and network usage rate must be less than marginal cost of network operation to get social optimum traffic. Second, the rate set by ISP is equal to social optimum when the market of contents is competitive. Third, when platform provider does not charge contents provided, ISP sets social optimum prices and the network usage rate for contents user is decreasing as advertisement revenue becomes larger. These results suggest that the platform provider should contribute to universal service funding to encourage the network investment of ISP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1777-1791
• /
• 2012

This paper considers a downlink cognitive radio (CR) network where one secondary user (SU) and one primary user (PU) share the same base station (BS). The spectrum of interest is divided into a set of independent, orthogonal subchannels. The communication of the PU is of high priority and the quality of service (QoS) is guaranteed by the minimum rate constraint. On the other hand, the communication of the SU is of low priority and the SU opportunistically accesses the subchannels that were previously discarded by the PU during power allocation. The BS assigns fractions ?? and 1 ?? of the total available transmit power to the PU and the SU respectively. Two power allocation schemes with opportunistic subchannel access are proposed, in which the optimal values of ??'s are also obtained. The objective of one scheme is to maximize the rate of the SU, and the objective of the other scheme is to maximize the sum rate of the SU and the PU, both under the PU minimum rate constraint and the total transmit power constraint. Extensive simulation results are obtained to verify the effectiveness of the proposed schemes.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.3
• /
• pp.134-142
• /
• 2005

The implementation of Multiple-Valued Logic(MVL) based on Current-Mode CMOS Logic(CMCL) circuits has recently been achieved. In this paper, four-valued Unary Multiple-Valued logic functions are synthesized using current-mode CMOS logic circuits. We properly make use of the fact that the CMCL addition of logic values represented using discrete current values can be performed at no cost and that negative logic values are readily available via reversing the direction of current flow. A synthesis process for CMCL circuits is based upon a logically complete set of basic elements. Proposed algorithm results in less expensive realization than those achieved using existing techniques in terms of the number of transistors needed. As an alternative to the cost-table techniques Universal Unary Programmable Circuit (UUPC) for a unary function is also proposed.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.1587-1606
• /
• 2015

Comonoid, bi-algebra, and Hopf algebra structures are studied within the universal-algebraic context of entropic varieties. Attention focuses on the behavior of setlike and primitive elements. It is shown that entropic $J{\acute{o}}nsson$-Tarski varieties provide a natural universal-algebraic setting for primitive elements and group quantum couples (generalizations of the group quantum double). Here, the set of primitive elements of a Hopf algebra forms a Lie algebra, and the tensor algebra on any algebra is a bi-algebra. If the tensor algebra is a Hopf algebra, then the underlying $J{\acute{o}}nsson$-Tarski monoid of the generating algebra is cancellative. The problem of determining when the $J{\acute{o}}nsson$-Tarski monoid forms a group is open.

• Honam Mathematical Journal
• /
• v.30 no.4
• /
• pp.589-602
• /
• 2008

As a survey-type article, the paper reviews various digital topological utilities from digital covering theory. Digital covering theory has strongly contributed to the calculation of the digital k-fundamental group of both a digital space(a set with k-adjacency or digital k-graph) and a digital product. Furthermore, it has been used in classifying digital spaces, establishing almost Van Kampen theory which is the digital version of van Kampen theorem in algebrate topology, developing the generalized universal covering property, and so forth. Finally, we remark on the digital k-surface structure of a Cartesian product of two simple closed $k_i$-curves in ${\mathbf{Z}}^n$, $i{\in}{1,2}$.

• Journal of Information Processing Systems
• /
• v.11 no.1
• /
• pp.22-38
• /
• 2015

While Modern Standard Arabic is the formal spoken and written language of the Arab world; dialects are the major communication mode for everyday life. Therefore, identifying a speaker's dialect is critical in the Arabic-speaking world for speech processing tasks, such as automatic speech recognition or identification. In this paper, we examine two approaches that reduce the Universal Background Model (UBM) in the automatic dialect identification system across the five following Arabic Maghreb dialects: Moroccan, Tunisian, and 3 dialects of the western (Oranian), central (Algiersian), and eastern (Constantinian) regions of Algeria. We applied our approaches to the Maghreb dialect detection domain that contains a collection of 10-second utterances and we compared the performance precision gained against the dialect samples from a baseline GMM-UBM system and the ones from our own improved GMM-UBM system that uses a Reduced UBM algorithm. Our experiments show that our approaches significantly improve identification performance over purely acoustic features with an identification rate of 80.49%.

• Proceedings of the KSPS conference
• /
• 2000.07a
• /
• pp.365-365
• /
• 2000

English segments adopted into Korean can be divided into three types: Some English segments /$m, {\;}n, {\;}{\eta}, {\;}p^h, {\;}t^h, {\;}k^h$/ are adopted into the original sound [$m, {\;}n, {\;}{\eta}, {\;}p^h, {\;}t^h, {\;}k^h$] in Korean. Other segments /b, d, g/ appear in the voiceless stop form [p, t, k]. Generative Phonology explains the presence of the above English segments in Korean but it cannot explain why the English segments /$f, {\;}v, {\;}{\Theta}, {\;}{\breve{z}}, {\;}{\breve{c}}, {\;}{\breve{j}}$/ disappear during the adopting process. I present a set of universal constraints from the Optimality Theory proposed by Prince and Smolensky(l993) and I show how English segments differently adopted into Korean can be explained by these universal constraints such as Faith(feature). N oAffricateStop, Faith(nasal), NoNasalStop, Faith(voice), NoVoicedStop and the interaction of these constraints. I conclude that this Optimality Theory provides insights that better capture the nature of the phonological phenomena of English segments in Korean.