SoroushVahidi/scidocs huggingface dataset:
Gender differences in mathematics anxiety and the relation to mathematics performance while controlling for test anxiety
(2011)

Mathematics anxiety (MA), a state of discomfort associated with performing mathematical tasks, is thought to affect a notable proportion of the school age population. Some research has indicated that MA negatively affects mathematics performance and that girls may report higher levels of MA than boys. On the other hand some research has indicated that boys’ mathematics performance is more negatively affected by MA than girls’ performance is. The aim of the current study was to measure girls’ and boys’ mathematics performance as well as their levels of MA while controlling for test anxiety (TA) a construct related to MA but which is typically not controlled for in MA studies. Four-hundred and thirty three British secondary school children in school years 7, 8 and 10 completed customised mental mathematics tests and MA and TA questionnaires. No gender differences emerged for mathematics performance but levels of MA and TA were higher for girls than for boys. Girls and boys showed a positive correlation between MA and TA and a negative correlation between MA and mathematics performance. TA was also negatively correlated with mathematics performance, but this relationship was stronger for girls than for boys. When controlling for TA, the negative correlation between MA and performance remained for girls only. Regression analyses revealed that MA was a significant predictor of performance for girls but not for boys. Our study has revealed that secondary school children experience MA. Importantly, we controlled for TA which is typically not controlled for in MA studies. Girls showed higher levels of MA than boys and high levels of MA were related to poorer levels of mathematics performance. As well as potentially having a detrimental effect on ‘online’ mathematics performance, past research has shown that high levels of MA can have negative consequences for later mathematics education. Therefore MA warrants attention in the mathematics classroom, particularly because there is evidence that MA develops during the primary school years. Furthermore, our study showed no gender difference in mathematics performance, despite girls reporting higher levels of MA. These results might suggest that girls may have had the potential to perform better than boys in mathematics however their performance may have been attenuated by their higher levels of MA. Longitudinal research is needed to investigate the development of MA and its effect on mathematics performance.
The Virtual Human Interface: A Photorealistic Digital Human
(2003)

o mimic the quality of everyday human communication, future computer interfaces must combine the benefits of high visual fidelity with conversational intelligence and—above all—the ability to modulate the emotions of their users. From a computer graphics or visual perspective, achieving this goal requires creating synthetic digital humans that have photorealistic faces capable of expressing the finest shades of emotion. From a perceptual point of view, the same system must also read users' emotional reactions and adapt the behavior of the digital human accordingly. Our research focuses on implementing this concept to create a face-to-face system called the Virtual Human Interface (VHI). Photorealistic virtual humans— in contrast to nonrealistic virtual characters—make a more effective communication interface between computers and humans because they can stimulate declarative and procedural memory in the human brain. Declarative memory is our memory of information and events. Procedural memory, on the other hand, is the memory of how to do something, such as riding a bike. Most computer interfaces primarily access users' declarative memory; the person learns information about a particular topic. The VHI system, however, engages the user through entertaining emotional responses that help engrave knowledge in the user's mind and even modify the user's behavior through procedural memory. During the past several decades, researchers have conducted countless studies on agents and human animation. Early work mainly addressed low-polygon virtual humans that users could animate in real time. 1 Many of these animation systems initially addressed purposes other than the needs of human–computer interaction. However, the requirements of facial ani-mation—and especially speech synthesis—demand a different underlying architecture that can effectively model how real faces move and change. 2-4 As a result, research began to focus on creating autonomous agents that could exhibit rich personalities and interact in virtual worlds inhabited by other characters. To provide the illusion of a lifelike character, researchers have developed detailed emotional and personality models that can control the animation channels as a function of the virtual human's personality, mood, and emotions. 7-9 The real-time interaction with these virtual characters poses an extra set of technical challenges in terms of the speed, computational power, and visual quality required to make the user believe that he or she is interacting with a living creature. To achieve this goal, researchers eventually replaced precrafted animated actions with intelligent behavior modules that could control speech, locomotion, gaze, blinks, gestures (including various postures), and interaction with the …
SwellShark: A Generative Model for Biomedical Named Entity Recognition without Labeled Data
(2017)

We present SWELLSHARK, a framework for building biomedical named entity recognition (NER) systems quickly and without hand-labeled data. Our approach views biomedical resources like lexicons as function primitives for autogenerating weak supervision. We then use a generative model to unify and denoise this supervision and construct large-scale, probabilistically labeled datasets for training high-accuracy NER taggers. In three biomedical NER tasks, SWELLSHARK achieves competitive scores with state-of-the-art supervised benchmarks using no hand-labeled training data. In a drug name extraction task using patient medical records, one domain expert using SWELLSHARK achieved within 5.1% of a crowdsourced annotation approach – which originally utilized 20 teams over the course of several weeks – in 24 hours.
Robust Federated Learning Using ADMM in the Presence of Data Falsifying Byzantines
(2017)

