Miracle-dz/UniFAR-FTUs huggingface dataset:
Modular structure of sodium-coupled bicarbonate transporters

SUMMARY Mammalian genomes contain 10 SLC4 genes that, between them, encode three Cl–HCO3 exchangers, five Na+-coupled HCO3 transporters (NCBTs), one reported borate transporter, and what is reported to be a fourth Cl–HCO3 exchanger. The NCBTs are expressed throughout the body and play important roles in maintaining intracellular and whole-body pH, as well as contributing to transepithelial transport processes. The importance of NCBTs is underscored by the genetic association of dysfunctional NCBT genes with blindness, deafness, epilepsy, hypertension and metal retardation. Key to understanding the action and regulation of NCBTs is an appreciation of the diversity of NCBT gene products. The transmembrane domains of human NCBT paralogs are 50–84% identical to each other at the amino acid level, and are capable of a diverse range of actions, including electrogenic Na/HCO3 cotransport (i.e. NBCe1 and NBCe2) and electroneutral Na/HCO3 cotransport (i.e. NBCn1 and NBCn2), as well as Na+-dependent Cl–HCO3 exchange (i.e. NDCBE). Furthermore, by the use of alternative promoters and alternative-splicing events, individual SLC4 genes have the potential to generate multiple splice variants (as many as 16 in the case of NBCn1), each of which could have unique temporal and spatial patterns of distribution, unitary transporter activity (i.e. flux mediated by one molecule), array of protein-binding partners, and complement of regulatory stimuli. In the first section of this review, we summarize our present knowledge of the function and distribution of mammalian NCBTs and their multiple variants. In the second section of this review we consider the molecular consequences of NCBT variation.
THE BENEFIT OF MULTIMODAL TELEPRESENCE FOR IN-SPACE ROBOTIC ASSEMBLY

Multimodal telepresence systems are often used for terrestrial applications but they not yet are pract ic lly applied in space. The deployment of robots with vis ual as well as haptic feedback for servicing operations in pace is a valuable addition to the existing autonomous s ystems since it will provide flexibility and robustness in mission operations. The operator on Earth will no longer be a pure observer but will have the capability of real-time interaction with the space environment. For demonstrating the feasibility and showing the benef its of multimodal space applications a test environment is be ng developed, which is based on the SPHERES nano-satel lite testbed at the MIT Space Systems Laboratory.
Image quality monitoring using spread spectrum watermarking

An improved blind image quality assessment scheme that is based on the Watson's just noticeable difference (JND) modulated spread spectrum watermarking, is proposed. For the purpose of quality monitoring, a watermark is embedded into the original image. The image quality is estimated based on the detected watermark at the receiver side. In terms of the peak signal-to-noise ratio (PSNR), the proposed method is shown to be more robust and less perceptible than simple spread spectrum watermarking. This is due to several factors: an optimum detector is used for watermark detection, the watermark is appropriately selected from a set and the detector parameter is adjusted accordingly to closely yield an empirical ideal quality curve. The proposed method was tested by finding the quality estimates of different images compressed with different quality factors. The results indicate that the method can accurately estimate the quality of the received images based on the detected watermark power.
Modulation of functional connectivity using neurofeedback and its effects on behaviour

Conscious perception of the emotional valence of faces has been proposed to involve top-down and bottom-up information processing. Yet, it is still unclear how the cooperation of both processes is implemented and what are the underlying neuronal mechanisms. Using the visual backward masking (ViBM) paradigm, we assessed the participation of the neural networks involved in the conscious perception of the emotional stimuli near the perceptual threshold (NPT) using magnetoencephalography (MEG). Stimulating at the perceptual threshold enabled us to compare consciously perceived emotions with not correctly perceived facial expressions for physically quasi identical stimuli. Twelve healthy participants were asked to detect the emotional valence of a prime face stimulus (either happy or sad) presented for 16 ms. The prime stimulus was followed by a mask after a variable delay, showing a neutral face of the same person as of the prime. To remain at the participants’ perceptual threshold, we used an adaptive method in which the delay in the current trial was decided on the outcome in the previous trial. We identified the networks for the perception of the emotional stimuli and the top-down modulation of stimulus processing using coherence analyses. We hypothesize that the networks activated during the interaction of the top-
“Pretty Strong” Converse for the Quantum Capacity of Degradable Channels

We exhibit a possible road toward a strong converse for the quantum capacity of degradable channels. In particular, we show that all degradable channels obey what we call a “pretty strong” converse: when the code rate increases above the quantum capacity, the fidelity makes a discontinuous jump from 1 to at most 1/√2, asymptotically. A similar result can be shown for the private (classical) capacity. Furthermore, we can show that if the strong converse holds for symmetric channels (which have quantum capacity zero), then degradable channels obey the strong converse. The above-mentioned asymptotic jump of the fidelity at the quantum capacity then decreases from 1 to 0.
Perfomance Improvement with Dedicated Transistor Sizing for MOSFET and FinFET Devices

