Miracle-dz/UniFAR-FTUs huggingface dataset:
Analysis of the effect of aluminum in drinking water and transferrin C2 allele on Alzheimer's disease

Although highly controversial, the hypothesis of a link between aluminum (Al) in drinking water and Alzheimer's disease (AD) has been supported by several epidemiological studies. Transferrin (Tf) is a major transport protein for both iron and Al. Moreover, it has been demonstrated that defective binding of iron and Al to the Tf variant C2 could be present in AD. Individuals carrying the Tf C2 allele might therefore be at greater risk of developing AD. We investigated whether the Tf C2 allele might be responsible for susceptibility to AD in a sample of 292 subjects (with 55 AD) aged ≥75 years from south‐west France, some exposed to high levels of Al in tap water (n = 181 subjects) and others to low levels of Al (n = 111 subjects). We also examined the combined genetic effects of Tf C2 and ɛ4 allele of apolipoprotein E gene (ApoE). Logistic regression analysis showed that neither Tf C2 nor its interaction with Al or with the ɛ4 allele of the ApoE were significantly associated with the risk of AD.
Friction and Slip in the Cold Rolling of Metals

Friction and slip in the cold rolling of metals were studied theoretically using a mixed lubrication model. The calculated results generally agree with published observations as follows: (1) tension, reduction, oil viscosity, speed, and alloy are important to slip, (2) reduction, oil viscosity, roll radius, speed, and alloy are important to friction, (3) a decrease in friction does not always produce lower forward slip, (4) Ford's coefficient of friction cannot predict the frictional behavior even qualitatively in certain cases, and (5) slip decreases linearly with increasing speed and viscosity. Presented as an American Society of Lubrication Engineers paper at the ASLE/ASME Lubrication Conference in Boston, Massachusetts, October 5–7, 1976
Single stimulus color can modulate vection

In the present study, we investigated the effects of single color on forward and backward vection. The approaching or receding optical flow observed during forward or backward locomotion was simulated by using random dots with changing size, velocity, and disparity. The dots were presented on a black (Experiments 1 and 2) or white background (Experiment 3) in equiluminant colors; namely, white (or gray), red, yellow, green, or blue. The participant's task was to press and hold one of three buttons whenever they felt vection. The three buttons corresponded to the subjective strength of vection: strong, same, and weak relative to vection induced by the standard modulus. In Experiments 1 and 2, the participants were also asked to rate the strength and direction of vection after each trial. In Experiment 3, they rated the visibility and the perceived velocity of dot motion. Experiment 1 showed that the induced vection was stronger for the chromatic than for the achromatic dots. Particularly at low velocity conditions (±10 km/h), the vection induced for red dots was stronger than that for the other colored dots. Experiment 2 showed that the order effects of stimulus presentation could not explain the findings of Experiment 1. Experiment 3's pattern of results was similar to that of Experiment 1, and this suggested that a luminance artifact between color conditions could not account for Experiment 1's findings. These results suggest that a stimulus color can modulate vection even when a single color is added to the optical flow.
Long‐range corrected density functionals combined with local response dispersion: A promising method for weak interactions

Density functional theory, in general, is considered to underestimate the weak van der Waals type of intermolecular interactions. We optimized parameters of the local response dispersion (LRD) method applied to the long‐range corrected exchange‐correlation functionals (LC‐BOP12+LRD and LCgau‐BOP+LRD) on the interaction energy for the complexes in the recently compiled S66 database and found to be comparable with the high‐level wave function‐based methods reported in Řezáč et al. (J. Chem. Theory Comput. 2011, 7, 2427). Our calculations with the S66 intermolecular complexes at equilibrium geometries suggests that the LC‐BOP12+LRD and LCgau‐BOP+LRD are well‐balanced and lower cost alternatives to the methods reported in the database. Further, test on the S66X8 database (with eight nonequilibrium points) and the HBC6 and NBC10 database shows LC+LRD method with newly optimized parameters is a promising candidate for dealing such weak interactions. Finally, the new parameterized LC+LRD method was tested on X40 benchmark halogenated complexes.Copyright © 2013 Wiley Periodicals, Inc.
Photo-generated Terahertz devices

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.
Combining Heterogeneous Models for Measuring Relational Similarity

