Miracle-dz/UniFAR-FTUs huggingface dataset:
Characterization of the Gut Microbiota in the Red Panda (Ailurus fulgens)

The red panda is the only living species of the genus Ailurus. Like giant pandas, red pandas are also highly specialized to feed mainly on highly fibrous bamboo. Although several studies have focused on the gut microbiota in the giant panda, little is known about the gut microbiota of the red panda. In this study, we characterized the fecal microbiota from both wild (n = 16) and captive (n = 6) red pandas using a pyrosequecing based approach targeting the V1-V3 hypervariable regions of the 16S rRNA gene. Distinct bacterial communities were observed between the two groups based on both membership and structure. Wild red pandas maintained significantly higher community diversity, richness and evenness than captive red pandas, the communities of which were skewed and dominated by taxa associated with Firmicutes. Phylogenetic analysis of the top 50 OTUs revealed that 10 of them were related to known cellulose degraders. To the best of our knowledge, this is the first study of the gut microbiota of the red panda. Our data suggest that, similar to the giant panda, the gut microbiota in the red panda might also play important roles in the digestion of bamboo.
Cost-benefit analysis of kernel tracing systems for forensic readiness

We present a cost-benefit analysis of kernel tracing systems for forensic readiness. We use the comprehensive coverage provided by kernel tracing systems as the indicator of benefit, and calculate the performance and storage overheads caused by collecting kernel traces as the cost metrics. Through utilizing kernel tracing systems to trace system calls exercised by a system call fuzzer, we present the comprehensive coverage provided by three kernel tracing systems: strace, SystemTap, and LTTng, along with their performance and storage overheads.
Reflexively representable but not Hilbert representable compact flows and semitopological semigroups

We show that for many natural topological groups G (including the group Z of integers) there exist compact metric G-spaces (cascades for G = Z) which are reflexively but not Hilbert representable. This answers a question of T. Downarowicz. The proof is based on a classical example of W. Rudin and its generalizations. One more crucial step in the proof is our recent result which states that every weakly almost periodic function on a compact G-flow X comes from a G-representation of X on reflexive spaces. We also show that there exists a monothetic compact metrizable semitopological semigroup S which does not admit an embedding into the semitopological compact semigroup Θ(H) of all contractive linear operators for a Hilbert space H (though S admits an embedding into the compact semigroup Θ(V ) for certain reflexive V ).
Cache Line Coloring Procedure Placement Using Real and Estimated Profiles

Efficient exploitation of the available cache memory space can have a significant improvement in program performance. By carefully restructuring a program such that temporally local sequences of instructions are mapped to different portions of the cache, fewer cache conflicts will result. In this paper we present a link-time procedure mapping algorithm which views the cache as a colored address space, each color representing a different cache line. The idea of coloring is borrowed from the register allocation problem. We consider the size of the cache and the size of a cache line in this work, when coloring procedures to indicate the current mapping of the procedure in the cache space. This algorithm takes as input a weighted program call graph, with nodes representing procedures and edge weights representing call frequencies. This graph is used as input to our color-based mapping algorithm to provide an improved program layout. The results in this paper are presented for reducing the first generation conflicts (mapping conflicts between a parent and a child). In this work we also describe a methodology of weighting a program call graph, without the aid of dynamic profiles, and use this to guide our coloring algorithm. We refer to this strategy as statically generating a call graph. We employ static branch prediction to estimate program behavior, which in turn is used to weight edges between procedures in the program call graph. Using profile-based weighted call graphs, our algorithm reduces on average the instruction cache miss rate by 40% over the original program mapping and by 17% over the mapping algorithm of Pettis and Hansen [21]. Using statically-formed program call graphs, our coloring algorithm improves performance by 20% on average over the original program mapping.
Assistive Technologies for Cognitive Disabilities

Purpose: To provide a comprehensive review of assistive technology (AT) to offset cognitive impairment, including examples, with pros and cons and important considerations for AT selection. Method: Prior research and a literature review identified the critical need for a means to identify key elements known to influence the successful use of AT and other supports by persons with cognitive disabilities. Results: The components of effective and satisfied AT use result from a good match among device features, user goals and preferences, and environmental resources (including trained professionals and providers). Conclusions: As the number of AT options increase, individualized interventions for individuals with cognitive disabilities will be easier to accomplish. The key to successful and optimal use of these products will be a comprehensive yet individualized determination of consumer needs and preferences and the identification of additional accommodations and supports.
Dental management of patients receiving anticoagulant and/or antiplatelet treatment

