Miracle-dz/UniFAR-FTUs huggingface dataset:
Paroxetine controlled release in the treatment of menopausal hot flashes: a randomized controlled trial.

CONTEXT Standard therapy for hot flashes has been hormone replacement with estradiol or progestational agents, but recent data suggest that antidepressants inhibiting serotonin reuptake may also be effective. OBJECTIVE To evaluate a selective serotonin reuptake inhibitor (paroxetine controlled release [CR]) in treating the vasomotor symptoms displayed by a general cross-section of menopausal women. DESIGN AND SETTING Randomized, double-blind, placebo-controlled, parallel group study conducted across 17 US sites, including urban, suburban, and rural clinics. PATIENTS A total of 165 menopausal women aged 18 years or older experiencing at least 2 to 3 daily hot flashes and must have discontinued any hormone replacement therapy for at least 6 weeks. Women were excluded if they had any signs of active cancer or were undergoing chemotherapy or radiation therapy. INTERVENTION After a 1-week placebo run-in phase, study participants were randomized to receive placebo or receive 12.5 mg/d or 25.0 mg/d of paroxetine CR (in a 1:1:1 ratio) for 6 weeks. MAIN OUTCOME MEASURES Mean change from baseline to week 6 in the daily hot flash composite score (frequency x severity). RESULTS Fifty-six participants were randomly assigned to receive placebo and 51 to receive 12.5 mg/d and 58 to receive 25.0 mg/d of paroxetine CR. The mean reductions in the hot flash frequency composite score from baseline to week 6 were statistically significantly greater for those receiving paroxetine CR than for those receiving placebo. By week 6, the mean daily hot flash frequency went from 7.1 to 3.8 (mean reduction, 3.3) for those in the 12.5-mg/d and from 6.4 to 3.2 (mean reduction, 3.2) for those in the 25-mg/d paroxetine CR groups and from 6.6 to 4.8 (mean reduction, 1.8) for those in the placebo group. Mean placebo-adjusted reduction in hot flash composite scores were -4.7 (95% confidence interval, - 8.1 to -1.3; P =.007) comparing 12.5-mg/d paroxetine CR with placebo; and -3.6 (95% confidence interval, -6.8 to -0.4; P =.03) comparing 25.0-mg/d paroxetine CR with placebo. This corresponded to median reductions of 62.2% for those in the 12.5-mg/d and 64.6% for those in the 25.0-mg/d paroxetine CR groups compared with 37.8% for those in the placebo group. CONCLUSION Paroxetine CR may be an effective and acceptable alternative to hormone replacement and other therapies in treating menopausal hot flash symptoms.
Microcontroller Based Heart Rate Monitor

This paper describes the development of a heart rate monitor system based on a microcontroller. It offers the advantage of portability over tape-based recording systems. The paper explains how a single-chip microcontroller can be used to analyse heart beat rate signals in real-time. In addition, it allows doctors to get the heart beat rate file of the patient by e- mail every twenty four hours. It can also be used to control patients or athletic person over a long period. The system reads, stores and analyses the heart beat rate signals repetitively in real-time. The hardware and software design are oriented towards a single-chip microcontroller-based system, hence minimizing the size. The important feature of this paper is the use of zero crossing algorithm to compute heart rate. It then processes on real-time the information to determine some heart diseases.
Maximal Sequential Pattern Mining Based on Simultaneous Monotone and Anti-monotone Constraints

The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns, and a lot of patterns are not interesting to users. In this paper, a novel algorithm MSMA (maximal sequential pattern mining based on simultaneous monotone and anti-monotone constraints) incorporating both maximal and constraint-based sequential pattern mining in mining process is proposed. It allows the efficient mining of sequential patterns when both monotone and anti-monotone constraints are simultaneously pushed in mining process at different strategic stages. Our experiment shows that MSMA is an efficient algorithm for handling simultaneous monotone and anti-monotone constraints.
Hydrostatic Interfaces in Bodies With Nonhydrostatic Lithospheres

