Search
Filters
total: 5350
filtered: 3720
-
Catalog
- Publications 3720 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 24 available results
- Events 1 available results
- Open Research Data 1518 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: EXPONENTIAL MATRIX ALGORITHMDIFFERENTIAL TRANSFORMATION ALGORITHMRUNGE-KUTTA (RK5)BALANCED EQUATIONSERIAL RESERVOIRCONSTANT PARAMETERSINITIAL TEMPERATURE DISTRIBUTION2D GRAPHS
-
Numerical simulation of temperature distribution of heat flow on reservoir tanks connected in a series
PublicationThe flow of temperature distribution through a medium in thermodynamic studies plays an important role in understanding physical phenomena in chemical science and petroleum engineering, while temperature distribution indicates the degree of reaction that must be undergone to obtain the final product. Therefore, this paper aims to present and apply the exponential matrix algorithm (EMA), differential transformation algorithm (DTA),...
-
Verification of the exponential model of body temperature decrease after death in pigs
Publication -
Fatigue life improvement using low transformation temperature weld material with measurement of residual stress
PublicationWelding processes often produce high levels of tensile residual stress. Low transformation temperature (LTT) welding wires utilise phase transformation strains to overcome the thermal contraction of a cooling weld. In this paper, the residual stress within each weld was quantified using the milling/strain gauge method, being the strain change measured as the weldment was milled away. The fatigue tests were conducted under uniaxial...
-
Total Domination Versus Domination in Cubic Graphs
PublicationA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Dynamic F-free Coloring of Graphs
PublicationA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Geminate-pair dissociation yield in systems with exponential energetic disorder — A Monte Carlo study
PublicationGeminate electron–hole recombination in systems with exponential energetic disorder is studied by Monte Carlo method. The field and temperature dependencies of geminate-pair dissociation probability are calculated. It is established that the dissociation yield of carrier pairs depends mainly on the extent of carrier thermalization, which influences the Einstein relationship. The approximate limiting temperature is given by Te =...
-
Consumer Bankruptcy Prediction Using Balanced and Imbalanced Data
PublicationThis paper examines the usefulness of logit regression in forecasting the consumer bankruptcy of households using an imbalanced dataset. The research on consumer bankruptcy prediction is of paramount importance as it aims to build statistical models that can identify consumers in a difficult financial situation that may lead to consumer bankruptcy. In the face of the current global pandemic crisis, the future of household finances...
-
Talents, Competencies and Techniques of Business Analyst: A Balanced Professional Development Program
PublicationThis paper presents preliminary results of action research in which we search for fundamentals of an universal theory of balanced approaches to software process. It is developed on the basis of balanced approach for professional development program for business analysts which integrates approaches oriented on talents, competencies and techniques. This paper includes the description of key concepts in background approaches, components...
-
Trends in Locally Balanced Energy Systems without the Use of Fossil Fuels: A Review
PublicationIn recent years, the idea of the operation of energy systems (power systems, heating systems) has changed significantly. This paper is an overview of locally balanced energy systems without the use of fossil fuels. The paper justifies the concept of local energy balancing in a new energy system that does not use fossil fuels (coal, natural gas, and crude oil), based on European Union guidelines and formal documents as well as the...
-
Temperature Impact of Nitrogen Transformation in Technological System: Vertical Flow Constructed Wetland and Polishing Pond
PublicationThe article describes the results of the research, purpose of which was to evaluate influence of the temperature on the effectiveness of nitrification and denitrification in the sewage treatment system consisting of vertical flow constructed wetland and polishing pond. During the analysed period, the efficiency of removing total nitrogen was low and amounted to 12.7%. In the polishing pond in the summer period, content of total...
-
TRANSFORMATION OF THE BANKING SECTOR AS AN ELEMENT OF ECONOMIC TRANSFORMATION IN SOUTH-EAST EUROPE
PublicationThe issue of stability in economy is essential, both in theoretical as well as in practical discussion. It is especially important in an environment of economic transformation. The aim of the article is to assess the economic stability during the transformation of the south-east region of Europe over a period of 19 years (1996 – 2014), and the mutual relation between the economic stability and the transformation process, including...
-
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,...
-
Dynamic coloring of graphs
PublicationDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Some variations of perfect graphs
PublicationWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
Corrigendum to “Fatigue life improvement using low transformation temperature weld material with measurement of residual stress” [Int. J. Fatigue 164 (2022) 107137]
PublicationWelding processes often produce high levels of tensile residual stress. Low transformation temperature (LTT) welding wires utilise phase transformation strains to overcome the thermal contraction of a cooling weld. In this paper, the residual stress within each weld was quantified using the milling/strain gauge method, being the strain change measured as the weldment was milled away. The fatigue tests were conducted under uniaxial...
-
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...
-
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...
-
Interval incidence coloring of bipartite graphs
PublicationIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
Global edge alliances in graphs
PublicationIn 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...
-
Some Progress on Total Bondage in Graphs
PublicationThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
Algorithms for testing security in graphs
PublicationIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
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...
-
Comparison of the exponential thermal transient parameterization methods with the SMTP method in the unipedicled DIEP flap computer modelling and simulation
PublicationThe aim of this paper is to compare the spatial contrast of the image descriptors obtained via three different thermal transient parameterization methods in Active Dynamic Thermography. The thermal constants and amplitude values of the one- and two- exponential parametrization are compared to the Simplified Magnitude-Temporal Parametrization method (SMTP). The comparison is performed using the data obtained by simulating the cold...
-
On-line P-coloring of graphs
PublicationFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Performance of thermally balanced photovoltaic module
PublicationIntensywność procesu wymiany ciepła na powierzchni modułu fotowoltaicznego ma istotny wpływ na osiąganą przez obciążone ogniwa temperaturę i zależy od zastosowanych materiałów i konstrukcji modułu. Ilość energii elektrycznej wytworzonej przez obciążony moduł fotowoltaiczny spada, gdy mechanizmy promieniowania i konwekcji są zaburzone ze względu na przepływ ciepła w składowych warstwach podłoża. Wartości pojemności cieplnej i opory...
-
A note on total reinforcement in graphs
PublicationIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
On the metric dimension of corona product graphs
PublicationWe give several results on the metric dimension of corona product graphs.
-
Transformation of the Odesa Waterfront
PublicationOdesa is a unique city: it is the third-largest city in Ukraine and the second in the Black sea region. During its short but eventful history, it gathered a variety of cultural layers within its boundaries, what had reflected in its architecture, urban life, and unique accent of its inhabitants. The city`s waterfront is considered to be the Pearl of the Black Sea. Starting with the receiving of the Porto Franco status in 1819,...
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
Human System Interaction in Review: Advancing the Artificial Intelligence Transformation
PublicationThe industrial advancement of human society has been fundamentally driven by diverse ‘systems’ that facilitate ‘human interaction’ within physical, digital, virtual, social and artificial environments, and upon the hyper-connected layers of system-system interactions across these environments. The research and practice of Human System Interaction (HSI) has undergone exponential development due to the enhanced capabilities, increased...
-
The implementation of green transformation through clusters
PublicationThe paper addresses a poorly documented issue in the literature, namely the role of clusters in green transformation, including processes related to green, low-carbon, and circular economies. The purpose was to identify and understand the practices of clusters in this area. The adopted mixed research strategy consisted of both qualitative and quantitative research. Both research phases were conducted in a group of Polish Key National...
-
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...
-
Colorings of the Strong Product of Circulant Graphs
PublicationGraph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.
-
Bondage number of grid graphs
PublicationThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
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')...
-
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,...
-
Edge coloring of graphs of signed class 1 and 2
PublicationRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
The hat problem on a union of disjoint graphs
PublicationThe 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...
-
Determination of electrode impedance by means of exponential chirp signal
Publication -
Determination of electrode impedance by means of exponential chirp signal.
PublicationPrzedstawiona została nowa metoda pomiaru impedancji elektrodowej. Jako pobudzenie zastosowany został niestacjonarny sygnał napięciowy, którego częstotliwość jest ekspotencjalną funkcją czasu. Zastosowanie zmodyfikowanej któtko-czasowej transformaty Fouriera (STFT) w analizie napięciowego pobudzenia i odpowiedzi prądowej pozwala na otrzymanie widma impedancyjnego.
-
On the super domination number of lexicographic product graphs
PublicationThe 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...
-
Color transformation methods for dichromats
PublicationColor blindness is a serious perception problem. Suffering individuals cannot understand messages, which are carrying by many images, especially those, distributed by WWW. In this paper we are proposing three image processing methods to enhance image recognition and understanding by persons with dichromacy. Color difference image is introduced to represent color perception dissimilarity. Two color transformation methods are presented....
-
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|...
-
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...
-
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...
-
ARCHITECTURAL PROGRAMMING FOR BALANCED LOCAL URBAN CENTERS
Publication -
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.