Physiotherapy and Duchenne muscular dystrophy

Duchenne muscular dystrophy (DMD) is a severe, progressive disease first described by Meryon in 1852 and later by Guillaume Duchene. It is the most common and severe form of childhood muscular dystrophy, affecting 1 in 3500 live male births. Is caused by an X—linked recessive genetic disorder resulting in a deficiency of the dystrophin protein, responsible for linking contractile proteins to the sarcolemma. Diagnosis is not always easy and the first symptoms are often related to weakness and difficulty or delay in acquiring the ability to perform simple activities. Progressive weakness leads to the use of compensatory strategies in order to maintain the ability to walk and perform other activities. Respiratory muscles are also affected and the complications resulting from its impairments are frequently the cause of early death of these patients. The advances in DMD management has increased life expectancy of these children with the need for adequate care in adulthood. DMD manifestations include muscle weakness, contractures, respiratory and cardiac complications. Some authors also refer that one-third of patients have difficulties with learning and delayed global development because the gene that encodes dystrophyn expresses various dystrophin isoforms that are found in Schwann and Purkinje celis in the brain. Body functions and structure impairments like muscle weakness, contractures and reduced range of motion lead to limitations in activities, i.e., impairments affect the performance of tasks by the individual. In a physiotherapist’s point of view analysing these limitations is mandatory because physiotherapy’s final purpose is to restore or preserve the ability to perform ADL and to improve quality of life.

A genetic algorithm for the resource constrained multi-project scheduling problem

This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.

Single-objective spreading algorithm

This paper addresses the problem of finding several different solutions with the same optimum performance in single objective real-world engineering problems. In this paper a parallel robot design is proposed. Thereby, this paper presents a genetic algorithm to optimize uni-objective problems with an infinite number of optimal solutions. The algorithm uses the maximin concept and ε-dominance to promote diversity over the admissible space. The performance of the proposed algorithm is analyzed with three well-known test functions and a function obtained from practical real-world engineering optimization problems. A spreading analysis is performed showing that the solutions drawn by the algorithm are well dispersed.

Decision-making on childhood vaccination by highly educated parents

OBJECTIVE To analyze the sociocultural aspects involved in the decision-making process of vaccination in upper-class and highly educated families.METHODS A qualitative approach based on in-depth interviews with 15 couples from the city of Sao Paulo, Southeastern Brazil, falling into three categories: vaccinators, late or selective vaccinators, and nonvaccinators. The interpretation of produced empirical material was performed through content analysis.RESULTS The study showed diverse and particular aspects surrounding the three groups’ decisions whether to vaccinate their children. The vaccinators’ decision to vaccinate their children was spontaneous and raised no questions. Most late or selective vaccinators experienced a wide range of situations that were instrumental in the decision to delay or not apply certain vaccines. The nonvaccinator’s decision-making process expressed a broader context of both criticism of hegemonic obstetric practices in Brazil and access to information transmitted via social networks and the internet. The data showed that the problematization of vaccines (culminating in the decision to not vaccinate their children) occurred in the context of humanized birth, was protagonized by women and was greatly influenced by health information from the internet.CONCLUSIONS Sociocultural aspects of the singular Brazilian context and the contemporary society were involved in the decision-making on children’s vaccination. Understanding this process can provide a real basis for a deeper reflection on health and immunization practices in Brazil in light of the new contexts and challenges of the world today.

Project scheduling under multiple resources constraints using a genetic algorithm

The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

Project scheduling using a competitive genetic algorithm

- The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm

Real time fault injection using enhanced OCD -- a performance analysis

Fault injection is frequently used for the verification and validation of dependable systems. When targeting real time microprocessor based systems the process becomes significantly more complex. This paper proposes two complementary solutions to improve real time fault injection campaign execution, both in terms of performance and capabilities. The methodology is based on the use of the on-chip debug mechanisms present in modern electronic devices. The main objective is the injection of faults in microprocessor memory elements with minimum delay and intrusiveness. Different configurations were implemented and compared in terms of performance gain and logic overhead.

Invariant integrals applied to nematic liquid crystals with small Ericksen number and topological defects

Invariant integrals are derived for nematic liquid crystals and applied to materials with small Ericksen number and topological defects. The nematic material is confined between two infinite plates located at y = -h and y = h (h is an element of R+) with a semi-infinite plate at y = 0 and x < 0. Planar and homeotropic strong anchoring boundary conditions to the director field are assumed at these two infinite and semi-infinite plates, respectively. Thus, a line disclination appears in the system which coincides with the z-axis. Analytical solutions to the director field in the neighbourhood of the singularity are obtained. However, these solutions depend on an arbitrary parameter. The nematic elastic force is thus evaluated from an invariant integral of the energy-momentum tensor around a closed surface which does not contain the singularity. This allows one to determine this parameter which is a function of the nematic cell thickness and the strength of the disclination. Analytical solutions are also deduced for the director field in the whole region using the conformal mapping method. (C) 2013 Elsevier Ltd. All rights reserved.

