Miracle-dz/UniFAR-FTUs huggingface dataset:
Whole-Body Strength Training Using a Huber Motion Lab in Coronary Heart Disease Patients: Safety, Tolerance, Fuel Selection, and Energy Expenditure Aspects and Optimization

Objective The aim of this study was to investigate safety, tolerance, relative exercise intensity, and muscle substrate oxidation during sessions performed on a Huber Motion Lab in coronary heart disease patients. Design After an assessment of V˙o2 peak, 20 coronary heart disease patients participated in two different exercises performed in random order at 40% and 70% (W40 and W70) of the maximal isometric voluntary contraction. Results No significant arrhythmia or abnormal blood pressure responses occurred during either session, and no muscle soreness was reported within 48 hrs posttest. The authors found a difference between W40 and W70 sessions for mean (standard deviation) ventilation (25.1% [8%] and 32.1% [9%] of maximal ventilation, respectively; P = 0.04) and a small difference for mean (standard deviation) heart rate (73 [7] and 79 [8] beats/min, respectively; P < 0.01). When compared with the W40, the W70 was associated with higher active energy expenditure (2.4 [0.6] and 3.1 [0.9] Kcal/min, respectively; P < 0.0001) and a similar mean (standard deviation) oxygen uptake (5.5 [1] and 6.6 [1] ml/min per kilogram, respectively; P = 0.07). The qualitative percentages of carbohydrates and lipids oxidized were 71% and 29%, respectively, at W40 and 91% and 9%, respectively, at W70. Conclusions Both protocols, which consisted of repeating 6-sec phases of contractions with 10 secs of passive recovery on the Huber Motion Lab, seemed to be well tolerated, safe, and feasible in this group of coronary heart disease patients.
Exploiting Dynamic Information in IDEs Improves Speed and Correctness of Software Maintenance Tasks

Modern IDEs such as Eclipse offer static views of the source code, but such views ignore information about the runtime behavior of software systems. Since typical object-oriented systems make heavy use of polymorphism and dynamic binding, static views will miss key information about the runtime architecture. In this paper, we present an approach to gather and integrate dynamic information in the Eclipse IDE with the goal of better supporting typical software maintenance activities. By means of a controlled experiment with 30 professional developers, we show that for typical software maintenance tasks, integrating dynamic information into the Eclipse IDE yields a significant 17.5 percent decrease of time spent while significantly increasing the correctness of the solutions by 33.5 percent. We also provide a comprehensive performance evaluation of our approach.
Origin and Ramification Pattern of the lateral Femoral Cutaneous Nerve : A Case Report and Neurosurgical Considerations Lateral femoral

Variations in the anatomy of the lateral femoral cutaneous nerve (LFCN) have been reported in the literature. LFCN is vulnerable to injury during several surgical operations, therefore any surgeon intervening in the area should be familiar to its topographic variability. Lesion of the nerve leads to a condition known as “meralgia paresthetica”. We present a cadaveric case of a variant LFCN where two LFCN branches were encountered arising from the lumbar plexus. In specific the anterior LFCN branch originated from the femoral nerve, whereas at the level of the inguinal ligament, four nerve branches were present. The existence of multiple LFCN branches could lead to diagnostic confusion in case of “meralgia paresthetica”, while if the neurosurgeon is not aware of the potential variability during surgical decompression of the nerve, postoperative complications may occur. The supernumerary LFCN branches could be identified by ultrasound imaging and be used as optimum vascularized grafts for sensory nerve repair. KeywOrds: Lateral femoral cutaneous nerve, Multiple branches, Origin, Femoral nerve, Meralgia paresthetica, Nerve grafting
Millisecond by Millisecond, Year by Year: Normative EEG Microstates and Developmental Stages

Most studies of continuous EEG data have used frequency transformation, which allows the quantification of brain states that vary over seconds. For the analysis of shorter, transient EEG events, it is possible to identify and quantify brain electric microstates as subsecond time epochs with stable field topography. These microstates may correspond to basic building blocks of human information processing. Microstate analysis yields a compact and comprehensive repertoire of short lasting classes of brain topographic maps, which may be considered to reflect global functional states. Each microstate class is described by topography, mean duration, frequency of occurrence and percentage analysis time occupied. This paper presents normative microstate data for resting EEG obtained from a database of 496 subjects between the age of 6 and 80 years. The extracted microstate variables showed a lawful, complex evolution with age. The pattern of changes with age is compatible with the existence of developmental stages as claimed by developmental psychologists. The results are discussed in the framework of state dependent information processing and suggest the existence of biologically predetermined top-down processes that bias brain electric activity to functional states appropriate for age-specific learning and behavior.
Retrieval of height and topography of corn fields by polarimetric SAR interferometry

