Miracle-dz/UniFAR-FTUs huggingface dataset:
Magnetic Field Seeding by Galactic Winds

The origin of intergalactic magnetic fields is still a mystery and several scenarios have been proposed so far: among them, primordial phase transitions, structure-formation shocks and galactic outflows. In this work, we investigate how efficiently galactic winds can provide an intense and widespread 'seed' magnetization. This may be used to explain the magnetic fields observed today in clusters of galaxies and in the intergalactic medium (IGM). We use semi-analytic simulations of magnetized galactic winds coupled to high-resolution N-body simulations of structure formation to estimate lower and upper limits for the fraction of the IGM which can be magnetized up to a specified level. We find that galactic winds are able to seed a substantial fraction of the cosmic volume with magnetic fields. Most regions affected by winds have magnetic fields in the range 10 -12 < B < 10 -8 G, while higher seed fields can be obtained only rarely and in close proximity to wind-blowing galaxies. These seed fields are sufficiently intense for a moderately efficient turbulent dynamo to amplify them to the observed values. The volume-filling factor of the magnetized regions strongly depends on the efficiency of winds to load mass from the ambient medium. However, winds never completely fill the whole Universe and pristine gas can be found in cosmic voids and regions unaffected by feedback even at z = 0. This means that, in principle, there might be the possibility to probe the existence of primordial magnetic fields in such regions.
Physical Activity, Sedentary Behaviour and Metabolic Control following Stroke: A Cross-Sectional and Longitudinal Study

Background Physical activity and sedentary behaviour are key moderators of cardiovascular disease risk and metabolic control. Despite the importance of a physically active lifestyle, little is known about the effects of stroke on physical activity. We assessed physical activity and sedentary behaviour at three time points following stroke compared to a healthy control group. Methods Physical activity and sedentary behaviour were objectively measured using a portable multi-sensor array in 31 stroke participants (73±9 years, National Institute of Health Stroke Scale 2±2, mobile 10 metres with/without aid) within seven days and at three and six months. Stroke data were compared with an age, sex and body mass index matched healthy control group (n = 31). Results Within seven days of stroke, total energy expenditure and physical activity were significantly lower and sedentary time higher in the stroke group compared to controls (total energy expenditure 1840±354 vs. 2220±489 kcal, physical activity 28±32 vs. 79±46 min/day, steps 3111±2290 vs. 7996±2649, sedentary time 1383±42 vs. 1339±44 min/day, p<0.01). At three months physical activity levels had increased (64±58 min/day) but plateaued by six months (66±68 min/day). Conclusions Physical activity levels are reduced immediately post-stroke and remain below recommended levels for health and wellbeing at the three and six month time points. Clinicians should explore methods to increase physical activity and reduce sedentary behaviour in both the acute and later stages following stroke.
Comparison of Three Methods for Measurement of HbA1c

Aim: To compare three methods for measurement of blood HbA1c as to reliability, ease and time consumption. ” Method: Measurements of HbA1c were made in blood from 120 patients with pre-diabetes and diabetes using a turbidimetric inhibition immunoassay (TINIA), which also required measurement of total hemoglobin, a particle-enhanced immunoturbidimetric assay (PEITT) without measurement of total hemoglobin, and high performance liquid chromatography (HPLC). Results: There was good concordance between results of PEITT and HPLC methods (r = 0.9401, p<0.0001 and by Deming Regression; y = 0.9978x + 0.24). The average HbA1c (7.52±1.40 %) measured by HPLC was higher than the other methods (TINIA: 7.12±1.66 % and PEITT: 7.26±1.39 %, p<0.0001). The measured total time spent on 120 samples was 45 min. for TINIA, 39 min. for PEITT and 384 min. for HPLC. Conclusion: It has been found that, the PEITT method, which is reliable, faster, and easier to perform, can be used as an alternative to TINIA and HPLC measuring system within the known imprecision limits. ”
M. Theory

This contribution gives a personal view on recent attempts to find a unified framework for non-perturbative string theories, with special emphasis on the hidden symmetries of supergravity and their possible role in this endeavor. A reformulation of d = 11 supergravity with enlarged tangent space symmetry SO(1, 2) × SO(16) is discussed from this perspective, as well as an ansatz to construct yet further versions with SO(1, 1)× SO(16) and possibly even SO(1, 1)+ × ISO(16) tangent space symmetry. It is suggested that upon “third quantization”, dimensionally reduced maximal supergravity may have an equally important role to play in this unification as the dimensionally reduced maximally supersymmetric SU(∞) Yang Mills theory.
Mixed Convection Flow of Viscoelastic Fluid by a Stretching Cylinder with Heat Transfer

