Página 1 dos resultados de 44 itens digitais encontrados em 0.002 segundos

## Tradução, adaptação e aplicabilidade do Dyslexia Early Screening Test (DEST-2) em pré-escolares brasileiros; Translation, adaptation and applicability of the Dyslexia Early Screening Test (DEST-2) in Brazilian preschoolers

Matta, Tatiana Ribeiro Gomes da
Fonte: Biblioteca Digitais de Teses e Dissertações da USP Publicador: Biblioteca Digitais de Teses e Dissertações da USP
Tipo: Dissertação de Mestrado Formato: application/pdf
Relevância na Pesquisa
26.04%

## Health related quality of life measure in systemic pediatric rheumatic diseases and its translation to different languages: an international collaboration

Moorthy, Lakshmi Nandini; Roy, Elizabeth; Kurra, Vamsi; Peterson, Margaret GE; Hassett, Afton L; Lehman, Thomas JA; ; Scott, Christiaan; El-Ghoneimy, Dalia; Saad, Shereen; El Feky, Reem; Al-Mayouf, Sulaiman; Dolezalova, Pavla; Malcova, Hana; Herlin, Troel
Fonte: BioMed Central Publicador: BioMed Central
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
25.88%

## Mui ge kari nerkep – Black & White together: Commissioned historical re-creation and performance by Keriba Wakai at The Inaugural Lowitja O’Donoghue Oration

Newsome, J.; Peters, E.; Kiwat, J.; Pak Poy, A.; Petherick, D.; Rotumah, G.; Turner, A.
Fonte: Centre for Aboriginal Studies in Music; Bonython Hall, University of Adelaide Publicador: Centre for Aboriginal Studies in Music; Bonython Hall, University of Adelaide
Tipo: Event
Relevância na Pesquisa
26.04%
Jennifer Newsome, Eddie Peters, Jardine Kiwat, Anthony Pak Poy, Douglas Petherick, Grayson Rotumah and Ashley Turner, curators, organisers, performers, musical arrangers, lyricists, cultural consultants.; Historical recreation and performance by CASM students and staff of Mui ge kari nerkep – Black & White together, sung in English, Eastern & Western Torres Strait Islander languages. Based on original song We Shall Overcome (Horton, Hamilton, Carawan & Seeger) and 1967 Referendum version sung at the 10th Annual Conference on Aboriginal Affairs, Albert Hall, Canberra. Indigenous arrangement and presentation. Reframing and adaption of a musical work for a highly prestigious and historically significant event. It was collaboratively curated by The Don Dunstan Foundation, Prof. Lowitja O’Donoghue AC CBE DSG, University of Adelaide, University of South Australia, Flinders University, Wilto Yerlo, Yunggorendi First Nations Centre for Higher Education and Research and Reconciliation South Australia Inc. This performance was commercially recorded on DVD by The Don Dunstan Foundation and released under the title of “The inaugural LOWITJA O’DONOGHUE ORATION: Black and White together, we shall overcome, someday.” Produced and published by Don Dunstan Foundation...

## 复兴语言学:一个新的语言学分支; Fu Yin Yu Yan Xue: Yi Ge Xin de Yu Yan Xue Fen zhi

Zuckermann, G.; Jia, X.
Fonte: Beijing Yuyan DAxue Publicador: Beijing Yuyan DAxue
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
36.13%

## A simple software agents framework for building distributed applications.

Kin, Boon Kwang.
Tipo: Tese de Doutorado Formato: xiv, 243 p. ; 28 cm.
Relevância na Pesquisa
26.05%
The development of distributed systems needs to consider multiple factors such as performance, scalability, resource sharing, and fault tolerance. This thesis proposes a simple agent-based framework to address these concerns when building distributed applications. Agents act as interfaces among processes to interact and to cooperate in a distributed environment. These agents encapsulate the implementation details and make the network transparent to running processes. The proposed framework is built on JINI infrastructure. It uses Linda TupleSpace model, a shared network-accessible repository, for different processes to exchange information. Processes are loosely coupled. Under the proposed model, the correspondent language wrappers such as Java, Ada, C++, C and Visual Basic support multiple programming languages. Information exchange among processes is not restricted to data only. Executable components, leveraging on Java code's portability features, can be sent over a heterogeneous environment and executed remotely. This framework can further address several important issues on formal specifications of the communication layer, such as partial failure, synchronization, coordination and heterogeneity, by offering properties in our design for operation timeout...

