Miracle-dz/UniFAR-FTUs huggingface dataset:
Parallel information and computation with restitution for noise-tolerant nanoscale logic networks

Nanoelectronic devices are anticipated to become exceedingly noisy as they are scaled towards thermodynamic limits. Hence the development of nanoscale classical information systems will require optimal schemes for reliable information processing in the presence of noise. We present a novel, highly noise-tolerant computer architecture based on the work of von Neumann that may enable the construction of reliable nanocomputers comprised of noisy gates. The fundamental principles of this technique of parallel restitution are parallel processing by redundant logic gates, parallelism in the interconnects between gate resources and intermittent signal restitution performed in parallel. The results of our mathematical model, verified by Monte Carlo simulations, show that nanoprocessors consisting of gates incorporating this technique can be made 90% reliable over 10 years of continuous operation with a gate error probability per actuation of and a redundancy of . This compares very favourably with corresponding results utilizing modular redundant architectures of with , and with no noise tolerance. Arbitrary reliability is possible within a noise limit of , with massive redundancy. We show parallel restitution to be a general paradigm applicable to different kinds of information processing, including neural communication. Significantly, we show how our treatment of para-restituted computation as a statistical ensemble coupled to a heat bath allows consideration of the computation entropy of logic gates, and tentatively sketch a thermodynamic theory of noisy computation that might set fundamental physical limits on scaling classical computation to the nanoscale. Our preliminary work indicates that classical computation may be confined to the macroscale by noise, quantum computation possibly being the only information processing possible at the extreme nanoscale.
Ja n 20 05 Capacity Theorems for Quantum Multiple Access Channels Part I : Classical-Quantum and Quantum-Quantum Capacity Regions

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is possible for one sender to send classical information, while the other sends quantum information. The second region gives the rates at which each sender can send quantum information. We give an example of a channel with a single-letter classical-quantum region. We conclude with connections to other work and a conjecture on a generalization where each user simultaneously sends classical and quantum information.
An Investigation on Cutting Tool Temperatures in Composite Machining Assisted With Heat-Pipe Cooling

Metal matrix composites (MMC) are difficult to cut materials, and yet only diamond tools have been successfully utilized for such machining applications. Wear of diamond-coated tools is characterized by catastrophic coating failure (peeling off) due to the adhered work materials at the flank wear-land surface and the high stress developed at the coating-substrate interface, associated with high temperatures, because of very different thermal expansion coefficients. Temperature reductions, therefore, may delay the onset of the coating failure and offer tool life extension. A passive heat-dissipation device, heat-pipe, has been tested for cutting temperature reductions in MMC machining. Though it is intuitive that heat pipes may enhance heat transfer and plausibly reduce the tool temperatures, heat pipes may also increase heat partitioning into the tool, and complicate its effects on the heat removal and temperature reduction efficiency. This paper reports aluminum composite machining by diamond-coated tools and investigates the heat-pipe effects on tool temperature reductions. Numerical simulation of heat conduction in the cutting tool system was performed to evaluate cutting tool temperatures without and with a heat-pipe. A 3-D thermal model of the cutting tool system including coating, insert substrate, and tool holder was established. The heat source was characterized as a heat flux, a portion of the frictional heat flux at the rake face, over the chip-tool contact area. To determine the heat-partition coefficient, a separate 2-D chip model was established with a heat flux, balanced the total rake-face heat flux, over the contact and moving with the chip speed. With the tool and chip thermal models and by matching the average temperature at the tool-chip contact of the two models, the heat partition coefficient can be numerically determined. The model has been used to evaluate how the heat-pipe modifies the cutting tool temperatures. Applying heat-pipe cooling inevitably increases the heat partition into the tool despite the enhanced heat dissipation. However, the heat pipe still effectively reduces the tool-chip contact temperatures, depending upon machining conditions. Cutting tool temperatures have also been measured in machining using thermocouples. The simulation results reasonably agree with the experimental measurements. © 2005 ASME
Resources Allocation and Performance Analysis in S-UMTS Network

