Miracle-dz/UniFAR-FTUs huggingface dataset:
Why still in hospital after fast-track hip and knee arthroplasty?

Background and purpose Length of stay (LOS) following total hip and knee arthroplasty (THA and TKA) has been reduced to about 3 days in fast-track setups with functional discharge criteria. Earlier studies have identified patient characteristics predicting LOS, but little is known about specific reasons for being hospitalized following fast-track THA and TKA. Patients and methods To determine clinical and logistical factors that keep patients in hospital for the first postoperative 24–72 hours, we performed a cohort study of consecutive, unselected patients undergoing unilateral primary THA (n = 98) or TKA (n = 109). Median length of stay was 2 days. Patients were operated with spinal anesthesia and received multimodal analgesia with paracetamol, a COX-2 inhibitor, and gabapentin—with opioid only on request. Fulfillment of functional discharge criteria was assessed twice daily and specified reasons for not allowing discharge were registered. Results Pain, dizziness, and general weakness were the main clinical reasons for being hospitalized at 24 and 48 hours postoperatively while nausea, vomiting, confusion, and sedation delayed discharge to a minimal extent. Waiting for blood transfusion (when needed), for start of physiotherapy, and for postoperative radiographic examination delayed discharge in one fifth of the patients. Interpretation Future efforts to enhance recovery and reduce length of stay after THA and TKA should focus on analgesia, prevention of orthostatism, and rapid recovery of muscle function.
A reduced model of permanent magnet synchronous generators for wind energy conversion systems

This paper presents a reduced model for permanent magnet synchronous generators operating in variable-speed wind energy conversion systems (WECS). The generator supplies power to a diode rectifier bridge with constant-voltage load. The proposed model has the main advantage of low complexity, thus making it ideal to include in complex systems, such as microgrids. The model was validated on a 2kW laboratory prototype.
An overview of empirical natural language processing . ( Natural Language Processing )

In recent years, there has been a resurgence in research on empirical methods in natural language processing. These methods employ learning techniques to automatically extract linguistic knowledge from natural language corpora rather than require the system developer to manually encode the requisite knowledge. The current special issue reviews recent research in empirical methods in speech recognition, syntactic parsing, semantic processing, information extraction, and machine translation. This article presents an introduction to the series of specialized articles on these topics and attempts to describe and explain the growing interest in using learning methods to aid the development of natural language processing systems.
Insights from the supplementary motor area syndrome in balancing movement initiation and inhibition

The supplementary motor area (SMA) syndrome is a characteristic neurosurgical syndrome that can occur after unilateral resection of the SMA. Clinical symptoms may vary from none to a global akinesia, predominantly on the contralateral side, with preserved muscle strength and mutism. A remarkable feature is that these symptoms completely resolve within weeks to months, leaving only a disturbance in alternating bimanual movements. In this review we give an overview of the old and new insights from the SMA syndrome and extrapolate these findings to seemingly unrelated diseases and symptoms such as Parkinson’s disease (PD) and tics. Furthermore, we integrate findings from lesion, stimulation and functional imaging studies to provide insight in the motor function of the SMA.
Puffing Frequency and Soot Extinction Correlation in JP-8 and Heptane Pool Fires

A new approach for characterizing puffing frequency was established by performing total extinction measurements on pool fires of JP-8 (Jet Propulsion Fuel 8) and heptane using a multiple beam extinction experiment. A maximum entropy method (MEM) was applied to extract a characteristic extinction frequency that was found to correlate well with puffing frequency. The measured extinction frequency for both flames was found to have some variation with height, though this is small. The amplitude of the frequency of the measured oscillations was found to be higher for JP-8 than for heptane, and became constant one diameter above the fuel pan for both flames. The variance of total extinction in the JP-8 and heptane pool fires was approximately 20% and 17%, respectively. Correlation statistics between the various extinguished beams reveal an increase in axi-symmetry of the instantaneous oscillations with height above the pool.
Understanding Visual Concepts with Continuation Learning

