Search results for "DF"

0450 Preventing and promoting musculoskeletal health at the workplace through the design and evaluation of an innovative multicomponent intervention:…

2017

Objectives Musculoskeletal disorders (MSD) are main cause of work absence, reducing sustainability of working trajectories. The objective of INTEVAL_Spain project is to assess the effectiveness of a multifactorial intervention at the workplace to prevent MSD. Methods The intervention comprises evidence-based primary (participatory ergonomics-PE), secondary and tertiary prevention (case management-CM), and health promotion targeted to MSD. All components are integrated and require full coordination. A cluster randomized trial with a late intervention control group is being implemented to evaluate its effectiveness. Quantitative and qualitative information is being obtained from databases of …

The goldfish--a colour-constant animal.

1996

A series of either thirteen or fifteen coloured test fields with hues from blue through grey to yellow were presented on a black background. Goldfish were trained on a bluish-grey test field by food reward. In the training situation, the setup with the coloured papers was illuminated with white light. In the test situation, the colour of the illumination was changed to blue or yellow. In both test illuminations the goldfish preferred the training field in the same way as under white illumination despite the fact that this test field stimulated the cone types very differently from the training situation. As test fields were present that excited the cones in exactly the same way as under whi…

Co-learnability and FIN-identifiability of enumerable classes of total recursive functions

1994

Co-learnability is an inference process where instead of producing the final result, the strategy produces all the natural numbers but one, and the omitted number is an encoding of the correct result. It has been proved in [1] that co-learnability of Goedel numbers is equivalent to EX-identifiability. We consider co-learnability of indices in recursively enumerable (r.e.) numberings. The power of co-learnability depends on the numberings used. Every r.e. class of total recursive functions is co-learnable in some r.e. numbering. FIN-identifiable classes are co-learnable in all r.e. numberings, and classes containing a function being accumulation point are not co-learnable in some r.e. number…

Hamming, Permutations and Automata

2007

Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published "folk theorem" proving that quantum finite automata with mixed states are no more than superexponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We prove that there is an infinite sequence of distinct int…

Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States

2008

Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published "folk theorem" proving that quantum finite automata with mixed states are no more than super-exponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We use a novel proof technique based on Kolmogorov complex…

On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity

2005

We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.

LE AREE INTERNE PER LO SVILUPPO DEL TERRITORIO E LA COMPLEMENTARITÀ DI PROGRAMMI E STRUMENTI FRA LE POLITICHE EUROPEE DI SVILUPPO RURALE E DI COESIONE

Le Aree Interne rappresentano un tema particolarmente importante per la programmazione e la spesa dei fondi comunitari nel periodo 2014-2020 perché costituiscono il più grande esempio di complementarità fra le Politiche europee di sviluppo rurale e di coesione. Per lo sviluppo di queste Aree è stata creata una Strategia Nazionale per le Aree Interne (SNAI) che mira alla valorizzazione ed al recupero di tutti quei territori (rurali, montuosi, svantaggiati) dal carattere marginale rispetto alla disponibilità e all’offerta di servizi essenziali. La peculiarità di tale Strategia è quella di promuovere lo sviluppo di aree che sono uniformemente distribuite in tutto il comprensorio nazionale a di…

Learning with belief levels

2008

AbstractWe study learning of predicate logics formulas from “elementary facts,” i.e. from the values of the predicates in the given model. Several models of learning are considered, but most of our attention is paid to learning with belief levels. We propose an axiom system which describes what we consider to be a human scientist's natural behavior when trying to explore these elementary facts. It is proved that no such system can be complete. However we believe that our axiom system is “practically” complete. Theorems presented in the paper in some sense confirm our hypothesis.

Conformational analysis of methyl-substituted 9,10-dihydroanthracenes

2005

The amount of the ring puckering in methyl-substituted 9,10- dihydroanthracene was theoretically determined through DFT calculations. Theoretical calculations allowed to obtain the geometrical structures and energetic data on the different considered isomers.

Descriptive Complexity, Lower Bounds and Linear Time

1999

This paper surveys two related lines of research: Logical characterizations of (non-deterministic) linear time complexity classes, and non-expressibility results concerning sublogics of existential second-order logic. Starting from Fagin’s fundamental work there has been steady progress in both fields with the effect that the weakest logics that are used in characterizations of linear time complexity classes are closely related to the strongest logics for which inexpressibility proofs for concrete problems have been obtained. The paper sketches these developments and highlights their connections as well as the obstacles that prevent us from closing the remaining gap between both kinds of lo…