In wireless systems, the radio resources are precious, and available bandwidth is shared between users in a given radio cell. Our objective is to define a resource allocation schemes, to permit an efficient sharing of uplink bandwith between different supported traffic categories. So call admission control procedure can be defined. In this work analytical Markov model was proposed, in order to define a resources allocation scheme for voice and data traffic integration in heterogeneous satellite- UMTS network (S-UMTS).
Observation of histone nuclear import in living cells: implications in the processing of newly synthesised H3.1 & H4

Highlights - Small-molecule-gated tether-and-release system for rapid pulse-chase of nuclear proteins - Tracking nuclear import of histone H3.1 and H4 and their incorporation at sites of active replication - Tethered H3.1 and H4 are monomeric and do not associate with ASF1, NASP, RbAp46 or HAT1 in the cytosol - Importin-β proteins as cytosolic binders of monomeric histones Summary We present here a cytosolic tether-and-release system to study the import and dynamics of newly synthesised nuclear proteins. Release is gated by rapamycin-induced recruitment and activation of a viral protease, with cleavage of a peptide linker releasing the tethered cargo. We use this system to investigate nucleo-cytoplasmic divisions in the histone H3.1 & H4 deposition pathway, revealing that, contrary to previous analyses, H3.1 and H4 are predominantly monomeric in the cytosol, and only associate with the core histone chaperoning machinery after translocation to the nucleus. Whilst we do not detect interaction with known H3-H4 chaperones in the cytosol we do detect interaction with a number of importin-β proteins, that may serve a dual import and chaperoning function, preventing aggregation of histones until they are handed-off to the core histone chaperoning machinery in the nucleus.
A Joint Blind Channel Order Estimation Algorithm

A joint order estimation criterion by combination extreme eigenvalue cost function (deduced from subspace identification) and least squares equalization is proposed, this new criterion ensures the global minimum at the correct and/or effective channel order in noiseless case. For low or moderate SNRs, the joint order estimation algorithm is able to work with short samples and ill-conditioned channels. Simulation results also demonstrate the superiority of this algorithm over other existing methods.
Vitamin B6 Group. XV. Urinary Excretion of Pyridoxal, Pyridoxamine, Pyridoxine, and 4-Pyridoxic Acid in Human Subjects.*

Summary The known metabolic products of vitamin B6—pyridoxal, pyridoxamine, pyridoxine and pyridoxic acid—were measured in normal human urine and in the urine of human subjects each fed one of the 3 forms of the vitamin. The chief product found, regardless of the form fed, was pyridoxic acid. Pyridoxal gave rise to significantly higher amounts of this product than did pyridoxine or pyridoxamine. No evidence could be obtained showing the conversion of pyridoxal or pyridoxamine to pyridoxine. When pyridoxal or pyridoxine was fed, the chief form in which the vitamin oc- curred in the urine was the form fed. However, when pyridoxamine was fed both pyridoxal and pyridoxamine were excreted in approximately equal amounts. Ingestion of pyridoxine also greatly increased the amount of pyridoxal and pyridoxamine excreted. The excretion of all products was very rapid. The largest amounts of each of the compounds were found in samples collected 2 and 5 hours after ingestion of the dose. The levels of pyridoxic acid returned to normal values after 12 hours, while the vitamin levels had returned to normal within 8 hours. The amount of the dose recovered varied with the form fed. The highest recovery, 70%, was obtained when pyridoxal was fed; 45% of the pyridoxine was recovered, while only 31% of the pyridoxamine could be recovered. Together with published data which indicate that complete absorption of large doses of vitamin B6 occurs, these findings suggest that a large proportion of the vitamin B6 was converted to products still unknown.
Generalized Head Models for MEG / EEG : BEM beyond Nested Volumes