We introduce a neural network architecture and a learning algorithm to produce factorized symbolic representations. We propose to learn these concepts by observing consecutive frames, letting all the components of the hidden representation except a small discrete set (gating units) be predicted from the previous frame, and let the factors of variation in the next frame be represented entirely by these discrete gated units (corresponding to symbolic representations). We demonstrate the efficacy of our approach on datasets of faces undergoing 3D transformations and Atari 2600 games.
Joint MMSE precoding design in multi-hop bi-directional MIMO relay systems

This paper investigates the problem of joint design of relay precoders and receivers based on the minimum mean-square-error (MMSE) criterion in multi-hop bi-directional multiple-input multiple-output (MIMO) amplify-and-forward (AF) relay systems. In contrast to the conventional research on two-way relay systems, we combine a multi-hop relay system with a bi-directional relay system which further enhances the system performance. By decoupling the original highly non-convex problem into three sub-problems, we propose an iterative algorithm to alternatively optimize relay precoders and receivers. Numerical simulation results show that the proposed iterative algorithm outperforms other algorithms in terms of bit-error-rate (BER).
External Memory based Distributed Generation of Massive Scale Social Networks on Small Clusters

Small distributed systems are limited by their main memory to generate massively large graphs. Trivial extension to current graph generators to utilize external memory leads to large amount of random I/O hence do not scale with size. In this work we offer a technique to generate massive scale graphs on small cluster of compute nodes with limited main memory. We develop several distributed and external memory algorithms, primarily, shuffle, relabel, redistribute, and, compressed-sparse-row (csr) convert. The algorithms are implemented in MPI/pthread model to help parallelize the operations across multicores within each core. Using our scheme it is feasible to generate a graph of size $2^{38}$ nodes (scale 38) using only 64 compute nodes. This can be compared with the current scheme would require at least 8192 compute node, assuming 64GB of main memory. Our work has broader implications for external memory graph libraries such as STXXL and graph processing on SSD-based supercomputers such as Dash and Gordon [1][2].
Analysis of inheritance anomaly in object-oriented concurrent programming languages

It has been pointed out that inheritance and synchronization constraints in concurrent object systems often con ict with each other, resulting in inheritance anomaly where re-de nitions of inherited methods are necessary in order to maintain the integrity of concurrent objects. The anomaly is serious, as it could nullify the bene ts of inheritance altogether. Several proposals have been made for resolving the anomaly; however, we argue that those proposals su er from the incompleteness which allows room for counterexamples. We give an overview and the analysis of inheritance anomaly, and review several proposals for minimizing the unwanted e ect of this phenomenon. In particular, we propose (partial) solutions using (1) computational re ection, and (2) transactions in OOCP languages.
Near Real-Time Stereo With Adaptive Support Weight Approaches

Algorithms based on the adaptive support weight strategy currently represent the state-of-the-art in local ster eo matching. Unfortunately, their good-quality results come at the price of high computation times: As opposed to standard local algorithms, incremental computation via slidin g windows is not applicable for adaptive support weight windows. This paper presents a method for considerably speeding up computation times of these methods. The key idea is to exploit the adaptive support weight windows for generating an explicit over-segmentation of the reference image in a fast way. Having this explicit segmentation, we can take advantage of a modified “segmentation-based” sliding window technique, which makes run time independent of the window size. In particular, we demonstrate our transformation scheme for the geodesic stereo matcher of [11] that has recently produced excellent results. Our unoptimized GPU-based implementation processes 320 × 240 pixel images with 26 allowed disparities at 10 frames per second and achieves rank 32 out of 74 methods in the Middlebury online benchmark.
Valuation of Risky Debt: A Multi-Period Bayesian Model

