Concurrency detection on finish-to-start activity precedence networks

We explore the finish-to-start precedence relations of project activities used in scheduling problems. From these relations, we devise a method to identify groups of activities that could execute concurrently, i.e. activities in the same group can all execute in parallel. The method derives a new set of relations to describe the concurrency. Then, it is represented by an undirected graph and the maximal cliques problem identifies the groups. We provide a running example with a project from our previous studies in resource constrained project cost minimization together with an example application on the concurrency detection method: the evaluation of the resource stress.

A formação profissional do docente à inclusão de alunos com necessidades educativas especiais

Dissertação de mestrado em Educação Especial (área de especialização em Dificuldades de Aprendizagem Específicas)

Unconstrained optimization with MINTOOLKIT for GNU octave

The paper documents MINTOOLKIT for GNU Octave. MINTOOLKIT provides functions for minimization and numeric differentiation. The main algorithms are BFGS, LBFGS, and simulated annealing. Examples are given.

Sensitivity of simulation results to competing SAM updates

Recently there has been a renewed research interest in the properties of non survey updates of input-output tables and social accounting matrices (SAM). Along with the venerable and well known scaling RAS method, several alternative new procedures related to entropy minimization and other metrics have been suggested, tested and used in the literature. Whether these procedures will eventually substitute or merely complement the RAS approach is still an open question without a definite answer. The performance of many of the updating procedures has been tested using some kind of proximity or closeness measure to a reference input-output table or SAM. The first goal of this paper, in contrast, is the proposal of checking the operational performance of updating mechanisms by way of comparing the simulation results that ensue from adopting alternative databases for calibration of a reference applied general equilibrium model. The second goal is to introduce a new updatin! g procedure based on information retrieval principles. This new procedure is then compared as far as performance is concerned to two well-known updating approaches: RAS and cross-entropy. The rationale for the suggested cross validation is that the driving force for having more up to date databases is to be able to conduct more current, and hopefully more credible, policy analyses.

Numerical schemes of diffusion asymptotics and moment closures for kinetic equations

We investigate different models that are intended to describe the small mean free path regime of a kinetic equation, a particular attention being paid to the moment closure by entropy minimization. We introduce a specific asymptotic-induced numerical strategy which is able to treat the stiff terms of the asymptotic diffusive regime. We evaluate on numerics the performances of the method and the abilities of the reduced models to capture the main features of the full kinetic equation.

Characterizations of Lojasiewicz inequalities and applications

The classical Lojasiewicz inequality and its extensions for partial differential equation problems (Simon) and to o-minimal structures (Kurdyka) have a considerable impact on the analysis of gradient-like methods and related problems: minimization methods, complexity theory, asymptotic analysis of dissipative partial differential equations, tame geometry. This paper provides alternative characterizations of this type of inequalities for nonsmooth lower semicontinuous functions defined on a metric or a real Hilbert space. In a metric context, we show that a generalized form of the Lojasiewicz inequality (hereby called the Kurdyka- Lojasiewicz inequality) relates to metric regularity and to the Lipschitz continuity of the sublevel mapping, yielding applications to discrete methods (strong convergence of the proximal algorithm). In a Hilbert setting we further establish that asymptotic properties of the semiflow generated by -∂f are strongly linked to this inequality. This is done by introducing the notion of a piecewise subgradient curve: such curves have uniformly bounded lengths if and only if the Kurdyka- Lojasiewicz inequality is satisfied. Further characterizations in terms of talweg lines -a concept linked to the location of the less steepest points at the level sets of f- and integrability conditions are given. In the convex case these results are significantly reinforced, allowing in particular to establish the asymptotic equivalence of discrete gradient methods and continuous gradient curves. On the other hand, a counterexample of a convex C2 function in R2 is constructed to illustrate the fact that, contrary to our intuition, and unless a specific growth condition is satisfied, convex functions may fail to fulfill the Kurdyka- Lojasiewicz inequality.

Sparse regularization for fiber ODF reconstruction: from the suboptimality of ℓ2 and ℓ1 priors to ℓ0.

