Miracle-dz/UniFAR-FTUs huggingface dataset:
Computing canonical representatives of regular differential ideals

In this paper, we give three theoretical and practical contributions for solving polynomial ODE or PDE systems. The first one is practical: an algorithm which improves the purely algebraic part of Rosenfeld—Gröbner (the polynomial ODE or PDE systems simplifier which is the core of the Maple 5.5 diffalg package). It is a variant of lextriangular but does not need any Gröbner basis computation. The second one is theoretical: a characterization of the output of Rosenfeld—Gröbner and a clarification of the existing relationship between algebraic and differential characteristic sets. The third one is theoretical as well as practical: an algorithm to compute canonical representatives of differential polynomials modulo regular differential ideals without any use of Gröbner bases. This algorithm simplifies the theory (somehow a “pedagogic” contribution) but permits us also to perform easily linear algebra over the base field in the factor differential ring defined by a regular differential ideal.
Inhibition of neutrophil activation by p‐bromophenacyl bromide and its effects on phospholipase A2

1 In an effort to elucidate the nature of the inhibitory effects of p‐bromophenacyl bromide (pBPB) on neutrophil stimulation, we have examined its effects on several stages of stimulus‐response coupling. 2 Pretreatment of rat neutrophils with pBPB resulted in a dose‐ and time‐dependent irreversible inhibition of both N‐formylmethionyl‐leucylphenylalanine (fMet‐Leu‐Phe)‐induced lysosomal enzyme release and change in transmembrane potential. 3 Inhibition of the biological responses to the chemotactic peptide f Met‐Leu‐Phe was not due to receptor inactivation since f Met‐Leu‐[3H]‐Phe binding to the formyl peptide receptor was not significantly altered by pBPB pretreatment. 4 Inhibition by pBPB of phorbol myristate acetate (PMA)‐induced changes in transmembrane potential and the generation of superoxide (0–2) was also observed. 5 pBPB treatment appeared to inhibit activation of the NADPH oxidase without a direct effect on the oxidase itself. 6 This inhibitory effect was not accompanied by cell death or decrease in cellular titratable sulphydryl groups (at least at doses < 20 μM). 7 There was, however, significant inhibition of a membranous fraction of f Met‐Leu‐Phe‐induced phospholipase A2 activity by pretreatment with 10 μM pBPB, although total cellular phospholipase A2 was only minimally (< 20% inhibition) affected. 8 These data would indicate that pBPB inhibits an early event associated with stimulus‐response coupling in rat polymorphonuclear leukocytes (i.e. change in transmembrane potential). The inhibitory effects of pBPB may be secondary to the inhibition of a critical membranous fraction of cell bound phospholipase A2 activity or its activation, necessary for the initiation of cell activation.
Transaction Costs-Aware Portfolio Optimization via Fast Lowner-John Ellipsoid Approximation

Merton's portfolio optimization problem in the presence of transaction costs for multiple assets has been an important and challenging problem in both theory and practice. Most existing work suffers from curse of dimensionality and encounters with the difficulty of generalization. In this paper, we develop an approximate dynamic programing method of synergistically combining the Lowner-John ellipsoid approximation with conventional value function iteration to quantify the associated optimal trading policy. Through constructing Lowner-John ellipsoids to parameterize the optimal policy and taking Euclidean projections onto the constructed ellipsoids to implement the trading policy, the proposed algorithm has cut computational costs up to a factor of five hundred and meanwhile achieved near-optimal risk-adjusted returns across both synthetic and real-world market datasets.
Graffiti Networks: A Subversive, Internet-Scale File Sharing Model

