Miracle-dz/UniFAR-FTUs huggingface dataset:
Efficient Feature Selection via Analysis of Relevance and Redundancy

Feature selection is applied to reduce the number of features in many applications where data has hundreds or thousands of features. Existing feature selection methods mainly focus on finding relevant features. In this paper, we show that feature relevance alone is insufficient for efficient feature selection of high-dimensional data. We define feature redundancy and propose to perform explicit redundancy analysis in feature selection. A new framework is introduced that decouples relevance analysis and redundancy analysis. We develop a correlation-based method for relevance and redundancy analysis, and conduct an empirical study of its efficiency and effectiveness comparing with representative methods.
Extended evidence for association between the melanoma inhibitory activity 3 gene and myocardial infarction

Summary In a genome-wide scan, isolated single nucleotide polymorphisms (SNPs), including rs17465637, in the melanoma inhibitory activity 3 gene (MIA3) on chromosome 1 were identified to be associated with coronary artery disease and myocardial infarction (MI). Because the role of common variation at the MIA3 locus has not yet been investigated, the aim of this case-control study was to determine the impact of haplotype-tagging SNPs and haplotypes in the MIA3 region on the risk of MI. In a set of nine haplotype-tagging SNPs, rs17465637, but none of the other SNPs, was associated with MI. After adjustments were made for age, gender, history of arterial hypertension, history of hyper-cholesterolaemia, current cigarette smoking and diabetes mellitus, multiple logistic regression analyses showed an increased risk in the carriers of one or two C alleles [adjusted odds ratio (OR) 1.17, 95% confidence interval (CI) 1.04–1.32, and 1.37, 95% CI 1.08–1.74, respectively]. Nine common haplotypes (frequency >1%) were established across the MIA3 region. Two of the haplotypes were associated with an increased risk of MI: the frequent (48%) TGACCAAAG haplotype and the rare (2%) CGACCAAAG haplotype (adjusted OR 1.102, 95% CI 1.002–1.212, and 1.574, 95% CI 1.077–2.298, respectively). Showing association between rs17465637 and MI, this work was consistent with results from the original detection study and most prior replication studies addressing this issue. In addition to correspond with such isolated evidence of association with MI, the present study identified specific haplotypes capturing the risk-related variation in the entire MIA3 region.
Effects of games-based biofeedback training on the attentional demands of balance tasks in older adults

3 Introduction 4 Review of Literature 5 Balance as a Construct 6 Attentional Demands of Balance Tasks 7 Age Related Changes in the Attentional Demands of Balance Tasks 11 Balance Training with Computerized Biofeedback 14 Functional Balance Measure 17 Composite Fitness Measure 19 Hypotheses 20 Methods 22 Participants and Recruitment 22 Design and Testing Procedures 23 Dual Task Paradigm 24 Functional Balance 25 Composite Fitness 25 Games-Based Biofeedback Training Protocol 26 Figure 1: The NeuroGym Training System 27 Figure 2: Training Routines 28 Data Analysis 30 Results 31 Group Characteristics at Baseline 31 Table 1: Group Characteristics at the Pre Test Period 31 Dual Task Paradigm 32 Postural Sway 32 Figure 3a: Postural Sway: Anterior-Posterior Direction 33 Figure 3b: Postural Sway: Lateral Direction 33 Reaction time 33 Figure 4: Reaction Time 34 Functional balance 35 Figure 5: Community Balance and Mobility Scale 36 Composite Fitness 36 Figure 6: Six Minute Walk 37
Glucose sensing in human epidermis using mid-infrared photoacoustic detection

