• Title/Summary/Keyword: Search Query

Search Result 690, Processing Time 0.022 seconds

Development of Content-Based Trademark Retrieval System on the World Wide Web

  • Kim, Young-Sum;Kim, Yong-Sung;Kim, Whoi-Yul;Kim, Myung-Joon
    • ETRI Journal
    • /
    • v.21 no.1
    • /
    • pp.40-54
    • /
    • 1999
  • In this paper, we describe a new trademark retrieval system based upon the content or the shape of trademark. The system has an on-line graphical user interface for the World Wide Web (WWW) that allows user to provide a query in forms of a sketch or a visual image to search for similar trademarks from database. User interfaces for the WWW were implemented by utilizing HTML and Java applets. The query can occur in arbitrary size and orientation. A shape representation scheme invariant to scale and rotation was developed to measure the similarity between two trademarks using the magnitude of Zernike moments as a feature set. Performance evaluation has been carried out with a database of 3,000 trademarks. It takes only about 0.6 second for the retrieval on a 200 MHz Pentium PC. The average recall of the original one among top 30 candidates queried by noisy or deformed images was 100%.

  • PDF

Ontology Versions Management on the Semantic Web

  • Yun, Hong-Won
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.1
    • /
    • pp.26-31
    • /
    • 2004
  • In the last few years, The Semantic Web has increased the interest in ontologies. Ontology is an essential component of the semantic web. Ontologies continue to change and evolve. We consider the management of versions in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. In many cases, we want to be able to search in historical versions, query changes in versions, retrieve versions on the temporal dimension. In order to support an ontology query language that supports temporal operations, we consider temporal dimension includes transaction time and valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the storage policies that are storing all the versions, all the sequence of changed element, all the change sets, the aggregation of change sets periodically, and the aggregation of change sets using a criterion. We conduct a set of experiments to compare the performance of each storage policies. We present the experimental results for evaluating the performance of different storage policies from scheme 1 to scheme 5.

Design and Implementation of a Boundary Matching System Supporting Partial Denoising for Large Image Databases

  • Kim, Bum-Soo;Kim, Jin-Uk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.5
    • /
    • pp.35-40
    • /
    • 2019
  • In this paper, we design and implement a partial denoising boundary matching system using indexing techniques. Converting boundary images to time-series makes it feasible to perform a fast search using indexes even on a very large image database. Thus, using this converting method we develop a client-server system based on the previous partial denoising research in the GUI(graphical user interface) environment. The client first converts a query image given by a user to a time-series and sends denoising parameters and the tolerance with this time-series to the server. The server identifies similar images from the index by evaluating a range query, which is constructed using inputs given from the client and sends the resulting images to the client. Experimental results show that our system provides many intuitive and accurate matching results.

AN EFFICIENT DENSITY BASED ANT COLONY APPROACH ON WEB DOCUMENT CLUSTERING

  • M. REKA
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.6
    • /
    • pp.1327-1339
    • /
    • 2023
  • World Wide Web (WWW) use has been increasing recently due to users needing more information. Lately, there has been a growing trend in the document information available to end users through the internet. The web's document search process is essential to find relevant documents for user queries.As the number of general web pages increases, it becomes increasingly challenging for users to find records that are appropriate to their interests. However, using existing Document Information Retrieval (DIR) approaches is time-consuming for large document collections. To alleviate the problem, this novel presents Spatial Clustering Ranking Pattern (SCRP) based Density Ant Colony Information Retrieval (DACIR) for user queries based DIR. The proposed first stage is the Term Frequency Weight (TFW) technique to identify the query weightage-based frequency. Based on the weight score, they are grouped and ranked using the proposed Spatial Clustering Ranking Pattern (SCRP) technique. Finally, based on ranking, select the most relevant information retrieves the document using DACIR algorithm.The proposed method outperforms traditional information retrieval methods regarding the quality of returned objects while performing significantly better in run time.

Design of Distributed Cloud System for Managing large-scale Genomic Data

  • Seine Jang;Seok-Jae Moon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.16 no.2
    • /
    • pp.119-126
    • /
    • 2024
  • The volume of genomic data is constantly increasing in various modern industries and research fields. This growth presents new challenges and opportunities in terms of the quantity and diversity of genetic data. In this paper, we propose a distributed cloud system for integrating and managing large-scale gene databases. By introducing a distributed data storage and processing system based on the Hadoop Distributed File System (HDFS), various formats and sizes of genomic data can be efficiently integrated. Furthermore, by leveraging Spark on YARN, efficient management of distributed cloud computing tasks and optimal resource allocation are achieved. This establishes a foundation for the rapid processing and analysis of large-scale genomic data. Additionally, by utilizing BigQuery ML, machine learning models are developed to support genetic search and prediction, enabling researchers to more effectively utilize data. It is expected that this will contribute to driving innovative advancements in genetic research and applications.

