Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Ordinal ultrafilters versus P-hierarchy  [PDF]
Andrzej Starosolski
Mathematics , 2012,
Abstract: An earlier paper, entitled "P-hierarchy on $\beta\omega$", investigated the relations between ordinal ultrafilters and the so-called P-hierarchy. This study is continued in the present paper and focuses on the aspects of characterization of classes of finite index, existence, generic existence and the Rudin-Keisler-order.
About Notations in Multiway Array Processing  [PDF]
Jeremy E. Cohen
Computer Science , 2015,
Abstract: This paper gives an overview of notations used in multiway array processing. We redefine the vectorization and matricization operators to comply with some properties of the Kronecker product. The tensor product and Kronecker product are also represented with two different symbols, and it is shown how these notations lead to clearer expressions for multiway array operations. Finally, the paper recalls the useful yet widely unknown properties of the array normal law with suggested notations.
Notations Around the World: Census and Exploitation  [PDF]
Paul Libbrecht
Computer Science , 2010,
Abstract: Mathematical notations around the world are diverse. Not as much as requiring computing machines' makers to adapt to each culture, but as much as to disorient a person landing on a web-page with a text in mathematics. In order to understand better this diversity, we are building a census of notations: it should allow any content creator or mathematician to grasp which mathematical notation is used in which language and culture. The census is built collaboratively, collected in pages with a given semantic and presenting observations of the widespread notations being used in existing materials by a graphical extract. We contend that our approach should dissipate the fallacies found here and there about the notations in "other cultures" so that a better understanding of the cultures can be realized. The exploitation of the census in the math-bridge project is also presented: this project aims at taking learners "where they are in their math-knowledge" and bring them to a level ready to start engineering studies. The census serves as definitive reference for the transformation elements that generate the rendering of formul{\ae} in web-browsers.
Ordinal Compactness  [PDF]
Paolo Lipparini
Mathematics , 2010,
Abstract: We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the particular case when the parameters are cardinal numbers, we get back a classical notion. Generalized to ordinal numbers, this notion turns out to behave in a much more varied way. We present many examples of spaces satisfying the very same cardinal compactness properties, but with a broad range of distinct behaviors, with respect to ordinal compactness. A much more refined theory is obtained for $T_1$ spaces, in comparison with arbitrary topological spaces. The notion of ordinal compactness becomes partly trivial for spaces of small cardinality.
Conditional entropy of ordinal patterns  [PDF]
Anton M. Unakafov,Karsten Keller
Mathematics , 2014, DOI: 10.1016/j.physd.2013.11.015
Abstract: In this paper we investigate a quantity called conditional entropy of ordinal patterns, akin to the permutation entropy. The conditional entropy of ordinal patterns describes the average diversity of the ordinal patterns succeeding a given ordinal pattern. We observe that this quantity provides a good estimation of the Kolmogorov-Sinai entropy in many cases. In particular, the conditional entropy of ordinal patterns of a finite order coincides with the Kolmogorov-Sinai entropy for periodic dynamics and for Markov shifts over a binary alphabet. Finally, the conditional entropy of ordinal patterns is computationally simple and thus can be well applied to real-world data.
Ordinal sums of representable uninorms  [PDF]
Andrea Mesiarova-Zemankova
Mathematics , 2015,
Abstract: We investigate properties of an ordinal sum of uninorms introduced in [8] in the case that the summands are proper representable uninorms. We show sufficient and necessary conditions for a uninorm to be an ordinal sum of representable uninorms.
Noncrossing Ordinal Classification  [PDF]
Xingye Qiao
Statistics , 2015,
Abstract: Ordinal data are often seen in real applications. Regular multicategory classification methods are not designed for this data type and a more proper treatment is needed. We consider a framework of ordinal classification which pools the results from binary classifiers together. An inherent difficulty of this framework is that the class prediction can be ambiguous due to boundary crossing. To fix this issue, we propose a noncrossing ordinal classification method which materializes the framework by imposing noncrossing constraints. An asymptotic study of the proposed method is conducted. We show by simulated and data examples that the proposed method can improve the classification performance for ordinal data without the ambiguity caused by boundary crossings.
Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity  [PDF]
Marie Ferbus-Zanda,Serge Grigorieff
Mathematics , 2008,
Abstract: We consider classical representations of integers: Church's function iterators, cardinal equivalence classes of sets, ordinal equivalence classes of totally ordered sets. Since programs do not work on abstract entities and require formal representations of objects, we effectivize these abstract notions in order to allow them to be computed by programs. To any such effectivized representation is then associated a notion of Kolmogorov complexity. We prove that these Kolmogorov complexities form a strict hierarchy which coincides with that obtained by relativization to jump oracles and/or allowance of infinite computations.
Transductive Ordinal Regression  [PDF]
Chun-Wei Seah,Ivor W. Tsang,Yew-Soon Ong
Computer Science , 2011, DOI: 10.1109/TNNLS.2012.2198240
Abstract: Ordinal regression is commonly formulated as a multi-class problem with ordinal constraints. The challenge of designing accurate classifiers for ordinal regression generally increases with the number of classes involved, due to the large number of labeled patterns that are needed. The availability of ordinal class labels, however, is often costly to calibrate or difficult to obtain. Unlabeled patterns, on the other hand, often exist in much greater abundance and are freely available. To take benefits from the abundance of unlabeled patterns, we present a novel transductive learning paradigm for ordinal regression in this paper, namely Transductive Ordinal Regression (TOR). The key challenge of the present study lies in the precise estimation of both the ordinal class label of the unlabeled data and the decision functions of the ordinal classes, simultaneously. The core elements of the proposed TOR include an objective function that caters to several commonly used loss functions casted in transductive settings, for general ordinal regression. A label swapping scheme that facilitates a strictly monotonic decrease in the objective function value is also introduced. Extensive numerical studies on commonly used benchmark datasets including the real world sentiment prediction problem are then presented to showcase the characteristics and efficacies of the proposed transductive ordinal regression. Further, comparisons to recent state-of-the-art ordinal regression methods demonstrate the introduced transductive learning paradigm for ordinal regression led to the robust and improved performance.
Veblen Hierarchy
Grzegorz Bancerek
Formalized Mathematics , 2011, DOI: 10.2478/v10037-011-0014-5
Abstract: The Veblen hierarchy is an extension of the construction of epsilon numbers (fixpoints of the exponential map: ωε = ε). It is a collection φα of the Veblen Functions where φ0(β) = ωβ and φ1(β) = εβ. The sequence of fixpoints of φ1 function form φ2, etc. For a limit non empty ordinal λ the function φλ is the sequence of common fixpoints of all functions φα where α < λ. The Mizar formalization of the concept cannot be done directly as the Veblen functions are classes (not (small) sets). It is done with use of universal sets (Tarski classes). Namely, we define the Veblen functions in a given universal set and φα(β) as a value of Veblen function from the smallest universal set including α and β.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.