nils-herrmann/clean_scirepeval huggingface dataset:
Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts

Neural-based multi-task learning has been successfully used in many real-world large-scale applications such as recommendation systems. For example, in movie recommendations, beyond providing users movies which they tend to purchase and watch, the system might also optimize for users liking the movies afterwards. With multi-task learning, we aim to build a single model that learns these multiple goals and tasks simultaneously. However, the prediction quality of commonly used multi-task models is often sensitive to the relationships between tasks. It is therefore important to study the modeling tradeoffs between task-specific objectives and inter-task relationships. In this work, we propose a novel multi-task learning approach, Multi-gate Mixture-of-Experts (MMoE), which explicitly learns to model task relationships from data. We adapt the Mixture-of-Experts (MoE) structure to multi-task learning by sharing the expert submodels across all tasks, while also having a gating network trained to optimize each task. To validate our approach on data with different levels of task relatedness, we first apply it to a synthetic dataset where we control the task relatedness. We show that the proposed approach performs better than baseline methods when the tasks are less related. We also show that the MMoE structure results in an additional trainability benefit, depending on different levels of randomness in the training data and model initialization. Furthermore, we demonstrate the performance improvements by MMoE on real tasks including a binary classification benchmark, and a large-scale content recommendation system at Google.
Monitoring disaster impact: detecting micro-events and eyewitness reports in mainstream and social media

This paper approaches the problem of monitoring the impact of the disasters by mining web sources for the events, caused by these disasters. We refer to these disaster effects as “micro-events”. Micro-events typically following a large disaster include casualties, damage on infrastructures, vehicles, services and resource supply, as well as relief operations. We present natural language grammar learning algorithms which form the basis for building micro-event detection systems from data, with no or minor human intervention, and we show how they can be applied to mainstream news and social media for monitoring disaster impact. We also experimented with applying statistical classifiers to distill, from social media situational updates on disasters, eyewitness reports from directly affected people. Finally, we describe a Twitter mining robot, which integrates some of these monitoring techniques and is intended to serve as a multilingual content hub for enhancing situational awareness.
Don't Interrupt Me While I Type: Inferring Text Entered Through Gesture Typing on Android Keyboards

We present a new side-channel attack against soft keyboards that support gesture typing on Android smartphones. An application without any special permissions can observe the number and timing of the screen hardware interrupts and system-wide software interrupts generated during user input, and analyze this information to make inferences about the text being entered by the user. System-wide information is usually considered less sensitive than app-specific information, but we provide concrete evidence that this may be mistaken. Our attack applies to all Android versions, including Android M where the SELinux policy is tightened. We present a novel application of a recurrent neural network as our classifier to infer text. We evaluate our attack against the “Google Keyboard” on Nexus 5 phones and use a real-world chat corpus in all our experiments. Our evaluation considers two scenarios. First, we demonstrate that we can correctly detect a set of pre-defined “sentences of interest” (with at least 6 words) with 70% recall and 60% precision. Second, we identify the authors of a set of anonymous messages posted on a messaging board. We find that even if the messages contain the same number of words, we correctly re-identify the author more than 97% of the time for a set of up to 35 sentences. Our study demonstrates a new way in which systemwide resources can be a threat to user privacy. We investigate the effect of rate limiting as a countermeasure but find that determining a proper rate is error-prone and fails in subtle cases. We conclude that real-time interrupt information should be made inaccessible, perhaps via a tighter SELinux policy in the next Android version.
A new facial expression recognition based on curvelet transform and online sequential extreme learning machine initialized with spherical clustering

In this paper, a novel algorithm is proposed for facial expression recognition by integrating curvelet transform and online sequential extreme learning machine (OSELM) with radial basis function (RBF) hidden node having optimal network architecture. In the proposed algorithm, the curvelet transform is firstly applied to each region of the face image divided into local regions instead of whole face image to reduce the curvelet coefficients too huge to classify. Feature set is then generated by calculating the entropy, the standard deviation and the mean of curvelet coefficients of each region. Finally, spherical clustering (SC) method is employed to the feature set to automatically determine the optimal hidden node number and RBF hidden node parameters of OSELM by aim of increasing classification accuracy and reducing the required time to select the hidden node number. So, the learning machine is called as OSELM-SC. It is constructed two groups of experiments: The aim of the first one is to evaluate the classification performance of OSELM-SC on the benchmark datasets, i.e., image segment, satellite image and DNA. The second one is to test the performance of the proposed facial expression recognition algorithm on the Japanese Female Facial Expression database and the Cohn-Kanade database. The obtained experimental results are compared against the state-of-the-art methods. The results demonstrate that the proposed algorithm can produce effective facial expression features and exhibit good recognition accuracy and robustness.
A very-high output impedance current mirror for very-low voltage biomedical analog circuits

