• 전자공학회논문지A
• /
• 제30A권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.

• 전자공학회논문지A
• /
• 제30A권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.

• 한국언어정보학회지:언어와정보
• /
• 제6권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.

• 한국정보통신학회논문지
• /
• 제26권1호
• /
• pp.153-161
• /
• 2022

본 연구는 콘텐츠 제공자를 포함한 플랫폼 사업자가 광대역 인터넷 접속을 통해 고품질의 콘텐츠를 제공하는 경우 보편적 서비스 기여금을 분담할 때 이것의 경제적 효과를 분석한다. 주요 결과는 다음과 같다. 첫째, 플랫폼 사업자가 독점적 위치에 있다면 트래픽 이용량은 사회적 최적 수준보다 적으며, ISP가 결정하는 가격들은 콘텐츠 수요의 가격민감도에 영향을 받는다. 둘째, 플랫폼 사업자가 경쟁적인 경우 ISP가 책정하는 요금은 사회적 최적 수준과 동일하다. 셋째, 플랫폼 사업자가 콘텐츠 요금을 부과하지 않는 경우는 ISP는 요금을 사회적 최적 수준으로 결정하고 광고 수입이 많을수록 소비자에게 부과하는 망 이용대가는 줄어든다. 이는 플랫폼 사업자에게 고품질 콘텐츠 서비스를 제공할 수 있는 네트워크 서비스를 이용하는 대신, 보편적 서비스 기여분 분담을 의무화한다면 사회후생은 증가될 수 있기 때문에 플랫폼 사업자에게 보편적 서비스 기여분을 분담하는 것이 사회적으로 바람직하다는 것을 시사해 준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권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.

• 융합신호처리학회논문지
• /
• 제6권3호
• /
• pp.134-142
• /
• 2005

전류모드 CMOS 회로기반 다치 논리 회로가 최근에 구현되고 있다. 본 논문에서는 4-치 Unary 다치 논리 함수를 전류모드 CMOS 논리 회로를 사용하여 합성하였다. 전류모드 CMOS(CMCL)회로의 덧셈은 각 전류 값들이 회로비용 없이 수행될 수 있고 또한 부의 논리 값은 전류흐름을 반대로 함으로써 쉽게 구현이 가능 하다. 이러한 CMCL 회로 설계과정은 논리적으로 조합된 기본 소자들을 사용하였다. 제안된 알고리듬을 적용한 결과 트랜지스터의 숫자를 고려하는 기존의 기법보다 더욱 적은 비용으로 구현할 수 있었다. 또한 비용-테이블 기법의 대안으로써 Unary 함수에 대해서 범용 UUPC(Universal Unary Programmable Circuit) 소자를 제안하였다.

• 대한수학회보
• /
• 제52권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.

• 호남수학학술지
• /
• 제30권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
• /
• 제11권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%.

• 대한음성학회:학술대회논문집
• /
• 대한음성학회 2000년도 7월 학술대회지
• /
• 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.