• Journal of Aerospace System Engineering
• /
• v.4 no.1
• /
• pp.19-22
• /
• 2010

The accuracy and integrity of global navigation satellite systems (GNSS) can be improved by using GNSS augmentation systems. Large ionospheric spatial gradient, during ionosphere storm, is a major threat for using GNSS augmentation systems by increasing the spatial decorrelation between a reference system and users. Ionosphere decorrelation behavior can be analyzed by using dual frequency GPS data. GNSS receivers have their own biases, called inter-frequency bias (IFB) between dual(P1 and P2) frequencies and they must be accurately estimated before computing ionosphere delays. GPS network data in Korea is used to compute each receiver's IFB, and their estimation accuracy and variability are analyzed. IFB estimation methodology to apply for ionosphere gradient analysis is discussed.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.2
• /
• pp.29-33
• /
• 2002

Various nanometer-scale structures are fabricated on hydrogen-passivated p-type Si(100) surface by scanning probe microscopy(SPM). The hydrogen-passivation is performed by dipping the samples in diluted 10% HF solution for one min.. Pt alloy wires are used for tips and the tips are made by cutting the wires at 45$^{\circ}$ slanted. Various line features are fabricated in various bias voltage. The optimal structure is the line of about 30 nm width on 1.7V bias voltage and 1 nA tunneling current.  

• Industrial Engineering and Management Systems
• /
• v.11 no.4
• /
• pp.385-389
• /
• 2012

With the development of computer storage and the rapidly growing ability to process large amounts of data, the multivariate control charts have received an increasing attention. The existing univariate and multivariate control charts are a single hypothesis testing approach to process mean or variance by using a single statistic plot. This paper proposes a multiple hypothesis approach to developing a new multivariate control scheme. Plotted Hotelling's $T^2$ statistics are used for computing the corresponding p-values and the procedure for controlling the false discovery rate in multiple hypothesis testing is applied to the proposed control scheme. Some numerical simulations were carried out to compare the performance of the proposed control scheme with the ordinary multivariate Shewhart chart in terms of the average run length. The results show that the proposed control scheme outperforms the existing multivariate Shewhart chart for all mean shifts.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.3
• /
• pp.165-170
• /
• 2007

Recommendation systems provide users with proper services using context information being input from many sensors occasionally under ubiquitous computing environment. But in case there isn't sufficient context information for service recommendation in spite of much context information, there can be problems of resulting in inexact result. In addition, in the quantification step to use context information, there are problems of classifying context information inexactly because of using an absolute classification course. In this paper, we solved the problem of lack of necessary context information for service recommendation by using dynamic profile information. We also improved the problem of absolute classification by using a relative classification of context information in quantification step. As the result of experiments, expectation preference degree was improved by 7.5% as compared with collaborative filtering methods using an absolute quantification method where context information of P2P mobile agent is used.

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1049-1067
• /
• 2019

In this paper, we discuss the number of distinct fuzzy subgroups of the group ${\mathbb{Z}}_{p^n}{\times}{\mathbb{Z}}_{q^m}{\times}{\mathbb{Z}}_r$, m = 1, 2, 3 where p, q, r are distinct primes for any $n{\in}{\mathbb{Z}}^+$ using the criss-cut method that was proposed by Murali and Makamba in their study of distinct fuzzy subgroups. The criss-cut method first establishes all the maximal chains of the subgroups of a group G and then counts the distinct fuzzy subgroups contributed by each chain. In this paper, all the formulae for calculating the number of these distinct fuzzy subgroups are given in polynomial form.

• Electronics and Telecommunications Trends
• /
• v.20 no.1 s.91
• /
• pp.147-156
• /
• 2005

이동 환경에서 뿐만 아니라 향후 단말 중심의 개인화 서비스가 제공되는 유비쿼터스 환경에서는 다양한 단말 및 센서들이 존재할 것이고 이들은 네트워크 상에서 서로 상대의 위치를 인식하여 특정 장치가 가진 기능이나 서비스를 획득하기 위하여 상호 통신하거나 새로이 추가되는 장치를 자동으로 구성할 수있어야 한다. 이와 같이, 위치 기반 서비스 및 peer-to-peer 컴퓨팅을 지원하기 위해 ‘서비스 발견’은 모바일 컴퓨팅을 위한 미들웨어로서의 역할을 수행하게 될 것이다. 본 논문에서는 JINI, UPnP, Salutation, SLP2, Bluetooth SDP 등의 기술에서 제공되는 서비스 발견 프로토콜(메커니즘)을 살펴보고 이들의 특성을 비교하고자 한다.

• Journal of the Korean Mathematical Society
• /
• v.52 no.1
• /
• pp.209-224
• /
• 2015

Computing square, cube and n-th roots in general, in finite fields, are important computational problems with significant applications to cryptography. One interesting approach to computational problems is by using polynomial representations. Agou, Del$\acute{e}$eglise and Nicolas proved results concerning the lower bounds for the length of polynomials representing square roots modulo a prime p. We generalize the results by considering n-th roots over finite fields for arbitrary n > 2.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.419-423
• /
• 1996

These days, industrial robots are required to have high speed and high precision in doing various tasks. Recently, the adaptive control algorithms for those nonlinear robots have been developed. With spatial vector space, these adaptive algorithms including recursive implementation are simply described. Without sensing joint acceleration and computing the inversion of inertia matrix, these algorithms which include P.D. terms and feedforward terms have global tracking convergence. In this paper, the feasibility of the proposed control method is illustrated by applying to 2 DOF SCARA robot in DSP(Digital Signal Processing).

• The Pure and Applied Mathematics
• /
• v.29 no.4
• /
• pp.255-275
• /
• 2022

In this paper, we introduce a new system of set-valued variational inclusion problems in semi-inner product spaces. We use resolvent operator technique to propose an iterative algorithm for computing the approximate solution of the system of set-valued variational inclusion problems. The results presented in this paper generalize, improve and unify many previously known results in the literature.

• Journal of Computing Science and Engineering
• /
• v.2 no.3
• /
• pp.249-273
• /
• 2008

Epidemic protocols have two fundamental assumptions. One is the availability of a mechanism that provides each node with a set of log(N) (fanout) nodes to gossip with at each cycle. The other is that the network size N is known to all member nodes. While it may be trivial to support these assumptions in small systems, it is a challenge to realize them in large open dynamic systems, such as peer-to-peer (P2P) systems. Technically, since the most fundamental parameter of epidemic protocols is log(N), without knowing the system size, the protocols will be limited. Further, since the network churn, frequently observed in P2P systems, causes rapid membership changes, providing a different set of log(N) at each cycle is a difficult problem. In order to support the assumptions, the fanout nodes should be selected randomly and uniformly from the entire membership. This paper investigates one possible solution which addresses both problems; providing at each cycle a different set of log(N) nodes selected randomly and uniformly from the entire network under churn, and estimating the dynamic network size in the number of nodes. This solution improves the previously developed distributed algorithm called Shuffle to deal with churn, and utilizes the Shuffle infrastructure to estimate the dynamic network size. The effectiveness of the proposed solution is evaluated by simulation. According to the simulation results, the proposed algorithms successfully handle network churn in providing random log(N0 fanout nodes, and practically and accurately estimate the network size. Overall, this work provides insights in designing epidemic protocols for large scale open dynamic systems, where the protocols behave autonomically.