In this paper, we consider the problem of federated (or decentralized) learning using ADMM with multiple agents. We consider a scenario where a certain fraction of agents (referred to as Byzantines) provide falsified data to the system. In this context, we study the convergence behavior of the decentralized ADMM algorithm. We show that ADMM converges linearly to a neighborhood of the solution to the problem under certain conditions. We next provide guidelines for network structure design to achieve faster convergence. Next, we provide necessary conditions on the falsified updates for exact convergence to the true solution. To tackle the data falsification problem, we propose a robust variant of ADMM. We also provide simulation results to validate the analysis and show the resilience of the proposed algorithm to Byzantines.
PIP Loss : A Unitary-invariant Metric for Understanding Functionality and Dimensionality of Vector Embeddings
(2018)

In this paper, we present a theoretical framework for understanding vector embedding, a fundamental building block of many deep learning models, especially in NLP. We discover a natural unitary-invariance in vector embeddings, which is required by the distributional hypothesis. This unitary-invariance states the fact that two embeddings are essentially equivalent if one can be obtained from the other by performing a relative-geometry preserving transformation, for example a rotation. This idea leads to the Pairwise Inner Product (PIP) loss, a natural unitary-invariant metric for the distance between two embeddings. We demonstrate that the PIP loss captures the difference in functionality between embeddings, and that it is tightly connect to two fundamental properties, namely similarity and compositionality. By formulating the embedding training process as matrix factorization under noise, we reveal a fundamental bias-variance tradeoff in dimensionality selection. With tools from perturbation and stability theory, we provide an upper bound on the PIP loss using the signal spectrum and noise variance, both of which can be readily inferred from data. Our framework sheds light on many empirical phenomena, including the existence of an optimal dimension, and the robustness of embeddings against over-parametrization. The bias-variance tradeoff of PIP loss explicitly answers the fundamental open problem of dimensionality selection for vector embeddings. 1 ar X iv :1 80 3. 00 50 2v 3 [ st at .M L ] 1 2 A pr 2 01 8
A Big Data system supporting Bosch Braga Industry 4.0 strategy
(2017)

People, devices, infrastructures and sensors can constantly communicate exchanging data and generating new data that trace many of these exchanges. This leads to vast volumes of data collected at ever increasing velocities and of different variety, a phenomenon currently known as Big Data. In particular, recent developments in Information and Communications Technologies are pushing the fourth industrial revolution, Industry 4.0, being data generated by several sources like machine controllers, sensors, manufacturing systems, among others. Joining volume, variety and velocity of data, with Industry 4.0, makes the opportunity to enhance sustainable innovation in the Factories of the Future. In this, the collection, integration, storage, processing and analysis of data is a key challenge, being Big Data systems needed to link all the entities and data needs of the factory. Thereby, this paper addresses this key challenge, proposing and implementing a Big Data Analytics architecture, using a multinational organisation (Bosch Car Multimedia – Braga) as a case study. In this work, all the data lifecycle, from collection to analysis, is handled, taking into consideration the different data processing speeds that can exist in the real environment of a factory (batch or stream).
UAVSim: A simulation testbed for unmanned aerial vehicle network cyber security analysis
(2013)

Increased use of unmanned systems in various tasks enables users to complete important missions without risking human lives. Nonetheless, these systems pose a huge threat if the operational cyber security is not handled properly, especially for the unmanned aerial vehicle systems (UAVS), which can cause catastrophic damages. Therefore, it is important to check the impact of various attack attempts on the UAV system. The most economical and insightful way to do this is to simulate operational scenarios of UAVs in advance. In this paper, we introduce UAVSim, a simulation testbed for Unmanned Aerial Vehicle Networks cyber security analysis. The testbed allows users to easily experiment by adjusting different parameters for the networks, hosts and attacks. In addition, each UAV host works on well-defined mobility framework and radio propagation models, which resembles real-world scenarios. Based on the experiments performed in UAVSim, we evaluate the impact of Jamming attacks against UAV networks and report the results to demonstrate the necessity and usefulness of the testbed.
Dynamic Modelling of Differential-Drive Mobile Robots using Lagrange and Newton-Euler Methodologies: A Unified Framework
(2013)

In recent years, there has been a considerable interest in the area of mobile robotics and educational technologies [1-7]. For control engineers and researchers, there is a wealth of literature dealing with wheeled mobile robots (WMR) control and their applications. However, while the subject of kinematic modeling of WMR is well documented and easily understood by students, the subject of dynamic modeling of WMR has not been addressed adequately in the literature. The dynamics of WMR are highly nonlinear and involve non-holonomic constraints which makes difficult their modeling and analysis especially for new engineering students starting their research in this field. Therefore, a detailed and accurate dynamic model describing the WMR motion need to be developed to offer students a general framework for simulation analysis and model based control system design.
Research Paper: Creating an Online Dictionary of Abbreviations from MEDLINE
(2002)

