• 한국정보과학회논문지:소프트웨어및응용
• /
• 제34권11호
• /
• pp.1001-1010
• /
• 2007

HMM은 파라미터의 수가 많을수록 모델링 성능이 향상되어 해당 클래스 데이타는 뿐만 아니라 혼동되는 다른 클래스 데이타에 대해서도 높은 확률을 출력하는 경향이 있다. 그러므로 단순히 파라미터 수를 증가 시키는 것은 변별력 향상에 도움이 되지 않는다. 본 논문에서는 혼동되는 클래스 데이터의 확률을 이용한 혼동 확률 선택 기준CMC(Confusion Model Selection Criterion)과 혼동 클래스 데이터를 구성하여 혼동 모델을 만들고 이것을 이용한 새로운 인식 방법인 RCM(Recognition using Confusion Models)을 제안하였다. 제안한 인식 방법은 혼동되는 클래스 데이타의 구성으로 혼동 데이타 집합을 만들고 이것을 이용하여 별도의 혼동 모델을 훈련한 후, 혼동 모델의 확률을 해당 표준 모델의 확률에서 차감하여 해당 클래스 데이타의 오인식 가능성을 억제한다. 모델 선택 기준 CMC를 온라인 필기 숫자 데이타를 대상으로 실험하여 기존 모델 선택 기준인 ML, ALC2, BIC와 비교 분석한 결과, 제안한 방법인 CMC가 적은 파라미터로 좋은 결과를 보였으며, 제안한 혼동 모델 인식 방법인 RCM은 93.08%의 인식률을 보여 표준 모델만을 사용한 인식한 방법보다 정인식률이 약 1.5%향상되었고, 이는 오류의 17.4%가 감소된 결과이다.

• 전기학회논문지
• /
• 제66권8호
• /
• pp.1215-1221
• /
• 2017

Parametric array transducers are used for highly directional speaker in an air environments. Piezoelectric micromachined ultrasonic transducers for parametric array transducers need DC-biased voltage driving signals in order to get high-directional quality-sound features. The existing power amplifier such as class A amplifiers has low efficiency and require large volume heatsinks. To overcome the above-mentioned disadvantages of the conventional amplifier, this paper proposes a new power amplifier system. The proposed power amplifier system ensures high linearity of output characteristic by utilizing the push-pull class B type amplifier. Furthermore, the proposed power amplifier system gets high efficiency because it contains the DC-DC converter-type power supply which can perform energy recovery and envelope tracking function. Also the paper suggests the detailed circuit topology. Its characteristics are verified by the detailed experimental results.

• 전자공학회논문지B
• /
• 제33B권10호
• /
• pp.139-147
• /
• 1996

In this study a two-stage fast pulse generaor using magnetic switches is proposed. The scheme consist of a switch, an inductor and two pairs of capacitor and saturable inductors, a linear transformer. The basic principle and the operation are described using a set of given parameters. The main issue of the magnetic pulse genration scheme is the system efficiency. This study focuses on the system efficiency improvement using magnetic switches. The voltage compression ratio, energy transfer with respect to core area are investigated. The output voltage and transferred energy as a function of input voltage are also included. Also, an analysis and experiments are performed to verify the porposed topology by implementing a 10[J] class experimental circuit. The efficiency of the transferred energy a tload side is 82%.

• 대한수학회보
• /
• 제30권2호
• /
• pp.179-185
• /
• 1993

In this article S is a topologically complete subspace of $R^{1}$i.e., the relativized topology on S may be metrized so as to make S complete. B(S) is the Borel .sigma.-field of S. For .GAMMA. one takes a set of measurable monotone (increasing or dereasing) functions on S into itself. Make the assumption of pp. There exists $x_{0}$ and a positive integer $n_{0}$ such that (Fig.) It is then shown that there exists a unique inveriant probability to which $p^{(n)}$ (x,dy) converges exponentially fast in a metric (stronger than the Kolmogorov distance); this convergence is uniform for all x .mem. S. This generalizes an earlier result of Bhattacharya and Lee (1988) who considered monotone nondecreasing maps on S.