The proliferation of peer-to-peer (P2P) file sharing protocols is due to their efficient and scalable methods for data dissemination to numerous users. But many of these networks have no provisions to provide users with long term access to files after the initial interest has diminished, nor are they able to guarantee protection for users from malicious clients that wish to implicate them in incriminating activities. As such, users may turn to supplementary measures for storing and transferring data in P2P systems. We present a new file sharing paradigm, called a Graffiti Network, which allows peers to harness the potentially unlimited storage of the Internet as a third-party intermediary. Our key contributions in this paper are (1) an overview of a distributed system based on this new threat model and (2) a measurement of its viability through a one-year deployment study using a popular web-publishing platform. The results of this experiment motivate a discussion about the challenges of mitigating this type of file sharing in a hostile network environment and how web site operators can protect their resources.
P. falciparum In Vitro Killing Rates Allow to Discriminate between Different Antimalarial Mode-of-Action

Chemotherapy is still the cornerstone for malaria control. Developing drugs against Plasmodium parasites and monitoring their efficacy requires methods to accurately determine the parasite killing rate in response to treatment. Commonly used techniques essentially measure metabolic activity as a proxy for parasite viability. However, these approaches are susceptible to artefacts, as viability and metabolism are two parameters that are coupled during the parasite life cycle but can be differentially affected in response to drug actions. Moreover, traditional techniques do not allow to measure the speed-of-action of compounds on parasite viability, which is an essential efficacy determinant. We present here a comprehensive methodology to measure in vitro the direct effect of antimalarial compounds over the parasite viability, which is based on limiting serial dilution of treated parasites and re-growth monitoring. This methodology allows to precisely determine the killing rate of antimalarial compounds, which can be quantified by the parasite reduction ratio and parasite clearance time, which are key mode-of-action parameters. Importantly, we demonstrate that this technique readily permits to determine compound killing activities that might be otherwise missed by traditional, metabolism-based techniques. The analysis of a large set of antimalarial drugs reveals that this viability-based assay allows to discriminate compounds based on their antimalarial mode-of-action. This approach has been adapted to perform medium throughput screening, facilitating the identification of fast-acting antimalarial compounds, which are crucially needed for the control and possibly the eradication of malaria.
A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations

We consider an algebraic representation that is useful for matrices with off-diagonal blocks of low numerical rank. A fast and stable solver for linear systems of equations in which the coefficient matrix has this representation is presented. We also present a fast algorithm to construct the hierarchically semiseparable representation in the general case.
A proposed suicide prevention intervention for LGBTQ youth: addressing an unmet need

ABSTRACT Lesbian, Gay, Bisexual, and Transgender (LGBT) youth face health disparities linked to societal stigma and discrimination based on their sexual orientation and/or gender identity. Depressive symptoms, feelings of prolonged hopelessness or sadness, suicidal ideation, and suicide attempts are considerably more likely for sexual minority and transgender youth than for heterosexual and non-transgender youth. The purpose of this paper is to understand the current state of LGBTQ youth suicide research and to propose a program plan for an LGBTQ youth-focused suicide prevention intervention. The author utilized two main research strategies for developing the plan: first, a PubMed literature search was executed to identify peer-reviewed literature on LGBT youth suicide prevention interventions. Second, a grey literature search was conducted to locate existing evidence-based suicide prevention interventions for the general youth population that may be useful for LGBTQ youth. Results from the PubMed literature search indicate that no LGBT-specific evidence-based interventions to reduce suicide risk are currently available. However, the grey literature search found that a number of evidence-based interventions for suicide prevention among the general youth population exist and contain elements that may be adapted for an LGBTQ-specific program. The author selected four evidence-based programs that have been reviewed and included in the Suicide Prevention Resource Center’s Best Practices Registry (BPR) based on their potential for adaptation for LGBTQ youth. The grey lit review also yielded a list of recommendations for agencies serving youth for developing more LGBT-inclusive programming published by the Suicide Prevention Resource Center. The author identified core elements of the four existing programs and designed new elements based on the SPRC’s recommendations to directly target LGBT-specific risk factors for suicide, and combined these to create “Protecting Our Youth: A Suicide Prevention Program for LGBTQ Youth and Allies (POY). ” The public health significance of this work is that it advances our understanding of the unique mental health needs of LGBTQ youth. Using a strong base of public health theory along with an extensive review of LGBTQ health research, the proposed program provides the basis of a potentially efficacious program for reducing suicide-related outcomes among members of a vulnerable population.
Ju n 20 02 On the domain of singular traces

