Miracle-dz/UniFAR-FTUs huggingface dataset:
The CRISPR-Cas system presents multiple transcriptional units including antisense RNAs that are expressed in minimal medium and up-regulated by pH in Salmonella enterica serovar Typhi.

The CRISPR-Cas system is involved in bacterial immunity, virulence, gene regulation, biofilm formation and sporulation. In Salmonella enterica serovar Typhi this system consists of five transcriptional units including antisense RNAs. It was determined that these genetic elements are expressed in minimal medium and are up-regulated by pH. In addition, a transcriptional characterization of cas3 and ascse2-1 is included herein.
Generation Capacity Expansion Planning Under Hydro Uncertainty Using Stochastic Mixed Integer Programming and Scenario Reduction

Generation capacity expansion planning (GCEP) is the process of deciding on a set of optimal new investments in generation capacity to adequately supply future loads, while satisfying technical and reliability constraints. This paper shows the application of stochastic mixed-integer programming (SMIP) to account for hydrological uncertainty in GCEP for the Chilean Central Interconnected System, using a two-stage SMIP multi-period model with investments and optimal power flow (OPF). The substantial computational challenges posed by GCEP imply compromising between the detail of the stochastic hydrological variables and the detail of the OPF. We selected a subset of hydrological scenarios to represent the historical hydro variability using moment-based scenario reduction techniques. The tradeoff between modeling accuracy and computational complexity was explored both regarding the simplification of the MIP problem and the differences in the variables of interest. Using a simplified OPF model, we found the difference of using a subset of hydro scenarios to be small when compared with using a full representation of the stochastic variable. Overall, SMIP with scenario reduction provided optimal capacity expansion plans whose investment plus expected operational costs were between 1.3% and 1.9% cheaper than using a deterministic approach and proved to be more robust to hydro variability.
Modèles de durée - Applications actuarielles

Les modeles de duree constituent un outil utilise dans de nombreux domaines de l'assurance : duree de la vie humaine, duree de l'arret de travail, duree de chomage, mais aussi duree d'attente entre deux sinistres, loi de rachat d'un contrat d'epargne, etc. Le present ouvrage presente les techniques de modelisation des durees de survie et leurs applications aux problematiques actuarielles. Il aborde notamment de maniere detaillee la construction de tables d'experience, tant en deces qu'en arret de travail.
Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open chain manipulators

