Search results for "Grammar"

Building Construction Sets by Tiling Grammar Simplification

2016

This paper poses the problem of fabricating physical construction sets from example geometry: A construction set provides a small number of different types of building blocks from which the example model as well as many similar variants can be reassembled. This process is formalized by tiling grammars. Our core contribution is an approach for simplifying tiling grammars such that we obtain physically manufacturable building blocks of controllable granularity while retaining variability, i.e., the ability to construct many different, related shapes. Simplification is performed by sequences of two types of elementary operations: non-local joint edge collapses in the tile graphs reduce the gra…

Conjunction, Disjunction and Iterated Conditioning of Conditional Events

2013

Starting from a recent paper by S. Kaufmann, we introduce a notion of conjunction of two conditional events and then we analyze it in the setting of coherence. We give a representation of the conjoined conditional and we show that this new object is a conditional random quantity, whose set of possible values normally contains the probabilities assessed for the two conditional events. We examine some cases of logical dependencies, where the conjunction is a conditional event; moreover, we give the lower and upper bounds on the conjunction. We also examine an apparent paradox concerning stochastic independence which can actually be explained in terms of uncorrelation. We briefly introduce the…

Tally languages accepted by Monte Carlo pushdown automata

1997

Rather often difficult (and sometimes even undecidable) problems become easily decidable for tally languages, i.e. for languages in a single-letter alphabet. For instance, the class of languages recognizable by 1-way nondeterministic pushdown automata equals the class of the context-free languages, but the class of the tally languages recognizable by 1-way nondeterministic pushdown automata, contains only regular languages [LP81]. We prove that languages over one-letter alphabet accepted by randomized one-way 1-tape Monte Carlo pushdown automata are regular. However Monte Carlo pushdown automata can be much more concise than deterministic 1-way finite state automata.

A Logic of Discovery

1998

A logic of discovery is introduced. In this logic, true sentences are discovered over time based on arriving data. A notion of expectation is introduced to reflect the growing certainty that a universally quantified sentence is true as more true instances are observed. The logic is shown to be consistent and complete. Monadic predicates are considered as a special case

Speckle based configuration for simultaneousin vitroinspection of mechanical contractions of cardiac myocyte cells

2013

In this manuscript we propose optical lensless configuration for a remote non-contact measuring of mechanical contractions of vast number of cardiac myocytes. All the myocytes were taken from rats, and the measurements were done in an in vitro mode. The optical method is based on temporal analysis of secondary reflected speckle patterns generated in lensless microscope configuration. The processing involves analyzing the movement and the change in the statistics of the generated secondary speckle patterns that are created on top of the cell culture when it is illuminated by a spot of laser beam. The main advantage of the proposed system is the ability to measure many cells simultaneously (a…

Learning the structure of HMM's through grammatical inference techniques

2002

A technique is described in which all the components of a hidden Markov model are learnt from training speech data. The structure or topology of the model (i.e. the number of states and the actual transitions) is obtained by means of an error-correcting grammatical inference algorithm (ECGI). This structure is then reduced by using an appropriate state pruning criterion. The statistical parameters that are associated with the obtained topology are estimated from the same training data by means of the standard Baum-Welch algorithm. Experimental results showing the applicability of this technique to speech recognition are presented. >

Action Observation Network Activity Related to Object-Directed and Socially-Directed Actions in Adolescents

2020

The human action observation network (AON) encompasses brain areas consistently engaged when we observe other's actions. Although the core nodes of the AON are present from childhood, it is not known to what extent they are sensitive to different action features during development. Because social cognitive abilities continue to mature during adolescence, the AON response to socially-oriented actions, but not to object-related actions, may differ in adolescents and adults. To test this hypothesis, we scanned with functional magnetic resonance imaging (fMRI) male and female typically-developing teenagers (n= 28; 13 females) and adults (n= 25; 14 females) while they passively watched videos of…

Application of graph grammars in music composing systems

1987

Nanaj hǝsǝwǝni taceoceori daŋsa boŋgodu taceocemi tǝpciuuri skoladu: grammatika tǝrǝk niruuri: II pasi: elacean, dujǝciǝn klass

1935

Nanaju (goldu) valodas mācību grāmata 3. un 4. klasei.

Nanaj hǝsǝwǝni taceoceori daŋsa boŋgodu taceocemi tǝpciuuri skoladu: grammatika tǝrǝk niruuri: boŋgo pasi: boŋgo, ʒuǝjǝ taceoceori klass

1934

Nanaju (goldu) valodas mācību grāmata 1. un 2. klasei.