Below the lithospheres of the terrestrial planets, dwarf planets, and moons, density interfaces adjust over geologic time to align with surfaces of constant gravitational potential. It is well known that the shape of such hydrostatic surfaces is controlled by the pseudo‐rotational potential, tidal potential, and the induced potential of nonspherical density interfaces in the body. When a lithosphere is present, however, additional gravitational terms must be considered that arise from, for example, surface relief and crustal thickness variations. A first‐order formalism is presented for calculating the shape of hydrostatic density interfaces beneath the lithosphere when the gravity field and surface shape of the body are known. Using an arbitrary discretized density profile, the shapes are obtained by solving a simple matrix equation. As examples, lithospheric gravity anomalies account for about 10% of the relief along hydrostatic interfaces in Mars, whereas for the Moon, the lithospheric gravity is the dominant contributor to the core shape. Spherical harmonic degree‐1 mass anomalies in the lithosphere generate degree‐1 relief along the core‐mantle boundary, and for Mars and the Moon, the core is offset from the center of mass of the body by about 90 m. The moments of inertia of the core of these bodies are also misaligned with respect to the principal moments of the entire body. An improved crustal thickness map of Mars is constructed that accounts for gravity anomalies beneath the lithosphere, and the consequences of core relief on the Martian free core nutation are quantified.
Enhancement of Spatial Reversal Learning by 5-HT2C Receptor Antagonism Is Neuroanatomically Specific

We have recently demonstrated that systemic administration of 5-HT2C and 5-HT2A receptor antagonists significantly enhanced and impaired spatial reversal learning, respectively. In this study, the role of 5-HT2C and 5-HT2A receptor subtypes in the mediation of these opposing effects was further investigated with respect to neuroanatomical specificity. The roles of 5-HT2C and 5-HT2A receptors were examined within some of the brain regions implicated in cognitive flexibility, namely the orbitofrontal cortex (OFC), medial prefrontal cortex (mPFC), and nucleus accumbens (NAc), by means of targeted infusions of selective 5-HT2C and 5-HT2A receptor antagonists (SB 242084 and M100907, respectively). Intra-OFC 5-HT2C receptor antagonism produced dose-dependent effects similar to those of systemic administration, i.e., improved spatial reversal learning by reducing the number of trials (all doses: 0.1, 0.3, and 1.0 μg) and perseverative errors to criterion (0.3 and 1.0 μg) compared with controls. However, the highest dose (1.0 μg) showed a nonselective effect, as it also affected retention preceding the reversal phase and decreased learning errors. Intracerebral infusions of SB 242084 into the mPFC or NAc produced no significant effects on any behavioral measures. Similarly, no significant differences were observed with intra-OFC, -mPFC, or -NAc infusions of M100907. These data suggest that the improved performance in reversal learning observed after 5-HT2C receptor antagonism is mediated within the OFC. These data also bear on the issue of whether 5-HT2C receptor antagonism within the OFC might help elucidate the biological substrate of obsessive-compulsive disorder, offering the potential for therapeutic application.
Exploring the Emerging Type of Comment for Online Videos

