• Title/Summary/Keyword: Index search algorithm

Search Result 148, Processing Time 0.026 seconds

An Index Data Structure for String Search in External Memory (외부 메모리에서 문자열을 효율적으로 탐색하기 위한 인덱스 자료 구조)

  • Na, Joong-Chae;Park, Kun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.598-607
    • /
    • 2005
  • We propose a new external-memory index data structure, the Suffix B-tree. The Suffix B-tree is a B-tree in which the key is a string like the String B-tree. While the node in the String B-tree is implemented with a Patricia trio, the node in the Suffix B-tree is implemented with an array. So the Suffix B-tree is simpler and easier to be Implemented than the String B-tree. Nevertheless, the branching algorithm of the Suffix B-tree is as efficient as that of the String B-tree. Consequently, the Suffix B-tree takes the same worst-case disk accesses as the String B-tree to solve the string matching problem, which is fundamental and important in the area of string algorithms.

A Design and Implementation of algorithm choosing Context-based Image used Multimedia Communication (멀티미디어 통신을 이용한 내용기반 이미지 추출 알고리즘 설계 및 구현)

  • 안병규
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.11
    • /
    • pp.1421-1426
    • /
    • 2001
  • Nowadays, as the quantity of multimedia information increases rapidly, an efficient management for multimedia has become more important. In this paper, to index and search multimedia contents efficiently, we designed the algorithm searching specific image and saving the extracted image using the semantic information extraction scheme based on contents and it is one of the schemes to indexing and searching of video data. After extracting the RGB information from input image, while all frames of video is inspected sequentially, the specific image is saved through referring to the position and distribution of contents from the collection scheme of RGB range. In case of using the proposed image extraction algorithm, because only saved video is searched instead of the whole the searching time can be reduced.

  • PDF

Design of an Efficient Parallel High-Dimensional Index Structure (효율적인 병렬 고차원 색인구조 설계)

  • Park, Chun-Seo;Song, Seok-Il;Sin, Jae-Ryong;Yu, Jae-Su
    • Journal of KIISE:Databases
    • /
    • v.29 no.1
    • /
    • pp.58-71
    • /
    • 2002
  • Generally, multi-dimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amount of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel high-dimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-n$\times$mD(disk) architecture which is the hybrid type of nP-nD and lP-nD. Its node structure increases fan-out and reduces the height of a index tree. Also, A range search algorithm that maximizes I/O parallelism is devised, and it is applied to K-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.

Content-Based Video Search Using Eigen Component Analysis and Intensity Component Flow (고유성분 분석과 휘도성분 흐름 특성을 이용한 내용기반 비디오 검색)

  • 전대홍;강대성
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.3
    • /
    • pp.47-53
    • /
    • 2002
  • In this paper, we proposed a content-based video search method using the eigen value of key frame and intensity component. We divided the video stream into shot units to extract key frame representing each shot, and get the intensity distribution of the shot from the database generated by using ECA(Eigen Component Analysis). The generated codebook, their index value for each key frame, and the intensity values were used for database. The query image is utilized to find video stream that has the most similar frame by using the euclidean distance measure among the codewords in the codebook. The experimental results showed that the proposed algorithm is superior to any other methols in the search outcome since it makes use of eigen value and intensity elements, and reduces the processing time etc.

  • PDF

