Search
Search results for: omination number, convex sets, cartesian product
-
Conley-Morse graphs for a two-dimensional discrete neuron model (full range)
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Equitable coloring of hypergraphs
PublicationA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
On Computational Aspects of Greedy Partitioning of Graphs
PublicationIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
Influence of datasets decreased by applying reduction and generation methods on Digital Terrain Models
PublicationThe number of point clouds provided by LiDAR technology can be sometimes seen as a problem in development and further processing for given purposes (e.g. Digital Terrain Model (DTM) generation). Therefore, there is still a need to reduce the obtained big datasets. Reducing can be done, inter alia, by reducing the size of the set or by generating the set. This paper presents two variants of the reduction of point clouds in order...
-
Smart Innovation Engineering: Toward Intelligent Industries of the Future
PublicationKnowledge-based Engineering Systems are founded upon integration of knowledge into computer systems and are one of the core requirements for the future Industry 4.0. This paper presents a system called Smart Innovation Engineering (SIE) capable of facilitating product innovation process semi-automatically. It enhances decision-making processes by using the explicit knowledge of formal decision events. The SIE system carries the...
-
Conley-Morse graphs for a non-linear Leslie population model with 2 varying parameters
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Conley-Morse graphs for a non-linear Leslie population model with 3 varying parameters
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Product Graph Invariants with Applications in the Theory of Information
PublicationThere are a large number of graph invariants. In the paper, we consider some of them, e.g. the independence and chromatic numbers. It is well know that we cannot efficiently calculate these numbers for arbitrary graphs. In the paper we present relations between these invariants and concepts from the theory of information. Concepts such as source coding and transmission over a noisy channel with zero probability of error are modeled...
-
Fast Calibration-Free Single-Anchor Indoor Localization Based on Limited Number of ESPAR Antenna Radiation Patterns
Publication— In this article, we investigate how the calibrationfree single-anchor indoor localization algorithm developed for base stations equipped with electronically steerable parasitic array radiator (ESPAR) antennas can further be improved. By reducing the total number of ESPAR antenna radiation patterns used in localization process, one can significantly reduce the time needed for an object localization. Performed localization measurements...
-
Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Generalized Dold sequences on partially-ordered sets
PublicationDold sequences constitute an important class of integer sequences that play an important role in combinatorics, number theory, topology and dynamical systems. We generalize the notion of Dold sequence for the case of partially ordered sets and describe their properties. In particular we give two alternative descriptions of generalized Dold sequences: by some class of elementary sequences as well as by different...
-
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...
-
Musical Instrument Identification Using Deep Learning Approach
PublicationThe work aims to propose a novel approach for automatically identifying all instruments present in an audio excerpt using sets of individual convolutional neural networks (CNNs) per tested instrument. The paper starts with a review of tasks related to musical instrument identification. It focuses on tasks performed, input type, algorithms employed, and metrics used. The paper starts with the background presentation, i.e., metadata...
-
Application of Analytic Signal and Smooth Interpolation in Pulse Width Modulation for Conventional Matrix Converters
PublicationThe paper proposes an alternative and novel approach to the PWM duty cycles computation for Conventional Matrix Converters (CMC) fed by balanced, unbalanced or non–sinusoidal AC voltage sources. The presented solution simplifies the prototyping of direct modulation algorithms. PWM duty cycles are calculated faster by the smooth interpolation technique, using only vector coordinates, without trigonometric functions and angles. Both...
-
Combinatorial scheme of finding minimal number of periodic points for smooth self-maps of simply connected manifolds
PublicationLet M be a closed smooth connected and simply connected manifold of dimension m at least 3, and let r be a fixed natural number. The topological invariant D^m_r [f], defined by the authors in [Forum Math. 21 (2009), 491-509], is equal to the minimal number of r-periodic points in the smooth homotopy class of f, a given self-map of M. In this paper, we present a general combinatorial scheme of computing D^m_r [f] for arbitrary dimension...
-
Evolutionary Sets of Safe Ship Trajectories: problem dedicated operators
PublicationThe paper presents the optimization process of the evolutionary sets of safe ship trajectories method, with a focus on its problem-dedicated operators. The method utilizes a customized evolutionary algorithm to solve a constrained optimization problem. This problem is defined as finding a set of cooperating trajectories (a set is an evolutionary individual) of all the ships involved in the encounter situation. The resulting trajectories...
-
Double bondage in graphs
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) 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, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
Universal construction of genuinely entangled subspaces of any size
PublicationWe put forward a simple construction of genuinely entangled subspaces – subspaces supporting only genuinely multipartite entangled states – of any permissible dimensionality for any number of parties and local dimensions. The method uses nonorthogonal product bases, which are built from totally nonsingular matrices with a certain structure. We give an explicit basis for the constructed subspaces. An immediate consequence of our...
-
Data on LEGO sets release dates and worldwide retail prices combined with aftermarket transaction prices in Poland between June 2018 and June 2023
PublicationThe dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction. The data spans the timeframe from June 2018 to June 2023. The data was obtained from three sources: Brickset.com (LEGO sets retail prices, release dates, and IDs), Lego.com official web page (ID number of each set that was released by Lego, its retail prices, the current status of the set) and promoklocki.pl web page (the retail...
-
Smart Innovation Engineering (SIE): Experience-Based Product Innovation System for Industry 4.0
PublicationThis paper presents a semi-automatic system capable of facilitating product innovation process. This system, known as Smart Innovation Engineering (SIE) system, helps in decision-making by using the explicit knowledge of formal decision events. The SIE system carries the promise to support the innovation processes of manufactured products in a quick and efficient way. It stores and reuses the past decisional events or sets of experiences...
-
Stability of softly switched multiregional dynamic output controllers with a static antiwindup filter: A discrete-time case
PublicationThis paper addresses the problem of model-based global stability analysis of discrete-time Takagi–Sugeno multiregional dynamic output controllers with static antiwindup filters. The presented analyses are reduced to the problem of a feasibility study of the Linear Matrix Inequalities (LMIs), derived based on Lyapunov stability theory. Two sets of LMIs are considered candidate derived from the classical common quadratic Lyapunov...
-
An evaluation and explanation of (in)efficiency in higher education institutions in Europe and the U.S. with the application of two-stage semi-parametric DEA
PublicationIn this study the technical efficiency of number of public European and American HEIs is assessed over a decade. Efficiency scores are determined using nonparametric DEA with different input-output sets and considering different frontiers: global frontier (all HEIs pooled together), regional frontier (Europe and the U.S. having their own frontiers) and country-specific ones. The external factors affecting the degree of HEI inefficiency...
-
Tool Wear Prediction in Single-Sided Lapping Process
PublicationSingle-sided lapping is one of the most effective planarization technologies. The process has relatively complex kinematics and it is determined by a number of inputs parameters. It has been noted that prediction of the tool wear during the process is critical for product quality control. To determine the profile wear of the lapping plate, a computer model which simulates abrasive grains trajectories was developed in MATLAB. Moreover,...
-
Quantum privacy witness
PublicationWhile it is usually known that the mean value of a single observable is enough to detect entanglement or its distillability, the counterpart of such an approach in the case of quantum privacy has been missing. Here we develop the concept of a privacy witness, i.e., a single observable that may detect the presence of the secure key even in the case of bound entanglement. Then we develop the notion of secret-key estimation based...
-
Non-isolating bondage in graphs
PublicationA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
Non-isolating 2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
Towards a classification of networks with asymmetric inputs
PublicationCoupled cell systems associated with a coupled cell network are determined by (smooth) vector fields that are consistent with the network structure. Here, we follow the formalisms of Stewart et al (2003 SIAM J. Appl. Dyn. Syst. 2, 609–646), Golubitsky et al (2005 SIAM J. Appl. Dyn. Syst. 4, 78–100) and Field (2004 Dyn. Syst. 19, 217–243). It is known that two non-isomorphic n-cell coupled networks can determine the same sets of...
-
Filozofować z głębi człowieczeństwa. O fenomenologii Andrzeja Półtawskiego.
PublicationDokonując krytyki tradycji nowożytnego empiryzmu i kartezjańskiego dualizmu Półtawski tworzy realistyczną i dynamiczną interpretację bytu ludzkiego. Przeżywanie, odczuwanie zmysłowe nie jest poślednią odmianą poznania jak i operacją dostarczania jedynie elementów, budulca poznaniu, ale odrębnym sposobem bycia w świecie, jest symbiotycznym kontaktem z otoczeniem, formą życia. Zrywa on radykalnie z tradycją brentanowsko-husserlowską...
-
Przydział narzędzi obróbkowych a efektywność szeregowania zadań produkcyjnych
PublicationThe paper addresses issues concerning the analysis of tool flow within a multi-machine machining cell, designated to small batch manufacturing a definite spectrum of prismatic parts. The approach utilises a method for job and tool allocation to work centres with limited number of machines and capacity of tool resources, based on the analysis of formalised relations: job - tool sets required. Selected allocation strategies are considered...
-
Modeling and simulation of tool cycle in manufacturing cell
PublicationThe paper addresses issues concerning modeling and analysis of tool flow within a three-machine manufacturing cell used for small batch manufacturing of a definite spectrum of prismatic parts. The approach utilizes a method for job and tool allocation to work centers with limited number of machines and capacity of tool resources, based on the analysis of formalized relations: job - tool sets required. Selected tool flow control...
-
Conley-Morse graphs for a two-patch vaccination model
Open Research DataThis dataset contains selected results of rigorous numerical computations described in Section 5 of the paper "Rich bifurcation structure in a two-patch vaccination model" by D.H. Knipl, P. Pilarczyk, G. Röst, published in SIAM Journal on Applied Dynamical Systems (SIADS), Vol. 14, No. 2 (2015), pp. 980–1017, doi: 10.1137/140993934.
-
Strategic balance in graphs
PublicationFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Diagnosis of bearing damage in induction motors by instantaneous power analysis
PublicationResearch of the machine with simulated bearing damages has been carried out, where variable load torque, simulating bearing damage, was introduced. The results show that components which can be used for bearings diagnosis appear in the spectrum of the product of current and supply voltage instantaneous values. These components are easier to identify than the components of current spectrum, which have been used so far in diagnostic...
-
Study of Icosahedral Clusters in Close-packed Simple Liquids
PublicationThe local structure of liquid copper was determined using Steinhardt order parameters, with particular attention paid to icosahedral clusters. The positions of atoms were obtained from three sets of molecular dynamics simulations, with the forces obtained from: the Sutton-Chen (SC) potential, the Naval Research Laboratory total energy tight-binding (NRL-TB) method and the divide-and-conquer learn-on-the-fly (DCLOTF) method, respectively....
-
Toward Fast Calculation of Communication Paths for Resilient Routing
PublicationUtilization of alternate communication paths is a common technique to provide protection of transmission against failures of network nodes/links. However, a noticeable delay is encountered when calculating the relevant sets of disjoint paths using the available algorithms (e.g., using Bhandari’s approach). This, in turn, may have a serious impact on the ability of a network to serve dynamic demands...
-
Characterization of a cryptic plasmid pSFKW33 from Shewanella sp. 33b
PublicationA cryptic plasmid pSFKW33 from psychrotrophic bacterium Shewanella sp. 33B, an isolate from the Gulf of Gdansk (the Baltic Sea), was sequenced and characterized. It is an 8021 bpcircular molecule with 38% GC content, which shows a distinctive nucleotide sequence without homology to other known plasmids. The nucleotide sequence analysis predicts eight open reading frames. The deduced amino acid sequence of ORF-1 shared significant...
-
Preparation and some properties of multiblock copoly(amide-b-amide)s
PublicationThe paper concerns the polymers built of oligoamide hard blocks and oligoamide soft blocks (KPAA, formula I). Oligo(laurolactam) (PA12) was used as hard block and the product of reaction of dimerized fatty acid and hexamethylene diamine (PA6,36) was used as a soft one. Effects of molar ratio of these blocks on the following properties of KPAA have been investigated: limiting viscosity number ([2]), degrees of swelling in water...
-
Trust in Electronic Word-of-Mouth (eWOM): the concept and the most important determinants
PublicationeWOM and trust in it is now the most important factor in determining buyers' purchasing behavior. Familiarity with the determinants of trust establishes the formation of appropriate marketing activities. However, the growing number of new forms of eWOM and its increasingly complex and multidimensional nature have created a lot of confusion. The article aims to organize the concepts related to trust in eWOM, to indicate the most...
-
On root finding algorithms for complex functions with branch cuts
PublicationA simple and versatile method is presented, which enhances the complex root finding process by eliminating branch cuts and branch points in the analyzed domain. For any complex function defined by a finite number of Riemann sheets, a pointwise product of all the surfaces can be obtained. Such single-valued function is free of discontinuity caused by branch cuts and branch points. The roots of the new function are the same as the...
-
An evaluation and explanation of (in)efficiency in higher education institutions in Europe and the U.S. with the application of two-stage semi-parametric DEA
PublicationThis study uses data envelopment analysis (DEA) to evaluate the relative efficiency of 500 higher education institutions (HEIs) in ten European countries and the U.S. for the period between 2000 and 2010. Efficiency scores are determined using different input-output sets (inputs: total revenue, academic staff, administration staff, total number of students; outputs: total number of publications, number of scientific articles, graduates)...
-
Adaptive Hyperparameter Tuning within Neural Network-based Efficient Global Optimization
PublicationIn this paper, adaptive hyperparameter optimization (HPO) strategies within the efficient global optimization (EGO) with neural network (NN)-based prediction and uncertainty (EGONN) algorithm are proposed. These strategies utilize Bayesian optimization and multiarmed bandit optimization to tune HPs during the sequential sampling process either every iteration (HPO-1itr) or every five iterations (HPO-5itr). Through experiments using...
-
Elgold partial: Amazon product reviews
Open Research DataThe dataset contains 34 Amazon product reviews in English. In each text, the named entities are marked. Each name entity is linked to the corresponding Wikipedia if possible. All entities were manually verified by at least three people, which makes the dataset a high-quality gold standard for the evaluation of named entity recognition and linking algorithms.
-
Surface diffusion and cluster formation of gold on the silicon (111)
PublicationPurpose: Investigation of the gold atoms behaviour on the surface of silicon by molecular dynamics simulation method. The studies were performed for the case of one, two and four atoms, as well as incomplete and complete filling of gold atoms on the silicon surface. Design/methodology/approach: Investigations were performed by the method of molecular dynamics simulation using the Large-scale Atomic/Molecular Massively Parallel...
-
On the partition dimension of trees
PublicationGiven 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...
-
EXPERIMENTAL EVALUATION OF DLC/STEEL SLIDING CONTACTS’ OPERATIONAL ENVELOPE
PublicationIn an industrial project concerning sliding bearings, a sliding pair was selected of high alloy steel vs. industrial grade DLC coated high alloy steel as a basis for an innovative design of high performance sliding bearings lubricated with a synthetic oil for use in geared transmission units. The development process required credible data on the ultimate resistance of the sliding pair to very high contact stress. An experimental...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Evolutionary Sets of Safe Ship Trajectories: improving the method by adjusting evolutionary techniques and parameters
PublicationThe paper presents some of the evolutionary techniques used by the evolutionary sets of safe ship trajectories method. In general, this method utilizes a customized evolutionary algorithm to solve a constrained optimization problem. This problem is defined as finding a set of cooperating trajectories (here the set is an evolutionary individual) of all the ships involved in the encounter situation. The resulting trajectories are...
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublicationSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
Computing algebraic transfer entropy and coupling directions via transcripts
PublicationMost random processes studied in nonlinear time series analysis take values on sets endowed with a group structure, e.g., the real and rational numbers, and the integers. This fact allows to associate with each pair of group elements a third element, called their transcript, which is defined as the product of the second element in the pair times the first one. The transfer entropy of two such processes is called algebraic transfer...