Miracle-dz/UniFAR-FTUs huggingface dataset:
Monoclonal Gammopathy of Undetermined Significance (MGUS) in a Man with Fragile X-associated Tremor/Ataxia Syndrome

We report the clinical presentation and laboratory findings of a 69-year-old man with fragile X-associated tremor ataxia syndrome (FXTAS), a progressive neurodegenerative disorder, who was noted to have monoclonal gammopathy of undetermined significance (MGUS), a plasma cell proliferative disorder and a precursor disease of multiple myeloma. Both MGUS and FXTAS are associated with microRNA (miRNA) dysregulation. We speculate that individuals with FXTAS may be predisposed to MGUS and further studies are warranted regarding this association.
Evaluation of a tactile device for augmentation of audiovisual experiences with a pseudo heartbeat

The impression that the viewer has of characters is an important factor affecting the viewer's opinion of audiovisual media, such as movies, television and video games. In particular, when we feel affection toward characters, we sometimes go so far as to identify ourselves as one of them, leading to extreme immersion in the content of the media. Therefore, there is the possibility that content technology can control affective feelings towards characters and create an immersive environment. We propose a device that can be used to facilitate the affection of the user by controlling their positive feelings toward characters in the media content. Previous studies have shown that emotional or physiological states can be altered by the visual and auditory presentation of false heartbeats [1, 2, 3]. However, if these techniques are applied to audiovisual media such as movies, television, or video games, the audio and visual heartbeat cues may interfere with and pollute the audiovisual content.
Soil Bacterial Community Shifts after Chitin Enrichment: An Integrative Metagenomic Approach

Chitin is the second most produced biopolymer on Earth after cellulose. Chitin degrading enzymes are promising but untapped sources for developing novel industrial biocatalysts. Hidden amongst uncultivated micro-organisms, new bacterial enzymes can be discovered and exploited by metagenomic approaches through extensive cloning and screening. Enrichment is also a well-known strategy, as it allows selection of organisms adapted to feed on a specific compound. In this study, we investigated how the soil bacterial community responded to chitin enrichment in a microcosm experiment. An integrative metagenomic approach coupling phylochips and high throughput shotgun pyrosequencing was established in order to assess the taxonomical and functional changes in the soil bacterial community. Results indicate that chitin enrichment leads to an increase of Actinobacteria, γ-proteobacteria and β-proteobacteria suggesting specific selection of chitin degrading bacteria belonging to these classes. Part of enriched bacterial genera were not yet reported to be involved in chitin degradation, like the members from the Micrococcineae sub-order (Actinobacteria). An increase of the observed bacterial diversity was noticed, with detection of specific genera only in chitin treated conditions. The relative proportion of metagenomic sequences related to chitin degradation was significantly increased, even if it represents only a tiny fraction of the sequence diversity found in a soil metagenome.
User Redirection and Direct Haptics in Virtual Environments

This paper proposes a haptic interaction system for Virtual Reality (VR) based on a combination of tracking devices for hands and objects and a real-to-virtual mapping system for user redirection. In our solution the user receives haptic stimuli by manipulating real objects mapped to virtual ob- jects. This solution departs from systems that rely on haptic devices (e.g., haptic gloves) as interfaces for the user to inter- act with objects in the Virtual Environment (VE). As such, the proposed solution makes use of direct haptics (touching) and redirection techniques to guide the user through the vir- tual environment. Using the mapping framework, when the user touches a virtual object in the VE, he will simultane- ously be physically touching the equivalent real object. A relevant feature of the framework is the possibility to de- fine a warped mapping between the real and virtual worlds, such that the relation between the user and the virtual space can be different from the one between the user and the real space. This is particularly useful when the application re- quires the emulation of large virtual spaces but the physical space available is more confined. To achieve this, both the user's hands and the objects are tracked. In the presented prototype we use a head-mounted depth sensor (i.e., Leap Motion) and a depth-sensing camera (i.e., Kinect). To assess the feasibility of this solution, a functional prototype and a room setup with core functionality were implemented. The test sessions with users evaluated the mapping accuracy, the user execution time and the awareness of the user regarding the warped space when performing tasks with redirection. The results gathered indicate that the solution can be used to provide direct haptic feedback in VR applications and for warping space perception within certain limits.
Identification of great apes using face recognition

