• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.635-637
• /
• 2012

In Gen-2 Q-algorithm, the value of initial $Q_{fp}$ and weight C is not defined in the standard. If we let the initial $Q_{fp}$ be large or small, the number of empty slot will be large during the initial query round or almost all the slots will be collided, respectively. Also, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, it is anticipated that the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we analyze how the performances of Gen-2 Q-algorithm will be affected by the weight and initial slot-count size.

• Journal of the Korean Magnetic Resonance Society
• /
• v.24 no.1
• /
• pp.30-37
• /
• 2020

Quantitative nuclear magnetic resonance (qNMR) has been gaining attention as a purity assessment method. In particular, qNMR is recognized as the primary method to realize the Internal System of Units (SI) in organic analysis. The capability of quantitative analysis is recognized as the beginning of NMR development. NMR signals are proportional to the number of nuclei and qNMR has been used in various fields, such as metabolomics and food and pharmaceutical analysis. However, careful sample preparation and thorough optimization of measurement parameters are required to obtain accurate and reliable results. In this review, quantitative methods used in qNMR are discussed, and the important factors to be considered also introduced. The recent development of qNMR techniques including combination with chromatography and, multidimensional NMR are also presented.

• Journal of the Chungcheong Mathematical Society
• /
• v.36 no.4
• /
• pp.289-296
• /
• 2023

When G is an abelian group, we use the notation M(G, n) to denote the Moore space. The space X is the wedge product space of Moore spaces, given by X = M(ℤ_q, n+ 2) ∨ M(ℤ_q, n+ 1) ∨ M(ℤ_q, n). We determine the self-homotopy classes group [X, X] and the self-homotopy equivalence group 𝓔(X). We investigate the subgroups of [M_j , M_k] consisting of homotopy classes of maps that induce the trivial homomorphism up to (n + 2)-homotopy groups for j ≠ k. Using these results, we calculate the subgroup 𝓔^dim_#(X) of 𝓔(X) in which all elements induce the identity homomorphism up to (n + 2)-homotopy groups of X.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.9
• /
• pp.1325-1332
• /
• 2013

The first frame of a GOP, an I frame, is encoded in intra mode which generates a larger number of bits. In addition, the I frame is used for the inter mode encoding of the following frames. Thus the intial QP for the I frame affects the first frame as well as the following frames. In our previous work, we analyzed the number of bits for an I frame and showed that the ratio of the number of bits which maximizes the PSNR of a GOP maintains similar value regardless of GOP's. In this paper, we propose a R-Q model which can be used for the calculation of the initial QP given the amount of bits for an I frame. The proposed model is simple and adaptively modifies model parameters, so it can be applicable to the real-time application. It is shown by experimental results that the proposed model captures initial QP characteristics effectively and the proposed method for model parameters accurately estimates the real values.

• The Journal of Korea Robotics Society
• /
• v.15 no.4
• /
• pp.404-412
• /
• 2020

Typically everyday human life tasks involve at least two people moving objects such as tables and beds, and the balancing of such object changes based on one person's action. However, many studies in previous work performed their tasks solely on robots without factoring human cooperation. Therefore, in this paper, we propose cooperative robot for table balancing using Q-learning that enables cooperative work between human and robot. The human's action is recognized in order to balance the table by the proposed robot whose camera takes the image of the table's state, and it performs the table-balancing action according to the recognized human action without high performance equipment. The classification of human action uses a deep learning technology, specifically AlexNet, and has an accuracy of 96.9% over 10-fold cross-validation. The experiment of Q-learning was carried out over 2,000 episodes with 200 trials. The overall results of the proposed Q-learning show that the Q function stably converged at this number of episodes. This stable convergence determined Q-learning policies for the robot actions. Video of the robotic cooperation with human over the table balancing task using the proposed Q-Learning can be found at http://ibot.knu.ac.kr/videocooperation.html.

• Journal of Society of Preventive Korean Medicine
• /
• v.21 no.1
• /
• pp.95-106
• /
• 2017

Objectives : Although interest in preventive medicine has increased recently, "Mibyeong", the preventive concept of Korean medicine, is still unfamiliar to the general public. Therefore, this study aims to investigate the concept of Mibyeong and users used on the Internet. Methods : Naver (www.naver.com), which has the highest ranking in terms of market share, number of visitors, search time share, and community category share, has been selected as a search target and jisik-iN Q&A and posts of cafe about Mibyeong were searched for recently approximately 6 years. Results : 105 cases of Jisik-iN Q&A and 283 cases of cafe posts were searched. Overall, the number of Jisik-iN Q&A and cafe posts's Mibyeong term usage was the highest in 2013. In the Internet user category, Mibyeong Term was used most commonly in the Jisik-iN Q&A by Korean medicine related medical personnel (29 cases, 28%) and in the cafe other health-related workers (87cases, 31%). In Mibyeong related cafe classification, Information Exchange (220 cases, 77%) was the most frequent and besides 39 cases (14%) used in Operation of Medical Institutions. And the concept of Mibyeong was often used as symptom-based rather than diagnostic test or disease (Cafe posts 52%, Jisik-iN Q&A 70%), in particular, topic of Mibyeong related Jisik-iN Q&A was used in the order of pain (31 cases, 16%), cancer (17 cases, 9%), fatigue (11 cases, 6%). Conclusions : This study has significance as basic research data of general Internet user group and can be used as fundamental data for awareness promotion, publicity and necessity of Mibyeong.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.5
• /
• pp.7-12
• /
• 2016

