Sox18 is transiently expressed during angiogenesis in granulation tissue of skin wounds with an identical expression pattern to Flk-1 mRNA

Sox18 encodes a member of the Sry-related high mobility group box (SOX) family of developmental transcription factors. Examination of Sox18 expression during embryogenesis has shown that Sox18 is expressed transiently in endothelial cells of developing blood vessels, and mutations in Sox18 have been found to underlie the mouse vascular and hair follicle mutant ragged. In this study we have examined the expression of Sox18 in angiogenesis during wound healing. Full-thickness skin wounds were created in mice, and subsequent expression of vascular endothelial growth factor (VEGF), the VEGF receptor Flk-1, alpha1 (iv) collagen (Col4a1), and Sox18 were studied using in situ hybridization. As has been previously reported, VEGF was expressed predominantly in the keratinocytes at the wound margins. Sox18 expression was found Rye days after wounding during capillary sprouting in granulation tissue and persisted through the proliferative phase of healing, but was not detected in fully epithelialized wounds 21 days after wounding. Sox18 mRNA expression was detected in capillaries within the granulation tissue and showed an identical pattern of distribution to Flk-1 and Col4a1 mRNA expression in endothelial cells. Immunostaining with a polyclonal anti-Sox18 antibody showed SOX18 protein localized in capillary endothelial cells within the granulation tissue. capillaries in the subcutaneous tissue of unwounded skin showed no Sox18 expression. Sox18 may therefore represent a transcription factor involved in the induction of angiogenesis during wound healing and tissue repair, but not in the maintenance of endothelial cells in undamaged tissue.

On the importance function in splitting simulation

The splitting method is a simulation technique for the estimation of very small probabilities. In this technique, the sample paths are split into multiple copies, at various stages in the simulation. Of vital importance to the efficiency of the method is the Importance Function (IF). This function governs the placement of the thresholds or surfaces at which the paths are split. We derive a characterisation of the optimal IF and show that for multi-dimensional models the natural choice for the IF is usually not optimal. We also show how nearly optimal splitting surfaces can be derived or simulated using reverse time analysis. Our numerical experiments illustrate that by using the optimal IF, one can obtain a significant improvement in simulation efficiency.

The role of homeotic genes in determining the segmental pattern of chordotonal organs in Drosophila

The homeotic genes are instrumental in establishing segment-specific characteristics. In Drosophila embryos there is ample evidence that the homeotic genes are involved in establishing the differences in the pattern of sense organs between segments. The chordotonal organs are compound sense organs made up of several stretch receptive sensilla. A set of serially homologous chordotonal organs, Ich3 in the 1(st) thoracic segment, dch3 in the 2(nd) and 3(rd) thoracic segments and Ich5 in abdominal segments 1 to 7, is composed of different numbers of sensilla with different positions and orientations. Here we examine this set of sense organs and a companion set, vchA/B and vch 1, in the wild type and mutants for Sex combs reduced, Antennapedia, Ultrabithorax, and abdominal-A, using immunostaining. Mutant phenotypes indicate that Ultrabithorax and abdominal-A in particular influence the formation of these sense organs. Differential expression of abdominal-A and Ultrabithorax within compartments of individual parasegments can precisely modulate the types of sense organs that will arise from a segment.

Multimodal species abundance distributions: a deconstruction approach reveals the processes behind the pattern

Copyright © 2014 The Authors. Oikos © 2014 Nordic Society Oikos.

New mitochondrial and nuclear evidences support recent demographic expansion and an atypical phylogeographic pattern in the Spittlebug Philaenus spumarius (Hemiptera, Aphrophoridae)

Copyright: © 2014 Rodrigues et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

Cardiorespiratory fitness is negatively associated with metabolic risk factors independently of the adherence to a healthy dietary pattern