Diffusion MRI is a well established imaging modality providing a powerful way to probe the structure of the white matter non-invasively. Despite its potential, the intrinsic long scan times of these sequences have hampered their use in clinical practice. For this reason, a large variety of methods have been recently proposed to shorten the acquisition times. Among them, spherical deconvolution approaches have gained a lot of interest for their ability to reliably recover the intra-voxel fiber configuration with a relatively small number of data samples. To overcome the intrinsic instabilities of deconvolution, these methods use regularization schemes generally based on the assumption that the fiber orientation distribution (FOD) to be recovered in each voxel is sparse. The well known Constrained Spherical Deconvolution (CSD) approach resorts to Tikhonov regularization, based on an ℓ(2)-norm prior, which promotes a weak version of sparsity. Also, in the last few years compressed sensing has been advocated to further accelerate the acquisitions and ℓ(1)-norm minimization is generally employed as a means to promote sparsity in the recovered FODs. In this paper, we provide evidence that the use of an ℓ(1)-norm prior to regularize this class of problems is somewhat inconsistent with the fact that the fiber compartments all sum up to unity. To overcome this ℓ(1) inconsistency while simultaneously exploiting sparsity more optimally than through an ℓ(2) prior, we reformulate the reconstruction problem as a constrained formulation between a data term and a sparsity prior consisting in an explicit bound on the ℓ(0)norm of the FOD, i.e. on the number of fibers. The method has been tested both on synthetic and real data. Experimental results show that the proposed ℓ(0) formulation significantly reduces modeling errors compared to the state-of-the-art ℓ(2) and ℓ(1) regularization approaches.

Tolerance-inducing immunosuppressive strategies in clinical transplantation: an overview.

The significant development of immunosuppressive drug therapies within the past 20 years has had a major impact on the outcome of clinical solid organ transplantation, mainly by decreasing the incidence of acute rejection episodes and improving short-term patient and graft survival. However, long-term results remain relatively disappointing because of chronic allograft dysfunction and patient morbidity or mortality, which is often related to the adverse effects of immunosuppressive treatment. Thus, the induction of specific immunological tolerance of the recipient towards the allograft remains an important objective in transplantation. In this article, we first briefly describe the mechanisms of allograft rejection and immune tolerance. We then review in detail current tolerogenic strategies that could promote central or peripheral tolerance, highlighting the promises as well as the remaining challenges in clinical transplantation. The induction of haematopoietic mixed chimerism could be an approach to induce robust central tolerance, and we describe recent encouraging reports of end-stage kidney disease patients, without concomitant malignancy, who have undergone combined bone marrow and kidney transplantation. We discuss current studies suggesting that, while promoting peripheral transplantation tolerance in preclinical models, induction protocols based on lymphocyte depletion (polyclonal antithymocyte globulins, alemtuzumab) or co-stimulatory blockade (belatacept) should, at the current stage, be considered more as drug-minimization rather than tolerance-inducing strategies. Thus, a better understanding of the mechanisms that promote peripheral tolerance has led to newer approaches and the investigation of individualized donor-specific cellular therapies based on manipulated recipient regulatory T cells.

Condensation of polyhedric structures onto soap films

We study the existence of solutions to general measure-minimization problems over topological classes that are stable under localized Lipschitz homotopy, including the standard Plateau problem without the need for restrictive assumptions such as orientability or even rectifiability of surfaces. In case of problems over an open and bounded domain we establish the existence of a “minimal candidate”, obtained as the limit for the local Hausdorff convergence of a minimizing sequence for which the measure is lower-semicontinuous. Although we do not give a way to control the topological constraint when taking limit yet— except for some examples of topological classes preserving local separation or for periodic two-dimensional sets — we prove that this candidate is an Almgren-minimal set. Thus, using regularity results such as Jean Taylor’s theorem, this could be a way to find solutions to the above minimization problems under a generic setup in arbitrary dimension and codimension.

Smoking in prisons: the need for effective and acceptable interventions.

Tobacco-smoking prevalence has been decreasing in many high-income countries, but not in prison. We provide a summary of recent data on smoking in prison (United States, Australia, and Europe), and discuss examples of implemented policies for responding to environmental tobacco smoke (ETS), their health, humanitarian, and ethical aspects. We gathered data through a systematic literature review, and added the authors' ongoing experience in the implementation of smoking policies outside and inside prisons in Australia and Europe. Detainees' smoking prevalence varies between 64 per cent and 91.8 per cent, and can be more than three times as high as in the general population. Few data are available on the prevalence of smoking in women detainees and staff. Policies vary greatly. Bans may either be 'total' or 'partial' (smoking allowed in cells or designated places). A comprehensive policy strategy to reduce ETS needs a harm minimization philosophy, and should include environmental restrictions, information, and support to detainees and staff for smoking cessation, and health staff training in smoking cessation.

Minimum interference routing with fast protection