In this work, we study the problem of measuring relational similarity between two word pairs (e.g., silverware:fork and clothing:shirt). Due to the large number of possible relations, we argue that it is important to combine multiple models based on heterogeneous information sources. Our overall system consists of two novel general-purpose relational similarity models and three specific word relation models. When evaluated in the setting of a recently proposed SemEval-2012 task, our approach outperforms the previous best system substantially, achieving a 54.1% relative increase in Spearman’s rank correlation.
Tracking Human Motion by using Motion Capture Data

Tracking an active human body and understanding the nature of his/her activity on a video is a very complex problem. Psychological experiments show that human subjects can easily track and extract several variables from a video, including what the person is doing, the gender of the person, the emotional status, the identity of the person, and even if the person is oneself; all from a little amount of dynamic information. This is by means of the biological vision and cognition system that include inborn mechanisms for emphatizing with other humans and also adaptively incorporate several years of experience. Therefore, to build intelligent systems ourselves, we must find a way to algorithmically incorporate the information about the physical nature of the human body and the dynamical structure of different human activities.
Recognition of handwritten numerals using RBF-SVM hybrid model

One of the major developments in machine learning in the past decade is the ensemble method, which finds highly accurate classifier by combining many moderately accurate component classifiers. This paper addresses using an ensemble of classification methods for recognizing totally unconstrained handwritten numerals. Due to a great variety of individual writing styles, the problem is very difficult and far from being solved. In this research work, new hybrid classification method is proposed by combining classifiers in a heterogeneous environment using arcing classifier and their performances are analyzed in terms of accuracy. A classifier ensemble is designed using Radial Basis Function (RBF) and Support Vector Machine (SVM). Here, modified training sets are formed by resampling from original training set; classifiers constructed using these training sets and then combined by voting. Empirical results illustrate that the proposed hybrid systems provide more accurate handwriting recognition system.
Real-Time Pedestrian Evacuation Planning during Emergency

We develop a set of solution techniques for real-time evacuation guidance of pedestrians during emergency, focusing on evacuation from buildings during a fire. We model the problem as an extension of a dynamic network flow by allowing for nodes and edges to expire over time. This captures evacuation situations where the spreading hazard renders parts of the network unavailable. We formally state the problem, analyze its complexity, develop a set of heuristic approaches and compare their performance against a number of most relevant alternative approaches. We experimentally demonstrate that our heuristics outperform the alternatives and are suitable for real-time use even for large networks.
Energy-efficiency of floating-point and fixed-point SIMD cores for MIMO processing systems

For computational tasks with regular data access patterns, e.g. vector arithmetic, single instruction multiple data (SIMD) processor cores present a viable alternative to application-specific integrated circuits (ASICs). Even though the additional flexibility of a programmable core comes at the expense of reduced area- and energy efficiency, this price is potentially worth paying in application domains with a multitude of standards and use cases as it is the case in the domain of wireless communications. The high dynamic range of values that occurs in multi-antenna wireless baseband processing calls for the use of numerical stabilization measures like QR factorization and scaling when operating on a fixed-point processor core. A floating-point core on the other hand covers a wider dynamic range, rendering such measures unnecessary at the price of increased power consumption. This work compares a floating-point and a fixed-point SIMD core in a case study of linear MIMO detection. After evaluating the numerical precision requirements, the achievable throughput of both cores is compared along with the maximum achievable area- and energy efficiency for several use cases, resulting in an assessment as to which number format is best suited for which use case.
A Statistical Theory of Dependency Syntax

A generative statistical model of dependency syntax is proposed based on Tesniere's classical theory. It provides a stochastic formalization of the original model of syntactic structure and augments it with a model of the string realization process, the latter which is lacking in Tesniere's original work. The resulting theory models crossing dependency links, discontinuous nuclei and string merging, and it has been given an efficient computational rendering.
An efficient net ordering algorithm for buffer insertion