After the introduction of spectral triples in Alain Connes’ Noncommutative Geometry, singular traces on B(H) became a quite popular tool in operator algebras. With the aim of classifying them some papers have been written ([3],[8],[1], see also [4] for nonpositive traces), addressing in particular the question of singular traceability, namely when, for a given operator, there exists a singular trace taking a finite non-zero value on it. Such a problem has been completely solved in [1], in terms of a condition on the asymptotics of the eigenvalue sequence of the given operator, thus selecting a class of operators whose eigenvalue asymptotics are in some sense close to the sequence 1/n. The problem we address in this note is slightly different, requesting now that the given operator just belongs to the domain of a singular trace, the value zero being allowed. Also, a dual question is addressed, namely for which operators there exists a singular trace assuming the value ∞ on it. A näıve answer would say that too slow asymptotics cannot be resummed by any (singular) trace, hence no singular trace may vanish on them, and conversely that too fast asymptotics are in the kernel of any (singular) trace, hence no singular trace can be infinite on them. Even though this statement will be true for singular traces generated by ‘regular’ asymptotics (see below), it is false in general. Indeed we show that every compact operator is in the kernel (hence in the domain) of some singular trace, and any infinite-rank operator is not in the domain (hence not in the kernel) of some singular trace. The mentioned results will be proved for general semifinite factors, in the spirit of [6]. The proofs are based on the new characterization of singular traceability given in [7], which we extend here to the continuous case, and also on the fact that ideals can be described mainly in terms of order relations.
Machine learning in morphological segmentation

The segmentation of microscopic images is a challenging application that can have numerous applications ranging from prognosis to diagnosis. Mathematical morphology is a very well established theory to process images. Segmentation by morphological means is based on watershed that considers an image as a topographic surface. Watershed requires input and marker image. The user can provide the latter but far more relevant results can be obtained for watershed segmentation if marker extraction relies on prior knowledge. Parameters governing marker extraction varying from image to image, machine learning approaches are of interest for robust extraction of markers. We review different strategies for extracting markers by machine learning: single classifier, multiple classifier, single classifier optimized by model selection. A. Elmotataz Université de Caen Basse-Normandie, France
Isolation of Specific Genomic Regions and Identification of Their Associated Molecules by Engineered DNA-Binding Molecule-Mediated Chromatin Immunoprecipitation (enChIP) Using the CRISPR System and TAL Proteins

Comprehensive understanding of genome functions requires identification of molecules (proteins, RNAs, genomic regions, etc.) bound to specific genomic regions of interest in vivo. To perform biochemical and molecular biological analysis of specific genomic regions, we developed engineered DNA-binding molecule-mediated chromatin immunoprecipitation (enChIP) to purify genomic regions of interest. In enChIP, specific genomic regions are tagged for biochemical purification using engineered DNA-binding molecules, such as transcription activator-like (TAL) proteins and a catalytically inactive form of the clustered regularly interspaced short palindromic repeats (CRISPR) system. enChIP is a comprehensive approach that emphasizes non-biased search using next-generation sequencing (NGS), microarrays, mass spectrometry (MS), and other methods. Moreover, this approach is not restricted to cultured cell lines and can be easily extended to organisms. In this review, we discuss applications of enChIP to elucidating the molecular mechanisms underlying genome functions.
Strategy Execution in Cognitive Skill Learning: an Item-level Test of Candidate Models the Instance Theory of Automatization

