Miracle-dz/UniFAR-FTUs huggingface dataset:
Effect of High-Dose Atorvastatin on Hospitalizations for Heart Failure Subgroup Analysis of the Treating to New Targets (TNT) Study Heart Failure

Background —Statins reduce the rate of major cardiovascular events in high-risk patients, but their potential benefit as treatment for heart failure (HF) is less clear. Methods and Results —Patients (n (cid:1) 10 001) with stable coronary disease were randomized to treatment with atorvastatin 80 or 10 mg/d and followed up for a median of 4.9 years. A history of HF was present in 7.8% of patients. A known ejection fraction (cid:2) 30% and advanced HF were exclusion criteria for the study. A predefined secondary end point of the study was hospitalization for HF. The incidence of hospitalization for HF was 2.4% in the 80-mg arm and 3.3% in the 10-mg arm (hazard ratio, 0.74; 95% confidence interval, 0.59 to 0.94; P (cid:1) 0.0116). The treatment effect of the higher dose was more marked in patients with a history of HF: 17.3% versus 10.6% in the 10- and 80-mg arms, respectively (hazard ratio, 0.59; 95% confidence interval, 0.4 to 0.88; P (cid:1) 0.009). Among patients without a history of HF, the rates of hospitalization for HF were much lower: 1.8% in the 80-mg group and 2.0% in the 10-mg group (hazard ratio, 0.87; 95% confidence interval, 0.64 to 1.16; P (cid:1) 0.34). Only one third of patients hospitalized for HF had evidence of preceding angina or myocardial infarction during the study period. Blood pressure was almost identical during follow-up in the treatment groups. Conclusions patients with stable coronary disease significantly reduces hospitalizations for HF. In a post hoc analysis, this benefit was observed only in patients with a history of HF. The mechanism accounting for this benefit is unlikely to be due primarily to a reduction in interim coronary events or differences in blood pressure. ( Circulation . 2007;115:576-583.)
Molecular characterization of a novel ssRNA ourmia-like virus from the rice blast fungus

In this study we characterize a novel positive and single stranded RNA (ssRNA) mycovirus isolated from the rice field isolate of Magnaporthe oryzae Guy11. The ssRNA contains a single open reading frame (ORF) of 2,373 nucleotides in length and encodes an RNA-dependent RNA polymerase (RdRp) closely related to ourmiaviruses (plant viruses) and ourmia-like mycoviruses. Accordingly, we name this virus Magnaporthe oryzae ourmia-like virus 1 (MOLV1). Although phylogenetic analysis suggests that MOLV1 is closely related to ourmia and ourmia-like viruses, it has some features never reported before within the Ourmiavirus genus. 3’ RLM-RACE (RNA ligase-mediated rapid amplification of cDNA ends) and extension poly(A) tests (ePAT) suggest that the MOLV1 genome contains a poly(A) tail whereas the three cystein and the three guanine residues present in 5’ and 3’ untranslated regions (UTRs) of ourmia viruses are not observed in the MOLV1 sequence. The discovery of this novel viral genome supports the hypothesis that plant pathogenic fungi may have acquired this type of viruses from their host plants.
Microwave measurements of the BNL/SLAC/UCLA 1.6 cell photocathode RF gun

The longitudinal accelerating field E/sub z/ has been measured as a function of azimuthal angle in the full cell of the cold test model for the 1.6 cell BNL/SLAC/UCLA 3 S-band RF gun using a needle rotation/frequency perturbation technique. These measurements were conducted before and after symmetrizing the full cell with a vacuum pump out port and an adjustable short. Two different waveguide to full cell coupling schemes were studied. The dipole mode of the full cell is an order of magnitude less severe before symmetrization for the /spl theta/-coupling scheme. The multi-pole contribution to the longitudinal field asymmetry are calculated using standard Fourier series techniques. The Panofsky-Wenzel theorem is used in estimating the transverse emittance due to the multipole components of E/sub z/.
Fixed-Point Hestenes SVD Algorithm for Computing Eigen Faces

