The Orbital Light Curve of Aquila X-1

We obtained R- and I-band CCD photometry of the soft X-ray transient/neutron- star binary Aql X-1 in 1998 June while it was at quiescence. We find that its light curve is dominated by ellipsoidal variations, although the ellipsoidal variations are severely distorted and have unequal maxima. After we correct for the contaminating flux from a field star located only 0.46" away, the peak-to-peak amplitude of the modulation is ~0.25 mag in the R band, which requires the orbital inclination to be greater than 36 degrees. The orbital period we measure is consistent with the 18.95 h period measured by Chevalier & Ilovaisky (1998). During its outbursts the light curve of Aql X-1 becomes single humped. The outburst light curve observed by Garcia et al. (1999) agrees in phase with our quiescent light curve. We show that the single humped variation is caused by a ``reflection effect,'' that is, by heating of the side of the secondary star facing towards the neutron star.Comment: 18 manuscript pages, 7 figures; accepted by A

Facilitated diffusion of proteins on chromatin

We present a theoretical model of facilitated diffusion of proteins in the cell nucleus. This model, which takes into account the successive binding/unbinding events of proteins to DNA, relies on a fractal description of the chromatin which has been recently evidenced experimentally. Facilitated diffusion is shown quantitatively to be favorable for a fast localization of a target locus by a transcription factor, and even to enable the minimization of the search time by tuning the affinity of the transcription factor with DNA. This study shows the robustness of the facilitated diffusion mechanism, invoked so far only for linear conformations of DNA.Comment: 4 pages, 4 figures, accepted versio

Picoliter-volume inkjet printing into planar microdevice reservoirs for low-waste, high-capacity drug loading.

Oral delivery of therapeutics is the preferred route for systemic drug administration due to ease of access and improved patient compliance. However, many therapeutics suffer from low oral bioavailability due to low pH and enzymatic conditions, poor cellular permeability, and low residence time. Microfabrication techniques have been used to create planar, asymmetric microdevices for oral drug delivery to address these limitations. The geometry of these microdevices facilitates prolonged drug exposure with unidirectional release of drug toward gastrointestinal epithelium. While these devices have significantly enhanced drug permeability in vitro and in vivo, loading drug into the micron-scale reservoirs of the devices in a low-waste, high-capacity manner remains challenging. Here, we use picoliter-volume inkjet printing to load topotecan and insulin into planar microdevices efficiently. Following a simple surface functionalization step, drug solution can be spotted into the microdevice reservoir. We show that relatively high capacities of both topotecan and insulin can be loaded into microdevices in a rapid, automated process with little to no drug waste

Residual mean first-passage time for jump processes: theory and applications to L\'evy flights and fractional Brownian motion

We derive a functional equation for the mean first-passage time (MFPT) of a generic self-similar Markovian continuous process to a target in a one-dimensional domain and obtain its exact solution. We show that the obtained expression of the MFPT for continuous processes is actually different from the large system size limit of the MFPT for discrete jump processes allowing leapovers. In the case considered here, the asymptotic MFPT admits non-vanishing corrections, which we call residual MFPT. The case of L/'evy flights with diverging variance of jump lengths is investigated in detail, in particular, with respect to the associated leapover behaviour. We also show numerically that our results apply with good accuracy to fractional Brownian motion, despite its non-Markovian nature.Comment: 13 pages, 8 figure

La mondialisation, facteur d’homogénéité ou d’hétérogénéité dans le rapport tourisme et nature ? (France/Chine)

National audienc

Approximating multiple class queueing models with loss models

Multiple class queueing models arise in situations where some flexibility is sought through pooling of demands for different services. Earlier research has shown that most of the benefits of flexibility can be obtained with only a small proportion of cross-trained operators. Predicting the performance of a system with different types of demands and operator pools with different skills is very difficult. We present an approximation method that is based on equivalent loss systems. We successively develop approximations for the waiting probability, The average waiting time and the service level. Our approximations are validated using a series of simulations. Along the way we present some interesting insights into some similarities between queueing systems and equivalent loss systems that have to our knowledge never been reported in the literature.

YAPA: A generic tool for computing intruder knowledge

Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages based on equational logics, knowledge is typically expressed by two relations: deducibility and static equivalence. Several decision procedures have been proposed for these relations under a variety of equational theories. However, each theory has its particular algorithm, and none has been implemented so far. We provide a generic procedure for deducibility and static equivalence that takes as input any convergent rewrite system. We show that our algorithm covers most of the existing decision procedures for convergent theories. We also provide an efficient implementation, and compare it briefly with the tools ProVerif and KiSs

Partitioning Complex Networks via Size-constrained Clustering

The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm reduces the graph size by iteratively contracting nodes and edges until the graph is small enough to be partitioned by some other algorithm. A partition of the input graph is then constructed by successively transferring the solution to the next finer graph and applying a local search algorithm to improve the current solution. In this paper, we describe a novel approach to partition graphs effectively especially if the networks have a highly irregular structure. More precisely, our algorithm provides graph coarsening by iteratively contracting size-constrained clusterings that are computed using a label propagation algorithm. The same algorithm that provides the size-constrained clusterings can also be used during uncoarsening as a fast and simple local search algorithm. Depending on the algorithm's configuration, we are able to compute partitions of very high quality outperforming all competitors, or partitions that are comparable to the best competitor in terms of quality, hMetis, while being nearly an order of magnitude faster on average. The fastest configuration partitions the largest graph available to us with 3.3 billion edges using a single machine in about ten minutes while cutting less than half of the edges than the fastest competitor, kMetis