A autodeterminação de jovens com necessidades educativas especiais

A Autodeterminação é considerada por alguns autores como um conjunto de atitudes que possibilitam que cada pessoa defina metas e seja capaz de, por iniciativa própria, alcançar os seus objectivos (Field & Hoffman, 1996; Poulsen, Rodger, & Ziviani, 2006; Wehmeyer, 1998, 2007; Wehmeyer & Metzler, 1995). No âmbito deste conceito é extremamente relevante identificar no indivíduo aspetos importantes, designadamente a autorrealização que permite alcançar todo o potencial, a assertividade para dizer de forma direta e clara quais as suas necessidades, a criatividade como apoio para ultrapassar os papéis estereotipados e expectativas, a crença para reconhecer as suas capacidades e contribuição para a sociedade e a autorrepresentação para garantir a viabilização dos serviços e concretização de todo o potencial (Field & Hoffman, 1996). Nesta lógica surge um outro conceito que também assume grande importância: o self-advocacy (autorrepresentação) (Santos & Morato, 2002). Brinckerhoff (1993) definiu a autorrepresentação como a habilidade para reconhecer e responder às necessidades específicas de uma dificuldade de aprendizagem, sem comprometer a dignidade de si mesmo e dos outros. Para Wehmeyer e Metzler (1995) a Autodeterminação num indivíduo, não é suscetível de ser diretamente avaliada, podendo apenas ser observada através das ações e comportamentos do próprio. Mediante a avaliação desses mesmos comportamentos podemos verificar se a pessoa desenvolveu competências para autodeterminar o seu projeto de vida. Estudos realizados com base na Autodeterminação da pessoa com deficiência mental (DM) (Houghton, Bronicki, & Guess, 1987; Kishi, Teelucksingh, Zollers, Park-Lee, & Meyer, 1988; Murtaugh & Zetlin, 1990), concluem que a população jovem adulta com DM não vivencia uma grande panóplia de experiências em que lhe seja proporcionada oportunidade de expressar preferências, fazer escolhas e tomar decisões (Wehmeyer & Metzler, 1995). Mesmo quando se vislumbra um novo paradigma face à DM em que se percebe a importância deste conceito (Autodeterminação) como fundamental para a realização pessoal desta população, nem sempre existe uma resposta coerente por parte da sociedade, pois uma grande parte mantêm-se obstinada e resistente, ignorando a idade cronológica dos indivíduos e focando-se na sua suposta idade mental, o que leva por vezes a interações enviesadas e inadequadas. Nesta lógica, é óbvio, que se é tratada como uma criança, irá de certeza assumir comportamentos como tal (Glat, 1999). Jovens com competências de Autodeterminação possuem maiores possibilidades de obter sucesso na transição para a vida adulta onde se inclui o emprego e a vida social (Agran & Wehmeyer, 2000). Constata-se que os jovens com DM podem enfrentar obstáculos que aparentemente lhes pareçam difíceis ou mesmo impossíveis de transpor, podendo apenas necessitar de apoio e intervenções específicas para os auxiliarem com as transições de papéis que experienciam. Estas transições de papéis são vividas de forma diferente de indivíduo para indivíduo e dependem do desenvolvimento de cada jovem, das suas capacidades e dificuldades e da existência de suporte familiar e ambiental (King, Baldwin, Currie, & Evans, 2005). Para que a transição de papéis possa ser vivida de forma harmoniosa e tendo em conta uma perspetiva de inclusão, a maioria das crianças e jovens com deficiência têm sido integradas no ensino regular e, nesse sentido, é de todo importante realçar a necessidade de apoio que permita uma participação efetiva dos mesmos no contexto escolar, orientando as suas atividades e integrando-as da forma mais completa possível (Loukas, 2007; Mu, Gabriel Franck, & Konz, 2007). A literatura aponta para um papel fundamental da Terapia Ocupacional no que diz respeito à escola inclusiva, cujo objetivo se foca em facilitar o envolvimento ativo dos jovens, tendo em conta que estes experimentam as mudanças inerentes à adolescência que associadas ao processo de transição resultam num percurso difícil, principalmente para jovens com deficiência (Loukas, 2007; Michaels & Orentlicher, 2004; J. Spencer, Emery, & Schneck, 2003). A Terapia Ocupacional assume um papel importante em todo o processo de envolvimento e na intervenção nas escolas, apoiando a transição e potenciando o desenvolvimento de competências de desempenho (físicas, cognitivas, emocionais e sociais), a adaptação de contextos e a participação efetiva da criança ou jovem nas atividades educativas e na vida na comunidade (Conaboy et al., 2008b; Mu et al., 2007; K. C. Spencer & O'Daniel, 2005). É relevante o desenvolvimento e manutenção de hábitos e rotinas adequadas de forma a alcançar o sucesso escolar e a aprendizagem de estratégias para a vida na comunidade, bem como conseguir que o indivíduo seja capaz de autodeterminar os seus projetos de vida para uma participação efetiva (Chambers et al., 2007; Conaboy et al., 2008a, 2008b; Poulsen et al., 2006). Realça-se que a Autodeterminação tem por base componentes como a autonomia comportamental, na qual o indivíduo vai-se desenvolvendo no sentido da autoproteção e auto-orientação; o Empowerment Psicológico, em que se parte para a ação convicto de que se é capaz de aplicar as competências que são exigidas para alcançar os resultados desejados; o autocontrolo e a autorrealização (Wehmeyer, 1998). Promover a Autodeterminação é, sem dúvida, um aspeto crucial dos projetos educativos dos alunos com DM (Agran & Wehmeyer, 2000; Black & Ornelles, 2001; Mancini & Coster, 2004; Wehmeyer, 1998; Wehmeyer & Schwartz, 1998), onde se enfatizam as competências e a preparação para o emprego e para uma vida o mais independente possível (Conaboy et al., 2008a, 2008b). Em Portugal, na legislação, vigora que as escolas que comportam o funcionamento do Ensino Especial devem contemplar os projetos educativos, visto que estes assumem importância tanto para os alunos integrados que deles beneficiam, como para toda a comunidade educativa. Deve-se documentar a avaliação dos alunos e as respostas educativas específicas para cada caso, promovendo a aprendizagem, a capacitação e a aquisição de competências para a inserção comunitária (por exemplo a nível laboral), tendo em conta o projeto de vida do aluno em questão (Chambers et al., 2007; Michaels & Orentlicher, 2004; Williams-Diehm & Lynch, 2007). O envolvimento da criança ou jovem e da sua família como membros da equipa em todo o processo de transição é um aspeto valioso (Wehmeyer, 1998; Wehmeyer & Schwartz, 1998).De forma a compreender a vantagem da Autodeterminação para o sucesso destes alunos, em contexto escolar e na vida adulta, é pertinente referir os Programas Individuais de Transição (PIT) (Fingles, Hinkle, & Van Horn, 2004). Estes surgem da necessidade de incluir as pessoas com deficiência, visando a máxima independência, o envolvimento a nível comunitário e a manutenção e criação de relações pessoais e sociais (Black & Ornelles, 2001; Fingles et al., 2004; Sitlington, 1996; Wehmeyer, Garner, Yeager, & Lawrence, 2006). Aos PIT está fortemente aliada a Autodeterminação para promover a participação dos jovens em todo o processo. Alguns estudos revelam que jovens mais autodeterminados colaboram continuamente nas reuniões de planeamento e fundamentam as questões que são do seu interesse (Sitlington, 1996). Neste momento, permanece ainda incerto até que ponto a inclusão escolar dos jovens com Necessidades Educativas Especiais (NEE) em Portugal se encontra a promover a sua Autodeterminação. De facto, são poucos os estudos que indicam até que ponto os PIT’s estão concebidos para o estabelecimento de uma Autodeterminação elevada nestes jovens. Foi nesse sentido que realizamos um estudo de desenho observacional descritivo, com os objetivos de analisar o nível de Autodeterminação de jovens que frequentam o 2º e 3º ciclos do ensino básico e secundário sinalizados como tendo NEE e de comparar os níveis de Autodeterminação entre um grupo de jovens com NEE e um grupo de jovens sem NEE.

Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

LLF (Least Laxity First) scheduling, which assigns a higher priority to a task with a smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, little work has been made to illuminate its characteristics upon multiprocessor platforms. In this paper, we identify the dynamics of laxity from the system’s viewpoint and translate the dynamics into LLF multiprocessor schedulability analysis. More specifically, we first characterize laxity properties under LLF scheduling, focusing on laxity dynamics associated with a deadline miss. These laxity dynamics describe a lower bound, which leads to the deadline miss, on the number of tasks of certain laxity values at certain time instants. This lower bound is significant because it represents invariants for highly dynamic system parameters (laxity values). Since the laxity of a task is dependent of the amount of interference of higher-priority tasks, we can then derive a set of conditions to check whether a given task system can go into the laxity dynamics towards a deadline miss. This way, to the author’s best knowledge, we propose the first LLF multiprocessor schedulability test based on its own laxity properties. We also develop an improved schedulability test that exploits slack values. We mathematically prove that the proposed LLF tests dominate the state-of-the-art EDZL tests. We also present simulation results to evaluate schedulability performance of both the original and improved LLF tests in a quantitative manner.

Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems

It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation.

Response time analysis of COTS-Based multicores considering the contention on the shared memory bus

The current industry trend is towards using Commercially available Off-The-Shelf (COTS) based multicores for developing real time embedded systems, as opposed to the usage of custom-made hardware. In typical implementation of such COTS-based multicores, multiple cores access the main memory via a shared bus. This often leads to contention on this shared channel, which results in an increase of the response time of the tasks. Analyzing this increased response time, considering the contention on the shared bus, is challenging on COTS-based systems mainly because bus arbitration protocols are often undocumented and the exact instants at which the shared bus is accessed by tasks are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. This paper makes three contributions towards analyzing tasks scheduled on COTS-based multicores. Firstly, we describe a method to model the memory access patterns of a task. Secondly, we apply this model to analyze the worst case response time for a set of tasks. Although the required parameters to obtain the request profile can be obtained by static analysis, we provide an alternative method to experimentally obtain them by using performance monitoring counters (PMCs). We also compare our work against an existing approach and show that our approach outperforms it by providing tighter upper-bound on the number of bus requests generated by a task.

Maximizing contention-free executions in multiprocessor scheduling

It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with each other for processors, and this could produce more contention-free slots at which the number of competing tasks is smaller than or equal to the number of available processors. This paper presents a policy (called CF policy) that utilizes such contention-free slots effectively. This policy can be employed by any work-conserving, preemptive scheduling algorithm, and we show that any algorithm extended with this policy dominates the original algorithm in terms of schedulability. We also present improved schedulability tests for algorithms that employ this policy, based on the observation that interference from tasks is reduced when their executions are postponed to contention-free slots. Finally, using the properties of the CF policy, we derive a counter-intuitive claim that shortening of task deadlines can help improve schedulability of task systems. We present heuristics that effectively reduce task deadlines for better scheduability without performing any exhaustive search.

Optimal virtual cluster-based multiprocessor scheduling

Scheduling of constrained deadline sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal scheduler is hard, and therefore most studies have focused on developing algorithms with good processor utilization bounds. These algorithms can be broadly classified into two categories: partitioned scheduling in which tasks are statically assigned to individual processors, and global scheduling in which each task is allowed to execute on any processor in the platform. In this paper we consider a third, more general, approach called cluster-based scheduling. In this approach each task is statically assigned to a processor cluster, tasks in each cluster are globally scheduled among themselves, and clusters in turn are scheduled on the multiprocessor platform. We develop techniques to support such cluster-based scheduling algorithms, and also consider properties that minimize total processor utilization of individual clusters. In the last part of this paper, we develop new virtual cluster-based scheduling algorithms. For implicit deadline sporadic task systems, we develop an optimal scheduling algorithm that is neither Pfair nor ERfair. We also show that the processor utilization bound of us-edf{m/(2m−1)} can be improved by using virtual clustering. Since neither partitioned nor global strategies dominate over the other, cluster-based scheduling is a natural direction for research towards achieving improved processor utilization bounds.

Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems

Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving).

