Search results for "Applied Mathematic"
showing 10 items of 4398 documents
Opinion dynamics in social networks through mean field games
2016
Emulation, mimicry, and herding behaviors are phenomena that are observed when multiple social groups interact. To study such phenomena, we consider in this paper a large population of homogeneous social networks. Each such network is characterized by a vector state, a vector-valued controlled input, and a vector-valued exogenous disturbance. The controlled input of each network aims to align its state to the mean distribution of other networks' states in spite of the actions of the disturbance. One of the contributions of this paper is a detailed analysis of the resulting mean-field game for the cases of both polytopic and $mathcal L_2$ bounds on controls and disturbances. A second contrib…
New delay-dependent stability of Markovian jump neutral stochastic systems with general unknown transition rates
2015
This paper investigates the delay-dependent stability problem for neutral Markovian jump systems with generally unknown transition rates GUTRs. In this neutral GUTR model, each transition rate is completely unknown or only its estimate value is known. Based on the study of expectations of the stochastic cross-terms containing the integral, a new stability criterion is derived in terms of linear matrix inequalities. In the mathematical derivation process, bounding stochastic cross-terms, model transformation and free-weighting matrix are not employed for less conservatism. Finally, an example is provided to demonstrate the effectiveness of the proposed results.
A Hybrid Control Strategy for Quadratic Boost Converters with Inductor Currents Estimation
2020
International audience; This paper deals with a control strategy for a DC-DC quadratic boost converter. In particular, a hybrid control scheme is proposed to encompass a control law and an observer for the estimation of the system states, based only on the measurements of the input and output voltages. Differently from classical control methods, where the controller is designed from a small-signal model, here the real model of the system is examined without considering the average values of the discrete variables. Using hybrid dynamical system theory, asymptotic stability of a neighborhood of the equilibrium point is established, ensuring practical stability of the origin, which contains es…
P-FCM: a proximity-based fuzzy clustering for user-centered web applications
2003
Abstract In last years, the Internet and the web have been evolved in an astonishing way. Standard web search services play an important role as useful tools for the Internet community even though they suffer from a certain difficulty. The web continues its growth, making the reliability of Internet-based information and retrieval systems more complex. Nevertheless there has been a substantial analysis of the gap between the expected information and the returned information, the work of web search engine is still very hard. There are different problems concerning web searching activity, one among these falls in the query phase. Each engine provide an interface which the user is forced to le…
A note on best proximity point theory using proximal contractions
2018
In this paper, a reduction technique is used to show that some recent results on the existence of best proximity points for various classes of proximal contractions can be concluded from the corresponding results in fixed point theory.
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Best proximity point theorems for proximal cyclic contractions
2017
The purpose of this article is to compute a global minimizer of the function $$x\longrightarrow d(x, Tx)$$ , where T is a proximal cyclic contraction in the framework of a best proximally complete space, thereby ensuring the existence of an optimal approximate solution, called a best proximity point, to the equation $$Tx=x$$ when T is not necessarily a self-mapping.
Variable neighborhood descent for the incremental graph drawing
2017
Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.
On the continuous and discontinuous maximal operators
2018
Abstract In the first part of this paper we study the regularity properties of a wide class of maximal operators. These results are used to show that the spherical maximal operator is continuous W 1 , p ( R n ) ↦ W 1 , p ( R n ) , when p > n n − 1 . Other given applications include fractional maximal operators and maximal singular integrals. On the other hand, we show that the restricted Hardy–Littlewood maximal operator M λ , where the supremum is taken over the cubes with radii greater than λ > 0 , is bounded from L p ( R n ) to W 1 , p ( R n ) but discontinuous.
Efficient Algorithms for Sequence Analysis with Entropic Profiles
2017
Entropy, being closely related to repetitiveness and compressibility, is a widely used information-related measure to assess the degree of predictability of a sequence. Entropic profiles are based on information theory principles, and can be used to study the under-/over-representation of subwords, by also providing information about the scale of conserved DNA regions. Here, we focus on the algorithmic aspects related to entropic profiles. In particular, we propose linear time algorithms for their computation that rely on suffix-based data structures, more specifically on the truncated suffix tree (TST) and on the enhanced suffix array (ESA). We performed an extensive experimental campaign …