In this paper, we present the design of a new very-high output impedance CMOS current mirror with enhanced output voltage compliance. The proposed current mirror uses MOS current dividers to sample the output current and a feedback action is used to force it to be equal to the input current; yielding very high impedance with a very large output voltage range. The proposed implementation yields an increase of the output impedance by a factor of about gmro compared with that of the super-Wilson current mirror, thus offering a potential solution to mitigate the effect of the low output impedance of ultra-deep submicron CMOS transistors used in sub 1-V current mirrors and current sources. A NMOS version of the proposed current mirror circuit was implemented using STMicroelectronics 1-V 90-nm CMOS process and simulated using Spectre to validate its performance. The output current is mirrored with a transfer error lower than 1% down to an output voltage as low as 80 mV for an input current of 5 muA, and 111 mV when the input current is increased to 50 muA.
Evaluating three treatments for borderline personality disorder: a multiwave study.

The authors examined three yearlong outpatient treatments for borderline personality disorder: dialectical behavior therapy, transference-focused psychotherapy, and a dynamic supportive treatment.



Ninety patients who were diagnosed with borderline personality disorder were randomly assigned to transference-focused psychotherapy, dialectical behavior therapy, or supportive treatment and received medication when indicated. Prior to treatment and at 4-month intervals during a 1-year period, blind raters assessed the domains of suicidal behavior, aggression, impulsivity, anxiety, depression, and social adjustment in a multiwave study design.



Individual growth curve analysis revealed that patients in all three treatment groups showed significant positive change in depression, anxiety, global functioning, and social adjustment across 1 year of treatment. Both transference-focused psychotherapy and dialectical behavior therapy were significantly associated with improvement in suicidality. Only transference-focused psychotherapy and supportive treatment were associated with improvement in anger. Transference-focused psychotherapy and supportive treatment were each associated with improvement in facets of impulsivity. Only transference-focused psychotherapy was significantly predictive of change in irritability and verbal and direct assault.



Patients with borderline personality disorder respond to structured treatments in an outpatient setting with change in multiple domains of outcome. A structured dynamic treatment, transference-focused psychotherapy was associated with change in multiple constructs across six domains; dialectical behavior therapy and supportive treatment were associated with fewer changes. Future research is needed to examine the specific mechanisms of change in these treatments beyond common structures.
Supervised and Unsupervised methods to detect Insider Threat from Enterprise Social and Online Activity Data

Insider threat is a significant security risk for organizations, and detection of insider threat is of paramount concern to organizations. In this paper, we attempt to discover insider threat by analyzing enterprise social and online activity data of employees. To this end, we process and extract relevant features that are possibly indicative of insider threat behavior. This includes features extracted from social data including email communication patterns and content, and online activity data such as web browsing patterns, email frequency, and file and machine access patterns. Subsequently, we take two approaches to detect insider threat: (i) an unsupervised approach where we identify statistically abnormal behavior with respect to these features using state-of-the-art anomaly detection methods, and (ii) a supervised approach where we use labels indicating when employees quit the company as a proxy for insider threat activity to design a classifier. We test our approach on a real world data set with artificially injected insider threat events. We obtain a ROC score of 0.77 for the unsupervised approach, and a classification accuracy of 73.4% for the supervised approach. These results indicate that our proposed approaches are fairly successful in identifying insider threat events. Finally, we build a visualization dashboard that enables managers and HR personnel to quickly identify employees with high threat risk scores which will enable them to take suitable preventive measures and limit security risk.
A survey of communication/networking in Smart Grids

Smart Grid is designed to integrate advanced communication/networking technologies into electrical power grids to make them ‘‘smarter’’. Current situation is that most of the blackouts and voltage sags could be prevented if we have better and faster communication devices and technologies for the electrical grid. In order to make the current electrical power grid a Smart Grid, the design and implementation of a new communication infrastructure for the grid are two important fields of research. However, Smart Grid projects have only been proposed in recent years and only a few proposals for forwardlooking requirements and initial research work have been offered in this field. No any systematic reviews of communication/networking in Smart Grids have been conducted yet. Therefore, we conduct a systematic review of communication/networking technologies in Smart Grid in this paper, including communication/networking architecture, different communication technologies thatwould be employed into this architecture, quality of service (QoS), optimizing utilization of assets, control and management, etc.
Trust management for the internet of things and its application to service composition

