Results 281 to 290 of about 1,208,588 (320)

Bohr compactifications of discrete structures

Fundamenta Mathematicae, 1999
Bohr compactifications of discrete algebraic structures are investigated which generalize that of groups or rings. \(\mathcal L\)-structures, quasigroups, loops, lattices, etc. are considered. The relations with \(C_p\)-theory are given. Estimates for the topological weight, character, tightness and cardinality of the Bohr compactifications through ...
Joan E. Hart, Kenneth Kunen
openaire   +3 more sources

Random Discrete Structures

1996
Probability distributions on cladograms.- Stability of self-organizing processes.- Some examples of normal approximations by Stein's method.- Large deviations for random distribution of mass.- Random minimax game tress.- Metrics on compositions and coincidences among renewal sequences.- The no long odd cycle theorem for completely positive matrices.- A
Robin Pemantle, David Aldous
openaire   +2 more sources

Discrete Variable Structure Integral Controllers

IFAC Proceedings Volumes, 1996
Abstract The paper deals with the analysis and the design of a class of robust discrete-time Variable Structure controllers of integral type. We refer to the Discontinuous Integral Control (DIC) as the basic technique for reducing the chattering of the system. A modified discretized version of the DIC algorithm is introduced and discussed.
BONIVENTO, Claudio, M. Sandri, ZANASI, Roberto   +2 more
openaire   +5 more sources

Discrete Deep Structure

2013
The discrete scale space representation L of f is continuous in scale t. A computational investigation of L however must rely on a finite number of sampled scales. There are multiple approaches to sampling L differing in accuracy, runtime complexity and memory usage.
Arjan Kuijper, Arjan Kuijper, Martin Tschirsich   +2 more
openaire   +2 more sources

Phase transitions in discrete structures

2015
Over the past 20 years physicists have developed an ingenious but non-rigorous approach to random discrete structures, the so-called cavity method. This technique has led to many intriguing predictions as to, e.g., the precise location and nature of phase transitions and the performance of algorithms.
openaire   +2 more sources

On Discrete Preference Structures

2002
In this paper, we introduce and study discrete preference structures. Such structures are expressed on finite chains and arise in the context of ordinal or linguistic preference modelling. Two classes of discrete preference structures are identified and characterized.
Bernard De Baets, János Fodor
openaire   +2 more sources

Structure of the exponential of a discrete space

Mathematical Notes of the Academy of Sciences of the USSR, 1984
Let X be a topological space and \({\mathcal A}\), \({\mathcal B}\) families of subsets of X. For \(A\in {\mathcal A}\), \(B\in {\mathcal B}\) put \([A,B]=\{(F)\in \exp X:A\subset F\subset X-B\},\) where exp X denotes the system of all closed sets of X.
openaire   +2 more sources

Discrete optimum structural design

Computers & Structures, 1988
Abstract This paper is concerned with some of the difficulties involved in the optimum design of engineering structures using only components which are available in discrete sizes. As an example the optimum design of trusses using rolled steel sections is used to critically examine several different methods and point out the snags in using them in a ...
openaire   +2 more sources

Structure of discrete order statistics

Journal of Statistical Planning and Inference, 1986
X\({}_ 1,...,X_ n\) are independent and identically distributed discrete random variables, the common distribution having at least three points in its support. \(Y_ 1\leq Y_ 2\leq...\leq Y_ n\) denote the ordered values of \(X_ 1,X_ 2,...,X_ n\). Define the event \(A_{k,m}\) as \(\{Y_ k=a_ k,Y_{k+1}=a_{k+1},...,Y_ m=a_ m\}\) for \(1\leq k\leq m\leq n.\)
openaire   +2 more sources

A note on discretized michell structures

Computer Methods in Applied Mechanics and Engineering, 1974
Abstract While achieving the greatest possible economy of material, Michell structures with their infinity of bars are not practical. This note indicates a way of designing trusses with finite numbers of bars that achieve nearly the same economy of material as the corresponding Michell structures.
openaire   +2 more sources