• Title/Summary/Keyword: Information Searching

검색결과 2,888건 처리시간 0.036초

A Practical Approximate Sub-Sequence Search Method for DNA Sequence Databases (DNA 시퀀스 데이타베이스를 위한 실용적인 유사 서브 시퀀스 검색 기법)

  • Won, Jung-Im;Hong, Sang-Kyoon;Yoon, Jee-Hee;Park, Sang-Hyun;Kim, Sang-Wook
    • Journal of KIISE:Databases
    • /
    • 제34권2호
    • /
    • pp.119-132
    • /
    • 2007
  • In molecular biology, approximate subsequence search is one of the most important operations. In this paper, we propose an accurate and efficient method for approximate subsequence search in large DNA databases. The proposed method basically adopts a binary trie as its primary structure and stores all the window subsequences extracted from a DNA sequence. For approximate subsequence search, it traverses the binary trie in a breadth-first fashion and retrieves all the matched subsequences from the traversed path within the trie by a dynamic programming technique. However, the proposed method stores only window subsequences of the pre-determined length, and thus suffers from large post-processing time in case of long query sequences. To overcome this problem, we divide a query sequence into shorter pieces, perform searching for those subsequences, and then merge their results. To verify the superiority of the proposed method, we conducted performance evaluation via a series of experiments. The results reveal that the proposed method, which requires smaller storage space, achieves 4 to 17 times improvement in performance over the suffix tree based method. Even when the length of a query sequence is large, our method is more than an order of magnitude faster than the suffix tree based method and the Smith-Waterman algorithm.

Short-term Traffic States Prediction Using k-Nearest Neighbor Algorithm: Focused on Urban Expressway in Seoul (k-NN 알고리즘을 활용한 단기 교통상황 예측: 서울시 도시고속도로 사례)

  • KIM, Hyungjoo;PARK, Shin Hyoung;JANG, Kitae
    • Journal of Korean Society of Transportation
    • /
    • 제34권2호
    • /
    • pp.158-167
    • /
    • 2016
  • This study evaluates potential sources of errors in k-NN(k-nearest neighbor) algorithm such as procedures, variables, and input data. Previous research has been thoroughly reviewed for understanding fundamentals of k-NN algorithm that has been widely used for short-term traffic states prediction. The framework of this algorithm commonly includes historical data smoothing, pattern database, similarity measure, k-value, and prediction horizon. The outcomes of this study suggests that: i) historical data smoothing is recommended to reduce random noise of measured traffic data; ii) the historical database should contain traffic state information on both normal and event conditions; and iii) trial and error method can improve the prediction accuracy by better searching for the optimum input time series and k-value. The study results also demonstrates that predicted error increases with the duration of prediction horizon and rapidly changing traffic states.

Comparative Analysis of Muscle Proteome from Porcine White and Red Muscles by Two-dimensional Electrophoresis (이차원전기영동법을 이용한 white muscle과 red muscle간의 단백질 발현양상의 비교분석)

  • Kim, N.K.;Joh, J.H.;Chu, K.S.;Park, H.R.;Park, B.Y.;Kim, O.H.;Lee, C.S.
    • Journal of Animal Science and Technology
    • /
    • 제45권5호
    • /
    • pp.731-738
    • /
    • 2003
  • The technique known as proteomics is useful for characterizing the protein expression pattern of a particular tissue or cell type as well as quantitatively identifying differences in the levels of individual proteins. In present study, we carried out the comparative expression patterns of white and red muscles. We used the two-dimensional electrophoresis(2-DE) for analyzing the protein expression. Proteins isolated from porcine white and red muscles were separated by 12% poly-acrylamide gel and then were detected by coomassie blue and silver staining. More than 600 protein spots were detected on each 2-DE gel. By visual analysis of the stained gel, five proteins were identified to be differentially expressed in the white vs red muscle. By database searching based on the molecular weights and pI(isoelectric point) of the five proteins, three of them were found to be most close to troponin I, T and myoglobin. However, further researche is needed for identification and functional analysis of the unidentified proteins. In conclusion, we found five proteins, which are differentially expressed in the white vs red muscle. The functional analysis of the differentially expressed proteins will provide valuable information on biochemical characteristics of the muscle type.