We consider the following problem: given a robot system, find a minimal-time trajectory from a start state to a goal state, while avoiding obstacles by a speed-dependent safety margin and respecting dynamics bounds. In [CDRX] we developed a provably good approximation algorithm for the minimum-time trajectory problem for a robot system with decoupled dynamics bounds. This algorithm differed from previous work in three ways: it is possible (1) to bound the goodness of the approximation by an error term ε (2) to polynomially bound the running time (complexity) of our algorithm; and (3) to express the complexity as a polynomial function of the error term. We extend these results to <italic>d</italic>-link, revolute-joint 3D robots will full rigid body dynamics. Specifically, we first prove a generalized trajectory-tracking lemma for robots with coupled dynamics bounds. Using this result we describe polynomial-time approximation algorithms for Cartesian robots obeying <italic>L</italic><subscrpt>2</subscrpt> dynamics bounds and open kinematic chain manipulators with revolute and prismatic joints; the latter class includes most industrial manipulators. We obtain a general <italic>&Ogr;</italic>(<italic>n</italic><supscrpt>2</supscrpt> (log <italic>n</italic>)(1/ε<supscrpt>6<italic>d</italic>-1</supscrpt>) algorithm, where <italic>n</italic> is the geometric complexity. The algorithm is simple, but the new game-theoretic proof techniques we introduce are subtle, and employ tools from disparate parts of computational geometry, robotics, and dynamical systems.
Efficient and effective exploratory mining of constrained frequent sets

Data mining refers to the search for implicit, previously unknown, and potentially useful relationships or patterns (such as frequent sets) that might be embedded in data. Most of the existing data mining algorithms do not allow users to express the patterns to be mined according to their intentions, via the use of constraints. Consequently, these unconstrained mining algorithms can yield numerous patterns that are not interesting to users. Moreover, data mining is supposed to be a human-centered and exploratory process, not a one-shot exercise. In this context, we are working on a project with the overall objective of developing a practical human-centered computing environment for the efficient and effective exploratory mining of constrained frequent sets. One critical component of such an environment is the support for the dynamic mining of constrained frequent sets. Constraints enable users to impose a certain focus on the mining process. The term "dynamic" means that, in the middle of the computation, users are able to (i) change (such as tighten or relax) the constraints, and/or (ii) change the support threshold. This permits users to have a decisive influence on subsequent computations. In real-life situations, the available buffer space may be quite limited, thus adding another complication to the problem. In this thesis, we develop an algorithm, called DCF, for Dynamic Constrained Frequent-set computation. This algorithm is enhanced with a few optimizations, exploiting a light-weight structure called a segment support map. Such a structure enables DCF to (i) obtain sharper bounds on the support of patterns (or frequent sets of items), and (ii) better exploit properties of constraints. Furthermore, when handling dynamic changes to constraints, DCF relies on the concept of a delta member generating function, which exploits a special class of constraints—namely, succinct constraints—to generate precisely the sets of items that satisfy the new but not the old constraints. Our experimental results show the effectiveness of these enhancements. Lastly, to show that the exploitation of succinct constraints is not confined to DCF, we develop another algorithm that also supports the dynamic mining of constrained frequent sets, albeit in a tree-based framework.
Femtosecond to Attosecond Optics

We continue to observe strong progress moving from femtosecond to attosecond optics. Attosecond pulses are now available in many different labs with additional gating techniques which somewhat relax the requirements for the pulse duration of the intense infrared laser pulses. The pulse repetition rate still sets a limit on the signal-to-noise ratio for attosecond pump-probe measurements, and therefore, other streaking techniques have resulted in time-resolved measurements with sub-10-attosecond accuracy. Recent improvements on high-power ultrafast diode-pumped solid-state and fiber lasers will offer alternative sources for megahertz attosecond pulse generation. First proof-of-principle experiments have been demonstrated.
Weak state routing for large scale dynamic networks

Routing in communication networks involves the indirection from a persistent name (or ID) to a locator and delivering packets based upon the locator. In a large-scale, highly dynamic network, the ID-to-locator mappings are both large in number, and change often. Traditional routing protocols require high overhead to keep these in directions up-to-date. In this paper, we propose Weak State Routing (WSR), a routing mechanism for large-scale highly dynamic networks. WSR's novelty is that it uses random directional walks biased occasionally by weak indirection state information in intermediate nodes. The indirection state information is weak, i.e. interpreted not as absolute truth, but as probabilistic hints. Nodes only have partial information about the region a destination node is likely to be. This method allows us to aggregate information about a number of remote locations in a geographic region. In other words, the state information maps a set-of-IDs to a it geographical region. The intermediate nodes receiving the random walk use a method similar to longest-prefix-match in order to prioritize their mappings to decide how to bias and forward the random walk. WSR can also be viewed as an unstructured distributed hashing technique. WSR displays good rare-object recall with scalability properties similar to structured DHTs, albeit with more tolerance to dynamism and without constraining the degree distribution of the underlying network. Through simulations, we show that WSR offers a high packet delivery ratio, more than 98%. The control packet overhead incurred in the network scales as O(N) for N-node networks. The number of mappings stored in the network appears to scale as Θ(N(3/2)). We compare WSR with Dynamic Source Routing (DSR) and geographic forwarding (GPSR) combined with Grid Location Service (GLS). Our results indicate that WSR delivers more packets with less overhead at the cost of increased path length.
Outils d'analyse des contenus mathématiques à enseigner au lycée et à l'université

Dans cet article, nous proposons des outils d'analyse des notions mathematiques a enseigner au lycee et a l'universite prenant en compte leur specificite et leur complexite, compte tenu des programmes d'enseignement, des attentes institutionnelles, et des hypotheses sur l'enseignement et l'apprentissage que nous admettons et/ou que nous voulons mettre en jeu. Dans la premiere partie, nous precisons ainsi ce sur quoi nous nous sommes appuyee: des caracteristiques des pratiques des mathematiciens professionels, des elements sur les pratiques attendues de la part des eleves, des resultats intermediaires sur les acquisitions (resultats de recherches sur des conditions suffisantes d'apprentissage et elements inspires de theories de Vygotski). Dans la deuxieme partie nous exposons les 4 dimensions retenues. Le trois premieres precisent des caracteres directement lies aux notions a enseigner telles qu'elles apparaissent dans les programmes (notamment quant a l'insertion dans le paysage mathematique des eleves). La derniere dimension, en revanche, repere differentes mises en fonctionnement possibles des notions dans les activites des eleves. La troisieme partie est consacree a l'illustration d'une utilisation de nos dimensions pour elaborer certains scenarios (sur le plan des contenus). Dans la derniere partie, nous indiquons une application methodologique de ce qui precede aux analyses des tâches et d'activites a ces niveaux de scolarite.
Geographically-Sensitive Link Analysis

