Search results for: HARMONY SEARCH ALGORITHM - Bridge of Knowledge

Search

Search results for: HARMONY SEARCH ALGORITHM

Search results for: HARMONY SEARCH ALGORITHM

  • 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

  • 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 available to download

  • 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 available to download

  • An Efficient Noisy Binary Search in Graphs via Median Approximation

    Publication

    - LECTURE NOTES IN COMPUTER SCIENCE - Year 2021

    Consider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...

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

  • 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

  • An optimized system for sensor ontology meta-matching using swarm intelligent algorithm

    Publication

    - Internet Technology Letters - Year 2024

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

    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

  • Reduced-cost constrained miniaturization of wideband antennas using improved trust-region gradient search with repair step

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

    Full text to download in external service

  • Self-Organizing Map representation for clustering Wikipedia search results

    The article presents an approach to automated organization of textual data. The experiments have been performed on selected sub-set of Wikipedia. The Vector Space Model representation based on terms has been used to build groups of similar articles extracted from Kohonen Self-Organizing Maps with DBSCAN clustering. To warrant efficiency of the data processing, we performed linear dimensionality reduction of raw data using Principal...

  • Self–Organizing Map representation for clustering Wikipedia search results

    Publication

    - Year 2011

    The article presents an approach to automated organization of textual data. The experiments have been performed on selected sub-set of Wikipedia. The Vector Space Model representation based on terms has been used to build groups of similar articles extracted from Kohonen Self-Organizing Maps with DBSCAN clustering. To warrant efficiency of the data processing, we performed linear dimensionality reduction of raw data using Principal...

    Full text to download in external service

  • Follow the Light. Where to search for useful research information

    Architectural Lighting Design (ALD) has never been a standalone professional discipline. Rather, it has existed as the combination of art and the science of light. Today, third generation lighting professionals are already creatively intertwining these fields, and the acceleration in scientific, technological and societal studies has only increased the need for reliable multidisciplinary information. Therefore, a thorough re-examination...

    Full text available to download

  • Synchronous black hole search in directed graphs

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2011

    The paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...

    Full text available to download

  • Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures

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

    Full text to download in external service

  • Controlled Random Search Applied to Parameters Estimation of the Longitudinal Solutes Transport Model for Rivers

    Publication

    - Year 2003

    Numerical computations are presented for the longitudinal transport of passive, conservative solutes in an actual river with the inclusion of geometrical complexities of river channels. A special emphasis is put on the method of the identification of model parameters which is based on a specially designed optimisation procedure using random control search algorithm. Two different situations are considered namely a linear version...

  • In Search of Naval Beauty. Historical Study of Ship Architecture

    Publication

    - Year 2018

    Designing ships is no mean achievement. In the old days, constructors focused on making their ships visually appealing, while paying scant regard to the living conditions of the crew. Such an approach reflected the state of the art in ship building at the time as well as the social order prevalent in those days. A breakthrough came no earlier than at the turn of the 19th / 20th centuries. The industrial revolution brought along...

    Full text to download in external service

  • New Indoor Positioning Algorithm for Distance Measurements

    Publication

    - Year 2017

    In the paper a new indoor positioning algorithm is presented. This algorithm takes into account selected features of radio wave propagation in indoor environment. This results in improvement in accuracy of calculated position estimates. A comparative analysis of this new algorithm with Chan and Foy algorithms was made and described in the paper. This comparative analysis was made with utilization of real radio distance measurements.

  • An Approximation of the Zero Error Capacity by a Greedy Algorithm.

    Publication

    - Year 2020

    We present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.

    Full text to download in external service

  • An Approximation of the Zero Error Capacity by a Greedy Algorithm

    Publication

    - Year 2020

    We present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.

  • IN SEARCH OF A NEW EXHIBITION SPACE

    Publication

    The buildings considered as raising the prestige and promoting cities are those related to culture. Their impact on urban life is undeniable, which is reflected in a continuous increase in the number of new museum buildings. Apart from places intrinsically linked with culture, which, as such, may be considered as standard - like museum, theatres or galleries - there also appear alternative places of development and promotion of...

    Full text available to download

  • SEARCH-Journal of Media and Communication Research

    Journals

    eISSN: 2672-7080

  • Termination functions for evolutionary path planning algorithm

    Publication

    In this paper a study of termination functions (stop criterion) for evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Five...

  • Comparison of new position estimation algorithm for indoor environment

    Publication

    In the paper a new position estimation algorithm based on distance measurements is presented. This algorithm is dedicated for indoor environments. In the paper the new algorithm is compared with Chan algorithm. For the comparison were used real measurements conducted inside a building.

  • Superresolution algorithm to video surveillance system

    Publication

    - Year 2010

    An application of a multiframe SR (superresolution) algorithm applied to video monitoring is described. The video signal generated by various types of video cameras with different parameters and signal distortions which may be very problematic for superresolution algorithms. The paper focuses on disadvantages in video signal which occur in video surveillance systems. Especially motion estimation and its influence on superresolution...

  • EM-Driven Multi-Objective Design of Impedance Transformers By Pareto Ranking Bisection Algorithm

    Publication

    - Year 2017

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

    Full text to download in external service

  • Ontology clustering by directions algorithm to expand ontology queries

    Publication

    - Year 2009

    This paper concerns formulating ontology queries. It describes existing languages in which ontologies can be queried. It focuses on languages which are intended to be easily understood by users who are willing to retrieve information from ontologies. Such a language can be, for example, a type of controlled natural language (CNL). In this paper a novel algorithm called Ontology Clustering by Directions is presented. The algorithm...

  • On Improved-Reliability Design Optimization of High-Frequency Structures Using Local Search Algorithms

    The role of numerical optimization has been continuously growing in the design of high-frequency structures, including microwave and antenna components. At the same time, accurate evaluation of electrical characteristics necessitates full-wave electromagnetic (EM) analysis, which is CPU intensive, especially for complex systems. As rigorous optimization routines involve repetitive EM simulations, the associated cost may be significant....

    Full text available to download

  • Lexicon Based Algorithm for Domain Ontology Merging and Alignment

    Publication

    More and more systems contain some kind of knowledge describing their field of operation. Such knowledge in many cases is stored as an ontology. A need arises for ability to quickly match those ontologies to enable interoperability of such systems. The paper presents a lexicon based algorithm for merging and aligning of OWL ontologies. The proposed similarity levels are being presented and the proposed algorithm is being described....

    Full text to download in external service

  • Can Web Search Queries Predict Prices Change on the Real Estate Market?

    Publication

    This study aims to explore whether the intensity of internet searches, according to the Google Trends search volume index (SVI), is a predictor of changes in real estate prices. The motivation of this study is the possibility to extend the understanding of the extra predictive power of Google search engine query volume of future housing price change (shift direction) by (i) the introduction of a research approach that combines...

    Full text available to download

  • DEVELOPMENT OF THE ALGORITHM OF POLISH LANGUAGE FILM REVIEWS PREPROCESSING

    The algorithm and the software for conducting the procedure of Preprocessing of the reviews of films in the Polish language were developed. This algorithm contains the following steps: Text Adaptation Procedure; Procedure of Tokenization; Procedure of Transforming Words into the Byte Format; Part-of-Speech Tagging; Stemming / Lemmatization Procedure; Presentation of Documents in the Vector Form (Vector Space Model) Procedure; Forming...

    Full text available to download

  • Clonal selection algorithm for vehicle routing

    Publication

    - Year 2008

    Over the years several successful computing techniques have been inspired by biological mechanisms. Studies of the mechanisms that allow the immune systems of vertebratesto adapt and learn have resulted in a class of algorithms called artificial immune systems. 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...

    Full text to download in external service

  • Distributed Evolutionary Algorithm for Path Planning in Navigation Situation

    This article presents the use of a multi-population distributed evolutionary algorithm for path planning in navigation situation. The algorithm used is with partially exchanged population and migration between independently evolving populations. In this paper a comparison between a multi-population and a classic single-population algorithm takes place. The impact on the ultimate solution has been researched. It was shown that using...

    Full text available to download

  • Graphs hard-to-process for greedy algorithm MIN

    Publication

    We compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.

    Full text to download in external service

  • Impact of Initial Population on Evolutionary Path Planning Algorithm

    Publication

    In this paper an impact of initial population on evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal shippaths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Four tests are performed....

  • AN ALGORITHM FOR PORTAL HYPERTENSIVE GASTROPATHY RECOGNITION ON THE ENDOSCOPIC RECORDINGS

    Publication

    Symptoms recognition of portal hypertensive gastropathy (PHG) can be done by analysing endoscopic recordings, but manual analysis done by physician may take a long time. This increases probability of missing some symptoms and automated methods may be applied to prevent that. In this paper a novel hybrid algorithm for recognition of early stage of portal hypertensive gastropathy is proposed. First image preprocessing is described....

  • Proximal primal–dual best approximation algorithm with memory

    Publication

    - COMPUTATIONAL OPTIMIZATION AND APPLICATIONS - Year 2018

    We propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...

    Full text available to download

  • Global Complex Roots and Poles Finding Algorithm in C × R Domain

    An algorithm to find the roots and poles of a complex function depending on two arguments (one complex and one real) is proposed. Such problems are common in many fields of science for instance in electromagnetism, acoustics, stability analyses, spectroscopy, optics, and elementary particle physics. The proposed technique belongs to the class of global algorithms, gives a full picture of solutions in a fixed region ⊂ C × R and...

    Full text available to download

  • Impact of Initial Population on Evolutionary Path Planning Algorithm

    Publication

    In this paper an impact of initial population on evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Four tests are performed....

  • Novel 5.1 Downmix Algorithm with Improved Dialogue Intelligibility

    Publication

    A new algorithm for 5.1 to stereo downmix is introduced, which addresses the problem of dialogue intelligibility. The algorithm utilizes proposed signal processing algorithms to enhance the intelligibility of movie dialogues, especially in difficult listening conditions or in compromised speaker setup. To account for the latter, a playback configuration utilizing a portable device, i.e. an ultrabook, is examined. The experiments...

    Full text to download in external service

  • Approximate search strategies for weighted trees

    Publication

    W pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.

    Full text available to download

  • In search of a common ground for the space sciences

    Publication

    - Year 2019

    The paper discusses the relations between various aspects of human activities performed in space, taking into consideration the past, present and future contexts. Interdisciplinarity and integrity of technological issues combined with legal and management issues were emphasized. Consequently, it was recognized that it is necessary to build a network of universities, research-and-development companies and engineering companies....

    Full text to download in external service

  • Intelligent Resources Search in Virtual Libraries.

    Publication

    - Year 2004

    Została zaprezentowana koncepcja bibliotek cyfrowych oraz temat wyszukiwania zasobów. W celu poprawy jakości procesu wyszukiwania, zostało zaproponowane użycie koncepcji sieci semantycznej zamiast klasycznego sposóbu opisu zasobów bibliograficznych. Została opisana prosta ontologia oparta o Dublin Core meta-data. Zostało przedyskutowane zastosowanie algorytmu przetważania połączeń semantycznych w celu szukania. Zastosowany w Wirtualnej...

  • Point cloud unification with optimization algorithm

    Terrestrial laser scanning is a technology that enables to obtain three-dimensional data – an accurate representation of reality. During scanning not only desired objects are measured, but also a lot of additional elements. Therefore, unnecessary data is being removed, what has an impact on efficiency of point cloud processing. It can happen while single point clouds are displayed – user decides what he wants...

    Full text available to download

  • Robust algorithm for active feedback control of narrowband noise

    Publication

    The problem of active control of narrowband acoustic noise is considered. It is shown that the proposed earlier feedback control algorithm called SONIC (self-optimizing narrowband interference canceller), based on minimization of the L2-norm performance measure, can be re-derived using the L1 approach. The resulting robust SONIC algorithm is more robust to heavy-tailed measurement noise, such as the αlpha-stable noise, than the...

    Full text to download in external service

  • How proteins bind to DNA: target discrimination and dynamic sequence search by the telomeric protein TRF1

    Publication

    Target search as performed by DNA-binding proteins is a complex process, in which multiple factors contribute to both thermodynamic discrimination of the target sequence from overwhelmingly abundant off-target sites and kinetic acceleration of dynamic sequence interrogation. TRF1, the protein that binds to telomeric tandem repeats, faces an intriguing variant of the search problem where target sites are clustered within short fragments...

    Full text available to download

  • Quality Evaluation of Novel DTD Algorithm Based on Audio Watermarking

    Publication

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

    Full text to download in external service

  • Using Long-Short term Memory networks with Genetic Algorithm to predict engine condition

    Publication

    - Gazi University Journal of Science - Year 2022

    Predictive maintenance (PdM) is a type of approach for maintenance processes, allowing maintenance actions to be managed depending on the machine's current condition. Maintenance is therefore carried out before failures occur. The approach doesn’t only help avoid abrupt failures but also helps lower maintenance cost and provides possibilities to manufacturers to manage maintenance budgets in a more efficient way. A new deep neural...

    Full text to download in external service

  • Eventual Convergence of the Reputation-Based Algorithm in IoT Sensor Networks

    Publication

    - SENSORS - Year 2021

    Uncertainty in dense heterogeneous IoT sensor networks can be decreased by applying reputation-inspired algorithms, such as the EWMA (Exponentially Weighted Moving Average) algorithm, which is widely used in social networks. Despite its popularity, the eventual convergence of this algorithm for the purpose of IoT networks has not been widely studied, and results of simulations are often taken in lieu of the more rigorous proof....

    Full text available to download

  • Global Complex Roots and Poles Finding Algorithm Based on Phase Analysis for Propagation and Radiation Problems

    A flexible and effective algorithm for complex roots and poles finding is presented. A wide class of analytic functions can be analyzed, and any arbitrarily shaped search region can be considered. The method is very simple and intuitive. It is based on sampling a function at the nodes of a regular mesh, and on the analysis of the function phase. As a result, a set of candidate regions is created and then the roots/poles are verified...

    Full text available to download

  • Moving object tracking algorithm evaluation in autonomous surveillance system

    Publication

    Results of evaluation of video object tracking algorithm being a part of an autonomous surveillance system are presented. The algorithm was investigated employing a set of benchmarks recorded locally. The precision of object detection, evaluated with such metrics as fragmentation, object area recall and object precision, is in focus. The experiments aimed at examining the detection quality using various object detection algorithm...