Search
Search results for: SEARCH NUMBER
-
Porównanie wydajności modyfikacji algorytmu Proof-number search uwzględniających wartości remisowe
PublicationProof-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...
-
Ocena poprawności działania algorytmu proof-number search na strukturze digrafu acyklicznego
PublicationAlgorytm proof-number search jest znanym algorytmem służącym do rozwiązywania gier logicznych. Rozwiązanie gry jest jednoznaczne ze znalezieniem optymalnej strategii i pozwala przeprowadzić rozgrywkę w sposób pozwalający na osiągnięcie najlepszego możliwego wyniku. Jedną z największych wad tego algorytmu, naturalnie pracującego na strukturze drzewa, jest wielokrotne rozwijanie identycznych poddrzew gry co prowadzi do nadmiarowego...
-
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 a 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....
-
Scanning networks with cactus topology
PublicationThe 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...
-
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...
-
Neural Architecture Search for Skin Lesion Classification
PublicationDeep 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...
-
Application of genetic algorithms in graph searching problem
PublicationGraph 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...
-
Acoustic journal bearing - A search for adequate configuration
PublicationClassical 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....
-
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:...
-
Synchronous black hole search in directed graphs
PublicationThe 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...
-
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...
-
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...
-
Bibliographic data on datasets (from 2020) affiliated to Most Wiedzy and indexed in Data Citation Index (retrieved by Web of Science service in December 2021)
Open Research DataThe file contains the number of datasets published by the researchers affiliated to Most Wiedzy and indexed in Data Citation Index by Web of Science. The Search was perfprmed using the name of institution in the 'assress' filed or 'group author' field. Data retrieved and published during the 5th Open Science Conference (1-3.12.2021).
-
Bibliographic data on datasets affiliated to Most Wiedzy and indexed in Data Citation Index (retrieved by Web of Science service in December 2021)
Open Research DataThe file contains the number of datasetes published by the reserchers affiliated to Most Wiedzy and indexed in Data Citation Index provided by Web of Science. The Search was performed using the name of institution in the 'address' filed or 'group author' filed . Data retrieved and published during the '5th Open Science Conference (1-3.12.2021).
-
Bibliographic data on datasets affiliated to University of Technology and Humanities in Radom and indexed in Data Citation Inex (retrievd by Web of Science service in December 2021)
Open Research DataThe file contains the number of datasets published by the researchers affiliated to University of Technology and Humanities in Radom and indexed in Data Citation Index provided by Web of Science. The Search was performed using the name of institution in the address field or group author field. Data retrieved and published during the 5th Open Science...
-
Bibliographic data on datasets affiliated to Maria Curie-Skłodowska University and indexed in Data Citation Index (retrieved by Web of Science service in February2022)
Open Research DataThe file contains the number of datasets published by the researchers affiliated to Maria Curie-Skłodowska University and indexed in Data Citation Index provided by Web of Science. The Search was performer using the name of institution in the address field or group author field. Data retrieved and published during the 5th Open Science Conference (1-3.12.2021)
-
Searching by heterogeneous agents
PublicationIn 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...
-
Bibliographic data on datasets affiliated to Gdansk University of Technology and indexed in Data Citation Index (retrieved by Web of Science service in December 21)
Open Research DataThe file contains the number of datasets published by the researchers affiliated to Gdansk University of Technology and indexed in Data Citation Index provided by Web of Science. The Search was performed on the 1st of December 2021 using the name of institution in the 'address' and 'group author' field. Data retrieved and published during the 5th Open...
-
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...
-
Searching by Heterogeneous Agents
PublicationIn 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...
-
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...
-
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...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublicationConsider 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...
-
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...
-
The searchlight problem for road networks
PublicationWe consider the problem of searching for a mobile intruder hiding in a road network given as the union of two or more lines, or two or more line segments, in the plane. Some of the intersections of the road network are occupied by stationary guards equipped with a number of searchlights, each of which can emit a single ray of light in any direction along the lines (or line segments) it is on. The goal is to detect the intruder,...
-
Case Study NEB Atlas / part I - 3D Models / Brunnshög, Lund
Open Research DataThe data presents the results of work on the analysis of contemporary neighbourhoods. The aim of this part of the research was to create a digital model - a simplified digital twin - for selected parts of housing estates already realised in various cities in Europe. This group presents a model for a fragment of the Brunnshög district in Lund, Sweden....
-
Discovering patterns of Web Page Visits from Associaton Rules Viewpoint
PublicationThe popularity of the Internet results from the almost unlimited resources of information stored in it. At the same time, Internet portals have become a widespread source of information and note very large number of visits. The list of web pages opened by users is stored in web servers' log files. Extraction of knowledge on the navigation paths of users has become carefully analyzed problem. Currently, there are a number of algorithms...
-
Polyhedral Ramsey Numbers
PublicationGiven two polygons or polyhedrons P1 and P2, we can transform these figures to graphs G1 and G2, respectively. The polyhedral Ramsey number Rp(G1,G2) is the smallest integer n such that every graph, which represents polyhedron on n vertices either contains a copy of G1 or its complement contains a copy of G2. Using a computer search together with some theoretical results we have established some polyhedral Ramsey numbers, for example...
-
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,...
-
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...
-
Reduced-Cost Design Optimization of High-Frequency Structures Using Adaptive Jacobian Updates
PublicationElectromagnetic (EM) analysis is the primary tool utilized in the design of high-frequency structures. In vast majority of cases, simpler models (e.g., equivalent networks or analytical ones) are either not available or lack accuracy: they can only be used to yield initial designs that need to be further tuned. Consequently, EM-driven adjustment of geometry and/or material parameters of microwave and antenna components is a necessary...
-
Limiting distribution of Lempel Ziv'78 redundancy
PublicationWe show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper [3]. We present a new simplified proof of the Central Limit Theorem for the number of phrases in the LZ'78 algorithm. As in our 1995 paper, here we first analyze the asymptotic behavior of the total path length in a digital search tree (a DST) built from independent sequences....
-
On the Limiting distribution of Lempel Ziv'78 Redundancy for Memoryles Sources
PublicationWe show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper [3]. We present a new simplified proof of the Central Limit Theorem for the number of phrases in the LZ'78 algorithm. As in our 1995 paper, here we first analyze the asymptotic behavior of the total path length in a digital search tree (a DST) built from independent sequences....
-
Initial Considerations
PublicationChemical processes have made use of a wide number of volatile organic solvents due to their efficiency in countless unit operations. The increasing knowledge on the environmental, health, and safety hazards associated to their use has significantly contributed to the search for greener alternatives. The primary purpose of this book is to provide an overview of alternative solvents with reduced issues that have successfully replaced...
-
Magdalena Szuflita-Żurawska
PeopleHead of the Scientific and Technical Information Services at the Gdansk University of Technology Library and the Leader of the Open Science Competence Center. She is also a Plenipotentiary of the Rector of the Gdańsk University of Technology for open science. She is a PhD Candidate. Her main areas of research and interests include research productivity, motivation, management of HEs, Open Access, Open Research Data, information...
-
LOCAL E-MARKETING AND PHARAMACY SELECTION PROCESS AMONG CURRENT AND PROSPECTIVE CONSUMERS
PublicationWORK OBJECTIVES: To examine whether and to what extent a company's presence in Google Search mobile results, and Google Maps service search results, affects pharmacies' acquisition of new consumers RESEARCH QUESTIONS: Does the presence of pharmacies in Google MyBusiness increase the number of their customers ? Is the increase in the...
-
Nested Kriging Surrogates for Rapid Multi-Objective Optimization of Compact Microwave Components
PublicationA procedure for rapid EM-based multi-objective optimization of compact microwave components is presented. Our methodology employs a recently developed nested kriging modelling to identify the search space region containing the Pareto-optimal designs, and to construct a fast surrogate model. The latter permits determination of the initial Pareto set, further refined using a separate surrogate-assisted process. As an illustration,...
-
Utilising AI Models to Analyse the Relationship between Battlefield Developments in the Russian-Ukrainian War and Fluctuations in Stock Market Values
PublicationThis study examines the impact of battlefield developments in the ongoing Russian–Ukrainian war, which to date has lasted over 1000 days, on the stock prices of defence corporations such as BAE Systems, Booz Allen Hamilton, Huntington Ingalls, and Rheinmetall AG. Stock prices were analysed alongside sentiment data extracted from news articles, and processed using machine learning models leveraging natural...
-
Internationalization and Quality Assurance in Higher Education
PublicationInternationalization is an inevitable phenomenon among all contemporary higher education institutions (HEIs) in a globalizing world. It is the driving force for development and progress. In course of the last 30 years, it became an inevitable element of HE management. However, it carries along a number of risks, pitfalls, and organizational challenges. To hedge those, quality assurance (QA) is called to the stage. HEIs therefore...
-
Issues related to noise and protection against noise against the background of hazards present in the working environment
PublicationNoise is one of the physical factors that poses the greatest threat in the working environment. In order to reduce the noise exposure, noise reduction at the source should be considered. Next, the engineering and administrative controls are being developed. Finally, hearing protectors are used. Issues related to protection against noise are part of the topics in the field of occupational...
-
E-Technologies in Teaching Research Methodology for Engineers – a Case Study of the Course for International Postgraduate Students
PublicationThe Research Methodology course for postgraduate students is challenging, even for an experienced academic teacher. The primary objective of this course is to prepare participants to conduct scientific research and publish the results. This case study presents an original teaching method applied to Research Methodology with Emphasis on Engineering Science, for international engineering students at...
-
An Application Supporting Gastroesophageal Multichannel Intraluminal Impedance-pH Analysis
PublicationDue to a significant rise in the number of patients diagnosed with diseases of the upper gastrointestinal tract and the high cost of treatment, there is a need to further research on one of the most popular diagnostic tests used in this case – esophageal Multichannel Intraluminal Impedance and pH measurement. This may lead to finding new diagnostically relevant information, used to quicken and improve the diagnostic procedure....
-
Design specification management with automated decision-making for reliable optimization of miniaturized microwave components
PublicationThe employment of numerical optimization techniques for parameter tuning of microwave components has nowadays become a commonplace. In pursuit of reliability, it is most often carried out at the level of full-wave electromagnetic (EM) simulation models, incurring considerable computational expenses. In the case of miniaturized microstrip circuits, densely arranged layouts with strong cross-coupling effects make EM-driven tuning...
-
Adjusting the Stiffness of Supports during Milling of a Large-Size Workpiece Using the Salp Swarm Algorithm
PublicationThis paper concerns the problem of vibration reduction during milling. For this purpose, it is proposed that the standard supports of the workpiece be replaced with adjustable stiffness supports. This affects the modal parameters of the whole system, i.e., object and its supports, which is essential from the point of view of the relative tool–workpiece vibrations. To reduce the vibration level during milling, it is necessary to...
-
Przedwojenne wydawnictwa Stowarzyszenia Elektryków Polskich w bibliotekach i bibliotekach cyfrowych
PublicationArtykuł przedstawia krótką historię piśmiennictwa z dziedziny elektrotechniki. Po 1918 r. obserwuje się wzrost liczby publikacji, a wraz z rozwojem nauki zwiększa się obszar tematyczny literatury fachowej. Ogromną zasługę w tym rozwoju miało Stowarzyszenie Elektryków Polskich. W artykule pokazano sposoby wyszukiwania wydawnictw przedwojennych SEP, ich dostępność w bibliotekach, także cyfrowych. Przedstawia w jaki sposób zwiększyć...
-
IN SEARCH OF A NEW EXHIBITION SPACE
PublicationThe 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...
-
Construction of phylogenetic trees with topological constraints
PublicationThis paper proposes a method of reconstruction of phylogenetic trees based on heuristic search with topological constraints. Using topological constraints it is possible to reduce the set of solutions as well as to enforce that the result is consistent with a given hypothesis about the evolution process within some group of species. Along with this work a number of algorithms used for phylogenetic analysis were implemented. Those...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Using Minimum Actuators to Control Shape and Stress of a Double Layer Spherical Model Under Gravity and Lateral Loadings
PublicationSpherical domes are picturesque structures built in developed countries to attract tourists. Due to horizontal and vertical overloading, the structures’ attractive shapes may be disturbed, and some members' stress may exceed the elastic level. In this paper, the shape and stress of a deformed double-layer spherical numerical model due to simultaneous lateral and vertical loadings are controlled, meanwhile, the number of actuators...
-
Testing Topological Conjugacy of Time Series
PublicationThis paper considers a problem of testing, from a finite sample, a topological conjugacy of two trajectories coming from dynamical systems (X, f ) and (Y, g). More precisely, given x1, . . . , xn \subset X and y1, . . . , yn \subset Y such that xi+1 = f (xi) and yi+1 = g(yi) as well as h : X \rightarrow Y, we deliver a number of tests to check if f and g are topologically conjugated via h. The values of the tests are close to...