Search

The purpose of this paper is twofold. Firstly, certain common fixed point theorems are established via φ-contractive multivalued mappings involving point-dependent control functions as coefficients in the framework of complex valued metric spaces. Our results improve and extend several results in the existing literature. Moreover, this section is equipped by some illustrative examples in support of our results. Secondly, we point out some slip-ups in the examples of some recent papers based on multivalued contractive mappings in complex valued metric spaces. Our observations are also authenticated with the aid of some appropriate examples. Some rectifications to correct the erratic examples are also suggested. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel Halpern-type algorithm and prove that the sequence generated by the algorithm converges strongly to the common element of the set of fixed points of the two firmly nonexpansive mappings and the solution set of zero points of the monotone inclusion problems on Hadamard manifolds, the main results in this paper extended and improved some recent related results. [ABSTRACT FROM AUTHOR]

In this paper, we consider a variational inequality problem which is defined over the intersection of the set of common fixed points of a finite family of generalized demimetric mappings and the set of common zero points of a finite family of maximal monotone mappings. We propose an iterative algorithm which combines the hybrid steepest descent method with the inertial technique to solve this variational inequality problem. Strong convergence theorem of the proposed method is established under standard and mild conditions. Moreover, we do not require any prior information regarding the Lipschitz and strongly monotone constants of the mapping. The results of this paper improve and extend several known results in the literature. [ABSTRACT FROM AUTHOR]

This paper introduces a new mapping that is weaker than nonexpansive mapping. The new mapping is different from the Suzuki's generalized nonexpansive mapping. This paper introduces a new iteration process for the fixed point, and gives fixed point theorems and Convergence theorems for a new generalized nonexpansive mapping in Banach space, insteading of uniformly convex Banach space. [ABSTRACT FROM AUTHOR]

This study systematically assesses the process mining scenario from 2005 to 2014. The analysis of 705 papers evidenced 'discovery' (71%) as the main type of process mining addressed and 'categorical prediction' (25%) as the main mining task solved. The most applied traditional technique is the 'graph structure-based' ones (38%). Specifically concerning computational intelligence and machine learning techniques, we concluded that little relevance has been given to them. The most applied are 'evolutionary computation' (9%) and 'decision tree' (6%), respectively. Process mining challenges, such as balancing among robustness, simplicity, accuracy and generalization, could benefit from a larger use of such techniques. [ABSTRACT FROM AUTHOR]

Channel estimation and optimisation are the main challenging tasks in Multi Input Multi Output (MIMO) wireless communication systems. In this work, a Multi-Channel Bacterial Foraging Optimization Algorithm approach is proposed for the selection of antenna in a transmission area. The main advantage of this method is, it reduces the loss of bandwidth during data transmission effectively. Here, we considered the channel estimation and optimisation for improving the transmission speed and reducing the unused bandwidth. Initially, the message is given to the input of the communication system. Then, the symbol mapping process is performed for converting the message into signals. It will be encoded based on the space–time encoding technique. Here, the single signal is divided into multiple signals and it will be given to the input of space–time precoder. Hence, the multiplexing is applied to transmission channel estimation. In this paper, the Rayleigh channel is selected based on the bandwidth range. This is the Gaussian distribution type channel. Then, the demultiplexing is applied on the obtained signal that is the reverse function of multiplexing, which splits the combined signal arriving from a medium into the original information signal. Furthermore, the long-term evolution technique is used for scheduling the time to channels during transmission. Here, the hidden Markov model technique is employed to predict the status information of the channel. Finally, the signals are decoded and the reconstructed signal is obtained after performing the scheduling process. The experimental results evaluate the performance of the proposed MIMO communication system in terms of bit error rate, mean squared error, average throughput, outage capacity and signal to interference noise ratio. [ABSTRACT FROM AUTHOR]

In this paper, using the Nehari manifold and fibering maps, we study the existence of at least two positive solutions for the following p-Kirchhoff equation where is a bounded domain, with a, b, , is the p-Laplacian operator, is a parameter. [ABSTRACT FROM AUTHOR]