One of the most effective techniques offering QoS routing is minimum interference routing. However, it is complex in terms of computation time and is not oriented toward improving the network protection level. In order to include better levels of protection, new minimum interference routing algorithms are necessary. Minimizing the failure recovery time is also a complex process involving different failure recovery phases. Some of these phases depend completely on correct routing selection, such as minimizing the failure notification time. The level of protection also involves other aspects, such as the amount of resources used. In this case shared backup techniques should be considered. Therefore, minimum interference techniques should also be modified in order to include sharing resources for protection in their objectives. These aspects are reviewed and analyzed in this article, and a new proposal combining minimum interference with fast protection using shared segment backups is introduced. Results show that our proposed method improves both minimization of the request rejection ratio and the percentage of bandwidth allocated to backup paths in networks with low and medium protection requirements

Adding QoS protection in order to enhance MPLS QoS routing

In this paper, a method for enhancing current QoS routing methods by means of QoS protection is presented. In an MPLS network, the segments (links) to be protected are predefined and an LSP request involves, apart from establishing a working path, creating a specific type of backup path (local, reverse or global). Different QoS parameters, such as network load balancing, resource optimization and minimization of LSP request rejection should be considered. QoS protection is defined as a function of QoS parameters, such as packet loss, restoration time, and resource optimization. A framework to add QoS protection to many of the current QoS routing algorithms is introduced. A backup decision module to select the most suitable protection method is formulated and different case studies are analyzed

Cost-effectiveness of the implementation of an enhanced recovery protocol for colorectal surgery.

BACKGROUND: Enhanced recovery protocols may reduce postoperative complications and length of hospital stay. However, the implementation of these protocols requires time and financial investment. This study evaluated the cost-effectiveness of enhanced recovery implementation. METHODS: The first 50 consecutive patients treated during implementation of an enhanced recovery programme were compared with 50 consecutive patients treated in the year before its introduction. The enhanced recovery protocol principally implemented preoperative counselling, reduced preoperative fasting, preoperative carbohydrate loading, avoidance of premedication, optimized fluid balance, standardized postoperative analgesia, use of a no-drain policy, as well as early nutrition and mobilization. Length of stay, readmissions and complications within 30 days were compared. A cost-minimization analysis was performed. RESULTS: Hospital stay was significantly shorter in the enhanced recovery group: median 7 (interquartile range 5-12) versus 10 (7-18) days (P = 0·003); two patients were readmitted in each group. The rate of severe complications was lower in the enhanced recovery group (12 versus 20 per cent), but there was no difference in overall morbidity. The mean saving per patient in the enhanced recovery group was euro1651. CONCLUSION: Enhanced recovery is cost-effective, with savings evident even in the initial implementation period.

Harmonic active contours.

We propose a segmentation method based on the geometric representation of images as 2-D manifolds embedded in a higher dimensional space. The segmentation is formulated as a minimization problem, where the contours are described by a level set function and the objective functional corresponds to the surface of the image manifold. In this geometric framework, both data-fidelity and regularity terms of the segmentation are represented by a single functional that intrinsically aligns the gradients of the level set function with the gradients of the image and results in a segmentation criterion that exploits the directional information of image gradients to overcome image inhomogeneities and fragmented contours. The proposed formulation combines this robust alignment of gradients with attractive properties of previous methods developed in the same geometric framework: 1) the natural coupling of image channels proposed for anisotropic diffusion and 2) the ability of subjective surfaces to detect weak edges and close fragmented boundaries. The potential of such a geometric approach lies in the general definition of Riemannian manifolds, which naturally generalizes existing segmentation methods (the geodesic active contours, the active contours without edges, and the robust edge integrator) to higher dimensional spaces, non-flat images, and feature spaces. Our experiments show that the proposed technique improves the segmentation of multi-channel images, images subject to inhomogeneities, and images characterized by geometric structures like ridges or valleys.

Eddy current effects on a clinical 7T-68 cm bore scanner.

INTRODUCTION: Eddy currents induced by switching of magnetic field gradients can lead to distortions in short echo-time spectroscopy or diffusion weighted imaging. In small bore magnets, such as human head-only systems, minimization of eddy current effects is more demanding because of the proximity of the gradient coil to conducting structures. METHODS: In the present study, the eddy current behavior achievable on a recently installed 7 tesla-68 cm bore head-only magnet was characterized. RESULTS: Residual effects after compensation were shown to be on the same order of magnitude as those measured on two whole body systems (3 and 4.7 T), while using two to three fold increased gradient slewrates.