—The present paper discusses the development of ﬁxed-point Hestenes’ singular value decomposition (SVD) algorithm of symmetric matrices in computing eigen faces for image processing applications. Steps for developing ﬁxed-point algorithm from ﬂoating-point version are discussed. Quantization noise propagation model for computationally intensive sections of the algorithm are derived and validated. The results are compared with the double precision ﬂoating-point version of the algorithm. Accuracy is measured in terms of number of accurate fractional bits, signal-to-quantization-noise-ratio (SQNR), orthogonality and factorization errors. Results show that the constant ﬁxed-point format performs better than variable one in terms of number of accurate fractional bits when the variables have close ranges. Variable ﬁxed-point format implementation exhibits an overall better performance. A case study has been presented where variable ﬁxed-point Hestenes’ SVD algorithm with three different wordlengths (WLs) is used as an image processing tool to compute eigen faces from one male and one female face database.
Speaker Labeling Using Closed-Captioning

—There has recently been much research on annotation systems for television broadcasting because of interest in retrieving highlights from television programs. However, most of the methods developed have specialized in only one genre. Therefore, in this study we targeted three genres drama, animation, and variety and developed a system of annotating indexical information through metadata obtained from television captions. Speciﬁcally, the information from the captions is used to create a phoneme HMM that is then used for speaker identiﬁcation. The proposed system selects the most appropriate phonemic model from several candidate models based on the Bayesian information criterion (BIC) of likelihood and data. Characters in 70 television programs were identiﬁed with a recognition accuracy of 39.6%. Television captioning can already identify about 50.0% of the characters in a show, and when we combined captioning with the proposed system, 70.0-80.0% of the utterances in one program were correctly identiﬁed.
Institutional Knowledge at Singapore Management University Institutional Knowledge at Singapore Management University Have U.S. - Japan Trade Agreements Made a Difference? Have U.S. - Japan Trade Agreements Made a Difference?

The few existing empirical studies of U.S.-Japan trade agreements have relied primarily on descriptive statistics or univariate time series methods. We conduct a more powerful test by evaluating agreements in the context of well-specified econometric models. Consistent with trade theory, import demand is modeled as a cointegrating relationship with income and relative price variables, where a trade agreement may cause a structural break in the cointegrating vector. In several cases, we find evidence that market-opening trade agreements may have increased the volume of Japanese imports, while other agreements appear to have had no significant impact.
Journal Pre-proof Differing impact of phosphoglycerate mutase 1-deficiency on brown and white adipose tissue

and few studies have focused on the role of glycolytic enzymes in regulating adipose tissue function. We generated mouse models with specific deletion of the glycolytic enzyme phosphoglycerate mutase 1 (PGAM1) from adipose tissue. Deletion of Pgam1 from both BAT and WAT promoted whitening of BAT with beiging of visceral WAT, whereas deletion of Pgam1 from BAT alone led to whitening of BAT without beiging of WAT. Our results demonstrate a potential role of glycolytic enzymes in beiging of visceral WAT and suggest that PGAM1 would be a novel therapeutic target in obesity and diabetes. Centrifugation performed after centrifugally 50μl μM capillary All CE-TOF/MS experiments were performed using an Agilent Capillary Electrophoresis equipped with an Agilent an Agilent isocratic HPLC Agilent an Agilent
Robust adaptive blind equalisation in impulsive noise

To solve the significant performance degradation of existing algorithms in the impulsive noise environment, a novel blind equalisation method called robust adaptive weighted multi-modulus algorithm is proposed in this Letter. The authors introduce an adaptive weight coefficient to suppress the effect of large output error in the weight updating process. Theoretical analysis indicates that the proposed algorithm can suppress the impulsive noise effectively. Moreover, it can accelerate the convergence speed. Simulation results illustrate the robust performance and fast convergence speed of the proposed algorithm under α-stable noise environment.
A C++ Incarnation of Zernike Circle Functions

An explicit C++ library is provided which deals with Zernike Functions over the unit circle as the main subject. The implementation includes basic means to evaluate the functions at points inside the unit circle and to convert the radial and azimuthal parameters to Noll's index and vice versa. Advanced methods allow to expand products of Zernike Functions into sums of Zernike Functions, and to convert Zernike Functions to polynomials over the two Cartesian coordinates and vice versa.
A Faint and Fast Tidal Disruption Event in an E plus A Galaxy

