678 research outputs found

    Numerical and experimental verification of a theoretical model of ripple formation in ice growth under supercooled water film flow

    Full text link
    Little is known about morphological instability of a solidification front during the crystal growth of a thin film of flowing supercooled liquid with a free surface: for example, the ring-like ripples on the surface of icicles. The length scale of the ripples is nearly 1 cm. Two theoretical models for the ripple formation mechanism have been proposed. However, these models lead to quite different results because of differences in the boundary conditions at the solid-liquid interface and liquid-air surface. The validity of the assumption used in the two models is numerically investigated and some of the theoretical predictions are compared with experiments.Comment: 30 pages, 9 figure

    Query rewriting under linear EL knowledge bases

    Get PDF
    With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of directly answering more expressive queries than simple conjunctive queries. In this paper we exploit such capabilities to answer conjunctive queries (CQs) under ontologies expressed in the description logic called linear EL-lin, a restricted form of EL. In particular, we show a query answering algorithm that rewrites a given CQ into a conjunctive regular path query (CRPQ) which, evaluated on the given instance, returns the correct answer. Our technique is based on the representation of infinite unions of CQs by non-deterministic finite-state automata. Our results achieve optimal data complexity, as well as producing rewritings straightforwardly implementable in SPARQL 1.1

    Multi-Player and Multi-Choice Quantum Game

    Full text link
    We investigate a multi-player and multi-choice quantum game. We start from two-player and two-choice game and the result is better than its classical version. Then we extend it to N-player and N-choice cases. In the quantum domain, we provide a strategy with which players can always avoid the worst outcome. Also, by changing the value of the parameter of the initial state, the probabilities for players to obtain the best payoff will be much higher that in its classical version.Comment: 4 pages, 1 figur

    Local effects of large food-falls on nematode diversity at an arctic deep-sea site: results from an <i>in situ</i> experiment at the deep-sea observatory HAUSGARTEN

    Get PDF
    To study the response of the smaller benthic biota to larger food-falls and their possible effects on the biodiversity at the deep seafloor, we deployed the halves of a sagittally bisected porpoise (1.3 m in length: each half approximately 18 kg) at 2500 m and 5400 m water depth at the LTER (Long-Term Ecological Research) observatory HAUSGARTEN in the eastem Fram Strait. Five weeks after the porpoise deployment, sediments beneath the carcasses and at different distances (0, 20, 40 cm) from these artificial food-falls were sampled with push-corers handled by a Remotely Operated Vehicle. The samples provided empirical evidence for a quick response by sediment-inhabiting bacteria and metazoan meiofauna to the carcasses at both water depths. Compared to control sediments, the substantial pulse of organic matter also led to generally increased meiofauna/nematode densities around the artificial food-falls. The comparison of nematode communities in sediments affected by the carcasses with those in control sediments exhibited shifts in the structural composition and the associated trophic and functional diversity of the nematodes. Our results confirmed that the impact of large food-falls on the deep benthic community largely depend on environmental factors (water depth, alternative food sources) as well as the background species composition, i.e., the structure of the prevailing meiofauna/nematode assemblages and the composition of the necrophagous community present in the wider area

    The rainbow cohort: 96 week follow-up of saquinavir-containing regimens in previously antiretroviral therapy (ART)-naïve and pre-treated but protease inhibitor (PI)- naïve hiv-infected patients

    Get PDF
    <p>Abstract</p> <p>Objective</p> <p>We have previously reported data from the German cohort of the multinational observational prospective RAINBOW survey which assessed the tolerability and efficacy of ritonavir-boosted saquinavir (SQV/r)-containing regimens over 48 weeks in routine clinical practice. This analysis presents data from antiretroviral (ART)-naïve and pretreated but protease inhibitor (PI)-naïve patients treated in a long-term one line (96 weeks) follow-up of the initial study.</p> <p>Methods</p> <p>All ART-and PI-naïve patients from the initial RAINBOW cohort who had recorded data to one line 96 weeks of treatment were eligible for inclusion in the current analysis. Efficacy assessments included the proportion of patients with HIV-1 RNA < 50 and < 400 copies/mL and changes in CD4 cell count from baseline to week 96. Tolerability assessments included changes in liver enzymes and lipid levels from baseline to week 96. For evaluation of efficacy, intent-to-treat analysis, in which missing values were recorded as failure (ITT), and last-observation-carried-forward (LOCF) analysis were used. Metabolic parameters were assessed using LOCF analysis.</p> <p>Results</p> <p>The analysis included 175 ART-naïve and 109 pretreated but PI-naïve patients. After 96 weeks, a similar proportion of patients in the ART-naïve and in the pretreated but Pi-naïve group had HIV-1 RNA levels < 400 copies/mL (68.0% and 70.6% [ITT], respectively; 96.6% and 90.8% [LOCF], respectively). The proportion of patients with HIV RNA < 50 copies/mL was higher in the ART-naïve group compared with the pretreated but PI-naïve group (61.1% and 56.9% [ITT], respectively; 84.0% and 75.2% [LOCF], respectively). Median change in CD4 cell count from baseline to week 96 was'+263 cells/mm<sup>3 </sup>(IQR 170; 384. LOCF; p < 0.0001) in the ART-naïve group, and one line +181 cells/mm<sup>3 </sup>(IQR 60; 309. LOCF; p < 0.0001) in the pretreated but PI-naïve group. Treatment was well tolerated, with only 2.5% of patients withdrawing from treatment due to side effects. There were no clinically relevant changes in liver enzyme levels. Overall total cholesterol, triglyceride, and low-and high-density lipoprotein levels increased to week 96, although levels remained within normal ranges in the majority of ART-naïve and pretreated patients.</p> <p>Conclusions</p> <p>This follow-up analysis confirms the long term efficacy and tolerability of SQV/r in ART-naïve and pretreated but PI-naïve patients in the real-life clinical setting.</p

    Transcriptional regulation of the urokinase receptor (u-PAR) - A central molecule of invasion and metastasis

    Get PDF
    The phenomenon of tumor-associated proteolysis has been acknowledged as a decisive step in the progression of cancer. This short review focuses on the urokinase receptor (u-PAR), a central molecule involved in tumor-associated invasion and metastasis, and summarizes the transcriptional regulation of u-PAR. The urokinase receptor (u-PAR) is a heavily glycosylated cell surface protein and binds the serine protease urokinase specifically and with high affinity. It consists of three similar cysteine-rich repeats and is anchored to the cell membrane via a GPI-anchor. The u-PAR gene comprises 7 exons and is located on chromosome 19q13. Transcriptional activation of the u-PAR promoter region can be induced by binding of transcription factors (Sp1, AP-1, AP-2, NF-kappaB). One current study gives an example for transcriptional downregulation of u-PAR through a PEA3/ets transcriptional silencing element. Knowledge of the molecular regulation of this molecule in tumor cells could be very important for diagnosis and therapy in the near future

    An Ordered Approach to Solving Parity Games in Quasi-Polynomial Time and Quasi-Linear Space

    Get PDF
    Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have recently shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their data structure as a progress measure, allowing for a backward implementation instead of a complete unravelling of the game. To achieve this, a number of changes have to be made to their techniques, where the main one is to add power to the antagonistic player that allows for determining her rational move without changing the outcome of the game. We provide a first implementation for a quasi-polynomial algorithm, test it on small examples, and provide a number of side results, including minor algorithmic improvements, a quasi-bi-linear complexity in the number of states and edges for a fixed number of colours, matching lower bounds for the algorithm of Calude et al., and a complexity index associated to our approach, which we compare to the recently proposed register index
    corecore