This article investigates the transition to memory-based performance that commonly occurs with practice on tasks that initially require use of a multistep algorithm. In an alphabet arithmetic task, item response times exhibited pronounced step-function decreases after moderate practice that were uniquely predicted by T. C. Rickard's (1997) component power laws model. The results challenge parallel strategy execution models as developed to date and they demonstrate that the shift to retrieval is an item-specific, as opposed to task-general, learning phenomenon. The results also call into question the entire class of smooth speed-up functions as global empirical learning laws. It is shown that overlaying of averaged item fits on averaged data can provide a sensitive test for model sufficiency. Strategy probes agreed with strategy inferences that were based on step-function speed-up patterns, supporting the validity of the probing technique. A basic question in the study of cognition is whether and when two mental processes can operate in parallel. Recently, much of the research in this area has focused on various aspects of long-This work is related more generally to the topics of attention and executive processing. If memory retrieval cannot take place in parallel with another retrieval or with some other cognitive process, then a performance bottleneck is implied and a decision mechanism is required when participants must make a choice. The results so far are mixed; some studies suggest that memory retrieval can proceed in parallel with other processes, whereas others do not. One goal of this article is to address the related issue of whether a memory recall strategy can be executed in parallel with a multistep algorithmic strategy in problem-solving and cued-recall tasks. Here and elsewhere in the literature, the term strategy is used merely to denote a unique series of one or more mental steps toward a solution and does not necessarily have direct implications regarding intention or awareness. An example task for which both of these strategies are available is single-digit arithmetic. To work a problem like 4 ϩ 5, children can execute a counting strategy, such as starting with four and counting on five fingers. After sufficient practice, they can also access the answer through direct memory retrieval, bypassing the algorithm all together (e.g., Siegler, 1988; Siegler & Shrager, 1984). There are numerous other examples of tasks that can be performed by either strategy after sufficient practice, both in the and in educational and professional settings. …
International Conference on Computational Science , ICCS 2012 Parallel Tree Reduction on MapReduce

MapReduce, the de facto standard for large scale data-intensive applications, is a remarkable parallel programming model, allowing for easy parallelization of data intensive computations over many machines in a cloud. As huge tree data such as XML has achieved the status of the de facto standard for representing structured information, the situation calls for efficient MapReduce programs treating such a tree data structure in parallel. However, development of such MapReduce programs has remained a challenge. In this paper, restructuring our previous BSP algorithm for tree reduction computations, we propose a new MapReduce algorithm that can be used to implement various tree computations such as XPath queries. Our algorithm is designed to achieve linear speedup even for extreme inputs, and our experimental result shows that our prototype implementation actually achieves linear speedup even for monadic trees.
A Pharmacokinetic and Dosing Study of Intravenous Insulin-Like Growth Factor-I and IGF-Binding Protein-3 Complex to Preterm Infants

In preterm infants, low levels of Insulin like growth factor 1 (IGF-I) have been associated with impaired growth and retinopathy of prematurity. Our objective was to study safety and pharmacokinetics of i.v. administered rhIGF-I with its binding protein 3 (rhIGFBP-3) to preterm infants. At 3 d chronological age, an i.v. 3 h infusion of rhIGF-I/rhIGFBP-3 was administered followed by serial measurements of IGF-I and IGFBP-3. Infants were evaluated for physiologic safety measurements. The individual dose of rhIGF-I ranged from 1 to 12 μg/kg. The study was conducted at Queen Silvia Children's Hospital, Gothenburg, Sweden, between January and November 2007. Five patients (3 F) with mean (range) post menstrual age 27 wk (26–29) and birth weight 1022 g (810–1310) participated. IGF-I and IGFBP-3 levels before infusion were median (range) 18 (12–28) and 771 (651–1047) ng/mL, respectively. Immediately after study drug infusion, serum IGF-I and IGFBP-3 levels were 38 (25–59) and 838 (754–1182) ng/mL, respectively. Median (range) half-life for IGF-I and IGFBP-3 was 0.79 (0.59–1.42) and 0.87 (0.85–0.94) hours, respectively. Blood glucose, insulin, sodium, potassium, and physiologic safety measures were within normal ranges. The rhIGF-I/rhIGFBP-3 equimolar proportion was effective in increasing serum IGF-I levels and administration under these study conditions was safe and well tolerated.
Perceptual evaluation of music similarity