Introduction: Adequate hemostasis is crucial for the success of invasive dental treatment, since bleeding problems can give rise to complications associated with important morbidity-mortality. The dental treatment of patients who tend to an increased risk of bleeding due to the use of anticoagulant and/or antiplatelet drugs raises a challenge in the daily practice of dental professionals. Adequate knowledge of the mechanisms underlying hemostasis, and the optimized management of such patients, are therefore very important issues. Objectives: A study is made of the anticoagulant / antiplatelet drugs currently available on the market, with evaluation of the risks and benefits of suspending such drugs prior to invasive dental treatment. In addition, a review is made of the current management protocols used in these patients. Material and Methods: A literature search was made in the PubMed, Cochrane Library and Scopus databases, covering all studies published in the last 5 years in English and Spanish. Studies conducted in humans and with scientific evidence levels 1 and 2 (metaanalyses, systematic reviews, randomized phase 1 and 2 trials, cohort studies and case-control studies) were considered. The keywords used for the search were: tooth extraction, oral surgery, hemostasis, platelet aggregation inhibitors, antiplatelet drugs, anticoagulants, warfarin, acenocoumarol. Results and Conclusions: Many management protocols have been developed, though in all cases a full clinical history is required, together with complementary hemostatic tests to minimize any risks derived from dental treatment. Many authors consider that patient medication indicated for the treatment of background disease should not be altered or suspended unless so indicated by the prescribing physician. Local hemostatic measures have been shown to suffice for controlling possible bleeding problems resulting from dental treatment. Key words:Tooth extraction, oral surgery, hemostasis, platelet aggregation inhibitors, antiplatelet drugs, anticoagulants, warfarin, acenocoumarol.
Aerobic Capacity is Related to Repeated Sprint Ability with Sprint Distances Less Than 40 Meters

Research is inconclusive regarding the association between aerobic fitness (objectively measured VO2max) and repeated sprint performance when the sprints are less than 40 meters. Soccer athletes must be able to repeat sprints without significant decreases in speed and strength and conditioning coaches need to better understand if aerobic fitness is related to repeated sprint ability (RSA). Twenty (10 male, 10 female) Division I soccer athletes first completed a graded maximal treadmill test to measure VO2max. Then on a separate day, athletes completed the RSA test. The RSA test consisted of 10, 30-meter sprints which athletes repeated every 30 seconds. There were significant negative correlations (r ≤ −0.69, P < 0.001) between VO2max and all 10-sprint times and average sprint time. More aerobically fit Division I soccer athletes were faster at all time points during the RSA test. Aerobic fitness is associated with faster sprint times during a more anaerobic RSA test when sprint distances are less than 40 meters.
Motion simulator for coarse and fine motion of combination of a magnetically levitated micro robot and an industrial macro robot

Magnetically levitated robots can move without lubrication, they generally have advantages to the use in the various special environments such as in a dust-free room, in a vacuum, in a flammable atmosphere, and in vivo. Meanwhile, they have a disadvantage of small working volume corresponding to the allowable air gap between the levitated object and the electromagnets. In some cases, to construct a combination of a magnetically levitated robot (which can generate a fine motion) and an industrial robot (which can generate a coarse motion and has a comparatively large working volume) seems an effective way to expand the whole working volume. On that premise, we are developing an experimental system and simulator for collaborative work between a magnetically levitated robot and an industrial robot. This paper presents the system concept and the configuration of the simulator, and the result of a preliminary simulation experiment which has been performed to evaluate mainly two elements: the numerical magnetically levitated robot model and the numerical industrial robot model.
Performance Evaluation and Analysis of Kway join variants for Association Rule Mining

Data mining aims at discovering important and previously unknown patterns from the dataset in the underlying database. Database mining performs mining directly on data stored in relational database management systems (RDBMSs). The type of underlying database can vary and should not be a constraint on the mining process. Irrespective of the database in which data is stored, we should be able to mine the data. Several SQL92 approaches (such as K-way join, Query/Subquery, and Two-group by) have been studied in the literature.
A comparative study of applying real-time encryption in cloud computing environments

The rapid growth of cloud computing as a newfound technology and many unclear security issues in it cause many challenges. These challenges are specified in service provider's cloud servers and transmission processes. Accordingly, this paper presents a model based on separate data and key cloud servers and a client-based data encryption service for increasing the reliability in cloud computing environments. In the proposed model, the key generation process is done in a separate cloud application and public and private keys are stored in key cloud servers. Moreover, the encryption and decryption processes are done in client side by a service that named “data encryption service”. For applying this encryption system a comparative study was done by analyzing the strengths and weaknesses of six popular asymmetric key encryption algorithms (i.e. Original RSA, RSA Small-e, RSA Small-d, MREA, E-RSA, and EAMRSA) according to time, key size and security parameters. These algorithms were briefly described and redeveloped in the same situation for the simulation process to investigate the performance in client-based data encryption service. Furthermore, the security analysis was done by reviewing the performance of described algorithms against three popular attacks: Brute Force, Mathematical, and Timing Attack. According to the results E-RSA in the most appropriate algorithm for using in client-based data encryption service by achieving acceleration, accuracy, and security in this service based on compatibility issues in a client side service.
Massively Parallel BLAST for the Blue Gene / L

