Maximal induced matchings in triangle-free graphs

An induced matching in a graph is a set of edges whose endpoints induce a $1$-regular subgraph. It is known that any $n$-vertex graph has at most $10^{n/5} \approx 1.5849^n$ maximal induced matchings, and this bound is best possible. We prove that any $n$-vertex triangle-free graph has at most $3^{n/3} \approx 1.4423^n$ maximal induced matchings, and this bound is attained by any disjoint union of copies of the complete bipartite graph $K_{3,3}$. Our result implies that all maximal induced matchings in an $n$-vertex triangle-free graph can be listed in time $O(1.4423^n)$, yielding the fastest known algorithm for finding a maximum induced matching in a triangle-free graph.Comment: 17 page

High-throughput mechanobiology: Force modulation of ensemble biochemical and cell-based assays

Mechanobiology is focused on how the physical forces and mechanical properties of proteins, cells, and tissues contribute to physiology and disease. Although the response of proteins and cells to mechanical stimuli is critical for function, the tools to probe these activities are typically restricted to single-molecule manipulations. Here, we have developed a novel microplate reader assay to encompass mechanical measurements with ensemble biochemical and cellular assays, using a microplate lid modified with magnets. This configuration enables multiple static magnetic tweezers to function simultaneously across the microplate, thereby greatly increasing throughput. We demonstrate the broad applicability and versatility through in vitro and in cellulo approaches. Overall, our methodology allows, for the first time (to our knowledge), ensemble biochemical and cell-based assays to be performed under force in high-throughput format. This approach substantially increases the availability of mechanobiology measurements

Allele mining in β-lactoglobulin gene of Capra hircus

β-Lactoglobulin (β-LG) genetic polymorphisms are important and well known due to their effects on quantitative traits and technological properties of milk. At the DNA level, polymerase chain reaction (PCR)-single-strand conformation polymorphism (SSCP) allows for the detection of unknown polymorphisms at β-LG loci. Here we describe the usefulness of the PCR-SSCP technique for β-LG typing. In the present study, we amplified and sequenced the part of promoter region and all the seven exons containing the entire coding and untranslated region for the β-lactoglobulin gene in best dairy goat breeds of India namely: Jamunapari and Jakhrana. Nine polymorphisms were detected, one in the l promoter region, four in the introns and four in the exons of the β-lactoglobulin gene. All polymorphisms were single nucleotide substitutions. The polymorphisms in the coding region did not produce any amino acid change.Key words: β-Lactoglobulin gene, dairy goats, polymorphism, single nucleotide polymorphism (SNP), single strand conformational polymorphism (SSCP)

Online unit clustering in higher dimensions

We revisit the online Unit Clustering and Unit Covering problems in higher dimensions: Given a set of $n$ points in a metric space, that arrive one by one, Unit Clustering asks to partition the points into the minimum number of clusters (subsets) of diameter at most one; while Unit Covering asks to cover all points by the minimum number of balls of unit radius. In this paper, we work in $\mathbb{R}^d$ using the $L_\infty$ norm. We show that the competitive ratio of any online algorithm (deterministic or randomized) for Unit Clustering must depend on the dimension $d$. We also give a randomized online algorithm with competitive ratio $O(d^2)$ for Unit Clustering}of integer points (i.e., points in $\mathbb{Z}^d$, $d\in \mathbb{N}$, under $L_{\infty}$ norm). We show that the competitive ratio of any deterministic online algorithm for Unit Covering is at least $2^d$. This ratio is the best possible, as it can be attained by a simple deterministic algorithm that assigns points to a predefined set of unit cubes. We complement these results with some additional lower bounds for related problems in higher dimensions.Comment: 15 pages, 4 figures. A preliminary version appeared in the Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA 2017

Tribological properties of room temperature fluorinated graphite heat-treated under fluorine atmosphere

This work is concerned with the study of the tribologic properties of room temperature fluorinated graphite heat-treated under fluorine atmosphere. The fluorinated compounds all present good intrinsic friction properties (friction coefficient in the range 0.05–0.09). The tribologic performances are optimized if the materials present remaining graphitic domains (influenced by the presence of intercalated fluorinated species) whereas the perfluorinated compounds, where the fluorocarbon layers are corrugated (armchair configuration of the saturated carbon rings) present higher friction coefficients. Raman analyses reveal that the friction process induces severe changes in the materials structure especially the partial re-building of graphitic domains in the case of perfluorinated compounds which explains the improvement of μ during the friction tests for these last materials

Case Report Restoring esthetics by immediately loaded implant placement

ABSTRAC

Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach

In this paper, we study the $k$-forest problem in the model of resource augmentation. In the $k$-forest problem, given an edge-weighted graph $G(V,E)$, a parameter $k$, and a set of $m$ demand pairs $\subseteq V \times V$, the objective is to construct a minimum-cost subgraph that connects at least $k$ demands. The problem is hard to approximate---the best-known approximation ratio is $O(\min\{\sqrt{n}, \sqrt{k}\})$. Furthermore, $k$-forest is as hard to approximate as the notoriously-hard densest $k$-subgraph problem. While the $k$-forest problem is hard to approximate in the worst-case, we show that with the use of resource augmentation, we can efficiently approximate it up to a constant factor. First, we restate the problem in terms of the number of demands that are {\em not} connected. In particular, the objective of the $k$-forest problem can be viewed as to remove at most $m-k$ demands and find a minimum-cost subgraph that connects the remaining demands. We use this perspective of the problem to explain the performance of our algorithm (in terms of the augmentation) in a more intuitive way. Specifically, we present a polynomial-time algorithm for the $k$-forest problem that, for every $\epsilon>0$, removes at most $m-k$ demands and has cost no more than $O(1/\epsilon^{2})$ times the cost of an optimal algorithm that removes at most $(1-\epsilon)(m-k)$ demands

Asymmetry to symmetry transition of Fano line-shape: Analytical derivation

An analytical derivation of Fano line-shape asymmetry ratio has been presented here for a general case. It is shown that Fano line-shape becomes less asymmetric as \q is increased and finally becomes completely symmetric in the limiting condition of q equal to infinity. Asymmetry ratios of Fano line-shapes have been calculated and are found to be in good consonance with the reported expressions for asymmetry ratio as a function of Fano parameter. Application of this derivation is also mentioned for explanation of asymmetry to symmetry transition of Fano line-shape in quantum confined silicon nanostructures.Comment: 3 figures, Latex files, Theoretica

A Quantum Scattering Interferometer

The collision of two ultra-cold atoms results in a quantum-mechanical superposition of two outcomes: each atom continues without scattering and each atom scatters as a spherically outgoing wave with an s-wave phase shift. The magnitude of the s-wave phase shift depends very sensitively on the interaction between the atoms. Quantum scattering and the underlying phase shifts are vitally important in many areas of contemporary atomic physics, including Bose-Einstein condensates, degenerate Fermi gases, frequency shifts in atomic clocks, and magnetically-tuned Feshbach resonances. Precise measurements of quantum scattering phase shifts have not been possible until now because, in scattering experiments, the number of scattered atoms depends on the s-wave phase shifts as well as the atomic density, which cannot be measured precisely. Here we demonstrate a fundamentally new type of scattering experiment that interferometrically detects the quantum scattering phase shifts of individual atoms. By performing an atomic clock measurement using only the scattered part of each atom, we directly and precisely measure the difference of the s-wave phase shifts for the two clock states in a density independent manner. Our method will give the most direct and precise measurements of ultracold atom-atom interactions and will place stringent limits on the time variations of fundamental constants.Comment: Corrected formatting and typo