We present ground-based and Swift observations of iPTF16fnl, a likely tidal disruption event (TDE) discovered by the intermediate Palomar Transient Factory (iPTF) survey at 66.6 Mpc. The lightcurve of the object peaked at absolute M g = − 17 . 2 mag. The maximum bolometric luminosity (from optical and UV) was L p (cid:39) (1 . 0 ± 0 . 15) × 10 43 erg s − 1 , an order of magnitude fainter than any other optical TDE discovered so far. The luminosity in the ﬁrst 60 days is consistent with an exponential decay, with L ∝ e − ( t − t 0 ) /τ , where t 0 = 57631.0 (MJD) and τ (cid:39) 15 days. The X-ray shows a marginal detection at L X = 2 . 4 1 . 9 − 1 . 1 × 10 39 erg s − 1 ( Swift X-ray Telescope). No radio counterpart was detected down to 3 σ , providing upper limits for monochromatic radio luminosity of νL ν < 2 . 3 × 10 36 erg s − 1 and νL ν < 1 . 7 × 10 37 erg s − 1 (VLA, 6.1 and 22 GHz). The blackbody temperature, obtained from combined Swift UV and optical photometry, shows a constant value of 19,000 K. The transient spectrum at peak is characterized by broad He II and H α emission lines, with an FWHM of about 14,000 km s − 1 and 10,000 km s − 1 respectively. He I lines are also detected at λλ 5875 and 6678. The spectrum of the host is dominated by strong Balmer absorption lines, which are consistent with a post-starburst (E+A) galaxy with an age of ∼ 650 Myr and solar metallicity. The characteristics of iPTF16fnl make it an outlier on both luminosity and decay timescales, as compared to other optically selected TDEs. The discovery of such a faint optical event suggests a higher rate of tidal disruptions, as low luminosity events may have gone unnoticed in previous searches. Foundation (NSF) 1313484. This work makes use of observations from the LCO network. G.H. is supported Foundation (NSF) This work makes use of observations from the LCO network. We acknowledge the use of public data from the Swift data archive. The CSS survey Observations The CRTS
Dynamic Modeling of Branched Robots using Modular Composition

When modeling complex robot systems such as branched robots, whose kinematic structures are a tree, current techniques often require modeling the whole structure from scratch, even when partial models for the branches are available. This paper proposes a systematic modular procedure for the dynamic modeling of branched robots comprising several subsystems, each composed of an arbitrary number of rigid bodies, providing the final dynamic model by reusing previous models of each branch. Unlike previous approaches, the proposed strategy is applicable even if some subsystems are regarded as black boxes, requiring only twists and wrenches at the connection points between them. To help in the model composition, we also propose a weighted directed graph representation where the weights encode the propagation of twists and wrenches between the subsystems. A simple linear operation on the graph interconnection matrix provides the dynamics of the whole system. Numerical results using a 24-DoF fixed-base branched robot composed of eight subsystems show that the proposed formalism is as accurate as a state-of-the-art library for robotic dynamic modeling. Additional results using a 30-DoF holonomic branched mobile manipulator composed of three subsystems demonstrate the fidelity of our model to a modern robotics simulator and its capability of dealing with black box subsystems. To further illustrate how the derived dynamic model can be used in closed-loop control, we also present a simple formulation of a model-based wrench-driven pose control for branched robots.
Rumor Stance Classification in Online Social Networks: A Survey on the State-of-the-Art, Prospects, and Future Challenges