There are efficient algorithms for net-based buffer insertion but they lead to sub-optimal path delays or unnecessarily large number of buffers due to their lack of global view. This can increase power consumption as well as die area. The ordering of nets for buffer insertion has a crucial impact on the quality of buffering in terms of path delay and the number of used buffers. A good net ordering can extend the local view of any net-based buffer insertion algorithm.In this paper, an efficient O(nlogn) algorithm for net ordering is presented. The net ordering problem is mapped to traditional knapsack problem to obtain an efficient ordering. Experimental results show that our algorithm can meet timing constraints with an 18.8% reduction in the number of buffers on average.
LaSSIE—a knowledge-based software information system

In this paper, we discuss the important problem of invisibility that is inherent in the task of developing large software systems. There are no direct solutions to this problem; however, there are several categories of systemsrelational code analyzers, reuse librarians, and project management databases, that can be seen as addressing aspects of the invisibility problem. We argue that these systems do not adequately deal with certain important aspects of the problem of invisibility-seman2ic prolzferation, multiple views, and the need f o r intelligent indexing. We have built a system called LaSSIE, which uses knowledge representation and reasoning technology to directly address each of these three issues and thereby help with the invisibility problem. We conclude with an evaluation of the system, and a discussion of open problems and ongoing work.
A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm

A sequential quadratic programming (SQP) algorithm generating feasible iterates is described and analyzed. What distinguishes this algorithm from previous feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the proposed scheme still enjoys the same global and fast local convergence properties. A preliminary implementation has been tested and some promising numerical results are reported.
Advanced HgCdTe focal plane arrays