No reliable non-invasive glucose monitoring devices are currently available. We implemented a mid-infrared (MIR) photoacoustic (PA) setup to track glucose in vitro in deep epidermal layers, which represents a significant step towards non-invasive in vivo glucose measurements using MIR light. An external-cavity quantum-cascade laser (1010–1095 cm−1) and a PA cell of only 78 mm3 volume were employed to monitor glucose in epidermal skin. Skin samples are characterized by a high water content. Such samples investigated with an open-ended PA cell lead to varying conditions in the PA chamber (i.e., change of light absorption or relative humidity) and cause unstable signals. To circumvent variations in relative humidity and possible water condensation, the PA chamber was constantly ventilated by a 10 sccm N2 flow. By bringing the epidermal skin samples in contact with aqueous glucose solutions with different concentrations (i.e., 0.1–10 g/dl), the glucose concentration in the skin sample was varied through passive diffusion. The achieved detection limit for glucose in epidermal skin is 100 mg/dl (SNR=1). Although this lies within the human physiological range (30–500 mg/dl) further improvements are necessary to non-invasively monitor glucose levels of diabetes patients. Furthermore spectra of epidermal tissue with and without glucose content have been recorded with the tunable quantum-cascade laser, indicating that epidermal constituents do not impair glucose detection.
Clustering Approach to Generalized Pattern Identification Based on Multi-instanced Objects with DARA

Clustering is an essential data mining task with various types of applications. Traditional clustering algorithms are based on a vector space model representation. A relational database system often contains multi- relational information spread across multiple relations (tables). In order to cluster such data, one would require to restrict the analysis to a single representation, or to construct a feature space comprising all possible representations from the data stored in multiple tables. In this paper, we present a data summarization approach, borrowed from the Information Retrieval theory, to clustering in multi-relational environment. We find that the data summarization technique can be used here to capture the typical high volume of multiple instances and numerous forms of patterns. Our experiments demonstrate a technique to cluster data in a multi-relational environment and show the evaluation results on the mutagenesis dataset. In addition, the effect of varying the number of features considered in clustering on the classification performance is also evaluated.
The dichotomy of probabilistic inference for unions of conjunctive queries

We study the complexity of computing a query on a probabilistic database. We consider unions of conjunctive queries, UCQ, which are equivalent to positive, existential First Order Logic sentences, and also to nonrecursive datalog programs. The tuples in the database are independent random events. We prove the following dichotomy theorem. For every UCQ query, either its probability can be computed in polynomial time in the size of the database, or is #P-hard. Our result also has applications to the problem of computing the probability of positive, Boolean expressions, and establishes a dichotomy for such classes based on their structure. For the tractable case, we give a very simple algorithm that alternates between two steps: applying the inclusion/exclusion formula, and removing one existential variable. A key and novel feature of this algorithm is that it avoids computing terms that cancel out in the inclusion/exclusion formula, in other words it only computes those terms whose Mobius function in an appropriate lattice is nonzero. We show that this simple feature is a key ingredient needed to ensure completeness. For the hardness proof, we give a reduction from the counting problem for positive, partitioned 2CNF, which is known to be #P-complete. The hardness proof is nontrivial, and combines techniques from logic, classical algebra, and analysis.
Dynamic hammock predication for non-predicated instruction set architectures

Conventional speculative architectures use branch prediction to evaluate the most likely execution path during program execution. However certain branches are difficult to predict. One solution to this problem is to evaluate both paths following such a conditional branch. Predicated execution can be used to implement this form of multi-path execution. Predicated architectures fetch and issue instructions that have associated predicates. These predicates indicate if the instruction should commit its result. Predicating a branch reduces the number of branches executed, eliminating the chance of branch misprediction at the cost of executing additional instructions. In this paper, we propose a restricted form of multi-path execution called Dynamic Predication for architectures with little or no support for predicated instructions in their instruction set. Dynamic predication dynamically predicates instruction sequences in the form of a branch hammock concurrently executing both paths of the branch. A branch hammock is a short forward branch that spans a few instructions in the form of an if-then or if-then-else construct we mark these and other constructs in the executable. When the decode stage detects such a sequence, it passes a predicated instruction sequence to a dynamically scheduled execution core. Our results show that dynamic predication can accrue speedups of up to 13%.
Genome Sequence of a Novel Iflavirus from mRNA Sequencing of the Butterfly Heliconius erato

