nils-herrmann/clean_scirepeval huggingface dataset:
Domestic Violence against Women in Jordan: Evidence from Health Clinics

To explore women’s attitudes toward intimate partner violence (IPV) and their determinants, as well as to document the prevalence of various types of violence among women attending public health centers in the Balka region, Jordan. A cross-sectional study among ever-married women aged 18–49 who visited the public health clinics in the governorate of Balka, Jordan, was carried out in August 2006. A total of 356 women was successfully interviewed. Descriptive statistics and adjusted odds ratios from logistic regression were used to assess associations between attitudes towards IPV and selected background variables. The vast majority (87%) of women reported different types of IPV against them in the last 12 months. The most common types of reported violence were emotional abuse (47.5%), followed by wife beating (19.6%). Almost one-third of women justified wife beating by husbands. Older age, younger age at marriage, rural residence, and non-working status were significantly associated with supportive attitudes towards wife beating. The study shows a high prevalence of IPV against women during the past year, and a high rate of justifications for wife beating. Increasing women’s empowerment, particularly economic security through work outside the home, may protect women from violent behavior in this context.
Combining content and link for classification using matrix factorization

The world wide web contains rich textual contents that areinterconnected via complex hyperlinks. This huge database violates the assumption held by most of conventional statistical methods that each web page is considered as an independent and identical sample. It is thus difficult to apply traditional mining or learning methods for solving web mining problems, e.g., web page classification, by exploiting both the content and the link structure. The research in this direction has recently received considerable attention but are still in an early stage. Though a few methods exploit both the link structure or the content information, some of them combine the only authority information with the content information, and the others first decompose the link structure into hub and authority features, then apply them as additional document features. Being practically attractive for its great simplicity, this paper aims to design an algorithm that exploits both the content and linkage information, by carrying out a joint factorization on both the linkage adjacency matrix and the document-term matrix, and derives a new representation for web pages in a low-dimensional factor space, without explicitly separating them as content, hub or authority factors. Further analysis can be performed based on the compact representation of web pages. In the experiments, the proposed method is compared with state-of-the-art methods and demonstrates an excellent accuracy in hypertext classification on the WebKB and Cora benchmarks.
Methods for Linking EHR Notes to Education Materials

It has been shown that accessing the patients’ own electronic health records (EHR) can enhance their medical understanding and provide clinically relevant benefits. However, languages that are difficult for non-medical professionals to comprehend are prevalent in the EHR notes. The valuable and authoritative information contained in the EHR is thus less accessible to the patients, who ultimately stand to benefit the most from the information. To address this challenge, we are developing a system to retrieve EHR note-specific online consumer-oriented health education materials. We explored several query generation methods to convert long EHR notes to effective queries, including topic models and key concept identification. Our experiments show that queries using key concepts identified by a learning based model with pseudo-relevance feedback significantly outperform the baseline system of using the full text note.
Detecting and Naming Actors in Movies Using Generative Appearance Models

We introduce a generative model for learning person and costume specific detectors from labeled examples. We demonstrate the model on the task of localizing and naming actors in long video sequences. More specifically, the actor's head and shoulders are each represented as a constellation of optional color regions. Detection can proceed despite changes in view-point and partial occlusions. We explain how to learn the models from a small number of labeled key frames or video tracks, and how to detect novel appearances of the actors in a maximum likelihood framework. We present results on a challenging movie example, with 81% recall in actor detection (coverage) and 89% precision in actor identification (naming).
Robust 3D Patch-Based Face Hallucination

Incorporating 3D information has proven to be effective in many computer vision tasks and it is no exception in the context of facial analysis. However, limited application has been witnessed in face hallucination (FH), probably due to the difficulty of fitting 3D models onto low-resolution (LR) images. This paper presents a pure 3D approach to address this problem. By extending the LR image formation process to the 3D domain, the classic Lucas–Kanade algorithm is exploited to improve the precision of the error-prone 3D model fitting on LR images. The established correspondence between the input image and 3D training textures then facilitates reconstruction of high-resolution (HR) patches directly on the mesh, which can be employed to render realistic frontal faces for recognition. Extensive evaluation on several publicly available datasets reveals superior qualitative and quantitative results over state-of-the-art methods in fitting, FH and recognition, which shows the advantage of the proposed 3D framework over its 2D rivals, especially for non-frontal head poses and low image quality.
Social Security and Social Welfare Data Mining: An Overview

