Complex question answering on semi-structured repositories: a user centric process enhanced with context

A Teia Mundial (Web) foi prevista como uma rede de documentos de hipertexto interligados de forma a criar uma espaço de informação onde humanos e máquinas poderiam comunicar. No entanto, a informação contida na Web tradicional foi/é armazenada de forma não estruturada o que leva a que apenas os humanos a possam consumir convenientemente. Consequentemente, a procura de informações na Web sintáctica é uma tarefa principalmente executada pelos humanos e nesse sentido nem sempre é fácil de concretizar. Neste contexto, tornou-se essencial a evolução para uma Web mais estruturada e mais significativa onde é dado significado bem definido à informação de forma a permitir a cooperação entre humanos e máquinas. Esta Web é usualmente referida como Web Semântica. Além disso, a Web Semântica é totalmente alcançável apenas se os dados de diferentes fontes forem ligados criando assim um repositório de Dados Abertos Ligados (LOD). Com o aparecimento de uma nova Web de Dados (Abertos) Ligados (i.e. a Web Semântica), novas oportunidades e desafios surgiram. Pergunta Resposta (QA) sobre informação semântica é actualmente uma área de investigação activa que tenta tirar vantagens do uso das tecnologias ligadas à Web Semântica para melhorar a tarefa de responder a questões. O principal objectivo do projecto World Search passa por explorar a Web Semântica para criar mecanismos que suportem os utilizadores de domínios de aplicação específicos a responder a questões complexas com base em dados oriundos de diferentes repositórios. No entanto, a avaliação feita ao estado da arte permite concluir que as aplicações existentes não suportam os utilizadores na resposta a questões complexas. Nesse sentido, o trabalho desenvolvido neste documento foca-se em estudar/desenvolver metodologias/processos que permitam ajudar os utilizadores a encontrar respostas exactas/corretas para questões complexas que não podem ser respondidas fazendo uso dos sistemas tradicionais. Tal inclui: (i) Ultrapassar a dificuldade dos utilizadores visionarem o esquema subjacente aos repositórios de conhecimento; (ii) Fazer a ponte entre a linguagem natural expressa pelos utilizadores e a linguagem (formal) entendível pelos repositórios; (iii) Processar e retornar informações relevantes que respondem apropriadamente às questões dos utilizadores. Para esse efeito, são identificadas um conjunto de funcionalidades que são consideradas necessárias para suportar o utilizador na resposta a questões complexas. É também fornecida uma descrição formal dessas funcionalidades. A proposta é materializada num protótipo que implementa as funcionalidades previamente descritas. As experiências realizadas com o protótipo desenvolvido demonstram que os utilizadores efectivamente beneficiam das funcionalidades apresentadas: ▪ Pois estas permitem que os utilizadores naveguem eficientemente sobre os repositórios de informação; ▪ O fosso entre as conceptualizações dos diferentes intervenientes é minimizado; ▪ Os utilizadores conseguem responder a questões complexas que não conseguiam responder com os sistemas tradicionais. Em suma, este documento apresenta uma proposta que comprovadamente permite, de forma orientada pelo utilizador, responder a questões complexas em repositórios semiestruturados.

Invisible cities: the table of contents and the labyrinths of reality

In Invisible Cities (1972), Italo Calvino contrasts a rigid outline structure with a flexible textual content. The tension comprised by the numerical structure proposed in the table of contents stands out against the set of polissemic texts which make up the subject matter of the book. The opposition between form and content point to a fruitful dichotomy in the conception of the novel linked to the theories of the open and closed work. This essay will investigate the structural construction of Invisible Cities by looking at its table of contents, seeking to discuss some models of formalistic representation proposed by the criticism and the specific contribution they may, or may not, provide. The objective is to analyse the pertinence of such theories in the light of historical and cultural approaches. Aiming to uncover possible meanings which arise from the debate, this essay will question to what extent structural complexities can be considered literary if they are not ultimately related to the culture in which a text is found.

