Cantor exchange systems and renormalization

We prove a one-to-one correspondence between (i) C1+ conjugacy classes of C1+H Cantor exchange systems that are C1+H fixed points of renormalization and (ii) C1+ conjugacy classes of C1+H diffeomorphisms f with a codimension 1 hyperbolic attractor Lambda that admit an invariant measure absolutely continuous with respect to the Hausdorff measure on Lambda. However, we prove that there is no C1+alpha Cantor exchange system, with bounded geometry, that is a C1+alpha fixed point of renormalization with regularity alpha greater than the Hausdorff dimension of its invariant Cantor set.

Arc exchange systems and renormalization

We exhibit the construction of stable arc exchange systems from the stable laminations of hyperbolic diffeomorphisms. We prove a one-to-one correspondence between (i) Lipshitz conjugacy classes of C(1+H) stable arc exchange systems that are C(1+H) fixed points of renormalization and (ii) Lipshitz conjugacy classes of C(1+H) diffeomorphisms f with hyperbolic basic sets Lambda that admit an invariant measure absolutely continuous with respect to the Hausdorff measure on Lambda. Let HD(s)(Lambda) and HD(u)(Lambda) be, respectively, the Hausdorff dimension of the stable and unstable leaves intersected with the hyperbolic basic set L. If HD(u)(Lambda) = 1, then the Lipschitz conjugacy is, in fact, a C(1+H) conjugacy in (i) and (ii). We prove that if the stable arc exchange system is a C(1+HDs+alpha) fixed point of renormalization with bounded geometry, then the stable arc exchange system is smooth conjugate to an affine stable arc exchange system.

Hausdorff dimension versus smoothness

There is a one-to-one correspondence between C1+H Cantor exchange systems that are C1+H fixed points of renormalization and C1+H diffeomorphisms f on surfaces with a codimension 1 hyperbolic attractor Λ that admit an invariant measure absolutely continuous with respect to the Hausdorff measure on Λ. However, there is no such C1+α Cantor exchange system with bounded geometry that is a C1+α fixed point of renormalization with regularity α greater than the Hausdorff dimension of its invariant Cantor set. The proof of the last result uses that the stable holonomies of a codimension 1 hyperbolic attractor Λ are not C1+θ for θ greater than the Hausdorff dimension of the stable leaves of f intersected with Λ.

The immediate effects of atlanto-occipital joint manipulation and suboccipital muscle inhibition technique on active mouth opening and pressure pain sensitivity over latent myofascial trigger points in the masticatory muscles

DESIGN: A randomized controlled trial.OB JECTIVE: To investigate the immediate effects on pressure pain thresholds over latent trigger points (TrPs) in the masseter and temporalis muscles and active mouth opening following atlanto-occipital joint thrust manipulation or a soft tissue manual intervention targeted to the suboccipital muscles. BACKGROUND : Previous studies have described hypoalgesic effects of neck manipulative interventions over TrPs in the cervical musculature. There is a lack of studies analyzing these mechanisms over TrPs of muscles innervated by the trigeminal nerve. METHODS: One hundred twenty-two volunteers, 31 men and 91 women, between the ages of 18 and 30 years, with latent TrPs in the masseter muscle, were randomly divided into 3 groups: a manipulative group who received an atlanto-occipital joint thrust, a soft tissue group who received an inhibition technique over the suboccipital muscles, and a control group who did not receive an intervention. Pressure pain thresholds over latent TrPs in the masseter and temporalis muscles, and active mouth opening were assessed pretreatment and 2 minutes posttreatment by a blinded assessor. Mixed-model analyses of variance (ANOVA) were used to examine the effects of interventions on each outcome, with group as the between-subjects variable and time as the within-subjects variable. The primary analysis was the group-by-time interaction. RESULTS: The 2-by-3 mixed-model ANOVA revealed a significant group-by-time interaction for changes in pressure pain thresholds over masseter (P<.01) and temporalis (P =.003) muscle latent TrPs and also for active mouth opening (P<.001) in favor of the manipulative and soft tissue groups. Between-group effect sizes were small. CONCLUSIONS: The application of an atlanto-occipital thrust manipulation or soft tissue technique targeted to the suboccipital muscles led to an immediate increase in pressure pain thresholds over latent TrPs in the masseter and temporalis muscles and an increase in maximum active mouth opening. Nevertheless, the effects of both interventions were small and future studies are required to elucidate the clinical relevance of these changes. LEVEL OF EVIDENCE : Therapy, level 1b. J Orthop Sports Phys Ther 2010;40(5):310-317. doi:10.2519/jospt.2010.3257. KEYWORDSDS: cervical manipulation, muscle trigger points, neck, TMJ, upper cervical.

An efficient method for optimal location and sizing of fixed and switched shunt capacitors in large distribution systems

This paper proposes a computationally efficient methodology for the optimal location and sizing of static and switched shunt capacitors in large distribution systems. The problem is formulated as the maximization of the savings produced by the reduction in energy losses and the avoided costs due to investment deferral in the expansion of the network. The proposed method selects the nodes to be compensated, as well as the optimal capacitor ratings and their operational characteristics, i.e. fixed or switched. After an appropriate linearization, the optimization problem was formulated as a large-scale mixed-integer linear problem, suitable for being solved by means of a widespread commercial package. Results of the proposed optimizing method are compared with another recent methodology reported in the literature using two test cases: a 15-bus and a 33-bus distribution network. For the both cases tested, the proposed methodology delivers better solutions indicated by higher loss savings, which are achieved with lower amounts of capacitive compensation. The proposed method has also been applied for compensating to an actual large distribution network served by AES-Venezuela in the metropolitan area of Caracas. A convergence time of about 4 seconds after 22298 iterations demonstrates the ability of the proposed methodology for efficiently handling large-scale compensation problems.