—The emergence of the Internet as a ubiquitous technology has facilitated the rapid evolution of social media as the leading virtual platform for communication, content sharing, and information dissemination. Inspite of revolutionizing theway news usedtobedeliveredtopeople,thistechnologyhasalsobroughtalongwithitselfinevitabledemerits.Onesuchdrawbackisthespreadof rumorsfacilitatedbysocialmediaplatformswhichmayprovoke doubt and fear upon people. Therefore, the need to debunkrumors beforetheirwidespreadhasbecomeessentialallthemore.Overtheyears,manystudieshavebeenconductedtodevelopeffectiverumor veriﬁcationsystems. Oneaspectofsuchstudiesfocuseson rumor stance classiﬁcation , which concerns the task of utilizing users’ viewpoints about a rumorous post to better predict the veracity of a rumor. Relying on users’ stances in rumor veriﬁcation task has gainedgreat importance, for ithas shownsigniﬁcantimprovements in the model performances. In this paper, we conduct a comprehensive literature review on rumor stance classiﬁcation in complex social networks. In particular, we present a thorough description of the approaches and mark the top performances. Moreover, we introducemultipledatasets available for thispurpose and highlight their limitations. Finally, some challenges and future directions are discussed to stimulate further relevant research efforts.
Unveiling the Contribution of Population III Stars in Primeval Galaxies at Redshift ≥6

Detection of the first stars has remained elusive so far but their presence may soon be unveiled by upcoming JWST observations. Previous studies have not investigated the entire possible range of halo masses and redshifts that may help in their detection. Motivated by the prospects of detecting galaxies up to z ∼ 20 in the JWST early data release, we quantify the contribution of Population III stars to high-redshift galaxies from 6 ≤ z ≤ 30 by employing the semianalytical model a-sloth, which self-consistently models the formation of Population III and Population II stars along with their feedback. Our results suggest that the contribution of Population III stars is the highest in low-mass halos of 107–109 M ⊙. While high-mass halos ≥1010 M ⊙ contain less than 1% Population III stars, they host galaxies with stellar masses of 109 M ⊙ as early as z ∼ 30. Interestingly, overall the apparent magnitude of Population III stars gets brighter toward higher redshift due to the higher stellar masses, but Population III–dominated galaxies are too faint to be directly detected with JWST. Our results predict JWST can detect galaxies up to z ∼ 30, which may help in constraining the initial mass function of Population III stars and will guide observers to discern the contribution of Population III stars to high-redshift galaxies.
Noise tolerance of learning to rank under class-conditional label noise

Often, the data used to train ranking models is subject to label noise. For example, in web-search, labels created from clickstream data are noisy due to issues such as insufficient information in item descriptions on the SERP, query reformulation by the user, and erratic or unexpected user behavior. In practice, it is difficult to handle label noise without making strong assumptions about the label generation process. As a result, practitioners typically train their learning-to-rank (LtR) models directly on this noisy data without additional consideration of the label noise. Surprisingly, we often see strong performance from LtR models trained in this way. In this work, we describe a class of noise-tolerant LtR losses for which empirical risk minimization is a consistent procedure, even in the context of class-conditional label noise. We also develop noise-tolerant analogs of commonly used loss functions. The practical implications of our theoretical findings are further supported by experimental results.
Mates2Motion: Learning How Mechanical CAD Assemblies Work

We describe our work on inferring the degrees of freedom between mated parts in mechanical assemblies using deep learning on CAD representations. We train our model using a large dataset of real-world mechanical assemblies consisting of CAD parts and mates joining them together. We present methods for re-defining these mates to make them better reflect the motion of the assembly, as well as narrowing down the possible axes of motion. We also conduct a user study to create a motion-annotated test set with more reliable labels.
Magnetic field driven dynamics in twisted bilayer artificial spin ice at superlattice angles

Geometrical designs of interacting nanomagnets have been studied extensively in the form of two-dimensional arrays called artificial spin ice. These systems are usually designed to create geometrical frustration and are of interest for the unusual and often surprising phenomena that can emerge. Advanced lithographic and element growth techniques have enabled the realization of complex designs that can involve elements arranged in three dimensions. Using numerical simulations employing the dumbbell approximation, we examine possible magnetic behaviors for bilayer artificial spin ice, in which the individual layers are rotated with respect to one another. The goal is to understand how magnetization dynamics are affected by long-range dipolar coupling that can be modified by varying the layer separation and layer alignment through rotation. We consider bilayers where the layers are both either square or pinwheel arrangements of islands. Magnetic reversal processes are studied and discussed in terms of domain and domain wall configurations of the magnetic islands. Unusual magnetic ordering is predicted for special angles that define lateral spin superlattices for the bilayer systems.
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games

