• Title/Summary/Keyword: real-time search words

Search Result 37, Processing Time 0.028 seconds

Large Vocabulary Continuous Speech Recognition Based on Language Model Network (언어 모델 네트워크에 기반한 대어휘 연속 음성 인식)

  • 안동훈;정민화
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.6
    • /
    • pp.543-551
    • /
    • 2002
  • In this paper, we present an efficient decoding method that performs in real time for 20k word continuous speech recognition task. Basic search method is a one-pass Viterbi decoder on the search space constructed from the novel language model network. With the consistent search space representation derived from various language models by the LM network, we incorporate basic pruning strategies, from which tokens alive constitute a dynamic search space. To facilitate post-processing, it produces a word graph and a N-best list subsequently. The decoder is tested on the database of 20k words and evaluated with respect to accuracy and RTF.

Keywords and Spatial Based Indexing for Searching the Things on Web

  • Faheem, Muhammad R.;Anees, Tayyaba;Hussain, Muzammil
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1489-1515
    • /
    • 2022
  • The number of interconnected real-world devices such as sensors, actuators, and physical devices has increased with the advancement of technology. Due to this advancement, users face difficulties searching for the location of these devices, and the central issue is the findability of Things. In the WoT environment, keyword-based and geospatial searching approaches are used to locate these devices anywhere and on the web interface. A few static methods of indexing and ranking are discussed in the literature, but they are not suitable for finding devices dynamically. The authors have proposed a mechanism for dynamic and efficient searching of the devices in this paper. Indexing and ranking approaches can improve dynamic searching in different ways. The present paper has focused on indexing for improving dynamic searching and has indexed the Things Description in Solr. This paper presents the Things Description according to the model of W3C JSON-LD along with the open-access APIs. Search efficiency can be analyzed with query response timings, and the accuracy of response timings is critical for search results. Therefore, in this paper, the authors have evaluated their approach by analyzing the search query response timings and the accuracy of their search results. This study utilized different indexing approaches such as key-words-based, spatial, and hybrid. Results indicate that response time and accuracy are better with the hybrid approach than with keyword-based and spatial indexing approaches.

A Low-Cost RFID Tag Search Protocol Preventing the Reuse of Mobile Reader's Tag-List (모바일 리더의 태그 리스트 재사용을 방지하는 저비용 RFID 태그 검색 프로토콜)

  • Yeo, Don-Gu;Lee, Sang-Rae;Choi, Hyun-Woo;Jang, Jae-Hoon;Youm, Heung-Youl
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.1
    • /
    • pp.143-151
    • /
    • 2011
  • When a real-time data transfer is not possible between a reader and a back-end server in the mobile environment, the reader should support a capability to search a certain tag without communicating with a back-end server. Some recent papers related to the mobile reader-based tag search protocol have addressed privacy concerns for the reader and the tags. However, to our best knowledge, there are no papers addressing the problem arising from reusing tag lists existed in the mobile reader. In other words, there arise a problem that a mobile reader which has lost an right to access to a specific tag is able to search that tag by reusing a tag list for searching a particular tag. If mobile reader having an unauthorized tag list, the mobile reader can reuse a particular tag list. Our protocol provides the enhanced secure tag lists preventing the reuse of the tag lists and an efficient tag search protocol based on dynamic identity in the mobile reader-based RFID environments.

Automatic Tagging and Tag Recommendation Techniques Using Tag Ontology (태그 온톨로지를 이용한 자동 태깅 및 태그 추천 기법)

  • Kim, Jae-Seung;Mun, Hyeon-Jeong;Woo, Tae-Yong
    • The Journal of Society for e-Business Studies
    • /
    • v.14 no.4
    • /
    • pp.167-179
    • /
    • 2009
  • This paper introduces techniques to recommend standardized tags using tag ontology. Tag recommendation consists of TWCIDF and TWCITC; the former technique automatically tags a large quantity of already existing document groups, and the latter recommends tagging for new documents. Tag groups are created through several processes, including preprocessing, standardization using tag ontology, automatic tagging and defining ranks for recommendation. In the preprocessing process, in order to search semantic compound nouns, words are combined to establish basic word groups. In the standardization process, typographical errors and similar words are processed. As a result of experiments conducted on the basis of techniques presented in this paper, it is proved that real-time automatic tagging and tag recommendation is possible while guaranteeing the accuracy of tag recommendation.

  • PDF

Customized Search System using Real-time Contexts of User (사용자의 실시간 상황정보를 이용한 사용자 맞춤 검색 시스템)

  • Kwon, Mi-Rim;Hong, Kwang-Jin;Jung, Kee-Chul
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.21 no.5
    • /
    • pp.19-30
    • /
    • 2016
  • In these days, people get information from internet easily. However, there are too many information. It makes interrupt and inefficient for searching data. Therefore, we need user customized web search system which provides appropriate information. In this paper, we propose a searching system that can collect semi-automatically conditions of users such as weather, location and time and provide essential information to users. Using these context data, the proposed system can understand what information users want in specific situations and can provide more useful information to users than existing systems. The proposed system based on 'Production/Sharing Service of Personal Korean Contents with Voluntary Sharing Economy System' and we add data parsing algorithm in each input, store and search part. In the experiments, we compare and analyze the results of existing system and the proposed system using some general key words.

An Implementation of the Mobile App for Dynamic Scheduling Services based on Context-awareness (상황 인식 기반의 동적 스케줄링 서비스를 위한 모바일 앱의 구현)

  • Seo, Jung-Hee;Park, Hung-Bog
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.8
    • /
    • pp.1171-1177
    • /
    • 2013
  • Since existing location-based services suggest a search result, not considering user's environment, intention, or preference, situational awareness is required to resolve this problem. In this paper, an Android-based situational-awareness dynamic scheduling will be suggested and a tourist information service application will be embodied and tested. In other words, a real-time tourist scheduling service that calculates an estimated travel time from user's location to destination and reminds a user before the expected departure time will be developed. In addition to tourist information, an added scheduler provides convenience and improves its functionality.

