Wyszukiwarka
Filtry
wszystkich: 653
wybranych: 528
-
Katalog
- Publikacje 528 wyników po odfiltrowaniu
- Czasopisma 9 wyników po odfiltrowaniu
- Konferencje 19 wyników po odfiltrowaniu
- Osoby 9 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 4 wyników po odfiltrowaniu
- Wydarzenia 2 wyników po odfiltrowaniu
- Dane Badawcze 80 wyników po odfiltrowaniu
Filtry wybranego katalogu
Wyniki wyszukiwania dla: BIPARTITE GRAPH
-
On-line Search in Two-Dimensional Environment
PublikacjaWe 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...
-
A city is not a tree: a multi-city study on street network and urban life
PublikacjaChristopher Alexander, a British-American scholar, differentiated an old (natural) city from a new (planned) one by structure. The former resembles a “semilattice”, or a complex system encompassing many interconnected sub-systems. The latter is shaped in a graph-theoretical “tree”, which lacks the structural complexity as its sub-systems are compartmentalized into a single hierarchy. This structural distinction explains why, or...
-
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...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
The Snow Team Problem
PublikacjaWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
Asynchronous Networked Estimation System for Continuous Time Stochastic Processes
PublikacjaIn this paper we examine an asynchronous networked estimation system for state estimation of continuous time stochastic processes. Such a system is comprised of several estimation nodes connected using a possibly incomplete communication graph. Each of the nodes uses a Kalman filter algorithm and data from a local sensor to compute local state estimates of the process under observation. It also performs data fusion of local estimates...
-
W-like bound entangled states and secure key distillation
PublikacjaWe construct multipartite entangled states with underlying W-type structuresatisfying positive partial transpose (PPT) condition under any (N −1)|1 partition. Then we showhow to distill a N-partite secure key from the states using two different methods: direct applicationof local filtering and novel random key distillation scheme in which we adopt the idea from recentresults on entanglement distillation. Open problems and possible...
-
Adjusting Game Difficulty by Recreating Behavioral Trees of Human Player Actions
PublikacjaThis paper presents a proposition of a method for adjusting game difficulty to the current level of player's skills in one-on-one games. The method is based on recognition of human player's actions and recording of those actions in the form of behavioral trees. Such trees are later used to drive behaviors of computer-controlled opponents so that human player has beat hit own strategy and improve on it, to win subsequent games....
-
The Complexity of Zero-Visibility Cops and Robber
PublikacjaIn this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.
-
Ontology-Driven Rule-Based Model for an Extension of Information Technology Infrastructure Library Processes
PublikacjaThe aim of this study is to present the stages for building a development model to create information technology (IT) systems for IT service providers. In order to ensure the consistency of the model, a novel solution is proposed where the stages of the model's construction are controlled using ontologies dedicated to the ITIL standard. In this article, a description of models used to assess the provider organization, with particular...
-
Błędy w przedstawianiu wyników pomiarów i wartości wielkości fizycznych popełniane w pracach studenckich
PublikacjaArtykuł powstał na bazie doświadczeń zdobytych podczas pracy dydaktycznej autora jako wykładowcy i nauczyciela akademickiego prowadzącego zajęcia w Laboratorium Podstaw Metrologii. Przytoczono przykłady nieprawidłowości w przedsta-wianiu wyników pomiarów i wartości wielkości fizycznych pochodzące z prac pisemnych studentów i skonfrontowano je z zaleceniami Międzynarodowego Układu Jednostek Miar (SI), oraz polskimi aktami prawnymi.
-
Distributed state estimation using a network of asynchronous processing nodes
PublikacjaWe consider the problem of distributed state estimation of continuous-time stochastic processes using a~network of processing nodes. Each node performs measurement and estimation using the Kalman filtering technique, communicates its results to other nodes in the network, and utilizes similar results from the other nodes in its own computations. We assume that the connection graph of the network is not complete, i.e. not all nodes...
-
Parallel Computations of Text Similarities for Categorization Task
PublikacjaIn this chapter we describe the approach to parallel implementation of similarities in high dimensional spaces. The similarities computation have been used for textual data categorization. A test datasets we create from Wikipedia articles that with their hyper references formed a graph used in our experiments. The similarities based on Euclidean distance and Cosine measure have been used to process the data using k-means algorithm....
-
Distributed state estimation using a network of asynchronous processing nodes
PublikacjaWe consider the problem of distributed state estimation of continuous-time stochastic processes using a~network of processing nodes. Each node performs measurement and estimation using the Kalman filtering technique, communicates its results to other nodes in the network, and utilizes similar results from the other nodes in its own computations. We assume that the connection graph of the network is not complete, i.e. not all nodes...
-
The application of nonlinear curvature sections in the turnout diverging track
PublikacjaThe paper presents the analytical method of modelling the diverging track of railway turnout with nonlinear curvature sections. These sections were used for smoothing the graph of curvature in the extreme areas of turnout. The problem of the curvature distribution was identified with the use of differential equations. The resulting solutions are of universal nature for example the ability of assuming any values of curvature at...
-
Knowledge-based functional safety management using ProSIL software
PublikacjaIn the article the ProSIL software for computer aided functional safety management is presented. The software consists of three modules for the determination of the required SIL level (ProSILen) and verification of the SIL level (ProSILver). In the ProSIL the calibrated knowledge-based risk graph method for determining the required safety integrity level (SIL) of the safety functions identified in hazard analysis is implemented....
-
CRVG - a new model for wireless networks topology generation
PublikacjaThis paper presents a new model of wireless network topology generator. Its main advantage is the possibility of relatively sparse networks generation. Because no iteration is needed, the model can be used for massive generation of networks for testing. The topological properties of produced graphs place them in the class of scale free networks, resembling real ones.
-
Edge-coloring of 3-uniform hypergraphs
PublikacjaWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
Big Data i 5V – nowe wyzwania w świecie danych (Big Data and 5V – New Challenges in the World of Data)
PublikacjaRodzaje danych, składające się na zbiory typu Big Data, to m.in. dane generowane przez użytkowników portali internetowych, dane opisujące transakcje dokonywane poprzez Internet, dane naukowe (biologiczne, astronomiczne, pomiary fizyczne itp.), dane generowane przez roboty w wyniku automatycznego przeszukiwania przez nie Internetu (Web mining, Web crawling), dane grafowe obrazujące powiązania pomiędzy stronami WWW itd. Zazwyczaj,...
-
Development and validation of an LC–MS/MS method for the determination of biogenic amines in wines and beers
PublikacjaBiogenic amines are group of organic, basic, nitrogenous compounds that naturally occur in plant, microorganism, and animal organisms. Biogenic amines are mainly produced through decarboxylation of amino acids. They are formed during manufacturing of some kind of food and beverages such as cheese, wine, or beer. Histamine, cadaverine, agmatine, tyramine, putrescine, and b-phenylethylamine are the most common biogenic amines found...
-
Hat problem on the cycle C4
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly tted with a blue or red hat. Then everybody can try to guess simultanously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
Mitigation of Fake Data Content Poisoning Attacks in NDN via Blockchain
PublikacjaAbstract—Information-centric networks struggle with content poisoning attacks (CPAs), especially their stronger form called Fake Data CPA, in which an intruder publisher uploads content signed with stolen credentials. Following an existing graphinfection based approach leveraging the constrained time when stolen credentials are useful, we design a blockchain-based mitigation scheme for Named Data Networking architectures. We postulate...
-
Trade-offs in multiparty Bell-inequality violations in qubit networks
PublikacjaTwo overlapping bipartite binary input Bell inequalities cannot be simultaneously violated as this would contradict the usual no-signalling principle. This property is known as monogamy of Bell inequality violations and generally Bell monogamy relations refer to trade-offs between simultaneous violations of multiple inequalities. It turns out that multipartite Bell inequalities admit weaker forms of monogamies that allow for violations...
-
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...
-
Clearing directed subgraphs by mobile agents
PublikacjaWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
The complexity of zero-visibility cops and robber
PublikacjaWe consider the zero-visibility cops & robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial...
-
Modeling of the internal combustion engine cooling system
PublikacjaThe article concerns computer modelling of processes in cooling systems of internal combustion engines. Modelling objectives and existing commercial programs are presented. It also describes Author’s own method of binding graphs used to describe phenomena in the cooling system of a spark ignition engine. The own model has been verified by tests on the engine dynamometer. An example of using a commercial program for experimental...
-
On the connected and weakly convex domination numbers
PublikacjaIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
Superadditivity of two quantum information resources
PublikacjaEntanglement is one of the most puzzling features of quantum theory and a principal resource for quantum information processing. It is well known that in classical information theory, the addition of two classical information resources will not lead to any extra advantages. On the contrary, in quantum information, a spectacular phenomenon of the superadditivity of two quantum information resources emerges. It shows that quantum...
-
Research into the Movements of Surface Water Masses in the Basins Adjacent to the Port
PublikacjaThis paper presents the results of the practical and simulation research into determining the routes of movement of small objects moving together with surface water masses in basins adjacent to the port. The results of this research were referenced against the modelling of routes of small objects in port channel basins. The results of practical research concerning the movement of small objects in basins adjacent to the port were...
-
Extending Service Selection Algorithms with Interoperability Analysis
PublikacjaApplication development by integration of existing, atomic services reduces development cost and time by extensive reuse of service components. In Service Oriented Architecture, there exist alternative versions of services supplying the same functionality but differing in Quality of Service (QoS) attributes, which enables developers to select services with optimal QoS. Existing algorithms of service selection focus on the formal...
-
Dobór optymalnej liczby jednostek funcjonalnych dla realizacji syntezy wysokiego poziomu układów cyfrowych
PublikacjaW pracy przedstawiono algorytm MNP (ang. minimization the number of procesing elements) wyznaczający liczbę jednostek funkcjonalnych niezbędnych do syntezy wysokiego poziomu zadania opisanego grafem przepływu danych (DFG - ang. data flow graph). Liczba jednostek funkcjonalnych wyznaczana przez prezentowany algorytm jest optymalna zarówno z punktu widzenia kosztów wykonania układu, jak i szybkości jego działania. Rozwiązanie tego...
-
Eventual Convergence of the Reputation-Based Algorithm in IoT Sensor Networks
PublikacjaUncertainty 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....
-
Applying case studies to teaching architectural investment
PublikacjaCase studies enable students to encounter practical issues during their education. Experiments conducted in class employing this method often feature simplified models of real-world situations. However, they still enable students to encounter actual problems, to which theoretical knowledge is applied. In architectural education, students carrying out semester projects usually rely on data provided by the teacher, without wondering...
-
Independence in uniform linear triangle-free hypergraphs
PublikacjaThe independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.
-
Infographics in Educational Settings: A Literature Review
PublikacjaInfographics are visual representations of data that utilize various graphic elements, including pie charts, bar graphs, line graphs, and histograms. Educators and designers can maximize the potential of infographics as powerful educational tools by carefully addressing challenges and capitalizing on emerging technologies. However, current education systems showcase the need for development guidelines and the best practices targeted...
-
The content of biogenic amines in Rondo and Zweigelt wines and correlations between selected wine parameters
PublikacjaThe purpose of this study was to evaluate the content of biogenic amines (BAs) in wines using dispersive liquid–liquid microextraction–gas chromatography–mass spectrometry (DLLME-GC–MS). An additional objective was to assess the correlations between selected parameters characterizing the samples such as the content of BAs, sugars, and organic acids, pH, and total acidity. Wines produced from the same grape variety in which alcoholic...
-
Factory Acceptance Test – Strain Gauge Measurement, Report no: WOiO /II/123/2014
PublikacjaTested object was 40 meters long jib and its foundation, placed in Gdansk Shiprepair Yard, manufactured by KMK. The contruction was dedicated to the passenger cruise vessel "Quantum of the Seas" The Strain Gauge measurement in different location and load situation was done in order to validate calculation finite element models used during strength analysis for project. The expertise contains: methodology of the measurements, description...
-
Factory Acceptance Test – Strain Gauge Measurement - Report no: WOiO /II/88/2014
PublikacjaTested object was 40 meters long jib and its foundation, placed in Gdansk Shiprepair Yard, manufactured by KMK. The contruction was dedicated to the passenger cruise vessel "North Star" The Strain Gauge measurement in different location and load situation was done in order to validate calculation finite element models used during strength analysis for project. The expertise contains: methodology of the measurements, description...
-
Arch bridges under test loadings
PublikacjaThis paper illustrates experience in arch bridges test loadings of the research team of Department of Structural Mechanics and Bridge Structures from the Gdansk University of Technology. The presented calculations results constist the analysis of spatial construction schemes made using the finite elements method (FEM) and its comparison to the field studies. Arch bridges with the longest spans, visualisation of the computational...
-
Rozwój polskiego winiarstwa w latach 2000–2017
PublikacjaW artykule przedstawiono historie polskiego winiarstwa. Na podstawie danych zawartych w raportach Agencji Rynku Rolnego przedstawiono kształtowanie się liczby winnic oraz powierzchni upraw winorośli i zbioru winogron w latach 2009–2018. Dane z portalu winogrodnicy.pl posłużyły do scharakteryzowania liczby winnic wraz z ich lokalizacją oraz powierzchnią. Z przeprowadzonej analizy wynika, że polskie winiarstwo od ponad 20 lat przeżywa...
-
A model, design, and implementation of an efficient multithreaded workflow execution engine with data streaming, caching, and storage constraints
PublikacjaThe paper proposes a model, design, and implementation of an efficient multithreaded engine for execution of distributed service-based workflows with data streaming defined on a per task basis. The implementation takes into account capacity constraints of the servers on which services are installed and the workflow data footprint if needed. Furthermore, it also considers storage space of the workflow execution engine and its cost....
-
Mitigating Time-Constrained Stolen-Credentials Content Poisoning in an NDN Setting
PublikacjaNDN is a content-centric networking architecture using globally addressable information objects, created by publishers and cached by network nodes to be later accessed by subscribers. Content poisoning attacks consist in the substi-tution by an intruder publisher of bogus objects for genuine ones created by an honest publisher. With valid credentials stolen from an honest publisher, such attacks seem unstoppa-ble unless object...
-
Wpływ struktur wsparcia na efektywność nauczania języka pisanego w środowisku e-learningowym
PublikacjaThe process of knowledge and language skills development during an online course can be very effective if student engagement in learning is achieved. This can be attained by introducing general and specific support mechanisms prior to the commencement of the course and during it. The former relates to the technological aspect, that is to familiarizing students with the functionalities of the virtual learning environment they will...
-
3D Computer Model of the Hip Joint Cartilage
PublikacjaThis paper presents 3D computer model of the hip joint cartilage in the ANSYS program. Model is made on the basis of anatomy and collected data on the material constants of bone and cartilage components. Analysis and comparison of biochemical model, viscoelastic and molecular mixed - aggregation serves to facilitate the creation of the next model of reality, which could be used in the design of joint prostheses. The correctness...
-
Towards Effective Processing of Large Text Collections
PublikacjaIn the article we describe the approach to parallelimplementation of elementary operations for textual data categorization.In the experiments we evaluate parallel computations ofsimilarity matrices and k-means algorithm. The test datasets havebeen prepared as graphs created from Wikipedia articles relatedwith links. When we create the clustering data packages, wecompute pairs of eigenvectors and eigenvalues for visualizationsof...
-
Complementarity between entanglement-assisted and quantum distributed random access code
PublikacjaCollaborative communication tasks such as random access codes (RACs) employing quantum resources have manifested great potential in enhancing information processing capabilities beyond the classical limitations. The two quantum variants of RACs, namely, quantum random access code (QRAC) and the entanglement-assisted random access code (EARAC), have demonstrated equal prowess for a number of tasks. However, there do exist specific...
-
Instrument detection and pose estimation with rigid part mixtures model in video-assisted surgeries
PublikacjaLocalizing instrument parts in video-assisted surgeries is an attractive and open computer vision problem. A working algorithm would immediately find applications in computer-aided interventions in the operating theater. Knowing the location of tool parts could help virtually augment visual faculty of surgeons, assess skills of novice surgeons, and increase autonomy of surgical robots. A surgical tool varies in appearance due to...
-
Comparison of selected algorithms for scheduling workflow applications with dynamically changing service availability
PublikacjaThis paper compares the quality and execution times of several algorithms for scheduling service based workflow applications with changeable service availability and parameters. A workflow is defined as an acyclic directed graph with nodes corresponding to tasks and edges to dependencies between tasks. For each task, one out of several available services needs to be chosen and scheduled to minimize the workflow execution time and...