ABSTRACT Here, we report the genome sequence of a novel iflavirus strain recovered from the neotropical butterfly Heliconius erato. The coding DNA sequence (CDS) of the iflavirus genome was 8,895 nucleotides in length, encoding a polyprotein that was 2,965 amino acids long.
Invariant fitting of two view geometry

This paper describes an extension of Bookstein's and Sampson's methods, for fitting conics, to the determination of epipolar geometry, both in the calibrated case, where the Essential matrix E is to be determined or in the uncalibrated case, where we seek the fundamental matrix F. We desire that the fitting of the relation be invariant to Euclidean transformations of the image, and show that there is only one suitable normalization of the coefficients and that this normalization gives rise to a quadratic form allowing eigenvector methods to be used to find E or F, or an arbitrary homography H. The resulting method has the advantage that it exhibits the improved stability of previous methods for estimating the epipolar geometry, such as the preconditioning method of Hartley, while also being invariant to equiform transformations.
Evidently secure device associations

A key problem in mobile and ubiquitous computing is that of setting up an association between a pair of devices so that they may communicate securely over a wireless network. It is particularly important to be able to solve this problem for spontaneous associations, which must not depend on preexisting security values such as certificates, and when the only means of identifying the target device is physical. This paper contributes protocols for validating secure spontaneous associations. The protocols complement existing unauthenticated key-exchange protocols and work over widely used wireless technologies. They improve on previous work by eliminating specialised hardware. We present the protocols and discuss their advantages and limitations.
Multiple losses of self‐incompatibility in North‐American Arabidopsis lyrata?: Phylogeographic context and population genetic consequences

Arabidopsis lyrata is mostly outcrossing due to a sporophytic self‐incompatibility (SI) system but around the Great Lakes of North America some populations have experienced a loss of SI. We researched the loss of SI in a phylogeographic context. We used cpDNA and microsatellite markers to test if populations of North‐American A. lyrata around the Great Lakes have experienced different (recent) histories, and linked this with individually established selfing phenotype and population level realized outcrossing rates calculated based on variation in progeny arrays at multi‐locus microsatellite markers. We found three chloroplast haplotypes, in two of which the loss of self‐incompatibility had occurred independently. Shifts to high rates of inbreeding were most apparent in one of these lineages but individuals showing loss of SI occurred in all three. Self‐compatible individuals usually showed a reduction of observed heterozygosity (HO) compared to outcrossing individuals. In the lineage that included the populations with the highest levels of inbreeding, this reduction was more substantial. This may indicate that the loss of SI in this lineage did not occur as recently as in the other lineage. The geographic distribution of the haplotypes suggested that there had been at least two independent colonization routes to the north of the Great Lakes following the last glaciation. This is consistent with postglacial migration patterns that have been suggested for other organisms with limited dispersal, such as reptiles and amphibians.
Spoken Language Benefits of Extending Cochlear Implant Candidacy Below 12 Months of Age

Objective To test the hypothesis that cochlear implantation surgery before 12 months of age yields better spoken language results than surgery between 12 and 18 months of age. Study Design Language testing administered to children at 4.5 years of age (±2 mo). Setting Schools, speech-language therapy offices, and cochlear implant (CI) centers in the United States and Canada. Participants Sixty-nine children who received a cochlear implant between ages 6 and 18 months of age. All children were learning to communicate via listening and spoken language in English-speaking families. Main Outcome Measure Standard scores on receptive vocabulary, expressive, and receptive language (includes grammar). Results Children with CI surgery at 6 to 11 months (n = 27) achieved higher scores on all measures as compared with those with surgery at 12 to 18 months (n = 42). Regression analysis revealed a linear relationship between age of implantation and language outcomes throughout the 6- to 18-month surgery-age range. Conclusion For children in intervention programs emphasizing listening and spoken language, cochlear implantation before 12 months of age seems to provide a significant advantage for spoken language achievement observed at 4.5 years of age.
An Overview of Operationalizing Criteria for ME, ME/CFS, and CFS Case Definitions

