Miracle-dz/UniFAR-FTUs huggingface dataset:
Coronary heart disease Changes in haemoglobin levels during hospital course and long-term outcome after acute myocardial infarction

Aims To study the prevalence and long-term prognostic significance of changes in haemoglobin levels during hospital course in survivors of acute myocardial infarction (AMI). Methods and results A prospective study involving 1390 patients who were admitted with AMI. Median follow-up was 24 months. Multivariable Cox models were used to evaluate the relationship between nadir and discharge haemoglobin and mortality after hospital discharge. Anaemia was present in 248 patients on admission (17.8%) and in 502 patients at discharge (36.1%). Nadir haemoglobin during hospital course was 1.3 g/dL lower (IQR 0.6–2.2) when compared with baseline haemoglobin (P , 0.0001). Low nadir haemoglobin and discharge haemoglobin were strongly associated with increased mortality. After adjusting for clinical variables and ejection fraction, the hazard ratios for a 1 g/dL decrease in nadir haemoglobin and discharge haemoglobin were 1.36 (95% CI 1.19–1.55; P , 0.0001) and 1.27 (95% CI 1.1621.40; P , 0.0001), respectively. Conclusion The development of anaemia during hospitalization for AMI is frequent and is associated with an increased long-term mortality.
Standing up from a chair as a dynamic equilibrium task: a comparison between young and elderly subjects.

The purpose of this study was to analyze and compare the features of center of mass (CoM) control along anterior/posterior axis in young and elderly subjects during sit-to-stand (STS). From a sitting position, seven healthy young subjects and seven healthy elderly subjects were asked to stand up from a chair under different experimental conditions (visual conditions: normal and blindfolded; speed: normal and as fast as possible). Analysis of results was based upon the concept of a "dynamic equilibrium area" (DEA), which in turn identified the dynamic limits of balance. The results showed that both the maximal CoM velocity in the horizontal axis and the CoM velocity at the instant of seat-off were found to be lower in elderly compared with young subjects. Concerning the maximal CoM velocity, the difference was increased under blindfolded condition. The position of CoM in the phase plane (i.e., velocity according to displacement) at the instant of seat-off was found to be shifted backward in elderly subjects. From these results we can deduce that age-related modifications can he observed in the control of the horizontal CoM motion during STS in healthy elderly subjects.
Profunctors, open maps and bisimulation

This paper studies fundamental connections between profunctors (that is, distributors, or bimodules), open maps and bisimulation. In particular, it proves that a colimit preserving functor between presheaf categories (corresponding to a profunctor) preserves open maps and open map bisimulation. Consequently, the composition of profunctors preserves open maps as 2-cells. A guiding idea is the view that profunctors, and colimit preserving functors, are linear maps in a model of classical linear logic. But profunctors, and colimit preserving functors, as linear maps, are too restrictive for many applications. This leads to a study of a range of pseudo-comonads and of how non-linear maps in their co-Kleisli bicategories preserve open maps and bisimulation. The pseudo-comonads considered are based on finite colimit completion, ‘lifting’, and indexed families. The paper includes an appendix summarising the key results on coends, left Kan extensions and the preservation of colimits. One motivation for this work is that it provides a mathematical framework for extending domain theory and denotational semantics of programming languages to the more intricate models, languages and equivalences found in concurrent computation, but the results are likely to have more general applicability because of the ubiquitous nature of profunctors.
NSPRING: Normalization-supported SPRING for subsequence matching on time series streams

Mining sequences and patterns in time series data streams have a tremendous growth of interest in todays world. The rapid progress of data collection and the web technologies yield tremendous growth of flowing data in various complex forms that need to be analyzed on fly. Traditional data mining methods typically that require to process data by scanning it multiple times are infeasible for stream data applications. However, new techniques like SPRING attempts to solve these challenges by identifying sequences of patterns on time series streams, whose time and space complexity are linear. Unfortunately, SPRING does not support normalization. As many researchers accepted that normalization is necessary, so SPRING is not applicable for most data sets. In this paper, we are proposing an approach called NSPRING based on SPRING. NSPRING extends the advantages of SPRING, e.g. low in time and space complexity, while it can support normalization. More interestingly, NSPRING retains similar mining accuracy to SPRING.
An Intelligent Lightweight Intrusion Detection System with Forensics Technique