A influência da idade nos parâmetros metabólicos durante a marcha com andarilho

Introdução: Estruturalmente, a marcha é modificada de acordo com as características de cada individuo, sua natureza morfológica, tipo de atividade, idade e a presença de determinadas doenças, entre outros fatores. Devidas as alterações fisiológicas de envelhecimento, o custo energético da marcha normal por si só é superior nos idosos comparativamente com os jovens. Objetivo: Analisar a influência do uso de andarilho com rodas e fixo nos parâmetros metabólicos de indivíduos com mais de 60 anos e em jovens. Metodologia: realizou-se um estudo analítico transversal numa amostra de 21 voluntários, sendo 11adultos jovens (idade compreendida entre 18 e 25 anos) e 10 são adultos com idade superior a 60 anos. Utilizou-se o sistema K4b2 COSMED de forma a recolher os dados relativos ao consumo energético, quociente respiratório e volume de CO2 produzido. Os participantes realizaram os diferentes tipos de marcha (marcha normal, a três pontos com andarilho fixo, a três pontos modificada com andarilho fixo, a três pontos com andarilho com rodas e a três pontos modificada com andarilho com rodas) durante 10 minutos num percurso rectilíneo de 20 metros. Para a análise estatística recorreu-se ao software IBM SPSS Statistics v20 com um nível de significância de 0,05. Resultados: observou-se que á exceção da marcha normal em todos os outros tipos de marcha com andarilho, os participantes com mais de 60 anos, apresentam valores significativamente superiores aos dos jovens, nomeadamente nas marchas com andarilho fixo, a 3 pontos e a 3 pontos modificada e com andarilho de rodas, na marcha a 3ponto modificada. Verificaram-se diferenças apenas no grupo dos jovens, pois a marcha normal apresentou valores significativamente maiores que as restantes. Conclusão: A idade influenciou os parâmetros metabólicos da marcha normal e com andarilhos fixo e móvel apresentando os idosos um maior gasto energético, bem como os METS utilizados.

Evaluating P-NET message's response time with fixed priority queuing at application process level

P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit. In the worst-case, the communication response time can be derived considering that, in each token cycle, all stations use the token to transmit a message. In this paper, we define a more sophisticated P-NET model, which considers the actual token utilisation. We then analyse the possibility of implementing a local priority-based scheduling policy to improve the real-time behaviour of P-NET.

Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach

In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET’s medium access control (MAC) protocol is able to guarantee a bounded access time to message requests. We then propose a model for implementing fixed prioritybased dispatching mechanisms at each master’s application level. In this way, we diminish the impact of the first-come-first-served (FCFS) policy that P-NET uses at the data link layer. The proposed model rises several issues well known within the real-time systems community: message release jitter; pre-run-time schedulability analysis in non pre-emptive contexts; non-independence of tasks at the application level. We identify these issues in the proposed model and show how results available for priority-based task dispatching can be adapted to encompass priority-based message dispatching in P-NET networks.

Extending fixed task-priority schedulability by interference limitation

While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed taskpriority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various attempts have been undertaken to increase the chances of proving a task set schedulable with similar low complexity. In some cases, this was achieved by modifying applications to limit preemptions, at the cost of flexibility. In this work, we explore several variants of a concept to limit interference by locking down the ready queue at certain instances. The aim is to increase the prospects of schedulability of a given task system, without compromising on complexity or flexibility, when compared to the regular fixed task-priority algorithm. As a final contribution, a new preemption threshold assignment algorithm is provided which is less complex and more straightforward than the previous method available in the literature.

Resource sharing in global fixed-priority preemptive multiprocessor scheduling

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.

Conjecture about global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks: the utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1

Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(√2−1) is √2-1.

A framework for the response time analysis of fixed-priority tasks with stochastic inter-arrival times

Real-time scheduling usually considers worst-case values for the parameters of task (or message stream) sets, in order to provide safe schedulability tests for hard real-time systems. However, worst-case conditions introduce a level of pessimism that is often inadequate for a certain class of (soft) real-time systems. In this paper we provide an approach for computing the stochastic response time of tasks where tasks have inter-arrival times described by discrete probabilistic distribution functions, instead of minimum inter-arrival (MIT) values.

Fixed point transformations in the adaptive control of fractional-order MIMO systems

Though the formal mathematical idea of introducing noninteger order derivatives can be traced from the 17th century in a letter by L’Hospital in which he asked Leibniz what the meaning of D n y if n = 1/2 would be in 1695 [1], it was better outlined only in the 19th century [2, 3, 4]. Due to the lack of clear physical interpretation their first applications in physics appeared only later, in the 20th century, in connection with visco-elastic phenomena [5, 6]. The topic later obtained quite general attention [7, 8, 9], and also found new applications in material science [10], analysis of earth-quake signals [11], control of robots [12], and in the description of diffusion [13], etc.

Application of robust fixed point transformations for technological operation of robots

A robot’s drive has to exert appropriate driving forces that can keep its arm and end effector at the proper position, velocity and acceleration, and simultaneously has to compensate for the effects of the contact forces arising between the tool and the workpiece depending on the needs of the actual technological operation. Balancing the effects of a priori unknown external disturbance forces and the inaccuracies of the available dynamic model of the robot is also important. Technological tasks requiring well prescribed end effector trajectories and contact forces simultaneously are challenging control problems that can be tackled in various manners.

Estrutura a partir do Movimento em Sistemas Autónomos

Mestrado em Engenharia Electrotécnica e de Computadores - Ramo de Sistemas Autónomos