The Internet of Things (IoT) integrates a large amount of everyday life devices from heterogeneous network environments, bringing a great challenge into security and reliability management. Recognizing that the smart objects in IoT are most likely human-carried or human-operated devices, we propose a scalable trust management protocol for IoT, with the emphasis on social relationships. We consider multiple trust properties including honesty, cooperativeness, and community-interest to account for social interaction. Each node performs trust evaluation towards a limited set of devices of its interest only. The trust management protocol is event-driven upon the occurrence of a social encounter or interaction event, and trust is aggregated using both direct observations and indirect recommendations. We analyze the effect of trust parameters on trust assessment accuracy and trust convergence time. Our results show that there exists a trade-off between trust assessment accuracy vs. trust convergence time in the presence of false recommendations attacks performed by malicious nodes. We demonstrate the effectiveness of the proposed trust management protocol with a trust-based service composition application. Our results indicate that trust-based service composition significantly outperforms non-trust-based (random) service composition and its performance approaches the maximum achievable performance with global knowledge.
Emotion Analysis Using Latent Affective Folding and Embedding

Though data-driven in nature, emotion analysis based on latent semantic analysis still relies on some measure of expert knowledge in order to isolate the emotional keywords or keysets necessary to the construction of affective categories. This makes it vulnerable to any discrepancy between the ensuing taxonomy of affective states and the underlying domain of discourse. This paper proposes a more general strategy which leverages two distincts semantic levels, one that encapsulates the foundations of the domain considered, and one that specifically accounts for the overall affective fabric of the language. Exposing the emergent relationship between these two levels advantageously informs the emotion classification process. Empirical evidence suggests that this is a promising solution for automatic emotion detection in text.
Revised and abbreviated forms of the Genderism and Transphobia Scale: tools for assessing anti-trans prejudice.

Many studies of anti-trans prejudice have measured such attitudes using the Genderism and Transphobia Scale (GTS; Hill & Willoughby, 2005). The GTS is unique in assessing negative attitudes and propensity for violence toward trans people. The present research addressed previously observed limitations in the psychometric properties of data produced by the GTS, including inconsistencies in factor structure and subscale scoring across studies. Results across the present 2 studies (Ns = 314 and 250) yielded 2 refined versions of the GTS: the 22-item GTS-Revised (GTS-R) and a more abbreviated 13-item GTS-R-Short Form (GTS-R-SF), each of which produced stable 2-factor structures corresponding with the intended negative attitudes and propensity for violence dimensions of the GTS. The 2 versions differ in that the GTS-R-SF Genderism/Transphobia subscale focuses on more severe expressions of prejudicial attitudes, whereas the longer GTS-R Genderism/Transphobia subscale assesses subtle expressions of prejudice as well. The Gender-Bashing subscale is identical across the 2 versions. Thus, researchers and practitioners may choose the GTS-R or GTS-R-SF depending on the breadth of prejudicial attitudes they wish to assess. Reliability estimates for GTS-R and GTS-R-SF scale and subscale item responses were acceptable and stable across the 2 studies, and validity evidence was garnered in Study 2. These findings can inform use of the GTS-R and GTS-R-SF in research and practice settings, where psychometric precision and efficiency are both critical.
Streaming feature selection using alpha-investing

In Streaming Feature Selection (SFS), new features are sequentially considered for addition to a predictive model. When the space of potential features is large, SFS offers many advantages over traditional feature selection methods, which assume that all features are known in advance. Features can be generated dynamically, focusing the search for new features on promising subspaces, and overfitting can be controlled by dynamically adjusting the threshold for adding features to the model. We describe α-investing, an adaptive complexity penalty method for SFS which dynamically adjusts the threshold on the error reduction required for adding a new feature. α-investing gives false discovery rate-style guarantees against overfitting. It differs from standard penalty methods such as AIC, BIC or RIC, which always drastically over- or under-fit in the limit of infinite numbers of non-predictive features. Empirical results show that SFS is competitive with much more compute-intensive feature selection methods such as stepwise regression, and allows feature selection on problems with over a million potential features.
Fundamental of Content Based Image Retrieval

The aim of this paper is to review the present state of the art in content-based image retrieval (CBIR), a technique for retrieving images on the basis of automatically-derived features like color, texture and shape. Our findings are based both on a review of the relevant literature and on discussions with researchers in the field. There is need to find a desired image from a collection is shared by many professional groups, including journalists, design engineers and art historians. During the requirements of image users can vary considerably, it can be useful to illustrate image queries into three levels of abstraction first is primitive features such as color or shape, second is logical features such as the identity of objects shown and last is abstract attributes such as the significance of the scenes depicted. While CBIR systems currently operate well only at the lowest of these levels, most users demand higher levels of retrieval.
Computer animation of knowledge-based human grasping

