Filtry
wszystkich: 156
Wyniki wyszukiwania dla: polynomial algorithm.
-
Improved Empirical Coefficients for Estimating Water Vapor Weighted Mean Temperature over Europe for GNSS Applications
PublikacjaDevelopment of the so-called global navigation satellite system (GNSS) meteorology is based on the possibility of determining a precipitable water vapor (PWV) from a GNSS zenith wet delay (ZWD). Conversion of ZWD to the PWV requires application of water vapor weighted mean temperature (Tm) measurements, which can be done using a surface temperature (Ts) and its linear dependency to the Tm. In this study we analyzed up to 24 years...
-
A new hyperbolic-polynomial higher-order elasticity theory for mechanics of thick FGM beams with imperfection in the material composition
PublikacjaA drawback to the material composition of thick functionally graded materials (FGM) beams is checked out in this research in conjunction with a novel hyperbolic‐polynomial higher‐order elasticity beam theory (HPET). The proposed beam model consists of a novel shape function for the distribution of shear stress deformation in the transverse coordinate. The beam theory also incorporates the stretching effect to present an indirect...
-
Solar light driven degradation of textile dye contaminants for wastewater treatment – studies of novel polycationic selenide photocatalyst and process optimization by response surface methodology desirability factor
PublikacjaThe unplanned anthropogenic activities and raced industrial revolution detrimentally causes serious threat to terrestrial and aquatic life. A high discharge of wastewater from industries using dyes affects living organisms and the environment. This paper presents studies on polycationic selenides (PCS) synthesized by hydrothermal methods for photocatalytic degradation of dyes. The synthesized PCS were confirmed by various characterization...
-
Historical carpentry corner log joints—Numerical analysis within stochastic framework
PublikacjaThe paper presents the results of numerical analysis performed on historical, traditional carpentry corner logjoints of two basic topologies: the short-corner dovetail connection and the saddle notch connection. These types of carpentry joints are commonly used in currently preserved objects of wooden architecture. All connections have been modelled in pinewood, which has been defined in the Finite Element software MSC.Marc/Mentat...
-
Measured and predicted freeze-thaw days frequencies in climate change conditions in central Poland
PublikacjaThe rate of progression of geomorphological phenomena is greatly influenced by freeze-thaw processes. In the face of air temperature increasing over the past few decades, a question of the future impact of these processes arises, notably in the temperate and cold climate zones. Using the mean, maximum and minimum daily air temperature data in the period 1951–2018 obtained from three weather stations located in the vicinity of Jeziorsko...
-
On a 3D material modelling of smart nanocomposite structures
PublikacjaSmart composites (SCs) are utilized in electro-mechanical systems such as actuators and energy harvesters. Typically, thin-walled components such as beams, plates, and shells are employed as structural elements to achieve the mechanical behavior desired in these composites. SCs exhibit various advanced properties, ranging from lower order phenomena like piezoelectricity and piezomagneticity, to higher order effects including flexoelectricity...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Bridge Non-Destructive Measurements Using a Laser Scanning during Acceptance Testing: Case Study
PublikacjaOwing to the recent proliferation of inventory works on roads and railways, bridge acceptance tests have increased exponentially. These tests’ results are often misinterpreted owing to the use of various measuring equipment types, rendering integrated interpretation problematic. It is also problematic that adjusting the measurement method is difficult when the structure’s response to load is uncertain. Therefore, it is important...
-
Towards Changes of Macro-Economic Structures in Middle Eastern Countries. Empirical Evidence for 1970–2018
PublikacjaMiddle East countries share a wide bundle of specific structural economic features and one of the latest is a high dependency of these economies on fossil fuels, which is quantitatively demonstrated through the share of oil and gas revenues in total export, but also in gross domestic product composition. This high economic dependency on natural resources on one hand has recently generated a material wealth of Middle Eastern countries...
-
Fast collaborative graph exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Normal-form preemption sequences for an open problem in scheduling theory
PublikacjaStructural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems,...
-
Fast Collaborative Graph Exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
On the derivatives $\partial^{2}P_{\nu}(z)/\partial\nu^{2}$ and $\partial Q_{\nu}(z)/\partial\nu$ of the Legendre functions with respect to their degrees
PublikacjaWe provide closed-form expressions for the degree-derivatives $[\partial^{2}P_{\nu}(z)/\partial\nu^{2}]_{\nu=n}$ and $[\partial Q_{\nu}(z)/\partial\nu]_{\nu=n}$, with $z\in\mathbb{C}$ and $n\in\mathbb{N}_{0}$, where $P_{\nu}(z)$ and $Q_{\nu}(z)$ are the Legendre functions of the first and the second kind, respectively. For $[\partial^{2}P_{\nu}(z)/\partial\nu^{2}]_{\nu=n}$, we find that % \begin{displaymath} \frac{\partial^{2}P_{\nu}(z)}{\partial\nu^{2}}\bigg|_{\nu=n} =-2P_{n}(z)\Li_{2}\frac{1-z}{2}+B_{n}(z)\ln\frac{z+1}{2}+C_{n}(z), \end{displaymath} % where...
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
PublikacjaW artykule rozważamy listowo-kosztowe kolorowanie wierzchołków i krawędzi grafu w modelu wierzchołkowym, krawędziowym, totalnym i pseudototalnym. Stosujemy programowanie dynamiczne w celu otrzymania algorytmów wielomianowych dla drzew. Następnie uogólniamy to podejście na dowolne grafy z ograniczonymi liczbami cyklomatycznymi i na ich multikolorowania.
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Equitable colorings of some variation of corona products of cubic graphs
PublikacjaThe 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.