OBJECTIVE
The growth of the biomedical literature presents special challenges for both human readers and automatic algorithms. One such challenge derives from the common and uncontrolled use of abbreviations in the literature. Each additional abbreviation increases the effective size of the vocabulary for a field. Therefore, to create an automatically generated and maintained lexicon of abbreviations, we have developed an algorithm to match abbreviations in text with their expansions.


DESIGN
Our method uses a statistical learning algorithm, logistic regression, to score abbreviation expansions based on their resemblance to a training set of human-annotated abbreviations. We applied it to Medstract, a corpus of MEDLINE abstracts in which abbreviations and their expansions have been manually annotated. We then ran the algorithm on all abstracts in MEDLINE, creating a dictionary of biomedical abbreviations. To test the coverage of the database, we used an independently created list of abbreviations from the China Medical Tribune.


MEASUREMENTS
We measured the recall and precision of the algorithm in identifying abbreviations from the Medstract corpus. We also measured the recall when searching for abbreviations from the China Medical Tribune against the database.


RESULTS
On the Medstract corpus, our algorithm achieves up to 83% recall at 80% precision. Applying the algorithm to all of MEDLINE yielded a database of 781,632 high-scoring abbreviations. Of all the abbreviations in the list from the China Medical Tribune, 88% were in the database.