This work presents a transistor sizing tool to optimize performance taking into account area and power consumption in MOSFET and FinFET devices. The sizing tool is based on Geometric Programming (GP). This tool is modeled to deal with the discrete behavior of FinFET transistor sizing due to the width quantization of these devices. ISCAS'85 benchmark circuits were mapped to a typical standard cell library in 45nm bulk CMOS technology. The size characteristics of this library were adapted to build a predictive 14nm FinFET cell library. Considering transistor sizes generally used in a standard cell library, our transistor sizing improves the delay of MOSFET circuits in 52.5%, on average, keeping almost the same area and power than the sizing provided by the standard-cell library. Good results are achieved considering two simple techniques to adjust continuous to discrete sizing for FinFET circuits: rounding and truncation. These simple sizing strategies produce FinFET circuits 77% faster, on average, keeping the same area and power. Further, results show that the performance can be significantly improved if is considered a Performance Dedicated Cell Library with more cells sizes than the adopted in traditional cell libraries.
Margin perceptron for word sense disambiguation

Word Sense Disambiguation (WSD) is an AI-complete problem where senses of words in the documents must be correctly selected from a senses inventory. Support Vector Machines (SVM) method has been successfully applied to supervised WSD. In contrast, perceptron has not been popular in supervised WSD. In this paper, a supervised method combining Margin Perceptron (MP) and Platt's probabilistic output is proposed to solve the word sense ambiguity problem. Experiments were conducted on Senseval-3 English Lexical Sample Task data set. The performance is comparable with systems using SVMs. Our system is in line with the best system participating in Senseval-3, regarding that we only used given training data, and no classifiers combination technique was applied. The advantage of our method is mainly two-fold: Firstly, good achieved performance shows that MP can be applied to problem with limited training data, especially in natural language processing. Secondly, MP algorithm used in this work is easy to implement, which benefits the application and the extension of the algorithm.
Tutte Polynomials in Square Grids

The Tutte polynomial of a graph G is a two-variable polynomial that re ords mu h information on G. In parti ular, di erent evaluations at integers provide the number of spanning trees, forests (a y li spanning subgraphs), and a y li orientations of G. We estimate these values when G is an n n square grid so as to dedu e re ned upper and lower bounds for the numbers of forests and a y li orientations on su h grids.
RENTAL HARMONY : SPERNER ’ S LEMMA IN FAIR DIVISION

My friend’s dilemma was a practical question that mathematics could answer, both elegantly and constructively. He and his housemates were moving to a house with rooms of various sizes and features, and were having trouble deciding who should get which room and for what part of the total rent. He asked, “Do you think there’s always a way to partition the rent so that each person will prefer a different room? ” As we shall see, with mild assumptions, the answer is yes. This rent-partitioning problem is really a kind of fair-division question. It can be viewed as a generalization of the age-old cake-cutting problem, in which one seeks to divide a cake fairly among several people, and the chore-division problem, posed by Martin Gardner in [6, p. 124], in which one seeks to fairly divide an undesirable entity, such as a list of chores. Lately, there has been much interest in fair division (see, for example, the recent books [3] and [11]), and each of the related problems has been treated before (see [1], [4], [10]). We wish to explain a powerful approach to fair-division questions that unifies these problems and provides new methods for achieving approximate envy-free divisions, in which each person feels she received the “best” share. This approach was carried out by Forest Simmons [13] for cake-cutting and depends on a simple combinatorial result known as Sperner’s lemma. We show that the Sperner’s lemma approach can be adapted to treat chore division and rent-partitioning as well, and it generalizes easily to any number of players. From a pedagogical perspective, this approach provides a nice, elementary demonstration of how ideas from many pure disciplines—combinatorics, topology, and analysis—can combine to address a real-world problem. Better yet, the proofs can be converted into constructive fair-division procedures.
Expression Defined Accuracy

