Serial experiments lain's body: o corpo enquanto fronteira entre o físico e o virtual

Dissertação apresentada à Escola Superior de Comunicação Social como parte dos requisitos para obtenção de grau de mestre em Audiovisual e Multimédia.

Emergência da escrita na educação infantil: de pequenino…de muito pequenino…

Relatório da Prática Profissional Supervisionada Mestrado em Educação Pré-Escolar

New insights on integer-programming models for the kidney exchange problem

In recent years several countries have set up policies that allow exchange of kidneys between two or more incompatible patient–donor pairs. These policies lead to what is commonly known as kidney exchange programs. The underlying optimization problems can be formulated as integer programming models. Previously proposed models for kidney exchange programs have exponential numbers of constraints or variables, which makes them fairly difficult to solve when the problem size is large. In this work we propose two compact formulations for the problem, explain how these formulations can be adapted to address some problem variants, and provide results on the dominance of some models over others. Finally we present a systematic comparison between our models and two previously proposed ones via thorough computational analysis. Results show that compact formulations have advantages over non-compact ones when the problem size is large.

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

A two-competitive approximate schedulability analysis of CAN

Consider the problem of deciding whether a set of n sporadic message streams meet deadlines on a Controller Area Network (CAN) bus for a specified priority assignment. It is assumed that message streams have implicit deadlines and no release jitter. An algorithm to solve this problem is well known but unfortunately it time complexity is non-polynomial. We present an algorithm with polynomial time-complexity for computing an upper bound on the response times. Clearly, if the upper bound on the response time does not exceed the deadline then all deadlines are met. The pessimism of our approach is proven: if the upper bound of the response time exceeds the deadline then the response time exceeds the deadline as well for a CAN network with half the speed.

Positive radial solutions of the Dirichlet problem for the Minkowski-Curvature equation in a ball