Literature, translation and national identity: Christina Rossetti and Rosalía de Castro in the work of Plácido Castro

Plácido Castro‘s work has aroused our interest, because it evolves around the question of Galician personality and identity. While working as a journalist and a translator or while writing essays on different literary issues, Plácido Castro has never forgotten his roots or his nation. One could even say that his whole life turns around Galicia. Our purpose is to make a critical analysis of his work, especially as a translator, and try to show how he used translation in order to develop national conscience and identity and to see how far his ideology interfered in the interpretation and translation of Rossetti‘s poetry, in which he found a great similarity with Rosalìa de Castro‘s work.

Work in progress - learning through role play games

It is commonly accepted that the educational environment has been undergoing considerable change due to the use of the Information and Communication tools. But learning depends upon actions such as experimenting, visualizing and demonstrating through which the learner succeeds in constructing his own knowledge. Although it is not easy to achieve these actions through current ICT supported learning approaches, Role Playing Games (RPG) may well develop such capacities. The creation of an interactive computer game with RPG characteristics, about the 500th anniversary of the city of Funchal, the capital of Madeira Island, is invested with compelling educational/pedagogical implications, aiming clearly at teaching history and social relations through playing. Players interpret different characters in different settings/scenarios, experiencing adventures, meeting challenges and trying to reach multiple and simultaneous goals in the areas of education, entertainment and social integration along the first 150 years of the history of Funchal. Through this process they will live and understand all the social and historical factors of that epoch.

Deteção e acompanhamento de movimento através de uma câmara de vídeo

A deteção e seguimento de pessoas tem uma grande variedade de aplicações em visão computacional. Embora tenha sido alvo de anos de investigação, continua a ser um tópico em aberto, e ainda hoje, um grande desafio a obtenção de uma abordagem que inclua simultaneamente exibilidade e precisão. O trabalho apresentado nesta dissertação desenvolve um caso de estudo sobre deteção e seguimento automático de faces humanas, em ambiente de sala de reuniões, concretizado num sistema flexível de baixo custo. O sistema proposto é baseado no sistema operativo GNU's Not Unix (GNU) linux, e é dividido em quatro etapas, a aquisição de vídeo, a deteção da face, o tracking e reorientação da posição da câmara. A aquisição consiste na captura de frames de vídeo das três câmaras Internet Protocol (IP) Sony SNC-RZ25P, instaladas na sala, através de uma rede Local Area Network (LAN) também ele já existente. Esta etapa fornece os frames de vídeo para processamento à detecção e tracking. A deteção usa o algoritmo proposto por Viola e Jones, para a identificação de objetos, baseando-se nas suas principais características, que permite efetuar a deteção de qualquer tipo de objeto (neste caso faces humanas) de uma forma genérica e em tempo real. As saídas da deteção, quando é identificado com sucesso uma face, são as coordenadas do posicionamento da face, no frame de vídeo. As coordenadas da face detetada são usadas pelo algoritmo de tracking, para a partir desse ponto seguir a face pelos frames de vídeo subsequentes. A etapa de tracking implementa o algoritmo Continuously Adaptive Mean-SHIFT (Camshift) que baseia o seu funcionamento na pesquisa num mapa de densidade de probabilidade, do seu valor máximo, através de iterações sucessivas. O retorno do algoritmo são as coordenadas da posição e orientação da face. Estas coordenadas permitem orientar o posicionamento da câmara de forma que a face esteja sempre o mais próximo possível do centro do campo de visão da câmara. Os resultados obtidos mostraram que o sistema de tracking proposto é capaz de reconhecer e seguir faces em movimento em sequências de frames de vídeo, mostrando adequabilidade para aplicação de monotorização em tempo real.

Instrumentação e monitorização na avaliação do comportamento de maciços e estruturas envolventes: caso de poços em meio urbano