Boron implantation and heterojunction epitaxy have been the standard techniques for the production of HgCdTe focal plane arrays for a variety of applications. Each of these techniques has its special advantageous features. In this paper, we will describe an advanced HgCdTe junction formation technique, the planar ion-implantation-isolated heterojunction process, which utilizes the benefits of both the boron implantation and the heterojunction epitaxy techniques. HgCdTe arrays in the format of 320x256 and 640x512 have been produced by this method. The characteristics of these arrays are reported.
Incidence, Mechanisms, Predictors, and Clinical Impact of Acute and Late Stent Malapposition After Primary Intervention in Patients With Acute Myocardial Infarction: An Intravascular Ultrasound Substudy of the Harmonizing Outcomes With Revascularization and Stents in Acute Myocardial Infarction (HOR

Background— The incidence and mechanisms of acute and late stent malapposition after primary stent implantation in ST-segment elevation myocardial infarction remain unclear. Methods and Results— The Harmonizing Outcomes with Revascularization and Stents in Acute Myocardial Infarction (HORIZONS-AMI) trial was a dual-arm, factorial, randomized trial comparing paclitaxel-eluting stents (PES) and otherwise equivalent bare metal stents (BMS) in ST-segment elevation myocardial infarction patients. The intravascular ultrasound substudy enrolled 241 patients with 263 native coronary lesions (201 PES, 62 BMS) with baseline and 13-month follow-up imaging. Postintervention acute stent malapposition (ASM) occurred in 34.3% PES- and 40.3% BMS-treated lesions. Of these, 39.1% PES- and 40.0% BMS-treated lesions resolved at follow-up, especially within the stent body (66.7%); complete resolution was accompanied by a reduction in external elastic membrane area. An ASM area >1.2 mm2 best separated persistent from resolved ASM. At follow-up, a higher frequency of late stent malapposition was detected in PES-treated lesions (46.8%) mainly because of more late acquired stent malapposition (30.8%) compared with BMS-treated lesions. Late acquired stent malapposition area correlated to the decrease of peri-stent plaque in the subset of lesions without positive remodeling and only to change in external elastic membrane in the group with positive remodeling. Independent predictors of late acquired stent malapposition were plaque/thrombus protrusion (odds ratio, 5.60; 95% confidence interval [CI], 2.32 to 13.54) and PES use (odds ratio, 6.32; 95% CI, 2.15 to 18.62). Conclusions— The incidence of ASM was similar in PES- and BMS-treated lesions, but late acquired stent malapposition was more common in PES-treated lesions. The reason for resolved ASM was negative remodeling, with larger ASM areas separating persistent from resolved ASM. Late acquired stent malapposition was due mainly to positive remodeling and plaque/thrombus resolution. Clinical Trial Registration— URL: http://www.clinicaltrials. gov. Unique identifier: NCT00433966.
Sentence generation for pattern-based machine translation.

In this paper we discuss sentence generation strategy for pattern-based machine translation and their computational properties. Even though sentence generation in general is known to be computationally expensive, there exists a polynomial-time algorithm for synchronized sentence analysis/generation for “fixed” pattern-based (and its variant) grammars. Experimental results of implemented algorithm showed that the K-best generation algorithm runs fast enough to be used for practical machine translation systems, and elapsed time ratio of analysis and generation was about 50:1.
Subspace estimation approach to P300 detection and application to Brain-Computer Interface

Brain-computer interface (BCI) is a system for direct communication between brain and computer. In this work, a new unsupervised algorithm is introduced for P300 subspace estimation: the raw EEG are thus enhanced by projection on the estimated subspace. Moreover a simple scheme to detect the P300 potentials in the human EEG by dimension reduction and linear support vector machine (SVM) is proposed to build a BCI based on the P300 speller. The proposed algorithm is finally tested with dataset from the BCI Competition 2003 and gives results that compare favourably to the state of the art.
A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set

In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph $D$ on $n$ vertices and $m$ edges, and an integer $k$. The objective is to determine whether there exists a set of at most $k$ vertices intersecting every directed cycle of $D$. Whether or not DFVS admits a fixed parameter tractable (FPT) algorithm was considered the most important open problem in parameterized complexity until Chen, Liu, Lu, O'Sullivan and Razgon [JACM 2008] answered the question in the affirmative. They gave an algorithm for the problem with running time $O(k! 4^kk^4nm)$. Since then, no faster algorithm for the problem has been found. In this paper, we give an algorithm for DFVS with running time $O(k! 4^kk^5(n+m))$. Our algorithm is the first algorithm for DFVS with linear dependence on input size. Furthermore, the asymptotic dependence of the running time of our algorithm on the parameter $k$ matches up to a factor $k$ the algorithm of Chen, Liu, Lu, O'Sullivan and Razgon. On the way to designing our algorithm for DFVS, we give a general methodology to shave off a factor of $n$ from iterative-compression based algorithms for a few other well-studied covering problems in parameterized complexity. We demonstrate the applicability of this technique by speeding up by a factor of $n$, the current best FPT algorithms for Multicut [STOC 2011, SICOMP 2014] and Directed Subset Feedback Vertex Set [ICALP 2012, TALG 2014].
The eyes have it: a task by data type taxonomy for information visualizations

A useful starting point for designing advanced graphical user interfaces is the visual information seeking Mantra: overview first, zoom and filter, then details on demand. But this is only a starting point in trying to understand the rich and varied set of information visualizations that have been proposed in recent years. The paper offers a task by data type taxonomy with seven data types (one, two, three dimensional data, temporal and multi dimensional data, and tree and network data) and seven tasks (overview, zoom, filter, details-on-demand, relate, history, and extracts).
The Glycolytic Phenotype is Correlated with Aggressiveness and Poor Prognosis in Invasive Ductal Carcinomas

Purpose Glucose uptake and glycolytic metabolism are enhanced in cancer cells, and increased expression of glucose transporter 1 (GLUT1) has also been reported. The aim of this study was to investigate GLUT1 expression in human breast tissues and invasive ductal carcinomas. Methods We used tissue microarrays consisting of normal breast tissue, ductal hyperplasia, ductal carcinoma in situ, invasive ductal carcinoma, and lymph node metastases. We examined GLUT1 expression in the microarrays by immunohistochemistry, reviewed the medical records and performed a clinicopathological analysis. Results Membranous GLUT1 expression was observed in normal and tumor cells. GLUT1 expression was higher in ductal carcinoma in situ, invasive ductal carcinoma, and lymph node metastasis than in normal tissue and ductal hyperplasia (p=0.002). Of 276 invasive ductal carcinomas, 106 (38.4%) showed GLUT1 expression. GLUT1 expression was correlated with higher histologic grade (p<0.001), larger tumor size (p=0.025), absence of estrogen receptor (p<0.001), absence of progesterone receptor (p<0.001), and triple-negative phenotype (p<0.001). In univariate survival analysis, patients with GLUT1 expression had poorer overall survival and disease-free survival (p=0.017 and p=0.021, respectively, log-rank test). In multivariate survival analysis with the Cox proportional hazards model, GLUT1 expression was an independent prognostic factor of poorer overall survival and disease-free survival (p=0.017 and p=0.019, respectively). Conclusion GLUT1 expression seems to play an important role in malignant transformation, and the glycolytic phenotype in invasive ductal carcinoma may indicate aggressive biological behavior and a worse prognosis.
Robust Model-Based Sensor Fault Monitoring System for Nonlinear Systems in Sensor Networks

A new model-based sensor fault diagnosis (FD) scheme, using an equivalent model, is developed for a kind of Multiple Inputs Multiple Outputs (MIMO) nonlinear system which fulfills the Lipschitz condition. The equivalent model, which is a bank of one-dimensional linear state equations with the bounded model uncertainty, can take the place of a plant's exact nonlinear model in the case of sensor FD. This scheme shows a new perspective whereby, by using the equivalent model, it doesn't have to study the nonlinear internal structure character or get the exact model. The influence of the model uncertainty on the residuals is explained in this paper. A method, called pretreatment, is utilized to minimize the model uncertainty. The eigenstructure assignment method with assistant state is employed to solve the problem of perfect decoupling against the model uncertainty, disturbance, system faults, the relevant actuator faults, or even the case of no input from the relevant actuator. The realization of the proposed scheme is given by an algorithm according to a single sensor FD, and verified by a simulation example. Depending on the above, a sensor fault monitoring system is established by the sensor network and diagnosis logic, then the effectiveness is testified by a simulation.
Efficient distributed source detection with limited bandwidth

Given a simple graph <i>G</i>=(<i>V,E</i>) and a set of sources <i>S</i> ⊆ <i>V</i>, denote for each node ν ε <i>V</i> by <i>L</i><sub>ν</sub><sup>(∞)</sup> the lexicographically ordered list of distance/source pairs (<i>d</i>(<i>s,v</i>),<i>s</i>), where <i>s</i> ∈ <i>S</i>. For integers <i>d,k</i> ∈ N∪{∞}, we consider the <i>source detection</i>, or (<i>S,d,k</i>)-detection task, requiring each node <i>v</i> to learn the first <i>k</i> entries of <i>L</i><sub>ν</sub><sup>(∞)</sup> (if for all of them <i>d</i>(<i>s,v</i>) ≤ <i>d</i>) or all entries (<i>d</i>(<i>s,v</i>),<i>s</i>) ∈ <i>L</i><sub>ν</sub><sup>(∞)</sup> satisfying that <i>d</i>(<i>s,v</i>) ≤ <i>d</i> (otherwise). Solutions to this problem provide natural generalizations of concurrent breadth-first search (BFS) tree constructions. For example, the special case of <i>k</i>=∞ requires each source <i>s</i> ∈ <i>S</i> to build a complete BFS tree rooted at <i>s</i>, whereas the special case of <i>d</i>=∞ and <i>S</i>=<i>V</i> requires constructing a partial BFS tree comprising at least <i>k</i> nodes from every node in <i>V</i>. In this work, we give a simple, near-optimal solution for the source detection task in the CONGEST model, where messages contain at most <i>O</i>(log <i>n</i>) bits, running in <i>d+k</i> rounds. We demonstrate its utility for various routing problems, exact and approximate diameter computation, and spanner construction. For those problems, we obtain algorithms in the CONGEST model that are faster and in some cases much simpler than previous solutions.