The paper describes a model of a new type for valuation of risky bonds and loans that we call a Bayesian Multi-Period (BMP) model. BMP is neither a structural model nor a reduced form and not a Merton-type model at all. BMP proceeds from the concept of a risky bond (loan) value as the Net Present Value (NPV) of a cash flow generated by a bond. For a defaultable bond NPV is random value, and BMP identifies the “fair” price of a risky bond as its mean NPV. BMP supposes that a borrower (e.g. a firm) generally has several debt issues (bonds, loans) simultaneously - with different terms of issuance (interest rates, maturity horizons, payment schedules etc.) and calculates risk characteristics for each debt issue separately. It considers the exact contractual cash flow schedule of each specific debt issue and combines it with probabilities of a borrower’s default at all stages of the cash flow process. Default prognosis in turn accounts for the joint influence of all outstanding debts of a firm. BMP uses multi-period default prognosis of Bayesian type based on indices of a borrower’s current financial position accounting for the predictive abilities of the repayment schedule of a firm’s long-term debt. This type of prognosis can additionally incorporate other predictive variables like the familiar market factor - “distance to default”. BMP calculates “fair” interest rates for newly issued risky corporate bonds, “fair” prices and “fair” yield to maturity for risky bonds at intermediate moments of a bond’s life. We compare them with observed market prices, rates and spreads. The model explains on average about 70% of observed interest rates, credit spreads and market prices of a bond. This is much more than is usually explained by Merton-type models. The paper discusses the relation between multi-period default probabilities and credit ratings.
A Majority-Based Reliability-Aware Task-Mapping in High-Performance Homogenous NoC Architectures

This paper presents a new reliability-aware task mapping approach in a many-core platform at design time for applications with DAG-based task graphs. The main goal of this approach is to devise a task mapping scenario which meets the predefined reliability threshold ensuring minimum performance degradation. The proposed approach uses majority-voting replication technique to fulfill error-masking capability. A quantitative reliability model is also proposed for the platform. Our platform is a homogenous many-core architecture with mesh-based interconnection using traditional deterministic XY routing algorithm. The novel 3-step iterative approach is applicable to an unlimited number of fault types. All parts of the platform including cores, links and routers are assumed to be prone to failures. We used the MNLP optimization technique to find the optimal mapping of presented task graph. Experimental results show that our suggested task mapping approach not only comply with the predefined reliability threshold but also notable time complexity reduction is achieved with respect to exhaustive space exploration.
UVBY-BETA PHOTOMETRY OF HIGH-VELOCITY AND METAL-POOR STARS.IX. EFFECTS OFORBITAL CHAOS IN THE GALACTIC HALO

Galactic orbits have been integrated using the Galactic potential model of Allen & Santillán (1991) for 280 halo stars identified in the Vrot, [Fe/H] diagram. The effects of chaos upon their orbital structure have been investigated. A “vertical” surface of section is defined, whereZ is plotted versus z each time the orbit crosses the cylinder ω̃ = 8.5 kpc; this surface of section allows a more complete visualization of the Galactic orbits in phase space, a better understanding of the orbital chaos, and a more direct comparison with observations. “Horizontal” surfaces of section and meridional orbits have also been plotted for all of these halo stars, and have been used to classify the Galactic orbits into the categories box, chaotic, and resonant; 44.3% of the halo orbits are found to show some evidence of chaos. The observed |W ′| velocities of the halo stars give poor measures of zmax for the box orbits, and especially for the chaotic orbits. Regressions of [Fe/H] against Rmax and zmax, for the total sample and for the chaotic and non-chaotic subsets, show little evidence for a metallicity gradient in the Galactic halo. The surfaces of section for many of the halo stars (∼ a third) show some evidence of structure within chaos. Part of this structure is due to the “stickiness” that chaotic orbits experience near the outer KAM tori of families of periodic and quasiperiodic orbits. This “stickiness” has been discussed extensively in the literature. The phase-space clumpiness produced by this “stickiness” may help to explain the “moving groups” found in the solar vicinity and the non-Gaussian velocity distributions observed at the Galactic poles. Also, the “confinement” of the chaotic orbits by a 1:1 resonant family of tube orbits, which passes a few kpc above the Sun, may explain part of the halo duality which has been detected in several studies, such as those of Hartwick (1987) and of Kinman et al. (1994). Send offprint requests to: W.J. Schuster. P.O. Box 439027, San Diego, CA, 92143-9027, USA ? Based on observations collected at the Observatorio Astronómico Nacional at San Pedro Mártir, Baja California, México, and at the Danish telescopes, La Silla, Chile. Histograms of the observed |W ′| velocity and of the calculated orbital parameter zmax have been plotted for the 280 halo stars. Structure is seen in both histograms, due mainly to the chaotic orbits; the |W ′| histogram is non-Gaussian with two peaks, and the zmax histogram has three peaks. Remarkably the structure in these two histograms is correlated and can be explained in relation to the details of the surfaces of section and the “confinement” and “stickiness” phenomena of the chaotic orbits.
Transcription factors in the maintenance and survival of primordial follicles