Analysis on Research Trends and Proposal for Standardization of Construction & Architectural Terms in Korea (국내 건설·건축용어 연구의 동향 분석 및 표준화 제안)

  • Park, Eunha;Jeon, Jinwoo
    • The Journal of the Korea Contents Association
    • /
    • 제15권5호
    • /
    • pp.620-629
    • /
    • 2015
  • As the construction industry becomes bigger and more complicated, standardization of terms should be established between academic and industrial fields in order to accumulate and share information technology. The aim of this study is to investigate and analyze the research trends and actual usage of construction and architectural terms in Korea. For this purpose, we examined research related to construction and architectural terms by searching RISS up to August 2014. We also analyzed document types and contents of research by year. As a result, 130 research studies related to construction and architectural terms were searched. Of document types, glossary ranks the highest, followed by academic journal papers, master's theses and research reports. Research related to construction and architectural terms began in 1939, and was actively studied between the mid-1980s to the mid-1990s. Within the research, list and opinion of related construction and architectural terms are found the most frequently, followed by standardization, analysis, alteration, dictionary and wordbook, and search system of terms. Despite these efforts and research, standardization of terms has not yet been consolidated between academic and industrial fields. Therefor, we suggest six proposals in order to standardize the terms. This study is an attempt to see the trends and conditions of construction and architectural terms and to provide base-line data and an insight for future research.

A Study on the Knowledge Acquisition from Local Companies and Job Seekers using Data Mining Techniques (데이터마이닝 기법을 이용한 지역 기업과 구직자로부터의 지식 도출에 관한 연구)

  • Kim, Jin-Sung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • 제22권2호
    • /
    • pp.141-147
    • /
    • 2012
  • The purpose of the study is the acquisitions of knowledge related in job searching from local companies and job seekers using data mining techniques. At the first step, for the study, we had selected the local companies their headquarters are located in Jeonbuk province. Then we had picked the graduating students out from the high schools, colleges, and universities in the same area as the job seekers. After the targeting of the sample, we had surveyed 560 local companies and 14 schools for the collecting of the preliminary data. As the result of the survey, we could collect 173 responses from the companies and 551 responses from the job seekers. At the second step using data mining, we had adapted the C5.0 algorithm to extract the inference rules. Then we had used the Visual Basic (VB) programming language to visualize the rules at the third step. At the fourth step, we transformed the inference rules into DB tables. At the final step, we had executed the rule inferences to support the development of the long-term human resources development (HRD) strategies. As the result of the study, we could suggest the helpful information to the HRD directors and job seekers in designing their strategies in managing their jobs and career development.

Analysis regarding Complaints of Courier Consumers and Workers in the Parcel Delivery Service by using Topic Model (토픽모델을 활용한 택배 서비스 소비자와 종사자의 불만 사항 분석)

  • Shin, Jin Gyu
    • Journal of Convergence for Information Technology
    • /
    • 제10권2호
    • /
    • pp.39-48
    • /
    • 2020
  • Many studies have been conducted to analyze factors that affect customer satisfaction, and service quality improvement in the parcel delivery industry. Most of these studies have a limited number of respondents using methods such as surveys and interviews. Therefore, this study aims to supplement the shortcomings of previous studies, by searching and analyzing the common major topics related to the complaints pointed out by consumers and suppliers in the parcel delivery service with cases of consumer counseling, and articles that reflect the complaints of workers in the industry. In addition, by analyzing the trend of these topics, we attempted to discover new topics and suggest implications. In conclusion, topics such as delay/lost/wrong deliveries as well as the fierce competition in the parcel delivery industry, turned out to be central aspects. As a result of the topic trend analysis, talks with international couriers have recently increased, and many conflicts related to apartment parcel delivery have been dealt with. The topics presented in this study are mainly focused on the contents of previous studies, but we expect that new and valuable topics can be derived by adding other data and analysis methods, such as internal counseling and academic literature.

A Multi-thresholding Approach Improved with Otsu's Method (Otsu의 방법을 개선한 멀티 스래쉬홀딩 방법)

  • Li Zhe-Xue;Kim Sang-Woon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • 제43권5호
    • /
    • pp.29-37
    • /
    • 2006
  • Thresholding is a fundamental approach to segmentation that utilizes a significant degree of pixel popularity or intensity. Otsu's thresholding employed the normalized histogram as a discrete probability density function. Also it utilized a criterion that minimizes the between-class variance of pixel intensity to choose a threshold value for segmentation. However, the Otsu's method has a disadvantage of repeatedly searching optimal thresholds for the entire range. In this paper, a simple but fast multi-level thresholding approach is proposed by means of extending the Otsu's method. Rather than invoke the Otsu's method for the entire gray range, we advocate that the gray-level range of an image be first divided into smaller sub-ranges, and that the multi-level thresholds be achieved by iteratively invoking this dividing process. Initially, in the proposed method, the gray range of the object image is divided into 2 classes with a threshold value. Here, the threshold value for segmentation is selected by invoking the Otsu's method for the entire range. Following this, the two classes are divided into 4 classes again by applying the Otsu's method to each of the divided sub-ranges. This process is repeatedly performed until the required number of thresholds is obtained. Our experimental results for three benchmark images and fifty faces show a possibility that the proposed method could be used efficiently for pattern matching and face recognition.