The importance of social security and social welfare business has been increasingly recognized in more and more countries. It impinges on a large proportion of the population and affects government service policies and people's life quality. Typical welfare countries, such as Australia and Canada, have accumulated a huge amount of social security and social welfare data. Emerging business issues such as fraudulent outlays, and customer service and performance improvements challenge existing policies, as well as techniques and systems including data matching and business intelligence reporting systems. The need for a deep understanding of customers and customer-government interactions through advanced data analytics has been increasingly recognized by the community at large. So far, however, no substantial work on the mining of social security and social welfare data has been reported. For the first time in data mining and machine learning, and to the best of our knowledge, this paper draws a comprehensive overall picture and summarizes the corresponding techniques and illustrations to analyze social security/welfare data, namely, social security data mining (SSDM), based on a thorough review of a large number of related references from the past half century. In particular, we introduce an SSDM framework, including business and research issues, social security/welfare services and data, as well as challenges, goals, and tasks in mining social security/welfare data. A summary of SSDM case studies is also presented with substantial citations that direct readers to more specific techniques and practices about SSDM.
Innovative Pedagogical Approaches to a Capstone Laboratory Course in Cyber Operations

This paper provides pedagogical lessons drawn from a capstone hands-on laboratory course in cyber operations. It is taught as a flipped class, where the center piece is a collection of exercises that require teams of students to set up, defend, and attack complex networks. Project designs are presented, including balancing offense and defense to improve course learning outcomes. Lessons on the recruiting and managing of an external "red team" are provided. Grading issues are addressed, as are techniques to manage students of different skills and motivations.
The problems of computer-assisted animation

In the last few years several systems have been written for aiding in the conventional two-dimensional animation process. The main purpose of these systems has been to let the computer produce missing drawings based on extreme drawings produced by animators. While there has been some success and a great deal of optimism, the promise of higher output and quality using a computer has not been realized. The transition from simple drawings optimized for use on the computer to the complicated and detailed drawings of quality conventional animation has been much harder than expected. The principle difficulty is that the animators drawings are really two dimensional projections of three dimensional characters as visualized in the animators head, hence information is lost, ie. one leg obscures another. The problem of making a program infer the original object from its projections is akin to extremely difficult artificial intelligence problems. Efforts to overcome this by drawing skeletons or increasing the number of overlays require more manual intervention thereby offsetting the gains of using the computer. One way to analyze an approach is to determine the average time required of an artist or operator at all stages of animation for every frame. A second problem not generally recognized is that a production animation system requires the management of hundreds of thousands of drawings, hence data base management techniques not normally found in experimental animation systems.
Functional-Anatomic Fractionation of the Brain's Default Network

One of the most consistent observations in human functional imaging is that a network of brain regions referred to as the "default network" increases its activity during passive states. Here we explored the anatomy and function of the default network across three studies to resolve divergent hypotheses about its contributions to spontaneous cognition and active forms of decision making. Analysis of intrinsic activity revealed the network comprises multiple, dissociated components. A midline core (posterior cingulate and anterior medial prefrontal cortex) is active when people make self-relevant, affective decisions. In contrast, a medial temporal lobe subsystem becomes engaged when decisions involve constructing a mental scene based on memory. During certain experimentally directed and spontaneous acts of future-oriented thought, these dissociated components are simultaneously engaged, presumably to facilitate construction of mental models of personally significant events.
From smart to smarter cities: Bridging the dimensions of technology and urban planning

This paper discusses the importance of urban form in smart cities. Development of urban form has been a major concern for urban planners, designers and policy makers. Sprawl is one way of urban development which is not considered good for a better living standard. Compact form arose as an opposed idea to urban sprawl. Form based codes (FBCs) is a tool for urban planning and design that attempts to mitigate the problem of urban sprawl, whereas conventional zoning strengthens this. This paper highlights the importance of physical place in smart city and how FBCs attempt to create better physical place than conventional zoning. Our study shows that FBCs can lead to smart growth which can be a solution to bridge technology and urban planning together in a single platform.
Concurrent Constraint Programming