## Vocational Education in the New EU Member States : Enhancing Labor Market Outcomes and Fiscal Efficiency

Canning, Mary; Godfrey, Martin; Holzer-Zelazewska, Dorota
Fonte: Washington, DC: World Bank Publicador: Washington, DC: World Bank
Tipo: Publications & Research :: Publication; Publications & Research :: Publication
ENGLISH; EN_US
Relevância na Pesquisa
25.88%
This report explores the fiscal aspects of vocational education reform in the context of secondary education as a whole and considers the implications of any changes in the vocational education (VE) system for post-secondary and other modes of skill development. The report begins by describing the inherited system of vocational education in the former socialist countries of Central and Eastern Europe which was based on the assumption that everyone had to be trained for a specific occupation before starting work and that it was the function of vocational schools to provide such training. The report explores the scope for improvements in fiscal efficiency via a number of propositions about VE in the EU8 countries today: a) It would not be possible or advisable to fund adequately a traditional VE system which would provide ready-to-work recruits with narrowly specialized skills for the economy's enterprises; b) One way to reduce costs to government would be to locate practical training entirely in-plant but this is increasingly difficult; c) EU8 employers' traditional expectations of a fully-subsidized VE system delivering ready-to-work...

## O Impacto da Dislexia nas Atividades de Leitura e Escrita na Língua Materna e na Língua Estrangeira no 2º Ciclo do Ensino Básico

Leite, Sónia Maria dos Santos Leite Ruão Pinheiro Harry
Fonte: Repositório Científico Lusófona Publicador: Repositório Científico Lusófona
POR
Relevância na Pesquisa
26.21%
O trabalho de investigação que aqui apresentamos tem como domínio central o estudo da tipologia de erros característica dos alunos disléxicos tanto nas atividades de leitura e escrita na Língua Materna como na Língua Estrangeira. Ler e escrever representam uma necessidade básica que se prolonga ao longo de todo o percurso escolar e da vida do indivíduo, qualquer défice que surja ao nível das competências na leitura e escrita poderá pôr em causa o sucesso académico, profissional e social do indivíduo. Mediante um estudo quali-quantitativo, através da observação direta de alunos com dislexia formalmente diagnosticada a frequentar o 2º CEB (Grupo Experimental, GE constituído por 12 alunos) e de alunos não disléxicos a frequentar as mesmas turmas (Grupo de Controle, GC, constituído igualmente por 12 alunos), quer nas aulas da Língua Portuguesa (LP) quer nas aulas de Língua Estrangeira (LE) (Inglês), assim como com o apoio de todos os materiais inerentes a este estudo, nomeadamente a matriz de observação e registo da tipologia de erros dados pelos alunos quer aquando do processo de leitura e escrita na Língua Materna (LM) quer na LE, a grelha de análise de erros/desvios aquando da leitura de um texto narrativo...

## Suya : a lingua da gente "um estudo fonologico e gramatical"