Since the 1950s, many case definitions have been developed for chronic fatigue syndrome (CFS) (Holmes et al., 1988; Fukuda et al., 1994), Myalgic Encephalomyelitis (ME) (Carruthers et al., 2011; Ramsay, 1988), and Myalgic Encephalomyelitis/chronic fatigue syndrome (ME/CFS) (Carruthers et al., 2003). Case definitions allow researchers and clinicians to consistently determine those who have and those who do not have an illness. However, disagreements about diagnostic decisions may arise because of diagnostic unreliability (Jason et al, 1999). This unreliability and variance may be due to subject variance, occasion variance, information variance, observation variance, and criterion variance (Spitzer, Endicott, & Robins, 1975; Jason & Choi, 2008). Notably, criterion variance, which classifies patients’ symptoms into diagnostic categories, leads to the largest source of diagnostic unreliability. This typically occurs when an operationally explicit set of criteria for diagnostic categories does not exist (Spitzer et al., 1975). ME was first described as “atypical poliomyelitis” from literature of the 1930s after an outbreak of Epidemic Neuromysthenia in L.A. County (Hyde, 2007). The first U.S. case definition for CFS dates back to Holmes et al. (1988). However, the current U.S. case definition for CFS was constructed by Fukuda et al. (1994) and the empiric criteria for CFS was developed by Reeves et al. (2005). A recent review article by Jason et al. (2012) identified and compared several case definitions for ME, including Ramsay’s case definition (1988), the London criteria (National Task Force Report on CFS/PVFS/ ME, 1994), the Nightingale criteria (Hyde, 2007), and the Goudsmit et al. criteria (2009). A clinical case definition for ME/CFS was also developed according to the Canadian Case Definition (Carruthers et al., 2003). Recently, the newest case definition for ME was introduced by the Myalgic
BIVALVES ORGANIC POLLUTION ALONG EASTERN MEDITTERANEAN COASTS

1 Benaki Phytopathological Institute, Department of Pesticides Control and Phytopharmacy, Laboratory of Pesticides’ Toxicology, 8 St. Delta Street, Kifissia, 14561 Athens, Greece, 2 Istanbul Technical University Faculty of Naval Architecture and Ocean Engineering 34469, Maslak, Istanbul/Turkey 2 Department of Agriculture, Crop production and Rural Environment Analytical Chemistry and Pesticides , University of Thessaly, School of Agricultural Sciences Fytokou Street, 38446 Nea Ionia Magnisias, Greece k.machera@bpi.gr
The development and implantation of a biologically derived allograft scaffold

Biologically derived scaffolds are becoming viable treatment options for tissue/organ repair and regeneration. A continuing hurdle is the need for a functional blood supply to and from the implanted scaffold. We have addressed this problem by constructing an acellular ileal scaffold with an attached vascular network suitable for implantation and immediate reperfusion with the host's blood. Using a vascular perfusion approach, a segment of porcine ileum up to 30 cm long, together with its attached vasculature, was decellularized as a single entity. The quality of the decellularized scaffold was assessed histologically and using molecular tools. To establish vascular perfusion potentials of the scaffold, a right‐sided nephrectomy and end‐to‐end anastomosis of the decellularized scaffold's vasculature to a renal artery and vein were performed in a pig of similar size to the donor animal. Lengths of ileal scaffold, together with its attached vasculature, were successfully decellularized, with no evidence of intact cells/nuclear material or collagen degradation. The scaffold's decellularized vascular network demonstrated optimum perfusion at 1, 2 and 24 h post‐implantation and the mesenteric arcade remained patent throughout the assessment. The 1, 2 and 24 h explanted scaffolds demonstrated signs of cellular attachment, with cells positive for CD68 and CD133 on the vascular luminal aspect. It is possible to decellularize clinically relevant lengths of small intestine, together with the associated vasculature, as a single segment. The functional vascular network may represent a route for recellularization for future regeneration of bowel tissue for patients with short bowel syndrome. Copyright © 2013 John Wiley & Sons, Ltd.
Reusable skinning templates using cage-based deformations