In recent years, thousands of species populations declined catastrophically leaving many species on the brink of extinction. Several biological studies have shown that especially primates like chimpanzees and gorillas are threatened. An essential part of effective biodiversity conservation management is population monitoring using remote camera devices. However, due to the large amount of data, the manual analysis of video recordings is extremely time consuming and highly cost intensive. Consequently, there is a high demand for automatic analytical routine procedures using computer vision techniques to overcome this issue. In this paper we present a technique for the identification of great apes, in particular chimpanzees, using state-of-the-art algorithms for human face recognition in combination with several classification schemes. For benchmark purposes we provide a publicly available dataset of captive chimpanzees. In our experiments we applied several common techniques like the well known Eigenfaces, Fisherfaces, Laplacianfaces and Randomfaces approaches to identify individuals. We compare all of these methods in combination with the classification approaches Nearest Neighbor (NN), Support Vector Machine (SVM) and a new concept for face recognition, Sparse Representation Classification (SRC) based on Compressive Sensing (CS).
Similarity Searches in Heterogeneous Feature Spaces

Correlating event streams or development paths of observed behavior that involves disparate types of data is a common problem in many applications including biomedical and clinical diagnosis systems. We present a new problem formulation of specifying feature space with heterogeneous dissimilarity measures, and trying to find similar time series given these (expert) user-specified heterogeneities, both within the same feature and as combinations across multiple features. By allowing domain experts to describe their feature spaces more accurately in this fashion, query matches are better suited to the domain experts’ needs. The presented work augments the existing research of finding local similarity areas and overall patterns in time series data. Key-Words: database queries, dissimilarity measures, prior knowledge
Patterns in information search for decision making : the effects of information abstraction †

This paper reports on a study of abstraction in an information retrieval interface , where users had access to both detailed data and to two higher levels of abstraction of the data , in a multiple attribute alternative ranking situation. Through an experiment with a total of 76 subjects we found that , when they were not constrained by any built-in structure in their choice of information , there was a spectrum of use which combined various proportions of top-down search with opportunistic episodes (non-top-down branches to view various information attributes). We developed a measure of the degree of top-down search used , and found that this measure correlated positively with an increased propensity to use a compensatory decision strategy. Users also tended to reduce their use of top-down search in favour of more opportunistic search as they moved through the stages of the decision process. The degree of top-down search correlated significantly with a tendency to search within alternatives , but did not correlate with user domain experience. An implication of our findings is that , in order for a data retrieval interface to be implemented successfully , users should not be constrained by the system to follow a built-in search strategy , but should be allowed to develop their own search strategies through the use of a flexible interface. The use of computers to support decision making continues to expand rapidly , encouraged by the much more widespread availability of advanced technology in the form of inexpensive hardware , flexible software , user-oriented interfaces , and network and multi-media capabilities. These allow decision support systems (DSSs) to provide information to decision makers in a wide variety of formats and output modes. Recent advances in communications technology have also made available to users large amounts of information on diverse topics , accessible at many sites and in a number of forms. But these new technologies currently outpace an understanding of how the information they provide can be accessed , selected , organized , and presented through suitable interfaces in supporting and / or influencing decision
An Early Proposal of 'Brane World'

Here we place the TeX-typeset version of the old preprint SMC-PHYS-66 (1982), which was published in K. Akama, "Pregeometry", in Lecture Notes in Physics, 176, Gauge Theory and Gravitation, Proceedings, Nara, 1982, edited by K. Kikkawa, N. Nakanishi and H. Nariai, (Springer-Verlag) 267--271. In the paper, we presented the picture that we live in a "brane world" (in the present-day terminology) i.e. in a dynamically localized 3-brane in a higher dimensional space. We adopt, as an example, the dynamics of the Nielsen-Olesen vortex type in six dimensional spacetime to localize our space-time within a 3-brane. At low energies, everything is trapped in the 3-brane, and the Einstein gravity is induced through the fluctuations of the 3-brane. The idea is important because it provides a way basically distinct from the "compactification" to hide the extra dimensions which become necessary for various theoretical reasons.
MipsCoreDuo: A multifunction dual-core processor

In this paper, we describe the architecture of MipsCoreDuo, a microprocessor which is designed for LSI Design Contest in Okinawa 2009. MipsCoreDuo is a multifunction dual-core processor that has four attractive execution modes. It achieves high-parallel performance, high-sequential performance or high-dependability with single design. We implemented it in Verilog-HDL targeting an FPGA, and evaluated its performance. As a result,MipsCoreDuo uses 5,117 LUTs and achieves 71.8MHz frequency. And Striping mode, which is one of the execution modes that uses two cores to boost a single-thread program, achieves 8–17% better performance on sequential application than conventional dual-core design.
The Relationships among Compensation Justice,Organizational Commitment and Turnover Intention of Knowledge Worker

This paper analyzes the relationships among knowledge-worker's compensation justice, organizational commitment and turnover intention by empirical method. Finally, it shows: compensation justice has a greater effect on knowledge-worker's affective commitment and continuance commitment than on normative commitment; in the three factors of compensation justice, distributive justice has a greater predictive capability on knowledge-worker's organizational commitment and turnover intention than interactional justice and process justice.
A wavelet-based activation detector for bipolar electrogram analysis during atrial fibrillation