DanMu, an emerging type of user-generated comment, has become increasingly popular in recent years. Many online video platforms such as Tudou.com have provided the DanMu function. Unlike traditional online reviews such as reviews at Youtube.com that are outside the videos, DanMu is a scrolling marquee comment, which is overlaid directly on top of the video and synchronized to a specific playback time. Such comments are displayed as streams of moving subtitles overlaid on the video screen. Viewers could easily write DanMus while watching videos, and the written DanMus will be immediately overlaid onto the video and displayed to writers themselves and other viewers as well. Such DanMu systems have greatly enabled users to communicate with each other in a much more direct way, creating a real-time sharing experience. Although there are several unique features of DanMu and has had a great impact on online video systems, to the best of our knowledge, there is no work that has provided a comprehensive study on DanMu. In this article, as a pilot study, we analyze the unique characteristics of DanMu from various perspectives. Specifically, we first illustrate some unique distributions of DanMus by comparing with traditional reviews (TReviews) that we collected from a real DanMu-enabled online video system. Second, we discover two interesting patterns in DanMu data: a herding effect and multiple-burst phenomena that are significantly different from those in TRviews and reveal important insights about the growth of DanMus on a video. Towards exploring antecedents of both th herding effect and multiple-burst phenomena, we propose to further detect leading DanMus within bursts, because those leading DanMus make the most contribution to both patterns. A framework is proposed to detect leading DanMus that effectively combines multiple factors contributing to leading DanMus. Based on the identified characteristics of DanMu, finally we propose to predict the distribution of future DanMus (i.e., the growth of DanMus), which is important for many DanMu-enabled online video systems, for example, the predicted DanMu distribution could be an indicator of video popularity. This prediction task includes two aspects: One is to predict which videos future DanMus will be posted for, and the other one is to predict which segments of a video future DanMus will be posted on. We develop two sophisticated models to solve both problems. Finally, intensive experiments are conducted with a real-world dataset to validate all methods developed in this article.
Upper bounds for the writhing of knots and the helicity of vector ?elds

A cheque writing desk for use in conjunction with a customer control line rail system, which may be arranged in an essentially "free standing" manner in any appropriate location in the customer area of a bank, trust company or other location, and which may be used on one side for the writing of cheques and the like, and having a partition extending along the table, carrying deposit slips and the like on one side, and which on its reverse side may carry advertising pamphlets for the bank or any other purpose. The cheque writing desk has one or more couplings by means of which it may be connected with the line rail system at or about the point where the customers enter the line rail system. In this way, the customers may write their cheques, or deposits on one side of the desk just prior to entering the line rail system, and as they pass around the desk to enter the line rail system, they may then examine the advertising material at a location in which they are bound to be waiting for a few minutes, and may, therefore, give their attention to such material without distraction.
Time-Frequency Detection Algorithm of Network Traffic Anomalies

Abnormal network traffic results in a very great harm to our current communication networks, so we need to quickly detect anomalous or malicious traffic in a network. However, the existing detection methods hold a lot of computational overhead and detection errors, which will make it significantly difficult to meet the detection requirements of anomalous network traffic. This paper presents a novel detection algorithm of network traffic anomalies based on time-frequency analysis and statistic theory. We use the discrete wavelet transform to capture the time-frequency nature of network traffic. And then the nature of its low and high frequency is discussed in details. We further analyze its statistic properties in the different scales based on the sliding time window. At the same time, the abnormal nature of network traffic is extracted and the anomaly detection is performed correctly for network traffic. Simulation results indicate that our detection algorithm is feasible and effective.
Evolution of genetic variability in a population of the edible snail, Helix aspersa Müller, undergoing domestication and short-term selection

The evolution of genetic variability is studied in six successive generations of a population originating from wild Helix aspersa. During the first three generations (G1 to G3), no artificial selection was applied. During the next three generations (G4 to G6), two lines were reared: a control line (C) and a line (S) selected for increased adult weight. Genetic variability is described by genealogical parameters (inbreeding, number of founders, effective number of founders and ancestors, effective number of remaining genomes) and by the additive genetic variance in adult weight. A large decrease in all parameters was observed between G1 and G2, suggesting strong natural selection: additive genetic variance in adult weight (transformed data) decreased from 0.0119 ± 3.8 × 10−3 to 0.0070 ± 1.7 × 10−3 (P < 0.05) and effective number of ancestors from 97.4 to 67.0. Selection also caused a large decrease during the first generation: additive genetic variance was 0.0079 ± 2.1 × 10−3 in G3 and 0.0040 ± 1.1 × 10−3 after the first selection cycle (P < 0.02). At the same time, the effective number of ancestors decreased from 59.2 to 29.5 and 24.2. This decrease is consistent with the theory of selection and the Bulmer effect.
The truncated fourier transform and applications

