Multicast algorithms evaluation using an adaptative routing in ATM networks

This paper proposes a multicast implementation based on adaptive routing with anticipated calculation. Three different cost measures for a point-to-multipoint connection: bandwidth cost, connection establishment cost and switching cost can be considered. The application of the method based on pre-evaluated routing tables makes possible the reduction of bandwidth cost and connection establishment cost individually

New perspectives in the use of ink evidence in forensic science: Part II. Development and testing of mathematical algorithms for the automatic comparison of ink samples analysed by HPTLC

In the first part of this research, three stages were stated for a program to increase the information extracted from ink evidence and maximise its usefulness to the criminal and civil justice system. These stages are (a) develop a standard methodology for analysing ink samples by high-performance thin layer chromatography (HPTLC) in reproducible way, when ink samples are analysed at different time, locations and by different examiners; (b) compare automatically and objectively ink samples; and (c) define and evaluate theoretical framework for the use of ink evidence in forensic context. This report focuses on the second of the three stages. Using the calibration and acquisition process described in the previous report, mathematical algorithms are proposed to automatically and objectively compare ink samples. The performances of these algorithms are systematically studied for various chemical and forensic conditions using standard performance tests commonly used in biometrics studies. The results show that different algorithms are best suited for different tasks. Finally, this report demonstrates how modern analytical and computer technology can be used in the field of ink examination and how tools developed and successfully applied in other fields of forensic science can help maximising its impact within the field of questioned documents.

Implementation of zonal control algorithms in adaptive optical systems with sparse control matrices

Miralls deformables més i més grans, amb cada cop més actuadors estan sent utilitzats actualment en aplicacions d'òptica adaptativa. El control dels miralls amb centenars d'actuadors és un tema de gran interès, ja que les tècniques de control clàssiques basades en la seudoinversa de la matriu de control del sistema es tornen massa lentes quan es tracta de matrius de dimensions tan grans. En aquesta tesi doctoral es proposa un mètode per l'acceleració i la paral.lelitzacó dels algoritmes de control d'aquests miralls, a través de l'aplicació d'una tècnica de control basada en la reducció a zero del components més petits de la matriu de control (sparsification), seguida de l'optimització de l'ordenació dels accionadors de comandament atenent d'acord a la forma de la matriu, i finalment de la seva posterior divisió en petits blocs tridiagonals. Aquests blocs són molt més petits i més fàcils de fer servir en els càlculs, el que permet velocitats de càlcul molt superiors per l'eliminació dels components nuls en la matriu de control. A més, aquest enfocament permet la paral.lelització del càlcul, donant una com0onent de velocitat addicional al sistema. Fins i tot sense paral. lelització, s'ha obtingut un augment de gairebé un 40% de la velocitat de convergència dels miralls amb només 37 actuadors, mitjançant la tècnica proposada. Per validar això, s'ha implementat un muntatge experimental nou complet , que inclou un modulador de fase programable per a la generació de turbulència mitjançant pantalles de fase, i s'ha desenvolupat un model complert del bucle de control per investigar el rendiment de l'algorisme proposat. Els resultats, tant en la simulació com experimentalment, mostren l'equivalència total en els valors de desviació després de la compensació dels diferents tipus d'aberracions per als diferents algoritmes utilitzats, encara que el mètode proposat aquí permet una càrrega computacional molt menor. El procediment s'espera que sigui molt exitós quan s'aplica a miralls molt grans.

Diaspore traits discriminate good from weak colonisers on high elevation summits

The richness of plant species in Swiss alpine-nival summits increased during the climate warming of the 20th century. Thirty-seven summits (2797-3418 m a.s.l.) with both old (~1900-1920) and recent (~2000) plant inventories were used to test whether biological species traits can explain the observed rates of summit colonisation. Species were classified into two groups: good colonisers (colonising five or more summits) and weak colonisers (fewer than five new summits). We compared species traits related to growth, reproduction and dispersal between these two groups and between the good colonisers and a group of high alpine grassland species. The observed colonisation pattern was subsequently compared to a simulated random colonisation pattern. The distribution of new species on the summits was not random, and 16 species exhibited a colonisation rate higher than expected by chance. Taraxacum alpinum aggr. and Cardamine resedifolia were the best colonisers. Results showed that diaspore traits enhancing long-distance dispersal were more frequent among good colonisers than among weak colonisers. Good colonisers were mostly characterised by pappi or narrow wings on their diaspores. Both groups were able to grow on soils more bare and rocky than species from the alpine grasslands. All other biological traits that we considered were similar among the three alpine species groups. These results are important for improving predictive models of species distribution under climate change