On semigroups of endomorphisms of a chain with restricted range

Let X be a finite or infinite chain and let be the monoid of all endomorphisms of X. In this paper, we describe the largest regular subsemigroup of and Green's relations on. In fact, more generally, if Y is a nonempty subset of X and is the subsemigroup of of all elements with range contained in Y, we characterize the largest regular subsemigroup of and Green's relations on. Moreover for finite chains, we determine when two semigroups of the type are isomorphic and calculate their ranks.

Characterization and performance analysis of a VDFLL GNSS receiver architecture

A non-coherent vector delay/frequency-locked loop architecture for GNSS receivers is proposed. Two dynamics models are considered: PV (position and velocity) and PVA (position, velocity, and acceleration). In contrast with other vector architectures, the proposed approach does not require the estimation of signals amplitudes. Only coarse estimates of the carrier-to-noise ratios are necessary.

Reshaping higher education systems in the MENA region: the contribution of remote and virtual labs

Learning is not only happening in school or university; it is also an important aspect of the daily life that allows students to remain in their biological and physical environment helping to reshape it, by applying what they have learnt. Today, the higher education sector is a part of important strategies used by countries in order to foster their development. Despite its geographical location, i.e. its closeness to Europe and Asia, the MENA (Middle East and North Africa) region still needs an integrated strategy for the advancement, reform, and update of its higher educational landscape. Although some solutions have been experimented in the region in the field of higher education, they have not been able to raise the quality of education to the level comparable that observed in developed countries. In other words, many MENA higher education systems are facing problems, for which solution ought to be sought. We analyse the situation of higher education systems in the MENA countries and the factors that affect the delay in achieving the level of education existing in other world regions, e.g. Europe, especially in the higher education sector. During the discussion, the impact of new technology-enhanced tools, such as remote laboratories, in the process of development and consolidation of MENA universities, is particularly stressed.

Real-time fault injection using enhanced on-chip debug infrastructures

The rapid increase in the use of microprocessor-based systems in critical areas, where failures imply risks to human lives, to the environment or to expensive equipment, significantly increased the need for dependable systems, able to detect, tolerate and eventually correct faults. The verification and validation of such systems is frequently performed via fault injection, using various forms and techniques. However, as electronic devices get smaller and more complex, controllability and observability issues, and sometimes real time constraints, make it harder to apply most conventional fault injection techniques. This paper proposes a fault injection environment and a scalable methodology to assist the execution of real-time fault injection campaigns, providing enhanced performance and capabilities. Our proposed solutions are based on the use of common and customized on-chip debug (OCD) mechanisms, present in many modern electronic devices, with the main objective of enabling the insertion of faults in microprocessor memory elements with minimum delay and intrusiveness. Different configurations were implemented starting from basic Components Off-The-Shelf (COTS) microprocessors, equipped with real-time OCD infrastructures, to improved solutions based on modified interfaces, and dedicated OCD circuitry that enhance fault injection capabilities and performance. All methodologies and configurations were evaluated and compared concerning performance gain and silicon overhead.

Scaling law in Saddle-node bifurcations for one-dimensional maps: A complex variable approach

The study of transient dynamical phenomena near bifurcation thresholds has attracted the interest of many researchers due to the relevance of bifurcations in different physical or biological systems. In the context of saddle-node bifurcations, where two or more fixed points collide annihilating each other, it is known that the dynamics can suffer the so-called delayed transition. This phenomenon emerges when the system spends a lot of time before reaching the remaining stable equilibrium, found after the bifurcation, because of the presence of a saddle-remnant in phase space. Some works have analytically tackled this phenomenon, especially in time-continuous dynamical systems, showing that the time delay, tau, scales according to an inverse square-root power law, tau similar to (mu-mu (c) )(-1/2), as the bifurcation parameter mu, is driven further away from its critical value, mu (c) . In this work, we first characterize analytically this scaling law using complex variable techniques for a family of one-dimensional maps, called the normal form for the saddle-node bifurcation. We then apply our general analytic results to a single-species ecological model with harvesting given by a unimodal map, characterizing the delayed transition and the scaling law arising due to the constant of harvesting. For both analyzed systems, we show that the numerical results are in perfect agreement with the analytical solutions we are providing. The procedure presented in this work can be used to characterize the scaling laws of one-dimensional discrete dynamical systems with saddle-node bifurcations.

A coherent approach to non-integer order derivatives

Signal Processing, vol. 86, nº 10

An optimization approach for the job shop scheduling problem

This paper presents an optimization approach for the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The proposed approach is based on a genetic algorithm technique. The scheduling rules such as SPT and MWKR are integrated into the process of genetic evolution. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities and delay times of the operations are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed approach.