Primordial follicles are formed prenatally in mammalian ovaries, and at birth they are fated to be activated to primary follicles, to be dormant, or to die. During the early stage of folliclulogenesis, the oocyte undergoes dynamic alterations in expression of numerous genes, which are regulated by transcription factors. Several germ-cell specific transcriptional regulators are critical for formation and maintenance of follicles. These transcriptional regulators include: Figla, Lhx8, Nobox, Sohlh1, and Sohlh2. A subset of these transcriptional regulators is mutated in women with ovarian insufficiency and infertility. Establishment of this oocyte pool is essential for fertility. This review focuses on these transcriptional regulators of female primordial follicles.
Retrieval of Images Using Mean-Shift and Gaussian Mixtures Based on Weighted Color Histograms

The topic of this paper is Content-Based Image Retrieval (CBIR) based on colors as a content image descriptor. The tool we developed to that purpose modelizes the colors of an image as a set of 2D Gaussian distributions based on weighted color histograms. Then, given a reference image proposed by a user, the system can automatically classify the image and provide the user with the most similar images to the reference image in its category. Experiments with Corel-1000 dataset demonstrate that our method outperforms the known implementations.
CD8+ T-Cell Responses before and after Structured Treatment Interruption in Ugandan Adults Who Initiated ART with CD4+ T Cells <200 Cell/μL: The DART Trial STI Substudy

Objective. To better understand attributes of ART-associated HIV-induced T-cell responses that might be therapeutically harnessed. Methods. CD8+ T-cell responses were evaluated in some HIV-1 chronically infected participants of the fixed duration STI substudy of the DART trial. Magnitudes, breadths, and functionality of IFN-γ and Perforin responses were compared in STI (n = 42) and continuous treatment (CT) (n = 46) before and after a single STI cycle when the DART STI trial was stopped early due to inferior clinical outcome in STI participants. Results. STI and CT had comparable magnitudes and breadths of monofunctional CD8+IFNγ + and CD8+Perforin+ responses. However, STI was associated with significant decline in breadth of bi-functional (CD8+IFNγ +Perforin+) responses; P = . 02, Mann-Whitney test. Conclusions. STI in individuals initiated onto ART at <200 CD4+ T-cell counts/μl significantly reduced occurrence of bifunctional CD8+IFNγ +/Perforin+ responses. These data add to others that found no evidence to support STI as a strategy to improve HIV-specific immunity during ART.
Object Size Discrimination and Non-visual Cartographic Symbolization

Guidelines for cartographic symbolization, developed over several hundred years, have focused almost exclusively on visual design elements for maps. Recent attention on the personal computer and the Internet as a means for map display and map dissemination has resulted in more discussion about symbolization guidelines, particularly in settings where the scale of map display is dynamic and where extra information is added to maps with auditory and haptic interface devices. The additional information presented in the auditory and haptic sensory domains is usually intended as an augmentation for a standard visual map. Maps produced for the blind and visually impaired, in contrast, are not designed with visual symbolization as a primary concern, but are intended for communicating geographic information without reliance on visual interaction. In this non-visual map design setting, rules for cartographic symbolization are needed that are not simply extensions of visual design guidelines, but are rather derived from human subjects testing and existing theories from the perceptual and cognitive sciences. In this paper, we present some evidence from human subjects testing that suggests size discrimination guidelines for cartographic symbols presented in the auditory and haptic sensory domains, with a goal of adding to the body of work on map design for blind and visually-impaired individuals.
AML 1 / ETO Proteins Control POU 4 F 1 / BRN 3 A Expression and Function in t ( 8 ; 21 ) Acute Myeloid Leukemia

