Search
Filters
total: 513
filtered: 439
Chosen catalog filters
Search results for: INDEPENDENT SET
-
On bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublicationA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
2-outer-independent domination in graphs
PublicationWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
Independent Domination Subdivision in Graphs
PublicationA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
On trees with equal domination and total outer-independent domination numbers
PublicationFor 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...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublicationFor 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...
-
An upper bound on the 2-outer-independent domination number of a tree
PublicationA 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
An upper bound for the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
A lower bound on the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For 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...
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $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...
-
Common Independence in Graphs
PublicationAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Graphs with isolation number equal to one third of the order
PublicationA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Device-independent quantum key distribution based on measurement inputs
PublicationWe provide an analysis of a family of device-independent quantum key distribution (QKD) protocols that has the following features. (a) The bits used for the secret key do not come from the results of the measurements on an entangled state but from the choices of settings. (b) Instead of a single security parameter (a violation of some Bell inequality) a set of them is used to estimate the level of trust in the secrecy of the key....
-
Digital phase-location system for marine applications
PublicationThis paper presents concept and implementation of digital phase-location system, designed as a navigational aid for marine applications. Main feature of proposed system is the ability to work in both synchronous mode, with one master station and set of slave stations synchronized with master, and in asynchronous mode with independent clocking of all stations.
-
Asynchronous phase-location system
PublicationThis paper presents concept and implementation of digital phase-location system, designed as a navigational aid for marine applications. The main feature of the proposed system is the ability to work in both synchronous mode, with one master station and set of slave stations synchronised with master, and in asynchronous mode with independent clocking of all stations.
-
Phase-difference positioning in asynchronous system
PublicationThis paper presents concept and implementation of digital positioning system based on phase difference measurements, designed as a navigational aid for marine applications. Main feature of proposed system is the ability to work in both synchronous mode, with one master station and set of slave stations synchronized with master, and in asynchronous mode with independent clocking of all stations.
-
Hybrid no-signaling-quantum correlations
PublicationFundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the...
-
Elemental and tight monogamy relations in nonsignaling theories
PublicationPhysical principles constrain the way nonlocal correlations can be distributed among distant parties. These constraints are usually expressed by monogamy relations that bound the amount of Bell inequality violation observed among a set of parties by the violation observed by a different set of parties. We prove here that much stronger monogamy relations are possible for nonsignaling correlations by showing how nonlocal correlations...
-
Full scattering profile of circular optical phantoms mimicking biological tissue
PublicationHuman tissue is one of the most complex optical media since it is turbid and nonhomogeneous. In our poster, we suggest a new type of skin phantom and an optical method for sensing physiological tissue condition, basing on the collection of the ejected light at all exit angles, to receive the full scattering profile. Conducted experiments were carried out on an unique set-up for noninvasive encircled measurement. Set-up consisted...
-
Linux scheduler improvement for time demanding network applications, running on Communication Platform Systems
PublicationCommunication Platform Systems as ex. ATCA standard blades located in standardized chassis provides high level communication services between system peripherals. Each ATCA blade brings dedicated functionality to the system but can as well exist as separated host responsible for servicing set of task. According to platform philosophy these parts of system can be quite independent against another solutions provided by competitors....
-
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Gaining knowledge through experience: developing decisional DNA applications in robotics
PublicationOmówiono nowatorskie podejscie do zastosowania wiedzy opartej na doświadczeniu i budowie decyzyjnego DNA w obszarach związanych z robotyką.In this article, we explore an approach that integrates Decisional DNA, a domain-independent, flexible, and standard knowledge representation structure, with robots in order to test the usability and suitability of this novel knowledge representation structure. Core issues in using this Decisional...
-
Texture Features for the Detection of Playback Attacks: Towards a Robust Solution
PublicationThis paper describes the new version of a method that is capable of protecting automatic speaker verification (ASV) systems from playback attacks. The presented approach uses computer vision techniques, such as the texture feature extraction based on Local Ternary Patterns (LTP), to identify spoofed recordings. Our goal is to make the algorithm independent from the contents of the training set as much as possible; we look for the...
-
The Influence of Selecting Regions from Endoscopic Video Frames on The Efficiency of Large Bowel Disease Recognition Algorithms
PublicationThe article presents our research in the field of the automatic diagnosis of large intestine diseases on endoscopic video. It focuses on the methods of selecting regions of interest from endoscopic video frames for further analysis by specialized disease recognition algorithms. Four methods of selecting regions of interest have been discussed: a. trivial, b. with the deletion of characteristic, endoscope specific additions to the...
-
The Potential of Greed for Independence
PublicationThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
Biometric identity verification
PublicationThis chapter discusses methods which are capable of protecting automatic speaker verification systems (ASV) from playback attacks. Additionally, it presents a new approach, which uses computer vision techniques, such as the texture feature extraction based on Local Ternary Patterns (LTP), to identify spoofed recordings. We show that in this case training the system with large amounts of spectrogram patches may be difficult, and...
-
Experimental results of full scattering profile from finger tissue-like phantom
PublicationHuman tissue is one of the most complex optical media since it is turbid and nonhomogeneous. We suggest a new optical method for sensing physiological tissue state, based on the collection of the ejected light at all exit angles, to receive the full scattering profile. We built a unique set-up for noninvasive encircled measurement. We use a laser, a photodetector and finger tissues-mimicking phantoms presenting different optical...
-
Universal and contextualized public services: Digital public service innovation framework
PublicationIn view of the rising social and economic inequalities, public service delivery should be both universal, i.e. independent of the recipients' social or economic status, and contextualized, i.e. able to compensate for different local needs and conditions. Reconciling both properties requires various forms of innovations, chief among them innovations in digital public services. Building upon the four-stage model underpinning the...
-
On Dynamic Extension of a Local Material Symmetry Group for Micropolar Media
PublicationFor micropolar media we present a new definition of the local material symmetry group considering invariant properties of the both kinetic energy and strain energy density under changes of a reference placement. Unlike simple (Cauchy) materials, micropolar media can be characterized through two kinematically independent fields, that are translation vector and orthogonal microrotation tensor. In other words, in micropolar continua...
-
Analysis of server-side and client-side Web-GIS data processing methods on the example of JTS and JSTS using open data from OSM and geoportal
PublicationThe last decade has seen a rapid evolution of processing, analysis and visualization of freely available geographic data using Open Source Web-GIS. In the beginning, Web-based Geographic Information Systems employed a thick-client approach which required installation of platform-specific browser plugins. Later on, research focus shifted to platform-independent thin client solutions in which data processing and analysis was performed...
-
Trade-offs in multiparty Bell-inequality violations in qubit networks
PublicationTwo 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...
-
Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario
PublicationOne of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations stronger than possible in classical physics. In addition to their theoretical significance, non-local correlations have practical applications, such as device-independent randomness generation, providing...
-
An interactive system for remote modeling and design validation of hybrid photovoltaic systems
PublicationAbstract: A multi-functional demonstrator of the interactive system is presented. The demostrator enables modeling, monitoring and design validation of hybrid photovoltaic systems assisted by fuel cells and thermoelectric generators, as well as experimentation and scientific research. A block diagram of the system is presented and the selection of its components is discussed. Availability of the system via Ethernet or GSM...
-
The Decisional DNA-Based Smart Bike for Internet of Things
PublicationIn this paper, we introduce a novel application of the Internet of Things, the Decisional DNAbased Smart Bike. The Decisional DNA is a domain-independent, flexible and standard knowledge representation structure; it allows its domains to acquire and store experiential knowledge and formal decision events in an explicit way. By using Decisional DNA, the sensor-equipped bicycle is able to learn its user’s weight, riding habits, etc....
-
Polynomial analysis as a new way of describing dynamic impedance spectra – Differential and relative impedance spectra
PublicationModel measurements of an equivalent electrical system were carried out using the technique of Dynamic Electrochemical Impedance Spectroscopy. The measurement took the form of potentiodynamic changes imposed on the tested system. Using the possibility of continuous impedance measurements, an attempt was made to develop an original and innovative method of analyzing impedance spectrograms, which is termed polynomial analysis. As...
-
Multi-objective design optimization of antenna structures using sequential domain patching with automated patch size deter-mination
PublicationIn this paper, a simple yet efficient and reliable technique for fully automated multi-objective design optimization of antenna structures using sequential domain patching (SDP) is discussed. The optimization procedure according to SDP is a two-step process: (i) obtaining the initial set of Pareto-optimal designs representing the best possible trade-offs between considered conflicting objectives, and (ii) Pareto set refinement...
-
CERTIFICATION SYSTEM AS A TOOL FOR IMPROVING THE SAFETY AND SUSTAINABILITY OF SCHOOL-RELATED TRAVELS
PublicationDespite the well-established physical, social, emotional, cognitive, and spatial benefits of active and autonomous school commuting of children and adolescents', many are driven by car. Pilot surveys and field research held in 2019 in 10 Gdansk primary schools confirmed this trend. The article presents a certification system for schools, commissioned by the City of Gdańsk, which is an element of a systemic solution shaping patterns...
-
No Quantum Realization of Extremal No-Signaling Boxes
PublicationThe study of quantum correlations is important for fundamental reasons as well as for quantum communication and information processing tasks. On the one hand, it is of tremendous interest to derive the correlations produced by measurements on separated composite quantum systems from within the set of all correlations obeying the no-signaling principle of relativity, by means of information-theoretic principles. On the other hand,...
-
Radio Channel Measurements in 868 MHz Off-Body Communications in a Ferry Environment
PublicationIn this paper, a characterization of the 868 MHz off-body radio channel in BANs is presented. Measurements were carried out in a ferry environment using a specific set-up. A method for path loss using radio distance measurements (RDMs) was developed. It allows to automate the measurements process and make it independent from the variable speed of a moving person. Based on the observed path loss as a function of distance, the obtained...
-
Amplifying the Randomness of Weak Sources Correlated With Devices
PublicationThe problem of device-independent randomness amplification against no-signaling adversaries has so far been studied under the assumption that the weak source of randomness is uncorrelated with the (quantum) devices used in the amplification procedure. In this paper, we relax this assumption, and reconsider the original protocol of Colbeck and Renner using a Santha-Vazirani (SV) source. To do so, we introduce an SV-like condition...
-
Viewpoint independent shape-based object classification for video surveillance
PublicationA method for shape based object classification is presented.Unlike object dimension based methods it does not require any system calibration techniques. A number of 3D object models are utilized as a source of training dataset for a specified camera orientation. Usage of the 3D models allows to perform the dataset creation process semiautomatically. The background subtraction method is used for the purpose of detecting moving objects...
-
Chronographic Imprint of Age-Induced Alterations in Heart Rate Dynamical Organization
PublicationBeat-to-beat changes in the heart period are transformed into a network of increments between subsequent RR-intervals, which enables graphical descriptions of short-term heart period variability. Three types of such descriptions are considered: (1) network graphs arising from a set of vertices and directed edges, (2) contour plots of adjacency matrices A, representing the networks and transition matrices T, resulting from A, and (3)...
-
Enhanced uniform data sampling for constrained data‐driven modeling of antenna input characteristics
PublicationData-driven surrogates are the most popular replacement models utilized in many fields of engineering and science, including design of microwave and antenna structures. The primary practical issue is a curse of dimensionality which limits the number of independent parameters that can be accounted for in the modelling process. Recently, a performance-driven modelling technique has been proposed where the constrained domain of the...
-
Design-Oriented Constrained Modeling of Antenna Structures
PublicationFast surrogate models are crucially important to reduce the cost of design process of antenna structures. Due to curse of dimensionality, standard (data-driven) modeling methods exhibit serious limitations concerning the number of independent geometry parameters that can be handled but also (and even more importantly) their parameter ranges. In this work, a design-oriented modeling framework is proposed in which the surrogate is...
-
Daylighting Education in Practice Verification of a new goal within a European knowledge investigation
PublicationTwo independent surveys were conducted in 2017 and in 2018 among architecture students across Europe to investigate their knowledge on daylighting and the impact of that knowledge on the visual perception of daylit spaces. A total of 600 responders were involved. This paper presents findings from the second survey, which was distributed in six European countries. Based on the findings from the first survey, a new goal was set for...
-
AN INTELLIGENT SYSTEM TO SUPPORT THE DESIGN PROCESS OF HYBRID PHOTOVOLTAIC INSTALLATIONS
PublicationThe paper presents the final version of intelligent system to support the design process of hybrid photovoltaic systems supported by fuel cells and / or thermoelectric generators developed and constructed at the Institute of Electron Technology, as well as to conduct experiments and research. A block diagram of the system and the selection of its components is described and discussed. The paper considers the availability of the...