Background and aim: Cardiorespiratory fitness (CRF) and diet have been involved as significant factors towards the prevention of cardio-metabolic diseases. This study aimed to assess the impact of the combined associations of CRF and adherence to the Southern European Atlantic Diet (SEADiet) on the clustering of metabolic risk factors in adolescents. Methods and Results: A cross-sectional school-based study was conducted on 468 adolescents aged 15-18, from the Azorean Islands, Portugal. We measured fasting glucose, insulin, total cholesterol (TC), HDL-cholesterol, triglycerides, systolic blood pressure, waits circumference and height. HOMA, TC/HDL-C ratio and waist-to-height ratio were calculated. For each of these variables, a Z-score was computed by age and sex. A metabolic risk score (MRS) was constructed by summing the Z scores of all individual risk factors. High risk was considered when the individual had 1SD of this score. CRF was measured with the 20 m-Shuttle-Run- Test. Adherence to SEADiet was assessed with a semi-quantitative food frequency questionnaire. Logistic regression showed that, after adjusting for potential confounders, unfit adolescents with low adherence to SEADiet had the highest odds of having MRS (OR Z 9.4; 95%CI:2.6e33.3) followed by the unfit ones with high adherence to the SEADiet (OR Z 6.6; 95% CI: 1.9e22.5) when compared to those who were fit and had higher adherence to SEADiet.

Pattern operators for grid

The definition and programming of distributed applications has become a major research issue due to the increasing availability of (large scale) distributed platforms and the requirements posed by the economical globalization. However, such a task requires a huge effort due to the complexity of the distributed environments: large amount of users may communicate and share information across different authority domains; moreover, the “execution environment” or “computations” are dynamic since the number of users and the computational infrastructure change in time. Grid environments, in particular, promise to be an answer to deal with such complexity, by providing high performance execution support to large amount of users, and resource sharing across different organizations. Nevertheless, programming in Grid environments is still a difficult task. There is a lack of high level programming paradigms and support tools that may guide the application developer and allow reusability of state-of-the-art solutions. Specifically, the main goal of the work presented in this thesis is to contribute to the simplification of the development cycle of applications for Grid environments by bringing structure and flexibility to three stages of that cycle through a commonmodel. The stages are: the design phase, the execution phase, and the reconfiguration phase. The common model is based on the manipulation of patterns through pattern operators, and the division of both patterns and operators into two categories, namely structural and behavioural. Moreover, both structural and behavioural patterns are first class entities at each of the aforesaid stages. At the design phase, patterns can be manipulated like other first class entities such as components. This allows a more structured way to build applications by reusing and composing state-of-the-art patterns. At the execution phase, patterns are units of execution control: it is possible, for example, to start or stop and to resume the execution of a pattern as a single entity. At the reconfiguration phase, patterns can also be manipulated as single entities with the additional advantage that it is possible to perform a structural reconfiguration while keeping some of the behavioural constraints, and vice-versa. For example, it is possible to replace a behavioural pattern, which was applied to some structural pattern, with another behavioural pattern. In this thesis, besides the proposal of the methodology for distributed application development, as sketched above, a definition of a relevant set of pattern operators was made. The methodology and the expressivity of the pattern operators were assessed through the development of several representative distributed applications. To support this validation, a prototype was designed and implemented, encompassing some relevant patterns and a significant part of the patterns operators defined. This prototype was based in the Triana environment; Triana supports the development and deployment of distributed applications in the Grid through a dataflow-based programming model. Additionally, this thesis also presents the analysis of a mapping of some operators for execution control onto the Distributed Resource Management Application API (DRMAA). This assessment confirmed the suitability of the proposed model, as well as the generality and flexibility of the defined pattern operators

On the implementation of real-time slotbased task-splitting scheduling algorithms for multiprocessor systems

In this paper we discuss challenges and design principles of an implementation of slot-based tasksplitting algorithms into the Linux 2.6.34 version. We show that this kernel version is provided with the required features for implementing such scheduling algorithms. We show that the real behavior of the scheduling algorithm is very close to the theoretical. We run and discuss experiments on 4-core and 24-core machines.

