• Journal of the Korea Computer Graphics Society
• /
• v.6 no.3
• /
• pp.1-7
• /
• 2000

The number of pixels being processed in a raster graphics system often exceeds 1 million per frame. Replacing fractional arithmetic by integer arithmetic on rendering graphics primitives will therefore significantly improve the rendering performance. A scaling method that replaces fractional arithmetic by integer arithmetic on rendering graphics primitives is introduced. This method is applied to the filtered edge drawing and Gouraud shading. This method will also be applicable to some of other incremental algorithms for rendering graphics primitives. Because the scaling method requires only simple modifications upon the known algorithms that already have been implemented in ASIC (Application Specific Integrated Circuit), our algorithms can easily be implemented in ASIC. Our method will be useful especially for the low-price systems (e.g., home game machines, personal computers, etc.).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5C
• /
• pp.410-419
• /
• 2012

This paper proposes a secure and efficient anonymous authentication scheme for health information push service based on indoor location in hospital. The proposed scheme has the following benefits: (1)It is just based on a secure one-way hash function for avoiding complex computations for both health care operations users and health care centers. (2)It does not require sensitive verification table which may cause health care centers to become an attractive target for numerous attacks(e.g., insertion attacks and stolen-verifier attacks), (3)It provides higher security level (e.g., secure mutual authentication and key establishment, confidential communication, user's privacy, simple key management, and session key independence). As result, the proposed scheme is very suitable for various location-based medical information service environments using lightweight-device(e.g., smartphone) because of very low computation overload on the part of both health care operations users and health care centers.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.933-945
• /
• 2016

Sharing data by multiple users on the public storage, e.g., the cloud, is considered to be efficient because the cloud provides on-demand computing service at anytime and anywhere. Secure data sharing is achieved by fine-grained access control. Existing symmetric and public key encryption schemes are not suitable for secure data sharing because they support 1-to-1 relationship between a ciphertext and a secret key. Attribute based encryption supports fine-grained access control, however it incurs linearly increasing ciphertexts as the number of attributes increases. Additionally, the decryption process has high computational cost so that it is not applicable in case of resource-constrained environments. In this study, we propose an efficient attribute-based secure data sharing scheme with outsourceable decryption. The proposed scheme guarantees constant-size ciphertexts irrespective of the number of attributes. In case of static attributes, the computation cost to the user is reduced by delegating approximately 95.3% of decryption operations to the more powerful storage systems, whereas 72.3% of decryption operations are outsourced in terms of dynamic attributes.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.193-201
• /
• 2008

Using Network Coding in P2P systems yields great benefits, e.g., reduced download delay. The core notion of Network Coding is to allow encoding and decoding at intermediate nodes, which are prohibited in the traditional networking. However, improper implementation of Network Coding may reduce the overall performance of P2P systems. Network Coding cannot work with general arithmetic operations, since its arithmetic is over a Finite Field and the use of an efficient Finite Field arithmetic algorithm is the key to the performance of Network Coding. Also there are other important performance parameters in Network Coding such as Field size. In this paper we study how those factors influence the performance of Network Coding based systems. A set of experiments shows that overall performance of Network Coding can vary 2-5 times by those factors and we argue that when developing a network system using Network Coding those performance parameters must be carefully chosen.

• Journal of Radiation Protection and Research
• /
• v.13 no.2
• /
• pp.29-40
• /
• 1988

A spectrum-exposure rate conversion operator G(E) for a portable HPGe detector used for field environmental radiation survey was theoretically developed on the basis of a space distribution function of gamma flux emitted from a disk source and an areal efficiency of the detector. The radiation exposure rates measured using this G(E) and the portable HPGe. detector connected to a portable multichannel analyzer were compared with those measured by a 3' ${\phi}\;{\times}$3' NaI(Tl) scintillation detector with the reported G(E) and a pressurized ionization chamber. A comparison of the three results showed that the result obtained using the HPGe detector was lower than those determined using the NaI(Tl) detector and ionization chamber by 17% to 29%, The difference obtained is close to that reported in literature. The method developed here can be easily applicable to obtain a G(E) factor suitable to any detector for detecting the exposure rate of environmental gamma radiation, since the spectrum-exposure rate conversion operator can be calculated by a hand calculator.

• Korea Information Processing Society Review
• /
• v.15 no.2
• /
• pp.123-132
• /
• 2008

그리드 기반의 e-Science 시스템을 실용화하여 세계 최고 수준의 국가적 첨단 공동 연구 장비의 활용도를 제고하고 e-Science 기반의 동시협업 연구가 가능한 차세대 연구 개발 환경 구축을 목적으로 국내 유일의 가속전압 1.3 MV의 초고전압투과전자현미경 (HVEM)을 이용한 전문연구 포털인 e-HVEM 포털을 개발하였다. 이는 웹 포탈 시스템에서 원격 제어 (Tele-HVEM), Nano-Bio 데이터베이스 및 계산 그리드 기반의 tomography 시스템 (G-Render)를 동시에 사용 할 수 있는 통합 연구 환경으로써 e-HVEM 포털 시스템에서 단순 장비 운용뿐만 아니라 실제연구 분석까지 활용할 수 있도록 하였다. 특히 본 연구에서는 HVEM으로부터 얻어진 일련의 화상 정보들에 대한 3차원 구조 복원을 위하여 그리드 연산 시스템을 도입함으로써 보다 빠른 시간에 원하는 최종 결과물을 얻을 수 있도록 구성하였다. 이로써 e-HVEM 포털은 다양한 국가 대형 연구 장비를 활용하여 시공간 개념을 넘어선 e-Science 공동 협업 시스템의 성공적인 모델로써 국내는 물론 국제적인 공동 연구를 수행할 수 있는 장비 활용 가상 실험실 구축의 실현 가능성을 시사한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.2
• /
• pp.3-12
• /
• 2006

The spread of mobile devices, PDAs and sensors has enabled the construction of ubiquitous computing environments, transforming regular physical spaces into 'smart space' augmented with intelligence and enhanced with services. However, unless privacy concerns are taken into account early in the design process of various ubiquitous devices(e.g. mobile devices, PDAs, sensors, etc.). we will end up crating ubiquitous surveillance infrastructure. Also, it may inappropriate to use public key techniques for computational constrained devices in ubiquitous computing environment. In this paper, we propose efficient user authentication and ky agreement protocol not only to preserve anonymity for protecting personal privacy but also to be suitable for computational constrained devices in ubiquitous computing environments.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.149-157
• /
• 2012

In this thesis, the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join state. One approximation scenario is to provide a maximum subset of the result, with the objective of losing as few result tuples as possible. An alternative scenario is to provide a random sample of the join result, e.g., if the output of the join is being aggregated. It is shown formally that neither approximation can be addressed effectively for a sliding-window join of arbitrary input streams. Previous work has addressed only the maximum-subset problem, and has implicitly used a frequency based model of stream arrival. There exists a sampling problem for this model. More importantly, it is shown that a broad class of applications for which an age-based model of stream arrival is more appropriate, and both approximation scenarios under this new model are addressed. Finally, for the case of multiple joins being executed with an overall memory constraint, an algorithm for memory allocation across the join that optimizes a combined measure of approximation in all scenarios considered is provided.

• Journal of Elementary Mathematics Education in Korea
• /
• v.11 no.1
• /
• pp.1-21
• /
• 2007

The purpose of this study was to propose instructional methods using base-ten blocks in teaching the multiplication of decimal for 5th grade students by analyzing the process of their conceptual comprehension of multiplication of decimal. The students in this study were found to understand various meanings of operations (e.g., repeated addition, bundling, and area) by modeling them with base-ten blocks. They were able to identify the algorithm through the use of base-ten blocks and to understand the principle of calculations by connecting the manipulative activities to each stage of algorithm. The students were also able to determine whether the results of multiplication of decimal might be reasonable using base-ten blocks. This study suggests that appropriate use of base-ten blocks promotes the conceptual understanding of the multiplication of decimal.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.8
• /
• pp.739-746
• /
• 2011

Recently, recommender systems have been widely applied in E-commerce websites to help their customers find the items what they want. A recommender system should be able to provide users with useful information regarding their interests. The ability to immediately respond to the changes in user's preference is a valuable asset of recommender systems. This paper proposes a novel recommender system which aims to effectively adapt and respond to the immediate changes in user's preference. The proposed system combines IEC (Interactive Evolutionary Computation) with a content-based filtering method and also employs data grouping in order to improve time efficiency. Experiments show that the proposed system makes acceptable recommendations while ensuring quality and speed. From a comparative experimental study with an existing recommender system which uses the content-based filtering, it is revealed that the proposed system produces more reliable recommendations and adaptively responds to the changes in any given condition. It denotes that the proposed approach can be an alternative to resolve limitations (e.g., over-specialization and sparse problems) of the existing methods.