• Journal of Educational Research in Mathematics
• /
• v.11 no.1
• /
• pp.51-66
• /
• 2001

In this paper, we tried to examine the didactical transpositions of the mathematical knowledges in the computer-based environment for mathematics learning and teaching, and also analyse the extreme didactical problems Computer has been regarded as an alterative that could overcome the difficulties in the teaching and learning of mathematics and many broad studies have been made to use computers in mathematics teaching and learning. But Any systematic analysis on the didactical problems of the computer-based environment for mathematics education has not been tried up to this time. In this paper, first of all, we analysed the didactical problems in the computer-based environment, and then, the mode of using computer for mathematics teaching and learning.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.01a
• /
• pp.173-175
• /
• 2012

To spread the incredible experience of wandering around a building, we propose the architecture of indoor navigation system based on inter-floor. Firstly, we combine trilateration method with Fingerprint Positioning Algorithm for positioning and Dijkstra Algorithm for calculating paths. Then the system can get the user's current locations and provide relevant paths according to the user's choice. Moreover, it can also provide the navigation path which takes the inter-floor information into consideration. It breaks the traditional navigation based on planar graph and has abundant business value.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.211-227
• /
• 2011

Content Based Image Retrieval (CBIR) is an approach for retrieving similar images from an image database based on automatically-derived image features. The quality of a retrieval system depends on the features used to describe image content. In this paper, we propose an image clustering system that takes a database of images as input and clusters them using k-means clustering algorithm taking into consideration color, texture and shape features. Experimental results show that the combination of the three features brings about higher values of accuracy and precision.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.6
• /
• pp.67-72
• /
• 2019

This paper proposes a computer vision-based banknote recognition system intended to assist the blind. This system is robust and fast in recognizing banknotes on videos recorded with a smartphone on real-life scenarios. To reduce the computation time and enable a robust recognition in cluttered environments, this study segments the banknote candidate area from the background utilizing a technique called Pixel-Based Adaptive Segmenter (PBAS). The Speeded-Up Robust Features (SURF) interest point detector is used, and SURF feature vectors are computed only when sufficient interest points are found. The proposed algorithm achieves a recognition accuracy of 98%, a 100% true recognition rate and a 0% false recognition rate. Although Korean banknotes are used as a working example, the proposed system can be applied to recognize other countries' banknotes.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.213-218
• /
• 2008

Through the development of computer and multimedia, many different kinds of theories about instructional method are presented. Especially, many lectures in associated with E-learning are done. In mathematics teaching, mathematica-algebra system lecturing, computer and Maple Matlab lecturing etc, are accomplished. There are many controversies among educators in problems originated by computer teaching. In this paper, we going to make a research about problems which are caused by mathematics computer-based education and present a desirable way of computer based education through studying comprehension rate and application ability among learner who uses omputer learning and other learner who uses exiting blackboard-based learning with statistical analysis after sampling test

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1390-1411
• /
• 2024

Underwater Wireless Sensors Networks (UWSNs) are deployed in remotely monitored environment such as water level monitoring, ocean current identification, oil detection, habitat monitoring and numerous military applications. Providing scalable and efficient routing is very challenging in UWSNs due to the harsh underwater environment. The biggest difficulties are the nodes inherent movement due to water current, long delay in data transmission, low bandwidth of the acoustic signal, high error rate and energy scarcity in battery powered nodes. Many routing protocols have been proposed to solve the aforementioned problems. There are three broad categories of routing protocols namely depth based, energy based and vector-based routing. Vector Based Forwarding protocols perform routing through virtual pipeline by defining their radius which give proper direction to packets communication. We proposed a routing protocol termed as Path-Oriented Energy Scaled Expanded Vector Based Forwarding (PESEVBF). PESEVBF takes into account all parameters; holding time, the source nodes packets routing path and void holes creation on the second hop; PESEVBF not only considers the packet upward advancement but also focus on density of the forwarded nodes in terms of number of potential forwarding and suppressed nodes for path selection. Node selection in resultant holding time is based on minimum Path Factor (PF) value. Moreover, the suppressed node will be selected for packet forwarding to avoid the void holes occurrences on the second hop. Performance of PESEVBF is compared with other routing protocols using matrices such as energy consumption, packet delivery ratio, packets dropping ratio and duplicate packets creation indicating considerable performance improvement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.3
• /
• pp.1263-1279
• /
• 2020

Activating appropriate roles for a session in the role-based access control (RBAC) model has become challenging because of the so-called role explosion. In this paper, factors and issues related to user-driven role management are analysed, and a session role activation (SRA) problem based on reasonable assumptions is proposed to describe the problem of such role management. To solve the SRA problem, we propose an extended RBAC model with context-based role filtering. When a session is created, context conditions are used to filter roles that do not need to be activated for the session. This significantly reduces the candidate roles that need to be reviewed by the user, and aids the user in rapidly activating the appropriate roles. Simulations are carried out, and the results show that the extended RBAC model is effective in filtering the roles that are unnecessary for a session by using predefined context conditions. The extended RBAC model is also implemented in the Apache Shiro framework, and the modifications to Shiro are described in detail.

• Journal of Information Technology Applications and Management
• /
• v.30 no.6
• /
• pp.143-155
• /
• 2023

Procedural generation methods based on physical-based materials generate data by algorithms rather than manual through combinations with artist-generated assets based on computer-generated randomness algorithms. For this reason, the procedural generation method is mainly used to produce textures of 3D models in the field of computer graphics because it is easy to obtain the desired quality with little data. This study is a study on physical-based materials and procedural generation methods based on them. Physical-based materials are divided into Metallic/Roughness workflows and Specific/Glossiness workflows. These two methods produce the same results, which are more accurate based on the law of conservation of energy. The procedural generation method allows a natural texture to be obtained very quickly by texturing through a combination of a computer-generated random algorithm and an artist-generated asset based on various maps.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3629-3647
• /
• 2017

Certificate-based cryptography is a useful public key cryptographic primitive that combines the merits of traditional public key cryptography and identity-based cryptography. It not only solves the key escrow problem inherent in identity-based cryptography, but also simplifies the cumbersome certificate management problem in traditional public key cryptography. So far, four short certificate-based signature schemes have been proposed. However, three of them fail in achieving the existential unforgeability under adaptive chosen-message attacks and the remaining one was not constructed in the normal framework of certificate-based signature. In this paper, we put forward a new short certificate-based signature scheme. The proposed scheme is devised in the normal framework of certificate-based signature and overcomes the security weaknesses in the previous short certificate-based signature schemes. In the random oracle model, we formally prove that it achieves the existential unforgeability against adaptive chosen-message attacks. Performance comparison shows that it is efficient and practical.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.4
• /
• pp.46-55
• /
• 1997

This paper presents the development of intelligent performance management of computer communication networks for larger-scale integrated systems and the demonstration of its efficacy using computer simula- tion. The innermost core of the performance management is based on fuzzy set theory. This fuzzy perfor- mance manager has learning ability by using principles of neuro-fuzzy model, neuralnetwork, genetic algo- rithm(GA). Two types of performance managers are described in this paper. One is the Neuro-Fuzzy Per- formance Manager(NFPM) of which learning ability is based on the conventional gradient method, and the other is GA-based Neuro-Fuzzy Performance Manager(GNFPM)with its learning ability based on a genetic algorithm. These performance managers have been evaluated via discrete event simulation of a computer network.