In numerical computations the accuracy of the result quite often depends on a few expressions. In numerical linear algebra, e.g., summations or dot products should very often be computed with additional precision or accuracy. Corresponding algorithms have been developed for a long time and only recently revisited. The usage of these algorithms would be facilitated, if we had a means in a programming language to specify the accuracy requirements of an expression evaluation. In this paper we present a precision aware C+ + template library (PTL)for matrix / vector operations that provides several algorithms with different accuracy or precision characteristics for matrix multiplication and related operations. A matrix is a template parameterized with the number of rows and columns, the element type, a type representing the shape, and an evaluation strategy. Currently only two shapes are implemented, fixed or dynamically adaptable dense arrays. We distinguish between row and column vectors. The access to submatrices and -vectors is accomplished by an overloaded function template. It is possible to adapt the expression system to types declared in other libraries or declared by the user. The concept of expression templates is extended in a way that allows the user to specify rules for the evaluation strategy. The expression tree is constructed by overloading the operators for the expression type. In a second but still compile-time step the evaluation strategy is chosen and the trees are transformed and prepared for run-time execution. The strategy is determined by the tag type of the result, but it can be explicitly set using the index operator. The evaluation strategies can be combined with loop unrolling or loop fusion. Note that the latter not only increases the precision but also the accuracy of the result, since this strategy directly implements the dotprecision expression evaluation in the XSC languages. The library provides evaluation strategies for matrix and vector expressions with k-fold precision and with least bit accuracy. Efficiency and accuracy of the algorithms are tested vs. the Gnu multiple precision library GMP.
Relación entre el bienestar autopercibido, autoestima, inteligencia emocional, personalidad y razonamiento abstracto en un grupo de estudiantes universitarios

Se examino la relacion entre el bienestar autopercibido y las variables inteligencia emocional, personalidad, razonamiento abstracto y autoestima en un grupo de estudiantes de psicologia una universidad particular de Lima metropolitana (n=985). Se probo asimismo un modelo de prediccion del bienestar autopercibido a partir de estas variables. El bienestar autopercibido correlaciono positivamente con algunas medidas de inteligencia emocional (claridad emocional y reparacion emocional), de personalidad (extroversion, afabilidad, tenacidad y apertura a la experiencia) y con la autoestima. La correlacion entre bienestar autopercibido y atencion a las emociones fue negativa. De estas variables las que mejor predijeron el bienestar autopercibido fueron la autoestima, la claridad emocional, la atencion a las emociones y la reparacion emocional.
The Wind of the B[e] Supergiant Hen S22 Viewed through a Reflection Nebula in DEM L 106

Narrow-band HST WFPC2 images reveal a bow-shock-like halo around the HII region N30B toward the B[e] supergiant Hen S22 located within the larger DEM L 106 nebula in the Large Magellanic Cloud. High-dispersion spectra of N30B show a narrow H-alpha emission component from the ionized gas; the velocity variations indicate a gas flow of -5 to -10 km/s in the vicinity of the HII regions, which is resultant from interactions with Hen S22's stellar wind and responsible for the bow-shock morphology. Spectra of N30B's halo show broad H-alpha profiles extending over>1000 km/s, similar to that of Hen S22, indicating that the halo is a reflection nebula of Hen S22. Broad-band morphologies of N30B's halo are also consistent with the reflection nebula interpretation. We use dust-scattering properties and the observed brightnesses of the reflection nebula and Hen S22 to constrain the reflection geometry. The reflected stellar H-alpha emission and absorption vary across the reflection nebula as a result of viewing S22's anisotropic wind across varying angles. This reflection nebula, together with the edge-on orientation of Hen S22's disk, provides an invaluable opportunity to study the disk and polar winds of a B[e] supergiant.
Optical flow based tracking and retexturing of garments

In this paper, we present a method for tracking and retexturing of garments that exploits the entire image information using the optical flow constraint instead of working with distinct features. In a hierarchical framework we refine the motion model with every level. The motion model is used to regularize the optical flow field such that finding the best transformation amounts in minimizing an error function that can be solved in a least squares sense. Knowledge about the position and deformation of the garment in 2D allows us to erase the old texture and replace it by a new one with correct deformation and shading properties without 3D reconstruction. Additionally, it provides an estimation of the irradiance such that the new texture can be illuminated realistically.
A Coding-based Approach to Mitigate TCP Incast in Data Center Networks

As the key infrastructure of cloud computing, data center network provides routing and transport services for cloud applications. To ensure reliable data delivery, TCP has been used in data centers as the de facto transport layer protocol. However, recently researchers found that when a client has a barrier-synchronized requirement and requests data from many servers, the goodput may experience collapse. This phenomenon is well-known as TCP Incast. The main cause of TCP Incast is the scare buffer size in low-end switches as well as the mismatch between RTO and RTT in data centers. So existing solutions focus on either minimizing the effect of TCP's RTO, or preventing flows from aggressively utilizing the switch buffer. Different from the previous approaches, in this paper we employ coding-based UDP to replace TCP as the transport protocol for the many-to-one applications. Specifically, we use LT Codes to ensure reliable data delivery, and adopt TCP Friendly Rate Control (TFRC) to achieve congestion control. The NS based simulation shows that our approach can significantly enhance the application goodput in a typical TCP Incast scenario.
Economic Evaluation of Scale Dependent Technology Investments