It has been shown that computation of atrial fibrillation (AF) electrogram (EGM) indices based on activation times is limited by the accuracy of the activation detector. In this work, a wavelet-based detector is proposed as a method to reliably extract activation time locations from the wavelet decomposition of non-linearly pre-processed bipolar EGM signal. A more classical amplitude adaptive threshold-based detector was also implemented for comparison purposes. Evaluation and validation was made by means of two scenarios due to the lack of standard databases: First, a simulation study where four real EGM signals, selected for its high SNR, were contaminated with noise at different SNR levels and detection performance was evaluated. Second, the inverse of the median activation cycle length (ACL) obtained from both detectors was compared with the spectral dominant frequency considered as gold standard. The proposed detector is more accurate and reliable than the threshold-based approach in the presence of noise, allowing a more reliable computation of activation-time-based AF clinical indices.
A Lorentzian signature model for quantum general relativity

We give a relativistic spin network model for quantum gravity based on the Lorentz group and its q-deformation, the Quantum Lorentz Algebra. We propose a combinatorial model for the path integral given by an integral over suitable representations of this algebra. This generalises the state sum models for the case of the four-dimensional rotation group previously studied in gr-qc/9709028. As a technical tool, formulae for the evaluation of relativistic spin networks for the Lorentz group are developed, with some simple examples which show that the evaluation is finite in interesting cases. We conjecture that the `10J' symbol needed in our model has a finite value.
Conditions for Unique Graph Realizations

The graph realization problem is that of computing the relative locations of a set of vertices placed in Euclidean space, relying only upon some set of inter-vertex distance measurements. This paper is concerned with the closely related problem of determining whether or not a graph has a unique realization. Both these problems are NP-hard, but the proofs rely upon special combinations of edge lengths. If one assumes the vertex locations are unrelated, then the uniqueness question can be approached from a purely graph theoretic angle that ignores edge lengths. This paper identifies three necessary graph theoretic conditions for a graph to have a unique realization in any dimension. Efficient sequential and NC algorithms are presented for each condition, although these algorithms have very different flavors in different dimensions.
Do Contexts Help in Phrase-Based, Statistical Source Code Migration?

Prior research showed that to migrate Java code to C# by directly applying phrase-based statistical machine translation (SMT) on the lexemes of source code produces much semantically incorrect code. In this work, we conduct empirical studies on several open-source projects to investigate the use of well-defined semantics in programming languages to guide the translation process in SMT. We have investigated five types of features forming the contexts involving the (semantic) relations among code tokens including occurrence association among code tokens, data and control dependencies among program entities, visibility constraints of entities, and the consistency in declarations and accesses of variables, fields and methods. We use the Direct Maximum Entropy (DME) approach for feature integration. Our empirical results show that as individual features added to the baseline SMT model, token association and data dependencies contribute much with highest relative improvement in semantic correctness of up to 18.3% and 18.5%, respectively. The integration of three feature types (token association, data dependencies, and visibility) into the baseline model has highest relative improvement with up to 26.4% improvement in semantic correctness. Generally, 43.5-80.7% of the total translated methods are semantically correct. Our results show a good direction of using SMT with semantic features at different levels of abstraction to improve its accuracy.
Chip-Firing Games, $G$-Parking Functions, and an Efficient Bijective Proof of the Matrix-Tree Theorem

Kirchhoff's matrix-tree theorem states that the number of spanning trees of a graph G is equal to the value of the determinant of the reduced Laplacian of $G$. We outline an efficient bijective proof of this theorem, by studying a canonical finite abelian group attached to $G$ whose order is equal to the value of same matrix determinant. More specifically, we show how one can efficiently compute a bijection between the group elements and the spanning trees of the graph. The main ingredient for computing the bijection is an efficient algorithm for finding the unique $G$-parking function (reduced divisor) in a linear equivalence class defined by a chip-firing game. We also give applications, including a new and completely algebraic algorithm for generating random spanning trees. Other applications include algorithms related to chip-firing games and sandpile group law, as well as certain algorithmic problems about the Riemann-Roch theory on graphs.
Cognitive and Cache-enabled D2D Communications in Cellular Networks

Caching popular contents for frequent access is an attractive way of employing the redundancy of user requests. Exploiting cognition to the cache-enabled D2D in the multichannel cellular network is the main focus of this paper. We contribute to analyzing the cache-based content delivery in a twotier heterogeneous network (HetNet) composed of base stations (BSs) and device-to-device (D2D) pairs, where the D2D accesses the networks with overlay spectrum sharing. Node locations are first modeled as mutually independent Poisson Point Processes (PPPs), and the service queueing process is formulated. The corresponding tier association and cognitive access protocol are developed. The D2D transmitter (TX) performs overlay spectrum sensing within its spectrum sensing region (SSR) to detect the idleness of cellular channels. Then the number of BSs and D2D TXs in the SSR are analyzed. We further elaborate the probability mass function (PMF) of the delay and the queue length, with modeling the traffic dynamics of request arrivals and departures at the BS and D2D TX as the discrete-time multiserver queue with priorities. Moreover, impacts of some key network parameters, e.g., the content popularity, the request density and the caching storage, on the system performance are investigated to provide a valuable insight.
HMPAO-SPECT bei Demenz vom Alzheimer-Typ und Major Depression mit mnestischen Störungen

Zusammenfassung Ziel der vorliegenden Untersuchung war es, zu prüfen, ob die HMPAO-SPECT zur Differenzierung zwischen der Demenz vom Alzheimer-Typ (DAT) und der Major Depression (MD) beitragen kann. Es wurden ECT-Befunde von 77 Patienten mit Gedächtnisstörungen beurteilt, davon hatten 48 eine DAT und 29 eine MD. Zunächst wurden die Defekte in der SPECT einer Hirn-Region zugeordnet und der Grad der Ausprägung (-1/-2/-3) bewertet. Anschließend wurden die einzelnen Befunde in eine von 7 Befundkategorien eingeordnet. In einigen dieser 7 Gruppen ergaben sich deutliche Häufungen der Fälle mit DAT bzw. MD. 35% aller DAT-Patienten wiesen bilaterale Defekte mit deutlicher (>-1) parietaler/parietotemporaler Minderperfusion auf, dagegen zeigte kein Patient mit MD dieses Muster. Unilaterale Defekte wiesen 62% der MD-, aber nur 31% der DAT-Patienten auf. Die Untersuchung zeigt, daß nur 35% der Patienten mit DAT das bislang als »pathognomonisch« bezeichnete Befundmuster aufwiesen. Dieses Perfusionsmuster kann aber - wenn es vorliegt - als sicheres Kriterium zur Abgrenzung gegen eine MD gewertet werden. Darüber hinaus lassen sich keine eindeutigen (»krankheitstypischen«) Perfusionsmuster erkennen, wenngleich unilaterale Defekte mehr auf eine MD hindeuten.
Convergent evolution of domain architectures (is rare)

MOTIVATION In this paper, we shall examine the evolution of domain architectures across 62 genomes of known phylogeny including all kingdoms of life. We look in particular at the possibility of convergent evolution, with a view to determining the extent to which the architectures observed in the genomes are due to functional necessity or evolutionary descent. We used domains of known structure, because from this and other information we know their evolutionary relationships. We use a range of methods including phylogenetic grouping, sequence similarity/alignment, mutation rates and comparative genomics to approach this difficult problem from several angles. RESULTS Although we do not claim an exhaustive analysis, we conclude that between 0.4 and 4% of sequences are involved in convergent evolution of domain architectures, and expect the actual number to be close to the lower bound. We also made two incidental observations, albeit on a small sample: the events leading to convergent evolution appear to be random with no functional or structural preferences, and changes in the number of tandem repeat domains occur more readily than changes which alter the domain composition. CONCLUSION The principal conclusion is that the observed domain architectures of the sequences in the genomes are driven by evolutionary descent rather than functional necessity. CONTACT gough@supfam.org.
A Molecular Mechanics Approach to Modeling Protein-Ligand Interactions: Relative Binding Affinities in Congeneric Series

We introduce the "Prime-ligand" method for ranking ligands in congeneric series. The method employs a single scoring function, the OPLS-AA/GBSA molecular mechanics/implicit solvent model, for all stages of sampling and scoring. We evaluate the method using 12 test sets of congeneric series for which experimental binding data is available in the literature, as well as the structure of one member of the series bound to the protein. Ligands are "docked" by superimposing a common stem fragment among the compounds in the series using a crystal complex from the Protein Data Bank and sampling the conformational space of the variable region. Our results show good correlation between our predicted rankings and the experimental data for cases in which binding affinities differ by at least 1 order of magnitude. For 11 out of 12 cases, >90% of such ligand pairs could be correctly ranked, while for the remaining case, Factor Xa, 76% of such pairs were correctly ranked. A small number of compounds could not be docked using the current protocol because of the large size of functional groups that could not be accommodated by a rigid receptor. CPU requirements for the method, involving CPU minutes per ligand, are modest compared with more rigorous methods that use similar force fields, such as free energy perturbation. We also benchmark the scoring function using series of ligands bound to the same protein within the CSAR data set. We demonstrate that energy minimization of ligands in the crystal structures is critical to obtain any correlation with experimentally determined binding affinities.