• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.5
• /
• pp.48-58
• /
• 1998

In this paper, we proposed a new algorithm using characteristics of th ereconstructed phase trajectory by topological mapping developed for a real-tiem detection of the QRS complexes of ECG signals. Using fill-factor algorithm and mutual information algorithm which are in genral used to find out the chaotic characteristics of sampled signals, we inferred the proper mapping parameter, time delay, in ECG signals and investigated QRS detection rates with varying time delay in QRS complex detection. And we compared experimental time dealy with the theoretical one. As a result, it shows that the experimental time dealy which is proper in topological mapping from ECG signals is 20ms and theoretical time delays of fill-factor algorithm and mutual information algorithm are 20.+-.0.76ms and 28.+-.3.51ms, respectively. From these results, we could easily infer that the fill-factor algorithm in topological mapping from one-dimensional sampled ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper time delay. Also with the proposed algorithm which is very simple and robust to low-frequency noise as like baseline wandering, we could detect QRS complex in real-time by simplifying preprocessing stages. For the evaluation, we implemented the proposed algorithm in C-language and applied the MIT/BIH arrhythmia database of 48 patients. The proposed algorithm provides a good performance, a 99.58% detection rate.

• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1323-1339
• /
• 2008

In this paper, a new class of $(h,{\eta})$-proximal for proper functionals in Hilbert spaces is introduced. The existence and Lip-schitz continuity of the $(h,{\eta})$-proximal mappings for proper functionals are proved. A class of generalized nonlinear quasi-variational-like inclusions in Hilbert spaces is introduced. A perturbed three-step iterative algorithm with errors for the generalized nonlinear quasi-variational-like inclusion is suggested. The existence and uniqueness theorems of solution for the generalized nonlinear quasi-variational-like inclusion are established. The convergence and stability results of iterative sequence generated by the perturbed three-step iterative algorithm with errors are discussed.

• Journal of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.527-535
• /
• 2008

Sufficient conditions are given to assert that between any two Banach spaces over $\mathbb{K}$ Fredholm mappings share exactly N values in a specific open ball. The proof of the result is constructive and is based upon continuation methods.

• Honam Mathematical Journal
• /
• v.21 no.1
• /
• pp.105-113
• /
• 1999

Suppose that ${\Omega}$ is a bounded domain with $C^{\infty}$ smooth boundary in the plane whose associated Bergman kernel, exact Bergman kernel, or $Szeg{\ddot{o}}$ kernel function is an algebraic function. We shall prove that any proper holomorphic mapping of ${\Omega}$ onto the unit disc is algebraic.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1165-1168
• /
• 2003

In this paper, a CLB-based CPLD low-power technology mapping algorithm is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. Therefore the proposed algorithm is proved an efficient algorithm for a low power CPLD technology mapping.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.81-87
• /
• 1992

Wellknown invariance of domain theorems are Brower's invariance of domain theorem for continuous mappings defined on a finite dimensional space and Schauder-Leray's invariance of domain theorem for the class of mappings I+C defined on a infinite dimensional Banach space with I the identity and C compact. The two classical invariance of domain theorems were proved by applying the homotopy invariance of Brower's degree and Leray-Schauder's degree respectively. Degree theory for some class of mappings is a useful tool for mapping theorems. And mapping theorems (or surjectivity theorems of mappings) are closely related with invariance of domain theorems for mappings. In[4, 5], Browder and Petryshyn constructed a multi-valued degree theory for A-proper mappings. From this degree Petryshyn [9] obtained some invariance of domain theorems for locally A-proper mappings. Recently Browder [6] has developed a degree theory for demicontinuous mapings of type ( $S_{+}$) from a reflexive Banach space X to its dual $X^{*}$. By applying this degree we obtain some invariance of domain theorems for demicontinuous mappings of type ( $S_{+}$). ( $S_{+}$).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.12
• /
• pp.2306-2310
• /
• 2007

In this paper, reuse module generation algorithm consider the power consumption for FPGA technology mapping is proposed. To proposed algorithm is RT library generating algorithm, consider power consumption for reuse module using FPGA technology mapping. In the first, selected FPGA for power consumption calculation. Technology mapping process have minimum total power consumption consider LUT's constraint in selected FPGA. A circuit into device by selected proper modules of allocation result for power consumption constraint using data.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.45-60
• /
• 2009

In this paper, we investigate homomorphisms in proper $JCQ^*$-triples and derivations on proper $JCQ^*$-triples associated to the following Pexiderized functional equation $$f(x+y+z)=f_0(x)+f_1(y)+f_2(z)$$. This is applied to investigate homomorphisms and derivations in proper $JCQ^*$-triples.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.693-702
• /
• 2009

In this paper, we introduce and study a system of mixed variational inequalities in Banach spaces. By using J-proximal mapping and its Lipschitz continuity for a nonconvex, lower semicontinuous, subdifferentiable, proper functional, an iterative algorithm for computing the approximate solutions of system of mixed variational inequalities is suggested and analyzed. The convergence criteria of the iterative sequences generated by iterative algorithm is also discussed.

• Advances in robotics research
• /
• v.2 no.1
• /
• pp.45-57
• /
• 2018

Even though the popularity of projection mapping continues to increase and it is being implemented in more and more settings, most current projection mapping systems are limited to special purposes, such as outdoor events, live theater and musical performances. This lack of versatility arises from the large number of projectors needed and their proper calibration. Furthermore, we cannot change the positions and poses of projectors, or their projection targets, after the projectors have been calibrated. To overcome these problems, we propose a projection mapping method using a projector robot that can perform projection mapping in more general or ubiquitous situations, such as shopping malls. We can estimate a projector's position and pose with the robot's self-localization sensors, but the accuracy of this approach remains inadequate for projection mapping. Consequently, the proposed method solves this problem by combining self-localization by robot sensors with position and pose estimation of projection targets based on a 3D model. We first obtain the projection target's 3D model and then use it to accurately estimate the target's position and pose and thus achieve accurate projection mapping with a projector robot. In addition, our proposed method performs accurate projection mapping even after a projection target has been moved, which often occur in shopping malls. In this paper, we employ Ubiquitous Display (UD), which we are researching as a projector robot, to experimentally evaluate the effectiveness of the proposed method.