Flow of viscoelastic fluid due to an impermeable stretching cylinder is discussed. Effects of mixed convection and variable thermal conductivity are present. Thermal conductivity is taken temperature dependent. Nonlinear partial differential system is reduced into the nonlinear ordinary differential system. Resulting nonlinear system is computed for the convergent series solutions. Numerical values of skin friction coefficient and Nusselt number are computed and discussed. The results obtained with the current method are in agreement with previous studies using other methods as well as theoretical ideas. Physical interpretation reflecting the contribution of influential parameters in the present flow is presented. It is hoped that present study serves as a stimulus for modeling further stretching flows especially in polymeric and paper production processes.
Influence of the rate of contrast change on the quality of contrast sensitivity assessment: a comparison of three psychophysical methods

Criterion‐free forced‐choice procedures for measuring contrast sensitivity with a cathode ray tube (CRT) have low within‐subject, intersubject, and test–retest variabilities, but a long test time compared with psychophysical methods that rely on the subject's criterion to determine threshold. Test time and variability of criterion‐dependent methods depend on the rate at which the contrast changes on the CRT display. This study compared two criterion‐dependent psychophysical methods for measuring contrast sensitivity (the method of increasing contrast and the von Békésy tracking method) with a criterion‐free two‐alternative forced‐choice procedure. A range of rates of contrast change was studied: 0.1, 0.3, 0.5, 0.7 and 1.0 log unit s−1. Contrast sensitivity, within‐subject variability, intersubject variability, test–retest variability, and test time of the three methods were compared. The 2‐AFC procedure performed best with regard to within‐subject, intersubject, and test–retest variabilities. A time‐efficient alternative was the von Békésy tracking method at rates between 0.1 and 0.5 log unit s−1.
Nearly Recurrent Components in 3D Piecewise Constant Vector Fields

We present an algorithm for computing nearly recurrent components, that represent areas of close to circulating or stagnant flow, for 3D piecewise constant (PC) vector fields defined on regular grids. Using a number of analytical and simulated data sets, we demonstrate that nearly recurrent components can provide interesting insight into the topological structure of 3D vector fields.
Countering anti-forensics to wavelet-based compression

Wavelet-based compression is widely used to reduce image redundancy for efficiently storing and transmitting the data. Thus it is an important part in digital image forensics to trace the wavelet-based image compression history. The wavelet-based compression leaves comb-like quantization artifacts in the DWT (Discrete Wavelet Transform) histogram, which however can be disguised using a proper dithering operation. In this paper, standing on the forensic side, we study the joint histogram of DWT coefficients across different levels, whose pattern is robust across a wide range of natural uncompressed images but can be easily destroyed by the wavelet-based compression or the dithering operation used for anti-forensic purposes. By applying the Hough transform to the joint DWT histogram, we derive a 12-dimensional feature vector and a merged discriminating feature. Experimental results demonstrate the effectiveness of the proposed method for differentiating uncompressed images from (anti-forensic) wavelet-based compressed images.
Predicting protein interactions via parsimonious network history inference

Motivation: Reconstruction of the network-level evolutionary history of protein–protein interactions provides a principled way to relate interactions in several present-day networks. Here, we present a general framework for inferring such histories and demonstrate how it can be used to determine what interactions existed in the ancestral networks, which present-day interactions we might expect to exist based on evolutionary evidence and what information extant networks contain about the order of ancestral protein duplications. Results: Our framework characterizes the space of likely parsimonious network histories. It results in a structure that can be used to find probabilities for a number of events associated with the histories. The framework is based on a directed hypergraph formulation of dynamic programming that we extend to enumerate many optimal and near-optimal solutions. The algorithm is applied to reconstructing ancestral interactions among bZIP transcription factors, imputing missing present-day interactions among the bZIPs and among proteins from five herpes viruses, and determining relative protein duplication order in the bZIP family. Our approach more accurately reconstructs ancestral interactions than existing approaches. In cross-validation tests, we find that our approach ranks the majority of the left-out present-day interactions among the top 2 and 17% of possible edges for the bZIP and herpes networks, respectively, making it a competitive approach for edge imputation. It also estimates relative bZIP protein duplication orders, using only interaction data and phylogenetic tree topology, which are significantly correlated with sequence-based estimates. Availability: The algorithm is implemented in C++, is open source and is available at http://www.cs.cmu.edu/ckingsf/software/parana2. Contact: robp@cs.cmu.edu or carlk@cs.cmu.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Relaxations of the Cutting Plane Method for Quadratic Semi-innnite Programming

