nils-herrmann/clean_scirepeval huggingface dataset:
Multicast Outage Probability and Transmission Capacity of Multihop Wireless Networks

Multicast transmission, wherein the same packet must be delivered to multiple receivers, is an important aspect of sensor and tactical networks and has several distinctive traits as opposed to more commonly studied unicast networks. Specially, these include 1) identical packets must be delivered successfully to several nodes, 2) outage at any receiver requires the packet to be retransmitted at least to that receiver, and 3) the multicast rate is dominated by the receiver with the weakest link in order to minimize outage and retransmission. A first contribution of this paper is the development of a tractable multicast model and throughput metric that captures each of these key traits in a multicast wireless network. We utilize a Poisson cluster process (PCP) consisting of a distinct Poisson point process (PPP) for the transmitters and receivers, and then define the multicast transmission capacity (MTC) as the maximum achievable multicast rate per transmission attempt times the maximum intensity of multicast clusters under decoding delay and multicast outage constraints. A multicast cluster is a contiguous area over which a packet is multicasted, and to reduce outage it can be tessellated into v smaller regions of multicast. The second contribution of the paper is the analysis of several key aspects of this model, for which we develop the following main result. Assuming τ/v transmission attempts are allowed for each tessellated region in a multicast cluster, we show that the MTC is Θ(ρkxlog(k)vy) where ρ, x and y are functions of τ and v depending on the network size and intensity, and k is the average number of the intended receivers in a cluster. We derive {ρ, x, y} for a number of regimes of interest, and also show that an appropriate number of retransmissions can significantly enhance the MTC.
Smart home automation system using Bluetooth technology

In this paper a low cost and user friendly remote controlled home automation system is presented using Arduino board, Bluetooth module, smartphone, ultrasonic sensor and moisture sensor. A smartphone application is used in the suggested system which allows the users to control up to 18 devices including home appliances and sensors using Bluetooth technology. Nowadays, most of conventional home automation systems are designed for special purposes while proposed system is a general purpose home automation system. Which can easily be implement in existing home. The suggested system has more features than conventional home automation systems such as an ultrasonic sensor is used for water level detection and soil moisture sensor is use for automatic plant irrigation system. This paper also describes the hardware and software architecture of system, future work and scope. The proposed prototype of home automation system is implemented and tested on hardware and it gave the exact and expected results.
Vision-based topological mapping and localization methods: A survey

Topological maps model the environment as a graph, where nodes are distinctive places of the environment and edges indicate topological relationships between them. They represent an interesting alternative to the classic metric maps, due to their simplicity and storage needs, what has made topological mapping and localization an active research area. The different solutions that have been proposed during years have been designed around several kinds of sensors. However, in the last decades, vision approaches have emerged because of the technology improvements and the amount of useful information that a camera can provide. In this paper, we review the main solutions presented in the last fifteen years, and classify them in accordance to the kind of image descriptor employed. Advantages and disadvantages of each approach are thoroughly reviewed and discussed.
On the privacy of anonymized networks

The proliferation of online social networks, and the concomitant accumulation of user data, give rise to hotly debated issues of privacy, security, and control. One specific challenge is the sharing or public release of anonymized data without accidentally leaking personally identifiable information (PII). Unfortunately, it is often difficult to ascertain that sophisticated statistical techniques, potentially employing additional external data sources, are unable to break anonymity. In this paper, we consider an instance of this problem, where the object of interest is the structure of a social network, i.e., a graph describing users and their links. Recent work demonstrates that anonymizing node identities may not be sufficient to keep the network private: the availability of node and link data from another domain, which is correlated with the anonymized network, has been used to re-identify the anonymized nodes. This paper is about conditions under which such a de-anonymization process is possible.
 We attempt to shed light on the following question: can we assume that a sufficiently sparse network is inherently anonymous, in the sense that even with unlimited computational power, de-anonymization is impossible? Our approach is to introduce a random graph model for a version of the de-anonymization problem, which is parameterized by the expected node degree and a similarity parameter that controls the correlation between two graphs over the same vertex set. We find simple conditions on these parameters delineating the boundary of privacy, and show that the mean node degree need only grow slightly faster than log n with network size n for nodes to be identifiable. Our results have policy implications for sharing of anonymized network information.
