96,560 Hits in 3.8 sec

Fair curve networks in nonlinear geometries

Johannes Wallner, Helmut Pottmann, Michael Hofer
2005 ACM SIGGRAPH 2005 Sketches on - SIGGRAPH '05  
Fair curve networks in nonlinear geometries are an extension of our work [Hofer and Pottmann 2004] on energy-minimizing spline curves in manifolds.  ...  A curve network N consists of a finite set C of curves c, each of them defined in its parameter interval [a c , b c ].  ...  Characterization and Computation A curve network N consists of a finite set C of curves c, each of them defined in its parameter interval [a c , b c ].  ... 
doi:10.1145/1187112.1187149 dblp:conf/siggraph/WallnerPH05 fatcat:evpz5bmmzva65da3oxjkcc6gna

ℵ0-Categorical, ℵ0-stable structures

G. Cherlin, L. Harrington, A.H. Lachlan
1985 Annals of Pure and Applied Logic  
Strictly minimal sets may be classified in terms of certain geometries associated with them.  ...  Let r be a doubly transitive permutation group on a finite set X and let N be a minimal normal subgroup.  ... 
doi:10.1016/0168-0072(85)90023-5 fatcat:tkh6acpimzae7kw7iwkqadlqxa

Page 416 of Mathematical Reviews Vol. 52, Issue 2 [page]

1976 Mathematical Reviews  
Chapter 2 introduces the class of combinatorial designs, includ- ing the finite planes and the pairwise balanced and group divisible designs.  ...  Kallaher (Kaiserslautern) Lozanov, Cavdar G. 2923 Minimal systems of axioms that define a finite projective plane. (Bulgarian. Russian and English summaries) B'lgar. Akad. Nauk. Izv. Mat.  ... 

Page 299 of Mathematical Reviews Vol. 38, Issue 2 [page]