In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminating the "jumps" in the complexity at powers of two. When applied to the multiplication of multivariate polynomials or truncated multivariate power series, we gain a logarithmic factor with respect to the best previously known algorithms.
Intrinsic fluctuations in sub 10-nm double-gate MOSFETs introduced by discreteness of charge and matter

We study, using numerical simulation, the intrinsic parameter fluctuations in sub 10 nm gate length double gate MOSFETs introduced by discreteness of charge and atomicity of matter. The employed "atomistic" drift-diffusion simulation approach includes quantum corrections based on the density gradient formalism. The quantum confinement and source-to-drain tunnelling effects are carefully calibrated in respect of self-consistent Poisson-Schrodinger and nonequilibrium Green's function simulations. Various sources of intrinsic parameter fluctuations, including random discrete dopants in the source/drain regions, single dopant or charged defect state in the channel region and gate line edge roughness, are studied in detail.
Uncertainty in Soft Temporal Constraint Problems:A General Framework and Controllability Algorithms forThe Fuzzy Case

In real-life temporal scenarios, uncertainty and preferences are often essential and coexisting aspects. We present a formalism where quantitative temporal constraints with both preferences and uncertainty can be defined. We show how three classical notions of controllability (that is, strong, weak, and dynamic), which have been developed for uncertain temporal problems, can be generalized to handle preferences as well. After defining this general framework, we focus on problems where preferences follow the fuzzy approach, and with properties that assure tractability. For such problems, we propose algorithms to check the presence of the controllability properties. In particular, we show that in such a setting dealing simultaneously with preferences and uncertainty does not increase the complexity of controllability testing. We also develop a dynamic execution algorithm, of polynomial complexity, that produces temporal plans under uncertainty that are optimal with respect to fuzzy preferences.
Granular Computing in Actor-Critic Learning

The problem considered in this paper is how to guide actor-critic learning based an information granules that reflect knowledge about acceptable behavior patterns. The solution to this problem stems from approximation spaces, which were introduced by Zdzistaw Pawlak starting in the early 1980s and which provide a basis for perception of objects that are imperfectly known. It was also observed by Ewa Orlowska En 1982 that approximation spaces serve as a formal counterpart of perception, or observation. In our case, approximation spaces provide a ground for deriving pattern-based behaviours as well as information granules that can be used to influence the policy structure of an actor in a beneficial way. This paper includes the results of a recent study of swarm behavior by collections of biologically-inspired bots carried out in the context of an artificial ecosystem. This ecosystem has an ethological basis that makes it possible to observe and explain the behavior of biological organisms that carries over into the study of actor-critic learning by interacting robotic devices. The contribution of this article is a framework for actor-critic learning defined in the context of approximation spaces and information granulation
Configuring irace using surrogate configuration benchmarks

Over recent years, several tools for the automated conguration of parameterized algorithms have been developed. ese tools, also called congurators, have themselves parameters that inuence their search behavior and make them malleable to dierent kinds of conguration tasks. e default values of these parameters are set manually based on the experience of the congurator’s developers. Studying the impact of these parameters or conguring them is very expensive as it would require many executions of these tools on conguration tasks, each taking oen many hours or days of computation. In this work, we tackle this problem using a metatuning process, based on the use of surrogate benchmarks that are much faster to evaluate. is paper studies the feasibility of this process using the popular irace congurator as the method to be meta-congured. We rst study the consistency between the real and surrogate benchmarks using three measures: the prediction accuracy of the surrogate models, the homogeneity of the benchmarks and the list of important algorithm parameters. Aerwards, we use irace to congure irace on those surrogates. Experimental results indicate the feasibility of this process and a clear potential improvement of irace over its default conguration.
Topic search for intelligent network news reader HISHO

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. SAC ’00 Villa Olmo, Como Italy Copyright 2000 ACM 0-89791-88-6/97/05 . $5.00 strewn around a lot of news groups. There is, nonetheless, a lot of useful information in network news, and extracting necessary information from network news can be crucial to users. We have thus started to build
Improving Topic Model Stability for Effective Document Exploration