Many web pages and resources are primarily relevant to certain geographic locations. For example, in many queries web pages on restaurants, hotels, or movie theaters are mostly relevant to those users who are in geographic proximity to these locations. Moreover, as the number of queries with a local component increases, searching for web pages which are relevant to geographic locations is becoming increasingly important. The performance of geographically-oriented search is greatly affected by how we use geographic information to rank web pages. In this paper, we study the issue of ranking web pages using geographically-sensitive link analysis algorithms. More precisely, we study the question of whether geographic information can improve search performance. We propose several geographically-sensitive link analysis algorithms which exploit the geographic linkage between pages. We empirically analyze the performance of our algorithms.
Targeted Deletion of HIF-1α Gene in T Cells Prevents their Inhibition in Hypoxic Inflamed Tissues and Improves Septic Mice Survival

Background Sepsis patients may die either from an overwhelming systemic immune response and/or from an immunoparalysis-associated lack of anti-bacterial immune defence. We hypothesized that bacterial superantigen-activated T cells may be prevented from contribution into anti-bacterial response due to the inhibition of their effector functions by the hypoxia inducible transcription factor (HIF-1α) in inflamed and hypoxic areas. Methodology/Principal Findings Using the Cre-lox-P-system we generated mice with a T–cell targeted deletion of the HIF-1α gene and analysed them in an in vivo model of bacterial sepsis. We show that deletion of the HIF-1α gene leads to higher levels of pro-inflammatory cytokines, stronger anti-bacterial effects and much better survival of mice. These effects can be at least partially explained by significantly increased NF-κB activation in TCR activated HIF-1 α deficient T cells. Conclusions/Significance T cells can be recruited to powerfully contribute to anti-bacterial response if they are relieved from inhibition by HIF-1α in inflamed and hypoxic areas. Our experiments uncovered the before unappreciated reserve of anti-bacterial capacity of T cells and suggest novel therapeutic anti-pathogen strategies based on targeted deletion or inhibition of HIF-1 α in T cells.
Throughput of rateless codes over broadcast erasure channels

In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov modulated erasure channel that is i.i. d. across users, but can be correlated in time. We characterize the system throughput asymptotically in n. Specifically, we explicitly show how the throughput behaves for different values of the coding block size K as a function of n, as n approaches infinity. Under the more restrictive assumption of memoryless channels, we are able to provide a lower bound on the maximum achievable throughput for any finite values of K and n. Using simulations we show the tightness of the bound with respect to system parameters n and K, and find that its performance is significantly better than the previously known lower bound.
Multi-ontology based semantic annotation review

Day by day, the amount of digital data grows exponentially. Furthermore, these data come from heterogeneous content and structure resources. Both factors are the major handicap that limits the correct functioning of information systems. Being on the same wavelength, researchers have fixed as a challenge to reach targeted information retrieval which allows an easy access to the desired resource then return relevant and correct outcomes corresponding to a specific request. Therefore, semantic annotation is chosen as a paramount solution that may handle all these requirements, while ensuring a good understanding of document content then exploit and share it readily afterward. In this paper, we treat semantic annotation of documents using multi-ontologies, by stressing the effect of that on the relevance and the quality of semantic annotation results. We present a survey of different multi-ontologies based semantic annotation approaches and conclude with a synthesis of the study made.
Blood pressure management after acute spinal cord injury.

STANDARDS There is insufficient evidence to support treatment standards. GUIDELINES There is insufficient evidence to support treatment guidelines. OPTIONS Hypotension (systolic blood pressure <90 mmHg) should be avoided if possible or corrected as soon as possible after acute spinal cord injury. Maintenance of mean arterial blood pressure at 85 to 90 mmHg for the first 7 days after acute spinal cord injury to improve spinal cord perfusion is recommended.
Securing frame communication in browsers

Many Web sites embed third-party content in frames, relying on the browser's security policy to protect against malicious content. However, frames provide insufficient isolation in browsers that let framed content navigate other frames. We evaluate existing frame navigation policies and advocate a stricter policy, which we deploy in the open-source browsers. In addition to preventing undesirable interactions, the browser's strict isolation policy also affects communication between cooperating frames. We therefore analyze two techniques for interframe communication between isolated frames. The first method, fragment identifier messaging, initially provides confidentiality without authentication, which we repair using concepts from a well-known network protocol. The second method, <code>postMessage</code>, initially provides authentication, but we discover an attack that breaches confidentiality. We propose improvements in the <code>postMessage</code> API to provide confidentiality; our proposal has been standardized and adopted in browser implementations.
Two-variable logic on data trees and XML reasoning

Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on data trees is investigated. The nodes of a data tree have a label from a finite set and a data value from a possibly infinite set. It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can be accessed only through the child and the next sibling predicates and the access to data values is restricted to equality tests. From this main result, decidability of satisfiability and containment for a data-aware fragment of XPath and of the implication problem for unary key and inclusion constraints is concluded.
Randomized Algorithms for Multiprocessor Page Migration