Computing Nash equilibrium policies is a central problem in multi-agent reinforcement learning that has received extensive attention both in theory and in practice. However, provable guarantees have been thus far either limited to fully competitive or cooperative scenarios or impose strong assumptions that are difficult to meet in most practical applications. In this work, we depart from those prior results by investigating infinite-horizon \emph{adversarial team Markov games}, a natural and well-motivated class of games in which a team of identically-interested players -- in the absence of any explicit coordination or communication -- is competing against an adversarial player. This setting allows for a unifying treatment of zero-sum Markov games and Markov potential games, and serves as a step to model more realistic strategic interactions that feature both competing and cooperative interests. Our main contribution is the first algorithm for computing stationary $\epsilon$-approximate Nash equilibria in adversarial team Markov games with computational complexity that is polynomial in all the natural parameters of the game, as well as $1/\epsilon$. The proposed algorithm is particularly natural and practical, and it is based on performing independent policy gradient steps for each player in the team, in tandem with best responses from the side of the adversary; in turn, the policy for the adversary is then obtained by solving a carefully constructed linear program. Our analysis leverages non-standard techniques to establish the KKT optimality conditions for a nonlinear program with nonconvex constraints, thereby leading to a natural interpretation of the induced Lagrange multipliers. Along the way, we significantly extend an important characterization of optimal policies in adversarial (normal-form) team games due to Von Stengel and Koller (GEB `97).
Joint Optimization for Secure and Reliable Communications in Finite Blocklength Regime

To realize ultra-reliable low latency communications with high spectral efficiency and security, we investigate a joint optimization problem for downlink communications with multiple users and eavesdroppers in the finite blocklength (FBL) regime. We formulate a multi-objective optimization problem to maximize a sum secrecy rate by developing a secure precoder and to minimize a maximum error probability and information leakage rate. The main challenges arise from the complicated multi-objective problem, non-tractable back-off factors from the FBL assumption, non-convexity and non-smoothness of the secrecy rate, and the intertwined optimization variables. To address these challenges, we adopt an alternating optimization approach by decomposing the problem into two phases: secure precoding design, and maximum error probability and information leakage rate minimization. In the first phase, we obtain a lower bound of the secrecy rate and derive a first-order Karush-Kuhn-Tucker (KKT) condition to identify local optimal solutions with respect to the precoders. Interpreting the condition as a generalized eigenvalue problem, we solve the problem by using a power iteration-based method. In the second phase, we adopt a weighted-sum approach and derive KKT conditions in terms of the error probabilities and leakage rates for given precoders. Simulations validate the proposed algorithm.
Bridging the Gap between Intermediate and Massive Stars. I. Validation of MESA against the State-of-the-Art Monash Stellar Evolution Program for a 2M ⊙ AGB Star

One-dimensional stellar structure and evolution programs are built using different physical prescriptions and algorithms, which means there can be variations between models’ predictions even when using identical input physics. This leads to questions about whether such deviations are physical or numerical; code validation studies are important and necessary tools for studying these questions. We provide the first direct comparison between the Monash stellar evolution program and MESA for a 2M ⊙ model evolved from the zero-age main sequence to the tip of the thermally pulsing asymptotic giant branch. We compare the internal structure of the two models at six critical evolutionary points and find that they are in excellent agreement with regard to characteristics like central temperature, central density, and the temperature at the base of the convective envelope during the thermally pulsing asymptotic giant branch. The H-exhausted core mass between the models differs by less than 4.2% throughout the entire evolution; the final values vary only by 1.5%. Surface quantities such as luminosity and radius vary by less than 0.2% prior to the asymptotic giant branch. During thermal pulses, the difference extends to 3.4%, largely due to uncertainties in mixing and the treatment of atmospheric boundary conditions. Given that the veteran Monash code is closed-source, the present work provides the first fully open-source computational analog. This increases accessibility to precision modeling on the asymptotic giant branch and lays the groundwork for higher-mass calculations that are performed with MESA but preserve the standards of the Monash code during the asymptotic giant branch.