We study the existence and multiplicity of positive radial solutions of the Dirichlet problem for the Minkowski-curvature equation { -div(del upsilon/root 1-vertical bar del upsilon vertical bar(2)) in B-R, upsilon=0 on partial derivative B-R,B- where B-R is a ball in R-N (N >= 2). According to the behaviour off = f (r, s) near s = 0, we prove the existence of either one, two or three positive solutions. All results are obtained by reduction to an equivalent non-singular one-dimensional problem, to which variational methods can be applied in a standard way.

A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Dynamic stability metrics for the container loading problem

The Container Loading Problem (CLP) literature has traditionally evaluated the dynamic stability of cargo by applying two metrics to box arrangements: the mean number of boxes supporting the items excluding those placed directly on the floor (M1) and the percentage of boxes with insufficient lateral support (M2). However, these metrics, that aim to be proxies for cargo stability during transportation, fail to translate real-world cargo conditions of dynamic stability. In this paper two new performance indicators are proposed to evaluate the dynamic stability of cargo arrangements: the number of fallen boxes (NFB) and the number of boxes within the Damage Boundary Curve fragility test (NB_DBC). Using 1500 solutions for well-known problem instances found in the literature, these new performance indicators are evaluated using a physics simulation tool (StableCargo), replacing the real-world transportation by a truck with a simulation of the dynamic behaviour of container loading arrangements. Two new dynamic stability metrics that can be integrated within any container loading algorithm are also proposed. The metrics are analytical models of the proposed stability performance indicators, computed by multiple linear regression. Pearson’s r correlation coefficient was used as an evaluation parameter for the performance of the models. The extensive computational results show that the proposed metrics are better proxies for dynamic stability in the CLP than the previous widely used metrics.

Business model analysis of Mobitto: How to solve the chicken and egg problem of a multi-sided platform?

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Effect of carbohydrate overfeeding on whole body macronutrient metabolism and expression of lipogenic enzymes in adipose tissue of lean and overweight humans

OBJECTIVE: Lipids stored in adipose tissue can originate from dietary lipids or from de novo lipogenesis (DNL) from carbohydrates. Whether DNL is abnormal in adipose tissue of overweight individuals remains unknown. The present study was undertaken to assess the effect of carbohydrate overfeeding on glucose-induced whole body DNL and adipose tissue lipogenic gene expression in lean and overweight humans. DESIGN: Prospective, cross-over study. SUBJECTS AND METHODS: A total of 11 lean (five male, six female, mean BMI 21.0+/-0.5 kg/m(2)) and eight overweight (four males, four females, mean BMI 30.1+/-0.6 kg/m(2)) volunteers were studied on two occasions. On one occasion, they received an isoenergetic diet containing 50% carbohydrate for 4 days prior to testing; on the other, they received a hyperenergetic diet (175% energy requirements) containing 71% carbohydrates. After each period of 4 days of controlled diet, they were studied over 6 h after having received 3.25 g glucose/kg fat free mass. Whole body glucose oxidation and net DNL were monitored by means of indirect calorimetry. An adipose tissue biopsy was obtained at the end of this 6-h period and the levels of SREBP-1c, acetyl CoA carboxylase, and fatty acid synthase mRNA were measured by real-time PCR. RESULTS: After isocaloric feeding, whole body net DNL amounted to 35+/-9 mg/kg fat free mass/5 h in lean subjects and to 49+/-3 mg/kg fat free mass/5 h in overweight subjects over the 5 h following glucose ingestion. These figures increased (P<0.001) to 156+/-21 mg/kg fat free mass/5 h in lean and 64+/-11 mg/kg fat free mass/5 h (P<0.05 vs lean) in overweight subjects after carbohydrate overfeeding. Whole body DNL after overfeeding was lower (P<0.001) and glycogen synthesis was higher (P<0.001) in overweight than in normal subjects. Adipose tissue SREBP-1c mRNA increased by 25% in overweight and by 43% in lean subjects (P<0.05) after carbohydrate overfeeding, whereas fatty acid synthase mRNA increased by 66 and 84% (P<0.05). CONCLUSION: Whole body net DNL is not increased during carbohydrate overfeeding in overweight individuals. Stimulation of adipose lipogenic enzymes is also not higher in overweight subjects. Carbohydrate overfeeding does not stimulate whole body net DNL nor expression of lipogenic enzymes in adipose tissue to a larger extent in overweight than lean subjects.

Thyroid function and prevalent and incident metabolic syndrome in older adults: the Health, Ageing and Body Composition Study.

OBJECTIVE: Both subclinical hypothyroidism and the metabolic syndrome have been associated with increased risk of coronary heart disease events. It is unknown whether the prevalence and incidence of metabolic syndrome is higher as TSH levels increase, or in individuals with subclinical hypothyroidism. We sought to determine the association between thyroid function and the prevalence and incidence of the metabolic syndrome in a cohort of older adults. DESIGN: Data were analysed from the Health, Ageing and Body Composition Study, a prospective cohort of 3075 community-dwelling US adults. PARTICIPANTS: Two thousand one hundred and nineteen participants with measured TSH and data on metabolic syndrome components were included in the analysis. MEASUREMENTS: TSH was measured by immunoassay. Metabolic syndrome was defined per revised ATP III criteria. RESULTS: At baseline, 684 participants met criteria for metabolic syndrome. At 6-year follow-up, incident metabolic syndrome developed in 239 individuals. In fully adjusted models, each unit increase in TSH was associated with a 3% increase in the odds of prevalent metabolic syndrome (OR, 1.03; 95% CI, 1.01-1.06; P = 0.02), and the association was stronger for TSH within the normal range (OR, 1.16; 95% CI, 1.03-1.30; P = 0.02). Subclinical hypothyroidism with a TSH > 10 mIU/l was significantly associated with increased odds of prevalent metabolic syndrome (OR, 2.3; 95% CI, 1.0-5.0; P = 0.04); the odds of incident MetS was similar (OR 2.2), but the confidence interval was wide (0.6-7.5). CONCLUSIONS: Higher TSH levels and subclinical hypothyroidism with a TSH > 10 mIU/l are associated with increased odds of prevalent but not incident metabolic syndrome.

Monocarboxylate transporters: new players in body weight regulation.

Over the last two decades, several genes have been identified that appear to play a role in the regulation of energy homeostasis and body weight. For a small subset of them, a reduction or an absence of expression confers a resistance to the development of obesity. Recently, a knockin mouse for a member of the monocarboxylate transporter (MCT) family, MCT1, was demonstrated to exhibit a typical phenotype of resistance to diet-induced obesity and a protection from its associated metabolic perturbations. Such findings point out at MCTs as putatively new therapeutic targets in the context of obesity. Here, we will review what is known about MCTs and their possible metabolic roles in different organs and tissues. Based on the description of the phenotype of the MCT1 knockin mouse, we will also provide some insights about their putative roles in weight gain regulation.

A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata

Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal μ-calculus extended with backwards modalities. In this paper, we present a very simple proof by way of Wadge games of the strictness of the hierarchy of Motowski indices of two-way alternating automata over trees.