This paper studies the cutting plane method for solving quadratic semi-innnite programming problems. Several relaxation techniques and their combinations are proposed and discussed. A exible convergence proof is provided to cover diierent settings. The implementation issues are addressed with some numerical experiments to illustrate the computational behavior of each diierent combination scheme.
Network mobility support in distributed ID/locator separation architectures

Recently distributed mobility management (DMM) in ID/locator separation architectures has been widely investigated to provide load balanced and scalable mobility services. However, it has drawbacks in terms of the network mobility (NEMO) support since IDs cannot be aggregated. In this paper, a novel network mobility support protocol is proposed in a distributed ID/locator separation architecture. In the proposed protocol, a mobile router sends an aggregate location update message on the behalf of multiple mobile nodes and thus the signaling overhead and delay can be significantly reduced.
Feasibility of ultrasound positioning based on signal strength

The objective of this paper is to analyze the performance of an indoor positioning system based on the ultrasound level, usually called RSSI (received signal strength indicator). This paper builds on past experiences where RSSI values from beams sent in different directions were compared [1]. There relative values of RSSI were measured but herein we go one step further and perform localization based on absolute values of RSSI. The use of RSSI could potentially mean a simplification of the traditional positioning systems design in relation to other methods such as TOF (time-of-flight), being an alternative and interesting method for positioning. The distance between nodes (transmitter and receiver) is estimated from RSSI values using a signal propagation model in which the power losses due to the spherical divergence and atmospheric absorption are considered. However, in real conditions, other factors related to the characteristics of the nodes have their impact on RSSI measurements. One of them has to do with the beamwidth of the transducers. The signal strength will be conditioned by the angle of incidence of the transducers when these have a narrow beamwidth. On the other hand, the common use of wireless nodes in the deployment of these systems leads to the RSSI measurement to be affected by the battery level in the nodes. These effects introduce significant errors in the distance estimation and therefore on the localization precision. Herein we propose a mechanism for modeling the power loss due to the orientation of the ultrasonic transducers, as well as an algorithm to compensate for the effect of the variations in the battery level on RSSI measurements. Some experimental results have been obtained with 5 nodes (4 transmitters and 1 receiver) to show the quality of our compensation using a real positioning system. Location errors smaller than 10 cm for each coordinate are obtained in contrast to errors of several meters which are normally attained in this kind of systems based on RF (radio frequency) RSSI-values.
Parallel visualization algorithms: performance and architectural implications

Recently, a new class of scalable, shared-address-space multiprocessors has emerged. Like message-passing machines, these multiprocessors have a distributed interconnection network and physically distributed main memory. However, they provide hardware support for efficient implicit communication through a shared address space, and they automatically exploit temporal locality by caching both local and remote data in a processor's hardware cache. In this article, we show that these architectural characteristics make it much easier to obtain very good speedups on the best known visualization algorithms. Simple and natural parallelizations work very well, the sequential implementations do not have to be fundamentally restructured, and the high degree of temporal locality obviates the need for explicit data distribution and communication management. We demonstrate our claims through parallel versions of three state-of-the-art algorithms: a recent hierarchical radiosity algorithm by Hanrahan et al. (1991), a parallelized ray-casting volume renderer by Levoy (1992), and an optimized ray-tracer by Spach and Pulleyblank (1992). We also discuss a new shear-warp volume rendering algorithm that provides the first demonstration of interactive frame rates for a 256/spl times/256/spl times/256 voxel data set on a general-purpose multiprocessor. <<ETX>>
Mining System for Community Finding and Centrality of Virtual User Network on the Internet

Community finding of virtual user network on the Internet has provoked more and more researchers' interests in the field of computer and physics field recently. Existed results focus on how to seek a reasonable and feasible algorithm to find the communities of virtual user network mostly, but scarcely relate to the centrality of those found communities. In addition, the centrality of those found communities is usually not involved. In this paper, the topology of virtual user network is analyzed firstly, and it shows that the network has a scale-free characteristic. The straightforward and effective criterion evaluating the correctness to detect the community structure has been established. Then the mining system for community finding and centrality of the network is designed and its workflow is presented. Two key modules of this system, community finding module and centrality module, are studied in detail. An implementation example is given to verify the validity of the design. Finally, the paper is summarized
Infrared thermography detects febrile and behavioural responses to vaccination of weaned piglets

