Immunohistochemistry in formalin-gel fixed tissues

There are several hazards in histopathology laboratories and its staff must ensure that their professional activity is set to the highest standards while complying with the best safety procedures. Formalin is one of the chemical hazards to which such professionals are routinely exposed. To decrease this contact, it is suggested that 10% neutral buffered liquid formalin (FL) is replaced by 10% formalin-gel (FG), given the later reduces the likelihood of spills and splashes, and decreased fume levels are released during its handling, proving itself less harmful. However, it is mandatory to assess the effectiveness of FG as a fixative and ensure that the subsequent complementary techniques, such as immunohistochemistry (IHC), are not compromised. Two groups of 30 samples from human placenta have been fixed with FG and FL fixatives during different periods of time (12, 24, and 48 hours) and, thereafter, processed, embedded, and sectioned. IHC for six different antibodies was performed and the results were scored (0–100) using an algorithm that took into account immunostaining intensity, percentage of staining structures, non-specific immunostaining, contrast, and morphological preservation. Parametric and non-parametric statistical tests were used (alpha = 0•05). All results were similar for both fixatives, with global score means of 95•36±6•65 for FL and 96•06±5•80 for FG, and without any statistical difference (P>0•05). The duration of the fixation had no statistical relevance also (P>0•05). So it is proved here FG could be an effective alternative to FL.

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.

On the choice of posittioning and cluster size for fixed relay stations in a LTE network

The long term evolution (LTE) is one of the latest standards in the mobile communications market. To achieve its performance, LTE networks use several techniques, such as multi-carrier technique, multiple-input-multiple-output and cooperative communications. Inside cooperative communications, this paper focuses on the fixed relaying technique, presenting a way for determining the best position to deploy the relay station (RS), from a set of empirical good solutions, and also to quantify the associated performance gain using different cluster size configurations. The best RS position was obtained through realistic simulations, which set it as the middle of the cell's circumference arc. Additionally, it also confirmed that network's performance is improved when the number of RSs is increased. It was possible to conclude that, for each deployed RS, the percentage of area served by an RS increases about 10 %. Furthermore, the mean data rate in the cell has been increased by approximately 60 % through the use of RSs. Finally, a given scenario with a larger number of RSs, can experience the same performance as an equivalent scenario without RSs, but with higher reuse distance. This conduces to a compromise solution between RS installation and cluster size, in order to maximize capacity, as well as performance.

Metabolic syndrome in fixed-shift workers

OBJECTIVE To analyze if metabolic syndrome and its altered components are associated with demographic, socioeconomic and behavioral factors in fixed-shift workers.METHODS A cross-sectional study was conducted on a sample of 902 shift workers of both sexes in a poultry processing plant in Southern Brazil in 2010. The diagnosis of metabolic syndrome was determined according to the recommendations from Harmonizing the Metabolic Syndrome. Its frequency was evaluated according to the demographic (sex, skin color, age and marital status), socioeconomic (educational level, income and work shift), and behavioral characteristics (smoking, alcohol intake, leisure time physical activity, number of meals and sleep duration) of the sample. The multivariate analysis followed a theoretical framework for identifying metabolic syndrome in fixed-shift workers.RESULTS The prevalence of metabolic syndrome in the sample was 9.3% (95%CI 7.4;11.2). The most frequently altered component was waist circumference (PR 48.4%; 95%CI 45.5;51.2), followed by high-density lipoprotein. Work shift was not associated with metabolic syndrome and its altered components. After adjustment, the prevalence of metabolic syndrome was positively associated with women (PR 2.16; 95%CI 1.28;3.64), workers aged over 40 years (PR 3.90; 95%CI 1.78;8.93) and those who reported sleeping five hours or less per day (PR 1.70; 95%CI 1.09;2.24). On the other hand, metabolic syndrome was inversely associated with educational level and having more than three meals per day (PR 0.43; 95%CI 0.26;0.73).CONCLUSIONS Being female, older and deprived of sleep are probable risk factors for metabolic syndrome, whereas higher educational level and higher number of meals per day are protective factors for metabolic syndrome in fixed-shift workers.

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.

Otimização energética em redes óticas de próxima geração Flex-grid vs Fixed-grid

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Eletrónica e Telecomunicações

Validação do questionário 'Prosthesis Evaluation Questionnaire - PEQ'

Mestrado em Gestão e Avaliação de Tecnologias em Saúde

Immunoperoxidase for the detection for the detection of antibodies in cerebrospinal fluid in neurocysticercosis: use of Cysticercus cellulosae and Cysticercus longicollis particles fixed on microscopy slides

The ORF strain of Cysticercus longicollis represents an important model for the study of heterologous antigens in the immunodiagnosis of neurocysticercosis (NC). The immunoperoxidase (IP) technique was standardized using a particulate antigen suspension of Cysticercus longicollis (Cl) and Cysticercus cellulosae (Cc). Cerebrospinal fluid (CSF) samples were incubated on the antigen fixed to microscopy slides; the conjugate employed was anti-IgG-peroxidase and the enzymatic reaction was started by covering the slides with chromogen solution (diaminobenzidine/H2O2). After washing with distilled water, the slide was stained with 2% malachite green in water. Of the CSF samples from 21 patients with NC, 19 (90.5%) were positive, whereas the 8 CSF samples from the control group (100%) were negative. The results of the IP-Cl test applied to 127 CSF samples from patients with suspected NC showed 28.3% reactivity as opposed to 29.1 % for the IP-Cc test. The agreement index for the IP test (Cl x Cc) was 94.2%, with no significant difference between the two antigens.

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Pre-emption

This article introduces schedulability analysis for global fixed priority scheduling with deferred preemption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of global fixed priority pre-emptive scheduling (gFPPS) and global fixed priority non-pre-emptive scheduling (gFPNS). We show how schedulability can be improved using gFPDS via appropriate choice of priority assignment and final non-pre-emptive region lengths, and provide algorithms which optimize schedulability in this way. Via an experimental evaluation we compare the performance of multiprocessor scheduling using global approaches: gFPDS, gFPPS, and gFPNS, and also partitioned approaches employing FPDS, FPPS, and FPNS on each processor.