In this paper, we establish that Weinstein multipliers of Laplace transform type are Calderön-Zygmund operators in the sense of the associated space of homogeneous type, thus their mapping properties follow from the general theory. As an application, we deduce the -boundedness properties for the imaginary powers of the Weinstein operators . Finally we analyse the negative powers of and we give another result of boundedness of type for this operator. [ABSTRACT FROM AUTHOR]

In this paper, it is our purpose to introduce an inertial-like algorithm for approximating common fixed points of continuous pseudocontractive mappings in the framework of real Hilbert spaces. We prove strong convergence theorems for the sequence generated by the algorithm under certain conditions on the control sequences. We also provide numerical examples to demonstrate the efficiency of our algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we first review some important definitions and notions related to best proximity point theory by considering the lack of symmetry property of quasi metric. Then, we introduce a new notion of BG-multivalued contraction mappings. Then, a best proximity point result is obtained via Q-function on quasi metric. Also, we present a noteworthy illustrative example to show the effect of our results. Finally, we give an existence and uniqueness result for the solution of nonlinear integral equations via our result. [ABSTRACT FROM AUTHOR]

In this paper, we define the limit set Λξof an unconventional set of contractive functions {fk} on the unit ball of non-Archimedean algebra. Then, we prove that Λξis compact, perfect and uniformly disconnected. It is shown that there is a new collection of contractive mappingsdefined on Λξ. Moreover, we establish that the set Λξcoincides with the limit set generated by the semi-group of. This result allows us to further investigate the structure of Λξby means of this limiting set. As an application, we demonstrate the existence of invariant measures on Λξ. We should stress that the non-Archimedeanity of the space is essentially used in the paper. Therefore, the methods applied in this paper are not longer valid in the Archimedean setting (i.e. in case of real or complex numbers). [ABSTRACT FROM AUTHOR]

Packaging affects the logistical and environmental efficiency of supply chains. The purpose is to increase knowledge of the current state, trade-offs and improvement potential of packaging logistics in supply chain practice. The research is based on 22 cases, each of which consists of supply chain mapping and structured interviews with three supply chain actors (manufacturer, distributor and retailer). The paper identifies and explains improvement areas, trade-offs and gaps in packaging systems from a supply chain perspective for the whole packaging system, each packaging level and each actor. The results highlight a supply chain potential of better incorporating the packaging system requirements from actors not responsible for developing or selecting packaging. The paper discusses models for cost and benefit sharing and for identification and decision-making about trade-offs in packaging systems. Companies should collaborate, apply an integrated approach and find new approaches to integrate customers and suppliers into the packaging development process. [ABSTRACT FROM PUBLISHER]

The tourist carbon footprint (TCF) is the measure of the total amount of carbon dioxide (CO2) tourists emit by travelling from origin to destination and by participating in tourism -- and leisure -- related activities considering all relevant sources, sinks and storage within the spatial boundary of the destination. This paper presents a method of assessing the part of TCF associated with tourist transport at the tourist destination and proposes iso-pollutant contours as the most effective method of mapping TFC in relation to hotel location by using the prefecture of Attica in Greece as an example. The paper demonstrates for the first time how important is hotel location as a determinant factor of TCF and also proposes measures to reduce CO2 emissions through the implementation of policies that are environmentally friendly and are aiming to facilitate the transport of the tourists and promote the use of public transport. [ABSTRACT FROM AUTHOR]

