Wyszukiwarka
Filtry
wszystkich: 1772
-
Katalog
- Publikacje 1332 wyników po odfiltrowaniu
- Czasopisma 86 wyników po odfiltrowaniu
- Konferencje 35 wyników po odfiltrowaniu
- Osoby 62 wyników po odfiltrowaniu
- Projekty 6 wyników po odfiltrowaniu
- Kursy Online 58 wyników po odfiltrowaniu
- Wydarzenia 6 wyników po odfiltrowaniu
- Dane Badawcze 187 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: DIGITAL SEARCH TREES
-
Approximate search strategies for weighted trees
PublikacjaW pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
-
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...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
In Search of the Innovative Digital Solutions Enhancing Social Pro-Environmental Engagement
Publikacja -
Phylogenetic trees of genus Oncidium Sw. based on analysis of DNA sequences
Dane BadawczeGenus Oncidium Sw. is widely regarded as a polyphiletic, and the taxonomic boundaries between him and such genera as Odontoglossum Kunth. or Miltonia Lindley remain blurred. The goal of the study was to determine the phylogenetic relationships within the genus Oncidium s.lato based on the DNA sequences analysis. The correlation between molecular data...
-
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...
-
Construction of phylogenetic trees with topological constraints
PublikacjaThis 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...
-
Jacek Stefański prof. dr hab. inż.
OsobyJacek Stefański ukończył studia na Wydziale Elektroniki Politechniki Gdańskiej (PG) w 1993 r. W 2000 r. uzyskał stopień doktora nauk technicznych w dyscyplinie telekomunikacja, w 2012 r. stopień doktora habilitowanego, natomiast w 2020 r. tytuł profesora nauk inżynieryjno-technicznych. Obecnie pracuje na stanowisku profesora w Katedrze Systemów i Sieci Radiokomunikacyjnych (KSiSR) PG. W latach 2005-2009 był zatrudniony w Instytucie...
-
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...
-
Forecasting risks and challenges of digital innovations
PublikacjaForecasting and assessment of societal risks related to digital innovation systems and services is an urgent problem, because these solutions usually contain artificial intelligence algorithms which learn using data from the environment and modify their behaviour much beyond human control. Digital innovation solutions are increasingly deployed in transport, business and administrative domains, and therefore, if abused by a malicious...
-
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...
-
Case Study NEB Atlas / part I - 3D Models / Brunnshög, Lund
Dane BadawczeThe 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....
-
Magdalena Szuflita-Żurawska
OsobyMagdalena Szuflita-Żurawska jest kierownikiem Sekcji Informacji Naukowo-Technicznej na Politechnice Gdańskiej oraz Liderem Centrum Kompetencji Otwartej Nauki przy Bibliotece Politechniki Gdańskiej. Jej główne zainteresowania badawcze koncentrują się w obszarze komunikacji naukowej oraz otwartych danych badawczych, a także motywacji i produktywności naukowej. Jest odpowiedzialna między innymi za prowadzenie szkoleń dla pracowników...
-
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...
-
Case Study NEB Atlas / part I - 3D Models / King's Cross, London
Dane BadawczeThe 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 King's Cross, London, UK. The students...
-
On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources
PublikacjaWe study the Lempel-Ziv'78 algorithm and show that its (normalized) redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper, in particular, by presenting a new simplified proof of the central limit theorem (CLT) for the number of phrases in the LZ'78 algorithm. We first analyze the asymptotic behavior of the total path length in the associated digital search...
-
Detecting Apples in the Wild: Potential for Harvest Quantity Estimation
PublikacjaKnowing the exact number of fruits and trees helps farmers to make better decisions in their orchard production management. The current practice of crop estimation practice often involves manual counting of fruits (before harvesting), which is an extremely time-consuming and costly process. Additionally, this is not practicable for large orchards. Thanks to the changes that have taken place in recent years in the field of image...
-
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...
-
Piotr Krajewski dr
OsobyPiotr Krajewski pracuje jako starszy bibliotekarz w Bibliotece Politechniki Gdańskiej. Jako pracownik Sekcji Informacji Naukowo-Technicznej skupia się przede wszystkim na zagadnieniach związanych z ruchem Open Access oraz rolą repozytoriów instytucjonalnych w jego rozwoju. Jest także autorem artykułów poruszających kwestie standaryzacji statystyk wykorzystania zasobów elektronicznych jak również problematykę „drapieżnych wydawców”....
-
MicroGal Gravity Measurements with MGS-6 Micro-g LaCoste Gravimeter
PublikacjaKnowing the exact number of fruit and trees helps growers to make better decisions about how to manage their production in the orchard and prevent plant diseases. The current practice of yield estimation is to manually count fruit or flowers (before harvesting), which is a very time-consuming and costly process. Moreover it’s not practical for large orchards. It also doesn’t allow to make predictions of plant development in a more...
-
Limiting distribution of Lempel Ziv'78 redundancy
PublikacjaWe 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
PublikacjaWe 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....
-
Przedwojenne wydawnictwa Stowarzyszenia Elektryków Polskich w bibliotekach i bibliotekach cyfrowych
PublikacjaArtykuł 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ć...
-
A Meta-Analysis of Pulse Arrival Time Based Blood Pressure Estimation
PublikacjaThe paper presents a preliminary meta-analysis of the sample correlation between pulse arrival time (PAT) and blood pressure (BP). The aim of the study was to verify sample correlation coefficient between PAT and BP using an affine model BP = a · P AT + b for systolic and diastolic blood pressure. The databases included in the search were the IEEE Xplore Digital Library, Springer Link and Google Scholar. Only papers from 2005 to...
-
Experimental Investigations of Fracture Process Using DIC in Plain and Reinforced Concrete Beams under Bending
PublikacjaThe fracture behaviour of concrete and reinforced concrete beams under quasi-static three-point bending was comprehensively investigated with experiments at laboratory scale. The eight various concrete mixes were tested. The influence of the shape, volume and size of aggregate particles and reinforcement on concrete fracture under bending was studied. Displacements on the surface of concrete beams were measured by means of the...
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / Garnizon district in Gdansk, Poland
Dane BadawczeThe data present the results of the work on the analysis of modern settlements. The goal of this part of the research was to analyze housing estates already in place in various European cities. Analyses were performed in real time using artificial intelligence, and responses were searched for sun hours, daylight potential, noise, wind, and microclimate....
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / BedZED, London
Dane BadawczeThe data presents the results of work on the analysis of contemporary neighbourhoods. The aim of this part of the research was to analysis housing estates already existed in various cities in Europe. The analyses ware done in real time with AI and powered for key factors such as sun hours, daylight potential, noise, wind, and microclimate. These data...
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / Seestadt Aspern, Vienna, Austria
Dane BadawczeThe data present the results of the work on the analysis of modern settlements. The goal of this part of the research was to analyze housing estates already in place in various European cities. Analyses were performed in real time using artificial intelligence, and responses were searched for sun hours, daylight potential, noise, wind, and microclimate....
-
Case Study NEB Atlas / part II - Autodesk Forma (formerly Spacemaker) / Battersea Power Station Development, London
Dane BadawczeThe data presents the results of work on the analysis of contemporary neighbourhoods. The aim of this part of the research was to analysis housing estates already existed in various cities in Europe. The analyses ware done in real time with AI and powered for key factors such as sun hours, daylight potential, noise, wind, and microclimate. These data...
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / ZAC de Bonne, Grenoble, France
Dane BadawczeThe data presents the results of work on the analysis of contemporary neighbourhoods. The aim of this part of the research was to analysis housing estates already existed in various cities in Europe. The analyses ware done in real time with AI and powered for key factors such as sun hours, daylight potential, noise, wind, and microclimate. These data...
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / Brunnshög district in Lund, Sweden
Dane BadawczeThe data presents the results of work on the analysis of contemporary neighbourhoods. The aim of this part of the research was to analysis housing estates already existed in various cities in Europe. The analyses ware done in real time with AI and powered for key factors such as sun hours, daylight potential, noise, wind, and microclimate. These data...
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / Västra Hamnen, Malmö, Sweden.
Dane BadawczeThe data present the results of the work on the analysis of modern settlements. The goal of this part of the research was to analyze housing estates already in place in various European cities. Analyses were performed in real time using artificial intelligence, and responses were searched for sun hours, daylight potential, noise, wind, and microclimate....
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / Hammarby-Sjöstad, Stockholm, Sweden.
Dane BadawczeThe data present the results of the work on the analysis of modern settlements. The goal of this part of the research was to analyze housing estates already in place in various European cities. Analyses were performed in real time using artificial intelligence, and responses were searched for sun hours, daylight potential, noise, wind, and microclimate....
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / Pilestredet Park, Oslo, Norway.
Dane BadawczeThe data present the results of the work on the analysis of modern settlements. The goal of this part of the research was to analyze housing estates already in place in various European cities. Analyses were performed in real time using artificial intelligence, and responses were searched for sun hours, daylight potential, noise, wind, and microclimate....
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / King’s Cross, London, UK.
Dane BadawczeThe data present the results of the work on the analysis of modern settlements. The goal of this part of the research was to analyze housing estates already in place in various European cities. Analyses were performed in real time using artificial intelligence, and responses were searched for sun hours, daylight potential, noise, wind, and microclimate....
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / Oceanhamnen, Helsingborg, Sweden
Dane BadawczeThe data present the results of the work on the analysis of modern settlements. The goal of this part of the research was to analyze housing estates already in place in various European cities. Analyses were performed in real time using artificial intelligence, and responses were searched for sun hours, daylight potential, noise, wind, and microclimate....
-
Case Study NEB Atlas / part II - Autodesk Forma analysis / La Courrouze district in Rennes, France
Dane BadawczeThe data present the results of the work on the analysis of modern settlements. The goal of this part of the research was to analyze housing estates already in place in various European cities. Analyses were performed in real time using artificial intelligence, and responses were searched for sun hours, daylight potential, noise, wind, and microclimate....
-
DATA INTEROPERABILITY AND THE OPEN DATA ECOSYSTEM: ROLES AND RESEARCH AREAS
PublikacjaSustainability and value-creation are considered important parameters to measure the success of an open data system. Unfortunately, existing open data systems are not meeting their promises to achieve a sustainable and value-based open data system. Van Loenen et al. (2021) proposed a sustainable and value-creating open data ecosystem. According to their study, the open data ecosystem needs to be user-driven, inclusive, circular,...
-
Karol Flisikowski dr inż.
OsobyKarol Flisikowski jest profesorem uczelni w Katedrze Statystyki i Ekonometrii, Wydziału Zarządzania i Ekonomii Politechniki Gdańskiej. Jest odpowiedzialny jest za prowadzenie zajęć ze statystyki opisowej i matematycznej (w języku polskim i angielskim), a także badań naukowych w zakresie statystyki społecznej. Był uczestnikiem wielu konferencji o zasięgu krajowym, jak i międzynarodowym, gdzie prezentował wyniki prowadzonych przez...
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
On a matching distance between rooted phylogenetic trees
PublikacjaThe Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach...
-
On the partition dimension of trees
PublikacjaGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Properties of the triset metric for phylogenetic trees
Publikacjathe following paper presents a new polynomial time metric for unrootedphylogenetic trees (based on weighted bipartite graphs and the method ofdetermining a minimum perfect matching) and its properties. also many its properties are presented.
-
Lossless Compression of Binary Trees with Correlated Vertex Names
PublikacjaCompression schemes for advanced data structures have become the challenge of today. Information theory has traditionally dealt with conventional data such as text, image, or video. In contrast, most data available today is multitype and context-dependent. To meet this challenge, we have recently initiated a systematic study of advanced data structures such as unlabeled graphs [1]. In this paper, we continue this program by considering...
-
A Framework for Searching in Graphs in the Presence of Errors
PublikacjaWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Why are trees still such a major hazard to drivers in Poland?
PublikacjaRoadside trees are one of Poland's most serious road safety issues. Since 2009 more than 2800 people have been killed as a result of tree collisions; this represents about 15% of all of Poland's accident fatalities between 2009 and 2013. In some of the country's regions striking a tree caused more than 30% of all road accident fatalities. With no proper regulations, guidelines or examples of good practice, roadside environments...
-
Visual TreeCmp : Comprehensive Comparison of Phylogenetic Trees on the Web
Publikacja1. We present Visual TreeCmp—a package of applications for comparing phylogenetic tree sets. 2. Visual TreeCmp includes a graphical web interface allowing the visualization of compared trees and command line application extended by comparison methods recently proposed in the literature. 3. The phylogenetic tree similarity analysis in Visual TreeCmp can be performed using eighteen metrics, of which 11 are dedicated to rooted trees...
-
Isolation Number versus Domination Number of Trees
PublikacjaIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....