Search
Filters
total: 71
Search results for: BOUNDED SOLUTIONS
-
Bounded solutions of odd nonautonomous ODE
PublicationBorsuk-Ulam type argument is used in order to prove exstence of nontrivial bounded solutions to some nonautonomous differential euations which are odd with respect to the spatial variable. A Poincare compactification trick is also applied.
-
Existence and uniqueness of monotone and bounded solutions for a finite-difference discretization a` la Mickens of the generalized Burgers–Huxley equation.
PublicationDeparting from a generalized Burgers–Huxley partial differential equation, we provide a Mickens-type, nonlinear, finite-difference discretization of this model. The continuous system is a nonlinear regime for which the existence of travelling-wave solutions has been established previously in the literature. We prove that the method proposed also preserves many of the relevant characteristics of these solutions, such as the positivity,...
-
Database of the illustrative simulations of the nonstandard approximation of the generalized Burgers–Huxley equation
Open Research DataThe presented dataset is a result of numerical analysis of a generalized Burgers–Huxley partial differential equation. An analyzed diffusive partial differential equation consist with nonlinear advection and reaction. The reaction term is a generalized form of the reaction law of the Hodgkin–Huxley model, while the advection is a generalized form of...
-
On the Existence of Homoclinic Type Solutions of a Class of Inhomogenous Second Order Hamiltonian Systems
PublicationWe show the existence of homoclinic type solutions of a class of inhomogenous second order Hamiltonian systems, where a C1-smooth potential satisfies a relaxed superquadratic growth condition, its gradient is bounded in the time variable, and a forcing term is sufficiently small in the space of square integrable functions. The idea of our proof is to approximate the original system by time-periodic ones, with larger and larger...
-
A note on an approximative scheme of finding almost homoclinic solutions for Newtonian systems
PublicationIn this work we will be concerned with the existence of an almost homoclinic solution for a perturbed Newtonian system in a finite dimensional space. It is assumed that a potential is C^1 smooth and its gradient is bounded with respect to a time variable. Moreover, a forcing term is continuous, bounded and squere integrable. We will show that the appproximative scheme due to J. Janczewska for a time periodic potential extends to...
-
Rothe’s method for physiologically structured models with diffusion
PublicationWe consider structured population models with diffusion and dynamic boundary conditions. The respective approximation, called Rothe’s method, produces positive and exponentially bounded solutions. Its solutions converge to the exact solution of the original PDE.
-
Database of the convergence analysis results of the nonstandard approximation of the generalized Burgers–Huxley equation for the solution bounded within [0,1].
Open Research DataThe presented dataset is a result of the convergence analysis of the Mickens-type, nonlinear, finite-difference discretization of a generalized Burgers–Huxley partial differential equation.
-
Monotone iterative method to second order differential equations with deviating arguments involving Stieltjes integral boundary conditions
PublicationWe use a monotone iterative method for second order differential equations with deviating arguments and boundary conditions involving Stieltjes integrals. We establish sufficient conditions which guarantee that such problems have extremal solutions in the corresponding region bounded by lower and upper solutions. We also discuss the situation when problems have coupled quasi-solutions. We illustrate our results by three examples.
-
First-order differential equations with nonlocal boundary conditions
PublicationWe study a first-order boundary value problem subject to some boundary conditions given by Riemann-Stieltjes integrals. Using a monotone iterative method, we formulate sufficient conditions which guarantee the existence of extremal or quasi-solutions in the corresponding region bounded by upper and lower solutions of our problems. The case when a unique solution exists is also investigated. Some examples are given to illustrate...
-
Database of the convergence analysis results of the nonstandard approximation of the generalized Burgers–Huxley equation for the solution bounded within [0, γ^(1/p)].
Open Research DataPresented dataset is a result of the convergence analysis of the Mickens-type, nonlinear, finite-difference discretization of a generalized Burgers–Huxley partial differential equation. The generalized Burgers–Huxley equation is a diffusive partial differential equation with nonlinear advection and diffusion. The boundary problem for this equation possesses...
-
On the convergence of a nonlinear finite-difference discretization of the generalized Burgers–Fisher equation
PublicationIn this note, we establish analytically the convergence of a nonlinear finite-difference discretization of the generalized Burgers-Fisher equation. The existence and uniqueness of positive, bounded and monotone solutions for this scheme was recently established in [J. Diff. Eq. Appl. 19, 1907{1920 (2014)]. In the present work, we prove additionally that the method is convergent of order one in time, and of order two in space. Some...
-
Greencoin information system empowering urban adaptability and eco living choices.
PublicationThere are many gamification projects focused on mitigating climate changes which has been tested or implemented worldwide. However, the gap which remains is the limited number of solutions dedicated for central European countries where the urban polices in terms of climate vulnerability are bounded. On the other hand, cities, when implementing climate-oriented policies, are focused on urban resilience, while the opportunities...
-
On stress singularity near the tip of a crack with surface stresses
PublicationIn the framework of the simplified linear Gurtin–Murdoch surface elasticity we discuss a singularity of stresses and displacements in the vicinity of a mode III crack. We show that inhomogeneity in surface elastic properties may significantly affect the solution and to change the order of singularity. We also demonstrate that implicitly or explicitly assumed symmetry of the problem may also lead to changes in solutions. Considering...
-
Modeling and simulation of blood flow under the influence of radioactive materials having slip with MHD and nonlinear mixed convection
PublicationRadioactive materials are widely in industry, nuclear plants and medical treatments. Scientists and workers in these fields are mostly exposed to such materials, and adverse effects on blood and temperature profiles are observed. In this regard, objective of the current study is to model and simulate blood based nanofluid with three very important radioactive materials, named as Uranium dioxide (UO2), Thorium dioxide (ThO2) and...
-
Zero-visibility cops and robber and the pathwidth of a graph
PublicationWe examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...
-
Equivalence of equicontinuity concepts for Markov operators derived from a Schur-like property for spaces of measures
PublicationVarious equicontinuity properties for families of Markov operators have been – and still are – used in the study of existence and uniqueness of invariant probability for these operators, and of asymptotic stability. We prove a general result on equivalence of equicontinuity concepts. It allows comparing results in the literature and switching from one view on equicontinuity to another, which is technically convenient in proofs....
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublicationThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Bounds on isolated scattering number
PublicationThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Bounds on isolated scattering number
PublicationThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Parseval Wavelet Frames on Riemannian Manifold
PublicationWe construct Parseval wavelet frames in L 2 (M) for a general Riemannian manifold M and we show the existence of wavelet unconditional frames in L p (M) for 1 < p < ∞. This is made possible thanks to smooth orthogonal projection decomposition of the identity operator on L 2 (M), which was recently proven by Bownik et al. (Potential Anal 54:41–94, 2021). We also show a characterization of Triebel–Lizorkin F sp,q (M) and Besov B...
-
Restricted open shop scheduling
PublicationIn the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule)....
-
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.
-
Generalized Dobrushin Coefficients on Banach Spaces
PublicationThe asymptotic behavior of iterates of bounded linear operators (not necessarily positive), acting on Banach spaces, is studied. Through the Dobrushin ergodicity coefficient, we generalize some ergodic theorems obtained earlier for classical Markov semigroups acting on L1 (or positive operators on abstract state spaces).
-
Robust Monitoring of Water Quality in Drinking Water Distribution System
PublicationThe paper develops a novel open loop set bounded observer for robust estimation of water quality in DWDS based on the advanced nonlinear quality dynamics model including disinfections by-products (DBPs). The observer utilises a cooperativeness of the quality dynamics model and is computationally efficient, hence applicable to on-line quality monitoring. The simulation results illustrate its good and sustainable performance.
-
On-Line Partitioning for On-Line Scheduling with Resource Conflicts
PublicationWithin this paper, we consider the problem of on-line partitioning the sequence of jobs which are competing for non-sharable resources. As a result of partitioning we get the subsets of jobs that form separate instances of the on-line scheduling problem. The objective is to generate a partition into the minimum number of instances such that the response time of any job in each instance is bounded by a given constant. Our research...
-
Robustified estimators of radar elevation angle using a specular multipath model
PublicationWe consider the problem of estimating the elevation angle in the presence of multipath. The proposed method belongs to the class of maximum likelihood-like estimators and employs a modified specular reflection model that accounts for the uncertainty of the steering vector by assuming that they are subject to unknown deterministic perturbations with bounded norms. The analysis, performed using convex optimization methods, allows...
-
A Strategy to Locate Fixed Points and Global Perturbations of ODE’s: Mixing Topology with Metric Conditions
PublicationIn this paper we discuss a topological treatment for the planar system z' = f (t, z) + g(t, z) where f and g are T -periodic in time and g(t, z) is bounded. Namely, we study the effect of g(t, z) in two different frameworks: isochronous centers and time periodic systems having subharmonics. The main tool employed in the proofs consists of a topological strategy to locate fixed points in the class of orientation preserving embedding...
-
The cohomological span of LS-Conley index
PublicationIn this paper we introduce a new homotopy invariant – the cohomological span of LS-Conley index. We prove the theorems on the existence of critical points for a class of strongly indefinite functionals with the gradient of the form Lx+K(x), where L is bounded linear and K is completely continuous. We give examples of Hamiltonian systems for which our methods give better results than the Morse inequalities. We also give a formula...
-
A Noether theorem for stochastic operators on Schatten classes
PublicationWe prove that a stochastic (Markov) operator S acting on a Schatten class C_1 satisfies the Noether condition S'(A) = A and S'(A^2) = A^2, where A is a Hermitian bounded linear operator on a complex Hilbert space H, if and only if, S(E(G)XE(G)) = E(G)S(X)E(G) holds true for every Borel subset G of the real line R, where E(G) denotes the orthogonal projection coming from the spectral resolution of A. Similar results are obtained...
-
An absorbing set for the Chialvo map
PublicationThe classical Chialvo model, introduced in 1995, is one of the most important models that describe single neuron dynamics. In order to conduct effective numerical analysis of this model, it is necessary to obtain a rigorous estimate for the maximal bounded invariant set. We discuss this problem, and we correct and improve the results obtained by Courbage and Nekorkin (2010). In particular, we provide an explicit formula for an...
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublicationWe consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublicationLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublicationWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Respiration rate estimation using non-linear observers in application to wastewater treatment plant
PublicationA problem of respiration rate estimation using two new non-linear observers for a wastewater treatment plant is addressed in this paper. In particular, a non-linear adaptive Luenberger-like observer and a super twisting sliding mode observer have been derived to produce stable and bounded estimates of the respiration rate. During the synthesis of the particular observer, an appropriate mathematical utility model was used. The observability...
-
Constructive Controllability for Incompressible Vector Fields
PublicationWe give a constructive proof of a global controllability result for an autonomous system of ODEs guided by bounded locally Lipschitz and divergence free (i.e. incompressible) vector field, when the phase space is the whole Euclidean space and the vector field satisfies so-called vanishing mean drift condition. For the case when the ODE is defined over some smooth compact connected Riemannian manifold, we significantly strengthen...
-
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...
-
Decision-Making Models of the Human-Operator as an Element of the Socio-Technical Systems
PublicationThe authors of the chapter proved that the fundamental intellectual processes, which lie on the basis of decision-making behavior of the human-operator, could be identified on the bases on the analogies with the devices (elements). The basic intellectual processes of the Rational decision-making models can be adequately identified by the transient processes of the PID-controller; the intellectual processes of the Bounded Rationality...
-
The hybrid estimation algorithm for wastewater treatment plant robust model predictive control purposes at medium time scale
PublicationThe paper proposes an approach to designing the hybrid estimation algorithm/module (HEA) with moving measurements window for Wastewater Treatment Plant (WWTP) Robust Model Predictive Control (RMPC) purposes at medium time scale. The RMPC uses a dedicated grey-box model of biological reactor for the system outputs prediction purposes. The grey-box model parameters are dependant on the plant operating point. Hence, these parameters...
-
The saga of a fish: from a survival guide to closing lemmas
PublicationIn the paper by D. Burago, S. Ivanov and A. Novikov, “A survival guide for feeble fish”, it has been shown that a fish with limited velocity can reach any point in the (possibly unbounded) ocean provided that the fluid velocity field is incompressible, bounded and has vanishing mean drift. This result extends some known global controllability theorems though being substantially nonconstructive. We give a fish a different recipe...
-
Structures for parameterization, meshing and data exchange of topologically related surfaces of a ship hull
PublicationThis paper presents proposal of data structures for storage and processing of a parametric three-dimensional model of a midship hull sections. The model consists of coarse surfaces like: decks, frames, girders, stiffeners, brackets, partitions etc. bounded by topological relations. All workshop details are omitted as the model is intended for numeric calculations. Proposed data structures are prepared to facilitate changes in the...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
A note on the Morse homology for a class of functionals in Banach spaces involving the 2p-area functional
PublicationIn this paper we show how to construct Morse homology for an explicit class of functionals involving the 2p-area functional. The natural domain of definition of such functionals is the Banach space W_0^{1,2p}(\Omega), where p > n/2 and \Omega \subet R^n is a bounded domain with sufficiently smooth boundary. As W_0^{1,2p}(\Omega) is not isomorphic to its dual space,critical points of such functionals cannot be non-degenerate...
-
Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements
PublicationIn Software Defined Networks (SDN) packet data switches are configured by a limited number of SDN controllers, which respond to queries for packet forwarding decisions from the switches. To enable optimal control of switches in real time the placement of controllers at network nodes must guarantee that the controller-to-controller and switch-to-controller communications delays are bounded. Apart from the primary controllers that...
-
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
PublicationTwo mobile agents, modeled as points starting at differentlocations of an unknown terrain, have to meet. The terrain is a polygon with polygonal holes. We consider two versions of this rendezvous problem: exact RV, when the points representing the agents have to coincide at some time, and epsilon-RV, when these points have to get at distance less than epsilon in the terrain. In any terrain, each agent chooses its trajectory, but...
-
Indirect adaptive controller based on a self-structuring fuzzy system for nonlinear modeling and control
PublicationIn this paper, a unified nonlinear modeling and control scheme is presented. A self-structuring Takagi-Sugeno (T-S) fuzzymodel is used to approximate the unknown nonlinear plant based on I/O data collected on-line. Both the structure and theparameters of the T-S fuzzy model are updated by an on-line clustering method and a recursive least squares estimation(RLSE) algorithm. The rules of the fuzzy model can be added, replaced or...
-
Free Convection Heat Transfer from Horizontal Cylinders
PublicationThe results of experimental investigation of free convection heat transfer in a rectangular container are presented. The ability of the commonly accepted correlation equations to reproduce present experimental data was tested as well. It was assumed that the examined geometry fulfils the requirement of no-interaction between heated cylinder and bounded surfaces. In order to check this assumption recently published correlation equations...
-
Information content of systems as a physical principle
PublicationTo explain the conceptual gap between classical and quantum and other, hypothetical descriptions of the world, several principles have been proposed. So far, all these principles have not explicitly included the uncertainty relation. Here we introduce an information content principle ( ICP ) which represents a constrained uncertainty principle. The principle, by taking into account the encoding and decoding properties of a single physical...
-
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...
-
Monitoring of Chlorine Concentration in Drinking Water Distribution Systems Using an Interval Estimator
PublicationThis paper describes the design of an interval observer for the estimation of unmeasured quality state variables in drinking water distribution systems. The estimator utilizes a set bounded model of uncertainty to produce robust interval bounds on the estimated state variables of the water quality. The bounds are generated by solving two differential equations. Hence the numerical efficiency is sufficient for on-line monitoring...