Character skinning determines how the shape of the surface geometry changes as a function of the pose of the underlying skeleton. In this paper we describe skinning templates, which define common deformation behaviors for common joint types. This abstraction allows skinning solutions to be shared and reused, and they allow a user to quickly explore many possible alternatives for the skinning behavior of a character. The skinning templates are implemented using cage-based deformations, which offer a flexible design space within which to develop reusable skinning behaviors. We demonstrate the interactive use of skinning templates to quickly explore alternate skinning behaviors for 3D models.
When 3D Reconstruction Meets Ubiquitous RGB-D Images

3D reconstruction from a single image is a classical problem in computer vision. However, it still poses great challenges for the reconstruction of daily-use objects with irregular shapes. In this paper, we propose to learn 3D reconstruction knowledge from informally captured RGB-D images, which will probably be ubiquitously used in daily life. The learning of 3D reconstruction is defined as a category modeling problem, in which a model for each category is trained to encode category-specific knowledge for 3D reconstruction. The category model estimates the pixel-level 3D structure of an object from its 2D appearance, by taking into account considerable variations in rotation, 3D structure, and texture. Learning 3D reconstruction from ubiquitous RGB-D images creates a new set of challenges. Experimental results have demonstrated the effectiveness of the proposed approach.
Tracking Point of View in Narrative

Third-person fictional narrative text is composed not only of passages that objectively narrate events, but also of passages that present characters' thoughts, perceptions, and inner states. Such passages take a character's psychological point of view. A language understander must determine the current psychological point of view in order to distinguish the beliefs of the characters from the facts of the story, to correctly attribute beliefs and other attitudes to their sources, and to understand the discourse relations among sentences. Tracking the psychological point of view is not a trivial problem, because many sentences are not explicitly marked for point of view, and whether the point of view of a sentence is objective or that of a character (and if the latter, which character it is) often depends on the context in which the sentence appears. Tracking the psychological point of view is the problem addressed in this work. The approach is to seek, by extensive examinations of naturally occurring narrative, regularities in the ways that authors manipulate point of view, and to develop an algorithm that tracks point of view on the basis of the regularities found. This paper presents this algorithm, gives demonstrations of an implemented system, and describes the results of some preliminary empirical studies, which lend support to the algorithm.
Path-Centric On-Demand Rate Adaptation for Mobile Ad Hoc Networks

Exploiting the multirate capability in mobile ad hoc networks (MANETs) is more complex than in single-hop WLANs because of the rate-distance and rate-hop count trade- offs. This paper proposes Path-centric on-demand Rate Adaptation for MANETs (PRAM) protocol. A unique feature that sets PRAM apart from most of previous studies is its path-centric approach. While others focus on finding the best data rate for each link and offering a routing path as a collection of links at their best rates, PRAM finds the best data rate for a source- destination pair and then, dynamically adapts it based on path lifetime and other factors. Another distinctive feature of PRAM is that it can be seamlessly incorporated with an on-demand routing protocol. Extensive performance study based on ns-2 has demonstrated that PRAM achieves as much as 71.7% higher packet delivery ratio than fixed-rate cases (6∼54Mbps) and as much as 43.2% higher than the multihop version of the well- known ARF mechanism in a wide range of network scenarios. It is also shown that PRAM is capable of using a mixture of data rates in an adaptive manner. Index Terms—Multirate adaptation, Mobile ad hoc networks, Path lifetime, IEEE 802.11, Spectral efficiency.
Real-time shared control system for space telerobotics

The shared control system is a modular real-time system designed to execute complex tasks through the intelligent coordination of task modules. A state machine is used to control task sequencing, and due to the automatic switching, the accuracy and reliability with which tasks are executed, is greatly improved. Tasks consist of sets of independent, modular, and reusable subtasks whose outputs are combined to create the control. This system has proved itself useful for rapid development of reliable high level multiple sensor based manipulation and control tasks. Additionally, we have integrated a neural network based visual servoing system, a semi-compliant Cartesian trajectory following heuristics, and a real-time graphical user interface in the system. The shared control system was implemented for the Self-Mobile Space Manipulator (SM2) to handle a range of tasks associated with locomotion, manipulation, and material transportation on Space-Station Freedom.