Optimal Location of FACTS Devices Using Adaptive Particle Swarm Optimization Hybrid with Simulated Annealing

  • Ajami, Ali;Aghajani, Gh.;Pourmahmood, M.
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.2
    • /
    • pp.179-190
    • /
    • 2010
  • This paper describes a new stochastic heuristic algorithm in engineering problem optimization especially in power system applications. An improved particle swarm optimization (PSO) called adaptive particle swarm optimization (APSO), mixed with simulated annealing (SA), is introduced and referred to as APSO-SA. This algorithm uses a novel PSO algorithm (APSO) to increase the convergence rate and incorporate the ability of SA to avoid being trapped in a local optimum. The APSO-SA algorithm efficiency is verified using some benchmark functions. This paper presents the application of APSO-SA to find the optimal location, type and size of flexible AC transmission system devices. Two types of FACTS devices, the thyristor controlled series capacitor (TCSC) and the static VAR compensator (SVC), are considered. The main objectives of the presented method are increasing the voltage stability index and over load factor, decreasing the cost of investment and total real power losses in the power system. In this regard, two cases are considered: single-type devices (same type of FACTS devices) and multi-type devices (combination of TCSC, SVC). Using the proposed method, the locations, type and sizes of FACTS devices are obtained to reach the optimal objective function. The APSO-SA is used to solve the above non.linear programming optimization problem for better accuracy and fast convergence and its results are compared with results of conventional PSO. The presented method expands the search space, improves performance and accelerates to the speed convergence, in comparison with the conventional PSO algorithm. The optimization results are compared with the standard PSO method. This comparison confirms the efficiency and validity of the proposed method. The proposed approach is examined and tested on IEEE 14 bus systems by MATLAB software. Numerical results demonstrate that the APSO-SA is fast and has a much lower computational cost.

Construction of Theme Melody Index by Transforming Melody to Time-series Data for Content-based Music Information Retrieval (내용기반 음악정보 검색을 위한 선율의 시계열 데이터 변환을 이용한 주제선율색인 구성)

  • Ha, Jin-Seok;Ku, Kyong-I;Park, Jae-Hyun;Kim, Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.10D no.3
    • /
    • pp.547-558
    • /
    • 2003
  • From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.

A study of scene change detection in HEVC bit stream (HEVC 비트 스트림 상에서의 장면전환 검출 기법 연구)

  • Eom, Yumie;Yoo, Sung-Geun;Yoon, So-Jeong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2014.06a
    • /
    • pp.258-261
    • /
    • 2014
  • The era of realistic broadcast with high fidelity has come after the wide-spread distribution of UHD display and the transmission of UHD experimental broadcast in CATV. However, UHD broadcast now has constraint because it requires much amount of bandwidth and data in broadcasting transmission and production system. Not only HEVC(High Efficiency Video Codec) which has more than two times higher compression rate but also cloud-based editing system would be the key to solve the problems above. Also, fast scene change detection of videos is needed to index and search UHD videos smoothly. In this paper, therefore, a method is proposed to index and search the scene change information of large volume UHD videos compressed with high-efficiency codec. Application usages of fast detection of scene change information in various UHD video environments are considered by using this algorithm.

  • PDF

An Algorithm for generating Cloaking Region Using Grids for Privacy Protection in Location-Based Services (위치기반 서비스에서 개인 정보 보호를 위한 그리드를 이용한 Cloaking 영역 생성 알고리즘)

  • Um, Jung-Ho;Kim, Ji-Hee;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.151-161
    • /
    • 2009
  • In Location-Based Services (LBSs), users requesting a location-based query send their exact location to a database server and thus the location information of the users can be misused by adversaries. Therefore, a privacy protection method is required for using LBS in a safe way. In this paper, we propose a new cloaking region generation algorithm using grids for privacy protection in LBSs. The proposed algorithm creates a m inimum cloaking region by finding L buildings and then performs K-anonymity to search K users. For this, we make use of not only a grid-based index structure, but also an efficient pruning techniques. Finally, we show from a performance analysis that our cloaking region generation algorithm outperforms the existing algorithm in term of the size of cloaking region.

  • PDF