Protecting Multi Ranked Searchable Encryption in Cloud Computing from Honest-but-Curious Trapdoor Generating Center (트랩도어 센터로부터 보호받는 순위 검색 가능한 암호화 다중 지원 클라우드 컴퓨팅 보안 모델)

  • YeEun Kim;Heekuck Oh
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.6
    • /
    • pp.1077-1086
    • /
    • 2023
  • The searchable encryption model allows to selectively search for encrypted data stored on a remote server. In a real-world scenarios, the model must be able to support multiple search keywords, multiple data owners/users. In this paper, these models are referred to as Multi Ranked Searchable Encryption model. However, at the time this paper was written, the proposed models use fully-trusted trapdoor centers, some of which assume that the connection between the user and the trapdoor center is secure, which is unlikely that such assumptions will be kept in real life. In order to improve the practicality and security of these searchable encryption models, this paper proposes a new Multi Ranked Searchable Encryption model which uses random keywords to protect search words requested by the data downloader from an honest-but-curious trapdoor center with an external attacker without the assumptions. The attacker cannot distinguish whether two different search requests contain the same search keywords. In addition, experiments demonstrate that the proposed model achieves reasonable performance, even considering the overhead caused by adding this protection process.

A Study on the user attributes for acquisition of information by analyzing the durability of real-time issues (실시간 이슈의 지속성 분석을 통한 사용자 정보 습득에 대한 특성과 패턴에 대한 연구)

  • Oh, Junyep;Lee, Seungkyu;Lee, Jooyoup
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.4
    • /
    • pp.299-314
    • /
    • 2017
  • Technological advances in media have expanded users' consciousness. At the same time, users have changed from passive into active voice by interacting media. The emergence of mobile made different structures and contents compared to the past. Especially, Korean culture of mobile converted original media channels to contents in a category. Plus, the usage structure of internet of this time converges in massive portal sites. It is because that the structure has aspect of emitting through remediation in the sites. Also, Korean massive portal sites have provided specific service named 'real-time issues'. This is not only the unique way of offering information that exists in Korea but also high usability of getting issues. We therefore considered the meaning of durability of real-time issues in the view of journalism, compared original media channels. Then, this paper identified the user attributes for acquisition of information following ways using informal and formal data from Korean massive portal sites named 'Daum' and 'Naver'.

A New True Ortho-photo Generation Algorithm for High Resolution Satellite Imagery

  • Bang, Ki-In;Kim, Chang-Jae
    • Korean Journal of Remote Sensing
    • /
    • v.26 no.3
    • /
    • pp.347-359
    • /
    • 2010
  • Ortho-photos provide valuable spatial and spectral information for various Geographic Information System (GIS) and mapping applications. The absence of relief displacement and the uniform scale in ortho-photos enable interested users to measure distances, compute areas, derive geographic locations, and quantify changes. Differential rectification has traditionally been used for ortho-photo generation. However, differential rectification produces serious problems (in the form of ghost images) when dealing with large scale imagery over urban areas. To avoid these artifacts, true ortho-photo generation techniques have been devised to remove ghost images through visibility analysis and occlusion detection. So far, the Z-buffer method has been one of the most popular methods for true ortho-photo generation. However, it is quite sensitive to the relationship between the cell size of the Digital Surface Model (DSM) and the Ground Sampling Distance (GSD) of the imaging sensor. Another critical issue of true ortho-photo generation using high resolution satellite imagery is the scan line search. In other words, the perspective center corresponding to each ground point should be identified since we are dealing with a line camera. This paper introduces alternative methodology for true ortho-photo generation that circumvents the drawbacks of the Z-buffer technique and the existing scan line search methods. The experiments using real data are carried out while comparing the performance of the proposed and the existing methods through qualitative and quantitative evaluations and computational efficiency. The experimental analysis proved that the proposed method provided the best success ratio of the occlusion detection and had reasonable processing time compared to all other true ortho-photo generation methods tested in this paper.

Monitoring Seasonal Influenza Epidemics in Korea through Query Search (인터넷 검색어를 활용한 계절적 유행성 독감 발생 감지)

  • Kwon, Chi-Myung;Hwang, Sung-Won;Jung, Jae-Un
    • Journal of the Korea Society for Simulation
    • /
    • v.23 no.4
    • /
    • pp.31-39
    • /
    • 2014
  • Seasonal influenza epidemics cause 3 to 5 millions severe illness and 250,000 to 500,000 deaths worldwide each year. To prepare better controls on severe influenza epidemics, many studies have been proposed to achieve near real-time surveillance of the spread of influenza. Korea CDC publishes clinical data of influenza epidemics on a weekly basis typically with a 1-2-week reporting lag. To provide faster detection of epidemics, recently approaches using unofficial data such as news reports, social media, and search queries are suggested. Collection of such data is cheap in cost and is realized in near real-time. This research aims to develop regression models for early detecting the outbreak of the seasonal influenza epidemics in Korea with keyword query information provided from the Naver (Korean representative portal site) trend services for PC and mobile device. We selected 20 key words likely to have strong correlations with influenza-like illness (ILI) based on literature review and proposed a logistic regression model and a multiple regression model to predict the outbreak of ILI. With respect of model fitness, the multiple regression model shows better results than logistic regression model. Also we find that a mobile-based regression model is better than PC-based regression model in estimating ILI percentages.