Atualmente, a escavação de poços em locais densamente ocupados requer medidas severas para reduzir riscos e possíveis influências quer na própria obra quer em estruturas próximas. Neste campo, a instrumentação geotécnica e a sua monitorização tem um papel determinante na execução de obras geotécnicas, sendo que neste trabalho é dado um especial realce à instrumentação utilizada, às atividades de observação geotécnica, bem como à análise e interpretação das leituras para o controlo de movimentos induzidos no terreno pelas escavações. Este acompanhamento é baseado num plano de instrumentação, sendo descrito de uma forma transversal a importância do projeto e em particular das fases do processo de investigação geotécnica. O acompanhamento da execução dos poços para a futura Estação da Reboleira, permitiu validar as soluções de projeto para um determinado método construtivo, determinadas através de métodos numéricos e semi-empíricos, e abordados neste trabalho. A monitorização sistemática desde o início das escavações até ao revestimento secundário, permitiu tecer apreciações sobre os valores obtidos, apresentando-se alguns registos. Todas estas ações visam controlar e antecipar riscos de acidentes provocados pela execução de escavações, pelo que nesta tese é também realçada a importância da segurança e higiene no trabalho na prevenção dos riscos profissionais, independentemente da sua origem.

Adsorption kinetics of removal of yellow lanasol dyestuff using gallinaceous feathers

Gallinaceous feathers are an abundant solid waste from the poultry processing industries, which poses disposal problems. A kinetic study dealing with the adsorption process of wool reactive dye, Yellow Lanasol 4G (CI Reactive Yellow 39), on gallinaceous (Gallus gallus, Cobb 500) feathers was carried out. The main research goals of this work were to evaluate the viability of using this waste as adsorbent and to study the kinetics of the adsorption process, using a synthetic effluent. The characterization of feathers was performed by scanning electron microscopy, mercury porosimetry and B.E.T. method. The study of several factors (stirring, particles size, initial dye concentration and temperature) showed their influence over the adsorption process. An adapted version of the Schumckler and Goldstein´s unreacted core model fitted the experimental data. The best fit was obtained when the rate-limiting step was the diffusion through the reacted layer, which was expected considering the size of the dyestuff molecules. The comparison with the granular activated carbon (GAC) Sutcliffe GAC 10-30 indicate that in spite of the high adsorption capacities shown by feathers the GAC presented higher values, the values obtained were respectively 150 and 219 mg g-1, for an initial concentration of 500 mg L-1. The results obtained might open future perspectives both to the valorization of feathers and to the economical treatment of textile wastewaters.

Growth and characterization of Cu2ZnSn(S,Se)4 thin films for solar cells

Cu2ZnSnS4 (CZTS) and Cu2ZnSnSe4 (CZTSe) with their band gap energies around 1.45 eV and 1.0 eV, respectively, can be used as the absorber layer in thin film solar cells. By using a mixture of both compounds, Cu2ZnSn(S,Se)4 (CZTSSe), a band gap tuning may be possible. The latter material has already shown promising results such as solar cell efficiencies up to 10.1%. In this work, CZTSSe thin films were grown in order to study its structure and to establish the best growth precursors. SEM micrographs reveal an open columnar structure for most samples and EDS composition profiling of the cross sections show different selenium gradients. X-ray diffractograms show different shifts of the kesterite/stannite (1 1 2) peak, which indicate the presence of CZTSSe. From Raman scattering analysis, it was concluded that all samples had traces of CZTS and CZTSSe. The composition of the CZTSSe layer was estimated using X-ray diffraction and Raman scattering and both results were compared. It was concluded that Se diffused more easily in precursors with ternary Cu–Sn–S phases and metallic Zn than in precursors with ZnS and/or CZTS already formed. It was also showed that a combination of X-ray diffraction and Raman scattering can be used to estimate the ratio of S per Se in CZTSSe samples.