This paper presents an intelligent lightweight IDS, which used the forensics technique to profile the user behavior in order to automate the maintenance of user profile, data mining technique to find out the cooperative attack, and watermark technique to trace back the hackers or intruders. The goal of the system is to detect the intrusion real-time, effectively and efficiently.
Optimal pilot design for MIMO-OFDM system channel estimation in time domain

In this paper, we propose a least squares (LS) channel estimation scheme in time domain for MIMO-OFDM systems based on pilot tones. The basic idea is that time-domain signals generated by pilots of transmitter and receiver are used to estimate the time-domain channel responses. Optimal pilot sequences (OPS) with regard to (w.r.t) the mean square error (MSE) of LS channel estimation are also presented; It is shown that the OPS are equipowered, equispaced, and position orthogonal. The maximum guard bandwidth (MGB) w.r. t MSE is introduced, as virtual subcarriers are not used for transmission. If the guard bandwidth of MIMO-OFDM system is less than or equal to the MGB, the OPS can be avoided from the guard band by adjusting initial position of OPS. Through simulations, it is shown that the OPS derived in this paper outperform conventional OPS in terms of MGB and MSE.
The effects of workspace awareness support on the usability of real-time distributed groupware

Real-time collaboration in current distributed groupware workspaces is often an awkward and clumsy process. We hypothesize that better support for workspace awareness —the understanding of who is in the workspace, where they are working, and what they are doing—can improve the usability of these shared computational workspaces. We conducted an experiment that compared people’s performance on two versions of a groupware interface. The interfaces used workspace miniatures to provide different levels of support for workspace awareness. The basic miniature showed information only about the local user, and the enhanced miniature showed the location and activity of other people in the workspace as well. We examined five aspects of groupware usability: task completion times, communication efficiency, the participants’ perceived-effort, overall preference, and strategy use. In two of three task types tested, completion times were lower in the awareness-enhanced system, and in one task type, communication was more efficient. The additional awareness information also allowed people to use different and more effective strategies to complete the tasks. Participants greatly preferred the awareness-enhanced system. The study provides empirical evidence that support for workspace awareness improves the usability of groupware, and uncovers some of the reasons underlying this improvement.
Personality in Computational Advertising: A Benchmark

In the last decade, new ways of shopping online have increased the possibility of buying products and services more easily and faster than ever. In this new context, personality is a key determinant in the decision making of the consumer when shopping. A person’s buying choices are influenced by psychological factors like impulsiveness; indeed some consumers may be more susceptible to making impulse purchases than others. Since affective metadata are more closely related to the user’s experience than generic parameters, accurate predictions reveal important aspects of user’s attitudes, social life, including attitude of others and social identity. This work proposes a highly innovative research that uses a personality perspective to determine the unique associations among the consumer’s buying tendency and advert recommendations. In fact, the lack of a publicly available benchmark for computational advertising do not allow both the exploration of this intriguing research direction and the evaluation of recent algorithms. We present the ADS Dataset, a publicly available benchmark consisting of 300 real advertisements (i.e., Rich Media Ads, Image Ads, Text Ads) rated by 120 unacquainted individuals, enriched with Big-Five users’ personality factors and 1,200 personal users’ pictures.
Direct Hallucination: Direct Locality Preserving Projections (DLPP) for Face Super-Resolution