This paper presents two novel contrast enhancement approaches using texture regions-based histogram equalization (HE). In HE-based contrast enhancement methods, the enhanced image often contains undesirable artefacts because an excessive number of pixels in the non-textured areas heavily bias the histogram. The novel idea presented in this paper is to suppress the impact of pixels in non-textured areas and to exploit texture features for the computation of histogram in the process of HE. The first algorithm named as Dominant Orientation-based Texture Histogram Equalization (DOTHE), constructs the histogram of the image using only those image patches having dominant orientation. DOTHE categories image patches into smooth, dominant or non-dominant orientation patches by using the image variance and singular value decomposition algorithm and utilizes only dominant orientation patches in the process of HE. The second method termed as Edge-based Texture Histogram Equalization, calculates significant edges in the image and constructs the histogram using the grey levels present in the neighbourhood of edges. The cumulative density function of the histogram formed from texture features is mapped on the entire dynamic range of the input image to produce the contrast-enhanced image. Subjective as well as objective performance assessment of proposed methods is conducted and compared with other existing HE methods. The performance assessment in terms of visual quality, contrast improvement index, entropy and measure of enhancement reveals that the proposed methods outperform the existing HE methods. [ABSTRACT FROM AUTHOR]

In this paper, we introduce some new algorithms for solving the equilibrium problem in a Hilbert space which are constructed around the proximal-like mapping and inertial effect. Also, some convergence theorems of the algorithms are established under mild conditions. Finally, several experiments are performed to show the computational efficiency and the advantage of the proposed algorithm over other well-known algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a new iterative method for finding the projection onto the intersection of two closed convex sets in the framework of Banach spaces is presented. It is a viscosity approximation method which produces a strongly convergent sequence. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the existence, uniqueness and asymptotic behavior of solutions to a nonhomogeneous second order difference inclusion of accretive type in Banach spaces. We develop new methods and significantly extend and improve some known results in the literature. Our conclusions are new even for Hilbert spaces. [ABSTRACT FROM AUTHOR]

Various type of deep convolution neural network (CNN) have been successfully applied to synthetic aperture radar (SAR) image despeckling. However, the model is limited by the length of network structure and expensive computation. In this paper, we proposed a novel deep learning-based approach learning the mapping from noisy image to noisy-free image with a dilated densely connected network (SAR-DDCN). Compared with the recently proposed despeckling methods, our method can achieve superior performance with less computational cost. Specifically, we replace standard convolution with dilated convolution, which could enlarge the receptive field and keep the size of feature maps at the same time. In addition, densely connected network are added to the network to alleviate the problem of gradient vanishing. Extensive experiments on synthetic and real SAR image show that the proposed method achieve better performance with respect to state-of-the-art-methods on both quantitative measurements and visual results. [ABSTRACT FROM AUTHOR]

In this paper, we first propose some kinds of the strong convexity (concavity) for vector functions. Then we apply these assumptions to establish sufficient conditions for the Hölder continuity of solution maps of the vector primal and dual equilibrium problems in metric linear spaces. As applications, we derive the Hölder continuity of solution maps of vector optimization problems and vector variational inequalities. Our results improve and generalize some recent existing ones in the literature. [ABSTRACT FROM AUTHOR]

The article establishes the sufficient and necessary conditions for the strong convergence of the Ishikawa iterative scheme with random errors in the sense of Xu for a strictly pseudocontractive mapping in an arbitrary real Banach space under certain assumptions. It affirmatively answers the open question that put forth by Zeng. The results in this paper extend and improve the corresponding results of Browder, Petryshyn, Rhoades, Osilike and Zeng. [ABSTRACT FROM AUTHOR]

In this paper, we consider logharmonic mappings which are stable univalent, stable starlike, stable with positive real part, stable close to starlike and stable typically real. We prove that the mappings are starlike logharmonic (resp. logharmonic univalent, close to starlike logharmonic, typically real logharmonic) for all if and only if the mappings are starlike analytic (resp. analytic univalent, close to starlike analytic, typically real analytic) for all . We also prove growth distortion theorems for these family of functions. [ABSTRACT FROM AUTHOR]

Let be a complex Hilbert space with and be a surjective map on the real linear space of all bounded self-adjoint operators on . For each , let be defined by In this paper, we show that if preserves square-zero operators in both directions, then there exist and a unitary or an antiunitary operator U on such that , for all . We also give a description of all continuous surjective maps , such that preserves square-zero operators in both directions. [ABSTRACT FROM AUTHOR]