This paper presents an empirical method for assessing music similarity on a set of stimuli using triadic comparisons in a balanced incomplete block design. We first evaluated the consistency of subjects in their rankings and then the concordance across subjects. The concordance was also evaluated for different subject populations to assess the influence of experience of the subject with the musical material. We finally analysed subjects’ ranking by the means of multidimensional scaling. Similarity judgments were found to be rather concordant across subjects. Significant differences between musicians and non-musicians and between subjects being familiar or non-familiar with the music were found for a small number of cases. Multidimensional scaling reveals a proximity of songs belonging to the same genre, congruent with the idea of genre being a perceptual dimension in subjects’ similarity ranking.
On almost sure identifiability of non multilinear tensor decomposition

Uniqueness of tensor decompositions is of crucial importance in numerous engineering applications. Extensive work in algebraic geometry has given various bounds involving tensor rank and dimensions to ensure generic identifiability. However, most of this work is hardly accessible to non-specialists, and does not apply to non-multilinear models. In this paper, we present another approach, using the Jacobian of the model. The latter sheds a new light on bounds and exceptions previously obtained. Finally, the method proposed is applied to a non-multilinear decomposition used in fluorescence spectrometry, which permits to state generic local identifiability.
The Social Bases of Nazism, 1919-1933

1. Introduction 2. Historiographic survey 3. Methodological problems 4. The social characteristics of the Nazi party in its formative years, 1919-1923 5. The social characteristics of the membership and leadership of the Nazi party, 1925-1933 6. The social characteristics of the membership and leadership of Nazi specialist organisations 7. The social geometry of the Nazi electorate, 1928-1933 8. Conclusion.
A Novel Digital Image Steganalysis Approach for Investigation

In the electronic world, one of the most appropriate “hosts” for steganography are digital images. Digital photographs are a commonly shared, sent, and exchanged throughout the Internet in the form of email attachments or web postings. However, current steganographic software available on the market has poor support for high-capacity image steganography. Even worse, some steganographic software actually distorts or degrades the appearance of cover images and therefore exposes the steganographic transformation the image has undergone. In this paper, we propose an algorithm for investigate digital image by steganalysis which is extended version of Modified Kekre Algorithm.
OPTIMAL INVESTMENT FOR ALL TIME HORIZONS AND MARTIN BOUNDARY OF SPACE‐TIME DIFFUSIONS

This paper is concerned with the axiomatic foundation and explicit construction of a general class of optimality criteria that can be used for investment problems with multiple time horizons, or when the time horizon is not known in advance. Both the investment criterion and the optimal strategy are characterized by the Hamilton–Jacobi–Bellman equation on a semi‐infinite time interval. In the case where this equation can be linearized, the problem reduces to a time‐reversed parabolic equation, which cannot be analyzed via the standard methods of partial differential equations. Under the additional uniform ellipticity condition, we make use of the available description of all minimal solutions to such equations, along with some basic facts from potential theory and convex analysis, to obtain an explicit integral representation of all positive solutions. These results allow us to construct a large family of the aforementioned optimality criteria, including some closed‐form examples in relevant financial models.
Metaphor, relevance and the 'emergent property' issue

The interpretation of metaphorical utterances often results in the attribution of emergent properties, which are neither standardly associated with the individual constituents in isolation nor derivable by standard rules of semantic composition. An adequate pragmatic account of metaphor interpretation must explain how these properties are derived. Using the framework of relevance theory, we propose a wholly inferential account, and argue that the derivation of emergent properties involves no special interpretive mechanisms not required for the interpretation of ordinary, literal utterances.