Search results for: HARMONY SEARCH ALGORITHM - Bridge of Knowledge

Search

Search results for: HARMONY SEARCH ALGORITHM

displaying 1000 best results Help

Search results for: HARMONY SEARCH ALGORITHM

  • Harmony Search for Data Mining with Big Data

    Publication

    - Year 2016

    In 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,...

    Full text to download in external service

  • Harmony Search for Self-configuration of Fault–Tolerant and Intelligent Grids

    Publication

    - Year 2016

    In this paper, harmony search algorithms have been proposed to self-configuration of fault-tolerant grids for big data processing. Self-configuration of computer grids lies in the fact that new computer nodes are automatically configured by software agents and then integrated into the grid. A base node works due to several configuration parameters that define some aspects of data communications and energy power consumption. We...

    Full text to download in external service

  • Harmony Search to Self-Configuration of Fault-Tolerant Grids for Big Data

    In this paper, harmony search algorithms have been proposed to self-configuration of fault-tolerant grids for big data processing. Some tasks related to big data processing have been considered. Moreover, two criteria have been applied to evaluate quality of grids. The first criterion is a probability that all tasks meet their deadlines and the second one is grid reliability. Furthermore, some intelligent agents based on harmony...

    Full text to download in external service

  • Adaptive Algorithm for Interactive Question-based Search

    Publication

    - Year 2012

    Popular 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

    Publication

    - CONTROL AND CYBERNETICS - Year 2012

    A 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 Tabu Search Algorithm for Optimization of Survivable Overlay Computing Systems

    Publication

    - Advances in Intelligent Systems and Computing - Year 2012

    Paradygmat 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,...

    Full text to download in external service

  • Satellite Image Classification Using a Hierarchical Ensemble Learning and Correlation Coefficient-Based Gravitational Search Algorithm

    Publication
    • K. Thiagarajan
    • M. Manapakkam Anandan
    • A. Stateczny
    • P. Bidare Divakarachari
    • H. Kivudujogappa Lingappa

    - Remote Sensing - Year 2021

    Satellite 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...

    Full text available to download

  • Use of Modified Cuckoo Search algorithm in the design process of integrated power systems for modern and energy self-sufficient farms

    Publication

    In 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...

    Full text to download in external service

  • Volunteer Computing System Comcute with Smart Scheduler

    In this paper, a volunteer grid called Comcute is studied. Moreover, the harmony search scheduler is proposed. This scheduler has been designed for efficient using some resources of volunteer grid. The harmony search scheduler optimizes both a workload of a bottleneck computer and the cost of grid. Finally, some experiment outcomes have been discussed.

    Full text to download in external service

  • Big Data Processing by Volunteer Computing Supported by Intelligent Agents

    Publication

    In this paper, volunteer computing systems have been proposed for big data processing. Moreover, intelligent agents have been developed to efficiency improvement of a grid middleware layer. In consequence, an intelligent volunteer grid has been equipped with agents that belong to five sets. The first one consists of some user tasks. Furthermore, two kinds of semi-intelligent tasks have been introduced to implement a middleware...

    Full text to download in external service

  • Metaheurystyki sztucznej inteligencji w wybranych grach komputerowych

    W 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...

  • Green Therapy w projektowaniu ośrodków medycznych Green Therapy in complex design of health centres

    Publication

    Koncepcja przestrzenna ogrodu terapeutycznego podporządkowana jest generalnej idei otwierania się projektantów na poszukiwanie nowych możliwości poprawy samopoczucia odbiorcy - poprzez zapewnienie użytkownikom poczucia bezpieczeństwa, komfortu i odprężenia, harmonii. Dotyczy to nie tylko grupy osób chorych, które dręczone są przez niepokoje i napięcia wywołane przez niepełnosprawność czy chorobę, ale także pacjentów w różnym wieku...

  • Working in harmony with nature. Green office buildings in a present-day city

    Publication

    - GeoScape - Year 2010

    Metropolis - as main point of people's migration, mostly because of work, have to face sustainable development as a strategy for the near future. This article describes possible ways leading to the best office building concepts in the design process. Searching for a workspace in harmony with nature is one of the aspects of a balanced development. The challenge is to create functional, compact, environmentally friendly and healthy...

    Full text to download in external service

  • Fast Approximate String Search for Wikification

    Publication

    The 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...

    Full text to download in external service

  • Parallel tabu search for graph coloring problem

    Publication

    - Year 2006

    Tabu 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...

  • Standards for Quality Assurance in the European Higher Education Area versus Common Assessment Framework in education. Conflict or harmony?

    Publication

    - Year 2014

    The aim of the research was to analyze the assumptions of Standards and Guidelines for Quality Assurance in the European Higher Education Area (ENQA) and the criteria of Common Assessment Framework (CAF) for the educational sector and based on that to find out the main differences and similarities (conflicts and harmony) between them. The results of the research showed that the current trends of the quality movement evolution in...

  • 0-step K-means for clustering Wikipedia search results

    Publication

    - Year 2011

    This 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....

  • Deep neural network architecture search using network morphism

    Publication

    The 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...

    Full text to download in external service

  • On-line Search in Two-Dimensional Environment

    Publication

    We 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:...

    Full text to download in external service

  • Interactive Query Expansion with the Use of Clustering by Directions Algorithm

    This 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...

  • On-line Search in Two-Dimensional Environment

    We 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...

    Full text to download in external service

  • Interactive Information Retrieval Algorithm for Wikipedia Articels

    Publication

    - Year 2012

    The 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.

  • Spectral Clustering Wikipedia Keyword-Based search Results

    The 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...

    Full text available to download

  • Brief Announcement: Energy Constrained Depth First Search

    Publication

    - Year 2018

    Depth 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...

    Full text to download in external service

  • Neural Architecture Search for Skin Lesion Classification

    Deep 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...

    Full text available to download

  • Features of a radial user interface to search engines

    The 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...

    Full text to download in external service

  • Decision making process using deep learning

    Publication

    - Year 2019

    Endü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

    Publication

    This 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...

    Full text to download in external service

  • Information Retrieval with the Use of Music Clustering by Directions Algorithm

    Publication

    - Year 2013

    This 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...

    Full text to download in external service

  • Arterial cannula shape optimization by means of the rotational firefly algorithm

    The 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,...

    Full text to download in external service

  • KEYSTONE WG2: Activities and Results Overview on Keyword Search

    Publication

    In 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.

    Full text to download in external service

  • Using River Formation Dynamics Algorithm in Mobile Robot Navigation

    River 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...

    Full text to download in external service

  • Comparison of reproduction strategies in genetic algorithm approach to graph searching

    genetic 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

    Publication

    - Year 2009

    Clusterization 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

    Publication

    - Year 2017

    We 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...

    Full text to download in external service

  • Relation-based Wikipedia Search System for Factoid Questions Answering

    In 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

    A 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...

    Full text to download in external service

  • Computer experiments with a parallel clonal selection algorithm for the graph coloring problem

    Publication

    - Year 2008

    Artificial 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...

    Full text to download in external service

  • In search for new urban planning education and research formulas

    This paper shows research and educational urban planning projects based on international and mutlicultural cooperation including innovative elements to conduct research on built environment. Their common aim is to search for a new perspective on the city development and challenges resulting from changing conditions.

    Full text to download in external service

  • Reduced-cost design closure of antennas by means of gradient search with restricted sensitivity update

    Design 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...

    Full text available to download

  • Performance comparison of new modified gradient algorithm and Foy algorithm for iterative position calculation

    In the paper a new position calculation algorithm is presented. It is proposed for indoor environments and is called modified gradient algorithm. This algorithm is compared with well-known Foy algorithm. The comparative analysis is based on real distance measurements conducted in indoor environment.

    Full text to download in external service

  • Acoustic journal bearing - A search for adequate configuration

    Classical non-contact bearings are already used in a number of specialist applications but there are somespecialist areas where they cannot be used for variety of reasons and acoustic sliding bearings could be an alternative. The paper presents the quest for a configuration of an acoustic journal bearing and shows that the overall shape of the bearing and its geometry are of a vital importance for the load capacity oft he bearing....

    Full text to download in external service

  • Development of Local IDF-formula Using Controlled Random Search Method for Global Optimization

    Publication

    The 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...

    Full text to download in external service

  • Computationally-efficient design optimisation of antennas by accelerated gradient search with sensitivity and design change monitoring

    Electromagnetic (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...

    Full text available to download

  • Multimodal Genetic Algorithm with Phase Analysis to Solve Complex Equations of Electromagnetic Analysis

    Publication

    - Year 2020

    In 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...

    Full text to download in external service

  • A Systematic Search for New Coupling Schemes of Cross-Coupled Resonator Bandpass Filters

    Publication

    In this paper, a systematic approach to an extensive search for topologies of cross-coupled filters with generalized Chebyshev response is presented. The technique applies graph theory to find unique, nonisomorphic filter configurations, and tests whether a specific frequency response can be realized in a given set of topologies. The results of the search are then stored in a database of possible filter configurations.

    Full text to download in external service

  • Low-Cost Multi-Objective Optimization of Antennas By Means Of Generalized Pareto Ranking Bisection Algorithm

    Publication

    - Year 2018

    This 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...

    Full text to download in external service

  • A Population-Based Method with Selection of a Search Operator

    Publication

    - Year 2020

    This paper presents a method based on a population in which the parameters of individuals can be processed by operators from various population-based algorithms. The mechanism of selecting operators is based on the introduction of an additional binary parameters vector located in each individual, on the basis of which it is decided which operators are to be used to modify individuals’ parameters. Thus, in the proposed approach,...

  • A tetragonal polymorph of SrMn2P2 made under high pressure – theory and experiment in harmony

    Publication

    - DALTON TRANSACTIONS - Year 2017

    Following the predictions of total energy calculations, a tetragonal SrMn2P2 phase is proposed and successfully formed under high pressure. At ambient pressure, SrMn2P2 adopts the primitive trigonal La2O3 structure type (space group P[3 with combining macron]m1). However, the results of total energy calculations indicate that SrMn2P2 should be more stable in the tetragonal ThCr2Si2 structure type (space group I4/mmm) than in its...

    Full text to download in external service

  • Porównanie wydajności modyfikacji algorytmu Proof-number search uwzględniających wartości remisowe

    Proof-number search to znana rodzina algorytmów służących do wyznaczania wartości pozycji w nielosowych grach dwóch graczy z pełną informacją. W wersji podstawowej pn-search doskonale radzi sobie z wyszukiwaniem strategii wygrywającej jednego z graczy. Jednak istnieje wiele znanych gier, w których obydwaj gracze posiadają jedynie strategię remisującą (Młynek, Awari, Warcaby). W niniejszej pracy porównano wydajność dwóch modyfikacji...

    Full text to download in external service