The subgradient extragradient method can be considered as an improvement of the extragradient method for variational inequality problems for the class of monotone and Lipschitz continuous mappings. In this paper, we propose two new algorithms as combination between the subgradient extragradient method and Mann-like method for finding a common element of the solution set of a variational inequality and the fixed point set of a demicontractive mapping. [ABSTRACT FROM AUTHOR]

Delays are among the most crucial adversaries to the success and performance of construction projects, making delay analysis and management a critical task for project managers. This task will be highly complicated in large-scale projects such as construction, which usually consist of a complex network of heterogeneous entities in continuous interaction. Traditional approaches and methods for the analysis of delays and their causes have been criticised for their ability to handle complex projects, and for considering the interrelationships between delay causes. Addressing this gap, this research introduces an alternative approach for delay causes analysis by adopting Semantic Network Analysis (SNA) method. The paper reports the results from an investigation of delays in construction projects in the Oil-Gas-Petrochemical sector using SNA. The method’s capacity to identify and rank delay causes, which can assist managers in selecting appropriate measures for eliminating them, are empirically examined and discussed. The paper argues that SNA leads to a more comprehensive understanding of the main causes of delay in large and complex projects, allowing a better identification and mapping of the interrelationships between these discrete factors. [ABSTRACT FROM PUBLISHER]

In this paper, we first introduce the concept of generalized relative semi- (m , h) -preinvex functions, and then a new k-Riemann–Liouville fractional integral identity for differentiable mapping is derived. With the help of this identity, we present some new bounds on trapezium inequalities via generalized relative semi- (m , h) -preinvexity. It is pointed out that some new and known special cases can be deduced from main results of the article. [ABSTRACT FROM AUTHOR]

Today’s companies still rely heavily on expert knowledge rather than quantitative data with a systematic approach to effectively identify and choose Research and Development (R&D) partners. It is advantageous to identify and select potential R&D partners using a Problem & Solution (P&S) pattern. This paper presents a novel process for identifying R&D partners on the basis of solution similarities that assist technology managers in understanding the relationships between research targets. First, we choose a thematic dataset that contains problems and quantitative data with relative topic terms. Then, we extract Subject-Action-Object semantic structures in a P&S pattern from the dataset, and identify various solutions to a technical problem, with each as a subject. In addition, we provide correlation mapping to visualise the text characters and identify R&D partners. Finally, we validate the proposed method through a case study of the dye-sensitized solar cells sector. [ABSTRACT FROM PUBLISHER]

In this paper, we study the generalized Hadamard well-posedness of infinite vector optimization problems (IVOP). Without the assumption of continuity with respect to the first variable, the upper semicontinuity and closedness of constraint set mappings are established. Under weaker assumptions, sufficient conditions of generalized Hadamard well-posedness for IVOP are obtained under perturbations of both the objective function and the constraint set. We apply our results to the semi-infinite vector optimization problem and the semi-infinite multi-objective optimization problem. [ABSTRACT FROM AUTHOR]

This paper presents a set membership method (named Interval Analysis Localization (IAL)) to deal with the global localization problem of mobile robots. By using a LIDAR (LIghtDetectionAndRanging) range sensor, the odometry and a discrete map of an indoor environment, a robot has to determine its pose (position and orientation) in the map without any knowledge of its initial pose. In a bounded error context, the IAL algorithm searches a set of boxes (interval vector), with a cardinality as small as possible that includes the robot’s pose. The localization process is based on constraint propagation and interval analysis tools, such as bisection and relaxed intersection. The proposed method is validated using real data recorded during the CAROTTE challenge, organized by the French ANR (National Research Agency) and the French DGA (General Delegation of Armament). IAL is then compared with the well-known Monte Carlo Localization showing weaknesses and strengths of both algorithms. As it is shown in this paper with the IAL algorithm, interval analysis can be an efficient tool to solve the global localization problem. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to investigate the problem of finding a common element of the solution set of a variational inequality problem for a monotone, Lipschitz-continuous mapping and set of fixed point of a quasi-nonexpansive mapping. We introduce Mann-type Tseng's extragradient-like approximation method which is based on so-called inertial Tseng's extragradient method and Mann method. We establish two weak convergence theorems for two iterative sequences generated by these methods. Our results extend and improve some related results in the literatures. [ABSTRACT FROM AUTHOR]