Polarimetric SAR interferometry (Pol-InSAR) has been applied successfully to retrieve biophysical parameters from forest areas. This technique employs a scene model composed of a random volume over the ground. However, that model is based on the assumption that the wave propagation through the vegetation canopy is independent of polarization, which is not valid for agricultural crops because the medium shows a strong anisotropic behavior. In this work we have studied the implications of the polarization dependence of the extinction coefficients, and a redefinition of the line fit inversion model is proposed and validated with indoor measurements. As we will show, provided that agricultural vegetation is short, the influence of the different extinction coefficient is minor. Consequently, it is demonstrated that an accurate inversion of the vegetation height and the underlying topography is still possible. However, it is also shown that the model is not sensitive to changes in the extinction coefficient, so this parameter is not well estimated. Implications about the necessity of fully or partially polarimetric data have been also analyzed
Temporal space variability for precipitation in the state of Pernambuco

This study aims to make a diagnostic analysis of rainfall at different time scales in the rainfall homogeneous regions of the state of Pernambuco and associate them with weather systems operating in the region. The state was divided into three geographical regions (HR) of rainfall regime, according to Ward's clustering method. In each RH applied to Wavelet Transform (TO) time series of 1995-2015 precipitation. The results showed that in all regions the dominant scale is annual. It is also observed the interaction with the semi-annual and seasonal scales mainly in RH2 and RH3 regions. The TO showed that high levels of rainfall in the regions are associated with different weather systems.
vDC: Virtual Data Center Powered with AS Alliance for Enabling Cost-Effective Business Continuity and Coverage

In the cloud computing era, cloud providers must design data centers that satisfy the requirements such as business continuity, coverage and performance, and cost-effectiveness for offering application providers the competitive hosting services. However, it is hard for even elephant cloud providers to satisfy these requirements all together because of the cost problem. In this paper, we propose the concept of virtual data center (vDC) of multiple geographically distributed data centers over the Internet to extend the coverage of hosting services in a cost-effective manner and apply the concept of AS alliance to ensure resilient connectivity of vDC to achieve high business continuity. We also introduce the detail design of AS alliance tailored for the vDC concept and conduct a feasibility study for making vDC connectivity robust.
Measurements of the Reaction-Diffusion Front of Model Chemically Amplified Photoresists with Varying Photoacid Size |

Neutron reflectivity and Fourier transform infrared spectroscopy measurements are used to profile the deprotection reaction−diffusion front with nanometer resolution in a model photoresist polymer using three perfluoroalkane-based photoacid generators (PAG) with varying chain lengths. As expected, the spatial extent of the deprotection reaction front increases with decreasing PAG size. Although the total extent of deprotection increases with increasing postexposure bake time for each PAG, the reaction−diffusion of deprotection does not propagate continuously into the photoresist polymer. The form of the deprotection reaction front changes because the diffusion process is affected by the changing polymer composition. The data are well described by a reaction−diffusion model that includes a simple acid-trapping term and does not require a varying PAG diffusivity. This high-resolution profiling, together with modeling, illustrates details of the coupled diffusion and deprotection reaction processes that affe.
Distributed Conformal Anomaly Detection

Conformal approach to anomaly detection was recently developed as a reliable framework of classifying examples into normal and abnormal groups based on a training data set containing only normal examples. Its validity property is that a normal example, generated by the same distribution as the examples from the training set, is classified as anomaly with probability bounded from above by a pre-selected significance level. Parallel processing of big data may require a split of the training set into several sources. We also assume that the collection of data for two or more sources might be done in parallel and the data distribution may differ for these sources. The contribution of this work to conformal anomaly detection is studying the ways of keeping conformal validity when the training set is obtained from heterogeneous (differently distributed) sources.
The Relationship Among Exposure to Stressful Life Events, Drug Use, and Violence Perpetration in a Sample of Native Hawaiian, Samoan, and Filipino Adolescents

This study examined the relationship between stressful life events, drug use, and self-reported violence perpetration among 293 Native Hawaiian, Samoan, and Filipino adolescents. Data were collected using semistructured interviews with students in three high schools in Hawai‘i. Stressful life events were delineated into three categories: transitions, discrete events, and victimization. Samoans reported more stressful life events than Native Hawaiians and/or Filipinos, depending on the subscale, but there were no sex differences in the stressful life events total scale or subscales. There were sex differences on several stressful life events items, including boys reporting more physical victimization and more life threatening illnesses and injuries than girls. Stressful life events were related to higher rates of violence perpetration for all groups, though specific types of events were significant for some groups but not others. Drug use moderated the influence of transitions on violent behaviors for boys and Samoan adolescents and also of discrete events on violence perpetration for Samoan adolescents. Additional research is needed to examine other risk factors, as well as types of protective factors that may moderate the relationship between life stressors and engaging in violent behaviors.
Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?