In general, crowded places, such as banks, government offices and hospitals, require the customer to wait for a certain period of time. Thus according to the order of the wait, customers takes waiting numbers. In this way, so customers should always check the order of waiting processes that they can not carry on another affairs. In this paper, we develop an application, that is SmartQ, managing queue using a mobile handset. SmartQ is an easy-to-use application allowing customers an alternative to the classic queue management systems. With this application, they are aware of the waiting conditions in real time for each of their services. They can indicate the time they wish to come and take a virtual ticket in the queue. It provides service notification, the number of waiting person, and expected waiting time.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.71-76
• /
• 2014

There is to be virtually impossible to solve the very large digits of prime number p and q from composite number n=pq using integer factorization in typical public-key cryptosystems, RSA. When the public key e and the composite number n are known but the private key d remains unknown in an asymmetric-key RSA, message decryption is carried out by first obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and then using a reverse function of $d=e^{-1}(mod{\phi}(n))$. Integer factorization from n to p,q is most widely used to produce ${\phi}(n)$, which has been regarded as mathematically hard. Among various integer factorization methods, the most popularly used is the congruence of squares of $a^2{\equiv}b^2(mod\;n)$, a=(p+q)/2,b=(q-p)/2 which is more commonly used then n/p=q trial division. Despite the availability of a number of congruence of scares methods, however, many of the RSA numbers remain unfactorable. This paper thus proposes an algorithm that directly and immediately obtains ${\phi}(n)$. The proposed algorithm computes $2^k{\beta}_j{\equiv}2^i(mod\;n)$, $0{\leq}i{\leq}{\gamma}-1$, $k=1,2,{\ldots}$ or $2^k{\beta}_j=2{\beta}_j$ for $2^j{\equiv}{\beta}_j(mod\;n)$, $2^{{\gamma}-1}$ < n < $2^{\gamma}$, $j={\gamma}-1,{\gamma},{\gamma}+1$ to obtain the solution. It has been found to be capable of finding an arbitrarily located ${\phi}(n)$ in a range of $n-10{\lfloor}{\sqrt{n}}{\rfloor}$ < ${\phi}(n){\leq}n-2{\lfloor}{\sqrt{n}}{\rfloor}$ much more efficiently than conventional algorithms.

• Honam Mathematical Journal
• /
• v.26 no.1
• /
• pp.61-75
• /
• 2004

It is shown that every almost linear mapping $h:{\mathcal{A}}{\rightarrow}{\mathcal{B}}$ of a unital Poisson Banach algebra ${\mathcal{A}}$ to a unital Poisson Banach algebra ${\mathcal{B}}$ is a Poisson algebra homomorphism when h(xy) = h(x)h(y) holds for all $x,y{\in}\;{\mathcal{A}}$, and that every almost linear almost multiplicative mapping $h:{\mathcal{A}}{\rightarrow}{\mathcal{B}}$ is a Poisson algebra homomorphism when h(qx) = qh(x) for all $x\;{\in}\;{\mathcal{A}}$. Here the number q is in the functional equation given in the almost linear almost multiplicative mapping. We prove that every almost Poisson bracket $B:{\mathcal{A}}\;{\times}\;{\mathcal{A}}\;{\rightarrow}\;{\mathcal{A}}$ on a Banach algebra ${\mathcal{A}}$ is a Poisson bracket when B(qx, z) = B(x, qz) = qB(x, z) for all $x,z{\in}\;{\mathcal{A}}$. Here the number q is in the functional equation given in the almost Poisson bracket.

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

Carlitz module is used to study abelian extensions of K=$F_{q}$(T). In number theory every abelian etension of Q is contained in a cyclotomic field. Similarly every abelian extension of $F_{q}$(T) with some condition on .inf. is contained in a cyclotomic function field. Hence the study of cyclotomic function fields in analogy with cyclotomic fields is an important subject in number theory. Much are known in this direction such as ring of integers, class groups and units ([G], [G-R]). In this article we are concerned with the ring of integers in a cyclotomic function field. In [G], it is shown that the ring of integers is generated by a primitive root of the Carlitz module using the ramification theory and localization. Here we will give another proof, which is rather elementary and explicit, of this fact following the methods in [W].[W].