All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 87 Next

Displaying 1721 – 1740 of 5970

Showing per page

Fopid Controller Design for Robust Performance Using Particle Swarm Optimization

Zamani, Majid, Karimi-Ghartemani, Masoud, Sadati, Nasser (2007)

Fractional Calculus and Applied Analysis

Mathematics Subject Classification: 26A33; 93C15, 93C55, 93B36, 93B35, 93B51; 03B42; 70Q05; 49N05This paper proposes a novel method to design an H∞ -optimal fractional order PID (FOPID) controller with ability to control the transient, steady-state response and stability margins characteristics. The method uses particle swarm optimization algorithm and operates based on minimizing a general cost function. Minimization of the cost function is carried out subject to the H∞ -norm; this norm is also...

Forcing countable networks for spaces satisfying R ( X ω ) = ω

István Juhász, Lajos Soukup, Zoltán Szentmiklóssy (1996)

Commentationes Mathematicae Universitatis Carolinae

We show that all finite powers of a Hausdorff space X do not contain uncountable weakly separated subspaces iff there is a c.c.c poset P such that in V P X is a countable union of 0 -dimensional subspaces of countable weight. We also show that this...

Forcing for hL and hd

Andrzej Rosłanowski, Saharon Shelah (2001)

Colloquium Mathematicae

The present paper addresses the problem of attainment of the supremums in various equivalent definitions of the hereditary density hd and hereditary Lindelöf degree hL of Boolean algebras. We partially answer two problems of J. Donald Monk [13, Problems 50, 54], showing consistency of different attainment behaviour and proving that (for the variants considered) this is the best result we can expect.

Forcing in the alternative set theory. I

Jiří Sgall (1991)

Commentationes Mathematicae Universitatis Carolinae

The technique of forcing is developed for the alternative set theory (AST) and similar weak theories, where it can be used to prove some new independence results. There are also introduced some new extensions of AST.

Forcing in the alternative set theory. II

Jiří Sgall, Antonín Sochor (1991)

Commentationes Mathematicae Universitatis Carolinae

By the technique of forcing, some new independence results are proved for the alternative set theory (AST) and similar weak theories: The scheme of choice is independent both of AST and of second order arithmetic, axiom of constructibility is independent of AST plus schemes of choice.

Forcing tightness in products of fans

Jörg Brendle, Tim La Berge (1996)

Fundamenta Mathematicae

We prove two theorems that characterize tightness in certain products of fans in terms of families of integer-valued functions. We also define several notions of forcing that allow us to manipulate the structure of the set of functions from some cardinal θ to ω, and hence, the tightness of these products. These results give new constructions of first countable <θ-cwH spaces that are not ≤θ-cwH.

Forcing with ideals generated by closed sets

Jindřich Zapletal (2002)

Commentationes Mathematicae Universitatis Carolinae

Consider the poset P I = Borel ( ℝ ) ∖ I where I is an arbitrary σ -ideal σ -generated by a projective collection of closed sets. Then the P I extension is given by a single real r of an almost minimal degree: every real s ∈ V [ r ] is Cohen-generic over V or V [ s ] = V [ r ] .

Formalization of Generalized Almost Distributive Lattices

Adam Grabowski (2014)

Formalized Mathematics

Almost Distributive Lattices (ADL) are structures defined by Swamy and Rao [14] as a common abstraction of some generalizations of the Boolean algebra. In our paper, we deal with a certain further generalization of ADLs, namely the Generalized Almost Distributive Lattices (GADL). Our main aim was to give the formal counterpart of this structure and we succeeded formalizing all items from the Section 3 of Rao et al.’s paper [13]. Essentially among GADLs we can find structures which are neither V-commutative...

Formalization of the Advanced Encryption Standard. Part I

Kenichi Arai, Hiroyuki Okazaki (2013)

Formalized Mathematics

In this article, we formalize the Advanced Encryption Standard (AES). AES, which is the most widely used symmetric cryptosystem in the world, is a block cipher that was selected by the National Institute of Standards and Technology (NIST) as an official Federal Information Processing Standard for the United States in 2001 [12]. AES is the successor to DES [13], which was formerly the most widely used symmetric cryptosystem in the world. We formalize the AES algorithm according to [12]. We then verify...

Currently displaying 1721 – 1740 of 5970