International Journal Of Nonlinear Analysis And Applications
Volume:10 Issue: 1, Summer-Autumn 2019

In this paper, we obtain Jensen’s inequality for GG-convex functions. Also, we get inequalities alike to Hermite-Hadamard inequality for GG-convex functions. Some examples are given.

The aim of this paper is the definition of the abstract domain, abstract operator, abstract semantic, environments and states of disassembled executable codes. They help us to analysis the disassembled executable codes. Static analysis on the disassembled code is a popular task and reverse engineers and malware analyzers leverage this technique to apply a fast scan on the codes. In this paper, we perform a summarization on the requirements of abstract interpretation and present an algorithm to approximate the range value of the code variables.

In this paper, by using C-sequentially sign property for bifunctions, we provide sufficient conditions that ensure the existence of solutions of some vector equilibrium problems in Hausdorff topological vector spaces which ordered by a cone. The conditions which we consider are not imposed on the whole domain of the operators involved, but just on a locally segment-dense subset of the domain.

The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with infinite invariant measures. The three main extensions are Parry, Krengel, and Poisson entropies. In this survey, we shortly overview the history of entropy, discuss the pioneering notions of Shannon and later contributions of Kolmogorov and Sinai, and discuss in somewhat more details the extensions to infinite systems. We compare and contrast these entropies with each other and with the entropy on finite systems.

By applying finite difference formula to time discretization and the cubic B-splines for spatial variable, a numerical method for solving the inverse system of Burgers equations is presented. Also, the convergence analysis and stability for this problem are investigated and the order of convergence is obtained. By using two test problems, the accuracy of presented method is verified. Additionally, obtained numerical results of the cubic B-spline method are compared to trigonometric cubic B-spline method, exponential cubic Bspline method and radial basis function method. Implementation simplicity and less computational cost are the main advantages of proposed scheme compared to previous proposals.

