• Journal of Korea Multimedia Society
• /
• v.25 no.5
• /
• pp.730-738
• /
• 2022

Based on visual Thinking theory, VR(virtual reality) game changes the traditional form of memory and maps the content into game elements to realize the immersive spatial memory mode. This paper analyzes the influencing factors of game design and system function construction. This paper proposes a hypothesis: with the help of visual thinking theory, VR game is helpful to improve learners' visual memory, and carries out research. The experiment sets different levels of game through empirical research and case analysis of memory flip game. For example, when judging two random cards. If the pictures are the same, it will be judged as the correct combination; if they are different, the two cards will be restored to the original state. The results are analyzed by descriptive statistical analysis and AMOS data analysis. The results show that game content using the concept of "Memory Palace", which can improve the accuracy of memory. We conclude that the use of spatial localization characteristics in flip games combining visual thinking can improve users' memory by helping users memorize and organize information in a Virtual environment, which means VR games have strong feasibility and effectiveness in improving memory.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.246-256
• /
• 2022

Recently, parents and teachers consider physical education as a minor subject for students in elementary and secondary schools. Physical education performance has become increasingly significant as parents and schools pay more attention to physical schooling. The sports mining with distribution analysis model considers different factors, including the games, comments, conversations, and connection made on numerous sports interests. Using different machine learning/deep learning approach, children's athletic and academic interests can be tracked over the course of their academic lives. There have been a number of studies that have focused on predicting the success of students in higher education. Sports interest prediction research at the secondary level is uncommon, but the secondary level is often used as a benchmark to describe students' educational development at higher levels. An Automated Student Interest Prediction on Sports Mining using DL Based Bi-directional Long Short-Term Memory model (BiLSTM) is presented in this article. Pre-processing of data, interest classification, and parameter tweaking are all the essential operations of the proposed model. Initially, data augmentation is used to expand the dataset's size. Secondly, a BiLSTM model is used to predict and classify user interests. Adagrad optimizer is employed for hyperparameter optimization. In order to test the model's performance, a dataset is used and the results are analysed using precision, recall, accuracy and F-measure. The proposed model achieved 95% accuracy on 400^th instances, where the existing techniques achieved 93.20% accuracy for the same. The proposed model achieved 95% of accuracy and precision for 60%-40% data, where the existing models achieved 93% for accuracy and precision.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.52-53
• /
• 2012

Belief propagation (BP) is a commonly used global energy minimization algorithm for solving stereo matching problem in 3D reconstruction. However, it requires large memory bandwidth and data size. In this paper, we propose a novel memory-efficient algorithm of BP in stereo matching on the Graphics Processing Units (GPU). The data size and transfer bandwidth are significantly reduced by storing only a part of the whole message. In order to maintain the accuracy of the matching result, the local messages are reconstructed using shared memory available in GPU. Experimental result shows that there is almost an order of reduction in the global memory consumption, and 21 to 46% saving in memory bandwidth when compared to the conventional algorithm. The implementation result on a recent GPU shows that we can obtain 22.8 times speedup in execution time compared to the execution on CPU.

• Journal of Sensor Science and Technology
• /
• v.28 no.4
• /
• pp.216-220
• /
• 2019

In this paper, we propose a finite memory filter (estimator) for discrete-time stochastic linear systems with delays in state and measurement. A novel filtering algorithm is designed based on finite memory strategies, to achieve high estimation accuracy and stability under parametric uncertainties. The new finite memory filter uses a set of recent observations with appropriately chosen initial horizon conditions. The key contribution is the derivation of Lyapunov-like equations for finite memory mean and covariance of system state with an arbitrary number of time delays. A numerical example demonstrates that the proposed algorithm is more robust and accurate than the Kalman filter against dynamic model uncertainties.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.5
• /
• pp.44-51
• /
• 1999

This paper presents a massively parallel computational model for the efficient integration of speech and natural language understanding. The phoneme model is based on continuous Hidden Markov Model with context dependent phonemes, and the language model is based on a knowledge base approach. To construct the knowledge base, we adopt a hierarchically-structured semantic network and a memory-based parsing technique that employs parallel marker-passing as an inference mechanism. Our parallel speech recognition algorithm is implemented in a multi-Transputer system using distributed-memory MIMD multiprocessors. Experimental results show that the parallel speech recognition system performs better in recognition accuracy than a word network-based speech recognition system. The recognition accuracy is further improved by applying code-phoneme statistics. Besides, speedup experiments demonstrate the possibility of constructing a realtime parallel speech recognition system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.26 no.1
• /
• pp.1-10
• /
• 2021