Marymarcia Guedes
Fonte: Biblioteca Digital da Unicamp Publicador: Biblioteca Digital da Unicamp
Tipo: Tese de Doutorado Formato: application/pdf
Relevância na Pesquisa
26.19%
A Língua Suyá é falada por cerca de 160 índios que habitam a aldeia Ricô, no Parque Indígena do Xingu, Mato Grosso. Este trabalho tem como objetivo principal o estudo de aspectos da fonologia, da morfologia e da sintaxe do Suyá. Na fonologia, observou-se a existência de alofonia em relação aos fonemas consonantais, característica comum às línguas da Família Jê. A análise morfológica revela que o Suyá apresenta uma série de marcadores de caso, diferenciando-a de outras línguas da mesma família. Quanto à sintaxe, observou-se que o padrão mais recorrente dos constituintes oracionais é SOV. O Suyá apresenta estruturalmente características pertinentes a línguas aglutinantes, sendo, aparentemente, uma língua "split". Este trabalho se constitui, também, de um panorama das classificações das Línguas da Família Jê, de estudos realizados com outras línguas da mesma família, mais especificamente, o Xavante, o Xerente, o Canela-Krahô, o Kayapó, o Tapayuna, o Apinayé e o Panará e de um panorama dos estudos realizados até o presente momento com a Língua Suyá. Somando-se, ainda, uma breve discussão sobre a questão língual dialeto; The Suyá consist of an estimated 160 native speakers, living at Ricô village within the Xingu Indigenous Park...

## A fonologia xavante : uma revisitação; Xavante phonology revisited

William Alfred Pickering
Fonte: Biblioteca Digital da Unicamp Publicador: Biblioteca Digital da Unicamp
Tipo: Tese de Doutorado Formato: application/pdf
Relevância na Pesquisa
25.88%

## Tempo, aspecto e modo em contextos discursivos no Kaingang Sul (Jê); Time, aspect and mood in discursive contexts in Southern Kaingang (Ge)

Solange Aparecida Gonçalves
Fonte: Biblioteca Digital da Unicamp Publicador: Biblioteca Digital da Unicamp
Tipo: Tese de Doutorado Formato: application/pdf
Relevância na Pesquisa
46.13%
Neste trabalho busco descrever o funcionamento das categorias temporais, aspectuais, de modo e de modalidade na língua Kaingang Sul (Jê) principalmente a partir de observações de seu emprego em contextos discursivos orais e escritos. Tais categorias são, em sua maioria, gramaticalizadas e abertamente marcadas quando relevantes para o contexto linguístico. Para minha proposição, dividi a tese em 6 capítulos e uma conclusão. No capítulo 1 discorro brevemente sobre a motivação do trabalho e faço algumas observações introdutórias que ajudarão na leitura do restante do texto. Informações sobre quem são os Kaingang também podem ser encontradas. Um sub-item aborda questões de metodologia e trabalho de campo. O capítulo traz ainda uma síntese de informações sobre a língua que tornará mais fácil a leitura e a compreensão dos dados ao longo da tese. O capítulo 2 trata da perspectiva temporal no Kaingang Sul. No capítulo 3 apresento a questão de Aspectualidade, mostrando que há distinção entre as perspectivas Perfectiva e Imperfectiva na língua. O capítulo 4 traz considerações sobre operadores de Modo e de Modalidade. Em um 5º capítulo estão sendo mostrados os diferentes usos ou papéis que os verbos de 'posição' (ou Posicionais) podem exercer na língua Kaingang. Também se poderá observar que há marcadores que aparecem principalmente em narrativas e estarão no capítulo 6 (que faz referência às relações discursivas)...

## Nondeterministic automatic complexity of almost square-free and strongly cube-free words

Hyde, Kayleigh; Kjos-Hanssen, Bjørn
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
26.04%
Shallit and Wang studied deterministic automatic complexity of words. They showed that the automatic Hausdorff dimension $I(\mathbf t)$ of the infinite Thue word satisfies $1/3\le I(\mathbf t)\le 2/3$. We improve that result by showing that $I(\mathbf t)\ge 1/2$. For nondeterministic automatic complexity we show $I(\mathbf t)=1/2$. We prove that such complexity $A_N$ of a word $x$ of length $n$ satisfies $A_N(x)\le b(n):=\lfloor n/2\rfloor + 1$. This enables us to define the complexity deficiency $D(x)=b(n)-A_N(x)$. If $x$ is square-free then $D(x)=0$. If $x$ almost square-free in the sense of Fraenkel and Simpson, or if $x$ is a strongly cube-free binary word such as the infinite Thue word, then $D(x)\le 1$. On the other hand, there is no constant upper bound on $D$ for strongly cube-free words in a ternary alphabet, nor for cube-free words in a binary alphabet. The decision problem whether $D(x)\ge d$ for given $x$, $d$ belongs to $NP\cap E$.

