nils-herrmann/clean_scirepeval huggingface dataset:
Low rank matrix recovery from rank one measurements

We study the recovery of Hermitian low rank matrices X ∈ C n×n from under-sampled measurements via nuclear norm minimization. We consider the particular scenario where the measurements are Frobenius inner products with random rank-one matrices of the form a j a * j for some measurement vectors a the measurements are given by y j = tr(Xa j a * j). The case where the matrix X = xx * to be recovered is of rank one reduces to the problem of phaseless estimation (from measurements, y j = |x, a j | 2 via the PhaseLift approach, which has been introduced recently. We derive bounds for the number m of measurements that guarantee successful uniform recovery of Hermitian rank r matrices, either for the vectors a j , j = 1,. .. , m, being chosen independently at random according to a standard Gaussian distribution, or a j being sampled independently from an (approximate) complex pro-jective t-design with t = 4. In the Gaussian case, we require m ≥ Crn measurements, while in the case of 4-designs we need m ≥ Crn log(n). Our results are uniform in the sense that one random choice of the measurement vectors a j guarantees recovery of all rank r-matrices simultaneously with high probability. Moreover, we prove robustness of recovery under perturbation of the measurements by noise. The result for approximate 4-designs generalizes and improves a recent bound on phase retrieval due to Gross, Kueng and Krahmer. In addition, it has applications in quantum state tomography. Our proofs employ the so-called bowling scheme which is based on recent ideas by Mendelson and Koltchinskii.
Stereotypes of individuals with learning disabilities: views of college students with and without learning disabilities.

To explore possible reasons for low self-identification rates among undergraduates with learning disabilities (LD), we asked students (38 with LD, 100 without LD) attending two large, public, research-intensive universities to respond to a questionnaire designed to assess stereotypes about individuals with LD and conceptions of ability. Responses were coded into six categories of stereotypes about LD (low intelligence, compensation possible, process deficit, nonspecific insurmountable condition, working the system, and other), and into three categories of conceptions of intelligence (entity, incremental, neither). Consistent with past findings, the most frequent metastereotype reported by individuals in both groups related to generally low ability. In addition, students with LD were more likely to espouse views of intelligence as a fixed trait. As a whole, the study's findings have implications for our understanding of factors that influence self-identification and self-advocacy at the postsecondary level.
Lack of sleep affects the evaluation of emotional stimuli

Sleep deprivation (SD) negatively affects various cognitive performances, but surprisingly evidence about a specific impact of sleep loss on subjective evaluation of emotional stimuli remains sparse. In the present study, we assessed the effect of SD on the emotional rating of standardized visual stimuli selected from the International Affective Picture System. Forty university students were assigned to the sleep group (n=20), tested before and after one night of undisturbed sleep at home, or to the deprivation group, tested before and after one night of total SD. One-hundred and eighty pictures (90 test, 90 retest) were selected and categorized as pleasant, neutral and unpleasant. Participants were asked to judge their emotional reactions while viewing pictures by means of the Self-Assessment Manikin. Subjective mood ratings were also obtained by means of Visual Analog Scales. No significant effect of SD was observed on the evaluation of pleasant and unpleasant stimuli. On the contrary, SD subjects perceived the neutral pictures more negatively and showed an increase of negative mood and a decrease of subjective alertness compared to non-deprived subjects. Finally, an analysis of covariance on mean valence ratings of neutral pictures using negative mood as covariate confirmed the effect of SD. Our results indicate that sleep is involved in regulating emotional evaluation. The emotional labeling of neutral stimuli biased toward negative responses was not mediated by the increase of negative mood. This effect can be interpreted as an adaptive reaction supporting the "better safe than sorry" principle. It may also have applied implications for healthcare workers, military and law-enforcement personnel.
Amodal Detection of 3D Objects: Inferring 3D Bounding Boxes from 2D Ones in RGB-Depth Images

This paper addresses the problem of amodal perception of 3D object detection. The task is to not only find object localizations in the 3D world, but also estimate their physical sizes and poses, even if only parts of them are visible in the RGB-D image. Recent approaches have attempted to harness point cloud from depth channel to exploit 3D features directly in the 3D space and demonstrated the superiority over traditional 2.5D representation approaches. We revisit the amodal 3D detection problem by sticking to the 2.5D representation framework, and directly relate 2.5D visual appearance to 3D objects. We propose a novel 3D object detection system that simultaneously predicts objects 3D locations, physical sizes, and orientations in indoor scenes. Experiments on the NYUV2 dataset show our algorithm significantly outperforms the state-of-the-art and indicates 2.5D representation is capable of encoding features for 3D amodal object detection. All source code and data is on https://github.com/phoenixnn/Amodal3Det.
The Q-matrix Method: Mining Student Response Data for Knowledge

Although many talented researchers have created excellent tools for computer-assisted instruction and intelligent tutoring systems, creating high-quality, effective, scalable but individualized tools for learning at a low cost is still an open research challenge. Many learning tools create complex models of student behavior that require extensive time on the part of subject experts, as well as cognitive science researchers, to create effective help and feedback strategies. In this research, we propose a different approach, called the q-matrix method, where data from student behavior is “mined” to create concept models of the material being taught. These models are then used to both understand student behavior and direct learning paths for future students. We describe the q-matrix method and present preliminary results that imply that the method can effectively predict which concepts need further review.
Temporal Segmentation of Egocentric Videos

The use of wearable cameras makes it possible to record life logging egocentric videos. Browsing such long unstructured videos is time consuming and tedious. Segmentation into meaningful chapters is an important first step towards adding structure to egocentric videos, enabling efficient browsing, indexing and summarization of the long videos. Two sources of information for video segmentation are (i) the motion of the camera wearer, and (ii) the objects and activities recorded in the video. In this paper we address the motion cues for video segmentation. Motion based segmentation is especially difficult in egocentric videos when the camera is constantly moving due to natural head movement of the wearer. We propose a robust temporal segmentation of egocentric videos into a hierarchy of motion classes using a new Cumulative Displacement Curves. Unlike instantaneous motion vectors, segmentation using integrated motion vectors performs well even in dynamic and crowded scenes. No assumptions are made on the underlying scene structure and the method works in indoor as well as outdoor situations. We demonstrate the effectiveness of our approach using publicly available videos as well as choreographed videos. We also suggest an approach to detect the fixation of wearer's gaze in the walking portion of the egocentric videos.
Online Attendance Management System Using RFID with Object Counter

Educational institutions’ administrators in our country and the whole world are concerned about regularity of student attendance. Student overall academic performance is affected by it. The conventional method of taking attendance by calling names or signing on paper is very time consuming, and hence inefficient. Radio Frequency Identification (RFID) based attendance system is one of the solutions to address this problem. A system that can automatically capture student’s attendance by flashing their student card at the RFID reader and save all the mentioned troubles was given by T.S.Lim et al. . Arulogun O. T. et al made an attempt to solve recurrent lecture attendance monitoring problem in developing countries using RFID technology . Rajan Patel et al  presents the integration of ubiquitous computing systems into classroom for managing the students’ attendance using RFID technology. H.B. Hamid et al  gave a system that has been built using the web-based applications such as JSP, MySQL and Apache to cater the recording and reporting of the students’ attendances. NetBeans IDE 6.1 is used for developing the overall system. We have proposed the system in this paper using C#. Microsoft Visual Studio is used for the system designing. Also, the issue related to fake /false attendance through the RFID system has been addressed, we eliminate it by using a special object counter for the head count. Ankita Agrawal & Ashish Bansal 132
Cannabis use in adolescence and risk for adult psychosis: longitudinal prospective study.

The strongest evidence that cannabis use may be a risk factor for later psychosis comes from a Swedish cohort study which found that heavy cannabis use at age 18 increased the risk of later schizophrenia sixfold. 2 This study could not establish whether adolescent cannabis use was a consequence of pre-existing psychotic symptoms rather than a cause. We present the first prospective longitudinal study of adolescent cannabis use as a risk factor for adult schizophreniform disorder, taking into account childhood psychotic symptoms antedating cannabis use.
Automatic EEG processing for the early diagnosis of Traumatic Brain Injury

Traumatic Brain Injury (TBI) is recognized as an important cause of death and disabilities after an accident. The availability a tool for the early diagnosis of brain dysfunctions could greatly improve the quality of life of people affected by TBI and even prevent deaths. The contribution of the paper is a process including several methods for the automatic processing of electroencephalography (EEG) data, in order to provide a fast and reliable diagnosis of TBI. Integrated in a portable decision support system called EmerEEG, the TBI diagnosis is obtained using discriminant analysis based on quantitative EEG (qEEG) features extracted from data recordings after the automatic removal of artifacts. The proposed algorithm computes the TBI diagnosis on the basis of a model extracted from clinically-labelled EEG records. The system evaluations have confirmed the speed and reliability of the processing algorithms as well as the system's ability to deliver accurate diagnosis. The developed algorithms have achieved 79.1% accuracy in removing artifacts, and 87.85% accuracy in TBI diagnosis. Therefore, the developed system enables a short response time in emergency situations and provides a tool the emergency services could base their decision upon, thus preventing possibly miss-diagnosed injuries.
Be More Transparent and Users Will Like You: A Robot Privacy and User Experience Design Experiment

Robots interacting with humans in public spaces often need to collect users' private information in order to provide the required services. Current privacy legislation in major jurisdictions requires organisations to disclose information about their data collection process and obtain user's consent prior to collecting privacy sensitive information. In this study, we consider a privacy-sensitive design of a data collection system for face identification. We deployed a face enrolment system on a humanoid robot with human-like gesturing and speech. We compared it with an equivalent system, in terms of capability and interactive process, on a screen-based interactive kiosk. In our previous contribution, we investigated the effects that embodiment has on users' privacy considerations. We found that an embodied humanoid robot is capable of collecting more private information from users in comparison to a disembodied interactive kiosk. However, this effect was statistically significant only when the two compared systems were using a transparent interface, i.e. an interface communicating to users the privacy policies for data processing and storage. Thus, in this work, we aim to further investigate the effects of transparency on users' privacy considerations and their experience with robot applications. We found that when comparing a non-transparent vs. transparent interface within the same system (i.e. on an embodied robot or on a disembodied kiosk) transparency does not lead to significant effects on users' privacy considerations. However, we found that transparency leads to a significantly better user experience for both systems. Therefore, our overall analyses suggest that both the interactive robot and the interactive kiosk are capable of enhancing the user experience by providing transparent information to users, which is required by privacy legislation. However, an interactive kiosk providing transparent information elicits significantly more privacy concerns in users as compared to the robot supplying the very same transparent information. This exploratory study provides conclusions that provide valuable insights for designing robot applications dealing with users privacy and it discusses the related legal implications, concluding with recommendations for privacy policymakers.
A General Framework for Sparsity Regularized Feature Selection via Iteratively Reweighted Least Square Minimization

A variety of feature selection methods based on sparsity regularization have been developed with different loss functions and sparse regularization functions. Capitalizing on the existing sparsity regularized feature selection methods, we propose a general sparsity feature selection (GSR-FS) algorithm that optimizes a -norm ( ) based loss function with a -norm ( ) sparse regularization function. The -norm ( ) based loss function brings flexibility to balance data-fitting and robustness to outliers by tuning its parameter, and the -norm ( ) based regularization function is able to boost the sparsity for feature selection. To solve the optimization problem with multiple non-smooth and non-convex functions when , we develop an efficient solver under the general umbrella of Iterative Reweighted Least Square (IRLS) algorithms. Our algorithm has been proved to converge with a theoretical convergence order of at least . The experimental results have demonstrated that our method could achieve competitive feature selection performance on publicly available datasets compared with state-of-the-art feature selection methods, with reduced computational cost.
Lazy Decision Trees

Lazy learning algorithms, exemplified by nearestneighbor algorithms, do not induce a concise hypothesis from a given training set; the inductive process is delayed until a test instance is given. Algorithms for constructing decision trees, such as C4.5, ID3, and CART create a single “best” decision tree during the training phase, and this tree is then used to classify test instances. The tests at the nodes of the constructed tree are good on average, but there may be better tests for classifying a specific instance. We propose a lazy decision tree algorithm-LAzuDT-that conceptually constructs the “best” decision tree for each test instance. In practice, only a path needs to be constructed, and a caching scheme makes the algorithm fast. The algorithm is robust with respect to missing values without resorting to the complicated methods usually seen in induction of decision trees. Experiments on real and artificial problems are presented.
A Survey on Multicarrier Communications: Prototype Filters, Lattice Structures, and Implementation Aspects

Due to their numerous advantages, communications over multicarrier schemes constitute an appealing approach for broadband wireless systems. Especially, the strong penetration of orthogonal frequency division multiplexing (OFDM) into the communications standards has triggered heavy investigation on multicarrier systems, leading to re-consideration of different approaches as an alternative to OFDM. The goal of the present survey is not only to provide a unified review of waveform design options for multicarrier schemes, but also to pave the way for the evolution of the multicarrier schemes from the current state of the art to future technologies. In particular, a generalized framework on multicarrier schemes is presented, based on what to transmit, i.e., symbols, how to transmit, i.e., filters, and where/when to transmit, i.e., lattice. Capitalizing on this framework, different variations of orthogonal, bi-orthogonal, and non-orthogonal multicarrier schemes are discussed. In addition, filter designs for various multicarrier systems are reviewed considering four different design perspectives: energy concentration, rapid decay, spectrum nulling, and channel/hardware characteristics. Subsequently, evaluation tools which may be used to compare different filters in multicarrier schemes are studied. Finally, multicarrier schemes are evaluated from the perspective of practical implementation aspects, such as lattice adaptation, equalization, synchronization, multiple antennas, and hardware impairments.
Vision: automated security validation of mobile apps at app markets

Smartphones and "app" markets are raising concerns about how third-party applications may misuse or improperly handle users' privacy-sensitive data. Fortunately, unlike in the PC world, we have a unique opportunity to improve the security of mobile applications thanks to the centralized nature of app distribution through popular app markets. Thorough validation of apps applied as part of the app market admission process has the potential to significantly enhance mobile device security. In this paper, we propose AppInspector, an automated security validation system that analyzes apps and generates reports of potential security and privacy violations. We describe our vision for making smartphone apps more secure through automated validation and outline key challenges such as detecting and analyzing security and privacy violations, ensuring thorough test coverage, and scaling to large numbers of apps.
Satellite Imagery Multiscale Rapid Detection with Windowed Networks

Detecting small objects over large areas remains a significant challenge in satellite imagery analytics. Among the challenges is the sheer number of pixels and geographical extent per image: a single DigitalGlobe satellite image encompasses over 64 km and over 250 million pixels. Another challenge is that objects of interest are often minuscule (∼ 10 pixels in extent even for the highest resolution imagery), which complicates traditional computer vision techniques. To address these issues, we propose a pipeline (SIMRDWN) that evaluates satellite images of arbitrarily large size at native resolution at a rate of ≥ 0.2 km/s. Building upon the tensorflow object detection API paper , this pipeline offers a unified approach to multiple object detection frameworks that can run inference on images of arbitrary size. The SIMRDWN pipeline includes a modified version of YOLO (known as YOLT ), along with the models in : SSD , Faster R-CNN [22], and R-FCN . The proposed approach allows comparison of the performance of these four frameworks, and can rapidly detect objects of vastly different scales with relatively little training data over multiple sensors. For objects of very different scales (e.g. airplanes versus airports) we find that using two different detectors at different scales is very effective with negligible runtime cost. We evaluate large test images at native resolution and find mAP scores of 0.2 to 0.8 for vehicle localization, with the YOLT architecture achieving both the highest mAP and fastest inference speed.
Rubik: Knowledge Guided Tensor Factorization and Completion for Health Data Analytics

Computational phenotyping is the process of converting heterogeneous electronic health records (EHRs) into meaningful clinical concepts. Unsupervised phenotyping methods have the potential to leverage a vast amount of labeled EHR data for phenotype discovery. However, existing unsupervised phenotyping methods do not incorporate current medical knowledge and cannot directly handle missing, or noisy data.
 We propose Rubik, a constrained non-negative tensor factorization and completion method for phenotyping. Rubik incorporates 1) guidance constraints to align with existing medical knowledge, and 2) pairwise constraints for obtaining distinct, non-overlapping phenotypes. Rubik also has built-in tensor completion that can significantly alleviate the impact of noisy and missing data. We utilize the Alternating Direction Method of Multipliers (ADMM) framework to tensor factorization and completion, which can be easily scaled through parallel computing.
 We evaluate Rubik on two EHR datasets, one of which contains 647,118 records for 7,744 patients from an outpatient clinic, the other of which is a public dataset containing 1,018,614 CMS claims records for 472,645 patients. Our results show that Rubik can discover more meaningful and distinct phenotypes than the baselines. In particular, by using knowledge guidance constraints, Rubik can also discover sub-phenotypes for several major diseases. Rubik also runs around seven times faster than current state-of-the-art tensor methods. Finally, Rubik is scalable to large datasets containing millions of EHR records.
Scalable TCP Session Monitoring with Symmetric Receive-side Scaling

Receive-side scaling (RSS) is a technique that stores the arriving IP packets in the same flow into the same hardware queue of a modern network interface card (NIC). It allows scalable processing of the received packets by allowing exclusive access to the NIC queues by each CPU core. This removes the lock contention when accessing the NIC queue, and it allows concurrent access to different queues by multiple CPU cores. One problem with the existing RSS mechanism, however, is that it maps the IP packets in the same TCP connection to different NIC queues depending on the direction of the packets. In this paper, we present symmetric RSS, which allows mapping the packets in the same TCP connection to the same NIC queue regardless of whether they are upstream or downstream. The basic idea is to manipulate the RSS seeds such that the RSS hashes of the IP packets in the reverse direction to take on the same values with those in the forward direction. Since RSS hash calculation is done in the NIC hardware, it does not consume extra CPU cycles and promises high performance.