• Asia pacific journal of information systems
• /
• v.15 no.3
• /
• pp.223-241
• /
• 2005

In spite of the rapid growth of mobile multimedia contents market, most of the customers experience inconvenience, lengthy search processes and frustration in searching for the specific multimedia contents they want. These difficulties are attributable to the current mobile Internet service method based on inefficient sequential search. To overcome these difficulties, this paper proposes a MOBIIe COntents Recommender System for Movie(MOBICORS-Movie), which is designed to reduce customers' search efforts in finding desired movies on the mobile Internet. MOBICORS-Movie consists of three agents: CF(Collaborative Filtering), CBIR(Content-Based Information Retrieval) and RF(Relevance Feedback). These agents collaborate each other to support a customer in finding a desired movie by generating personalized recommendations of movies. To verify the performance of MOBICORS-Movie, the simulation-based experiments were conducted. The results from this experiments show that MOBICORS-Movie significantly reduces the customer's search effort and can be a realistic solution for movie recommendation in the mobile Internet environment.

• Proceeding of KASS Symposium
• /
• 2008.05a
• /
• pp.101-106
• /
• 2008

This paper describes a comparative study of genetic algorithm and mathematical programming technique applied in the design optimization of geodesic dome. In particular, the genetic algorithm adopted in this study uses the so-called re-birthing technique together with the standard GA operations such as fitness, selection, crossover and mutation to accelerate the searching process. The finite difference method is used to calculate the design sensitivity required in mathematical programming techniques and three different techniques such as sequential linear programming (SLP), sequential quadratic programming(SQP) and modified feasible direction method(MFDM) are consistently used in the design optimization of geodesic dome. The optimum member sizes of geodesic dome against several external loads is evaluated by the codes $ISADO-GA{\alpha}$ and ISADO-OPT. From a numerical example, we found that both optimization techniques such as GA and mathematical programming technique are very effective to calculate the optimum member sizes of three dimensional discrete structures and it can provide a very useful information on the existing structural system and it also has a great potential to produce new structural system for large spatial structures.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.1
• /
• pp.9-16
• /
• 2020

Recently, the capacity of SSD has been increasing rapidly due to the improvement of flash memory density. To take full advantage of these SSDs, first of all, FTL's prompt adaptation is necessary. The FTL is a translation layer existing in SSDs to overcome the drawback of the SSD that cannot be modified in place, and has garbage collection and caching functions in addition to the map table management function. In this study, we focus on caching function, compare and analyze the cache implementation methodologies, and propose improved methods. Typical cache implementations divide the cache into groups, manage and retrieve the caches in the group as a linked list. Thus, searches are made in the order of the linked list. In contrast, we propose a method of sequential searching using the search area group of a cache registered in the map table regardless of the linked list and cache group. Experimental results show that the proposed method has a 2.5 times improvement over the conventional method.

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

HMMs (Hidden Markov Models) are widely used for biological signal, such as EEG (electroencephalogram) sequence, analysis because of their ability to incorporate sequential information in their structure. A recent trends of research are going after the biological interpretable HMMs, and we need to control the complexity of the HMM so that it has good generalization performance. So, an automatic means of optimizing the structure of HMMs would be highly desirable. In this paper, we described a procedure of classification of motor imagery EEG signals using HMM. The motor imagery related EEG signals recorded from subjects performing left, right hand and foots motor imagery. And the proposed a method that was focus on the validation of the HSA (Harmony Search Algorithm) based optimization for HMM. Harmony search algorithm is sufficiently adaptable to allow incorporation of other techniques. A HMM training strategy using HSA is proposed, and it is tested on finding optimized structure for the pattern recognition of EEG sequence. The proposed HSA-HMM can performs global searching without initial parameter setting, local optima, and solution divergence.

• Journal of the Korean Geotechnical Society
• /
• v.18 no.6
• /
• pp.117-127
• /
• 2002