Accurate geometrical models of the head are necessary for solving the forward and inverse problems of magnetoand electro-encephalography (MEG/EEG). Boundary element methods (BEM) require a geometrical model describing the interfaces between different tissue types. Classically, head models with a nested volume topology have been used. In this manuscript, we demonstrate how this constraint can be relaxed, allowing to model more realistic head topologies. We describe the symmetric BEM for this new model. The symmetric BEM formulation uses both potentials and currents on the interfaces as unknowns and is in general more accurate than the alternative double-layer formulation. PACS numbers: 41.20. Cv Submitted to: Physics in Medicine and Biology
Four outbreaks of nosocomial systemic candidiasis

SUMMARY Candida albicans has recently been described as a cause of nosocomial infection. This paper reports four further outbreaks occurring over a 12-month period in England. There were 13 systemic cases and 6 deaths. The outbreaks were defined by morphotyping andthe new technique of immunoblot fingerprinting. Controi of the outbreaks was produced bythe implementation of strict cross-infection control policies without recourse to systemic chemoprophylaxis.
Robust Gram Embeddings

Word embedding models learn vectorial word representations that can be used in a variety of NLP applications. When training data is scarce, these models risk losing their generalization abilities due to the complexity of the models and the overﬁtting to ﬁnite data. We propose a regularized embedding formulation, called Robust Gram (RG), which pe-nalizes overﬁtting by suppressing the disparity between target and context embeddings. Our experimental analysis shows that the RG model trained on small datasets generalizes better compared to alternatives, is more robust to variations in the training set, and correlates well to human similarities in a set of word similarity tasks.
Nanoindentation in materials research: Past, present, and future

The method we introduced in 1992 for measuring hardness and elastic modulus by nanoindentation testing has been widely adopted and used in the characterization of mechanical behavior at small scales. Since its original development, the method has undergone numerous refinements and changes brought about by improvements to testing equipment and techniques, as well as advances in our understanding of the mechanics of elastic-plastic contact. In this article, we briefly review the history of the method, comment on its capabilities and limitations, and discuss some of the emerging areas in materials research where it has played, or promises to play, an important role.
Rotational Rectification Network: Enabling Pedestrian Detection for Mobile Vision

Across most pedestrian detection datasets, it is typically assumed that pedestrians will be standing upright with respect to the image coordinate system. This assumption is not always valid for many vision-equipped mobile platforms, such as mobile phones, UAVs, or construction vehicles on rugged terrain. In these situations, the motion of the camera can cause images of pedestrians to be captured at extreme angles. This can lead to inferior pedestrian detection performance when using standard pedestrian detectors. To address this issue, we propose a Rotational Rectification Network (R2N) that can be inserted into any CNNbased pedestrian (or object) detector to adapt it to significant changes in camera rotation. The rotational rectification network uses a 2D rotation estimation module that passes rotational information to a spatial transformer network [12] to undistort image features. To enable robust rotation estimation, we propose a Global Polar Pooling (GPPooling) operator to capture rotational shifts in convolutional features. Through our experiments, we show how our rotational rectification network can be used to improve the performance of state-of-the-art pedestrian detectors under heavy image rotation by up to 45%.
The Iron Transporter Fth1p Forms a Complex with the Fet5 Iron Oxidase and Resides on the Vacuolar Membrane*

Iron transport across the plasma membrane appears to be a unidirectional process whereby iron uptake is essentially irreversible. One of the major sequestration sites for iron is the vacuole that stores a variety of metals, either as a mechanism to detoxify the cell or as a reservoir of metal to enable the cell to grow when challenged by a low iron environment. Exactly how the vacuole contributes to the overall iron metabolism of the cell is unclear because mutations that affect vacuolar function also perturb the assembly of the plasma membrane high affinity transport system composed of a copper-containing iron oxidase, Fet3p, and an Fe3+-specific iron transporter, Ftr1p. Here, we characterize the iron transporter homologue Fth1p, which is similar to the high affinity plasma membrane iron transporter Ftr1p. We found that Fth1p was localized to the vacuolar surface and, like other proteins that function on the vacuole, did not undergo Pep4-dependent degradation. Co-immunoprecipitation experiments showed that Fth1p also associates with the Fet3p oxidase homologue, Fet5p; and disruption of the FET5 gene results in the accumulation of Fth1p in the endoplasmic reticulum. We also found that loss of this protein complex leads to elevated transcriptional activity of the FET3 gene and compromises the ability of the cell to switch from fermentative metabolism to respiratory metabolism. Because the Fet5 protein is oriented such that the oxidase domain of Fet5p is lumenal, this complex may be responsible for mobilizing intravacuolar stores of iron.
Faster and Simpler Sketches of Valuation Functions

