28,733 research outputs found
Curriculum Guidelines for Undergraduate Programs in Data Science
The Park City Math Institute (PCMI) 2016 Summer Undergraduate Faculty Program
met for the purpose of composing guidelines for undergraduate programs in Data
Science. The group consisted of 25 undergraduate faculty from a variety of
institutions in the U.S., primarily from the disciplines of mathematics,
statistics and computer science. These guidelines are meant to provide some
structure for institutions planning for or revising a major in Data Science
Cultural dialects of real and synthetic emotional facial expressions
In this article we discuss the aspects of designing facial expressions for virtual humans (VHs) with a specific culture. First we explore the notion of cultures and its relevance for applications with a VH. Then we give a general scheme of designing emotional facial expressions, and identify the stages where a human is involved, either as a real person with some specific role, or as a VH displaying facial expressions. We discuss how the display and the emotional meaning of facial expressions may be measured in objective ways, and how the culture of displayers and the judges may influence the process of analyzing human facial expressions and evaluating synthesized ones. We review psychological experiments on cross-cultural perception of emotional facial expressions. By identifying the culturally critical issues of data collection and interpretation with both real and VHs, we aim at providing a methodological reference and inspiration for further research
Creating a Relational Distributed Object Store
In and of itself, data storage has apparent business utility. But when we can
convert data to information, the utility of stored data increases dramatically.
It is the layering of relation atop the data mass that is the engine for such
conversion. Frank relation amongst discrete objects sporadically ingested is
rare, making the process of synthesizing such relation all the more
challenging, but the challenge must be met if we are ever to see an equivalent
business value for unstructured data as we already have with structured data.
This paper describes a novel construct, referred to as a relational distributed
object store (RDOS), that seeks to solve the twin problems of how to
persistently and reliably store petabytes of unstructured data while
simultaneously creating and persisting relations amongst billions of objects.Comment: 12 pages, 5 figure
Diszkrét matematika = Discrete mathematics
A pályázat résztvevői igen aktívak voltak a 2006-2008 években. Nemcsak sok eredményt értek el, miket több mint 150 cikkben publikáltak, eredményesen népszerűsítették azokat. Több mint 100 konferencián vettek részt és adtak elő, felerészben meghívott, vagy plenáris előadóként. Hagyományos gráfelmélet Több extremális gráfproblémát oldottunk meg. Új eredményeket kaptunk Ramsey számokról, globális és lokális kromatikus számokról, Hamiltonkörök létezéséséről. a crossig numberről, gráf kapacitásokról és kizárt részgráfokról. Véletlen gráfok, nagy gráfok, regularitási lemma Nagy gráfok "hasonlóságait" vizsgáltuk. Különféle metrikák ekvivalensek. Űj eredeményeink: Hereditary Property Testing, Inverse Counting Lemma and the Uniqueness of Hypergraph Limit. Hipergráfok, egyéb kombinatorika Új Sperner tipusú tételekte kaptunk, aszimptotikusan meghatározva a halmazok max számát bizonyos kizárt struktőrák esetén. Több esetre megoldottuk a kizárt hipergráf problémát is. Elméleti számítástudomány Új ujjlenyomat kódokat és bioinformatikai eredményeket kaptunk. | The participants of the project were scientifically very active during the years 2006-2008. They did not only obtain many results, which are contained in their more than 150 papers appeared in strong journals, but effectively disseminated them in the scientific community. They participated and gave lectures in more than 100 conferences (with multiplicity), half of them were plenary or invited talks. Traditional graph theory Several extremal problems for graphs were solved. We obtained new results for certain Ramsey numbers, (local and global) chromatic numbers, existence of Hamiltonian cycles crossing numbers, graph capacities, and excluded subgraphs. Random graphs, large graphs, regularity lemma The "similarities" of large graphs were studied. We show that several different definitions of the metrics (and convergence) are equivalent. Several new results like the Hereditary Property Testing, Inverse Counting Lemma and the Uniqueness of Hypergraph Limit were proved Hypergraphs, other combinatorics New Sperner type theorems were obtained, asymptotically determining the maximum number of sets in a family of subsets with certain excluded configurations. Several cases of the excluded hypergraph problem were solved. Theoretical computer science New fingerprint codes and results in bioinformatics were found
Compressing Sparse Sequences under Local Decodability Constraints
We consider a variable-length source coding problem subject to local
decodability constraints. In particular, we investigate the blocklength scaling
behavior attainable by encodings of -sparse binary sequences, under the
constraint that any source bit can be correctly decoded upon probing at most
codeword bits. We consider both adaptive and non-adaptive access models,
and derive upper and lower bounds that often coincide up to constant factors.
Notably, such a characterization for the fixed-blocklength analog of our
problem remains unknown, despite considerable research over the last three
decades. Connections to communication complexity are also briefly discussed.Comment: 8 pages, 1 figure. First five pages to appear in 2015 International
Symposium on Information Theory. This version contains supplementary materia
New Type of Coding Problem Motivated by Database Theory
The present paper is intended to survey the interaction between relational database theory and coding theory. In particular it is shown how an extremal problem for relational databases gives rise to a new type of coding problem. The former concerns minimal representation of branching dependencies that can be considered as a data mining type question. The extremal configurations involve d-distance sets in the space of disjoint pairs of k-element subsets of an n-element set X. Let X be an n-element finite set, 0 < k < n/2 an integer. Suppose that {A(1), B-1} and {A(2), B-2} are pairs of disjoint k-element subsets of X (that is, \A(1)\ = \B-1\ = \A(2)\ = \B-2\ = k, A(1) boolean AND B-1 = 0, A(2) boolean AND B-2 = 0). Define the distance of these pairs by d({A(1), B-1}, {A(2), B-2}) = min{\A(1) - A(2)\ + \B-1 - B-2\, \A(1) - B-2\ + \B-1 - A(2)\). (C) 2004 Elsevier B.V. All rights reserved
Benchmarks of programming languages for special purposes in the space station
Although Ada is likely to be chosen as the principal programming language for the Space Station, certain needs, such as expert systems and robotics, may be better developed in special languages. The languages, LISP and Prolog, are studied and some benchmarks derived. The mathematical foundations for these languages are reviewed. Likely areas of the space station are sought out where automation and robotics might be applicable. Benchmarks are designed which are functional, mathematical, relational, and expert in nature. The coding will depend on the particular versions of the languages which become available for testing
- …