Topic modeling has become a ubiquitous topic analysis tool for text exploration. Most of the existing works on topic modeling focus on fitting topic models to input data. They however ignore an important usability issue that is closely related to the end user experience: stability. In this study, we investigate the stability problem in topic modeling. We first report on the experiments conducted to quantify the severity of the problem. We then propose a new learning framework to mitigate the problem by explicitly incorporating topic stability constraints in model training. We also perform user study to demonstrate the advantages of the proposed method.
Humoral Immune Response During Coronary Artery Bypass Grafting: A Comparison of Limited Approach, “Off-Pump” Technique, and Conventional Cardiopulmonary Bypass

Background—The introduction of limited approaches to the heart and the avoidance of cardiopulmonary bypass (CPB) aim to reduce the invasiveness of CABG by decreasing the systemic release of inflammatory cytokines, such as tumor necrosis factor (TNF)-&agr;, interleukin (IL)-6, and IL-8, as well as the anti-inflammatory agent IL-10. This study compares the humoral immune response in patients undergoing CABG with standard, minimally invasive, and “off-pump” techniques. Methods and Results—Thirty patients were divided into 3 operative groups: full sternotomy approach plus CPB (group A); full sternotomy approach, off pump (group B); and limited left anterior thoracotomy, off pump (group C). Plasma levels of TNF-&agr; receptors p55 and p75, IL 6, IL-8, and IL-10 were taken at baseline, during CPB, and at 4, 24, and 48 hours and 6 days after surgery. A significant increased release of activated complement factors C5a and C3d, IL-8, and IL-10 was observed in patients subjected to CPB (group A) during the initial period and for a short time after perfusion (P <0.05). TNF-&agr; receptors p55 and p75 showed a prolonged elevation (up to 48 hours) in the CPB group compared with the 2 off-pump groups. IL-6 showed no different release among the 3 surgical groups throughout the entire period. There was no significant difference in any parameter measured in relation to the type of operative approach. Conclusions—There is an inflammatory, as well as an anti-inflammatory, response during CABG that is related to the general surgical trauma. The release of immune mediators is enhanced by the use of CPB during various perioperative and postoperative phases. The type of operative approach did not influence this immune response.
Optimal causal quantization of Markov Sources with distortion constraints

For Markov sources, the structure of optimal causal encoders minimizing the total communication rate subject to a mean-square distortion constraint is studied. The class of sources considered lives in a continuous alphabet, and the encoder is allowed to be variable-rate. Both the finite-horizon and the infinite-horizon problems are considered. In the finite-horizon case, the problem is non-convex, whereas in the infinite-horizon case the problem can be convexified under certain assumptions. For a finite horizon problem, the optimal deterministic causal encoder for a kth-order Markov source uses only the most recent k source symbols and the information available at the receiver, whereas the optimal causal coder for a memoryless source is memoryless. For the infinite-horizon problem, a convex-analytic approach is adopted. Randomized stationary quantizers are suboptimal in the absence of common randomness between the encoder and the decoder. If there is common randomness, the optimal quantizer requires the randomization of at most two deterministic quantizers. In the absence of common randomness, the optimal quantizer is non-stationary and a recurrence-based time-sharing of two deterministic quantizers is optimal. A linear source driven by Gaussian noise is considered. If the process is stable, innovation coding is almost optimal at high-rates, whereas if the source is unstable, then even a high-rate time-invariant innovation coding scheme leads to an unstable estimation process.