1969 Mathematical Reviews  
The final section of this chapter, entitled “Geometry of finite vector spaces’, begins with a brief introduction to general projective and affine geometry and proceeds to a detailed discussion of the Desarguesian  ...  Dembowski [ Finite geometries, p. 139; #1597 below]. A. Barlotti (Perugia) Dembowski, P. *Finite geometries. Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 44.  ... 

On the Importance of Sleeve Flexibility in Passive Control of Critical Speeds of a Rotating Shaft Using Eccentric Sleeves

Antony Kirk, Jonathan Griffiths
2019 Machines  
The results are compared with the results of dynamic finite element simulations.  ...  In this paper, the critical speeds of a rotating shaft fitted with eccentric balance sleeves are identified from a scaled, high speed experimental test facility.  ...  Symmetry of orbit and centering of shaft displacement were checked and a mean displacement obtained for each data set.  ... 
doi:10.3390/machines7030056 fatcat:wjjos7rbobajvbaxx2r5z33noe

Application of Cyclic Collineations to the Construction of Balanced $L$-Restrictional Prime Powered Lattice Designs

B. L. Raktoe
1967 The Annals of Mathematical Statistics  
Since collineations are defined on the finite projective geometry PG(m-l,s), the 1:1 correspondence between the pseudo effects and the points of PG(m-l,s) is illustrated and confounding schemes in terms  ...  The construction of balanced £-restrictional prime powered lattice designs by means of cyclic collineations is shown by limiting the discussion to 2 2-restrictional lattice design (or lattice rectangle  ...  \·Jhen we define balancing in terms of effects, i.e. a balanced lattice rectangle is a minimal set of confounding schemes such that each effect is confounded in an e~ual number of scl}emes 1....  ... 
doi:10.1214/aoms/1177698781 fatcat:lit6qgbrkjgfphw3z56nc7d6iu

Page 18 of Mathematical Reviews Vol. 45, Issue 1 [page]

1973 Mathematical Reviews  
It is shown that nondegenerate quadrics of particular types in finite Euclidean geometry can be used to construct balanced incomplete block designs.  ...  91-96 these from nondegenerate quadrics in finite projective | geometry is outlined.  ... 

Page 3465 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
The generalized balanced ternary (GBT,,) provides one method for ad- dressing the cells in a tiling of R” by permutohedra using finite sequences of integers between 0 and 2”+! —2.  ...  Betke and the reviewer [J. Reine Angew. Math. 453 (1994), 165- 191], and their applications to classical finite and infinite packing problems. {For the entire collection see MR 95d:52002.}  ... 

Sampling by Divergence Minimization [article]

Ameer Dharamshi, Vivian Ngo, Jeffrey S. Rosenthal
2022 arXiv   pre-print
The divergence minimization algorithms are tested on target distributions with irregularly shaped modes and we provide results demonstrating the effectiveness of our methods.  ...  Our algorithm minimizes the information projection component of the Kullback-Leibler (KL) divergence between the proposal and target distributions to encourage proposals that are distributed similarly  ...  In other words, we replace the acceptance rule α with the following: Algorithm 2 Divergence Minimization Sampler with Finite Adaptation 1: Inputs (defaults): target p(x), balancing parameter β (0.2), initial  ... 
arXiv:2105.00520v2 fatcat:fdxejhgmhjepvo3u36scifdgqq

Page 1393 of Mathematical Reviews Vol. , Issue 82d [page]

1982 Mathematical Reviews  
Then the partial geometry has point set GF(81), line set {b+S|b€GF(81)}, and natural incidence. We note that this was the only unknown partial geometry with s=1 and a=2.  ...  . $2d:05041 Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields. Combinatorica 1 (1981), no. 1, 63-73.  ... 

Page 473 of Mathematical Reviews Vol. , Issue 83b [page]

1983 Mathematical Reviews  
A (finite) projective plane of order p is a family of sets of cardinality p+ 1 [see R. J. Mihalek, Projective geometry and algebraic structures, Academic Press, New York, 1972; MR 53 #1380].  ...  The author deals with finite partial geometries which satisfy the axiom of Pasch, and gives necessary and sufficient conditions for such a partial geometry to be regular (for this concept see an article  ... 

Interoperable geometry and mesh components for SciDAC applications

T J Tautges, P Knupp, J A Kraftcheck, H J Kim
2005 Journal of Physics, Conference Series  
Software components for representing and evaluating geometry (TSTTG/CGM) and finite element mesh (TSTTM/MOAB), and a higher-level component for relations between the two (TSTTR/LASSO), have been combined  ...  Despite this flexibility, the TSTT data model uses only four fundamental data types (entities, sets, tags, and the interface object itself).  ...  LASSO: A Component For Relating Geometry & Mesh Domain Data Although modern finite element meshing tools require access to both geometry and mesh, we keep the representations of mesh and geometry separate  ... 
doi:10.1088/1742-6596/16/1/067 fatcat:z4uyordhwbggniqnrsdxzaogs4

Page 1844 of Mathematical Reviews Vol. , Issue 82e [page]

1982 Mathematical Reviews  
M,/q);P 1), (M2/q2; p2)) where both M, and M, are minimally 2-connected having at least four elements and { p,,q,} and { p>,q>} are cocircuits of M, and M,, respectively.  ...  From the introduction: “An attempt is made to obtain a necessary condition for the existence of an MDPB association scheme defined over a collection of / finite sets of objects under the assumption that  ... 

Page 8003 of Mathematical Reviews Vol. , Issue 2003j [page]

2003 Mathematical Reviews  
A shortest path problem consists of a 5-tuple: a finite player set NV; a finite node set V with two special nodes, called the source and the sink; each player i owns a set A; of di- rected arcs in the  ...  A convex geometry Y on a finite set N is a family of subsets of N such that @EY, NEL; S,TEL implies SAOTEL; SE Y\{N} implies SU {i} € Y for some i € N\S.  ... 

Page 1220 of Mathematical Reviews Vol. 46, Issue 5 [page]

1973 Mathematical Reviews  
(b) what are the minimal complete sets when (7) and (8) are adjoined, separately, to the rest?  ...  ., that of differential geometry and axiomatic algebra.  ... 
« Previous Showing results 1 — 15 out of 96,560 results