Wyszukiwarka
Filtry
wszystkich: 413
Wyniki wyszukiwania dla: GLOBAL SEARCH
-
Cost Analysis of Prefabricated Elements of the Ordinary and Lightweight Concrete Walls in Residential Construction
PublikacjaGlobal economic growth causes an increase in natural resources exploitation, particularly in construction branch. The growing use of electricity contributes to climate change. Therefore, it is necessary to search the solutions, which will allow for reducing natural resources exploitation. One of the many opportunities to do that is the application of the recycled materials. The authors of the given article have analyzed three variants...
-
Rapid Antenna Optimization with Restricted Sensitivity Updates by Automated Dominant Direction Identification
PublikacjaMeticulous tuning of geometry parameters turns pivotal in improving performance of antenna systems. It is more and more often realized using formal optimization methods, which is demonstrably the most efficient way of handling multiple design variables, objectives, and constraints. Although in some cases a need for launching global search arises, a typical design scenario only requires local optimization, especially when a decent...
-
Expedited Design Closure of Antenna Input Characteristics by Trust Region Gradient Search and Principal Component Analysis
PublikacjaOptimization-based parameter tuning has become an inherent part of contemporary antenna design process. For the sake of reliability, it is typically conducted at the level of full-wave electromagnetic (EM) simulation models. This may incur considerable computational expenses depending on the cost of an individual EM analysis, the number of adjustable variables, the type of task (local, global, single-/multi-objective optimization),...
-
Accelerated Gradient-Based Optimization of Antenna Structures Using Multi-Fidelity Simulations and Convergence-Based Model Management Scheme
PublikacjaThe importance of numerical optimization has been steadily growing in the design of contemporary antenna structures. The primary reason is the increasing complexity of antenna topologies, [ a typically large number of adjustable parameters that have to be simultaneously tuned. Design closure is no longer possible using traditional methods, including theoretical models or supervised parameter sweeping. To ensure reliability, optimization...
-
Rapid and Reliable Re-Design of Miniaturized Microwave Passives by Means of Concurrent Parameter Scaling and Intermittent Local Tuning
PublikacjaRe-design of microwave passive components for the assumed operating frequencies or substrate parameters is an important yet a tedious process. It requires simultaneous tuning of relevant circuit variables, often over broad ranges thereof, to ensure satisfactory performance of the system. If the operating conditions at the available design are distant from the intended ones, local optimization is typically insufficient, whereas...
-
Knowledge pills in Education and Training: A Literature Review
PublikacjaObject and purpose: Knowledge pills (KPs) are a technique for transferring knowledge through short factual batches of content. In education and vocational training, they can help learners acquire specific pieces of knowledge in a few minutes, through a “microteaching” approach where learners can be involved in active and interactive exercises, quizzes, and games. Thanks to the advancements of multimedia platforms, they can contain...
-
Polish Polar Research: Green-and-White Paper under the aegis of the Polish Polar Consortium (PPC)
PublikacjaPolar research is a colloquial term for cross-area, cross-domain and interdisciplinary research in the Arctic and Antarctic. Polar research is mainly the domain of natural sciences, but technical sciences and humanities also grow in importance. Being vulnerable to climate change, polar regions are commonly considered as a kind of litmus paper of changes in geosystems, hence the importance of research done there. It aims at a better...
-
Accurate Modeling of Antenna Structures by Means of Domain Confinement and Pyramidal Deep Neural Networks
PublikacjaThe importance of surrogate modeling techniques has been gradually increasing in the design of antenna structures over the recent years. Perhaps the most important reason is a high cost of full-wave electromagnetic (EM) analysis of antenna systems. Although imperative in ensuring evaluation reliability, it entails considerable computational expenses. These are especially pronounced when carrying out EM-driven design tasks such...
-
On minimum cost edge searching
PublikacjaWe 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...
-
Bacteriophages as potential tools for use in antimicrobial therapy and vaccine development
PublikacjaThe constantly growing number of people suffering from bacterial, viral, or fungal infections, parasitic diseases, and cancers prompts the search for innovative methods of disease prevention and treatment, especially based on vaccines and targeted therapy. An additional problem is the global threat to humanity resulting from the increasing resistance of bacteria to commonly used antibiotics. Conventional vaccines based on bacteria...
-
Searching by heterogeneous agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
Searching by Heterogeneous Agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
Harmony Search for Data Mining with Big Data
PublikacjaIn 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,...
-
Auto-tuning methodology for configuration and application parameters of hybrid CPU + GPU parallel systems based on expert knowledge
PublikacjaAuto-tuning of configuration and application param- eters allows to achieve significant performance gains in many contemporary compute-intensive applications. Feasible search spaces of parameters tend to become too big to allow for exhaustive search in the auto-tuning process. Expert knowledge about the utilized computing systems becomes useful to prune the search space and new methodologies are needed in the face of emerging heterogeneous...
-
Application of genetic algorithms in graph searching problem
PublikacjaGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
Neural Network Subgraphs Correlation with Trained Model Accuracy
PublikacjaNeural Architecture Search (NAS) is a computationally demanding process of finding optimal neural network architecture for a given task. Conceptually, NAS comprises applying a search strategy on a predefined search space accompanied by a performance evaluation method. The design of search space alone is expected to substantially impact NAS efficiency. We consider neural networks as graphs and find a correlation between the presence...
-
Structure and Randomness in Planning and Reinforcement Learning
PublikacjaPlanning in large state spaces inevitably needs to balance the depth and breadth of the search. It has a crucial impact on the performance of a planner and most manage this interplay implicitly. We present a novel method \textit{Shoot Tree Search (STS)}, which makes it possible to control this trade-off more explicitly. Our algorithm can be understood as an interpolation between two celebrated search mechanisms: MCTS and random...
-
Parallel tabu search for graph coloring problem
PublikacjaTabu 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...
-
Scanning networks with cactus topology
PublikacjaThe family of Pursuit and Evasion problems is widelystudied because of its numerous practical applications,ranging from communication protocols to cybernetic andphysical security. Calculating the search number of a graphis one of most commonly analyzed members of this problemfamily. The search number is the smallest number of mobileagents required to capture an invisible and arbitrarily fastfugitive, for instance piece of malicious...
-
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...
-
Adaptive Algorithm for Interactive Question-based Search
PublikacjaPopular 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...
-
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...
-
The Application of the IODA Document Architecture to Music Data
PublikacjaThis paper is concerned with storing music data with the use of document architecture called Interactive Open Document Architecture (IODA). This architecture makes it possible to create documents which are executable, mobile, interactive and intelligent. Such documents consist of many files that are semantically related to each other. Semantic links are defined in XML files which are a part of a document. IODA documents with music...
-
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...
-
Volunteer Computing System Comcute with Smart Scheduler
PublikacjaIn 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.
-
A Systematic Search for New Coupling Schemes of Cross-Coupled Resonator Bandpass Filters
PublikacjaIn 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.
-
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...
-
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.
-
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...
-
A structure and simulation-driven design of compact CPW-fed UWB antenna
PublikacjaIn this letter, a structure of a miniaturized ultra-wideband CPW-fed antenna and its design proce-dure are presented. The antenna is a modified version of the design previously proposed in the literature, with additional degrees of freedom introduced in order to improve the structure flexibility. The small size is achieved by executing a rigorous optimization procedure that consists of two stages: (i) smart random search carried...
-
Management of Textual Data at Conceptual Level
PublikacjaThe article presents the approach to the management of a large repository of documents at conceptual level. We describe our approach to representing Wikipedia articles using their categories. The representation has been used to construct groups of similar articles. Proposed approach has been implemented in prototype system that allows to organize articles that are search results for a given query. Constructed clusters allow to...
-
0-step K-means for clustering Wikipedia search results
PublikacjaThis 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....
-
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...
-
Harmony Search to Self-Configuration of Fault-Tolerant Grids for Big Data
PublikacjaIn 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...
-
Fast Approximate String Search for Wikification
PublikacjaThe 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...
-
Retrieval with Semantic Sieve
PublikacjaThe 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...
-
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...
-
Porównanie wydajności modyfikacji algorytmu Proof-number search uwzględniających wartości remisowe
PublikacjaProof-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...
-
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...
-
Searching for innovation knowledge: insight into KIBS companies
PublikacjaThe paper analyses the activity of research for “innovation knowledge”—here defined as knowledge that can lead to the introduction of service innovations—by Knowledge-Intensive Business Services (KIBS) companies. It proposes a classification of the possible search approaches adopted by those companies based on two dimensions: the pro-activity of search efforts and the source primarily used. Such classification is then discussed...
-
Some Exact Values of Shannon Capacity for Evolving Systems
PublikacjaWe describe the notion of Shannon Capacity for evolving channels. Furthermore, using a computer search together with some theoretical results we establish some exact values of the measure.
-
Deep neural network architecture search using network morphism
PublikacjaThe 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...
-
Harmony Search for Self-configuration of Fault–Tolerant and Intelligent Grids
PublikacjaIn 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...
-
Fast multi-objective design optimization of microwave and antenna structures using data-driven surrogates and domain segmentation
PublikacjaPurpose 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...
-
In search for new urban planning education and research formulas
PublikacjaThis 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.
-
Information retrieval with semantic memory model
PublikacjaPsycholinguistic theories of semantic memory form the basis of understanding of natural language concepts. These theories are used here as an inspiration for implementing a computational model of semantic memory in the form of semantic network. Combining this network with a vector-based object-relation-feature value representation of concepts that includes also weights for confidence and support, allows for recognition of concepts...
-
Machine learning-based seismic fragility and seismic vulnerability assessment of reinforced concrete structures
PublikacjaMany studies have been performed to put quantifying uncertainties into the seismic risk assessment of reinforced concrete (RC) buildings. This paper provides a risk-assessment support tool for purpose of retrofitting and potential design strategies of RC buildings. Machine Learning (ML) algorithms were developed in Python software by innovative methods of hyperparameter optimization, such as halving search, grid search, random...
-
The legal regulations of sewage sludge management
PublikacjaThe growing quantity of sludge, high costs of the altered version, as well as new legal adjustments needs more and more higher qualitative requirements, the necessity of search in sludge economy and new solutions. The paper contributes to the discusion about legal ways of sewage sludge managemant.
-
Categorization of Wikipedia articles with spectral clustering
PublikacjaAbstract. The article reports application of clustering algorithms for creating hierarchical groups withinWikipedia articles.We evaluate three spectral clustering algorithms based on datasets constructed with usage ofWikipedia categories. Selected algorithm has been implemented in the system that categorize Wikipedia search results in the fly.
-
Rapid design closure of microwave components by means of feature-based optimization and adjoint sensitivities
PublikacjaIn this article, fast design closure of microwave components using feature-based optimization (FBO) and adjoint sensitivities is discussed. FBO is one of the most recent optimization techniques that exploits a particular structure of the system response to “flatten” the functional landscape handled during the optimization process, which leads to reducing its computational complexity. When combined with gradient-based search involving...