Search
Filters
total: 2864
displaying 1000 best results Help
Search results for: direct search algorithm
-
Adaptive Algorithm for Interactive Question-based Search
PublicationPopular web search engines tend to improve the relevanceof their result pages, but the search is still keyword-oriented and far from "understanding" the queries' meaning. In the article we propose an interactive question-based search algorithm that might come up helpful for identifying users' intents. We describe the algorithm implemented in a form of a questions game. The stress is put mainly on the most critical aspect of this...
-
Context Search Algorithm for Lexical Knowledge Acquisition
PublicationA Context Search algorithm used for lexical knowledge acquisition is presented. Knowledge representation based on psycholinguistic theories of cognitive processes allows for implementation of a computational model of semantic memory in the form of semantic network. A knowledge acquisition using supervised dialog templates have been performed in a word game designed to guess the concept a human user is thinking about. The game,...
-
A Backtracking Search Algorithm for Distribution Network Reconfiguration Problem
Publication -
A Tabu Search Algorithm for Optimization of Survivable Overlay Computing Systems
PublicationParadygmat obliczeń rozproszonych ostatnio zyskuje coraz większą uwagę, ponieważ zarówno instytucje przemysłowe, jak i uczelnie wymagają coraz większej mocy obliczeniowej do przetwarzania i analizy danych. Z uwagi na dużą podatność systemów obliczeń na awarie różnych typów (podobnie do systemów sieciowych), gwarancje przeżywalności niniejszych systemów są nieodzowne w celu zapewnienia nieprzerwanego działania usług. Z tego powodu,...
-
A Biased-Randomized Iterated Local Search Algorithm for Rich Portfolio Optimization
Publication -
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublicationWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
Direct algorithm for optimizing robust MPC of drinking water distribution systems hydraulics
PublicationModel-based predictive control is an effective method for control the large scale systems [1]–[6], [8], [16], [17]. Method is based on on-line solution of the control task over the control horizon using current and past measurements, as well as the system model. Only a first element of calculated control sequence is applied to the plant. At the next sampling instant, based on new process output measurements, control procedure is...
-
Satellite Image Classification Using a Hierarchical Ensemble Learning and Correlation Coefficient-Based Gravitational Search Algorithm
PublicationSatellite image classification is widely used in various real-time applications, such as the military, geospatial surveys, surveillance and environmental monitoring. Therefore, the effective classification of satellite images is required to improve classification accuracy. In this paper, the combination of Hierarchical Framework and Ensemble Learning (HFEL) and optimal feature selection is proposed for the precise identification...
-
Use of Modified Cuckoo Search algorithm in the design process of integrated power systems for modern and energy self-sufficient farms
PublicationIn the face of increasingly stringent pollutant emission regulations, designing an agricultural holding becomes a difficult challenge of connecting a large number of coefficients that describe an energy system of a farm in regard to its ecological and economic efficiency. One way to cope with this issue is to design an energy self-sufficient farm that integrates various technologies, including renewable energy. However, the selection...
-
Reduced-cost constrained miniaturization of wideband antennas using improved trust-region gradient search with repair step
PublicationIn the letter, an improved algorithm for electromagnetic (EM)-driven size reduction of wideband antennas is proposed. Our methodology utilizes variable-fidelity EM simulation models, auxiliary polynomial regression surrogates, as well as multi-point response correction. The constraint handling is implicit, using penalty functions. The core optimization algorithm is a trust-region gradient search with a repair step added in order...
-
Improving SBR Performance Alongside with Cost Reduction through Optimizing Biological Processes and Dissolved Oxygen Concentration Trajectory
PublicationAuthors of this paper take under investigation the optimization of biological processes during the wastewater treatment in sequencing batch reactor (SBR) plant. A designed optimizing supervisory controller generates the dissolved oxygen (DO) trajectory for the lower level parts of the hierarchical control system. Proper adjustment of this element has an essential impact on the efficiency of the wastewater treatment process as well...
-
Interactive Query Expansion with the Use of Clustering by Directions Algorithm
PublicationThis 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...
-
0-step K-means for clustering Wikipedia search results
PublicationThis article describes an improvement for K-means algorithm and its application in the form of a system that clusters search results retrieved from Wikipedia. The proposed algorithm eliminates K-means isadvantages and allows one to create a cluster hierarchy. The main contributions of this paper include the ollowing: (1) The concept of an improved K-means algorithm and its application for hierarchical clustering....
-
Fast multi-objective design optimization of microwave and antenna structures using data-driven surrogates and domain segmentation
PublicationPurpose Strategies and algorithms for expedited design optimization of microwave and antenna structures in multi-objective setup are investigated. Design/methodology/approach Formulation of the multi-objective design problem oriented towards execution of the population-based metaheuristic algorithm within the segmented search space is investigated. Described algorithmic framework exploit variable fidelity modeling, physics- and...
-
Harmony Search for Data Mining with Big Data
PublicationIn this paper, some harmony search algorithms have been proposed for data mining with big data. Three areas of big data processing have been studied to apply new metaheuristics. The first problem is related to MapReduce architecture that can be supported by a team of harmony search agents in grid infrastructure. The second dilemma involves development of harmony search in preprocessing of data series before data mining. Moreover,...
-
Parallel tabu search for graph coloring problem
PublicationTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
Mixed integer nonlinear optimization of biological processes in wastewater sequencing batch reactor
PublicationWastewater treatment plays a key role for humanity. The waste entering lakes, rivers, and seas deteriorates daily quality of life. Therefore, it is very important to improve the efficiency of wastewater treatment. From a control point of view, a biological wastewater treatment plant is a complex, non-linear, multidimensional, hybrid control system. The paper presents the design of the optimizing hierarchical control system applied...
-
Deep neural network architecture search using network morphism
PublicationThe paper presents the results of the research on neural architecture search (NAS) algorithm. We utilized the hill climbing algorithm to search for well-performing structures of deep convolutional neural network. Moreover, we used the function preserving transformations which enabled the effective operation of the algorithm in a short period of time. The network obtained with the advantage of NAS was validated on skin lesion classification...
-
Globalized Parametric Optimization of Microwave Passive Components Using Simplex-Based Surrogates
PublicationOptimization-based parameter adjustment involving full-wave electromagnetic (EM) simulation models is a crucial stage of present-day microwave design process. In fact, rigorous optimization is the only reliable mean permitting to simultaneously handle multiple geometry/material parameters, objectives, and constraints. Unfortunately, EM-driven design is a computationally intensive endeavor. While local tuning is usually manageable,...
-
Interactive Information Retrieval Algorithm for Wikipedia Articels
PublicationThe 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.
-
Fast Approximate String Search for Wikification
PublicationThe paper presents a novel method for fast approximate string search based on neural distance metrics embeddings. Our research is focused primarily on applying the proposed method for entity retrieval in the Wikification process, which is similar to edit distance-based similarity search on the typical dictionary. The proposed method has been compared with symmetric delete spelling correction algorithm and proven to be more efficient...
-
Reduced-cost electromagnetic-driven optimisation of antenna structures by means of trust-region gradient-search with sparse Jacobian updates
PublicationNumerical optimisation plays more and more important role in the antenna design. Because of lack of design-ready theoretical models, electromagnetic (EM)-simulation-driven adjustment of geometry parameters is a necessary step of the design process. At the same time, traditional parameter sweeping cannot handle complex topologies and large number of design variables. On the other hand, high computational cost of the conventional...
-
Arterial cannula shape optimization by means of the rotational firefly algorithm
PublicationThe 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,...
-
Adversarial attack algorithm for traffic sign recognition
PublicationDeep 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...
-
Using River Formation Dynamics Algorithm in Mobile Robot Navigation
PublicationRiver 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...
-
Efficient Simulation-Based Global Antenna Optimization Using Characteristic Point Method and Nature-Inspired Metaheuristics
PublicationAntenna structures are designed nowadays to fulfil rigorous demands, including multi-band operation, where the center frequencies need to be precisely allocated at the assumed targets while improving other features, such as impedance matching. Achieving this requires simultaneous optimization of antenna geometry parameters. When considering multimodal problems or if a reasonable initial design is not at hand, one needs to rely...
-
Electronic nose algorithm design using classical system identification for odour intensity detection
PublicationThe two elements considered crucial for constructing an efficient environmental odour intensity monitoring systems are sensors and algorithms typically addressed to as electronic nose sensor (e-nose). Due to operational complexity of biochemical sensors developed in human bodies algorithms based on computational methods of artificial intelligence are typically considered superior to classical model based approaches in development...
-
Comparison of reproduction strategies in genetic algorithm approach to graph searching
Publicationgenetic 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...
-
Information Retrieval with the Use of Music Clustering by Directions Algorithm
PublicationThis 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...
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublicationArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
Complex multidisciplinary optimization of turbine blading systems
PublicationThe paper describes the methods and results of direct optimization of turbine blading systems using a software package Opti_turb. The final shape of the blading is obtained from minimizing the objective function, which is the total energy loss of the stage, including the leaving energy. The current values of the objective function are found from 3D RANS computations (from a code FlowER) of geometries changed during the process...
-
Rapid design optimization of antennas using variable-fidelity EM models and adjoint sensitivities
PublicationPurpose – Development of techniques for expedited design optimization of complex and numerically expensive electromagnetic (EM) simulation models of antenna structures validated both numerically and experimentally. The paper aims to discuss these issues. Design/methodology/approach – The optimization task is performed using a technique that combines gradient search with adjoint sensitivities, trust region framework, as well as...
-
Low-Cost Multi-Objective Optimization of Antennas By Means Of Generalized Pareto Ranking Bisection Algorithm
PublicationThis paper introduces a generalized Pareto ranking bisection algorithm for low-cost multi-objective design optimization of antenna structures. The algorithm allows for identifying a set of Pareto optimal sets of parameters (that represent the best trade-offs between considered objectives) by iterative partitioning of the intervals connecting previously found designs and executing a Pareto-ranking-based poll search. The initial...
-
Multimodal Genetic Algorithm with Phase Analysis to Solve Complex Equations of Electromagnetic Analysis
PublicationIn this contribution, a new genetic-algorithm-based method of finding roots and poles of a complex function of a complex variable is presented. The algorithm employs the phase analysis of the function to explore the complex plane with the use of the genetic algorithm. Hence, the candidate regions of root and pole occurrences are selected and verified with the use of discrete Cauchy's argument principle. The algorithm is evaluated...
-
On-line Search in Two-Dimensional Environment
PublicationWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. As a way of modeling two-dimensional shapes, we restrict our attention to networks that are embedded into partial grids:...
-
Complex Root Finding Algorithm Based on Delaunay Triangulation
PublicationA 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...
-
On-line Search in Two-Dimensional Environment
PublicationWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. We require that the strategy is connected and monotone, that is, at each point of the execution the part of the graph...
-
An optimized system for sensor ontology meta-matching using swarm intelligent algorithm
PublicationIt is beneficial to annotate sensor data with distinct sensor ontologies in order to facilitate interoperability among different sensor systems. However, for this interoperability to be possible, comparable sensor ontologies are required since it is essential to make meaningful links between relevant sensor data. Swarm Intelligent Algorithms (SIAs), namely the Beetle Swarm Optimisation Algorithm (BSO), present a possible answer...
-
Spectral Clustering Wikipedia Keyword-Based search Results
PublicationThe 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
PublicationDepth 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...
-
Reduced-cost design closure of antennas by means of gradient search with restricted sensitivity update
PublicationDesign closure, i.e., adjustment of geometry parameters to boost the performance, is a challenging stage of antenna design process. Given complexity of contemporary structures, reliable parameter tuning requires numerical optimization and can be executed using local algorithms. Yet, EM-driven optimization is a computationally expensive endeavour and reducing its cost is highly desirable. In this paper, a modification of the trust-region...
-
Computationally-efficient design optimisation of antennas by accelerated gradient search with sensitivity and design change monitoring
PublicationElectromagnetic (EM) simulation tools are of primary importance in the design of contemporary antennas. The necessity of accurate performance evaluation of complex structures is a reason why the final tuning of antenna dimensions, aimed at improvement of electrical and field characteristics, needs to be based on EM analysis. Design automation is highly desirable and can be achieved by coupling EM solvers with numerical optimisation...
-
Retrieval with Semantic Sieve
PublicationThe article presents an algorithm we called Semantic Sieve applied for refining search results in text documents repository. The algorithm calculates socalled conceptual directions that enables interaction with the user and allows to narrow the set of results to the most relevant ones. We present the system where the algorithm has been implemented. The system also offers in the presentation layer clustering of the results into...
-
Scheduling of compatible jobs on parallel machines
PublicationThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...
-
Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures
PublicationThe purpose of this letter is introduction of a novel methodology for expedited multi-objective design of antenna structures. The key component of the presented approach is fast identification of the initial representation of the Pareto front (i.e., a set of design representing the best possible trade-offs between conflicting objectives) using a Pareto-ranking bisection algorithm. The algorithm finds a discrete set of Pareto-optimal...
-
RANS-based design optimization of dual-rotor wind turbines
PublicationPurpose An improvement in the energy efficiency of wind turbines can be achieved using dual rotors. Because of complex flow physics, the design of dual-rotor wind turbines (DRWTs) requires repetitive evaluations of computationally expensive partial differential equation (PDE) simulation models. Approaches for solving design optimization of DRWTs constrained by PDE simulations are investigated. The purpose of this study is to determine...
-
Development of Local IDF-formula Using Controlled Random Search Method for Global Optimization
PublicationThe aim of the study is to present the effective and relatively simple empirical approach to rainfall Intensity-Duration-Frequency-formulas development, based on Controlled Random Search (CRS) for global optimization. The approach is mainly dedicated to the cases in which the commonly used IDF-relationships do not provide satisfactory fit between simulations and observations, and more complex formulas with higher number of parameters...
-
Metaheurystyki sztucznej inteligencji w wybranych grach komputerowych
PublicationW pracy omówiono trzy metaheurystyki sztucznej inteligencji, które mogą stać się źródłem inspiracji dla projektantów gier komputerowych. Pokazano, w jaki sposób zastosowano algorytm mrówkowy, algorytm genetyczny i algorytm tabu search w grach komputerowych zaprojektowanych przez studentów Politechniki Gdańskiej. W szczególności, odniesiono się do problematyki wyznaczania trajektorii przemieszczających się obiektów...
-
EM-Driven Multi-Objective Design of Impedance Transformers By Pareto Ranking Bisection Algorithm
PublicationIn the paper, the problem of fast multi-objective optimization of compact impedance matching transformers is addressed by utilizing a novel Pareto ranking bisection algorithm. It approximates the Pareto front by dividing line segments connecting the designs found in the previous iterations, and refining the obtained candidate solutions by means of poll-type search involving Pareto ranking. The final Pareto set is obtained using...
-
On minimum cost edge searching
PublicationWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...