The page migration problem is to manage a globally addressed shared memory in a multiprocessor system. Each physical page of memory is located at a given processor, and memory references to that page by other processors incur a cost proportional to the network distance. At times the page may migrate between processors at cost proportional to the distance times $D$, a page size factor. The problem is to schedule movements on-line so that the total cost of memory references is within a constant factor $c$ of the best off-line schedule. An algorithm that does so is called c-competitive. Black and Sleator gave 3-competitive deterministic on-line algorithms for uniform networks (complete graphs with unit edge lengths) and for trees with arbitrary edge lengths. No good deterministic algorithm is known for general networks with arbitrary edge lengths. Randomized algorithms are presented for the migration problem that are both simple and better than 3-competitive against an oblivious adversary. An algorithm for uniform graphs is given. It is approximately 2.28-competitive as $D$ grows large. A second, more powerful algorithm that works on graphs with arbitrary edge distances is also given. This algorithm is approximately 2.62-competitive (or, 1 plus the golden ratio) for large $D$. Both these algorithms use random bits only during an initialization phase, and from then on run deterministically. The competitiveness of a very simple coin-flipping algorithm is also examined.
Reduction of cogging torque and EMF harmonics in modulated pole machines

This paper discusses a method for reducing cogging torque and harmonic content of back EMF waveforms in modulated pole machines (MPMs). Tooth pitching is applied to a separate phase MPM in order to reduce the most prominent harmonics present in a three-phase MPM's cogging torque. Experimental results show that the application of tooth pitching to these machines can reduce the cogging torque and back EMF harmonics significantly; this comes without a significant impact to the useful output of the machine and without the need for extra components. Such a technique can be easily applied to existing machine designs without increasing the production cost.
A comparison of circuit breaker technologies for medium voltage direct current distribution networks

Circuit breakers for direct current (DC) are a key component for implementing multi-terminal DC networks. DC circuit breakers are already available for low voltage (LV) level and have been investigated in the high voltage (HV) level. This however leaves a gap in the medium voltage (MV) level, where neither technologies from the HV or LV could directly provide a satisfying solution. Different circuit breakers designs are compared for MVDC distribution networks. Bidirectional variants for all designs are used for the comparisons. They are compared according to their operation, time of fault isolation, required passive and active components.
Numerical modeling of biomolecular electrostatic properties by the Element-Free Galerkin Method

The Element-Free Galerkin Method is applied to the study of the electrostatic behavior of a biomolecule inside a ionic solvent. The aim is the solution of the linearized Poisson-Boltzmann equation. The numerical results put in evidence the capability of the approach in approximating the steep gradients of the electrostatic potential arising in the molecular region.
Modelos Teóricos de Difusão Dérmica: abordagens matemáticas e computacionais para terapias transdérmicas da Obesidade

Transdermal biotechnologies are an ever increasing field of interest, due to the medical and pharmaceutical applications that they underlie. There are several mathematical models at use that permit a more inclusive vision of pure experimental data and even allow practical extrapolation for new dermal diffusion methodologies. However, they grasp a complex variety of theories and assumptions that allocate their use for specific situations. Models based on Fick’s First Law found better use in contexts where Scaled Particle Theory Models would be extensive in time-span but the reciprocal is also true, as context of transdermal diffusion of particular active compounds changes. This article reviews extensively the various theoretical methodologies for studying dermic diffusion and systematizes its characteristics, their proper context of application, advantages and limitations, as well as future perspectives. Modelos Teóricos de Difusão Dérmica: Abordagens matemáticas e computacionais para terapias transdérmicas da Obesidade 83
Distortion Rate Function of Sub-Nyquist Sampled Gaussian Sources

The amount of information lost in sub-Nyquist sampling of a continuous-time Gaussian stationary process is quantified. We consider a combined source coding and sub-Nyquist reconstruction problem in which the input to the encoder is a noisy sub-Nyquist sampled version of the analog source. We first derive an expression for the mean squared error in the reconstruction of the process from a noisy and information rate-limited version of its samples. This expression is a function of the sampling frequency and the average number of bits describing each sample. It is given as the sum of two terms: minimum mean square error in estimating the source from its noisy but otherwise fully observed sub-Nyquist samples, and a second term obtained by reverse waterfilling over an average of spectral densities associated with the polyphase components of the source. We extend this result to multi-branch uniform sampling, where the samples are available through a set of parallel channels with a uniform sampler and a pre-sampling filter in each branch. Further optimization to reduce distortion is then performed over the pre-sampling filters, and an optimal set of pre-sampling filters associated with the statistics of the input signal and the sampling frequency is found. This results in an expression for the minimal possible distortion achievable under any analog-to-digital conversion scheme involving uniform sampling and linear filtering. These results thus unify the Shannon–Whittaker–Kotelnikov sampling theorem and Shannon rate-distortion theory for Gaussian sources.