Authors' A Barts and London; 2M Child Healt 3Northern I Kingdom Note: Sup Research O J. Dunne a address fo Sciences, U D.M. Gasc ments; J. D provided s Heidenreic H. Brady, a Correspon Clinical La United King
Seroprevalence of Toxoplasma gondii infection in Liaoning cashmere goat from northeastern China

In the present study, serum samples from 650 goats were collected from five counties between May and June 2012 and antibodies to Toxoplasma gondii were detected by indirect haemagglutination assay; 58 (9%) had antibodies to T. gondii with antibody titres of 1:64 to 1:1024. Seropositive samples were distributed in all five counties: seroprevalences in Kuandian county (15%, 21/139, 95% confidence interval [CI] 9–21%) were statistically different from the four other counties (Gaizhou, Huanren, Xiuyan and Liaoyang), and the seroprevalence difference between Xiuyan county (12%, 15/127, 95% CI 6–17%) and two other counties (Huanren, Liaoyang) was significantly different (P < 0.05). To our knowledge, this is the first report of the seroprevalence of T. gondii exposure in Liaoning cashmere goat in China. Our results indicated that Liaoning cashmere goat could be a potential reservoir for the transmission of T. gondii in Liaoning Province.
A new protocol for user awareness in card based shopping

Consciously or unconsciously, we are using many kinds of “cards” in our daily lives. Among them, credit card, cash card, driving license, etc., are as important as our wallets. To protect the card holder from malicious use of his/her cards, it is necessary to authenticate the card user. For this purpose, a common practice is to ask the user to provide some key information (usually password) known or possessed only by the true card holder. However, if the key information is leaked, the third party may still use the card easily. The purpose of this paper is to propose a new protocol for authenticating the card user. The basic idea is to re-shape the bio-image (e.g. photograph) of the true card holder, store it in the card, and reconstruct the original image when the card is used. By doing so, the human operator can identify the card user directly based on the reconstructed image, and the true card holder can be protected effectively.
QuickTM: A Hardware Solution to a High Performance Unbounded Transactional Memory

Transactional Memory (TM) is an emerging technology which simplifies the concurrency control in a parallel program. In this paper we propose Quick TM, a new hardware transactional memory (HTM) architecture. It incorporates three features to address known bottlenecks in the existing HTM architectures. First, we propose hardware-only dynamic detection of true-shared variables. Our result shows that true-shared variables account for only about 20% in the commit set of any transaction. Rest can be completely disregarded from the commit phase. This shortens every commit phase drastically resulting in a significant overall speed-up. Second, we keep both the speculative and the last committed version local to each processor. This benefits when a transaction is repeated in a loop. The processor request gets satisfied from the L1 data cache(L1D) itself. Furthermore, since both the versions are locally maintained, the commit action involves only broadcast of addresses. Third, we have proposed a mechanism to address overflow in transactions. In our proposal, each processor continues to run transactions even if one processor has overflown its L1D. Our technique eliminates the stall of a thread even if it conflicts with the overflown transaction. Overflown transaction commits in-place and periodically broadcasts its write set addresses, termed “partial commit”. This gradually reduces conflicts and allows other threads to progress towards commit. Moreover, the technique does not require any additional hardware at any memory hierarchy level beyond L1. Quick TM outperforms the state-of-the-art scalable HTM architecture, Scalable-TCC, on average by 20% in the latest TM benchmark suite STAMP. It outperforms the original TCC proposal with serialized commit by 28% on average. Maximum speed-up achieved in these two cases are 43% and 67% respectively. Our proposal handles transaction overflow gracefully and outperforms the current overflow-aware HTM proposal, One TM-concurrent by 12% on average.