## Most Complex Regular Right-Ideal Languages

Brzozowski, Janusz; Davies, Gareth
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
36.13%
A right ideal is a language L over an alphabet A that satisfies L = LA*. We show that there exists a stream (sequence) (R_n : n \ge 3) of regular right ideal languages, where R_n has n left quotients and is most complex under the following measures of complexity: the state complexities of the left quotients, the number of atoms (intersections of complemented and uncomplemented left quotients), the state complexities of the atoms, the size of the syntactic semigroup, the state complexities of the operations of reversal, star, and product, and the state complexities of all binary boolean operations. In that sense, this stream of right ideals is a universal witness.; Comment: 19 pages, 4 figures, 1 table

## Syntactic Complexity of Suffix-Free Languages

Brzozowski, Janusz; Szykuła, Marek
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
36.13%
We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with $n$ left quotients (that is, with state complexity $n$) is at most $(n-1)^{n-2}+n-2$ for $n\ge 6$. Since this bound is known to be reachable, this settles the problem. We also reduce the alphabet of the witness languages reaching this bound to five letters instead of $n+2$, and show that it cannot be any smaller. Finally, we prove that the transition semigroup of a minimal deterministic automaton accepting a witness language is unique for each $n$.; Comment: 22 pages, 12 figures

## The growth function of S-recognizable sets

Tipo: Artigo de Revista Científica
Relevância na Pesquisa
26.13%
A set $X\subseteq\mathbb N$ is S-recognizable for an abstract numeration system S if the set $\rep_S(X)$ of its representations is accepted by a finite automaton. We show that the growth function of an S-recognizable set is always either $\Theta((\log(n))^{c-df}n^f)$ where $c,d\in\mathbb N$ and $f\ge 1$, or $\Theta(n^r \theta^{\Theta(n^q)})$, where $r,q\in\mathbb Q$ with $q\le 1$. If the number of words of length n in the numeration language is bounded by a polynomial, then the growth function of an S-recognizable set is $\Theta(n^r)$, where $r\in \mathbb Q$ with $r\ge 1$. Furthermore, for every $r\in \mathbb Q$ with $r\ge 1$, we can provide an abstract numeration system S built on a polynomial language and an S-recognizable set such that the growth function of X is $\Theta(n^r)$. For all positive integers k and l, we can also provide an abstract numeration system S built on a exponential language and an S-recognizable set such that the growth function of X is $\Theta((\log(n))^k n^l)$.; Comment: 12 pages

## Most Complex Regular Ideals

Brzozowski, Janusz; Davies, Sylvie; Liu, Bo Yang Victor
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
26.05%
A right ideal (left ideal, two-sided ideal) is a non-empty language $L$ over an alphabet $\Sigma$ that satisfies $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for two-sided ideals. We show that there exist sequences ($L_n \mid n \ge k$) of right, left, and two-sided regular ideals, where $L_n$ has quotient complexity (state complexity) $n$, such that $L_n$ is most complex in its class under the following measures of complexity: the size of the syntactic semigroup, the quotient complexities of the left quotients of $L_n$, the number of atoms (intersections of complemented and uncomplemented left quotients), the quotient complexities of the atoms, and the quotient complexities of reversal, star, product (concatenation), and all binary boolean operations. In that sense, these ideals are "most complex" languages in their classes, or "universal witnesses" to the complexity of the various operations.; Comment: 23 pages, 11 figures. arXiv admin note: text overlap with arXiv:1311.4448

## Large Aperiodic Semigroups

