Search results for "Rete"
showing 10 items of 3470 documents
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.
Ultrametric Finite Automata and Turing Machines
2013
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.
Ultrametric Algorithms and Automata
2015
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.
Upper bounds on multiparty communication complexity of shifts
1996
We consider some communication complexity problems which arise when proving lower bounds on the complexity of Boolean functions. In particular, we prove an \(O(\frac{n}{{2\sqrt {\log n} }}\log ^{1/4} n)\)upper bound on 3-party communication complexity of shifts, an O(n e ) upper bound on the multiparty communication complexity of shifts for a polylogarithmic number of parties. These bounds are all significant improvements over ones recently considered “unexpected” by Pudlak [5].
Some decisional problems on rational relations
1997
Abstract In this paper we prove that the problem of deciding whether a deterministic rational relation is star-free is recursively solvable, although the same problem for any rational relation is undecidable. We also prove that a rational relation is star-free if and only if it is aperiodic and deterministic.
Properties and constraints of cheating-immune secret sharing schemes
2006
AbstractA secret sharing scheme is a cryptographic protocol by means of which a dealer shares a secret among a set of participants in such a way that it can be subsequently reconstructed by certain qualified subsets. The setting we consider is the following: in a first phase, the dealer gives in a secure way a piece of information, called a share, to each participant. Then, participants belonging to a qualified subset send in a secure way their shares to a trusted party, referred to as a combiner, who computes the secret and sends it back to the participants.Cheating-immune secret sharing schemes are secret sharing schemes in the above setting where dishonest participants, during the recons…
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
1984
We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding toGale, Farkas, Gordan andMotzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.
The role of nanoparticles in decreased washout of underwater concrete
2019
Abstract The paper presents research results of the influence of SiO2 nanoparticles on the washout of underwater concrete and hardened concrete. Based on infrared spectroscopy (FTIR) and thermogravimetric (TGA) analyses of the applied anti-washout admixture (AWA), its chemical structure was determined. A beneficial effect of SiO2 nanoparticles on the reduction of the mix washout was demonstrated and the most probable reason for that phenomenon was given, taking into account the AWA chemical structure and its behaviour in the concrete mix environment. It was found that a dosing method of AWA and nanoparticles to the concrete influenced the washout.
Experimental Investigation of the Shear Response of Precast Steel-Concrete Trussed Beams
2017
The results of an experimental campaign of three-point bending tests on precast composite beams, named hybrid steel-trussed concrete beams (HSTCBs), are provided. HSTCBs are typically constituted by a precast steel truss embedded in a block of concrete cast in place. Two series of specimens were manufactured, designed such that shear failure would occur, and tested under positive and negative bending moment. The experimental results obtained showed that fragile shear failure occurred in almost all cases, evidencing the crisis of the compressed concrete strut involved in the collapse mechanism. Yielding of the steel members provided ductility to the system, especially in those cases in which…
Association of Thyroid Function Test Abnormalities and Thyroid Autoimmunity With Preterm Birth A Systematic Review and Meta-analysis
2019
Preterm birth complicates 5% to 15% of births worldwide, and although it is the most important direct cause of morbidity and mortality in children younger than 5 years, no known risk factors can be identified in the majority of cases. However, overt hypothyroidism and hyperthyroidism during pregnancy are well-known risk factors for preterm birth, and as such, the purpose of this study was to assess whether thyroid function test abnormalities and thyroid peroxidase (TPO) antibody positivity were associated with preterm birth. The study conducted a systematic review on the association of thyroid function or autoimmunity with preterm birth published from database inception to March 18, 2018, w…