Search
Filters
total: 5263
-
Catalog
- Publications 3642 available results
- Journals 27 available results
- Conferences 7 available results
- People 51 available results
- Projects 1 available results
- Research Equipment 1 available results
- e-Learning Courses 23 available results
- Events 1 available results
- Open Research Data 1510 available results
displaying 1000 best results Help
Search results for: EXPONENTIAL MATRIX ALGORITHMDIFFERENTIAL TRANSFORMATION ALGORITHMRUNGE-KUTTA (RK5)BALANCED EQUATIONSERIAL RESERVOIRCONSTANT PARAMETERSINITIAL TEMPERATURE DISTRIBUTION2D GRAPHS
-
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|...
-
ARCHITECTURAL PROGRAMMING FOR BALANCED LOCAL URBAN CENTERS
Publication -
Hybrid dynamically balanced saw frame drive
PublicationW pilarkach ramowych, w których rama piłowa jest napędzana poprzez mechanizm korbowy, generowana przez ramę piłową siła bezwładności oddziaływuje na fundament pilarki oraz na jej układ napędowy. W niniejszym artykule przedstawiono sposób eliminacji tych niekorzystnych zjawisk. Autorzy zaprezentowali dynamicznie wyrównoważony hybrydowy układ napędu ramy piłowej, w którym występuje akumulator energii kinetycznej przyłączony równolegle...
-
Towards Synthetic and Balanced Digital Government Benchmarking
PublicationReliable benchmarking is essential for effective management of the government digitalization efforts. Existing benchmarking instruments generally fail to support this target. One problem is the diversity of instruments, resulting in a split image of digital progress and adding ambiguity to policy decisions. Another problem is disconnect in assessing progress between digital and traditional “analog” governance, lending support to...
-
Balanced Spider Monkey Optimization with Bi-LSTM for Sustainable Air Quality Prediction
PublicationA reliable air quality prediction model is required for pollution control, human health monitoring, and sustainability. The existing air quality prediction models lack efficiency due to overfitting in prediction model and local optima trap in feature selection. This study proposes the Balanced Spider Monkey Optimization (BSMO) technique for effective feature selection to overcome the local optima trap and overfitting problems....
-
Deterministic Rendezvous in Restricted Graphs
PublicationIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...
-
Three-fast-searchable graphs
PublicationIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
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.
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublicationWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Chromatic cost coloring of weighted bipartite graphs
PublicationGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
THIRD-ORDER EXPONENTIAL INTEGRATOR FOR LINEAR KLEIN–GORDON EQUATIONS WITH TIME AND SPACE-DEPENDANT MASS
PublicationAllowing for space- and time-dependance of mass in Klein–Gordon equations re- solves the problem of negative probability density and of violation of Lorenz covariance of interaction in quantum mechanics. Moreover it extends their applicability to the domain of quantum cosmology, where the variation in mass may be accompanied by high oscillations....
-
THIRD-ORDER EXPONENTIAL INTEGRATOR FOR LINEAR KLEIN–GORDON EQUATIONS WITH TIME AND SPACE-DEPENDANT MASS
PublicationAllowing for space- and time-dependance of mass in Klein–Gordon equations re- solves the problem of negative probability density and of violation of Lorenz covariance of interaction in quantum mechanics. Moreover it extends their applicability to the domain of quantum cosmology, where the variation in mass may be accompanied by high oscillations....
-
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...
-
Equitable coloring of corona multiproducts of graphs
PublicationWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
The Backbone Coloring Problem for Small Graphs
PublicationIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
-
Block graphs with large paired domination multisubdivision number
PublicationThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
The role of organic and mineral constituents on kerogen transformation ratio
PublicationThe main aim of this dissertation is to determine the role of mineral and organic matter constituents in kerogen transformation ratio. Practical aspects of the work include application of the results in the assessment of hydrocarbon production potential; to make process of hydrocarbon recovery more predictable consistent and efficient. The work used shale from the Vaca Muerta formation from the Nequen basin in Argentina. The formation...
-
Global defensive sets in graphs
PublicationIn 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...
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Don't forget the dark side of green transformation
PublicationDesign/methodology/approach – The study is a continuation of the research by Durst and Zieba (2019) related to knowledge risks and their potential outcomes. This present study makes an update on the literature on knowledge risks and green transformation and describes knowledge risks that can be faced in this process. Originality/value – The paper offers new insights for researchers dealing with the topic of knowledge risks in...
-
Finite element matrix generation on a GPU
PublicationThis paper presents an efficient technique for fast generation of sparse systems of linear equations arising in computational electromagnetics in a finite element method using higher order elements. The proposed approach employs a graphics processing unit (GPU) for both numerical integration and matrix assembly. The performance results obtained on a test platform consisting of a Fermi GPU (1x Tesla C2075) and a CPU (2x twelve-core...
-
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)....
-
Interval incidence coloring of subcubic graphs
PublicationIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
On domination multisubdivision number of unicyclic graphs
PublicationThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
Derivation of continuous explicit two-step Runge-Kutta methods oforder three
PublicationW pracy podana jest konstrukcja ciągłych rozszerzeń dla nowych reprezentacji dwukrokowych metod Rungego-Kutty rzędu trzeciego. Podane zostały metody oceny błędu lokalnego metody oraz opisany został sposób implementacji tych metod dla zmiennego kroku. Przeprowadzono szereg eksperymentów numerycznych pokazujących ich efektywność i konkurencyjność dla programu dde23 z Matlabu.
-
Stability analysis of two-step Runge-Kutta methods for delay differential equations
PublicationW pracy badana jest własność stabilności dwukrokowej metody Rungego-Kutty względem liniowego równania testowego o zespolonych współczynnikach. Udowodniono, że jeśli pewne warunki są spełnione to każda A-stabilna dwukrokowa metoda Rungego-Kutty zastosowana do równania różniczkowego z opóźnieniem jest P-stabilna.
-
On-line ranking of split graphs
PublicationA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Trigger-based Model to Assess the Readiness of IT Organizations to Agile Transformation
PublicationThe process of change the method of project management from waterfall to agile is called “agile transformation” (AT). The decision to agile transformation is undertaken based on many different factors. Many companies decide to abandon classic, waterfall methodology for agile without prior analysis. This approach makes the processes of agile transformation is hard to control and frequently the implementation of agile fails. The...
-
CONDITIONS OF THE GREEN TRANSFORMATION. THE CASE OF THE EUROPEAN UNION
PublicationThe main purpose of the paper is to identify the factors that determine the course of green transformation and to assess the current stage and possible directions of change in subsequent years in EU countries. The literature lacks comprehensive studies that show the impact of diverse types of factors on the course of green transformation. For this purpose, two perspectives of the research – economic and environmental – are usually...
-
Tuning matrix-vector multiplication on GPU
PublicationA matrix times vector multiplication (matvec) is a cornerstone operation in iterative methods of solving large sparse systems of equations such as the conjugate gradients method (cg), the minimal residual method (minres), the generalized residual method (gmres) and exerts an influence on overall performance of those methods. An implementation of matvec is particularly demanding when one executes computations on a GPU (Graphics...
-
Nonlinear phenomena of small-scale sound in a gas with exponential stratification
PublicationThe nonlinear dynamics of perturbations, quickly varying in space, with comparatively large characteristic wavenumbers k: k>1/H, is considered. H is the scale of density and pressure reduction in unperturbed gas, as the coordinate (H is the so-called height of the uniform equilibrium gas). Coupling nonlinear equations which govern the sound and the entropy mode in a weakly nonlinear flow are derived. They describe the dynamics...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
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...
-
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Parity vertex colouring of graphs
PublicationA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
Edukacja Balanced Scorecard w Wirtualnej Polsce SA
PublicationAutor opisuje wejście Wirtualnej Polski S.A. w etap edukacji we wdrażaniu Strategicznej Karty Wyników. Wskazuje na aspekty związane z obiegiem informacji na poziomach strategicznym, taktycznym i operacyjnym oraz rozwojem organizacji.
-
Application of the J-matrix method to multichannel scattering
PublicationIn this contribution we describe the multichannel extension to the nonrelativistic J-matrix method, and present differential cross sections for scattering of slow electrons from Argon atoms. Nonrelativistic phase shifts, then the S-matrix and the cross sections have been calculated using newly developed Fortran code, JMATRIX-MULTI.We applied the model Hartree-Fock potential as the scattering potential, which was truncated in the...
-
Matrix Biology Plus
Journals -
Kerogen to bitumen transformation with respect to host rock environment
PublicationResearch focuses on analyzing the role of rock constituents in kerogen transformation. It includes mineral and organic matter characterization, kerogen and bitumen isolation, quantification, and determination of the critical factors of transformation ratio concerning generating mobile versus less mobile hydrocarbons. The results indicate that the ratio mainly depends on the distribution and type of kerogen in the basin, and secondly...
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe 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”,...
-
The paired-domination and the upper paired-domination numbers of graphs
PublicationIn this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
All graphs with paired-domination number two less than their order
PublicationLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Digital transformation and economic growth - DESI improvement and implementation
PublicationThe paper aims to improve the methodology of the Digital Economic and Society Index (DESI), the European Commission’s newest index to assess the development of the digital economy. In particular, we investigate whether methodological changes to the structure of DESI improve its ability to capture the digital transformation of EU economies. Using the sensitivity- based analysis, we check whether the selection of weights of individual...
-
Domination-Related Parameters in Rooted Product Graphs
PublicationAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Runge-Kutta bicharacteristic methods for first order partial functional di- fferential equations
PublicationW pracy prezentujemy nową klasę metod numerycznych dla równań różniczkowo-funkcyjnych. Są to metody bicharakterystyk Rungego-Kutty. Ponadto porównuje-my wprowadzone metody z metodami klasycznymi.