Faces captured by surveillance cameras are often of very low resolution. This significantly deteriorates face recognition performance. Super-resolution techniques have been proposed in the past to mitigate this. This paper proposes the novel use of a Locality Preserving Projections (LPP) algorithm called Direct Locality Preserving Projections (DLPP) for super resolution of facial images, or ldquoface hallucinationrdquo in other words. Because DLPP doesnpsilat require any dimensionality reduction preprocessing via Principle Component Analysis (PCA), it retains more discriminating power in its feature space than LPP. Combined with non-parametric regression using a generalized regression neural network (GRNN), the proposed work can render high-resolution face image from an image of resolution as low as 8x7 with a large zoom factor of 24. The resulting technique is powerful and efficient in synthesizing faces similar to ground-truth faces. Simulation results show superior results compared to other well-known schemes.
Discovery of an X-Ray-luminous Galaxy Cluster at z = 1.4

We report the discovery of a massive, X-ray-luminous cluster of galaxies at z = 1.393, the most distant X-ray-selected cluster found to date. XMMU J2235.3-2557 was serendipitously detected as an extended X-ray source in an archival XMM-Newton observation of NGC 7314. VLT FORS2 R- and z-band snapshot imaging reveals an overdensity of red galaxies in both angular and color spaces. The galaxy enhancement is coincident in the sky with the X-ray emission; the cluster red sequence at R-z ≃ 2.1 identifies it as a high-redshift candidate. Subsequent FORS2 multiobject spectroscopy unambiguously confirms the presence of a massive cluster based on 12 concordant redshifts in the interval 1.38 < z < 1.40. The preliminary cluster velocity dispersion is 762 ± 265 km s-1. VLT ISAAC Ks- and J-band images underscore the rich distribution of red galaxies associated with the cluster. Based on a 45 ks XMM-Newton observation, we find that the cluster has an aperture-corrected unabsorbed X-ray flux of fX = (3.6 ± 0.3) × 10-14 ergs cm-2 s-1, a rest-frame X-ray luminosity of LX = (3.0 ± 0.2) × 1044 h ergs s-1 (0.5-2.0 keV), and a temperature of kT = 6.0 keV. Though XMMU J2235.3-2557 is likely the first confirmed z > 1 cluster found with XMM-Newton, the relative ease and efficiency of discovery demonstrates that it should be possible to build large samples of z > 1 clusters through the joint use of X-ray and large ground-based telescopes.
Real--Time Generation of Fractal ATM Traffic: Model, Algorithm, and Implementation

This work presents a fractal traac model (Sup-FRP), a generation algorithm, and several numerical approximations employed for building a real-time fractal ATM traac generator module. It is one of many traac generation modules which are a part of a real-time traac generation and Quality of Service (QOS) monitoring system implemented on NYNET. Such a system is essential for assessing key information on the QOS variations of real-time traac in operational ATM networks under diverse scenarios of network load. Incorporating a fast, accurate, and exible fractal traac generator into this monitoring system has become urgent by recent ndings of the fractal nature of LAN, WAN, and compressed video traac. The fractal module employs the Sup-FRP model 7] which permits fast generation and exibility due to its simplicity and ability to specify mean rate, variance, and the Hurst parameter independently. The generation speed is further increased by incorporating three numerical approximation techniques: integer, interpolation, and table approximations. These approximations, described in a great detail, eliminate CPU-intensive computations such as oating-point operation and logarithmic, exponential, and power functions, and thus reduce a considerable amount of computing burden of the system. It is shown that the numerical approximations yield 15-25% speed improvement with only marginal impact on the accuracy. Simulations and live experiments with a broad range of model parameters show that the fractal module produces fractal ATM cell streams with desirable fractal properties at very high bit rates (10-25 Mbps) in real time, verifying that the designed fractal module is successful.
Price Convergence and Monetary Policy in United States Cities: A Cointegration Approach with Two Structural Breaks

United States 12 cities response to the shock from a city and from monetary policy. We found that the crisis of Bretton Woods System at 1968 and the oil crisis at 1974 are two structural breaks. We found 11 cointegrating vectors and 4 common stochastic trends. The price convergence of all cities is less than 5 years of half-lives when a shock occurs from its own cities, while this tends to have more than 5 years of half-lives when a shock happens from other cities. The interest rate is an effective tool for controlling cities' price in short run.
Application of Graph Theory in dynamic analysis of parameters of HAPF