Implementing slot-based task-splitting multiprocessor scheduling

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

sMapReduce: a programming pattern for wireless sensor networks

Wireless Sensor Networks (WSNs) are increasingly used in various application domains like home-automation, agriculture, industries and infrastructure monitoring. As applications tend to leverage larger geographical deployments of sensor networks, the availability of an intuitive and user friendly programming abstraction becomes a crucial factor in enabling faster and more efficient development, and reprogramming of applications. We propose a programming pattern named sMapReduce, inspired by the Google MapReduce framework, for mapping application behaviors on to a sensor network and enabling complex data aggregation. The proposed pattern requires a user to create a network-level application in two functions: sMap and Reduce, in order to abstract away from the low-level details without sacrificing the control to develop complex logic. Such a two-fold division of programming logic is a natural-fit to typical sensor networking operation which makes sensing and topological modalities accessible to the user.

Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012

Multiprocessors, particularly in the form of multicores, are becoming standard building blocks for executing reliable software. But their use for applications with hard real-time requirements is non-trivial. Well-known realtime scheduling algorithms in the uniprocessor context (Rate-Monotonic [1] or Earliest-Deadline-First [1]) do not perform well on multiprocessors. For this reason the scientific community in the area of real-time systems has produced new algorithms specifically for multiprocessors. In the meanwhile, a proposal [2] exists for extending the Ada language with new basic constructs which can be used for implementing new algorithms for real-time scheduling; the family of task splitting algorithms is one of them which was emphasized in the proposal [2]. Consequently, assessing whether existing task splitting multiprocessor scheduling algorithms can be implemented with these constructs is paramount. In this paper we present a list of state-of-art task-splitting multiprocessor scheduling algorithms and, for each of them, we present detailed Ada code that uses the new constructs.

Fractional central pattern generators for bipedal locomotion

Locomotion has been a major research issue in the last few years. Many models for the locomotion rhythms of quadrupeds, hexapods, bipeds and other animals have been proposed. This study has also been extended to the control of rhythmic movements of adaptive legged robots. In this paper, we consider a fractional version of a central pattern generator (CPG) model for locomotion in bipeds. A fractional derivative D α f(x), with α non-integer, is a generalization of the concept of an integer derivative, where α=1. The integer CPG model has been proposed by Golubitsky, Stewart, Buono and Collins, and studied later by Pinto and Golubitsky. It is a network of four coupled identical oscillators which has dihedral symmetry. We study parameter regions where periodic solutions, identified with legs’ rhythms in bipeds, occur, for 0<α≤1. We find that the amplitude and the period of the periodic solutions, identified with biped rhythms, increase as α varies from near 0 to values close to unity.

Increase in cases of malaria in Mozambique, 2014: epidemic or new endemic pattern?

ABSTRACT OBJECTIVE To describe the increase in cases of malaria in Mozambique. METHODS Cross-sectional study conducted in 2014, in Mozambique with national weekly epidemiological bulletin data. I analyzed the number of recorded cases in the 2009-2013 period, which led to the creation of an endemic channel using the quartile and C-Sum methods. Monthly incidence rates were calculated for the first half of 2014, making it possible to determine the pattern of endemicity. Months in which the incidence rates exceeded the third quartile or line C-sum were declared as epidemic months. RESULTS The provinces of Nampula, Zambezia, Sofala, and Inhambane accounted for 52.7% of all cases in the first half of 2014. Also during this period, the provinces of Nampula, Sofala and Tete were responsible for 54.9% of the deaths from malaria. The incidence rates of malaria in children, and in all ages, have showed patterns in the epidemic zone. For all ages, the incidence rate has peaked in April (2,573 cases/100,000 inhabitants). CONCLUSIONS The results suggest the occurrence of an epidemic pattern of malaria in the first half of 2014 in Mozambique. It is strategic to have a more accurate surveillance at all levels (central, provincial and district) to target prevention and control interventions in a timely manner.