• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.474-478
• /
• 1999

Genetic algorithm is an efficient search method using principles of natural selection and population genetics. In conventional genetic algorithms, however, the size of gene pool should be increased to insure a convergency. Therefore, many memory spaces and much computation time were needed. Also, since child chromosomes were generated by chromosome crossover and gene mutation, the algorithms have a complex structure. Thus, in this paper, a compact stereo matching algorithm using a population-based incremental teaming based on probability vector is proposed to reduce these problems. The PBIL method is modified for matching environment. Since the Proposed algorithm uses a probability vector and eliminates gene pool, chromosome crossover, and gene mutation, the matching algorithm is simple and the computation load is considerably reduced. Even if the characteristics of images are changed, stable outputs are obtained without the modification of the matching algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.9-17
• /
• 1994

The incremental parsing techniques are essential part of language-based environment which allow incremental construction of programs, as reparsing of modified part of the program alone enhances the system performance. A number of methods and algorithms have been proposed for incremental parsing and for the construction of incremental parsers. The purpose of this paper is to review the earlier incremental parsing algorithms which are too expensive in both time and space, and to present an efficient incremental LR parsing algorithm which is more efficient than the previous ones. In this paper, we generate automatically an extended LR parsing tables which allow the nonterminal symbols as well as terminal symbols for the input, and apply them to our efficient incremental LR parsing algorithm. Using these extended LR parsing tables. we suggest several methods to reduce its memory spaces and parsing steps as well. The algorithms described here were implemented in C language and YACC on a SUN UNIX OS, and were tested with several grammars and strings.

• Proceeding of Spring/Autumn Annual Conference of KHA
• /
• 2008.04a
• /
• pp.193-196
• /
• 2008

This study was performed to phenomenologically look into residential behaviors from the standpoint of human housing environment experiences, rather than physical environment, aiming to examine the emotional implication of housing environment by finding human mental motives included in memorable adolescent experiences into housing environment. In this study, an analysis on an environment life story was used to describe both the behaviors and spaces of significantly memorable experiences into housing environment. In addition, this study was carried out by analysing the emotional implication of descriptions selected from respondents' answers. A questionnaire survey was performed by questioning the students of D university about their significantly memorable adolescent experience in housing environment from the 4th to 15th of June 2007. Statistic date was analysed using the SPSS 14.0 Program.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.62
• /
• pp.21-32
• /
• 2001

The two-dimensional guillotine cutting problem is to maximize sum of piece profits that cut from one stock rectangle and widely applied in the industry. The branch-and-bound method for this problem uses complementarily several upper bounds(the Gilmore and Gomoryp[8]'s two-dimensional knapsack function and the Hifi and Zissimopoulos[10]'s method using one-dimensional knapsack problem, etc) to reduce the number of searched nodes. These upper bounds has a shortcoming that does not consider the bound and layout of pieces simultaneously. In this paper, we propose an efficient upper bound which can complement the shortcoming of existing upper bounds. The proposed upper bound needs less memory spaces and computing time. Computational results show that the proposed upper bound significantly contribute to reduce the computational amount of time and number of searched nodes in tree.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.9
• /
• pp.1-8
• /
• 2019

In this paper, we propose a performance isolation of shared space for virtualized SSD based storage systems, to solve the weakness in a VSSD framework. The proposed scheme adopts a CFQ scheduler and a shared space-based FTL for the fairness and the performance isolation for multiple users on virtualized SSD based storage systems. Using the CFQ scheduler, we ensure SLOs for the storage systems such as a service time, a allocated space, and a IO latency for users on the virtualized storage systems. In addition, to improve a throughput and reduce a computational latency for garbage collection, a shared space-based FTL is adopted to maintain the information of SLOs for users and it manages shared spaces among the users. In our experiments, the proposal improved the throughput of garbage collection by 7.11%, on average, and reduced the computational latency for garbage collection by 9.63% on average, compared to the previous work.

• Journal of applied mathematics & informatics
• /
• v.41 no.3
• /
• pp.487-510
• /
• 2023