CONCLUSION
We have developed an algorithm to identify abbreviations from text. We are making this available as a public abbreviation server at \url[http://abbreviation.stanford.edu/].
The Unified Medical Language System (UMLS): integrating biomedical terminology
(2004)

The Unified Medical Language System (http://umlsks.nlm.nih.gov) is a repository of biomedical vocabularies developed by the US National Library of Medicine. The UMLS integrates over 2 million names for some 900,000 concepts from more than 60 families of biomedical vocabularies, as well as 12 million relations among these concepts. Vocabularies integrated in the UMLS Metathesaurus include the NCBI taxonomy, Gene Ontology, the Medical Subject Headings (MeSH), OMIM and the Digital Anatomist Symbolic Knowledge Base. UMLS concepts are not only inter-related, but may also be linked to external resources such as GenBank. In addition to data, the UMLS includes tools for customizing the Metathesaurus (MetamorphoSys), for generating lexical variants of concept names (lvg) and for extracting UMLS concepts from text (MetaMap). The UMLS knowledge sources are updated quarterly. All vocabularies are available at no fee for research purposes within an institution, but UMLS users are required to sign a license agreement. The UMLS knowledge sources are distributed on CD-ROM and by FTP.
Untangling Text Data Mining
(1999)

The possibilities for data mining from large text collections are virtually untapped. Text expresses a vast, rich range of information, but encodes this information in a form that is difficult to decipher automatically. Perhaps for this reason, there has been little work in text data mining to date, and most people who have talked about it have either conflated it with information access or have not made use of text directly to discover heretofore unknown information. In this paper I will first define data mining, information access, and corpus-based computational linguistics, and then discuss the relationship of these to text data mining. The intent behind these contrasts is to draw attention to exciting new kinds of problems for computational linguists. I describe examples of what I consider to be real text data mining efforts and briefly outline recent ideas about how to pursue exploratory data analysis over text.
GENIA corpus - a semantically annotated corpus for bio-textmining
(2003)

MOTIVATION
Natural language processing (NLP) methods are regarded as being useful to raise the potential of text mining from biological literature. The lack of an extensively annotated corpus of this literature, however, causes a major bottleneck for applying NLP techniques. GENIA corpus is being developed to provide reference materials to let NLP techniques work for bio-textmining.


RESULTS
GENIA corpus version 3.0 consisting of 2000 MEDLINE abstracts has been released with more than 400,000 words and almost 100,000 annotations for biological terms.
Information theoretic MPC for model-based reinforcement learning
(2017)

We introduce an information theoretic model predictive control (MPC) algorithm capable of handling complex cost criteria and general nonlinear dynamics. The generality of the approach makes it possible to use multi-layer neural networks as dynamics models, which we incorporate into our MPC algorithm in order to solve model-based reinforcement learning tasks. We test the algorithm in simulation on a cart-pole swing up and quadrotor navigation task, as well as on actual hardware in an aggressive driving task. Empirical results demonstrate that the algorithm is capable of achieving a high level of performance and does so only utilizing data collected from the system.
Fading memory and the problem of approximating nonlinear operators with volterra series
(1985)

Ahsfract-Using the notion of fading memory we prove very strong versions of two folk theorems. The first is that any time-inuariant (TZ) con~inuou.r nonlinear operator can be approximated by a Volterra series operator, and the second is that the approximating operator can be realized as a finiiedimensional linear dynamical system with a nonlinear readout map. While previous approximation results are valid over finite time inlero& and for signals in compact sets, the approximations presented here hold for all time and for signals in useful (noncompact) sets. The discretetime analog of the second theorem asserts that nny TZ operator with fading memory can be approximated (in our strong sense) by a nonlinear movingaverage operator. Some further discussion of the notion of fading memory is given.
Multimodal depression recognition with dynamic visual and audio cues
(2015)

In this paper, we present our system design for audio visual multi-modal depression recognition. To improve the estimation accuracy of the Beck Depression Inventory (BDI) score, besides the Low Level Descriptors (LLD) features and the Local Gabor Binary Pattern-Three Orthogonal Planes (LGBP-TOP) features provided by the 2014 Audio/Visual Emotion Challenge and Workshop (AVEC2014), we extract extra features to capture key behavioural changes associated with depression. From audio we extract the speaking rate, and from video, the head pose features, the Space-Temporal Interesting Point (STIP) features, and local kinematic features via the Divergence-Curl-Shear descriptors. These features describe body movements, and spatio-temporal changes within the image sequence. We also consider global dynamic features, obtained using motion history histogram (MHH), bag of words (BOW) features and vector of local aggregated descriptors (VLAD). To capture the complementary information within the used features, we evaluate two fusion systems - the feature fusion scheme, and the model fusion scheme via local linear regression (LLR). Experiments are carried out on the training set and development set of the Depression Recognition Sub-Challenge (DSC) of AVEC2014, we obtain root mean square error (RMSE) of 7.6697, and mean absolute error (MAE) of 6.1683 on the development set, which are better or comparable with the state of the art results of the AVEC2014 challenge.
Null hypothesis significance tests. A mix-up of two different theories: the basis for widespread confusion and numerous misinterpretations
(2014)

Null hypothesis statistical significance tests (NHST) are widely used in quantitative research in the empirical sciences including scientometrics. Nevertheless, since their introduction nearly a century ago significance tests have been controversial. Many researchers are not aware of the numerous criticisms raised against NHST. As practiced, NHST has been characterized as a ‘null ritual’ that is overused and too often misapplied and misinterpreted. NHST is in fact a patchwork of two fundamentally different classical statistical testing models, often blended with some wishful quasi-Bayesian interpretations. This is undoubtedly a major reason why NHST is very often misunderstood. But NHST also has intrinsic logical problems and the epistemic range of the information provided by such tests is much more limited than most researchers recognize. In this article we introduce to the scientometric community the theoretical origins of NHST, which is mostly absent from standard statistical textbooks, and we discuss some of the most prevalent problems relating to the practice of NHST and trace these problems back to the mix-up of the two different theoretical origins. Finally, we illustrate some of the misunderstandings with examples from the scientometric literature and bring forward some modest recommendations for a more sound practice in quantitative data analysis.
Comparative analysis of Role Base and Attribute Base Access Control Model in Semantic Web
(2012)

To control the unauthorized access to the resources and services is an emerging security issue in Semantic Web (SW). There are various existing access control models such as Role base, Attribute base, Credential base, Concept level access control models. They all have some strengths and weaknesses with them. In this paper we first take an overview of history of access control models and the need of access control models in semantic web. This paper has a discussion of strengths and weaknesses of the RBAC and ABAC. Than we have a comparative analysis of RBAC and ABAC with some points of issue
SDR-Based Resilient Wireless Communications
(2017)

As the use of wireless technologies increases significantly due to ease of deployment, cost-effectiveness and the increase in bandwidth, there is a critical need to make the wireless communications secure, and resilient to attacks or faults (malicious or natural). Wireless communications are inherently prone to cyberattacks due to the open access to the medium. While current wireless protocols have addressed the privacy issues, they have failed to provide effective solutions against denial of service attacks, session hijacking and jamming attacks.In this paper, we present a resilient wireless communication architecture based on Moving Target Defense, and Software Defined Radios (SDRs). The approach achieves its resilient operations by randomly changing the runtime characteristics of the wireless communications channels between different wireless nodes to make it extremely difficult to succeed in launching attacks. The runtime characteristics that can be changed include packet size, network address, modulation type, and the operating frequency of the channel. In addition, the lifespan for each configuration will be random. To reduce the overhead in switching between two consecutive configurations, we use two radio channels that are selected at random from a finite set of potential channels, one will be designated as an active channel while the second acts as a standby channel. This will harden the wireless communications attacks because the attackers have no clue on what channels are currently being used to exploit existing vulnerability and launch an attack. The experimental results and evaluation show that our approach can tolerate a wide range of attacks (Jamming, DOS and session attacks) against wireless networks.