Quality Dimensions Affecting the Effectiveness of a Semantic-Web Search Engine (검색 효과성에 영향을 미치는 시맨틱웹 검색시스템 품질요인에 관한 연구)

  • Han, Dong-Il;Hong, Il-Yoo
    • Asia pacific journal of information systems
    • /
    • v.19 no.1
    • /
    • pp.1-31
    • /
    • 2009
  • This paper empirically examines factors that potentially influence the success of a Web-based semantic search engine. A research model has been proposed that shows the impact of quality-related factors upon the effectiveness of a semantic search engine, based on DeLone and McLean's(2003) information systems success model. An empirical study has been conducted to test hypotheses formulated around the research model, and statistical methods were applied to analyze gathered data and draw conclusions. Implications for academics and practitioners are offered based on the findings of the study. The proposed model includes three quality dimensions of a Web-based semantic search engine-namely, information quality, system quality and service quality. These three dimensions each have measures designed to collectively assess the respective dimension. The model is intended to examine the relationship between measures of these quality dimensions and measures of two dependent constructs, including individuals' net benefit and user satisfaction. Individuals' net benefit was measured by the extent to which the user's information needs were adequately met, whereas user satisfaction was measured by a combination of the perceived satisfaction with search results and the perceived satisfaction with the overall system. A total of 23 hypotheses have been formulated around the model, and a questionnaire survey has been conducted using a functional semantic search website created by KT and Hakia, so as to collect data to validate the model. Copies of a questionnaire form were handed out in person to 160 research associates and employees working in the area of designing and developing semantic search engines. Those who received the form, 148 respondents returned valid responses. The survey form asked respondents to use the given website to answer questions concerning the system. The results of the empirical study have indicated that, of the three quality dimensions, information quality was found to have the strongest association with the effectiveness of a Web-based semantic search engine. This finding is consistent with the observation in the literature that the aspects of the information quality should serve as a basis for evaluating the search outcomes from a semantic search engine. Measures under the information quality dimension that have a positive effect on informational gratification and user satisfaction were found to be recall and currency. Under the system quality dimension, response time and interactivity, were positively related to informational gratification. On the other hand, only one measure under the service quality dimension, reliability was found to have a positive relationship with user satisfaction. The results were based on the seven hypotheses that have been accepted. One may wonder why 15 out of the 23 hypotheses have been rejected and question the theoretical soundness of the model. However, the correlations between independent variables and dependent variables came out to be fairly high. This suggests that the structural equation model yielded results inconsistent with those of coefficient analysis, because the structural equation model intends to examine the relationship among independent variables as well as the relationship between independent variables and dependent variables. The findings offer some useful implications for owners of a semantic search engine, as far as the design and maintenance of the website is concerned. First, the system should be designed to respond to the user's query as fast as possible. Also it should be designed to support the search process by recommending, revising, and choosing a search query, so as to maximize users' interactions with the system. Second, the system should present search results with maximum recall and currency to effectively meet the users' expectations. Third, it should be capable of providing online services in a reliable and trustworthy manner. Finally, effective increase in user satisfaction requires the improvement of quality factors associated with a semantic search engine, which would in turn help increase the informational gratification for users. The proposed model can serve as a useful framework for measuring the success of a Web-based semantic search engine. Applying the search engine success framework to the measurement of search engine effectiveness has the potential to provide an outline of what areas of a semantic search engine needs improvement, in order to better meet information needs of users. Further research will be needed to make this idea a reality.

A Moving Object Query Process System for Mobile Recommendation Service (모바일 추천 서비스를 위한 이동 객체 질의 처리 시스템)

  • Park, Jeong-Seok;Shin, Moon-Sun;Ryu, Keun-Ho;Jung, Young-Jin
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.707-718
    • /
    • 2007
  • Recently, much studies for providing mobile users with suitable and useful content services, LBS(Location Based Service) corresponding to the change of users' location, are actively going on. First and foremost, this is basically owing to the progress of location management technologies such as GPS, mobile communication technology and the spread of personal devices like PDA and the cellular phones. Besides, the research scope of LBS has been changed from vehicle tracking and navigation services to intelligent and personalized services considering the changing information of conditions or environment where the users' are located. For example, it inputs the information such as heavy traffic, pollution, and accidents. The query languages which effectively search the stored vehicle and environment information have been studied depending on the increase of the information utilization. However, most of existing moving object query languages are not enough to provide a recommendation service for a user, because they can not be tested and evaluated in real world and did not consider changed environment information. In order to retrieve not only a vehicle location and environment condition but also use them, we suggest a moving object query language for recommendation service and implement a moving object query process system for supporting a query language. It can process a nearest neighbor query for recommendation service which considers various attributes such as a vehicle's location and direction, environment information. It can be applied to location based service application which utilizes the recommended factors based on environmental conditions.