Cryptographic protocols for Private Set Intersection (PSI) are the basis for many important privacy-preserving applications. Over the past few years, intensive research has been devoted to designing custom protocols for PSI based on homomorphic encryption and other public-key techniques, apparently due to the belief that solutions using generic approaches would be impractical. This paper explores the validity of that belief. We develop three classes of protocols targeted to different set sizes and domains, all based on Yao’s generic garbled-circuit method. We then compare the performance of our protocols to the fastest custom PSI protocols in the literature. Our results show that a careful application of garbled circuits leads to solutions that can run on million-element sets on typical desktops, and that can be competitive with the fastest custom protocols. Moreover, generic protocols like ours can be used directly for performing more complex secure computations, something we demonstrate by adding a simple information-auditing mechanism to our PSI protocols.
Direct methods for visual scene reconstruction

There has been a lot of activity recently surrounding the reconstruction of photorealistic 3D scenes and high-resolution images from video sequences. We present some of our recent work in this area, which is based on the registration of multiple images (views) in a projective framework. Unlike most other techniques, we do not rely on special features to form a projective basis. Instead, we directly solve a least-squares estimation problem in the unknown structure and motion parameters, which leads to statistically optimal estimates. We discuss algorithms for both constructing planar and panoramic mosaics, and for projective depth recovery. We also speculate about the ultimate usefulness of projective approaches to visual scene reconstruction.
A Generalized Algorithm and Reconfigurable Architecture for Efficient and Scalable Orthogonal Approximation of DCT

Approximation of discrete cosine transform (DCT) is useful for reducing its computational complexity without significant impact on its coding performance. Most of the existing algorithms for approximation of the DCT target only the DCT of small transform lengths, and some of them are non-orthogonal. This paper presents a generalized recursive algorithm to obtain orthogonal approximation of DCT where an approximate DCT of length N could be derived from a pair of DCTs of length (N/2) at the cost of N additions for input preprocessing. We perform recursive sparse matrix decomposition and make use of the symmetries of DCT basis vectors for deriving the proposed approximation algorithm. Proposed algorithm is highly scalable for hardware as well as software implementation of DCT of higher lengths, and it can make use of the existing approximation of 8-point DCT to obtain approximate DCT of any power of two length, N > 8. We demonstrate that the proposed approximation of DCT provides comparable or better image and video compression performance than the existing approximation methods. It is shown that proposed algorithm involves lower arithmetic complexity compared with the other existing approximation algorithms. We have presented a fully scalable reconfigurable parallel architecture for the computation of approximate DCT based on the proposed algorithm. One uniquely interesting feature of the proposed design is that it could be configured for the computation of a 32-point DCT or for parallel computation of two 16-point DCTs or four 8-point DCTs with a marginal control overhead. The proposed architecture is found to offer many advantages in terms of hardware complexity, regularity and modularity. Experimental results obtained from FPGA implementation show the advantage of the proposed method.
Entailment Relations on Distributions

In this paper we give an overview of partial orders on the space of probability distributions that carry a notion of information content and serve as a generalisation of the Bayesian order given in (Coecke and Martin, 2011). We investigate what constraints are necessary in order to get a unique notion of information content. These partial orders can be used to give an ordering on words in vector space models of natural language meaning relating to the contexts in which words are used, which is useful for a notion of entailment and word disambiguation. The construction used also points towards a way to create orderings on the space of density operators which allow a more fine-grained study of entailment. The partial orders in this paper are directed complete and form domains in the sense of domain theory.
Adaptive rate network coding using raptor codes for large wireless relay networks

This paper studies a network coding scheme that exploits a cooperative diversity and adaptation to variant link states for reliable networks. We propose a scheme, adaptive rate network coding (ARNC), to change the number of transmission in relay nodes according to channel states over fading channels by matching network graphs with rateless code graphs, raptor codes. In ARNC scheme, a relay transmits potentially limitless coded symbols to a destination until receiving an ACK for a successful decoding, so the destination can recover the message from the network with high probability.
A strict Lyapunov function for boundary control of hyperbolic systems of conservation laws

We present a strict Lyapunov function for hyperbolic systems of conservation laws that can be diagonalised with Riemann invariants. The time derivative of this Lyapunov function can be made strictly definite negative by an appropriate choice of the boundary conditions. It is shown that the derived boundary control allows to guarantee the local convergence of the state towards a desired set point. Furthermore, the control can be implemented as a feedback of the state only measured at the boundaries. The control design method is illustrated with a hydraulic application, namely the level and flow regulation in a horizontal open channel.
Thrombopoietin Protects Against In Vitro and In Vivo Cardiotoxicity Induced by Doxorubicin