Letbe the ring of allmatrices over a fieldwith. In this paper, it is proved that a mapis additive if and only iffor all rank-smatrices, wheresis a fixed positive integer such that, which has been verified to be true for the casein [Xu X, Pei Y, Yi X. Additive maps on invertible matrices. Linear Multilinear Algebra. 2016;64:1283–1294]. Also, an example is provided showing that the conclusion will be incorrect if. [ABSTRACT FROM PUBLISHER]

This paper deals with equilibrium problems in the setting of metric spaces with a continuous convex structure. We extend Fan’s 1984 KKM theorem to convex metric spaces in order to employ some weak coercivity conditions to establish existence results for suitable local Minty equilibrium problems, where the involved bifunctions are-quasimonotone. By an approach which is based on the concept of the strong-sign property for bifunctions, we obtain existence results for equilibrium problems which generalize some results in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new definition of Lipschitz-type continuity of a bifunction. Using this definition, we prove the contraction of the proximal mapping and apply it to the equilibrium problem over the fixed-point set of a nonexpansive mapping. We present a new algorithm for this problem. Under classical conditions, the convergence of the algorithm is proved. Finally, we present some numerical results for the proposed algorithm. [ABSTRACT FROM AUTHOR]

When a set of orthogonal orbitals is localised using orthogonal transformations, the orbital metric is conserved as the unit matrix during the localisation. In this paper we describe how non-orthogonal orbitals may be localised by requiring that the orbital metric is conserved. In particular, we demonstrate how exponential mappings may be used to parametrise orbital transformations such that the orbital metric is conserved. Using this parametrisation, the localisation of non-orthogonal orbitals becomes a generalisation of the localisation for orthogonal orbitals, where the conservation of a unit metric is replaced by the conservation of a non-unit metric. As a result, standard orbital localisation functions and optimisation algorithms that have been used for localising orthogonal orbitals may also be used to localise non-orthogonal orbitals. Numerical illustrations show that the thickness of the orbital tails may be reduced when a set of non-orthogonal orbitals is localised compared to the orthogonal counterpart, and further that the physical interpretation of occupied orbitals for representing chemical bonds is preserved. [ABSTRACT FROM AUTHOR]

In this paper, we attempt to investigate the super-biderivations of Lie superalgebras. Furthermore, we prove that all super-biderivations on the centerless super-Virasoro algebras are inner super-biderivations. Finally, we study the linear super commuting maps on the centerless super-Virasoro algebras. [ABSTRACT FROM AUTHOR]

The paper is devoted to properties of set-valued stochastic differential equations. The main result of the paper deals with existence and uniqueness of solutions. Furthermore, a connection between solutions of stochastic differential inclusions and solutions of set-valued stochastic differential equations are given. The result of the paper extends a lot of particular results dealing with such type equations. [ABSTRACT FROM PUBLISHER]

In this paper, some necessary and sufficient conditions are given for maps in Hausdorff spaces to be topologically conjugate or semi-conjugate to subshifts of finite type. These results not only extend some related existing results in metric spaces to Hausdorff spaces but also relax their conditions. In addition, it is shown that the strictA-coupled-expansion for a map in a Hausdorff space is a sufficient condition for it to be semi-conjugate to the subshift σAin Σ+m(A). Based on these results, two new criteria of chaos are established, in which the maps are shown to be chaotic either in the sense of both Devaney and Li-Yorke or in the sense of Li-Yorke. [ABSTRACT FROM PUBLISHER]

