135 resultados para timed automata


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

One of the most controversial issues in the history of Phonetics is the discussion about the typology of speech rhythm. Out of the Greek and Latin tradition on poetry versification, the notion of rhythm has been misunderstood as speech rate. In the early years of the 20th century, a dichotomy merged classifying the speech rhythm into stress-timed and syllable-timed languages, inspired by the old theory of poetic versification. Following the same old pattern, later on, a third type of language were proposed: the moraic languages, initially attributed only to Japanese. With the facilities to carry on acoustic research, in the second half of the 20th century, the typology of language rhythm came to a dead end. Different types of language were set out. This paper discusses these ideas, showing a great misunderstanding among researchers in relation to the characterization of a syllable-timed language. The notion of mora is revisited and its role in the study of speech rhythm is better defined.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The language typology of speech rhythm has been investigated by many researchers in different languages. However, they have not reached a unanimous conclusion. Part of the misunderstanding is due to the methodology they used. In addition, there is some theoretical confusion on the definition of a syllable timed language. This paper refers to the last question, but without discussing others people works and theories. Instead, it points out some essential questions that have not been taken into consideration in the discussion.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Pós-graduação em Desenvolvimento Humano e Tecnologias - IBRC

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Objective. This study aimed to evaluate the effect of a long-period multimodal exercise program on balance, mobility and clinical status of patients with Parkinson’s disease (PD). Methods. Thirty-three PD patients were assigned into two groups: a training group (TG—n = 22; aged 67.23 ± 8.39 years) and a control group (CG—n = 9; aged 71.56 ± 8.50 years). The TG patients were enrolled in a 6-month multimodal exercise program. This program was designed to improve physical capacity components and to reduce PD impairments. Balance and mobility were assessed immediately before and after the training protocol using the Berg Balance Scale (BBS), the “Timed up and go” (TUG), and the Posture Locomotion Test (PLM). Also, clinical variables were assessed (disease stage and impairments). Results. The TG showed an improvement in the TUG (P = 0.006) while CG were not influenced by the 6-months period. Both groups showed no differences for BBS and PLM and for their disease impairments—assessed through the Unified Parkinson’s disease Scale. Conclusions. Long-term multimodal exercise programs are able to improve mobility of patients with Parkinson’s disease and therefore should be used on clinical day life.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This undergraduate thesis aims formally define aspects of Quantum Turing Machine using as a basis quantum finite automata. We introduce the basic concepts of quantum mechanics and quantum computing through principles such as superposition, entanglement of quantum states, quantum bits and algorithms. We demonstrate the Bell's teleportation theorem, enunciated in the form of Deutsch-Jozsa definition for quantum algorithms. The way as the overall text were written omits formal aspects of quantum mechanics, encouraging computer scientists to understand the framework of quantum computation. We conclude our thesis by listing the Quantum Turing Machine's main limitations regarding the well-known Classical Turing Machines