nils-herrmann/clean_scirepeval huggingface dataset:
EXPLORInG THE CUSTOMER PERCEIVED VALUES AS AnTECEDEnT OF PURCHASE BEHAVIOR

Today, more than ever we see an increase in the importance of customer-orientation, and it's consideration as an important competitive advantage of organizations and its role in business success and development. The aim of this study is to survey a development of customer-oriented culture in chain stores, and also to discuss the relationships between the dimensions of customer value, perceived value, customer satisfaction, brand loyalty and repurchase intention. This study is based on a survey research, and the statistical population is consisted of customers a famous chain store in Tehran, and the selected samples are 390 persons from those customers. The data collection tool was a questionnaire and Confirmatory factor analysis and structural equation modeling techniques have been used to analyze the collected data. The results show that in consider chain stores, customer value affects on the Customer satisfaction. Moreover, it shows that customer satisfaction also affects brand loyalty. And at last it reveals that the proposed model explains the relationships between aspects of customer value, perceived value, customer satisfaction, brand loyalty and repurchase intention in an effective way.
Precise X-ray and video overlay for augmented reality fluoroscopy

The camera-augmented mobile C-arm (CamC) augments any mobile C-arm by a video camera and mirror construction and provides a co-registration of X-ray with video images. The accurate overlay between these images is crucial to high-quality surgical outcomes. In this work, we propose a practical solution that improves the overlay accuracy for any C-arm orientation by: (i) improving the existing CamC calibration, (ii) removing distortion effects, and (iii) accounting for the mechanical sagging of the C-arm gantry due to gravity. A planar phantom is constructed and placed at different distances to the image intensifier in order to obtain the optimal homography that co-registers X-ray and video with a minimum error. To alleviate distortion, both X-ray calibration based on equidistant grid model and Zhang’s camera calibration method are implemented for distortion correction. Lastly, the virtual detector plane (VDP) method is adapted and integrated to reduce errors due to the mechanical sagging of the C-arm gantry. The overlay errors are 0.38±0.06 mm when not correcting for distortion, 0.27±0.06 mm when applying Zhang’s camera calibration, and 0.27±0.05 mm when applying X-ray calibration. Lastly, when taking into account all angular and orbital rotations of the C-arm, as well as correcting for distortion, the overlay errors are 0.53±0.24 mm using VDP and 1.67±1.25 mm excluding VDP. The augmented reality fluoroscope achieves an accurate video and X-ray overlay when applying the optimal homography calculated from distortion correction using X-ray calibration together with the VDP.
Towards Security-Aware Virtual Environments for Digital Twins