Background— Doxorubicin (DOX) is an important antineoplastic agent. However, the associated cardiotoxicity, possibly mediated by the production of reactive oxygen species, has remained a significant and dose-limiting clinical problem. Our hypothesis is that the hematopoietic/megakaryocytopoietic growth factor thrombopoietin (TPO) protects against DOX-induced cardiotoxicity and might involve antiapoptotic mechanism exerted on cardiomyocytes. Methods and Results— In vitro investigations on H9C2 cell line and spontaneously beating cells of primary, neonatal rat ventricle, as well as an in vivo study in a mouse model of DOX-induced acute cardiomyopathy, were performed. Our results showed that pretreatment with TPO significantly increased viability of DOX-injured H9C2 cells and beating rates of neonatal myocytes, with effects similar to those of dexrazoxane, a clinically approved cardiac protective agent. TPO ameliorated DOX-induced apoptosis of H9C2 cells as demonstrated by assays of annexin V, active caspase-3, and mitochondrial membrane potential. In the mouse model, administration of TPO (12.5 &mgr;g/kg IP for 3 alternate days) significantly reduced DOX-induced (20 mg/kg) cardiotoxicity, including low blood cell count, cardiomyocyte lesions (apoptosis, vacuolization, and myofibrillar loss), and animal mortality. Using Doppler echocardiography, we observed increased heart rate, fractional shortening, and cardiac output in animals pretreated with TPO compared with those receiving DOX alone. Conclusions— These data have provided the first evidence that TPO is a protective agent against DOX-induced cardiac injury. We propose to further explore an integrated program, incorporating TPO with other protocols, for treatment of DOX-induced cardiotoxicity and other forms of cardiomyopathy.
PeAgent - a mobile agent system to support secure Internet and Web applications

Many agent-based systems have been developed over the past decade; however, the security issues are usually not addressed adequately. In order to make the mobile agent paradigm more useful and acceptable for Web and Internet applications, the security considerations should go beyond the protection of basic agent execution environments. In this paper, we present the design of a robust Java-based mobile agent system, PeAgent. The PeAgent system not only incorporates a fine-grain agent privilege control mechanism, but also includes a multi-level protection mechanism that can be used throughout the life-cycle of agents. A two-level domain hierarchy is constructed to organize the large number of Internet nodes in the agent system into manageable units: the global/domain management unit (GMU/DMU). Each unit consists of a certification authority (CA) and a location manager (LM). The certificates issued from GMU and DMU define the access privileges on the PeAgent servers for each agent. A context hierarchy is built up on the PeAgent servers for fine-level resource access control and agent management. Overall, the PeAgent system provides a secure computing environment for widely distributed applications over a network of heterogeneous platforms. It also facilitates the development of secure Web-based applications.
Variability-selected Quasars behind the Small Magellanic Cloud

We present follow-up spectroscopic observations of quasar candidates in the Small Magellanic Cloud selected by L. Eyer from the OGLE database. Of 12 observed objects identified as "QSO candidates," five are confirmed as quasars, with emission redshifts ranging from 0.28 to 2.16. Two of these quasars were also recently identified independently in the MACHO database by Geha et al. We discuss the prospects of using the variability-based selection technique for quasar searches behind other dense stellar fields. An additional criterion utilizing a color-color diagram should reduce the number of stars in the candidate lists.
Programmer-friendly Decompiled Java

Java decompilers convert Java class files to Java source. Java class files may be created by a number of different tools including standard Java compilers, compilers for other languages such as AspectJ, or other tools such as optimizers or obfuscators. There are two kinds of Java decompilers, Javac-specific decompilers that assume that the class file was created by a standard Javac compiler and tool-independent decompilers that can decompile arbitrary class files, independent of the tool that created the class files. Typically Javac-specific decompilers produce more readable code, but they fail to decompile many class files produced by other tools. This paper tackles the problem of how to make a tool-independent decompiler, Dava, produce Java source code that is programmer-friendly. In past work it has been shown that Dava can decompile arbitrary class files, but often the output, although correct, is very different from what a programmer would write and is hard to understand. Furthermore, tools like obfuscators intentionally confuse the class files and this also leads to confusing decompiled source files. Given that Dava already produces correct Java abstract syntax trees (ASTs) for arbitrary class files, we provide a new back-end for Dava. The back-end rewrites the ASTs to semantically equivalent ASTs that correspond to code that is easier for programmers to understand. Our new back-end includes a new AST traversal framework, a set of simple pattern-based transformations, a structure-based data flow analysis framework and a collection of more advanced AST transformations that use flow analysis information. We include several illustrative examples including the use of advanced transformations to clean up obfuscated code