Wyszukiwarka
Wyniki wyszukiwania dla: POLYNOMIAL%20CHAOS
-
APPLICATION OF COHEN'S CLASS TIME-FREQUENCY DISTRIBUTIONS IN THE BELOUSOV–ZHABOTINSKY REACTION ANALYSIS
Publikacja -
Double-diffusive natural convection energy transfer in magnetically influenced Casson fluid flow in trapezoidal enclosure with fillets
PublikacjaThe prime motive of this disquisition is to deal with mathematical analysis of natural convection energy transport driven by combined buoyancy effects of thermal and solutal diffusion in a trapezoidal enclosure. Casson fluid rheological constitutive model depicting attributes of viscoelastic liquids is envisioned. The influence of the inclined magnetic field governed by Lorentz field law is also considered. To raise the essence...
-
Inverse Flood Routing Using Simplified Flow Equations
PublikacjaThe paper considers the problem of inverse flood routing in reservoir operation strategy. The aim of the work is to investigate the possibility of determining the hydrograph at the upstream end based on the hydrograph required at the downstream end using simplified open channel flow models. To accomplish this, the linear kinematic wave equation, the diffusive wave equation and the linear Muskingum equation are considered. To achieve...
-
Piotr Bartłomiejczyk dr hab.
OsobyW roku 2014 zostałem zatrudniony w Katedrze Równań Różniczkowych i Zastosowań Matematyki na Wydziale Fizyki Technicznej i Matematyki Stosowanej Politechniki Gdańskiej. Zajmuję się badaniem niezmienników występujących w analizie nieliniowej. W roku 2000 uzyskałem stopień naukowy doktora w zakresie nauk matematycznych w Instytucie Matematycznym Polskiej Akademii Nauk w Warszawie. Uchwałą Rady Wydziału Matematyki, Fizyki i Informatyki...
-
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...
-
Multi-fidelity aerodynamic design trade-off exploration using point-by-point Pareto set identification
PublikacjaAerodynamic design is inherently a multi-objective optimization (MOO) problem. Determining the best possible trade-offs between conflicting aerodynamic objectives can be computationally challenging when carried out directly at the level of high-fidelity computational fluid dynamics simulations. This paper presents a computationally cheap methodology for exploration of aerodynamic design trade-offs. In particular, point-by-point...
-
Testing Stability of Digital Filters Using Multimodal Particle Swarm Optimization with Phase Analysis
PublikacjaIn this paper, a novel meta-heuristic method for evaluation of digital filter stability is presented. The proposed method is very general because it allows one to evaluate stability of systems whose characteristic equations are not based on polynomials. The method combines an efficient evolutionary algorithm represented by the particle swarm optimization and the phase analysis of a complex function in the characteristic equation....
-
Miasto w kontekście uchwał krajobrazowych
PublikacjaKrajobraz miejski jest zjawiskiem wizualnym, które oddaje charakter przestrzeni, a także określa jej tożsamość. Niestety, zagraża mu jednak powszechny chaos, przekładający się na negatywny wizerunek miasta. Za jedną z jego najistotniejszych przyczyn uznaje się ogromną liczbę reklam umieszczanych dowolnie w przestrzeni publicznej. Mimo że informacja wizualna stanowi nieodłączny element współczesnego miasta, istnieje głęboka potrzeba...
-
Periodic and chaotic dynamics in a map‐based neuron model
PublikacjaMap-based neuron models are an important tool in modeling neural dynamics and sometimes can be considered as an alternative to usually computationally costlier models based on continuous or hybrid dynamical systems. However, due to their discrete nature, rigorous mathematical analysis might be challenging. We study a discrete model of neuronal dynamics introduced by Chialvo in 1995. In particular, we show that its reduced one-dimensional...
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
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...
-
Testing Stability of Digital Filters Using Optimization Methods with Phase Analysis
PublikacjaIn this paper, novel methods for the evaluation of digital-filter stability are investigated. The methods are based on phase analysis of a complex function in the characteristic equation of a digital filter. It allows for evaluating stability when a characteristic equation is not based on a polynomial. The operation of these methods relies on sampling the unit circle on the complex plane and extracting the phase quadrant of a function...
-
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...
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublikacjaTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...
-
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...
-
Bounds on the Cover Time of Parallel Rotor Walks
PublikacjaThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node maintains a cyclic ordering of its outgoing arcs, and successively propagates walkers which visit it along its outgoing arcs in...