Multiprocessor real-time scheduling considering concurrency and urgency

It has been widely studied how to schedule real-time tasks on multiprocessor platforms. Several studies find optimal scheduling policies for implicit deadline task systems, but it is hard to understand how each policy utilizes the two important aspects of scheduling real-time tasks on multiprocessors:inter-job concurrency and job urgency. In this paper, we introduce a new scheduling policy that considers these two properties. We prove that the policy is optimal for the special case when the execution time of all tasks are equally one and deadlines are implicit, and observe that the policy is a new concept in that it is not an instance of Pfair or ERfair. It remains open to find a schedulability condition for general task systems under our scheduling policy.

A compositional scheduling framework for digital avionics systems

ARINC specification 653-2 describes the interface between application software and underlying middleware in a distributed real-time avionics system. The real-time workload in this system comprises of partitions, where each partition consists of one or more processes. Processes incur blocking and preemption overheads and can communicate with other processes in the system. In this work we develop compositional techniques for automated scheduling of such partitions and processes. At present, system designers manually schedule partitions based on interactions they have with the partition vendors. This approach is not only time consuming, but can also result in under utilization of resources. In contrast, the technique proposed in this paper is a principled approach for scheduling ARINC-653 partitions and therefore should facilitate system integration.

Simulation relations, interface complexity, and resource optimality for real-time hierachical systems

