Search results

In this study, the authors introduce a solvability of special type of Langevin differential equations (LDEs) in virtue of geometric function theory. The analytic solutions of the LDEs are considered by utilizing the Caratheodory functions joining the subordination concept. A class of Caratheodory functions involving special functions gives the upper bound solution.

The methodology is based on the geometric function theory.

The authors present a new analytic function for a class of complex LDEs.

The authors introduced a new class of complex differential equation, presented a new technique to indicate the analytic solution and used some special functions.

The total capacity of ambulances in metropolitan cities is often less than the post-disaster demand, especially in the case of disasters such as earthquakes. However, because earthquakes are a rare occurrence in these cities, it is unreasonable to maintain the ambulance capacity at a higher level than usual. Therefore, the effective use of ambulances is critical in saving human lives during such disasters. Thus, this paper aims to provide a method for determining how to transport the maximum number of disaster victims to hospitals on time.

The transportation-related disaster management problem is complex and dynamic. The practical solution needs decomposition and a fast algorithm for determining the next mission of a vehicle. The suggested method is a synthesis of mathematical modeling, scheduling theory, heuristic methods and the Voronoi diagram of geometry. This study presents new elements for the treatment, including new mathematical theorems and algorithms. In the proposed method, each hospital is responsible for a region determined by the Voronoi diagram. The region may change if a hospital becomes full. The ambulance vehicles work for hospitals. For every patient, there is an estimated deadline by which the person must reach the hospital to survive. The second part of the concept is the way of scheduling the vehicles. The objective is to transport the maximum number of patients on time. In terms of scheduling theory, this is a problem whose objective function is to minimize the sum of the unit penalties.

The Voronoi diagram can be effectively used for decomposing the complex problem. The mathematical model of transportation to one hospital is the P‖ΣU_j problem of scheduling theory. This study provides a new mathematical theorem to describe the structure of an algorithm that provides the optimal solution. This study introduces the notion of the partial oracle. This algorithmic tool helps to elaborate heuristic methods, which provide approximations to the precise method. The realization of the partial oracle with constructive elements and elements proves the nonexistence of any solution. This paper contains case studies of three hospitals in Tehran. The results are close to the best possible results that can be achieved. However, obtaining the optimal solution requires a long CPU time, even in the nondynamic case, because the problem P‖ΣU_j is NP-complete.

This research suggests good approximation because of the complexity of the problem. Researchers are encouraged to test the proposed propositions further. In addition, the problem in the dynamic environment needs more attention.

If a large-scale earthquake can be expected in a city, the city authorities should have a central control system of ambulances. This study presents a simple and efficient method for the post-disaster transport problem and decision-making. The security of the city can be improved by purchasing ambulances and using the proposed method to boost the effectiveness of post-disaster relief.

The population will be safer and more secure if the recommended measures are realized. The measures are important for any city situated in a region where the outbreak of a major earthquake is possible at any moment.

This paper fulfills an identified need to study the operations related to the transport of seriously injured people using emergency vehicles in the post-disaster period in an efficient way.

L. Gǎvruţa (2012) introduced a special kind of frames, named K-frames, where K is an operator, in Hilbert spaces, which is significant in frame theory and has many applications. In this paper, first of all, we have introduced the notion of approximative K-atomic decomposition in Banach spaces. We gave two characterizations regarding the existence of approximative K-atomic decompositions in Banach spaces. Also some results on the existence of approximative K-atomic decompositions are obtained. We discuss several methods to construct approximative K-atomic decomposition for Banach Spaces. Further, approximative _d-frame and approximative _d-Bessel sequence are introduced and studied. Two necessary conditions are given under which an approximative _d-Bessel sequence and approximative _d-frame give rise to a bounded operator with respect to which there is an approximative K-atomic decomposition. Example and counter example are provided to support our concept. Finally, a possible application is given.

In this paper we study a class of complexity measures, induced by a new data structure for representing k-valued functions (operations), called minor decision diagram. When assigning values to some variables in a function the resulting functions are called subfunctions, and when identifying some variables the resulting functions are called minors. The sets of essential variables in subfunctions of f are called separable in f.

We examine the maximal separable subsets of variables and their conjugates, introduced in the paper, proving that each such set has at least one conjugate. The essential arity gap gap(f) of the function f is the minimal number of essential variables in f which become fictive when identifying distinct essential variables in f. We also investigate separable sets of variables in functions with non-trivial arity gap. This allows us to solve several important algebraic, computational and combinatorial problems about the finite-valued functions.

The purpose of this paper is to show the existence results for adapted solutions of infinite horizon doubly reflected backward stochastic differential equations with jumps. These results are applied to get the existence of an optimal impulse control strategy for an infinite horizon impulse control problem.