The focus of this article is to explain our research involved with running a parallel implementation of the widely used BLAST algorithm on thousands of processors, available on supercomputers like the IBM Blue Gene/L. Our work involved optimally splitting up the set of queries as well as the database. We also found solutions to reduce the I/O thereby delivering a fast, high throughput BLAST. Our results show that we are capable of performing at least 2 million BLAST searches per day against a database of 2.5 million protein sequences. We also show very good performance in terms of speedup and efficiency.
OntoMobiLe: A Generic Ontology-Centric Service-Oriented Architecture for Mobile Learning

Creation of pedagogical learning models to handle the specificity of mobile learning and the inherent constraints of mobile devices is a fundamental challenge in mobile learning. In this paper, we propose a generic semantics-based service-oriented architecture (SOA) and show how ontologies, when used together with Web services, can provide mobile users with a fresh learning experience. The proposed SOA is flexible and loosely coupled. It facilitates pluggable context-aware learner services that are multi-modal, as well as content services that support seamless integration of legacy content from possibly multiple vendors for customizable delivery. As illustration, we consider a mobile learning scenario in a zoo, and demonstrate how a mobile device user can interact with the proposed system for m-learning.
Dysarthria intelligibility assessment in a factor analysis total variability space

Speech technologies are more important every day to assist people with speech disorders. They can help to increase their quality of life or help clinicians to make a diagnosis. In this paper a new methodology based on a total variability subspace modelled by factor analysis is proposed to assess the intelligibility of people with dysarthria. The acoustic information of each recording is efficiently compressed and a Pearson correlation of 0.91 between the vectors in this subspace (iVectors) and the intelligibility is obtained. As acoustic information only perceptual linear prediction features are used. The experiments are conducted on Universal Access Speech database. Also a new error metric to overcome the subjectivity in the intelligibility labels is proposed.
H stological evidence for cholinergic following entorhinal alteration in the hippocampus cortex lesion

The initial stage of Alzheimer’s diseuse is characterized by neuropathological alteration in the entorhinal cortex. To model rme aspect of the neurrrdegeoeration observed iutd to investigate anatomical changes of the hippocampus associated with unilateral entorhinal cortex lesion, excitotoxin ibotenic acid wtts used to produce selective unilateral neurrmal krss in rat entorhinal cortex. Histological and morphornetrical analyses confirmed excitotoxic lesion of the entorhinrd cortex after 3 months and showed a decrease of acetylcholinesterase-stained fibers in the stratum molecular of the denttitc gyms mrd the stratum radiatum of the CA3 field. This study demonstrates the importance of the entol-hinal cortex in the hippocamptd cholinergic function which appears to be important to memory and learning, and raises the possibilitythat memorydeficit in Alzheimer’sdisease may be associatedwith partial neuronalloss in the entorhinalcortex. Ke}words: Entorhinal cortex; Ibotenic acid; Dentate gyms; Hippocampd CA3 field; Acetylcholinesterase-positive fiber; Akheimer’s disease
Motivation Influences Performance in SMR-BCI

In this study we investigated the eﬀect of motivation on performance when using a Brain-Computer Interface (BCI) based on sensorimotor rhythms (SMR). After pooling the data acquired with four diﬀerent SMR-BCI protocols in one sample of N=41 participants, we found a positive correlation between the motivational components ”challenge” and ”incompetence fear” and accuracy in percent correct responses. As motivation seems to have a positive eﬀect on SMR-BCI performance, we recommend to enhance motivation if possible and to monitor motivation in BCI settings.
The case for intrinsically disordered proteins playing contributory roles in molecular recognition without a stable 3D structure

The classical ‘lock-and-key’ and ‘induced-fit’ mechanisms for binding both originated in attempts to explain features of enzyme catalysis. For both of these mechanisms and for their recent refinements, enzyme catalysis requires exquisite spatial and electronic complementarity between the substrate and the catalyst. Thus, binding models derived from models originally based on catalysis will be highly biased towards mechanisms that utilize structural complementarity. If mere binding without catalysis is the endpoint, then the structural requirements for the interaction become much more relaxed. Recent observations on specific examples suggest that this relaxation can reach an extreme lack of specific 3D structure, leading to molecular recognition with biological consequences that depend not only upon structural and electrostatic complementarity between the binding partners but also upon kinetic, entropic, and generalized electrostatic effects. In addition to this discussion of binding without fixed structure, examples in which unstructured regions carry out important biological functions not involving molecular recognition will also be discussed. Finally, we discuss whether ‘intrinsically disordered protein’ (IDP) represents a useful new concept.
Reverse first principles: Weber's law and optimality in different senses