Digital twins open up new possibilities in terms of monitoring, simulating, optimizing and predicting the state of cyber-physical systems (CPSs). Furthermore, we argue that a fully functional, virtual replica of a CPS can also play an important role in securing the system. In this work, we present a framework that allows users to create and execute digital twins, closely matching their physical counterparts. We focus on a novel approach to automatically generate the virtual environment from specification, taking advantage of engineering data exchange formats. From a security perspective, an identical (in terms of the system's specification), simulated environment can be freely explored and tested by security professionals, without risking negative impacts on live systems. Going a step further, security modules on top of the framework support security analysts in monitoring the current state of CPSs. We demonstrate the viability of the framework in a proof of concept, including the automated generation of digital twins and the monitoring of security and safety rules.
Temporal Event Sequence Simplification

Electronic Health Records (EHRs) have emerged as a cost-effective data source for conducting medical research. The difficulty in using EHRs for research purposes, however, is that both patient selection and record analysis must be conducted across very large, and typically very noisy datasets. Our previous work introduced EventFlow, a visualization tool that transforms an entire dataset of temporal event records into an aggregated display, allowing researchers to analyze population-level patterns and trends. As datasets become larger and more varied, however, it becomes increasingly difficult to provide a succinct, summarizing display. This paper presents a series of user-driven data simplifications that allow researchers to pare event records down to their core elements. Furthermore, we present a novel metric for measuring visual complexity, and a language for codifying disjoint strategies into an overarching simplification framework. These simplifications were used by real-world researchers to gain new and valuable insights from initially overwhelming datasets.
Evaluating Search Engines by Modeling the Relationship Between Relevance and Clicks

We propose a model that leverages the millions of clicks received by web search engines to predict document relevance. This allows the comparison of ranking functions when clicks are available but complete relevance judgments are not. After an initial training phase using a set of relevance judgments paired with click data, we show that our model can predict the relevance score of documents that have not been judged. These predictions can be used to evaluate the performance of a search engine, using our novel formalization of the confidence of the standard evaluation metric discounted cumulative gain (DCG), so comparisons can be made across time and datasets. This contrasts with previous methods which can provide only pair-wise relevance judgments between results shown for the same query. When no relevance judgments are available, we can identify the better of two ranked lists up to 82% of the time, and with only two relevance judgments for each query, we can identify the better ranking up to 94% of the time. While our experiments are on sponsored search results, which is the financial backbone of web search, our method is general enough to be applicable to algorithmic web search results as well. Furthermore, we give an algorithm to guide the selection of additional documents to judge to improve confidence.
PicoCTF: A Game-Based Computer Security Competition for High School Students

The shortage of computer security experts is a critical problem. To encourage greater computer science interest among high school students, we designed and hosted a computer security competition called PicoCTF. Unlike existing competitions, PicoCTF focused primarily on offense and presented challenges in the form of a web-based game. Approximately 2,000 teams participated, with students playing for an average of 12 hours. We present the game-based competition design, an evaluation based on survey responses and website interaction statistics, and insights into the students who played. Further we have released our platform and challenges as an open source project, which has been adapted into the curricula of 40 high schools. Since its release in August of 2013, the PicoCTF platform has been used to host six other capturethe-flag competitions.
Artificial General Intelligence

Against the backdrop of increasing progresses in AI research paired with a rise of AI applications in decision-making processes, security-critical domains as well as in ethically relevant frames, a largescale debate on possible safety measures encompassing corresponding long-term and short-term issues has emerged across different disciplines. One pertinent topic in this context which has been addressed by various AI Safety researchers is e.g. the AI alignment problem for which no final consensus has been achieved yet. In this paper, we present a multidisciplinary toolkit of AI Safety strategies combining considerations from AI and Systems Engineering as well as from Cognitive Science with a security mindset as often relevant in Cybersecurity. We elaborate on how AGI “Self-awareness” could complement different AI Safety measures in a framework extended by a jointly performed Human Enhancement procedure. Our analysis suggests that this hybrid framework could contribute to undertake the AI alignment problem from a new holistic perspective through security-building synergetic effects emerging thereof and could help to increase the odds of a possible safe future transition towards superintelligent systems.
A 28-GHz Quadrature Fractional-N Frequency Synthesizer for 5G Transceivers With Less Than 100-fs Jitter Based on Cascaded PLL Architecture

This paper introduces a quadrature fractional-N cascaded frequency synthesizer and its phase noise analysis, optimization, and design for future 5G wireless transceivers. The performance improvement of the cascaded phase-locked loop (PLL) over single-stage PLL in terms of jitter and power consumption is theoretically presented and verified with measured results. The cascaded PLL is implemented using a first-stage fractional-N charge-pump PLL followed by a second-stage quadrature dividerless subsampling PLL. The fractional division in the first-stage PLL is implemented using a high-resolution phase mixer for lower quantization noise. Two prototypes of the single-stage PLL and the cascaded PLL were implemented in the 65-nm bulk CMOS process. The 26–32 GHz quadrature cascaded PLL consumes a total of 26.9 mW from 1-V supply and achieves less than 100-fs integrated jitter with −116.2 and −112.6-dBc/Hz phase noise at 1-MHz offset for the integer-N and the fractional-N modes, respectively. The fractional-N single-stage and cascaded PLLs achieve figure-of-merits of −230.58 and −248.75 dB, respectively.
Prediction Driven Behavior: Learning Predictions that Drive Fixed Responses

We introduce a new method for robot control that combines prediction learning with a fixed, crafted response—the robot learns to make a temporally-extended prediction during its normal operation, and the prediction is used to select actions as part of a fixed behavioral response. Our method is inspired by Pavlovian conditioning experiments in which an animal’s behavior adapts as it learns to predict an event. Surprisingly the animal’s behavior changes even in the absence of any benefit to the animal (i.e. the animal is not modifying its behavior to maximize reward). Our method for robot control combines a fixed response with online prediction learning, thereby producing an adaptive behavior. This method is different from standard non-adaptive control methods and also from adaptive reward-maximizing control methods. We show that this method improves upon the performance of two reactive controls, with visible benefits within 2.5 minutes of real-time learning on the robot. In the first experiment, the robot turns off its motors when it predicts a future over-current condition, which reduces the time spent in unsafe over-current conditions and improves efficiency. In the second experiment, the robot starts to move when it predicts a human-issued request, which reduces the apparent latency of the human-robot inter-
On subgroup discovery in numerical domains

Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discovery algorithms have been presented in the past, they focus on databases with nominal attributes or make use of discretization to get rid of the numerical attributes. In this paper, we illustrate why the replacement of numerical attributes by nominal attributes can result in suboptimal results. Thereafter, we present a new subgroup discovery algorithm that prunes large parts of the search space by exploiting bounds between related numerical subgroup descriptions. The same algorithm can also be applied to ordinal attributes. In an experimental section, we show that the use of our new pruning scheme results in a huge performance gain when more that just a few split-points are considered for the numerical attributes.
Appropriate agile measurement: using metrics and diagnostics to deliver business value

Agile software development continually measures both our product and the process used to create it, to allow improvement. With increased popularity, more risk-averse groups are being drawn to agile, bringing with them modes of evaluation incompatible with agile values and principles. These outmoded metrics drive dysfunctional behaviors which threaten the integrity of an emerging agile culture. This paper collects some of the current thinking on appropriate agile metrics, and proposes simple tools for use by teams or organizations. The intention of these tools is to foster dialogue about the appropriateness of metrics in a given context, and thereby to encourage measurements more congruent with the objectives of agile teamwork
Leveraging Mindsets to Promote Academic Achievement: Policy Recommendations.

The United States must improve its students' educational achievement. Race, gender, and social class gaps persist, and, overall, U.S. students rank poorly among peers globally. Scientific research shows that students' psychology-their "academic mindsets"-have a critical role in educational achievement. Yet policymakers have not taken full advantage of cost-effective and well-validated mindset interventions. In this article, we present two key academic mindsets. The first, a growth mindset, refers to the belief that intelligence can be developed over time. The second, a belonging mindset, refers to the belief that people like you belong in your school or in a given academic field. Extensive research shows that fostering these mindsets can improve students' motivation; raise grades; and reduce racial, gender, and social class gaps. Of course, mindsets are not a panacea, but with proper implementation they can be an excellent point of entry. We show how policy at all levels (federal, state, and local) can leverage mindsets to lift the nation's educational outcomes.
A Unified Probabilistic Framework for Name Disambiguation in Digital Library

Despite years of research, the name ambiguity problem remains largely unresolved. Outstanding issues include how to capture all information for name disambiguation in a unified approach, and how to determine the number of people K in the disambiguation process. In this paper, we formalize the problem in a unified probabilistic framework, which incorporates both attributes and relationships. Specifically, we define a disambiguation objective function for the problem and propose a two-step parameter estimation algorithm. We also investigate a dynamic approach for estimating the number of people K. Experiments show that our proposed framework significantly outperforms four baseline methods of using clustering algorithms and two other previous methods. Experiments also indicate that the number K automatically found by our method is close to the actual number.
A Richly Annotated Dataset for Pedestrian Attribute Recognition

In this paper, we aim to improve the dataset foundation for pedestrian attribute recognition in real surveillance scenarios. Recognition of human attributes, such as gender, and clothes types, has great prospects in real applications. However, the development of suitable benchmark datasets for attribute recognition remains lagged behind. Existing human attribute datasets are collected from various sources or an integration of pedestrian re-identification datasets. Such heterogeneous collection poses a big challenge on developing high quality fine-grained attribute recognition algorithms. Furthermore, human attribute recognition are generally severely affected by environmental or contextual factors, such as viewpoints, occlusions and body parts, while existing attribute datasets barely care about them. To tackle these problems, we build a Richly Annotated Pedestrian (RAP) dataset from real multi-camera surveillance scenarios with long term collection, where data samples are annotated with not only fine-grained human attributes but also environmental and contextual factors. RAP has in total 41,585 pedestrian samples, each of which is annotated with 72 attributes as well as viewpoints, occlusions, body parts information. To our knowledge, the RAP dataset is the largest pedestrian attribute dataset, which is expected to greatly promote the study of large-scale attribute recognition systems. Furthermore, we empirically analyze the effects of different environmental and contextual factors on pedestrian attribute recognition. Experimental results demonstrate that viewpoints, occlusions and body parts information could assist attribute recognition a lot in real applications.
Memory-Based Face Recognition for Visitor Identification

We show that a simple, memory-based technique for appearance-based face recognition, motivated by the realworld task of visitor identification, can outperform more sophisticated algorithms that use Principal Components Analysis (PCA) and neural networks. This technique is closely related to correlation templates; however, we show that the use of novel similarity measures greatly improves performance. We also show that augmenting the memory base with additional, synthetic face images results in further improvements in performance. Results of extensive empirical testing on two standard face recognition dataset s are presented, and direct comparisons with published work show that our algorithm achieves comparable (or superior) results. Our system is incorporated into an automated visitor identification system that has been operating successfully in an outdoor environment since January 1999.
Genetic Ablation of Orexin Neurons in Mice Results in Narcolepsy, Hypophagia, and Obesity

Orexins (hypocretins) are a pair of neuropeptides implicated in energy homeostasis and arousal. Recent reports suggest that loss of orexin-containing neurons occurs in human patients with narcolepsy. We generated transgenic mice in which orexin-containing neurons are ablated by orexinergic-specific expression of a truncated Machado-Joseph disease gene product (ataxin-3) with an expanded polyglutamine stretch. These mice showed a phenotype strikingly similar to human narcolepsy, including behavioral arrests, premature entry into rapid eye movement (REM) sleep, poorly consolidated sleep patterns, and a late-onset obesity, despite eating less than nontransgenic littermates. These results provide evidence that orexin-containing neurons play important roles in regulating vigilance states and energy homeostasis. Orexin/ataxin-3 mice provide a valuable model for studying the pathophysiology and treatment of narcolepsy.
Zoneout: Regularizing RNNs by Randomly Preserving Hidden Activations

We propose zoneout, a novel method for regularizing RNNs. At each timestep, zoneout stochastically forces some hidden units to maintain their previous values. Like dropout, zoneout uses random noise to train a pseudo-ensemble, improving generalization. But by preserving instead of dropping hidden units, gradient information and state information are more readily propagated through time, as in feedforward stochastic depth networks. We perform an empirical investigation of various RNN regularizers, and find encouraging results: zoneout gives significant performance improvements across tasks, yielding state-ofthe-art results in character-level language modeling on the Penn Treebank dataset and competitive results on word-level Penn Treebank and permuted sequential MNIST classification tasks.
Regression Shrinkage and Selection via the Elastic Net , with Applications to Microarrays

We propose the elastic net, a new regression shrinkage and selection method. Real data and a simulation study show that the elastic net often outperforms the lasso, while it enjoys a similar sparsity of representation. In addition, the elastic net encourages a grouping effect, where strong correlated predictors are kept in the model. The elastic net is particularly useful in the analysis of microarray data in which the number of genes (predictors) is much bigger than the number of samples (observations). We show how the elastic net can be used to construct a classification rule and do automatic gene selection at the same time in microarray data, where the lasso is not very satisfied. We also propose an efficient algorithm for solving the elastic net based on the recently invented LARS algorithm.  Gene selection; Grouping effect; Lasso; LARS algorithm; Microarray classification.
Object based Information Extraction from High Resolution Satellite Imagery using eCognition

High resolution images offer rich contextual information, including spatial, spectral and contextual information. In order to extract the information from these high resolution images, we need to utilize the spatial and contextual information of an object and its surroundings. If pixel based approaches are applied to extract information from such remotely sensed data, only spectral information is used. Thereby, in Pixel based approaches, information extraction is based exclusively on the gray level thresholding methods. To extract the certain features only from high resolution satellite imagery, this situation becomes worse. To overcome this situation an object-oriented approach is implemented. This paper demonstrated the concept of objectoriented information extraction from high resolution satellite imagery using eCognition software, allows the classification of remotely-sensed data based on different object features, such as spatial, spectral, and contextual information. Thus with the object based approach, information is extracted on the basis of meaningful image objects rather than individual gray values of pixels. The test area has different discrimination, assigned to different classes by this approach: Agriculture, built-ups, forest and water. The Multiresolution segmentation and the nearest neighbour (NN) classification approaches are used and overall accuracy is assessed. The overall accuracy reaches to 97.30% thus making it an efficient and practical approach for information extraction.
Face recognition using PCA and different distance classifiers

A facial recognition system is a computer application for automatically identifying or verifying a person from a digital image or a video frame from a video source. One of the way is to do this is by comparing selected facial features from the image and a facial database. It is typically used in security systems and can be compared to other biometrics such as fingerprint or eye iris recognition systems. In this paper we focus on 3-D facial recognition system and biometric facial recognition system. We do critics on facial recognition system giving effectiveness and weaknesses. This paper also introduces scope of recognition system in India. Face recognition has received substantial attention from researchers in biometrics, pattern recognition field and computer vision communities. Face recognition can be applied in Security measure at Air ports, Passport verification, Criminals list verification in police department, Visa processing, Verification of Electoral identification and Card Security measure at ATM’s. Principal Component Analysis (PCA) is a technique among the most common feature extraction techniques used in Face Recognition. In this paper, a face recognition system for personal identification and verification using Principal Component Analysis with different distance classifiers is proposed. The test results in the ORL face database produces interesting results from the point of view of recognition success, rate, and robustness of the face recognition algorithm. Different classifiers were used to match the image of a person to a class (a subject) obtained from the training data. These classifiers are: the City-Block Distance Classifier, the Euclidian distance classifier, the Squared Euclidian Distance Classifier, and the Squared Chebyshev distance Classifier.