Design of a computerised treatment for short-term memory deficits in aphasia

The treatment of auditory-verbal short-term memory (STM) deficits in aphasia is a growing avenue of research (Martin & Reilly, 2012; Murray, 2012). STM treatment requires time precision, which is suited to computerised delivery. We have designed software, which provides STM treatment for aphasia. The treatment is based on matching listening span tasks (Howard & Franklin, 1990), aiming to improve the temporal maintenance of multi-word sequences (Salis, 2012). The person listens to pairs of word-lists that differ in word-order and decides if the pairs are the same or different. This approach does not require speech output and is suitable for persons with aphasia who have limited or no output. We describe the software and how its review from clinicians shaped its design.

Design techniques for xilinx virtex FPGA configuration memory scrubbers

SRAM-based FPGAs are in-field reconfigurable an unlimited number of times. This characteristic, together with their high performance and high logic density, proves to be very convenient for a number of ground and space level applications. One drawback of this technology is that it is susceptible to ionizing radiation, and this sensitivity increases with technology scaling. This is a first order concern for applications in harsh radiation environments, and starts to be a concern for high reliability ground applications. Several techniques exist for coping with radiation effects at user application. In order to be effective they need to be complemented with configuration memory scrubbing, which allows error mitigation and prevents failures due to error accumulation. Depending on the radiation environment and on the system dependability requirements, the configuration scrubber design can become more or less complex. This paper classifies and presents current and novel design methodologies and architectures for SRAM-based FPGAs, and in particular for Xilinx Virtex-4QV/5QV, configuration memory scrubbers.

Analysis and design of interleaved memory systems

Thesis (M.S.)--Universty of Illinois at Urbana-Champaign.

Combining analytic hierarchy process and goal programming for logistics distribution network design

Logistics distribution network design is one of the major decision problems arising in contemporary supply chain management. The decision involves many quantitative and qualitative factors that may be conflicting in nature. This paper applies an integrated multiple criteria decision making approach to design an optimal distribution network. In the approach, the analytic hierarchy process (AHP) is used first to determine the relative importance weightings or priorities of alternative warehouses with respect to both deliverer oriented and customer oriented criteria. Then, the goal programming (GP) model incorporating the constraints of system, resource, and AHP priority is formulated to select the best set of warehouses without exceeding the limited available resources. In this paper, two commercial packages are used: Expert Choice for determining the AHP priorities of the warehouses, and LINDO for solving the GP model. © 2007 IEEE.

Multiobjective Particle Swarm Approach for the Design of a Brushless DC Wheel Motor

The roots of swarm intelligence are deeply embedded in the biological study of self-organized behaviors in social insects. Particle swarm optimization (PSO) is one of the modern metaheuristics of swarm intelligence, which can be effectively used to solve nonlinear and non-continuous optimization problems. The basic principle of PSO algorithm is formed on the assumption that potential solutions (particles) will be flown through hyperspace with acceleration towards more optimum solutions. Each particle adjusts its flying according to the flying experiences of both itself and its companions using equations of position and velocity. During the process, the coordinates in hyperspace associated with its previous best fitness solution and the overall best value attained so far by other particles within the group are kept track and recorded in the memory. In recent years, PSO approaches have been successfully implemented to different problem domains with multiple objectives. In this paper, a multiobjective PSO approach, based on concepts of Pareto optimality, dominance, archiving external with elite particles and truncated Cauchy distribution, is proposed and applied in the design with the constraints presence of a brushless DC (Direct Current) wheel motor. Promising results in terms of convergence and spacing performance metrics indicate that the proposed multiobjective PSO scheme is capable of producing good solutions.

Universal Set-top Box: A Simple Design to Provide Accessible Services

This paper presents the design of a low cost accessible digital television set-top box. This set-top box was designed and tested to the International ISDB-T system and considered the adoption of solutions that would provide accessible services in digital television in the simplest digital television receiver. The accessible set-top box was evaluated regarding the processing and memory requirements impacts to provide the features for accessible services. The work presents also the access services bandwidth consumption analysis(1).

A Dynamical Modeling to Study the Adaptive Immune System and the Influence of Antibodies in the Immune Memory

Immunological systems have been an abundant inspiration to contemporary computer scientists. Problem solving strategies, stemming from known immune system phenomena, have been successfully applied to chall enging problems of modem computing. Simulation systems and mathematical modeling are also beginning use to answer more complex immunological questions as immune memory process and duration of vaccines, where the regulation mechanisms are not still known sufficiently (Lundegaard, Lund, Kesmir, Brunak, Nielsen, 2007). In this article we studied in machina a approach to simulate the process of antigenic mutation and its implications for the process of memory. Our results have suggested that the durability of the immune memory is affected by the process of antigenic mutation.and by populations of soluble antibodies in the blood. The results also strongly suggest that the decrease of the production of antibodies favors the global maintenance of immune memory.