Author(s): Wilkes, Jason Taylor | Advisor(s): Cosmides, Leda | Abstract: The relationship between optimality and evolvability is analyzed through a case study of Weber's law, a common property of many sensory systems across a wide array of species. After demonstrating a variety of senses in which Weber's law is mathematically optimal, we ask whether principled methods exist for evaluating such optimality analyses. We argue that at least one such method exists: examining the evolvability of a trait with respect to each of the different metrics that it happens to optimize. Through evolvability analyses of Weber's law, it is demonstrated that optimality-equivalent measures of phenotypic quality need not be selectively equivalent: a trait that is optimal by two measures may have very different behavior under selection for each. This non-equivalence allows different optimality analyses of the same phenomenon to be assessed by a standard other than intuition, and in a manner requiring fewer degrees of freedom than are needed to model selection from scratch. Two qualitatively different models of selection are explored: phenotypic selection, a basic form in which mutations directly affect the model phenotype, and embryological selection, a more exotic form in which mutations affect the algorithm by which the phenotype is built.
Single-tree GMM training

In this short document, we derive a tree-independent single-tree algorithm for Gaussian mixture model training, based on a technique proposed by Moore [8]. Here, the solution we provide is tree-independent and thus will work with any type of tree and any type of traversal; this is more general than Moore’s original formulation, which was limited to mrkd-trees. This allows us to develop a flexible, generic implementation for GMM training of the type commonly found in the mlpack machine learning library [3]. A better introduction to Gaussian mixture models, their uses, and their training is given by both [9] and [2]; readers unfamiliar with GMMs should consult those references, as this minor discussion is intended as more of a refresher and also for terminology establishment. Before describing the single-tree algorithm, assume that we are given a dataset S = {p0, p1, . , pn}, and we wish to fit a Gaussian mixture model with m components to this data. Each component in our Gaussian mixture model θ is described as cj = (φj , μj ,Σj) for j ∈ [0,m), where φj = P (cj |θ) is the mixture weight of component j, μj is the mean of component j, and Σj is the covariance of component j. Then, the probability of a point arising from the GMM θ may be calculated as
Adaptation Combined Spatial Multiplexing and Diversity Techniques for Adaptive MIMO-OFDM System

An adaptive modulation and coding (AMC) and adaptive antenna grouping (AAG) architecture for multi-input multi-output orthogonal frequency-division multiplexed (MIMO- OFDM) system was proposed to effectively eliminate or resist various fading in wireless channels and to offer best tradeoff between transmission reliability and capacity. This combining scheme is not only adaptively to modulate to transmit more information over subcarriers but also adaptively to find the optimal STC/SM grouping scheme according to the estimated SNR. The simulation shows that the BER and throughput performance of the AMC and AAG MIMO-OFDM system outperform the conventional MIMO-OFDM and the AMC MIMO-OFDM system.
Non-intrusive bit swapping pattern generator for BIST testing of LUTs

This paper presents the non-intrusive built-in self-test system (BIST) for the test pattern generator (TPG) and output response analyzer (ORA) for testing of the field programmable gate array (FPGA). It consists of software and hardware parts with channels in between them to establish communication. The test generation and the response analysis are done in the software part whereas the hardware part is the circuit under test. Another FPGA is used to perform the interfacing operation. The configuration numbers are greatly reduced in this technique when compared with the embedded BIST technique. By incorporating bit-swapping linear feedback shift register (BS-LFSR) as the TPG instead of the conventional LFSR, transition numbers are reduced effectively. Hence the overall switching activity is reduced during the test operation, minimizing the power.
Research on Optimization Model of Attention Degree for Enterprises in Supply Chain Alliance Based on CVaR Method

Supply chain alliance has become a new form of organization and cooperation in enterprise led by alliance idea of "Growth externalization, control internalization", but there is much risk in the alliance because of "sole win" subconsciousness of many alliance enterprises. The alliance enterprises must give different degrees of attention to other alliance enterprises in order to realize anticipative strategic objective in the risky surrounding. The paper identifies and measures attention degree to other alliance enterprises by setting up optimization model of attention degree for enterprises in supply chain alliance based on CVaR, so to provide the basis for taking different management measures according to various attention degrees of targets, maintaining and obtaining maximum return for alliance enterprises. At same time alliance ability of alliance enterprises will be improved to a certain extent.