2 resultados para Bounded languages
em Brock University, Canada
Resumo:
The major hypothesis of this paper is that any deviance in syntax present in oral language will be evident in oral r eading behaviour. Using Lee and Canter's Developmental i 1 Sentence Scoring technique (1971) and Y. Goodman and Burke's Reading Miscue Inventory (1972) linguistic competence was established in t hree male children. ages 10 to 11. patterns of strengths and weaknesses in reading were determined. and the relationships t hat were established, were examined. Results of the study i ndicate that oral language behaviour is closely tied to oral r eading behaviour. This type of approach can be used as a basis for a diagnosis of a reading difficulty and then a prescription for language and reading skills.
Resumo:
The Two-Connected Network with Bounded Ring (2CNBR) problem is a network design problem addressing the connection of servers to create a survivable network with limited redirections in the event of failures. Particle Swarm Optimization (PSO) is a stochastic population-based optimization technique modeled on the social behaviour of flocking birds or schooling fish. This thesis applies PSO to the 2CNBR problem. As PSO is originally designed to handle a continuous solution space, modification of the algorithm was necessary in order to adapt it for such a highly constrained discrete combinatorial optimization problem. Presented are an indirect transcription scheme for applying PSO to such discrete optimization problems and an oscillating mechanism for averting stagnation.