Wyszukiwarka
Filtry
wszystkich: 2049
-
Katalog
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: EXHAUSTIVE SEARCH ALGORITHM
-
Interactive Query Expansion with the Use of Clustering by Directions Algorithm
PublikacjaThis paper concerns Clustering by Directions algorithm. The algorithm introduces a novel approach to interactive query expansion. It is designed to support users of search engines in forming web search queries. When a user executes a query, the algorithm shows potential directions in which the search can be continued. This paper describes the algorithm and it presents an enhancement which reduces the computational complexity of...
-
Interactive Information Retrieval Algorithm for Wikipedia Articels
PublikacjaThe article presents an algorithm for retrieving textual information in documents collection. The algorithm employs a category system that organizers the repository and using interaction with user improves search precision. The algorithm was implemented for simple English Wikipedia and the first evaluation results indicates the proposed method can help to retrieve information from large document repositories.
-
Quality Evaluation of Novel DTD Algorithm Based on Audio Watermarking
PublikacjaEcho cancellers typically employ a doubletalk detection (DTD) algorithm in order to keep the adaptive filter from diverging in the presence of near-end speech signal or other disruptive sounds in the microphone signal. A novel doubletalk detection algorithm based on techniques similar to those used for audio signal watermarking was introduced by the authors. The application of the described DTD algorithm within acoustic echo cancellation...
-
Spectral Clustering Wikipedia Keyword-Based search Results
PublikacjaThe paper summarizes our research in the area of unsupervised categorization of Wikipedia articles. As a practical result of our research, we present an application of spectral clustering algorithm used for grouping Wikipedia search results. The main contribution of the paper is a representation method for Wikipedia articles that has been based on combination of words and links and used for categoriation of search results in this...
-
Brief Announcement: Energy Constrained Depth First Search
PublikacjaDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...
-
Adversarial attack algorithm for traffic sign recognition
PublikacjaDeep learning suffers from the threat of adversarial attacks, and its defense methods have become a research hotspot. In all applications of deep learning, intelligent driving is an important and promising one, facing serious threat of adversarial attack in the meanwhile. To address the adversarial attack, this paper takes the traffic sign recognition as a typical object, for it is the core function of intelligent driving. Considering...
-
Neural Architecture Search for Skin Lesion Classification
PublikacjaDeep neural networks have achieved great success in many domains. However, successful deployment of such systems is determined by proper manual selection of the neural architecture. This is a tedious and time-consuming process that requires expert knowledge. Different tasks need very different architectures to obtain satisfactory results. The group of methods called the neural architecture search (NAS) helps to find effective architecture...
-
Features of a radial user interface to search engines
PublikacjaThe paper is concerned with a new type of user interface to search engines. Instead of presenting search results in a form of a ranked list, the results are presented in radial arrangement. In the center of the interface the most relevant web page is presented. Other web pages are located around the central one. The location of a web page depends on two factors: its relevance to the query and its content. The relevance has influence...
-
Decision making process using deep learning
PublikacjaEndüstri 4.0, dördüncü endüstri devrimi veya Endüstriyel Nesnelerin İnterneti (IIoT) olarak adlandırılan sanayi akımı, işletmelere, daha verimli, daha büyük bir esneklikle, daha güvenli ve daha çevre dostu bir şekilde üretim yapma imkanı sunmaktadır. Nesnelerin İnterneti ile bağlantılı yeni teknoloji ve hizmetler birçok endüstriyel uygulamada devrim niteliği taşımaktadır. Fabrikalardaki otomasyon, tahminleyici bakım (PdM – Predictive...
-
Interactive Information Search in Text Data Collections
PublikacjaThis article presents a new idea for retrieving in text repositories, as well as it describes general infrastructure of a system created to implement and test those ideas. The implemented system differs from today’s standard search engine by introducing process of interactive search with users and data clustering. We present the basic algorithms behind our system and measures we used for results evaluation. The achieved results...
-
Information Retrieval with the Use of Music Clustering by Directions Algorithm
PublikacjaThis paper introduces the Music Clustering by Directions (MCBD) algorithm. The algorithm is designed to support users of query by humming systems in formulating queries. This kind of systems makes it possible to retrieve songs and tunes on the basis of a melody recorded by the user. The Music Clustering by Directions algorithm is a kind of an interactive query expansion method. On the basis of query, the algorithm provides suggestions...
-
Arterial cannula shape optimization by means of the rotational firefly algorithm
PublikacjaThe article presents global optimization results of arterial cannula shapes by means of the newly modified firefly algorithm. The search for the optimal arterial cannula shape is necessary in order to minimize losses and prepare the flow that leaves the circulatory support system of a ventricle (i.e. blood pump) before it reaches the heart. A modification of the standard firefly algorithm, the so-called rotational firefly algorithm,...
-
Analytical methods for exhaustive characterization of Brassica plants and dietary products based on them
PublikacjaGlucosinolates (GLs), and particularly two classes of their degradation products - isothiocyanates (ITC) and indoles - released upon myrosinase catalyzed hydrolysis, belong to the most promising chemopreventive dietary components. Despite their wide use in plant research, studies on chemopreventive mechanisms and industrial utilization in the production of e.g. dietary supplements, the methods of reliable characterization of myrosinase-GLs...
-
Using River Formation Dynamics Algorithm in Mobile Robot Navigation
PublikacjaRiver Formation Dynamics is a heuristic optimization algorithm based on the manner, in which drops of water form the river bed. The idea is to imitate the movement of drops on the edges between given nodes thus performing a search based on their height, which is modified through the mechanism of soil erosion and sediment deposition. In this way decreasing gradients are constructed, and these are followed by subsequent drops to...
-
KEYSTONE WG2: Activities and Results Overview on Keyword Search
PublikacjaIn this chapter we summarize activities and results achieved by the Keyword Search Working Group (WG2) of the KEYSTONE Cost Action IC1302. We present the goals of the WG2, its main activities in course of the action and provide a summary of the selected publications related to the WG2 goals and co-authored by WG2 members. We concludewith a summary of open research directions in the area of keyword search for structured data.
-
Comparison of reproduction strategies in genetic algorithm approach to graph searching
Publikacjagenetic algorithms (ga) are a well-known tool used to obtain approximate solutions to optimization problems. successful application of genetic algorithm in solving given problem is largely dependant on selecting appropriate genetic operators. selection, mutation and crossover techniques play a fundamental role in both time needed to obtain results and their accuracy. in this paper we focus on applying genetic algorithms in calculating...
-
Web search results clusterization with background knowledge
PublikacjaClusterization of web pages is an attractive wayfor presenting web resources. Arranging pages into groups ofsimilar topics simplifies and shorten the search process. Thispaper concerns the problem of clustering web pages and presentsour approach to this issue. Our solution is focused on findingsimilarities between documents delivered by different web searchengines. This process was accomplished by applying WordNetdictionary.
-
Approximation Strategies for Generalized Binary Search in Weighted Trees
PublikacjaWe consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...
-
Relation-based Wikipedia Search System for Factoid Questions Answering
PublikacjaIn this paper we propose an alternative keyword search mechanism for Wikipedia, designed as a prototype solution towards factoid questions answering. The method considers relations between articles for finding the best matching article. Unlike the standard Wikipedia search engine and also Google engine, which search the articles content independently, requiring the entire query to be satisfied by a single article, the proposed...
-
Complex Root Finding Algorithm Based on Delaunay Triangulation
PublikacjaA simple and flexible algorithm for finding zeros of a complex function is presented. An arbitrary-shaped search region can be considered and a very wide class of functions can be analyzed, including those containing singular points or even branch cuts. The proposed technique is based on sampling the function at nodes of a regular or a self-adaptive mesh and on the analysis of the function sign changes. As a result, a set of candidate points...