Filtry
wszystkich: 3682
wybranych: 2419
-
Katalog
- Publikacje 2419 wyników po odfiltrowaniu
- Czasopisma 164 wyników po odfiltrowaniu
- Konferencje 7 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 40 wyników po odfiltrowaniu
- Projekty 5 wyników po odfiltrowaniu
- Kursy Online 34 wyników po odfiltrowaniu
- Wydarzenia 7 wyników po odfiltrowaniu
- Dane Badawcze 1005 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: GLOBAL DEFENSIVE SET
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
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...
-
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...
-
Cops, a fast robber and defensive domination on interval graphs
PublikacjaThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
Renovation works in buildings in the area of former defensive fortifications
Publikacjahe paperpresents the Complex of Buildings which was created in Gdańsk as a result of the reconstruction and development of the remains of the defensive fortifications of Redita Napoleońska. Some of the buildings of the Building Complex, after many years of operation, were in an emergency condition and required urgent renovation and repair work. The papercontains a detailed analysis of the technicalcondition of individual...
-
Proposed concept for the development of residential floating facilities
PublikacjaCurrently, a dynamic growth of interest in residential buildings located on the water can be observed in Poland. However, the lack of legal regulations, the increase in society's affluence and overpopulation in city centers lead to reflection on the development strategy that should be implemented for maritime construction. The publication presents a proposal of four development strategy concepts: aggressive,...
-
An Archaeological - Architectural Documentation Based on Close Range Photogrammetry
PublikacjaWisłoujście Fortress is a historical defensive object located on the southwest coast of the Gulf of Gdańsk. Fort Carre, Eastern Sconce and Ravelin are parts of this postmediaeval fortification. In view of planned regeneration of this fortification complex, at the initiative of the Gdańsk History Museum and Institute of Archaeology and Ethnology of the University of Gdańsk it was decided to perform a documentation of one Fortress...
-
Searching of the buried objects in the sea bottom by means of noninvasive methods
PublikacjaSearching of objects on the seabed or under its surface currently is a challenge for a number of researchers interested in the sea bottom. The problem relates to the objects on the depths of up to several tens of meters from the surface of the seabed. Finding the objects is the subject of interest for a wide group of users starting from archaeologists, and ending on groups interested in marine safety, as well as in military application...
-
Open-Set Speaker Identification Using Closed-Set Pretrained Embeddings
PublikacjaThe paper proposes an approach for extending deep neural networks-based solutions to closed-set speaker identification toward the open-set problem. The idea is built on the characteristics of deep neural networks trained for the classification tasks, where there is a layer consisting of a set of deep features extracted from the analyzed inputs. By extracting this vector and performing anomaly detection against the set of known...
-
Music Genre Recognition in the Rough Set-Based Environment
PublikacjaThe aim of this paper is to investigate music genre recognition in the rough set-based environment. Experiments involve a parameterized music data-base containing 1100 music excerpts. The database is divided into 11 classes cor-responding to music genres. Tests are conducted using the Rough Set Exploration System (RSES), a toolset for analyzing data with the use of methods based on the rough set theory. Classification effectiveness...
-
An absorbing set for the Chialvo map
PublikacjaThe classical Chialvo model, introduced in 1995, is one of the most important models that describe single neuron dynamics. In order to conduct effective numerical analysis of this model, it is necessary to obtain a rigorous estimate for the maximal bounded invariant set. We discuss this problem, and we correct and improve the results obtained by Courbage and Nekorkin (2010). In particular, we provide an explicit formula for an...
-
Formulating a defensive technique to prevent the threat of prohibited reverse engineering
Publikacja -
Photovoltaic demonstration set up
PublikacjaThe use of photovoltaics is growing rapidly in the industry as well as households. Therefore, educating the public will help them understand solar cell technology, which is becoming more common in everyday life. This paper proposes a demonstrational set-up of photovoltaic panel for the purpose of science education. It was used in numerous outreach activities such as science fairs. Moreover, it proved to be a great tool for education...
-
Control of a vapour microturbine set in cogeneration applications
PublikacjaSystems with microturbines are implemented for local generation of heat and electricity. This paper presents the analysis of control concepts for a vapour microturbine set with a generator with permanent magnets, intended to work in small heat and power plants. Control system variants differed by the selection of controlled signals and set parameters. Possible ways of control were discussed and compared with experimentally determined...
-
A Set of Experience-Based Smart Synergy Security Mechanism in Internet of Vehicles
PublikacjaIn this article, we introduce a novel security mechanism, the Smart Synergy Security (3S). The mechanism uses the Set of Experience Knowledge Structure (SOEKS) and the synergy of security methods in different domains to provide the global optimal security strategy. The proposed strategy is taking into account the characteristics of information security (i.e. confidentiality, integrity, availability, controllability, and reviewability)...
-
On bipartization of cubic graphs by removal of an independent set
PublikacjaWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Developing an Ontology from Set of Experience KnowledgeStructure
PublikacjaWhen referring to knowledge forms,collecting for all decision eventsin a knowledge-explicit way becomes a significant ask for any company. Set of experience knowledge structure can assis in accomplishing this purpose.However,after collecting,distributing and sharing that knowledge as adecisional DNA is even a more important advance.Distributing and sharing companies' decisional DNA through an efficient development of Ontologies...
-
Asymptotic behaviour in the set of nonhomogeneous chains of stochastic operators
PublikacjaWe study different types of asymptotic behaviour in the set of (infinite dimensional) nonhomogeneous chains of stochastic operators acting on L1(μ) spaces. In order to examine its structure we consider different norm and strong operator topologies. To describe the nature of the set of nonhomogeneous chains of Markov operators with a particular limit behaviour we use the category theorem of Baire. We show that the geometric structure...
-
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...
-
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...