We present fast algorithms for sketching valuation functions. Let N (|N| = n) be some ground set and v:2N→ R be a function. We say that v˜:2N→ R is an α-sketch of v if for every set S we have that v(S)/α ≤ v˜(S) ≤ v(S) and v˜ can be described in poly(n) bits. Goemans et al. [SODA’09] showed that if v is submodular then there exists an õ(√n)-sketch that can be constructed using polynomially many value queries (this is essentially the best possible, as Balcan and Harvey [STOC’11] show that no submodular function admits an n1/3 - ε-sketch). Based on their work, Balcan et al. [COLT’12] and Badanidiyuru et al. [SODA’12] show that if v is subadditive, then there exists an õ(√n)-sketch that can be constructed using polynomially many demand queries. All previous sketches are based on complicated geometric constructions. The first step in their constructions is proving the existence of a good sketch by finding an ellipsoid that “approximates” v well (this is done by applying John’s theorem to ensure the existence of an ellipsoid that is “close” to the polymatroid that is associated with v). The second step is to show that this ellipsoid can be found efficiently, and this is done by repeatedly solving a certain convex program to obtain better approximations of John’s ellipsoid. In this article, we give a significantly simpler, nongeometric proof for the existence of good sketches and utilize the proof to obtain much faster algorithms that match the previously obtained approximation bounds. Specifically, we provide an algorithm that finds õ(√n)-sketch of a submodular function with only õ(n3/2 value queries, and we provide an algorithm that finds õ(√n)-sketch of a subadditive function with O(n) demand and value queries.
New Insights into 1-Aminocyclopropane-1-Carboxylate (ACC) Deaminase Phylogeny, Evolution and Ecological Significance

The main objective of this work is the study of the phylogeny, evolution and ecological importance of the enzyme 1-aminocyclopropane-1-carboxylate (ACC) deaminase, the activity of which represents one of the most important and studied mechanisms used by plant growth–promoting microorganisms. The ACC deaminase gene and its regulatory elements presence in completely sequenced organisms was verified by multiple searches in diverse databases, and based on the data obtained a comprehensive analysis was conducted. Strain habitat, origin and ACC deaminase activity were taken into account when analyzing the results. In order to unveil ACC deaminase origin, evolution and relationships with other closely related pyridoxal phosphate (PLP) dependent enzymes a phylogenetic analysis was also performed. The data obtained show that ACC deaminase is mostly prevalent in some Bacteria, Fungi and members of Stramenopiles. Contrary to previous reports, we show that ACC deaminase genes are predominantly vertically inherited in various bacterial and fungal classes. Still, results suggest a considerable degree of horizontal gene transfer events, including interkingdom transfer events. A model for ACC deaminase origin and evolution is also proposed. This study also confirms the previous reports suggesting that the Lrp-like regulatory protein AcdR is a common mechanism regulating ACC deaminase expression in Proteobacteria, however, we also show that other regulatory mechanisms may be present in some Proteobacteria and other bacterial phyla. In this study we provide a more complete view of the role for ACC deaminase than was previously available. The results show that ACC deaminase may not only be related to plant growth promotion abilities, but may also play multiple roles in microorganism's developmental processes. Hence, exploring the origin and functioning of this enzyme may be the key in a variety of important agricultural and biotechnological applications.
Multiple-source multiple-sink maximum flow in planar graphs

In this paper we show an O(n^(3/2) log^2 n) time algorithm for finding a maximum flow in a planar graph with multiple sources and multiple sinks. This is the fastest algorithm whose running time depends only on the number of vertices in the graph. For general (non-planar) graphs the multiple-source multiple-sink version of the maximum flow problem is as difficult as the standard single-source single-sink version. However, the standard reduction does not preserve the planarity of the graph, and it is not known how to generalize existing maximum flow algorithms for planar graphs to the multiple-source multiple-sink maximum flow problem.
Comparison of the effects of glycerol, dimethyl sulfoxide, and hydroxyethyl starch solutions for cryopreservation of avian red blood cells.

OBJECTIVE To compare effectiveness of glycerol, dimethyl sulfoxide (DMSO), and hydroxyethyl starch (HES) solutions for cryopreservation of avian RBCs. SAMPLE RBCs from 12 healthy Ameraucana hens (Gallus gallus domesticus). PROCEDURES RBCs were stored in 20% (wt/vol) glycerol, 10% (wt/vol) DMSO freezing medium, or various concentrations of HES solution (7.5%, 11.5%, and 20% [wt/vol]) and frozen for 2 months in liquid nitrogen. Cells were then thawed and evaluated by use of cell recovery and saline stability tests, cell staining (7-aminoactinomycin D and annexin V) and flow cytometry, and scanning electron microscopy. RESULTS Percentage of RBCs recovered was highest for 20% glycerol solution (mean ± SE, 99.71 ± 0.04%) and did not differ significantly from the value for 7.5% HES solution (99.57 ± 0.04%). Mean saline stability of RBCs was highest for 10% DMSO (96.11 ± 0.25%) and did not differ significantly from the value for 20% HES solution (95.74 ± 0.25%). Percentages of cells with 7-aminoactinomycin D staining but without annexin V staining (indicating necrosis or late apoptosis) were lowest for 10% DMSO freezing medium (3%) and 20% glycerol solution (1%) and highest for all HES concentrations (60% to 80%). Scanning electron microscopy revealed severe membrane changes in RBCs cryopreserved in 20% HES solution, compared with membrane appearance in freshly harvested RBCs and RBCs cryopreserved in 10% DMSO freezing medium. CONCLUSIONS AND CLINICAL RELEVANCE Cryopreservation of avian RBCs with HES solution, regardless of HES concentration, resulted in greater degrees of apoptosis and cell death than did cryopreservation with other media. Transfusion with RBCs cryopreserved in HES solution may result in posttransfusion hemolysis in birds.
Bottom-up motion and task coordination for loosely-coupled multi-agent systems with dependent local tasks

We propose a bottom-up motion and task coordination scheme for loosely-coupled multi-agent systems under dependent local tasks. Instead of defining a global task for the whole team, each agent is assigned locally a task as syntactically co-safe linear temporal logic formulas that specify both motion and action requirements. Inter-agent dependency is introduced by collaborative actions of which the execution requires multiple agents' collaboration. The proposed solution contains an offline initial plan synthesis, an on-line request-reply messages exchange and a real-time plan adaptation algorithm. It is distributed in that any decision is made locally based on local computation and local communication within neighboring agents. It is scalable and resilient to agent failures as the dependency is formed and removed dynamically based on the plan execution status and agent capabilities, instead of pre-assigned agent identities. The overall scheme is demonstrated by a simulated scenario.
Float greedy-search-based subspace clustering

Many kinds of efficient greedy subspace clustering methods have been proposed to cut down the computation time in clustering large-scale multimedia datasets. However, these methods are easy to fall into local optimum due to the inherent characteristic of greedy algorithms, which are step-optimal only. To alleviate this problem, this paper proposes a novel greedy subspace clustering strategy based on floating search, called Float Greedy Subspace Clustering (FloatGSC). In order to control the complexity, the nearest subspace neighbor is added in a greedy way, and the subspace is updated by adding an orthogonal basis involved with the newly added data points in each iteration. Besides, a backtracking mechanism is introduced after each iteration to reject wrong neighbors selected in previous iterations. Extensive experiments on motion segmentation and face clustering show that our algorithm can significantly improve the clustering accuracy without sacrificing much computational time, compared with previous greedy subspace clustering methods.