Compositional schedulability analysis of hierarchical realtime systems is a well-studied problem. Various techniques have been developed to abstract resource requirements of components in such systems, and schedulability has been addressed using these abstract representations (also called component interfaces). These approaches for compositional analysis incur resource overheads when they abstract components into interfaces. In this talk, we define notions of resource schedulability and optimality for component interfaces, and compare various approaches.

LLF schedulability analysis on multiprocessor platforms

LLF (Least Laxity First) scheduling, which assigns a higher priority to a task with smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, its characteristics upon multiprocessor platforms have been little studied until now. Orthogonally, it has remained open how to efficiently schedule general task systems, including constrained deadline task systems, upon multiprocessors. Recent studies have introduced zero laxity (ZL) policy, which assigns a higher priority to a task with zero laxity, as a promising scheduling approach for such systems (e.g., EDZL). Towards understanding the importance of laxity in multiprocessor scheduling, this paper investigates the characteristics of ZL policy and presents the first ZL schedulability test for any work-conserving scheduling algorithm that employs this policy. It then investigates the characteristics of LLF scheduling, which also employs the ZL policy, and derives the first LLF-specific schedulability test on multiprocessors. It is shown that the proposed LLF test dominates the ZL test as well as the state-of-art EDZL test.

Online robust optimization framework for QoS guarantees in distributed soft real-time systems