We study the effect of financial risk on the economic evaluation of a project with capacity decisions. Capacity decisions have an important effect on the project̂s value through the up‐front investment, the associated operating cost, and constraints on output. However, increased scale also affects the financial risk of the project through its effect on the operating leverage of the investment. Although it has long been recognized in the finance literature that operating leverage affects project risk, this result has not been incorporated in the operations management literature when evaluating projects. We study the decision problem of a firm that must choose project scale. Future cash flow uncertainty is introduced by uncertain future market prices. The firm's capacity decision affects the firm's potential sales, its expected price for output, and its costs. We study the firm's profit maximizing scale decision using the CAPM model for risk adjustment. Our results include that project risk, as measured by the required rate of return, is related to the inverse of the expected profit per unit sold. We also show that project risk is related to the scale choice. In contrast, in traditional discounted cash flow analysis (DCF), a fixed prescribed rate is used to evaluate the project and choose its scale. When a fixed rate is used with DCF, a manager will ignore the effect of scale on risk and choose suboptimal capacity that reduces project value. S/he will also misestimate project value. Use of DCF for choosing scale is studied for two special cases. It is shown that if the manager is directed to use a prescribed discount rate that induces the optimal scale decision, then the manager will greatly undervalue the project. In contrast, if the discount rate is set to the risk of the optimally‐scaled project, the manager will undersize the project by a small amount, and slightly undervalue the project with the economic impact of the error being small. These results underline the importance of understanding the source of financial risk in projects where risk is endogenous to the project design.
Second-order kinetic analysis of IAsys biosensor data: its use and applicability.

The kinetic analysis of IAsys biosensor association data usually relies upon the assumption of constant ligate concentration. In certain circumstances this assumption may no longer be valid. In a similar vein, the analysis of the dissociation phase assumes the concentration of ligate to be negligible in the liquid phase-an assumption that may not be sustainable for high-affinity interactions. In this paper we derive analytical solutions of the second-order differential kinetic equations for the association and dissociation phases, together with a binding isotherm that also allows for changes in concentration of both the ligand and the ligate. Using these equations it is possible to determine the conditions under which the pseudo-first-order assumption ceases to be valid. It is found that the effect of ligate depletion on the association rate constant becomes significant only when binding low ligate concentrations to ligand on surfaces with high binding capacities or high affinities. Similarly, the rebinding in the dissociation phase is dependent upon the affinity and the ligand capacity together with the starting dissociation response compared to the capacity. Finally, depletion also affects the form of the binding isotherm, particularly in situations involving high matrix capacities for ligate and high-affinity interactions.
IDENTIFICATION OF FUNGICOLOUS FUNGI OF IRAN. II. TELEOMORPHS BELONGING TO THE GENUS

Three Hypomyces and one Cladobotryum species are studied and reported as new records and also new anamorph/teleomorph connections of fungicolous fungi for Iran. Anamorphs of two species H. aurantius and H. rosellus (Cladobotryum varium and C. dendroides, respectively) have already been reported from Iran. The anamorph/teleomorph association of H. polyporinus/C. clavisporum was also found and was reported for the first time here. In order to clarify the anamorph/teleomorph associations in all cases a single-ascospore culture was obtained on PDA and MEA and the resulting anamorph was identified.
Equipping Immigrants: Migration Flows and Capital Movements

Both policy makers and researchers have devoted considerable attention in recent years to the large current account and capital account imbalances among OECD countries. In particular, the size of the United States current account deficit has attracted intense attention and spawned numerous explanations. There are undoubtedly many reasons for this deficit, including government fiscal policy imbalances, but one explanation that has not previously received much attention is that current account deficits and the matching capital inflows are responses to international flows of labor. Migrants must be equipped with machines, and the resulting demands for capital are likely, all else being equal, to generate cross-border flows of capital. This paper explores the extent to which migration-related capital flows can explain the movements and magnitudes of current and capital account imbalances in OECD countries.
An adaptive path restoration algorithm based on power series routing for all-optical networks

In this paper we present a novel path restoration algorithm, named PSR-R. Our proposal is based on the power series routing (PSR) algorithm, which was proposed by Chaves et al. in 2011 for routing. The cost function for each link is given by a function expanded in a power series, considering as input variables the wavelength availability and the link length. The coefficients of the expanded function are determined by a global optimizer, which tries to minimize the rate of unsuccessful failure recovery (RUFR). We assessed our proposal by performing simulations of single link failures in a well-known network topology. The analytical model used to evaluate physical layer takes into account the following impairments: gain saturation, ASE noise depletion in the optical amplifiers, crosstalk in the optical switches, and polarization mode dispersion and residual chromatic dispersion in optical fibers. We compared our proposal with other approaches in different scenarios as a function of the network load. Our proposal outperformed all other approaches in terms of RUFR.