This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of computing with partial information, and the concomitant notions of consistency and  In this framework, computation emerges from the interaction of concurrently executing agents that communicate by placing, checking and instantiating constraints on shared variables. Such a view of computation is interesting in the context of programming languages because of the ability to represent and manipulate partial information about the domain of discourse, in the context of concurrency because of the use of constraints for communication and control, and in the context of AI because of the availability of simple yet powerful mechanisms for controlling inference, and the promise that very rich representational/programming languages, sharing the same set of abstract properties, may be possible.
To reflect this view of computation, [Sar89] develops the cc family of languages. We present here one member of the family, cc(↓, →) (pronounced “cc with Ask and Choose”) which provides the basic operations of blocking Ask and atomic Tell and an algebra of behaviors closed under prefixing, indeterministic choice, interleaving, and hiding, and provides a mutual recursion operator. cc(↓, →) is (intentionally!) very similar to Milner's CCS, but for the radically different underlying concept of communication, which, in fact, provides a general—and elegant—alternative approach to “value-passing” in CCS. At the same time it adequately captures the framework of committed choice concurrent logic programming languages. We present the rules of behavior for cc agents, motivate a notion of “visible action” for them, and develop the notion of c-trees and reactive congruence analogous to Milner's synchronization trees and observational congruence. We also present an equational characterization of reactive congruence for Finitary cc(↓, →).
Safety-Aware Robot Damage Recovery Using Constrained Bayesian Optimization and Simulated Priors

The recently introduced Intelligent Trial-and-Error (IT&E) algorithm showed that robots can adapt to damage in a matter of a few trials. The success of this algorithm relies on two components: prior knowledge acquired through simulation with an intact robot, and Bayesian optimization (BO) that operates on-line, on the damaged robot. While IT&E leads to fast damage recovery, it does not incorporate any safety constraints that prevent the robot from attempting harmful behaviors. In this work, we address this limitation by replacing the BO component with a constrained BO procedure. We evaluate our approach on a simulated damaged humanoid robot that needs to crawl as fast as possible, while performing as few unsafe trials as possible. We compare our new “safety-aware IT&E” algorithm to IT&E and a multi-objective version of IT&E in which the safety constraints are dealt as separate objectives. Our results show that our algorithm outperforms the other approaches, both in crawling speed within the safe regions and number of unsafe trials.
Aspect based sentiment analysis in social media with classifier ensembles

The analysis of user generated content on social media and the accurate specification of user opinions towards products and events is quite valuable to many applications. With the proliferation of Web 2.0 and the rapid growth of user-generated content on the web, approaches on aspect level sentiment analysis that yield fine grained information are of great interest. In this work, a classifier ensemble approach for aspect based sentiment analysis is presented. The approach is generic and utilizes latent dirichlet allocation to model a topic and to specify the main aspects that users address. Then, each comment is further analyzed and word dependencies that indicate the interactions between words and aspects are extracted. An ensemble classifier formulated by naive bayes, maximum entropy and support vector machines is designed to recognize the polarity of the user's comment towards each aspect. The evaluation results show sound improvement compared to individual classifiers and indicate that the ensemble system is scalable and accurate in analyzing user generated content and in specifying users' opinions and attitudes.
A Comparative Study of Feature Extraction Algorithms in Customer Reviews

The paper systematically compares two feature extraction algorithms to mine product features commented on in customer reviews. The first approach  identifies candidate features by applying a set of POS patterns and pruning the candidate set based on the log likelihood ratio test. The second approach [11] applies association rule mining for identifying frequent features and a heuristic based on the presence of sentiment terms for identifying infrequent features. We evaluate the performance of the algorithms on five product specific document collections regarding consumer electronic devices. We perform an analysis of errors and discuss advantages and limitations of the algorithms.
A survey of middleware for sensor network and challenges

In recent years, wireless sensor network (WSN) has emerged as a highly important research area. Middleware for WSN facilitates development and deployment of a large number of applications such as smart environments, weather forecasting, bridge monitoring, health applications, etc. for sensor networks. But due to resource constraints, unreliability of wireless networks, and diversity in available sensor hardware, middleware for WSN presents a number of new challenges. In this paper, we try to find out and elaborate various challenges associated with the development of middleware for WSN. We present a comparative study of several existing middleware and how they address those challenges. In doing so, we point out the limitations of present generation middleware for sensor networks. We also illustrate how much more work needs to be done to make middleware for WSN suitable for general purpose usage in real world
A Design and Assessment of a Direction Finding Proximity Fuze Sensor