An automated, non-invasive system for monitoring of thermoregulation has the potential to mitigate swine diseases through earlier detection. Measurement of radiated temperature of groups of animals by infrared thermography (IRT) is an essential component of such a system. This study reports on the feasibility of monitoring the radiated temperature of groups of animals as a biomarker of immune response using vaccination as a model for febrile disease. In Study A, weaned pigs were either treated with an intramuscular vaccine (FarrowSure Gold), a sham injection of 0.9% saline or left as untreated controls. An infrared thermal camera (FLIR A320) was fixed to the ceiling directly above the pen of animals, and recorded infrared images of the treatment groups at 5 min intervals. The effect on temperature of the spatial distribution of pigs within the pen was significant, with higher temperatures recorded when pigs were grouped together into a single cluster. A higher frequency of clustering behaviour was observed in vaccinated animals compared with controls during a period of the afternoon ~4 to 7 h post-vaccination. The daily mean of the maximum image temperature was significantly higher in vaccinated animals compared with control and sham-treated animals. In the vaccination treated group, the 24 h mean of the maximum temperature was significantly higher during the post-vaccination period compared with the 24 h period before vaccination. Increased temperature in the vaccinated animals occurred from ~3 h, peaked at ~10 h, and remained elevated for up to 20 h post-vaccination. In Study B, the effect of prevalence was tested in terms of the difference in maximum temperature between control and vaccination days. A thermal response to vaccination was detected in a pen of 24 to 26 animals when <10% of the animals were vaccinated. The results support the concept of radiated temperature measurements of groups of animals by IRT as a screening tool for febrile diseases in pig barns.
Statistical Object Recognition with the Expectation-Maximization Algorithm in Range-Derived Features

An extension to the alignment approach is proposed that includes a pose reenement step before veriication. In the alignment approach the pose estimates of the initial hypotheses tend to be somewhat inaccurate, since they are based on minimal sets of corresponding features. A method is described that reenes the pose estimate while simultaneously identifying and incorporating the constraints of all supporting image features. The strategy also makes practical initial alignments based on low resolution features { which, being less numerous, allow faster running times. Two statistical formulations of model-based recognition are described: MAP Model Matching, and Posterior Marginal Pose Estimation (PMPE). These formulations use a normal model for feature uctuations. Empirical evidence is provided from the domain of video edge features indicating that normal probability densities are good models of feature uctuations { better than uniform densities in that domain. The evidence is provided in the form of observed and tted cumulative distributions. The results of some statistical tests are reported. The Expectation { Maximization (EM) algorithm is discussed as a method of carrying out local searches in pose space of the PMPE objective function. A recognition experiment is described where the method is used with features derived from synthetic range images.
Operating System Scheduling On Heterogeneous Core Systems

We make a case that thread schedulers for heterogeneous multicore systems should balance between three objectives: optimal performance, fair CPU sharing, and balanced core assignment. Thread-to-core assignment algorithms that optimize performance have been proposed in the past; in this paper we argue that they may conflict with the enforcement of fair CPU sharing. We also demonstrate the need for balanced core assignment: an unbalanced core assignment results in completion time jitter and inconsistent priority enforcement. We present a blueprint for a scheduling framework that balances between these three objectives. The framework consists of three components: performance-optimizing component, fairness component, and core balance component. While the performance-optimizing component could implement any previously proposed performanceoptimizing algorithm, we propose a new algorithm based on reinforcement learning (RL). Our RL algorithm takes into account cache affinity, unlike previously proposed algorithms. Implementing and evaluating this framework and the RL algorithm is the subject of future work.
An overview of neural networks use in anomaly Intrusion Detection Systems

With the increasing number of computers being connected to the Internet, security of an information system has never been more urgent. Because no system can be absolutely secure, the timely and accurate detection of intrusions is necessary. This is the reason of an entire area of research, called Intrusion Detection Systems (IDS). Anomaly systems detect intrusions by searching for an abnormal system activity. But the main problem of anomaly detection IDS is that; it is very difficult to build, because of the difficulty in defining what is normal and what is abnormal. Neural network with its ability of learning has become one of the most promising techniques to solve this problem. This paper presents an overview of neural networks and their use in building anomaly intrusion systems.
Long-Lived Scattering Resonances and Bragg Structures

We consider a system governed by the wave equation with index of refraction $n({\bf x})$, taken to be variable within a bounded region $\Omega\subset \mathbb R^d$ and constant in $\mathbb R^d \setminus \Omega$. The solution of the time-dependent wave equation with initial data, which is localized in $\Omega$, spreads and decays with advancing time. This rate of decay can be measured (for $d=1,3$, and more generally, $d$ odd) in terms of the eigenvalues of the scattering resonance problem, a non--self-adjoint eigenvalue problem governing the time-harmonic solutions of the wave (Helmholtz) equation which are outgoing at $\infty$. Specifically, the rate of energy escape from $\Omega$ is governed by the complex scattering eigenfrequency, which is closest to the real axis. We study the structural design problem: Find a refractive index profile $n_\star({\bf x})$ within an admissible class which has a scattering frequency with minimal imaginary part. The admissible class is defined in terms of the compact suppo.