Wyszukiwarka
Filtry
wszystkich: 602
-
Katalog
- Publikacje 462 wyników po odfiltrowaniu
- Czasopisma 13 wyników po odfiltrowaniu
- Konferencje 21 wyników po odfiltrowaniu
- Osoby 10 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Kursy Online 13 wyników po odfiltrowaniu
- Wydarzenia 2 wyników po odfiltrowaniu
- Dane Badawcze 80 wyników po odfiltrowaniu
Wyniki wyszukiwania dla: GRAPH CHROMATIC GAME
-
Crowdsourcing-Based Evaluation of Automatic References Between WordNet and Wikipedia
PublikacjaThe paper presents an approach to build references (also called mappings) between WordNet and Wikipedia. We propose four algorithms used for automatic construction of the references. Then, based on an aggregation algorithm, we produce an initial set of mappings that has been evaluated in a cooperative way. For that purpose, we implement a system for the distribution of evaluation tasks, that have been solved by the user community....
-
Zastosowanie odcinków nieliniowej krzywizny w torze zwrotnym rozjazdu kolejowego
PublikacjaW pracy została przedstawiona analityczna metoda kształtowania toru zwrotnego rozjazdu kolejowego posiadającego na swojej długości odcinki nieliniowej krzywizny. Odcinki te służą łagodzeniu wykresu krzywizny w skrajnych strefach rozjazdu W omawianej metodzie dokonano identyfikacji problemu rozkładu krzywizny za pomocą równań różniczkowych. Uzyskane rozwiązania mają charakter uniwersalny; m. in. pozwalają na przyjmowanie dowolnych...
-
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...
-
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...
-
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...
-
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublikacjaThe problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...
-
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)...
-
LEVEL OF DETAIL CATEGORIZATION FOR THE APPLICATION IN URBAN DESIGN
PublikacjaUrban planning and urban design involve complex processes that require detailed information about the visual information of a place at various scales. Different graphic tools, such as game engines, are evolving to use urban representation fields. The concept of "level of detail" (LOD) has been used to categorize the level of detail in AEC applications such as BIM and GML for urban representation models. However, there is a need...
-
On evolutionary computing in multi-ship trajectory planning, Applied Intelligence
PublikacjaThe paper presents the updated version of Evolutionary Sets of Safe Ship Trajectories: a method which applies evolutionary algorithms and some of the assumptions of game theory to solving ship encounter situations. For given positions and motion parameters of the ships,the method finds a near optimal set of safe trajectories of all ships involved in an encounter. The method works in real time and the solutions must be returned...
-
STEROWANIE RAMIENIEM ROBOTA Z WYKORZYSTANIEM DANYCH Z KAMERY CYFROWEJ I MECHANIZMÓW SZTUCZNEJ INTELIGENCJI
PublikacjaPierwotnym zamysłem zespołu było stworzenie uniwersalnego systemu grającego w gry planszowe. Mierząc się z tym problemem, postanowiono zrobić jednak coś więcej - wywrócić dotychczasową koncepcję pracy użytkownika z komputerem „do góry nogami” i nie zmuszać użytkownika do nauki interfejsu, a zmusić system do współpracy z interfejsem, który rozumie użytkownik. Dokonane zostało więc przejście ze świata wirtualnego do świata rzeczywistego...
-
Bilateral multi-issue negotiation of execution contexts by proactive document agents
PublikacjaA proactive document can react to its actual environment by autonomously selecting and performing actions integrated into its body and interact with its user. When migrating over a network of execution devices it may encounter diverse execution contexts, each one set up according to temporal characteristics of a receiving device and preferences of its owner. A concept to augment proactive documents with negotiation capability is...
-
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...
-
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...
-
On-line Ramsey Numbers of Paths and Cycles
PublikacjaConsider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some fixed graphs $G$ and $H$. The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the \emph{on-line Ramsey number} $\tilde{r}(G,H)$. In...
-
Comparison of the effectiveness of automatic EEG signal class separation algorithms
PublikacjaIn this paper, an algorithm for automatic brain activity class identification of EEG (electroencephalographic) signals is presented. EEG signals are gathered from seventeen subjects performing one of the three tasks: resting, watching a music video and playing a simple logic game. The methodology applied consists of several steps, namely: signal acquisition, signal processing utilizing z-score normalization, parametrization and...
-
Dynamics of S-unimodal maps used in population modeling.
Dane BadawczeS-unimodal maps are maps of the interval with negative Schwarzian derivative and having only one turning point (such that the map is increasing to the left of the turning point and decreasing to the right of it). Theory of S-unimodal maps is now a well-developed branch of discrete dynamical systems, including famous Singer theorem which implies existence...
-
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....
-
Bipartite theory of graphs: outer-independent domination
PublikacjaLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
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...
-
Global edge alliances in graphs
PublikacjaIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
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....
-
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.
-
Discouraging Traffic Remapping Attacks in Local Ad Hoc Networks
PublikacjaQuality of Service (QoS) is usually provided in ad hoc networks using a class-based approach which, without dedicated security measures in place, paves the way to various abuses by selfish stations. Such actions include traffic remapping attacks (TRAs), which consist in claiming a higher traffic priority, i.e., false designation of the intrinsic traffic class so that it can be mapped onto a higher-priority class. In practice, TRAs...
-
Zróżnicowanie bakterioplanktonu w wodach fiordów Spitsbergenu
PublikacjaPodczas rejsu polarnego latem 2013 roku w ramach projektów naukowych GAME i FACE2FACE zebrano materiał badawczy w dwóch fiordach Spitsbergenu: południowym Hornsund i północnym Kongsfjord. Punkty poboru próbek zlokalizowane były wzdłuż osi fiordów oraz w trójkącie o boku około 1,5 km wyznaczonym przez stacje w głębi fiordów. W zależności od punktu pobrano wodę z od 6 do 10 głębokości: od powierzchni do dna fiordu. Za pomocą fluorescencyjnego...
-
Evolutionary Sets of Cooperating Ship Trajectories: COLREGS Compliance
PublikacjaThe paper presents a newly designed improvement to the method of solving multi-ship encounter situations. In general, the method combines some of the assumptions of game theory with evolutionary programming and aims to find optimal set of cooperating trajectories of all ships involved in an encounter situation. The improvement presented here is a new way of modelling some of the COLREGS rules. Due to this change, the method is...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublikacjaLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
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...
-
The hat problem on a union of disjoint graphs
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player 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 winning. In this version every player...
-
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...
-
Global defensive secure structures
PublikacjaLet S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...
-
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,...
-
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...
-
On the super domination number of lexicographic product graphs
PublikacjaThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublikacjaDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
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...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
Code development of a DSP-FPGA based control platform for power electronics applications
PublikacjaThis paper focuses on the implementation of power electronics algorithms in control platforms based on DSP-FPGA. Today’s power electronics technology demands high power computation with high speed interfacing at the same time. The most popular configuration is a DSP for the former and a FPGA for the latter. The main goal of this work was to develop a generic control system for power electronics application, but it is explained...
-
The complete list of two-dimensional number-conserving ternary cellular automata
Dane BadawczeThis dataset contains a complete list of all 1327 two-dimensional number-conserving cellular automata with the state set {0,1,2} (the so-called ternary cellular automata) based on adjacent cells only, i.e. with the von Neumann neighborhood. The detailed definitions and the method of enumerating are given in the paper:
-
Adopting Collaborative Games into Agile Requirements Engineering
PublikacjaIn agile software development, where great emphasis is put on effective informal communication involving diverse stakeholders, success depends on human and social factors. Not surprisingly, the Agile Manifesto advocates principles and values such as “individuals and interactions over processes and tools”, “focus on the customer”, “collaborate regularly”, “communicate face-to-face within the team” and “have regular team introspection”....
-
Double-Blind Reputation vs. Intelligent Fake VIP Attacks in Cloud-Assisted Interactions
PublikacjaWe consider a generic model of Client-Server interactions in the presence of Sender and Relay, conceptual agents acting on behalf of Client and Server, respectively, and modeling cloud service providers in the envisaged "QoS as a Service paradigm". Client generates objects which Sender tags with demanded QoS level, whereas Relay assigns the QoS level to be provided at Server. To verify an object's right to a QoS level, Relay detects...
-
Improving the prediction of biochar production from various biomass sources through the implementation of eXplainable machine learning approaches
PublikacjaExamining the game-changing possibilities of explainable machine learning techniques, this study explores the fast-growing area of biochar production prediction. The paper demonstrates how recent advances in sensitivity analysis methodology, optimization of training hyperparameters, and state-of-the-art ensemble techniques have greatly simplified and enhanced the forecasting of biochar output and composition from various biomass...
-
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...
-
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...
-
Concept of Multifactor Method and Non-Functional Requirements Solution to Increase Resilience through Functional Safety with Cybersecurity Analysis
PublikacjaIn the process of designing safety systems, an integrated approach in safety and cybersecurity analysis is necessary. The paper describes a new technique of increasing resilience through integrated analysis of functional safety and cybersecurity. It is a modeling methodology based on the combination of the multifactor method utilizing modified risk graphs, used previously for Safety Integrity Level (SIL) assessment, and the Non-Functional...
-
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...
-
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...
-
Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions
PublikacjaAbility to quantify dissimilarity of different phylogenetic trees describing the relationship between the same group of taxa is required in various types of phylogenetic studies. For example, such metrics are used to assess the quality of phylogeny construction methods, to define optimization criteria in supertree building algorithms, or to find horizontal gene transfer (HGT) events. Among the set of metrics described so far in...