Design of Hybrid Parallel Architecture for Fast IP Lookups (고속 IP Lookup을 위한 병렬적인 하이브리드 구조의 설계)

  • 서대식;윤성철;오재석;강성호
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • 제40권5호
    • /
    • pp.345-353
    • /
    • 2003
  • When designing network processors or implementing network equipments such as routers are implemented, IP lookup operations cause the major impact on their performance. As the organization of the IP address becomes simpler, the speed of the IP lookup operations can go faster. However, since the efficient management of IP address is inevitable due to the increasing number of network users, the address organization should become more complex. Therefore, for both IPv4(IP version 4) and IPv6(IP version 6), it is the essential fact that IP lookup operations are difficult and tedious. Lots of researcher for improving the performance of IP lookups have been presented, but the good solution has not been came out. Software approach alleviates the memory usage, but at the same time it si slow in terms of searching speed when performing an IP lookup. Hardware approach, on the other hand, is fast, however, it has disadvantages of producing hardware overheads and high memory usage. In this paper, conventional researches on IP lookups are shown and their advantages and disadvantages are explained. In addition, by mixing two representative structures, a new hybrid parallel architecture for fast IP lookups is proposed. The performance evaluation result shows that the proposed architecture provides better performance and lesser memory usage.

Asynchronous Message Pushing Framework between Android Devices using Remote Intent (Remote Intent를 이용한 안드로이드 장치 간 비동기식 메시지 푸싱 프레임워크)

  • Baek, Jihun;Nam, Yongwoo;Park, Sangwon
    • KIPS Transactions on Software and Data Engineering
    • /
    • 제2권8호
    • /
    • pp.517-526
    • /
    • 2013
  • When developing an android mobile application the androids intent is used as a mechanism to send messages between local equipment of androids application inner part and other applications. But the androids intent does not support sending messages via each android products intent. If there is a way to support each androids equipments to send messages, it will be easier to make non-stopping services. Non-stopping service is used when the user is using the android to do word or searching services and suddenly changes to a different android product but still maintains the progress what was currently being done without waiting the programs to be loaded. It is possible to send messages to each android products by using the socket, but the connection must be maintained stably which is the weak point. In this paper, I am suggesting a BRIF(Broadcasting Remote Intent Framework) framework to send messages to different android products. BRIF is a framework that uses the Googles C2DM service which services asynchronous transmissions to different android products. This is organized with the C2DM server, RemoteContext Api, web server and RISP(Remote Intent Service Provider) which is will be easy to be used for the developers since there are no big changes for coding compared to the intent code.

Registration Technique of Partial 3D Point Clouds Acquired from a Multi-view Camera for Indoor Scene Reconstruction (실내환경 복원을 위한 다시점 카메라로 획득된 부분적 3차원 점군의 정합 기법)

  • Kim Sehwan;Woo Woontack
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • 제42권3호
    • /
    • pp.39-52
    • /
    • 2005
  • In this paper, a registration method is presented to register partial 3D point clouds, acquired from a multi-view camera, for 3D reconstruction of an indoor environment. In general, conventional registration methods require a high computational complexity and much time for registration. Moreover, these methods are not robust for 3D point cloud which has comparatively low precision. To overcome these drawbacks, a projection-based registration method is proposed. First, depth images are refined based on temporal property by excluding 3D points with a large variation, and spatial property by filling up holes referring neighboring 3D points. Second, 3D point clouds acquired from two views are projected onto the same image plane, and two-step integer mapping is applied to enable modified KLT (Kanade-Lucas-Tomasi) to find correspondences. Then, fine registration is carried out through minimizing distance errors based on adaptive search range. Finally, we calculate a final color referring colors of corresponding points and reconstruct an indoor environment by applying the above procedure to consecutive scenes. The proposed method not only reduces computational complexity by searching for correspondences on a 2D image plane, but also enables effective registration even for 3D points which have low precision. Furthermore, only a few color and depth images are needed to reconstruct an indoor environment.