MAOA, maltreatment, and gene–environment interaction predicting children's mental health: new evidence and a meta-analysis

Previous research on adults has shown that a functional polymorphism in the promoter region of the monoamine oxidase A (MAOA) gene moderates the impact of childhood maltreatment on risk for developing antisocial behavior. Thus far, attempts to replicate this finding have been mixed. The current study (i) presents new data investigating this finding in a sample of 975 seven-year-old boys, and (ii) evaluates the extant data by conducting a meta-analysis of published findings. We replicated the original finding by showing that the MAOA polymorphism moderates the development of psychopathology after exposure to physical abuse, we extended the finding to childhood closer in time to the maltreatment experience, and we ruled-out the possibility of a spurious finding by accounting for passive and evocative gene–environment correlation. Moreover, meta-analysis demonstrated that across studies, the association between maltreatment and mental health problems is significantly stronger in the group of males with the genotype conferring low vs high MAOA activity. These findings provide the strongest evidence to date suggesting that the MAOA gene influences vulnerability to environmental stress, and that this biological process can be initiated early in life.
Radar-based Fall Detection Based on Doppler Time-Frequency Signatures for Assisted Living

Falls are a major public health concern and main causes of accidental death in the senior U.S. population. Timely and accurate detection permits immediate assistance after a fall and, thereby, reduces complications of fall risk. Radar technology provides an effective means for this purpose because it is non-invasive, insensitive to lighting conditions as well as obstructions, and has less privacy concerns. In this paper, we develop an effective fall detection scheme for the application in continuous-wave radar systems. The proposed scheme exploits time-frequency characteristics of the radar Doppler signatures, and the motion events are classified using the joint statistics of three different features, including the extreme frequency, extreme frequency ratio, and the length of event period. Sparse Bayesian classifier based on the relevance vector machine is used to perform the classification. Laboratory experiments are performed to collect radar data corresponding to different motion patterns to verify the effectiveness of the proposed algorithm.
Psoas Major: a case report and review of its anatomy, biomechanics, and clinical implications.

A 25-year-old male professional hockey player with right sided hip pain was diagnosed with myofascopathy of the right psoas major and rectus femoris. The patient maintained a conservative treatment regimen and was prescribed a four week active strengthening program. The program progressed from resisted concentric exercise to eccentric abduction/adduction exercises along with balance training, core stabilizing and endurance exercises in the first two weeks. In the final two weeks the program progressed to include sport specific exercises. At three weeks the patient was able to participate in non-contact practice and was clear for full contact at five weeks. The anatomy, biomechanics, and function of the psoas major muscle are discussed as is its influence on lumbar spine stability. Evidence-based evaluation and management strategies for psoas dysfunction are presented.
Groute: An Asynchronous Multi-GPU Programming Model for Irregular Computations

Nodes with multiple GPUs are becoming the platform of choice for high-performance computing. However, most applications are written using bulk-synchronous programming models, which may not be optimal for irregular algorithms that benefit from low-latency, asynchronous communication. This paper proposes constructs for asynchronous multi-GPU programming, and describes their implementation in a thin runtime environment called Groute. Groute also implements common collective operations and distributed work-lists, enabling the development of irregular applications without substantial programming effort. We demonstrate that this approach achieves state-of-the-art performance and exhibits strong scaling for a suite of irregular applications on 8-GPU and heterogeneous systems, yielding over 7x speedup for some algorithms.
Copy Detection Mechanisms for Digital Documents

In a digital library system, documents are available in digital form and therefore are more easily copied and their copyrights are more easily violated. This is a very serious problem, as it discourages owners of valuable information from sharing it with authorized users. There are two main philosophies for addressing this problem: prevention and detection. The former actually makes unauthorized use of documents difficult or impossible while the latter makes it easier to discover such activity.In this paper we propose a system for registering documents and then detecting copies, either complete copies or partial copies. We describe algorithms for such detection, and metrics required for evaluating detection mechanisms (covering accuracy, efficiency, and security). We also describe a working prototype, called COPS, describe implementation issues, and present experimental results that suggest the proper settings for copy detection parameters.
Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems

We tackle the problem of scheduling task graphs onto a heterogeneous set of machines, where each processor has a probability of failure governed by an exponential law. The goal is to design algorithms that optimize both makespan and reliability. First, we provide an optimal scheduling algorithm for independent unitary tasks where the objective is to maximize the reliability subject to makespan minimization. For the bi-criteria case, we provide an algorithm that approximates the Pareto-curve. Next, for independent non-unitary tasks, we show that the product {failure rate}x {unitary instruction execution time} is crucial to distinguish processors in this context. Based on these results we are able to let the user choose a trade-off between reliability maximization and makespan minimization. For general task graphs we provide a method for converting scheduling heuristics on heterogeneous cluster into heuristics that take reliability into account. Here again, we show how we can help the user to select a trade-off between makespan and reliability.
FaThumb: a facet-based interface for mobile search

In this paper we describe a novel approach for searching large data sets from a mobile phone. Existing interfaces for mobile search require keyword text entry and are not suited for browsing. Our alternative uses a hybrid model to de-emphasize tedious keyword entry in favor of iterative data filtering. We propose navigation and selection of hierarchical metadata (facet navigation), with incremental text entry to further narrow the results. We conducted a formative evaluation to understand the relative advantages of keyword entry versus facet navigation for both browse and search tasks on the phone. We found keyword entry to be more powerful when the name of the search target is known, while facet navigation is otherwise more effective and strongly preferred.
A-PNR: Automatic Plate Number Recognition

Automatic Plate Number Recognition (APNR) has important applications in traffic surveillance, toll booth, protected parking lot, No parking zone, etc. It is a challenging problem, especially when the license plates have varying sizes, the number of lines, fonts, background diversity etc. This work aims to address APNR using deep learning method for real-time traffic images. We first extract license plate candidates from each frame using edge information and geometrical properties, ensuring high recall using one class SVM. The verified candidates are used for NP recognition purpose along with a spatial transformer network (STN) for character recognition. Our system is evaluated on several traffic images with vehicles having different license plate formats in terms of tilt, distances, colors, illumination, character size, thickness etc. Also, the background was very challenging. Results demonstrate robustness to such variations and impressive performance in both the localization and recognition.
Detecting Adversarial Samples Using Density Ratio Estimates

Machine learning models, especially based on deep learning are used in everyday applications ranging from self driving cars to medical diagnostics. However, it is easy to trick such models using adversarial samples, indistinguishable from real samples to human eye, such samples can lead to incorrect classifications. Impact of adversarial samples is far-reaching and efficient detection of adversarial samples remains an open problem. In this paper we propose to use direct density ratio estimation as a model agnostic measure to detect adversarial samples, we empirically show that adversarial samples have different underlying probability densities compared to real samples. Our proposed method works well with colored and grayscale images, and with different adversarial sample generation methods.
TrendLearner: Early Prediction of Popularity Trends of User Generated Content

Accurately predicting the popularity of user generated content (UGC) is very valuable to content providers, online advertisers, as well as social media and social network researchers. However, it is also a challenging task due to the plethora of factors that affect content popularity in social systems. We here focus on the problem of predicting the popularity trend of a piece of UGC (object) as early as possible, as a step towards building more accurate popularity prediction methods. Unlike previous work, we explicitly address the inherent tradeoff between prediction accuracy and remaining interest in the object after prediction, since, to be useful, accurate predictions should be made before interest has exhausted. Moreover, given the heterogeneity in popularity dynamics across objects in most UGC applications, this tradeoff has to be solved on a per-object basis, which makes the prediction task harder. We propose to tackle this problem with a novel two-step learning approach in which we: (1) extract popularity trends from previously uploaded objects, and then (2) predict trends for newly uploaded content. The first step exploits a time series clustering algorithm to represent each trend by a time series centroid. We propose to treat the second step as a classification problem. First, we extract a set of features of the target object corresponding to the distances of its early popularity curve to the previously identified centroids. We then combine these features with content features (e.g., incoming links, category), using them to train classifiers for prediction. Our experimental results for YouTube datasets show that we can achieve Micro and Macro F1 scores between 0.61 and 0.71 (a gain of up to 38% when compared to alternative approaches), with up to 68% of the views still remaining for 50% or 21% of the videos, depending on the dataset. We also show that our approach can be applied to produce predictions of content popularity at a future date that are much more accurate than recently proposed regression-based and state-space based models, with accuracy improvements of at least 33% and 59%, on average.
Shilling attacks against recommender systems: a comprehensive survey