Recently, localization methods based on detailed maps constructed using simultaneous localization and mapping have been widely used for mobile robot navigation. However, the cost of building such maps increases rapidly with expansion of the target environment. Here, we consider the problem of localization of a mobile robot based on existing 2D street maps. Although a large amount of research on this topic has been reported, the majority of the previous studies have focused on car-like vehicles that navigate on roadways; thus, the efficacy of such methods for sidewalks is not yet known. In this paper, we propose a novel localization approach that can be applied to sidewalks. Whereas roadways are typically marked, e.g. by white lines, sidewalks are not and, therefore, road boundary detection is not straightforward. Thus, obtaining exact correspondence between sensor data and a street map is complex. Our approach to overcoming this difficulty is to maximize the statistical dependence between the sensor data and the map, and localization is achieved through maximization of a mutual-information-based criterion. Our method employs a computationally efficient estimator of squared-loss mutual information, through which we achieve near real-time performance. The efficacy of our method is evaluated through localization experiments using real-world data-sets [ABSTRACT FROM AUTHOR]

Letbe a signed graph, whereGis the underlying graph andis the signature function on the edges ofG. In this paper, we consider the Laplacian eigenvalues of signed graphs and we characterize the connected signed graphs whose second largest Laplacian eigenvalue does not exceed 3. Furthermore, we study the Laplacian spectral determination of most graphs in the latter family. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the notion of weak sharpness for set-valued variational inequalities in then-dimensional Euclidean space and then present some characterizations of weak sharpness. We also give some examples to illustrate this notion. Under the assumption of weak sharpness, by using the inner limit of a set sequence we establish a sufficient and necessary condition to guarantee the finite termination of an arbitrary algorithm for solving a set-valued variational inequality involving maximal monotone mappings. As an application, we show that the sequence generated by the hybrid projection-proximal point algorithm proposed by Solodov and Svaiter terminates at solutions in a finite number of iterations. These obtained results extend some known results of classical variational inequalities. [ABSTRACT FROM PUBLISHER]

Letbe a nest in an arbitrary factor von Neumann algebra. In this paper, it is proved that a linear local left (right) centralizer from the nest subalgebraintois a left (right) centralizer. Also, it is proved that a linear mappingfrominto itself is centralized at a given point if and only ifis a centralizer. [ABSTRACT FROM PUBLISHER]

This paper investigates the robust stability problem for dynamical neural networks in the presence of time delays and norm-bounded parameter uncertainties with respect to the class of non-decreasing, non-linear activation functions. By employing the Lyapunov stability and homeomorphism mapping theorems together, a new delay-independent sufficient condition is obtained for the existence, uniqueness and global asymptotic stability of the equilibrium point for the delayed uncertain neural networks. The condition obtained for robust stability establishes a matrix–norm relationship between the network parameters of the neural system, which can be easily verified by using properties of the class of the positive definite matrices. Some constructive numerical examples are presented to show the applicability of the obtained result and its advantages over the previously published corresponding literature results. [ABSTRACT FROM PUBLISHER]

In the first part of this paper, we present a new general algorithm for solving the split common fixed point problem for an infinite family of demicontractive mappings. We establish strong convergence of the algorithm in an infinite dimensional Hilbert space. As applications, we consider algorithms for split variational inequality problem and split common null point problem. In the second part of this paper, we present a new algorithm and strong convergence theorem for approximation of solutions of split equality fixed point problems for an infinite family of demicontractive mappings. Our results improve and generalize some recent results in the literature. [ABSTRACT FROM AUTHOR]