Considering the influence of surge current and voltage flickering on the distribution power system induced by medium frequency arc furnaces, the Hybrid Active Power Filter (HAPF) is applied to suppress the harmonics and compensate reactive power of 10kV bus of a steel mill. In order to study superiority effect and stability of HAPF, the Graph Theory is used to analyze its complex topology. By Graph Theory (GT) the HAPF can be described by several nodes that are connected by the power flows. Considering the important effect of LCL-filter of APF for suppressing harmonics such as high-frequency switch harmonic, its parameters are calculated by derived dynamic differential equations. Simulation and actual measure results show that the idea of combining the Graph Theory with dynamics modeling method is an effective path to design HAPF.
New Compression Codes for Text Databases

Text databases are growing in the last years due to the widespread use of digital libraries, document databases and mainly because of the continuous growing of the Web. Compression comes up as an ideal solution that permits to reduce both storage requirements and input/output operations. Therefore, it is useful when transmitting data through a network. Even though compression appeared in the first half of the 20 century, in the last decade, new Huffman-based compression techniques appeared. Those techniques use words as the symbols to be compressed. They do not only improve the compression ratio obtained by other well-known methods (e.g. Ziv-Lempel), but also allow to efficiently perform searches inside the compressed text avoiding the need for decompression before the search. As a result, those searches are much faster than searches inside plain text. Following the idea of word-based compression, in this thesis, we developed four new compression techniques that make up a new family of compressors. They are based in the utilization of dense codes. Among these four techniques, the first two ones are semi-static techniques and the others are dynamic methods. They are called: End-Tagged Dense Code, (s, c)-Dense Code, Dynamic End-Tagged Dense Code, and Dynamic (s, c)-Dense Code. Moreover, in this thesis, we have implemented a first prototype of a word-based byte-oriented dynamic Huffman compressor. This technique was developed with the aim of having a competitive technique to compare against our two dynamic methods. Our empirical results, obtained from the systematic empirical validation of our compressors in real corpora, show that our techniques become a fundamental contribution in the area of compression. Since these techniques compress more, and more efficiently than other widely used compressors (e.g. gzip, compress, etc.), they can be applied to both Text Retrieval systems and to systems oriented to data transmission. It is remarkable that the research done in this thesis introduces a new family of compressors that is based on the use of dense codes. Even though we have only explored the beginning of this new family, the obtained results are so good that we hope that future works permit us to develop more compressors from this family.
Foreign Direct Investment Understanding What Motivates Fdi by Mnes

Foreign direct investment (FDI) occurs when an individual or firm acquires controlling interest in productive assets of another country. We review the literature on FDI which can be divided into two broad categories. The first is the inquiry into why multinational production occurs and the factors that determine the patterns of worldwide FDI. The second is the impact that FDI and MNEs have on the parent and host countries, including economic growth, returns to factors of production, and externalities.
Modeling pinchoff and reconnection in a Hele-Shaw cell. I. The models and their calibration