A feedback-based decentralised coordination model for distributed open real-time systems

Moving towards autonomous operation and management of increasingly complex open distributed real-time systems poses very significant challenges. This is particularly true when reaction to events must be done in a timely and predictable manner while guaranteeing Quality of Service (QoS) constraints imposed by users, the environment, or applications. In these scenarios, the system should be able to maintain a global feasible QoS level while allowing individual nodes to autonomously adapt under different constraints of resource availability and input quality. This paper shows how decentralised coordination of a group of autonomous interdependent nodes can emerge with little communication, based on the robust self-organising principles of feedback. Positive feedback is used to reinforce the selection of the new desired global service solution, while negative feedback discourages nodes to act in a greedy fashion as this adversely impacts on the provided service levels at neighbouring nodes. The proposed protocol is general enough to be used in a wide range of scenarios characterised by a high degree of openness and dynamism where coordination tasks need to be time dependent. As the reported results demonstrate, it requires less messages to be exchanged and it is faster to achieve a globally acceptable near-optimal solution than other available approaches.

Supporting real-time parallel task models with work-stealing

Dynamic parallel scheduling using work-stealing has gained popularity in academia and industry for its good performance, ease of implementation and theoretical bounds on space and time. Cores treat their own double-ended queues (deques) as a stack, pushing and popping threads from the bottom, but treat the deque of another randomly selected busy core as a queue, stealing threads only from the top, whenever they are idle. However, this standard approach cannot be directly applied to real-time systems, where the importance of parallelising tasks is increasing due to the limitations of multiprocessor scheduling theory regarding parallelism. Using one deque per core is obviously a source of priority inversion since high priority tasks may eventually be enqueued after lower priority tasks, possibly leading to deadline misses as in this case the lower priority tasks are the candidates when a stealing operation occurs. Our proposal is to replace the single non-priority deque of work-stealing with ordered per-processor priority deques of ready threads. The scheduling algorithm starts with a single deque per-core, but unlike traditional work-stealing, the total number of deques in the system may now exceed the number of processors. Instead of stealing randomly, cores steal from the highest priority deque.

How to integrate stories and ICT in content-based units of work for English learning

The aim of this article is to show how it is possible to integrate stories and ICT in Content Language Integrated Learning (CLIL) for English as a foreign language (EFL) learning in bilingual schools. Two Units of Work are presented. One, for the second year of Primary, is based on a Science topic, ‘Materials’. The story used is ‘The three little pigs’ and the computer program ‘JClic’. The other one is based on a Science and Arts topic for the sixth year of Primary, the story used is ‘Charlotte’s Web’ and the computer program ‘Atenex’.

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 capacity sharing and stealing strategy for open real-time systems

This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems. It starts by presenting a capacity sharing and stealing (CSS) strategy that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) reclaiming unused reserved capacity when jobs complete in less than their budgeted execution time and (ii) stealing reserved capacity from inactive non-isolated servers used to schedule best-effort jobs. CSS is then combined with the concept of bandwidth inheritance to efficiently exchange reserved bandwidth among sets of inter-dependent tasks which share resources and exhibit precedence constraints, assuming no previous information on critical sections and computation times is available. The proposed Capacity Exchange Protocol (CXP) has a better performance and a lower overhead when compared against other available solutions and introduces a novel approach to integrate precedence constraints among tasks of open real-time systems.

Coordinated runtime adaptations in cooperative open real-time systems

This paper proposes an one-step decentralised coordination model based on an effective feedback mechanism to reduce the complexity of the needed interactions among interdependent nodes of a cooperative distributed system until a collective adaptation behaviour is determined. Positive feedback is used to reinforce the selection of the new desired global service solution, while negative feedback discourages nodes to act in a greedy fashion as this adversely impacts on the provided service levels at neighbouring nodes. The reduced complexity and overhead of the proposed decentralised coordination model are validated through extensive evaluations.

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.