We propose a mathematical model which describes the frictional contact between a piezoelectric body and an electrically conductive foundation. The behavior of the material is described with a linearly electro-viscoelastic constitutive law with long term memory. The mechanical process is dynamic and the electrical conductivity coefficient depends on the total slip rate, the friction is modeled with Tresca's law which the friction bound depends on the total slip rate with taking into account the electrical conductivity of the foundation both. The main results of this paper concern the existence and uniqueness of the weak solution of the model; the proof is based on results for second order evolution variational inequalities with a time-dependent hemivariational inequality in Banach spaces.

• Journal of the Korea Society for Simulation
• /
• v.32 no.3
• /
• pp.43-53
• /
• 2023

In this detailed and comprehensive study, our primary focus has been placed on accurately gauging the number of visitors and their real-time locations in commercial spaces. Particularly, in a real cafe, using security cameras, we have developed a system that can offer live updates on available seating and predict future congestion levels. By employing YOLO, a real-time object detection and tracking algorithm, the number of visitors and their respective locations in real-time are also monitored. This information is then used to update a cafe's indoor map, thereby enabling users to easily identify available seating. Moreover, we developed a model that predicts the congestion of a cafe in real time. The sophisticated model, designed to learn visitor count and movement patterns over diverse time intervals, is based on Long Short Term Memory (LSTM) to address the vanishing gradient problem and Sequence-to-Sequence (Seq2Seq) for processing data with temporal relationships. This innovative system has the potential to significantly improve cafe management efficiency and customer satisfaction by delivering reliable predictions of cafe congestion to all users. Our groundbreaking research not only demonstrates the effectiveness and utility of indoor location tracking technology implemented through security cameras but also proposes potential applications in other commercial spaces.

• The Journal of the Korea Contents Association
• /
• v.20 no.5
• /
• pp.251-260
• /
• 2020

In , music becomes a passage of spaces in dreams and at the same time causes a problem of temporality between spaces with different time speeds. This paper aims to examine the temporality of the music through Bergson's concept of time. The music used in the film, 《Non, je ne regrette rien》, is divided into the original version, the slowed-down version, and the rearranged version with the slowed-down, and this study visually confirmed the characteristics and similarities through practical analysis. From the perspective of Bergson's perception and memory diagram, non-diegetic music of the actual(the rearranged version) in which diegetic music of the virtual(the slowed-down version) inherent, plays the role of film music and music signal simultaneously. Also, the original version and the slowed-down version are the relationship of durational identity with qualitative changes. We looked at the position in the inverted cone diagram and applied their relationship to the diagram. It is a great achievement of this study that we explored the temporality of music in the multi-layered structure of , based on Bergson's philosophy of coexisting with the present and the past.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.81-91
• /
• 2012

Recently, as location-determination of indoor users is available with the development of variety of localization techniques for indoor location-based service, diverse indoor location based services are proposed. Accordingly, it is necessary to develop individualized POI recommendation service for recommending most interested points of large-scale commercial spaces such as shopping malls and departments. For POI recommendation, it is necessary to study the method for exploring location which users are interested in location with considering user's mobility in large-scale commercial spaces. In this paper, we proposed POI recommendation system with the definition of users' as 'Stay point' in order to consider users' various interest locations. By using the proposed algorithm, we analysis users' Stay points, then mining the users' visiting pattern to finished the proposed. POI Recommendation System. The proposed system decreased data more dramatically than that of using user's entire mobility data and usage of memory.

• The Journal of the Korea Contents Association
• /
• v.12 no.6
• /
• pp.21-31
• /
• 2012

The virtual reality consists of a virtual space constructed similar to the reality and agents residing in it. Our virtual space refers to an orderly space that is governed by such physical properties as mass, gravity, friction, and associated rules on top of the usual visual rendering. To construct this virtual world we are to develop virtual agents behaving like humans and the environment surrounding them. In order to improve the existing reactive agents designed to act to their designers' dictation in predetermined space or memory into autonomous agents, we need diverse kinds of knowledge among others related to the spaces for the agents to act in. Our design and implementation focuses on the spatial knowledge among those diverse aspects of knowledge required. The developed knowledge representation scheme is used on a basis for realistic and efficient physical cyber-environment, and as the knowledge structure to simulate the virtual agents' knowledges on spaces.