This is the first paper in a two-part series in which we analyze two model systems to study pinchoff and reconnection in binary fluid flow in a Hele-Shaw cell with arbitrary density and viscosity contrast between the components. The systems stem from a simplification of a general system of equations governing the motion of a binary fluid (NSCH model [Lowengrub and Truskinovsky, Proc. R. Soc. London, Ser. A 454, 2617 (1998)]) to flow in a Hele-Shaw cell. The system takes into account the chemical diffusivity between different components of a fluid mixture and the reactive stresses induced by inhomogeneity. In one of the systems we consider (HSCH), the binary fluid may be compressible due to diffusion. In the other system (BHSCH), a Boussinesq approximation is used and the fluid is incompressible. In this paper, we motivate, present and calibrate the HSCH/BHSCH equations so as to yield the classical sharp interface model as a limiting case. We then analyze their equilibria, one dimensional evolution and linear stability. In the second paper [paper II, Phys. Fluids 14, 514 (2002)], we analyze the behavior of the models in the fully nonlinear regime. In the BHSCH system, the equilibrium concentration profile is obtained using the classical Maxwell construction [Rowlinson and Widom, Molecular Theory of Capillarity (Clarendon, Oxford, 1979)] and does not depend on the orientation of the gravitational field. We find that the equilibria in the HSCH model are somewhat surprising as the gravitational field actually affects the internal structure of an isolated interface by driving additional stratification of light and heavy fluids over that predicted in the Boussinesq case. A comparison of the linear growth rates indicates that the HSCH system is slightly more diffusive than the BHSCH system. In both, linear convergence to the sharp interface growth rates is observed in a parameter controlling the interface thickness. In addition, we identify the effect that each of the parameters, in the HSCH/BHSCH models, has on the linear growth rates. We then show how this analysis may be used to suggest a set of modified parameters which, when used in the HSCH/BHSCH systems, yield improved agreement with the sharp interface model at a finite interface thickness. Evidence of this improved agreement may be found in paper II.
A robust partial least squares regression method with applications

Partial least squares (PLS) regression is a linear regression technique developed to relate many regressors to one or several response variables. Robust methods are introduced to reduce or remove the effect of outlying data points. In this paper, we show that if the sample covariance matrix is properly robustified further robustification of the linear regression steps of the PLS algorithm becomes unnecessary. The robust estimate of the covariance matrix is computed by searching for outliers in univariate projections of the data on a combination of random directions (Stahel—Donoho) and specific directions obtained by maximizing and minimizing the kurtosis coefficient of the projected data, as proposed by Peña and Prieto [1]. It is shown that this procedure is fast to apply and provides better results than other methods proposed in the literature. Its performance is illustrated by Monte Carlo and by an example, where the algorithm is able to show features of the data which were undetected by previous methods. Copyright © 2008 John Wiley & Sons, Ltd.
Direct and Inverted Repeats Elicit Genetic Instability by Both Exploiting and Eluding DNA Double-Strand Break Repair Systems in Mycobacteria

Repetitive DNA sequences with the potential to form alternative DNA conformations, such as slipped structures and cruciforms, can induce genetic instability by promoting replication errors and by serving as a substrate for DNA repair proteins, which may lead to DNA double-strand breaks (DSBs). However, the contribution of each of the DSB repair pathways, homologous recombination (HR), non-homologous end-joining (NHEJ) and single-strand annealing (SSA), to this sort of genetic instability is not fully understood. Herein, we assessed the genome-wide distribution of repetitive DNA sequences in the Mycobacterium smegmatis, Mycobacterium tuberculosis and Escherichia coli genomes, and determined the types and frequencies of genetic instability induced by direct and inverted repeats, both in the presence and in the absence of HR, NHEJ, and SSA. All three genomes are strongly enriched in direct repeats and modestly enriched in inverted repeats. When using chromosomally integrated constructs in M. smegmatis, direct repeats induced the perfect deletion of their intervening sequences ∼1,000-fold above background. Absence of HR further enhanced these perfect deletions, whereas absence of NHEJ or SSA had no influence, suggesting compromised replication fidelity. In contrast, inverted repeats induced perfect deletions only in the absence of SSA. Both direct and inverted repeats stimulated excision of the constructs from the attB integration sites independently of HR, NHEJ, or SSA. With episomal constructs, direct and inverted repeats triggered DNA instability by activating nucleolytic activity, and absence of the DSB repair pathways (in the order NHEJ>HR>SSA) exacerbated this instability. Thus, direct and inverted repeats may elicit genetic instability in mycobacteria by 1) directly interfering with replication fidelity, 2) stimulating the three main DSB repair pathways, and 3) enticing L5 site-specific recombination.