• Journal of Information Technology Applications and Management
• /
• 제10권2호
• /
• pp.61-71
• /
• 2003

Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

• Asia pacific journal of information systems
• /
• 제1권1호
• /
• pp.49-62
• /
• 1991

This paper examines the problems of database partitioning and file allocation in a fixed topology distributed computer network. The design objective is to make files as collections of attributes and to allocate these files to network nodes so that a minimum total transmission cost is achieved subject to storage capacity constraints. A mathematical model for solving the problem is formulated and, the resulting optimization problem is shown to fall in a class of NP-complete problems. A new heuristic algorithm is developed which uses the idea of allocating attributes according to the transaction requirements at each computer node and then making files using the allocated attributes. Numerical results indicate that the heuristic algorithm yields practicable low cost solutions in comparison with the existing methods which deal with the file allocation problems and database partitioning problems independently.

• ETRI Journal
• /
• 제30권2호
• /
• pp.301-307
• /
• 2008

As broadband access is evolving from digital subscriber lines to optical access networks, Ethernet passive optical networks (EPONs) are considered a promising solution for next generation broadband access. The point-to-multipoint topology of EPONs requires a time-division multiple access MAC protocol for upstream transmission. In this paper, we propose a new enhanced dynamic bandwidth allocation algorithm with fairness called EFDBA for multiple services over EPONs. The proposed algorithm is composed of a fairness counter controller and a fairness system buffer in the optical line terminal. The EFDBA algorithm with fairness can provide increased capability and efficient resource allocation in an EPON system. In the proposed EFDBA algorithm, the optical line termination allocates bandwidth to the optical network units in proportion to the fairness weighting counter number associated with their class and queue length. The proposed algorithm provides efficient resource utilization by reducing the unused remaining bandwidth made by idle state optical network units.

• 대한수학회지
• /
• 제45권1호
• /
• pp.1-27
• /
• 2008

We introduce a new concept of convex spaces and a multimap class K having certain KKM property. From a basic KKM type theorem for a K-map defined on an convex space without any topology, we deduce ten equivalent formulations of the theorem. As applications of the equivalents, in the frame of convex topological spaces, we obtain Fan-Browder type fixed point theorems, almost fixed point theorems for multimaps, mutual relations between the map classes K and B, variational inequalities, the von Neumann type minimax theorems, and the Nash equilibrium theorems.

• Kyungpook Mathematical Journal
• /
• 제62권2호
• /
• pp.363-388
• /
• 2022

In two previous papers the author presented a general construction of finite, fiber- and orientation-preserving group actions on orientable Seifert manifolds. In this paper we restrict our attention to elliptic 3-manifolds. For illustration of our methods a constructive proof is given that orientation-reversing and fiber-preserving diffeomorphisms of Seifert manifolds do not exist for nonzero Euler class, in particular elliptic 3-manifolds. Each type of elliptic 3-manifold is then considered and the possible group actions that fit the given construction. This is shown to be all but a few cases that have been considered elsewhere. Finally, a presentation for the quotient space under such an action is constructed and a specific example is generated.

• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.125-137
• /
• 2006

Nowadays, many commercial CAD systems support history-based, constraint-based and feature-based modeling. Unfortunately, most systems fail during the re-evaluation phase when various kind of topological changes occur. This issue is known as "persistent naming" which refers to the problem of identifying entities in an initial parametric model and matching them in the re-evaluated model. Most works in this domain focus on the persistent naming of atomic entities such as vertices, edges or faces. But very few of them consider the persistent naming of aggregates like shells (any set of faces). We propose in this paper a complete framework for identifying and matching any kind of entities based on their underlying topology, and particularly shells. The identifying method is based on the invariant structure of each class of form features (a hierarchical structure of shells) and on its topological evolution (an historical structure of faces). The matching method compares the initial and the re-evaluated topological histories, and computes two measures of topological similarity between any couple of entities occurring in both models. The naming and matching method has been implemented and integrated in a prototype of commercial CAD Software (Topsolid).