The current Internet has several known challenges, such as routing scalability, mobility, multihoming, traffic engineering, etc. due to the overloaded semantics of IP address, i.e. it is used as a node identifier (ID) and a node locator (LOC). Thus, the research community has redesigned the Internet architecture based on ID/LOC separation to overcome the limitations of the current Internet. In all Internet architectures based on ID/LOC separation, ID to LOC mapping system is necessarily required to bind ID and its LOC, since ID is no longer dependent to its LOC logically or physically. Thus, how to design the mapping system is a key challenge in ID/LOC separation architecture. In this paper, we analyse qualitatively the mapping systems proposed in ID/LOC separation architectures to provide insights into designing a new mapping system. The main contribution in this paper is that we categorise ID to LOC mapping systems according to the mapping server structure and provide the pros and cons of the mapping systems belonging to each category. Based on our qualitative analysis, we also examine intuitively if the mapping systems in each category satisfy their requirements. [ABSTRACT FROM AUTHOR]

Fractional (nonlocal) diffusion equations replace the integer-order derivatives in space and time by their fractional-order analogues and they are used to model anomalous diffusion, especially in physics. This paper is devoted to a nonlocal inverse problem related to the space-time fractional equation. The existence of the solution for the inverse problem is proved by using quasi-solution method which is based on minimizing an error functional between the output data and the additional data. In this context, an input–output mapping is defined and continuity of the mapping is established. The uniqueness of the solution for the inverse problem is also proved by using eigenfunction expansion of the solution and some basic properties of fractional Laplacian. A numerical method based on discretization of the minimization problem, steepest descent method and least squares approach is proposed for the solution of the inverse problem. The numerical method determines the exponents of the fractional time and space derivatives simultaneously. Numerical examples with noise-free and noisy data illustrate applicability and high accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

This paper presents a new control method for a class of nonlinear switched systems in strict feedback form with a state constraint. In the proposed approach, a nonlinear mapping is first introduced to transform the problem of controlling the switched system with state constraint to a new problem of regulating the transformed system without a constraint. By using the backstepping technique, the designed state-feedback controller ensures that the corresponding closed-loop system is asymptotically stable without violation of the constraint, and that all closed-loop signals keep bounded. Furthermore, we explore the use of a coordinate transformation to deal with an asymmetric state constraint as a generalised approach. In the end, an application example on a chemical process is shown to demonstrate the efficacy of the obtained results. [ABSTRACT FROM PUBLISHER]

In this paper, the existence and finite-time stability of equilibrium point for a class fractional-order Cohen–Grossberg neural networks with time delay are investigated. Moreover, some sufficient conditions for the finite time stability are obtained by using Bellman–Gronwall inequality and differential mean value theorem,and contraction mapping. Finally, an example is given to illustrate the effectiveness of the results. [ABSTRACT FROM PUBLISHER]

In this paper, we introduce and define a concept of -operator pair as a pair of non-commuting mappings in a C*-algebra-valued modular metric space. Next, some common fixed point theorems are established for such mappings. Also, to support and elaborate our results, some examples are given and an application is provided for a system of integral equations. [ABSTRACT FROM AUTHOR]

Results of F. Kouchakinejad and the authors [Internat. J. General Systems 46 (2017), 225-234] imply that if are continuous functions with zero value at the origin, such that , f is strictly super-additive and g is sub-additive but not linear, then there is no continuous aggregation function such that f and g are super-additive and sub-additive transformations of h, respectively. In this paper we extend this result to all continuous functions , as well as to a corresponding dual statement obtained by swapping the roes of super- and sub-additivity. We also show that the continuity assumption here cannot be dropped even at a single point. [ABSTRACT FROM AUTHOR]

In this paper, we consider the split common fixed point problem for new demimetric mappings in Banach spaces. Using the idea of Mann’s iteration, we prove a weak convergence theorem for finding a solution of the split common fixed point problem in Banach spaces. Furthermore, using the idea of Halpern’s iteration, we obtain a strong convergence theorem for finding a solution of the problem in Banach spaces. Using these results, we obtain well-known and new weak and strong convergence theorems in Hilbert spaces and Banach spaces. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the monotone Caristi inward mappings. As an example, we show that monotone inward contraction mappings are monotone Caristi inward mappings. A general fixed point theorem for such mappings is given. A mutlivalued version of these results is also introduced. [ABSTRACT FROM AUTHOR]