This paper presents the implementation and assessment of a direction finding proximity fuze sensor for anti-aircrafts or anti-air missiles. A higher rejection of clutter signals is achieved by employing a binary phase shift keying modulation using Legendre sequence. The direction finding is implemented by comparing received powers from six receiving antennas equally spaced by an angle of 60° around a cylindrical surface. In addition, target detection algorithms have been developed for a robust detection of the target, taking the wide variation of target related parameters into considerations. The performances of the developed fuze sensor are experimentally verified by constructing the fuze-specific encounter simulation test apparatus, which collects and analyzes reflected signals from a standard target. The developed fuze sensor can successfully detect the -10 dBsm target over a 10 m range as well as the direction with an out-of-range rejection of about 40 dB. Furthermore, the developed fuze sensor can clearly detect the target with mesh clutter environment. To assess realistic operation, the fuze sensor is tested using 155 mm gun firing test setup. Through the gun firing test, the successful fuzing range and direction finding performances are demonstrated.
Rotationally Invariant Descriptors Using Intensity Order Pooling

This paper proposes a novel method for interest region description which pools local features based on their intensity orders in multiple support regions. Pooling by intensity orders is not only invariant to rotation and monotonic intensity changes, but also encodes ordinal information into a descriptor. Two kinds of local features are used in this paper, one based on gradients and the other on intensities; hence, two descriptors are obtained: the Multisupport Region Order-Based Gradient Histogram (MROGH) and the Multisupport Region Rotation and Intensity Monotonic Invariant Descriptor (MRRID). Thanks to the intensity order pooling scheme, the two descriptors are rotation invariant without estimating a reference orientation, which appears to be a major error source for most of the existing methods, such as Scale Invariant Feature Transform (SIFT), SURF, and DAISY. Promising experimental results on image matching and object recognition demonstrate the effectiveness of the proposed descriptors compared to state-of-the-art descriptors.
AttentionXML: Extreme Multi-Label Text Classification with Multi-Label Attention Based Recurrent Neural Networks

Extreme multi-label text classification (XMTC) is a task for tagging each given text with the most relevant multiple labels from an extremely large-scale label set. This task can be found in many applications, such as product categorization, web page tagging, news annotation and so on. Many methods have been proposed so far for solving XMTC, while most of the existing methods use traditional bag-of-words (BOW) representation, ignoring word context as well as deep semantic information. XML-CNN, a state-ofthe-art deep learning-based method, uses convolutional neural network (CNN) with dynamic pooling to process the text, going beyond the BOW-based appraoches but failing to capture 1) the long-distance dependency among words and 2) different levels of importance of a word for each label. We propose a new deep learningbased method, AttentionXML, which uses bidirectional long short-term memory (LSTM) and a multi-label attention mechanism for solving the above 1st and 2nd problems, respectively. We empirically compared AttentionXML with other six state-of-the-art methods over five benchmark datasets. AttentionXML outperformed all competing methods under all experimental settings except only a couple of cases. In addition, a consensus ensemble of AttentionXML with the second best method, Parabel, could further improve the performance over all five benchmark datasets.
Classification of Brain Cancer using Artificial Neural Network

A Brain Cancer Detection and Classification System has been designed and developed. The system uses computer based procedures to detect tumor blocks or lesions and classify the type of tumor using Artificial Neural Network in MRI images of different patients with Astrocytoma type of brain tumors. The image processing techniques such as histogram equalization, image segmentation, image enhancement, morphological operations and feature extraction have been developed for detection of the brain tumor in the MRI images of the cancer affected patients. The extraction of texture features in the detected tumor has been achieved by using Gray Level Co-occurrence Matrix (GLCM). These features are compared with the stored features in the Knowledge Base. Finally a Neuro Fuzzy Classifier has been developed to recognize different types of brain cancers. The whole system has been tested in two phases firstly Learning/Training Phase and secondly Recognition/Testing Phase. The known MRI images of affected brain cancer patients obtained from Radiology Department of Tata Memorial Hospital (TMH) were used to train the system. The unknown samples of brain cancer affected MRI images are also obtained from TMH and were used to test the system. The system was found efficient in classification of these samples and responds any abnormality.