Search results for "DISCRETE"
showing 10 items of 2205 documents
Kadec and Krein–Milman properties
2000
Abstract The main goal of this paper is to prove that any Banach space X with the Krein–Milman property such that the weak and the norm topology coincide on its unit sphere admits an equivalent norm that is locally uniformly rotund.
Hamel-isomorphic images of the unit ball
2010
In this article we consider linear isomorphisms over the field of rational numbers between the linear spaces ℝ2 and ℝ. We prove that if f is such an isomorphism, then the image by f of the unit disk is a strictly nonmeasurable subset of the real line, which has different properties than classical non-measurable subsets of reals. We shall also consider the question whether all images of bounded measurable subsets of the plane via a such mapping are non-measurable (© 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
Unit Operations in Approximation Spaces
2010
Unit operations are some special functions on sets. The concept of the unit operation originates from researches of U. Wybraniec-Skardowska. The paper is concerned with the general properties of such functions. The isomorphism between binary relations and unit operations is proved. Algebraic structures of families of unit operations corresponding to certain classes of binary relations are considered. Unit operations are useful in Pawlak's Rough Set Theory. It is shown that unit operations are upper approximations in approximation space. We prove, that in the approximation space (U, R) generated by a reflexive relation R the corresponding unit operation is the least definable approximation i…
A linear matrix inequality approach to robust fault detection filter design of linear systems with mixed time-varying delays and nonlinear perturbati…
2010
Accepted version of an article in the journal: Journal of the Franklin Institute-Engineering and Applied Mathematics. The definitive version can be found on Sciverse: http://dx.doi.org/10.1016/j.jfranklin.2010.03.004 In this paper, the problem of robust fault detection filter (RFDF) design for a class of linear systems with some nonlinear perturbations and mixed neutral and discrete time-varying delays is investigated. By using a descriptor technique, Lyapunov-Krasovskii functional and a suitable change of variables, new required sufficient conditions are established in terms of delay-dependent linear matrix inequalities (LMIs) to synthesize the residual generation scheme. Based on the Luen…
Discrete-time multioverlapping controller design for structural vibration control of tall buildings under seismic excitation
2012
Published version of an article from the journal: Mathematical Problems in Engineering. Also available from the publisher:http://dx.doi.org/10.1155/2012/636878 In this paper, a computationally effective strategy to obtain multioverlapping controllers via the Inclusion Principle is applied to design discrete-time state-feedback multioverlapping LQR con- trollers for seismic protection of tall buildings. To compute the corresponding control actions, the proposed semidecentralized controllers only require state information from neighboring stories. This particular configuration of information exchange allows introducing a dramatic reduction in the transmission range required for a wireless imp…
D-Optimal Design for Parameter Estimation in Discrete-Time Nonlinear Dynamic Systems
2012
Published version of an article from the journal: Mathematical Problems in Engineering. Also available from the publisher:http://dx.doi.org/10.1155/2012/296701 An optimal input design method for parameter estimation in a discrete-time nonlinear system is presented in the paper to improve the observability and identification precision of model parameters. Determinant of the information matrix is used as the criterion function which is generally a nonconvex function about the input signals to be designed. To avoid the locally optimizing problem, a randomized designmethod is proposed bywhich a globally optimizing test plan other than input signals may be obtained. Then the randomized design ca…
One-dimensional nonlinear boundary value problems with variable exponent
2018
In this paper, a class of nonlinear differential boundary value problems with variable exponent is investigated. The existence of at least one non-zero solution is established, without assuming on the nonlinear term any condition either at zero or at infinity. The approach is developed within the framework of the Orlicz-Sobolev spaces with variable exponent and it is based on a local minimum theorem for differentiable functions.
p-VARIATION OF VECTOR MEASURES WITH RESPECT TO BILINEAR MAPS
2008
AbstractWe introduce the spaces Vℬp(X) (respectively 𝒱ℬp(X)) of the vector measures ℱ:Σ→X of bounded (p,ℬ)-variation (respectively of bounded (p,ℬ)-semivariation) with respect to a bounded bilinear map ℬ:X×Y →Z and show that the spaces Lℬp(X) consisting of functions which are p-integrable with respect to ℬ, defined in by Blasco and Calabuig [‘Vector-valued functions integrable with respect to bilinear maps’, Taiwanese Math. J. to appear], are isometrically embedded in Vℬp(X). We characterize 𝒱ℬp(X) in terms of bilinear maps from Lp′×Y into Z and Vℬp(X) as a subspace of operators from Lp′(Z*) into Y*. Also we define the notion of cone absolutely summing bilinear maps in order to describe t…
Distributed Leader Election and Computation of Local Identifiers for Programmable Matter
2019
International audience; The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the square, triangular and king grids. Each particle occupies one vertex, can communicate with the adjacent particles, has the same clockwise direction and knows the local positions of neighborhood particles. Under these assumptions, we describe a new leader election algorithm affecting a variable to the particles, called the k-local identifier, in such a way that particles at close distance have each a different k-local identifier. For all the presented algorithms, the particles only need a O(…
Chromatic sums for colorings avoiding monochromatic subgraphs
2015
Abstract Given graphs G and H, a vertex coloring c : V ( G ) → N is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ ( H , G ) , is the minimum number of colors in an H-free coloring of G. The H-free chromatic sum of G , Σ ( H , G ) , is the minimum value achieved by summing the vertex colors of each H-free coloring of G. We provide a general bound for Σ ( H , G ) , discuss the computational complexity of finding this parameter for different choices of H, and prove an exact formulas for some graphs G. For every integer k and for every graph H, we construct families of graphs, G k with the property that k more colors than χ ( …