For a Banach algebra A, we introduce c.c(A), the set of all φ ∈ A ∗ such that θφ : A → A ∗ is a completely continuous operator, where θφ is defined by θφ(a) = a · φ for all a ∈ A. We call A, a completely continuous Banach algebra if c.c(A) = A ∗ . We give some examples of completely continuous Banach algebras and a sufficient condition for an open problem raised for the first time by J.E Gal`e, T.J. Ransford and M. C. White: Is there exist an infinite dimensional amenable Banach algebra whose underlying Banach space is reflexive? We prove that a reflexive, amenable, completely continuous Banach algebra with the approximation property is trivial.

‎In this article‎, ‎we discuss about solvability of infinite systems of singular integral equations with two variables in the Banach sequence space $C(I times I‎, ‎c)$ by applying measure of noncompactness‎ and Meir-Keeler condensing operators‎. By presenting an example, we have illustrated our results‎. ‎For validity of the results we introduce a modified semi-analytic method in the case of two variables to make an iteration algorithm to find a closed-form of solution for the above problem‎. ‎The numerical results show that the produced sequence for approximating the solution of example is in the $c$ space with a high accuracy‎.

The main purpose of the paper is to extend some results of the coupled fixed point theorems, based on some previous works [15, 16], by using C-class functions. First part of the paper is related to some fixed point theorems, the second part presents the uniqueness and existence for the solution of the coupled fixed point problem and in the third part we discuss data dependence, well-posedness, Ulam-Hyers stability and limit shadowing property of the coupled fixed point set.

In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto Nash equilibrium strategies of the fuzzy bi-matrix games.

The aim of this article is to introduce ρ-altering J-type mappings in modular spaces and prove some fixed point theorems for ρ-altering and ρ-altering J-type mappings in modular spaces. We also furnish illustrative examples to express relationship between these mappings. As a consequence, the results are applied to the existence of solution of an integral equation arising from an ODE system.

In this paper we investigate the exact peroidic wave shock solutions of the Burgers equations. Our purpose is to describe the asymptotic behavior of the solution in the cauchy problem for viscid equation with small parametr ε and to discuss in particular the case of periodic wave shock. We show that the solution of this problem approaches the shock type solution for the cauchy problem of the inviscid burgers equation. The results are formulated in classical mathematics and proved with infinitesimal techniques of non standard analysis.

In this paper, the concept of soft ultrafilters is introduced and some of the related structures such as soft Stone-Cech compactification, principal soft ultrafilters and basis for its topology are studied.

In this article we consider the system of operator equations TiX = Ui for i = 1, 2, 3, ..., n, between Hilbert spaces and give necessary and sufficient conditions for the existence of common Hermitian solutions to this system of operator equations for arbitrary operators without the closedness condition. Also we study the Moore-Penrose inverse of a n × 1 block operator matrix and then give the general form of common Hermitian solutions to this system of equations. Cosequently, we give the necessary and sufficient conditions for the existence of common Hermitian solutions to the system of operator equations TiXVi = Ui , for i = 1, 2, 3, ..., n and also present the necessary conditions for solvability of the equation Pn i=1 TiXi = U.

The ever-growing use of various vehicles for transportation, on the one hand, and the statistics of soaring road accidents resulting from human error, on the other hand, reminds us of the necessity to conduct more extensive research on the design, manufacturing and control of driver-less intelligent vehicles. For the automatic control of an autonomous vehicle, we need its dynamic model, which, due to the existing uncertainties, the un-modeled dynamics and the performed simpli cations, is impossible to determine exactly. Add to this, the external disturbances that exist on the movement path. In this paper, two adaptive controllers have been proposed for tracking the trajectory of a car-like robot. The rst controller includes an indirect radial-basis-function neural network whose parameters are updated online via gradient descent. The second controller is adaptively updated online by means of fuzzy logic. The proposed controller includes a nonlinear robust section that uses the sliding mode method and a fuzzy logic section that updates some of the nonlinear control parameters online. The fuzzy logic system has been designed to deal with the chattering problem in the controller of car-like robot. In both controllers, the parameters have been determined by means of genetic algorithm. The obtained results indicate that even with the consideration of un-ideal effects such as uncertainties and external disturbances, the proposed controller has been able to perform successfully.

The idea of the Internet of Things (IoT) has turned out to be increasingly prominent in the cutting edge period of innovation than at any other time. From little family unit gadgets to extensive modern machines, the vision of IoT has made it conceivable to interface the gadgets with the physical world around them. This expanding prominence has likewise made the IoT gadgets and applications in the focal point of consideration among aggressors. Officially, a few sorts of pernicious exercises exist that endeavor to bargain the security and protection of the IoT gadgets. One fascinating rising risk vector is the assaults that misuse the utilization of sensors on IoT gadgets. IoT gadgets are powerless against sensor-based dangers because of the absence of legitimate security estimations accessible to control the utilization of sensors by applications. By abusing the sensors (e.g., accelerometer, gyrator, mouthpiece, light sensor, and so on.) on an IoT gadget, assailants can separate data from the gadget, exchange malware to a gadget, or trigger a pernicious movement to bargain the gadget. In this review, we investigate different dangers focusing on IoT gadgets and talk about how their sensors can be mishandled for malignant purposes. Speci cally, we present an itemized study about existing sensor- based dangers to IoT gadgets and countermeasures that are grown speci cally to verify the sensors of IoT gadgets. Besides, we talk about the security and protection issues of IoT gadgets with regards to sensor-based dangers and nish up with future research headings

Nowadays wireless networks are becoming important in personal and public communication and growing very rapidly. Similarly, Software De ned Network (SDN) is an emerging approach to over- come challenges of traditional networks. In this paper, a new SDN-based framework is proposed to ne-grained control of 802.11 Wireless LANs. This work describes the bene ts of programmable Access Points. The proposed framework is evaluated on a prototype. We show that this architecture allows us to react to application needs, adjust network con guration for a priority application, detect network problems, and improve the user experience of the network. Our architecture relies on the IEEE 802.11 standard, and exploits it to collect information from the stations.

All the social networks can be modeled as a graph, where each roles as vertex and each relation roles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is the set of edges. All social networks can be segmented to K groups, where there are members in each group with same features. In each group each person knows other individuals and is in touch with them. In this study, the main goal is introducing a new approach for detecting these groups and minimizing the number of these groups using a cellular automat algorithm. There are two types of social networks, containing simulated social network and real social network. The results show that the introduced method has a great potential to signi cantly reduce the number of colors assigned and running time of the program.

In the past three decades, the use of smart methods in medical diagnostic systems has attracted the attention of many researchers. However, no smart activity has been provided in the field of medical image processing for diagnosis of bladder cancer through cystoscopy images despite the high prevalence in the world. In this paper, two well-known convolutional neural networks (CNNs) and a multilayer neural network was applied to classify bladder cystoscopy images. One of the most important issues in training phase of neural networks is determining the learning rate because selecting too small or large learning rate leads to slow convergence, volatility and divergence, respectively. Therefore, an algorithm is required to dynamically change the convergence rate. In this respect, an adaptive method was presented for determining the learning rate so that the multilayer neural network could be improved. In this method, the learning rate is determined using a coefficient based on the difference between the accuracy of training and validation according to the output error. In addition, the rate of changes is updated according to the level of weight changes and output error. The proposed method was evaluated on 720 bladder cystoscopy images in four classes of blood in urine, benign and malignant masses. Based on the simulated results, the second proposed method (CNNs) achieved at least 17% decrease in error and increased the convergence speed of the proposed method in the classification of cystoscopy images, compared to the other competing methods.

Nowadays, in a competitive and dynamic environment of businesses, organizations need to moni- tor, analyze and improve business processes with the use of Business Process Management Systems (BPMSs). Management, prediction and time control of events in BPMS is one of the major chal- lenges of this area of research that has attracted lots of researchers. In this paper, we present a 4-phase pipeline approach to the problem of synchronizing each pair of dependent process instances to arrive at the corresponding pair of tasks simultaneous or near-simultaneous. In the rst phase, the process model is mined from the event log and enriched by the probabilistic distributions of time information. In the second phase, the hidden processing dependency between the each pair of dependent process instances is formally de ned and is mined from the event log. In the third phase, a process state prediction algorithm is presented to predict the future route of process instance and then predict the remaining time of the process instance to a given point in a predicted route of the business process. In the fourth phase, an iterative synchronization algorithm is presented based on the presented process state prediction algorithm to make each pair of dependent process instances arrive at the corresponding pair of tasks simultaneous or near-simultaneous. Experimental results on a real-life event log of BPI challenge 2012 show that the proposed method leads to 39% reduction in cycle time for dependent process instances.

Localizing text regions in images taken from natural scenes is one of the challenging problems due to variations in font, size, color and orientation of text. In this paper, we introduce a new concept so called Edge Color Signature for localizing text regions in an image. This method is able to localize both Farsi and English texts. In the proposed method rst a pyramid using different scales of the input image is created. Then for each level of the pyramid an edge map is extracted. Afterward, several geometric features are employed to lter out the non-text edges from the extracted edges. At this stage we describe an edge using colors of its neighboring pixels. We use the mean-Shift algorithm to obtain the color modes surrounding each edge pixel. Subsequently, the connected edge pixels with similar color signatures are clustered using Single-Linkage clustering algorithm to construct meaningful groups. Finally, each of the clusters is labeled as text or non-text using an MLP based cascade classi er. The proposed method has been evaluated on well-known ICDAR 2013 and our Farsi dataset, the result is very promising.