Development of Music Recommendation System based on Customer Sentiment Analysis (소비자 감성 분석 기반의 음악 추천 알고리즘 개발)

  • Lee, Seung Jun;Seo, Bong-Goon;Park, Do-Hyung
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.4
    • /
    • pp.197-217
    • /
    • 2018
  • Music is one of the most creative act that can express human sentiment with sound. Also, since music invoke people's sentiment to get empathized with it easily, it can either encourage or discourage people's sentiment with music what they are listening. Thus, sentiment is the primary factor when it comes to searching or recommending music to people. Regard to the music recommendation system, there are still lack of recommendation systems that are based on customer sentiment. An algorithm's that were used in previous music recommendation systems are mostly user based, for example, user's play history and playlists etc. Based on play history or playlists between multiple users, distance between music were calculated refer to basic information such as genre, singer, beat etc. It can filter out similar music to the users as a recommendation system. However those methodology have limitations like filter bubble. For example, if user listen to rock music only, it would be hard to get hip-hop or R&B music which have similar sentiment as a recommendation. In this study, we have focused on sentiment of music itself, and finally developed methodology of defining new index for music recommendation system. Concretely, we are proposing "SWEMS" index and using this index, we also extracted "Sentiment Pattern" for each music which was used for this research. Using this "SWEMS" index and "Sentiment Pattern", we expect that it can be used for a variety of purposes not only the music recommendation system but also as an algorithm which used for buildup predicting model etc. In this study, we had to develop the music recommendation system based on emotional adjectives which people generally feel when they listening to music. For that reason, it was necessary to collect a large amount of emotional adjectives as we can. Emotional adjectives were collected via previous study which is related to them. Also more emotional adjectives has collected via social metrics and qualitative interview. Finally, we could collect 134 individual adjectives. Through several steps, the collected adjectives were selected as the final 60 adjectives. Based on the final adjectives, music survey has taken as each item to evaluated the sentiment of a song. Surveys were taken by expert panels who like to listen to music. During the survey, all survey questions were based on emotional adjectives, no other information were collected. The music which evaluated from the previous step is divided into popular and unpopular songs, and the most relevant variables were derived from the popularity of music. The derived variables were reclassified through factor analysis and assigned a weight to the adjectives which belongs to the factor. We define the extracted factors as "SWEMS" index, which describes sentiment score of music in numeric value. In this study, we attempted to apply Case Based Reasoning method to implement an algorithm. Compare to other methodology, we used Case Based Reasoning because it shows similar problem solving method as what human do. Using "SWEMS" index of each music, an algorithm will be implemented based on the Euclidean distance to recommend a song similar to the emotion value which given by the factor for each music. Also, using "SWEMS" index, we can also draw "Sentiment Pattern" for each song. In this study, we found that the song which gives a similar emotion shows similar "Sentiment Pattern" each other. Through "Sentiment Pattern", we could also suggest a new group of music, which is different from the previous format of genre. This research would help people to quantify qualitative data. Also the algorithms can be used to quantify the content itself, which would help users to search the similar content more quickly.

Stacking Sequence Design of Fiber-Metal Laminate Composites for Maximum Strength (강도를 고려한 섬유-금속 적층 복합재료의 최적설계)

  • 남현욱;박지훈;황운봉;김광수;한경섭
    • Composites Research
    • /
    • v.12 no.4
    • /
    • pp.42-54
    • /
    • 1999
  • FMLC(Fiber-Metal Laminate Composites) is a new structural material combining thin metal laminate with adhesive fiber prepreg, it nearly include all the advantage of metallic materials, for example: good plasticity, impact resistance, processibility, light weight and excellent fatigue properties. This research studied the optimum design of the FMLC subject to various loading conditions using genetic algorithm. The finite element method based on the shear deformation theory was used for the analysis of FMLC. Tasi-Hill failure criterion and Miser yield criterion were taken as fitness functions of the fiber prepreg and the metal laminate, respectively. The design variables were fiber orientation angles. In genetic algorithm, the tournament selection and the uniform crossover method were used. The elitist model was also used to be effective evolution strategy and the creeping random search method was adopted in order to approach a solution with high accuracy. Optimization results were given for various loading conditions and compared with CFRP(Carbon Fiber Reinforced Plastic). The results show that the FMLC is more excellent than the CFRP in point and uniform loading conditions and it is more stable to unexpected loading because the deviation of failure index is smaller than that of CFRP.

  • PDF