This study proposed a Long-Short Term Memory network to consider changes in emotion over time, and applied an attention mechanism to give weights to the emotion states that appear at specific moments. We used 32 channel EEG data from DEAP database. A 2-level classification (Low and High) experiment and a 3-level classification experiment (Low, Middle, and High) were performed on Valence and Arousal emotion model. As a result, accuracy of the 2-level classification experiment was 90.1% for Valence and 88.1% for Arousal. The accuracy of 3-level classification was 83.5% for Valence and 82.5% for Arousal.

• Korean Journal of Cognitive Science
• /
• v.19 no.2
• /
• pp.125-142
• /
• 2008

This study investigated the effects of space- and object-based attention on spatial and visual working memory, by measuring recognition of working memory on the spatial Stroop task including two modalities of attention resource. The similarity condition of stimulus arrangement between working memory task and spatial stroop task was manipulated in order to examine the effects of space-based attention on spatial rehearsal during working memory task, while Stroop rendition was manipulated in order to examine the effects of object-based attention on object rehearsal during working memory task. The results showed that in a condition that stimulus arrangement was highly similar for the spatial working memory task and the spatial Stroop task, recognition accuracy of the spatial working memory was high, but it was not significantly different with the Stroop conditions. In contrast, the recognition accuracy of visual working memory in the incongruent Stroop condition was lower than that in the congruent Stroop condition, but it was not significantly different with the similarity conditions (25% vs. 75%). The results indicated that selective attention has effects on working memory only when resource modality of working memory is the same as that of selective attention.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.1-8
• /
• 2015

Flash memory has advantages in that it is fast access speed, low-power, and low-price. Therefore, they are widely used in electronics industry sectors. However, the flash memory has weak points, which are the limited number of erase operations and non-in-place update problem. To overcome the limited number of erase operations, many wear leveling techniques are studied. They use many tables storing information such as erase count of blocks, hot and cold block indicators, reference count of pages, and so on. These tables occupy some space of main memory for the wear leveling techniques. Accordingly, they are not appropriate for low-power devices limited main memory. In order to resolve it, a wear leveling technique using bit array and Bit Set Threshold (BST) for flash memory. The proposing technique reduces the used space of main memory using a bit array table, which saves the history of block erase operations. To enhance accuracy of cold block information, we use BST, which is calculated by using the number of invalid pages of the blocks in a one-to-many mode, where one bit is related to many blocks. The performance results illustrate that the proposed wear leveling technique improve life time of flash memory to about 6%, compared with previous wear leveling techniques using a bit array table in our experiment.

• Journal of KIISE:Software and Applications
• /
• v.37 no.8
• /
• pp.653-658
• /
• 2010

In this paper, we propose a word spacing system which can be performed with just a small memory. We focus on significant memory reduction while maintaining the performance of the system as much as the latest studies. Our proposed method is based on the theory of Hidden Markov Model. We use only probability information not adding any rule information. Two types of features are employed: 1) the first features are the spacing patterns dependent on each individual syllable and 2) the second features are the values of transition probability between the two syllable-patterns. In our experiment using only the first type of features, we achieved a high accuracy of more than 91% while reducing the memory by 53% compared with other systems developed for mobile application. When we used both types of features, we achieved an outstanding accuracy of more than 94% while reducing the memory by 76% compared with other system which employs bigram syllables as its features.

• Economic and Environmental Geology
• /
• v.29 no.2
• /
• pp.183-192
• /
• 1996

Much computing time and large computer memory are needed to solve the wave equation in a large complex subsurface layer using finite difference method. The time and memory can be reduced by decreasing the number of grid per minimun wave length. However, decrease of grid may cause numerical dispersion and poor accuracy. In this study, we present 49 points weighted average method which save the computing time and memory and improve the accuracy. This method applies a new weighted average to the coordinate determined by transforming the coordinate of conventional 5 points finite difference stars to $0^{\circ}$ and $45^{\circ}$, 25 points finite differenc stars to $0^{\circ}$, $26.56^{\circ}$, $45^{\circ}$, $63.44^{\circ}$ and 49 finite difference stars to $0^{\circ}$, $18.43^{\circ}$, $33.69^{\circ}$, $45^{\circ}$, $56.30^{\circ}$, $71.56^{\circ}$. By this method, the grid points per minimum wave length can be reduced to 2.5, the computing time to $(2.5/13)^3$, and the required core memory to $(2.5/13)^4$ computing with the conventional method.