A deterministic approach of slope stability, which is generally corresponding to the model of a simple non-linear function for slopes, is problematic in that it does not account the versatile characteristics of ground layers in an effective way. To resolve this problem, this study proposes a new way of analyzing slope stability, so-called “genetic algorithm method, ” so as to reflect some particular conditions pertaining to the grounds under concern. Similarities and differences in slope stability that may exist between homogeneous and multiple ground layers are examined in a competitive manner, Overall, though similarities deemed a little bit salient, the algorithm method turned out to be very applicable to estimating the validity of slope stability. Furthermore, an additional effort to consider long-standing sequential and dynamic changes in both the amount of rainfall and the underground water level is made in order to improve the results.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.168-178
• /
• 2005

The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.455-462
• /
• 2006

Recently, the filtering approach using vector approximation such as VA-file[1] or LPC-file[2] have been proposed to support similarity search in high dimensional data space. This approach filters out many irrelevant vectors by calculating the approximate distance from a query vector using the compact approximations of vectors in database. Accordingly, the total elapsed time for similarity search is reduced because the disk I/O time is eliminated by reading the compact approximations instead of original vectors. However, the search time of the VA-file or LPC-file is not much lessened compared to the brute-force search because it requires a lot of computations for calculating the approximate distance. This paper proposes a new bitmap index structure in order to minimize the calculating time. To improve the calculating speed, a specific value of an object is saved in a bit pattern that shows a spatial position of the feature vector on a data space, and the calculation for a distance between objects is performed by the XOR bit calculation that is much faster than the real vector calculation. According to the experiment, the method that this paper suggests has shortened the total searching time to the extent of about one fourth of the sequential searching time, and to the utmost two times of the existing methods by shortening the great deal of calculating time, although this method has a longer data reading time compared to the existing vector approximation based approach. Consequently, it can be confirmed that we can improve even more the searching performance by shortening the calculating time for filtering of the existing vector approximation methods when the database speed is fast enough.

• Journal of the Korea Convergence Society
• /
• v.8 no.8
• /
• pp.71-75
• /
• 2017

Due to the spread of SNS, web-based consumer-generated data is increasing exponentially. It is important in many fields to accurately extract what is appropriate for the user's interest in a large amount of data. It is especially important for business mangers to establish marketing policies to find the right customers for them in many users. In this paper, we try to obtain important information centering on customers who are interested in each account through Twitter follow - following relationship. Because Twitter's current follower relationships do not reflect the user's interests, we try to figure out the details of interest using keyword extraction methods for tweets of followers. To do this, we select two domestic commercial Twitter accounts and apply the sequential pattern evaluation index to the mining key phrase of the text data collected from the follower.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.8
• /
• pp.97-103
• /
• 2014

Signal processing technique of linear frequency modulation-frequency shift keying (LFM-FSK) waveform has been introduced for rear view radars of an automobile. LFM-FSK waveform consists of two sequential stepped frequency waveforms with some frequency offset, and thus, can be used to generate inverse synthetic aperture radar (ISAR) images of rear view target of an automobile. However, ISAR images can often be blurred due to inter-pulse phase errors. To resolve this problem, one-dimensional (1-D) entropies of high resolution range profiles (HRRP) are minimized with the help of particle swarm optimization (PSO). The searching space used in PSO is adaptively adjusted by the use of information on the target's velocity obtained from LFM-FSK waveforms. Simulation results show that the proposed method can generate well-focused ISAR images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.217-222
• /
• 2014

In this paper, I propose an efficient data search system using data partitioning algorithm in Microsoft Excel. I propose searching algorithm to retrieve data quickly using VBA functioning in the Excel. This algorithm is to specify the sheet you are looking for. Once the sheet is specified, the algorithm searches the beginning and the end of the data in the sheet. The algorithm compares intermediate values and key words, from the starting position of the cell. In this way, it will search data to the end. This proposed algorithm was implemented and tested in the Excel system using VBA program. The experimental results showed that the performance was better than that of the conventional sequential search method.