Simple estimation of incident HIV infection rates in notification cohorts based on window periods of algorithms for evaluation of line-immunoassay result patterns.

BACKGROUND: Tests for recent infections (TRIs) are important for HIV surveillance. We have shown that a patient's antibody pattern in a confirmatory line immunoassay (Inno-Lia) also yields information on time since infection. We have published algorithms which, with a certain sensitivity and specificity, distinguish between incident (< = 12 months) and older infection. In order to use these algorithms like other TRIs, i.e., based on their windows, we now determined their window periods. METHODS: We classified Inno-Lia results of 527 treatment-naïve patients with HIV-1 infection < = 12 months according to incidence by 25 algorithms. The time after which all infections were ruled older, i.e. the algorithm's window, was determined by linear regression of the proportion ruled incident in dependence of time since infection. Window-based incident infection rates (IIR) were determined utilizing the relationship 'Prevalence = Incidence x Duration' in four annual cohorts of HIV-1 notifications. Results were compared to performance-based IIR also derived from Inno-Lia results, but utilizing the relationship 'incident = true incident + false incident' and also to the IIR derived from the BED incidence assay. RESULTS: Window periods varied between 45.8 and 130.1 days and correlated well with the algorithms' diagnostic sensitivity (R(2) = 0.962; P<0.0001). Among the 25 algorithms, the mean window-based IIR among the 748 notifications of 2005/06 was 0.457 compared to 0.453 obtained for performance-based IIR with a model not correcting for selection bias. Evaluation of BED results using a window of 153 days yielded an IIR of 0.669. Window-based IIR and performance-based IIR increased by 22.4% and respectively 30.6% in 2008, while 2009 and 2010 showed a return to baseline for both methods. CONCLUSIONS: IIR estimations by window- and performance-based evaluations of Inno-Lia algorithm results were similar and can be used together to assess IIR changes between annual HIV notification cohorts.

The CaMV 35S promoter has a weak expression activity in dark grown tissues of moss Physcomitrella patens.

The constitutive Cauliflower Mosaic Virus 35S promoter (CaMV 35S) is widely used as a tool to express recombinant proteins in plants, but with different success. We previously showed that the expression of an F-actin marker, GFP-talin, in Physcomitrella patens using the CaMV 35S promoter failed to homogenously label moss tissues. Here, we show a significant diminution of the GFP fluorescence in dark grown old moss cells and complete lack of labelling in newly differentiated cells. Furthermore, we demonstrate that stable moss lines harbouring a resistance cassette driven by the CaMV 35S are unable to grow in darkness in the presence of the antibiotic. In contrast to the CaMV 35S, the heat inducible promoter, hsp17.3B showed uniform expression pattern in all cells and tissues following a mild heat shock.

Weak and Strong Altruism in Trait Groups: Reproductive Suicide, Personal Fitness, and Expected Value

A simple variant of trait group selection, employing predators as the mechanism underlying group selection, supports contingent reproductive suicide as altruism (i.e., behavior lowering personal fitness while augmenting that of another) without kin assortment. The contingent suicidal type may either saturate the population or be polymorphic with a type avoiding suicide, depending on parameters. In addition to contingent suicide, this randomly assorting morph may also exhibit continuously expressed strong altruism (sensu Wilson 1979) usually thought restricted to kin selection. The model will not, however, support a sterile worker caste as such, where sterility occurs before life history events associated with effective altruism; reproductive suicide must remain fundamentally contingent (facultative sensu West Eberhard 1987; Myles 1988) under random assortment. The continuously expressed strong altruism supported by the model may be reinterpreted as probability of arbitrarily committing reproductive suicide, without benefit for another; such arbitrary suicide (a "load" on "adaptive" suicide) is viable only under a more restricted parameter space relative to the necessarily concomitant adaptive contingent suicide.