The synthesis of human hand motion and grasping of arbitrary shaped objects is a very complex problem. Therefore high-level control is needed to perform these actions. In order to satisfy the kinematic and physical constraints associated with the human hand and to reduce the enormous search space associated with the problem of grasping objects, a knowledge based approach is used. A three-phased scheme is presented which incorporates the role of the hand, the object, the environment and the animator. The implementation of a hand simulation system HANDS is discussed.
Task-Oriented Query Reformulation with Reinforcement Learning

Search engines play an important role in our everyday lives by assisting us in finding the information we need. When we input a complex query, however, results are often far from satisfactory. In this work, we introduce a query reformulation system based on a neural network that rewrites a query to maximize the number of relevant documents returned. We train this neural network with reinforcement learning. The actions correspond to selecting terms to build a reformulated query, and the reward is the document recall. We evaluate our approach on three datasets against strong baselines and show a relative improvement of 5-20% in terms of recall. Furthermore, we present a simple method to estimate a conservative upperbound performance of a model in a particular environment and verify that there is still large room for improvements.
A Compact Size, Multi Octave Bandwidth Power Amplifier, Using LDMOS Transistors

A broadband push-pull power amplifier is presented that operates from 30MHz to 1000MHz. Coaxial cable transmission line baluns are used to split and combine the signal differentially. The balun acts also as a broadband 2:1 impedance transformer. The matching circuit consists of a piece of coaxial cable and some lumped elements. Using a packaged laterally diffused metal oxide semiconductor (LDMOS) transistor, a one dB compression output power of 39 dBm and a gain of 10 dB have been measured at 900 MHz. The input return loss is less than -10 dB across the entire band. The transistor is not internally matched and broadband matching techniques are used to match the transistor over multi octave bandwidth.
Flexible sensor for Mckibben pneumatic actuator

A flexible electro-conductive rubber sensor for measuring the length of a McKibben pneumatic actuator has been developed. Mckibben actuators are flexible, lightweight, and widely used to actuate power assisting devices for which compliance is required for safety. The actuator's length needs to be measured to control the devices accurately. However, the flexibility and lightweight properties might be lost if rigid sensors such as linear potentionmeters or encoders are directly attached to the actuators. To keep the desirable properties of McKibben actuators, compact and flexible sensors are necessary. In this paper, a flexible sensor using electro-conductive flexible rubber is proposed to measure the length of McKibben actuators. Using this sensor, a higher accuracy can be obtained by measuring the circumference displacement than directly measuring the axial displacement. The estimation accuracy is evaluated and the usefulness of the proposed method is verified by adopting to a multiple-link robot arm driven by the McKibben actuators.
BC-PDS: Protecting Privacy and Self-Sovereignty through BlockChains for OpenPDS

In the Big Data era, personal metadata may will become a new type of corporate asset, however there have already been a growing public concern about user’s privacy mined from metadata. In this paper we address the problem of implementing the self-sovereignty of personal metadata on the existing OpenPDS/SafeAnswers framework according to the Windhover Principle. In order to do that, we propose a new framework, called BlocakChain-based Personal Data Store (BCPDS), to realize two basic properties: notary and autonomy. This framework, firstly introduces the BlockChain as a notary, into OpenPDS/SafeAnswers for secure storage of personal meta-data instead of the original database. Next, we present an AutoNomybased Access Control (ANAC) to improve the SafeAnswers module, where ANAC is a new mechanism that enforces access based on the relationship among all authorized users and metadata’s owner. In addition, we also propose General Access Structure (GAS) and threshold secret sharing scheme in BlockChain as an implementation method for our BC-PDS framework.
Eudaimonic well-being, inequality, and health: Recent findings and future directions.

The theoretical and philosophical underpinnings of a eudaimonic model of well-being are examined and its empirical translation into distinct dimensions of well-being is described. Empirical findings have documented aging declines in eudaimonic well-being, but there is considerable variability within age groups. Among older adults who remain purposefully engaged, health benefits (reduced morbidity, extended longevity) have been documented. Eudaimonic well-being also appears to offer a protective buffer against increased health risk among the educationally disadvantaged. Neural and genetic mechanisms that may underlie eudaimonic influences on health are briefly noted, and interventions designed to promote eudaimonic well-being are sketched. Needed future research directions include addressing problems of unjust societies wherein greed among privileged elites may be a force compromising the eudaimonic well-being of those less privileged. Alternatively, and more positive in focus, is the need to better understand the role of the arts, broadly defined, in promoting eudaimonic well-being across all segments of society.