Genetic covariance among measures of information processing speed, working memory, and IQ

The genetic relationship between lower (information processing speed), intermediate (working memory), and higher levels (complex cognitive processes as indexed by IQ) of mental ability was studied in a classical twin design comprising 166 monozygotic and 190 dizygotic twin pairs. Processing speed was measured by a choice reaction time (RT) task (2-, 4-, and 8-choice), working memory by a visual-spatial delayed response task, and IQ by the Multidimensional Aptitude Battery. Multivariate analysis, adjusted for test-retest reliability, showed the presence of a genetic factor influencing all variables and a genetic factor influencing 4- and 8-choice RTs, working memory, and IQ. There were also genetic factors specific to 8-choice RT, working memory, and IQ. The results confirmed a strong relationship between choice RT and IQ (phenotypic correlations: -0.31 to -0.53 in females, -0.32 to -0.56 in males; genotypic correlations: -0.45 to -0.70) and a weaker but significant association between working memory and IQ (phenotypic: 0.26 in females, 0.13 in males; genotypic: 0.34). A significant part of the genetic variance (43%) in IQ was not related to either choice RT or delayed response performance, and may represent higher order cognitive processes.

Contrasting Epstein-Barr virus-specific cytotoxic T cell responses to HLA A2-restricted epitopes in humans and HLA transgenic mice: implications for vaccine design

This study investigates the hierarchy of cytotoxic T cell (CTL) responses to twelve HLA A2-restricted epitopes from the latent, lytic and structural proteins of Epstein–Barr virus (EBV) in acute infectious mononucleosis and in healthy seropositive donors and the relative immunogenecity of these epitopes in transgenic mice. Responses to the lytic epitope were uniformly strong in all healthy seropositive individuals and acute infectious mononucleosis donors while moderate or low responses were observed to the latent and structural epitopes, respectively in both groups studied. In contrast, when HLA A2/Kb transgenic mice were immunised with these peptide epitopes, CTL responses were observed to all epitopes with a maximal response to the epitopes within the structural proteins and low to moderate responses to the latent epitopes. This hierarchy of CTL responses in mice was also reflected in an MHC stabilisation analysis. These contrasting CTL responses in humans following natural infection compared to the immunogenicity of these epitopes and their ability to stabilise MHC may need to be considered when designing an EBV vaccine.

Self-awareness of Prospective Memory Failure in Adults with Traumatic Brain Injury

The frequency of prospective memory failure in individuals with severe traumatic brain injury (TBI) was investigated by comparison with a non-brain-injured control group. Self-awareness of prospective memory function was also assessed by comparing self-ratings with ratings by significant others. Study participants included 33 individuals with severe TBI and 29 non-brain-injured persons. Each participant nominated a close friend or relative who completed the informant's version of the questionnaire. Participants and their significant others both rated the participants' frequency of prospective memory lapses using the Comprehensive Assessment of Prospective Memory (CAPM). An independent groups design was adopted to compare the TBI and control groups. No significant difference was found between the TBI and control participants' self-ratings of frequency of prospective memory failure, but ratings by significant others were significantly different. The TBI group demonstrated less self-awareness (i.e. underestimated the frequency of prospective memory failure compared to significant others) than the control group.

WCET analysis considering contention on memory bus in COTS-based multicores

The usage of COTS-based multicores is becoming widespread in the field of embedded systems. Providing realtime guarantees at design-time is a pre-requisite to deploy real-time systems on these multicores. This necessitates the consideration of the impact of the contention due to shared low-level hardware resources on the Worst-Case Execution Time (WCET) of the tasks. As a step towards this aim, this paper first identifies the different factors that make the WCET analysis a challenging problem in a typical COTS-based multicore system. Then, we propose and prove, a mathematically correct method to determine tight upper bounds on the WCET of the tasks, when they are co-scheduled on different cores.

Consistent state software transactional memory

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática

Particle swarm design of digital circuits

Swarm Intelligence (SI) is the property of a system whereby the collective behaviors of (unsophisticated) agents interacting locally with their environment cause coherent functional global patterns to emerge. Particle swarm optimization (PSO) is a form of SI, and a population-based search algorithm that is initialized with a population of random solutions, called particles. These particles are flying through hyperspace and have two essential reasoning capabilities: their memory of their own best position and knowledge of the swarm's best position. In a PSO scheme each particle flies through the search space with a velocity that is adjusted dynamically according with its historical behavior. Therefore, the particles have a tendency to fly towards the best search area along the search process. This work proposes a PSO based algorithm for logic circuit synthesis. The results show the statistical characteristics of this algorithm with respect to number of generations required to achieve the solutions. It is also presented a comparison with other two Evolutionary Algorithms, namely Genetic and Memetic Algorithms.