Weak approximations. A Malliavin calculus approach

We introduce a variation of the proof for weak approximations that issuitable for studying the densities of stochastic processes which areevaluations of the flow generated by a stochastic differential equation on a random variable that maybe anticipating. Our main assumption is that the process and the initial random variable have to be smooth in the Malliavin sense. Furthermore if the inverse of the Malliavin covariance matrix associated with the process under consideration is sufficiently integrable then approximations fordensities and distributions can also be achieved. We apply theseideas to the case of stochastic differential equations with boundaryconditions and the composition of two diffusions.

Biometal muscles to restore contractile function of weak heart

Objectives: Existing VADs are single-ventricle pumps needing anticoagulation. We developed a bi-ventricular external assist device that partially reproduces the physiological muscle function of the heart. This artificial muscle could wrap the heart and improve its contractile force.Methods: The device has a carbon fiber skeleton fitting a 30-40kg patient's heart, to which a Nitinol based artificial muscle is connected. The artificial muscle wraps both ventricles. The Nitinol fibers are woven on a Kevlar mesh surrounding each ventricle. The fibers are electrically driven with a dedicated control unit developed for this purpose. We assessed hemodynamic performances of this device using a previously described dedicated bench test. Volume ejected and pressure gradient have been measured with afterload ranging from 10 to 50mmHg.Results: With an afterload of 50mmHg the system has an ejection fraction of 4% on the right side and 5% on the left side. The system is able to generate a systolic ejection of 2.2mL on the right side and 3.25mL on the left side. With an afterload of 25mmHg the results are reduced of about 20%. The activation frequency can reach 80/minute resulting in a total volume displacement of 176mL/minute on the right side and 260mL/minute on the left side.Conclusions: These preliminary studies confirmed the possibility of improving the ejection fraction of a failing heart using artificial muscle for external cardiac compression avoiding anticoagulation therapy. This device could be helpful in weaning cardio-pulmonary bypass and/or for short-term cardio-circulatory support in pediatric population with cardiac failure.

Peptide modification or blocking of CD8, resulting in weak TCR signaling, can activate CTL for Fas- but not perforin-dependent cytotoxicity or cytokine production.

This study describes a form of partial agonism for a CD8+ CTL clone, S15, in which perforin-dependent killing and IFN-gamma production were lost but Fas (APO1 or CD95)-dependent cytotoxicity preserved. Cloned S15 CTL are H-2Kd restricted and specific for a photoreactive derivative of the Plasmodium berghei circumsporozoite peptide PbCS 252-260 (SYIPSAEKI). The presence of a photoactivatable group in the epitope permitted assessment of TCR-ligand binding by TCR photoaffinity labeling. Selective activation of Fas-dependent killing was observed for a peptide-derivative variant containing a modified photoreactive group. A similar functional response was obtained after binding of the wild-type peptide derivative upon blocking of CD8 participation in TCR-ligand binding. The epitope modification or blocking of CD8 resulted in an &gt; or = 8-fold decrease in TCR-ligand binding. In both cases, phosphorylation of zeta-chain and ZAP-70, as well as calcium mobilization were reduced close to background levels, indicating that activation of Fas-dependent cytotoxicity required weaker TCR signaling than activation of perforin-dependent killing or IFN-gamma production. Consistent with this, we observed that depletion of the protein tyrosine kinase p56(lck) by preincubation of S15 CTL with herbimycin A severely impaired perforin- but not Fas-dependent cytotoxicity. Together with the observation that S15 CTL constitutively express Fas ligand, these results indicate that TCR signaling too weak to elicit perforin-dependent cytotoxicity or cytokine production can induce Fas-dependent cytotoxicity, possibly by translocation of preformed Fas ligand to the cell surface.

Comment to "Weak instruments robust tests in GMM and the New Keynesian Phillips curve" by Frank Kleibergen and Sophocles Mavroeidis

I discuss the identifiability of a structural New Keynesian Phillips curve when it is embedded in a small scale dynamic stochastic general equilibrium model. Identification problems emerge because not all the structural parameters are recoverable from the semi-structural ones and because the objective functions I consider are poorly behaved. The solution and the moment mappings are responsible for the problems.

Metaheuristics for the bus-driver scheduling problem

We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.