The main methods used to achieve the objectives of this paper are the properties of the Snell envelope which reduce the problem of impulse control to the existence of a pair of right continuous left limited processes. Some numerical results are provided to show the main results.

In this paper, the authors found the existence of a couple of processes via the notion of doubly reflected backward stochastic differential equation to prove the existence of an optimal strategy which maximizes the expected profit of a firm in an infinite horizon problem with jumps.

In this paper, the authors found new tools in stochastic analysis. They extend to the infinite horizon case the results of doubly reflected backward stochastic differential equations with jumps. Then the authors prove the existence of processes using Envelope Snell to find an optimal strategy of our control problem.

In this work, we estimated the different entropies like Shannon entropy, Rényi divergences, Csiszár divergence by using Jensen’s type functionals. The Zipf’s–Mandelbrot law and hybrid Zipf’s–Mandelbrot law are used to estimate the Shannon entropy. The Abel–Gontscharoff Green functions and Fink’s Identity are used to construct new inequalities and generalized them for m-convex function.

This study describes the applicability of the a priori estimate method on a nonlocal nonlinear fractional differential equation for which the weak solution's existence and uniqueness are proved. The authors divide the proof into two sections for the linear associated problem; the authors derive the a priori bound and demonstrate the operator range density that is generated. The authors solve the nonlinear problem by introducing an iterative process depending on the preceding results.

The functional analysis method is the a priori estimate method or energy inequality method.

The results show the efficiency of a priori estimate method in the case of time-fractional order differential equations with nonlocal conditions. Our results also illustrate the existence and uniqueness of the continuous dependence of solutions on fractional order differential equations with nonlocal conditions.

The authors’ work can be considered a contribution to the development of the functional analysis method that is used to prove well-positioned problems with fractional order.

The authors confirm that this work is original and has not been published elsewhere, nor is it currently under consideration for publication elsewhere.

This paper aims to study Irreversible conversion processes, which examine the spread of a one way change of state (from state 0 to state 1) through a specified society (the spread of disease through populations, the spread of opinion through social networks, etc.) where the conversion rule is determined at the beginning of the study. These processes can be modeled into graph theoretical models where the vertex set V(G) represents the set of individuals on which the conversion is spreading.

The irreversible k-threshold conversion process on a graph G=(V,E) is an iterative process which starts by choosing a set S_0?V, and for each step t (t = 1, 2,…,), S_t is obtained from S_(t−1) by adjoining all vertices that have at least k neighbors in S_(t−1). S_0 is called the seed set of the k-threshold conversion process and is called an irreversible k-threshold conversion set (IkCS) of G if S_t = V(G) for some t = 0. The minimum cardinality of all the IkCSs of G is referred to as the irreversible k-threshold conversion number of G and is denoted by C_k (G).

In this paper the authors determine C_k (G) for generalized Jahangir graph J_(s,m) for 1 < k = m and s, m are arbitraries. The authors also determine C_k (G) for strong grids P_2? P_n when k = 4, 5. Finally, the authors determine C_2 (G) for P_n? P_n when n is arbitrary.

This work is 100% original and has important use in real life problems like Anti-Bioterrorism.

The purpose of this paper is to study large deviations for the solution processes of a stochastic equation incorporated with the effects of nonlocal condition.

A weak convergence approach is adopted to establish the Laplace principle, which is same as the large deviation principle in a Polish space. The sufficient condition for any family of solutions to satisfy the Laplace principle formulated by Budhiraja and Dupuis is used in this work.

Freidlin–Wentzell type large deviation principle holds good for the solution processes of the stochastic functional integral equation with nonlocal condition.

The asymptotic exponential decay rate of the solution processes of the considered equation towards its deterministic counterpart can be estimated using the established results.

Let H be a connected subgraph of a connected graph G. The H-structure connectivity of the graph G, denoted by κ(G;H), is the minimum cardinality of a minimal set of subgraphs F={H1′,H2′,…,Hm′} in G, such that every H′i∈F is isomorphic to H and removal of F from G will disconnect G. The H-substructure connectivity of the graph G, denoted by κs(G;H), is the minimum cardinality of a minimal set of subgraphs F={J1′,J2′,…,Jm′} in G, such that every Ji′∈F is a connected subgraph of H and removal of F from G will disconnect G. In this paper, we provide the H-structure and the H-substructure connectivity of the circulant graph Cir(n,Ω) where Ω={1,…,k,n−k,…,n−1},1≤k≤⌊n2⌋ and the hypercube Qn for some connected subgraphs H.