Brzozowski, Janusz; Szykuła, Marek
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
26.13%
The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup generated by transformations induced by non-empty words on the set of states of the automaton. In this paper we search for the largest syntactic semigroup of a star-free language having $n$ left quotients; equivalently, we look for the largest transition semigroup of an aperiodic finite automaton with $n$ states. We introduce two new aperiodic transition semigroups. The first is generated by transformations that change only one state; we call such transformations and resulting semigroups unitary. In particular, we study complete unitary semigroups which have a special structure, and we show that each maximal unitary semigroup is complete. For $n \ge 4$ there exists a complete unitary semigroup that is larger than any aperiodic semigroup known to date. We then present even larger aperiodic semigroups, generated by transformations that map a non-empty subset of states to a single state; we call such transformations and semigroups semiconstant. In particular, we examine semiconstant tree semigroups which have a structure based on full binary trees. The semiconstant tree semigroups are at present the best candidates for largest aperiodic semigroups. We also prove that $2^n-1$ is an upper bound on the state complexity of reversal of star-free languages...

## On the State Complexity of the Shuffle of Regular Languages

Brzozowski, Janusz; Jirásková, Galina; Liu, Bo; Rajasekaran, Aayush; Szykuła, Marek
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
36.19%
We prove that $f(m,n)=2^{mn-1} + 2^{(m-1)(n-1)}(2^{m-1}-1)(2^{n-1}-1)$ is an upper bound on the state complexity of the shuffle operation on two regular languages having the same alphabet and state complexities $m$ and $n$, respectively. We also state partial results about the tightness of this bound: We show that there exist witness languages meeting the bound for every $m \le 5$ and any $n$, and also for $m=n=6$. Moreover, we prove that in the subset automaton of the NFA accepting the shuffle, all $2^{mn}$ states can be distinguishable, and an alphabet of size three suffices for that. It follows that the bound can be met if all $f(m,n)$ states are reachable. We know that an alphabet of size at least $mn$ is required (provided $m,n \ge 2$). The question of reachability, and hence also of the tightness of the bound $f(m,n)$ in general, remains open.; Comment: 13 pages, 4 figures, 4 tables

## Quotient Complexities of Atoms of Regular Languages

Brzozowski, Janusz; Tamm, Hellis
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
36.05%
An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection. The quotient complexity of L, which is the same as the state complexity of L, is the number of quotients of L. We prove that, for any language L with quotient complexity n, the quotient complexity of any atom of L with r complemented quotients has an upper bound of 2^n-1 if r=0 or r=n, and 1+\sum_{k=1}^{r} \sum_{h=k+1}^{k+n-r} C_{h}^{n} \cdot C_{k}^{h} otherwise, where C_j^i is the binomial coefficient. For each n\ge 1, we exhibit a language whose atoms meet these bounds.; Comment: 17 pages, 2 figures, 9 tables

## Beta-representations of 0 and Pisot numbers

Frougny, Christiane; Pelantová, Edita
Tipo: Artigo de Revista Científica
Let $\beta >1$, $d$ a positive integer, and $$Z_{\beta,d}=\{z_{1} z_{2}\cdots \mid \sum_{i\ge 1}z_i \beta^{-i}=0, \; z_i \in \{-d, \ldots, d\}\}$$ be the set of infinite words having value 0 in base $\beta$ on the alphabet $\{-d, \ldots, d\}$. Based on a recent result of Feng on spectra of numbers, we prove that if the set $Z_{\beta,\lceil \beta \rceil -1}$ is recognizable by a finite B\"uchi automaton then $\beta$ is a Pisot number. As a consequence of previous results, the set $Z_{\beta, d}$ is recognizable by a finite B\"uchi automaton for every positive integer $d$ if and only if $Z_{\beta, d}$ is recognizable by a finite B\"uchi automaton for one $d \ge \lceil \beta \rceil -1$. These conditions are equivalent to the fact that $\beta$ is a Pisot number. The bound $\lceil \beta \rceil -1$ cannot be further reduced.
We answer a question of Harju: An infinite square-free ternary word with an $n$-stem factorization exists for any $n\ge 13$. We show that there are uniform ternary morphisms of length $k$ for every $k\ge 23$. This resolves almost completely a problem of the author and Rampersad.