In distributed soft real-time systems, maximizing the aggregate quality-of-service (QoS) is a typical system-wide goal, and addressing the problem through distributed optimization is challenging. Subtasks are subject to unpredictable failures in many practical environments, and this makes the problem much harder. In this paper, we present a robust optimization framework for maximizing the aggregate QoS in the presence of random failures. We introduce the notion of K-failure to bound the effect of random failures on schedulability. Using this notion we define the concept of K-robustness that quantifies the degree of robustness on QoS guarantee in a probabilistic sense. The parameter K helps to tradeoff achievable QoS versus robustness. The proposed robust framework produces optimal solutions through distributed computations on the basis of Lagrangian duality, and we present some implementation techniques. Our simulation results show that the proposed framework can probabilistically guarantee sub-optimal QoS which remains feasible even in the presence of random failures.

Development of procedures for the simulation of atmospheric flows over complex terrain, using OpenFOAM

The main purpose of this work was the development of procedures for the simulation of atmospheric ows over complex terrain, using OpenFOAM. For this aim, tools and procedures were developed apart from this code for the preprocessing and data extraction, which were thereafter applied in the simulation of a real case. For the generation of the computational domain, a systematic method able to translate the terrain elevation model to a native OpenFOAM format (blockMeshDict) was developed. The outcome was a structured mesh, in which the user has the ability to de ne the number of control volumes and its dimensions. With this procedure, the di culties of case set up and the high computation computational e ort reported in literature associated to the use of snappyHexMesh, the OpenFOAM resource explored until then for the accomplishment of this task, were considered to be overwhelmed. Developed procedures for the generation of boundary conditions allowed for the automatic creation of idealized inlet vertical pro les, de nition of wall functions boundary conditions and the calculation of internal eld rst guesses for the iterative solution process, having as input experimental data supplied by the user. The applicability of the generated boundary conditions was limited to the simulation of turbulent, steady-state, incompressible and neutrally strati ed atmospheric ows, always recurring to RaNS (Reynolds-averaged Navier-Stokes) models. For the modelling of terrain roughness, the developed procedure allowed to the user the de nition of idealized conditions, like an uniform aerodynamic roughness length or making its value variable as a function of topography characteristic values, or the using of real site data, and it was complemented by the development of techniques for the visual inspection of generated roughness maps. The absence and the non inclusion of a forest canopy model limited the applicability of this procedure to low aerodynamic roughness lengths. The developed tools and procedures were then applied in the simulation of a neutrally strati ed atmospheric ow over the Askervein hill. In the performed simulations was evaluated the solution sensibility to di erent convection schemes, mesh dimensions, ground roughness and formulations of the k - ε and k - ω models. When compared to experimental data, calculated values showed a good agreement of speed-up in hill top and lee side, with a relative error of less than 10% at a height of 10 m above ground level. Turbulent kinetic energy was considered to be well simulated in the hill windward and hill top, and grossly predicted in the lee side, where a zone of ow separation was also identi ed. Despite the need of more work to evaluate the importance of the downstream recirculation zone in the quality of gathered results, the agreement between the calculated and experimental values and the OpenFOAM sensibility to the tested parameters were considered to be generally in line with the simulations presented in the reviewed bibliographic sources.