Range Stabbing Technique for Continuous Queries on RFID Streaming Data) (RFID 스트리밍 데이타의 연속질의를 위한 영역 스태빙 기법)

  • Park, Jae-Kwan;Hong, Bong-Hee;Lee, Ki-Han
    • Journal of KIISE:Databases
    • /
    • v.36 no.2
    • /
    • pp.112-122
    • /
    • 2009
  • The EPCglobal leading the development in RFID standards proposed Event Cycle Specification (ECSpec) and Event Cycle Reports (ECReports) for the standard about RFID middleware interface. ECSpec is a specification for filtering and collecting RFID tag data and is treated as a Continuous Query (CQ) processed during fixed time intervals repeatedly. ECReport is a specification for describing the results after ECSpec is processed. Thus, it is efficient to apply Query Indexing technique designed for the continuous query processing. This query index processes ECSpecs as data and tag events as queries for efficiency. In logistics environment, the similar or same products are transferred together. Also, when RFID tags attached to the products are acquired, the acquisition events occur massively for the short period. For these properties, it is inefficient to process the massive events one by one. In this paper, we propose a technique reducing similar search process by considering tag events which are collected by the report period in ECSpec, as a range query. For this group processing, we suggest a queuing method for collecting tag events efficiently and a structure for generating range queries in the queues. The experiments show that performance is enhanced by the proposed methods.

Search and Visualization Method on the Semantic Web Portal (시맨틱 웹 포털에서의 검색과 시각화 방법 연구)

  • Lee, Myung-Jin;Lee, Ki-Jun;Park, Sang-Un;Hong, June-Seok;Kim, Woo-Ju
    • Proceedings of the Korea Database Society Conference
    • /
    • 2008.05a
    • /
    • pp.389-403
    • /
    • 2008
  • As the information of web dramatically increase, the existing web reveals more and more limitations in information search because web pages are designed only for human consumption by mixing content with presentation. In order to improve this situation, the Semantic Web comes on the stage by W3C. Semantic web is based on ontology that defines relationships between resources and it is enough to bring a significant advancement in web search. But to do this, the Semantic Web must provide a novel search and visualization methods which can make users instantly and intuitively understand why and how the results are retrieved because ontology has formal explicit descriptions of meaning. In this paper, we propose a semantic association-based search methodology that consists of how to find relevant information for a given user's query in the ontology, that is, a semantic network of resources and properties and how to provide proper visualization and navigation methods on the results. From this work, users can search the semantically associated resources for their query and also navigate such associations between resources.

  • PDF

Does the general public have concerns with dental anesthetics?

  • Razon, Jonathan;Mascarenhas, Ana Karina
    • Journal of Dental Anesthesia and Pain Medicine
    • /
    • v.21 no.2
    • /
    • pp.113-118
    • /
    • 2021
  • Background: Consumers and patients in the last two decades have increasingly turned to various internet search engines including Google for information. Google Trends records searches done using the Google search engine. Google Trends is free and provides data on search terms and related queries. One recent study found a large public interest in "dental anesthesia". In this paper, we further explore this interest in "dental anesthesia" and assess if any patterns emerge. Methods: In this study, Google Trends and the search term "dental pain" was used to record the consumer's interest over a five-year period. Additionally, using the search term "Dental anesthesia," a top ten related query list was generated. Queries are grouped into two sections, a "top" category and a "rising" category. We then added additional search term such as: wisdom tooth anesthesia, wisdom tooth general anesthesia, dental anesthetics, local anesthetic, dental numbing, anesthesia dentist, and dental pain. From the related queries generated from each search term, repeated themes were grouped together and ranked according to the total sum of their relative search frequency (RSF) values. Results: Over the five-year time period, Google Trends data show that there was a 1.5% increase in the search term "dental pain". Results of the related queries for dental anesthesia show that there seems to be a large public interest in how long local anesthetics last (Total RSF = 231) - even more so than potential side effects or toxicities (Total RSF = 83). Conclusion: Based on these results it is recommended that clinicians clearly advice their patients on how long local anesthetics last to better manage patient expectations.