• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.5
• /
• pp.561-570
• /
• 1989

In this paper, we describe the theoretical analysis and optical implementation of real-time associative memory based on the modified Hopfield neural network model by using a commerical LCTV connected to computer graphic as the real-time memory mask and adding one mask line to the momory mask in order to optically obtain the time-varing thresholding values of the modified Hopfield model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3C
• /
• pp.245-249
• /
• 2006

In general, a large number of the memory accesses are required to decode the CAVLC in H.264/AVC. This is a serious problem for applications such as a DMB and videophone services because of the considerable amount of power that is consumed in accessing the memory. In order to overcome this problem, we propose an efficient run_before decoding method, In the proposed method, the memory access is removed by using a FSM with arithmetic operations. The simulation results show that the proposed algorithm does not degrade video quality is not degraded as well as the power is saved.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.72-75
• /
• 2000

This paper presents a simulation study on the description of the motion and the control of an active catheter actuator with multi-link structure actuated by Shape Memory Alloy(SMA). The model of an active catheter adopted in this paper has 3 links, and the individual links are composed of 3 micro coils of SMA for the omni-directional motion. In order to analyze the motions of multi-link structure, 3-dimensional kinematics description is presented. Also, the motion control of the end point of an active catheter using simple Neural Network is shown based on GUI(Graphic User Interface) system.

• 한국전산유체공학회:학술대회논문집
• /
• 1998.11a
• /
• pp.42-47
• /
• 1998

The pressure-based methods are very popular in CFD because it requires less computer core memory compared to other coupled or density-based solvers. Currently structured-mesh methodology based on pressure-based algorithm is quite mature to apply to the practical problems. The unstructured mesh method needs much more computer memory than the structured-mesh method. However the pressure-based method utilizing the sequential approach does not require very large memory used for unstructured-mesh density-based solvers. The present study has developed the unstructured grid pressure-based method. Cell-centered finite volume method was selected due to robustness for imposing various boundary conditions and easy implementation of higher-order upwind scheme. The predictive capability of present method has validated against several benchmark problems.

• Smart Structures and Systems
• /
• v.4 no.2
• /
• pp.261-278
• /
• 2008

The results of the application of shape memory alloy (SMA) prestressing devices on an aqueduct are presented in this paper. The aqueduct was built in 1747 to provide water to the city of Larnaca and to its port. Because of its importance to the cultural heritage of Cyprus, the aqueduct has been selected as one of the case-study monuments in the project Wide-Range Non-Intrusive devices toward Conservation of Historical Monuments in the Mediterranean Area (WIND-CHIME). The Department of Antiquities of Cyprus, acting in a pioneering way, have given their permission to apply the devices in order to investigate their effectiveness in providing protection to the monument against probable catastrophic effects of earthquake excitation. The dynamic characteristics of the structure were determined in two separate occasions and computational models were developed that matched very closely the dynamic characteristics of the structure. In this paper the experimental setup and the measured changes in the dynamic characteristics of the monument after the application of the SMA devices are described.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.157-159
• /
• 2007

The conventional hard disk has been the dominant database storage system for over 25 years. Recently, hybrid systems which incorporate the advantages of flash memory into the conventional hard disks are considered to be the next dominant storage systems to support databases for desktops and server computers. Their features are satisfying the requirements like enhanced data I/O, energy consumption and reduced boot time, and they are sufficient to hybrid storage systems as major database storages. However, we need to improve traditional index node management schemes based on B-Tree due to the relatively slow characteristics of hard disk operations, as compared to flash memory. In order to achieve this goal, we propose a new index node management scheme called FNC-Tree. FNC-Tree-based index node management enhanced search and update performance by caching data objects in unused free area of flash leaf nodes to reduce slow hard disk I/Os in index access processes.

• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.78-86
• /
• 2014

Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order to reduce any unnecessary transition paths as well as to eliminate any unnecessary state transitions. Consequently, the problems of high memory access consumption and big storage space and long matching time during the regular expression matching process of XFA can be efficiently improved. The simulation results convey that our proposed scheme can lower approximately 40% memory access, save about 45% storage space consumption, and reduce about 12% matching time during the same regular expression matching process compared with XFA, but without degrading the matching quality.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1563-1570
• /
• 1999

In this paper, we proposed the FPA(Fixed Partition Averaging) algorithm in order to improve the storage requirement and classification time of Memory Based Reasoning method. The proposed method enables us to use the storage more efficiently by extracting representatives out of training patterns. After partitioning the pattern space into a fixed number of equally-sized hyperrectangles, it averages patterns in each hyperrectangle to extract a representative. Also we have used the mutual information between the features and classes as weights for features to improve the classification performance.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.5
• /
• pp.163-169
• /
• 2006

In order to use parallel computers in specific applications, algorithms need to be developed and mapped onto parallel computer architectures. Main memory access for shared memory system or global communication in message passing system deteriorate the computation speed. In this paper, it is found that the m-step generalization of the block Lanczos method enhances parallel properties by forming in simultaneous search direction vector blocks. QR factorization, which lowers the speed on parallel computers, is not necessary in the m-step block Lanczos method. The m-step method has the minimized synchronization points, which resulted in the minimized global communications and main memory access compared to the standard methods.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2004.12a
• /
• pp.69-74
• /
• 2004

Selectivity estimation for spatial query is very important process in finding the most efficient execution plan. Many works have been performed to estimate accurately selectivity. Although they deal with some problems such as false-count, multi-count, they require a large amount of memory to retain accurate selectivity, so they can not get good results in little memory environments such as mobile-based small database. In order to solve this problem, we propose a new technique called MW histogram which is able to compress summary data and get reasonable results. It also has a flexible structure to react dynamic update. The experimental results showed that the MW histogram has lower relative error than MinSkew histogram and gets a good selectivity in little memory.