Online vendors employ collaborative filtering algorithms to provide recommendations to their customers so that they can increase their sales and profits. Although recommendation schemes are successful in e-commerce sites, they are vulnerable to shilling or profile injection attacks. On one hand, online shopping sites utilize collaborative filtering schemes to enhance their competitive edge over other companies. On the other hand, malicious users and/or competing vendors might decide to insert fake profiles into the user-item matrices in such a way so that they can affect the predicted ratings on behalf of their advantages. In the past decade, various studies have been conducted to scrutinize different shilling attacks strategies, profile injection attack types, shilling attack detection schemes, robust algorithms proposed to overcome such attacks, and evaluate them with respect to accuracy, cost/benefit, and overall performance. Due to their popularity and importance, we survey about shilling attacks in collaborative filtering algorithms. Giving an overall picture about various shilling attack types by introducing new classification attributes is imperative for further research. Explaining shilling attack detection schemes in detail and robust algorithms proposed so far might open a lead to develop new detection schemes and enhance such robust algorithms further, even propose new ones. Thus, we describe various attack types and introduce new dimensions for attack classification. Detailed description of the proposed detection and robust recommendation algorithms are given. Moreover, we briefly explain evaluation of the proposed schemes. We conclude the paper by discussing various open questions.
Vital, Sophia, and Co. - The Quest for the Legal Personhood of Robots

The paper examines today’s debate on the legal status of AI robots, and how often scholars and policy makers confuse the legal agenthood of these artificial agents with the status of legal personhood. By taking into account current trends in the field, the paper suggests a twofold stance. First, policy makers shall seriously mull over the possibility of establishing novel forms of accountability and liability for the activities of AI robots in contracts and business law, e.g., new forms of legal agenthood in cases of complex distributed responsibility. Second, any hypothesis of granting AI robots full legal personhood has to be discarded in the foreseeable future. However, how should we deal with Sophia, which became the first AI application to receive citizenship of any country, namely, Saudi Arabia, in October 2017? Admittedly, granting someone, or something, legal personhood is—as always has been—a highly sensitive political issue that does not simply hinge on rational choices and empirical evidence. Discretion, arbitrariness, and even bizarre decisions play a role in this context. However, the normative reasons why legal systems grant human and artificial entities, such as corporations, their status, help us taking sides in today’s quest for the legal personhood of AI robots. Is citizen Sophia really conscious, or capable of suffering the slings and arrows of outrageous scholars?
The good and the bad system: does the test collection predict users' effectiveness?

Test collections are extensively used in the evaluation of information retrieval systems. Crucial to their use is the degree to which results from them predict user effectiveness. At first, past studies did not substantiate a relationship between system and user effectiveness; more recently, however, correlations have begun to emerge. The results of this paper strengthen and extend those findings. We introduce a novel methodology for investigating the relationship, which shows great success in establishing a significant correlation between system and user effectiveness. It is shown that users behave differently and discern differences between pairs of systems that have a very small absolute difference in test collection effectiveness. Our results strengthen the use of test collections in IR evaluation, confirming that users' effectiveness can be predicted successfully.
Does Mindfulness Meditation Enhance Attention ? A Randomized Controlled Trial

Mindfulness-based interventions have been incorporated into a variety of psychotherapies. Attentional disruptions are common in many mental disorders, and it seems generally accepted that practicing mindfulness enhances attention. We tested the hypothesis that mindfulness training would enhance four components of attention: sustained vigilance, concentration, inhibition of distraction, and executive control. A randomized three-group design included: (1) a mindfulness meditation group, (2) a progressive muscle relaxation group to control for effects of physical relaxation on attention, (3) a wait-listed group to control for practice effects of repeated measures. Fiftythree community adults were randomly assigned to one of these groups. Forty-five participants completed the 4-week program. After training and 4 weeks of twice-daily practice, the mindfulness group demonstrated significantly greater discriminability on a signal detection task than did the other groups. Significant improvements in sustained attention were found following mindfulness meditation, which did not appear to be mediated by relaxation or practice effects. Performances on measures of concentration and inhibition of distraction did not support the hypothesis. These results partially support current considerations of mindfulness meditation to enhance attention.