P53 and Cancer-Associated Sialylated Glycans Are Surrogate Markers of Cancerization of the Bladder Associated with Schistosoma haematobium Infection

BACKGROUND: Bladder cancer is a significant health problem in rural areas of Africa and the Middle East where Schistosoma haematobium is prevalent, supporting an association between malignant transformation and infection by this blood fluke. Nevertheless, the molecular mechanisms linking these events are poorly understood. Bladder cancers in infected populations are generally diagnosed at a late stage since there is a lack of non-invasive diagnostic tools, hence enforcing the need for early carcinogenesis markers. METHODOLOGY/PRINCIPAL FINDINGS: Forty-three formalin-fixed paraffin-embedded bladder biopsies of S. haematobium-infected patients, consisting of bladder tumours, tumour adjacent mucosa and pre-malignant/malignant urothelial lesions, were screened for bladder cancer biomarkers. These included the oncoprotein p53, the tumour proliferation rate (Ki-67>17%), cell-surface cancer-associated glycan sialyl-Tn (sTn) and sialyl-Lewisa/x (sLea/sLex), involved in immune escape and metastasis. Bladder tumours of non-S. haematobium etiology and normal urothelium were used as controls. S. haematobium-associated benign/pre-malignant lesions present alterations in p53 and sLex that were also found in bladder tumors. Similar results were observed in non-S. haematobium associated tumours, irrespectively of their histological nature, denoting some common molecular pathways. In addition, most benign/pre-malignant lesions also expressed sLea. However, proliferative phenotypes were more prevalent in lesions adjacent to bladder tumors while sLea was characteristic of sole benign/pre-malignant lesions, suggesting it may be a biomarker of early carcionogenesis associated with the parasite. A correlation was observed between the frequency of the biomarkers in the tumor and adjacent mucosa, with the exception of Ki-67. Most S. haematobium eggs embedded in the urothelium were also positive for sLea and sLex. Reinforcing the pathologic nature of the studied biomarkers, none was observed in the healthy urothelium. CONCLUSION/SIGNIFICANCE: This preliminary study suggests that p53 and sialylated glycans are surrogate biomarkers of bladder cancerization associated with S. haematobium, highlighting a missing link between infection and cancer development. Eggs of S. haematobium express sLea and sLex antigens in mimicry of human leukocytes glycosylation, which may play a role in the colonization and disease dissemination. These observations may help the early identification of infected patients at a higher risk of developing bladder cancer and guide the future development of non-invasive diagnostic tests.

Engineering Temporal and Spatial Aspects in OWL using Patterns

WWW is a huge, open, heterogeneous system, however its contents data is mainly human oriented. The Semantic Web needs to assure that data is readable and “understandable” to intelligent software agents, though the use of explicit and formal semantics. Ontologies constitute a privileged artifact for capturing the semantic of the WWW data. Temporal and spatial dimensions are transversal to the generality of knowledge domains and therefore are fundamental for the reasoning process of software agents. Representing temporal/spatial evolution of concepts and their relations in OWL (W3C standard for ontologies) it is not straightforward. Although proposed several strategies to tackle this problem but there is still no formal and standard approach. This work main goal consists of development of methods/tools to support the engineering of temporal and spatial aspects in intelligent systems through the use of OWL ontologies. An existing method for ontology engineering, Fonte was used as framework for the development of this work. As main contributions of this work Fonte was re-engineered in order to: i) support the spatial dimension; ii) work with OWL Ontologies; iii) and support the application of Ontology Design Patterns. Finally, the capabilities of the proposed approach were demonstrated by engineering time and space in a demo ontology about football.