nils-herrmann/clean_scirepeval huggingface dataset:
Procrastination and cramming: how adept students ace the system.

Clear power differentials between teacher and pupil and the assignment of well-delineated tasks within specified time constraints characterize the academic system. Most university students are supremely adept at working within that structure. Many students who outwardly adapt to the system, however, engage in an intense and private ritual that comprises five aspects: calculated procrastination, preparatory anxiety, climactic cramming, nick-of-time deadline-making, and a secret, if often uncelebrated, victory. These adept students often find it difficult to admit others into their efficient program of academic survival. Although such behaviors are adaptive for school rhythms and expectations, these students may also try to impose them onto personal relationships, including those that are psychotherapeutic. The students' tendency to transfer their longstanding habits of procrastination and cramming to the workplace after graduation is less problematic. The argument is made that school rhythms and expectations shape the workplace, not vice versa. Methods of addressing the troublesome aspects of these work styles are suggested. Rather than attempting to change existing work patterns, the therapist can identify the underlying psychodynamic drama and its attendant manifestations that are becoming problematic.
General duality between optimal control and estimation

Optimal control and estimation are dual in the LQG setting, as Kalman discovered, however this duality has proven difficult to extend beyond LQG. Here we obtain a more natural form of LQG duality by replacing the Kalman-Bucy filter with the information filter. We then generalize this result to non-linear stochastic systems, discrete stochastic systems, and deterministic systems. All forms of duality are established by relating exponentiated costs to probabilities. Unlike the LQG setting where control and estimation are in one-to-one correspondence, in the general case control turns out to be a larger problem class than estimation and only a sub-class of control problems have estimation duals. These are problems where the Bellman equation is intrinsically linear. Apart from their theoretical significance, our results make it possible to apply estimation algorithms to control problems and vice versa.
SCRUM Development Process

The stated, accepted philosophy for systems development is that the development process is a well understood approach that can be planned, estimated, and successfully completed. This has proven incorrect in practice. SCRUM assumes that the systems development process is an unpredictable, complicated process that can only be roughly described as an overall progression. SCRUM defines the systems development process as a loose set of activities that combines known, workable tools and techniques with the best that a development team can devise to build systems. Since these activities are loose, controls to manage the process and inherent risk are used. SCRUM is an enhancement of the commonly used iterative/incremental object-oriented development cycle.
Robust road marking detection using convex grouping method in around-view monitoring system

As the around-view monitoring (AVM) system becomes one of the essential components for advanced driver assistance systems (ADAS), many applications using AVM such as parking guidance system are actively being developed. As a key step for such applications, detecting road markings robustly is a very important issue to be solved. However, compared to the lane marking detection methods, detection of non-lane markings, such as text marks painted on the road, has been less studied so far. While some of methods for detecting non-lane markings exist, many of them are restricted to roadways only, or work poorly on AVM images. In this paper, we propose an algorithm which can robustly detect non-lane road markings on AVM images. We first propose a difference-of-Gaussian based method for extracting a connected component set, followed by a novel grouping method for grouping connected components based on convexity condition. For a classification task, we exploit the Random Forest classifier. We demonstrate the robustness and detection accuracy of our methods through various experiments by using the dataset collected from various environments.
A New Graphical Password Scheme Resistant to Shoulder-Surfing

Shoulder-surfing is a known risk where an attacker can capture a password by direct observation or by recording the authentication session. Due to the visual interface, this problem has become exacerbated in graphical passwords. There have been some graphical schemes resistant or immune to shoulder-surfing, but they have significant usability drawbacks, usually in the time and effort to log in. In this paper, we propose and evaluate a new shoulder-surfing resistant scheme which has a desirable usability for PDAs. Our inspiration comes from the drawing input method in DAS and the association mnemonics in Story for sequence retrieval. The new scheme requires users to draw a curve across their password images orderly rather than click directly on them. The drawing input trick along with the complementary measures, such as erasing the drawing trace, displaying degraded images, and starting and ending with randomly designated images provide a good resistance to shoulder-surfing. A preliminary user study showed that users were able to enter their passwords accurately and to remember them over time.
The Finite Domain Constraint Solver of SWI-Prolog

We present a new constraint solver over finite domains, freely available as library(clpfd) in SWI-Prolog. Our solver has several unique features, which we describe in this paper: Reasoning over arbitrarily large integers, always terminating propagation, and a domain-specific language that concisely expresses the full semantics of constraint reification. The library is entirely written in Prolog and can be easily ported to other Prolog systems that support attributed variables. The constraint solver is fast enough for teaching and research purposes and is already being used in courses at several universities in France, Germany, Italy, Austria and other countries.
TR 00-043 Application of Dimensionality Reduction in Recommender SystemA Case Study

We investigate the use of dimensionality reduction to improve performance for a new class of data analysis software called “recommender systems ” . Recommender systems apply k nowledge discovery techniques to the problem of making product recommendations during a live customer interaction. These systems are achieving widespread success in E-commerce nowadays, especially with the advent of the Internet. The tremendous growth of c ustomers and products poses three key challenges for recommender systems in the E -commerce domain. These are: producing high quality recommendations, performing many recommendations per second for millions of customers and products, and achieving high coverage in the face of data sparsity. One successful recommender system technology is collaborative filtering, which works by matching customer preferences to other customers in making recommendations. Collaborative filtering has been shown to produce high quality recommendations, but the performance degrades with the number of customers and products. New recommender system technologies are needed that can quickly produce high quality recommendations, even for very large scale problems. This paper presents wo different experiments where we have explored one technology called Singular Value Decomposition (SVD) to reduce the dimensionality of recommender system databases. Each experiment compares the quality of a recommender system using SVD with the quality of a recommender system using collaborative filtering. The first experiment compares the effectiveness of the two recommender systems at predicting consumer preferences based on a database of explicit ratings of products. The second experiment compares th e effectiveness of the two recommender systems at producing Top-N lists based on a real -life customer purchase database from an E -Commerce site. Our experience suggests that SVD has the potential to meet many of the challenges of recommender systems, under certain conditions.
Cross-Domain Visual Recognition via Domain Adaptive Dictionary Learning

In real-world visual recognition problems, the assumption that the training data (source domain) and test data (target domain) are sampled from the same distribution is often violated. This is known as the domain adaptation problem. In this work, we propose a novel domain-adaptive dictionary learning framework for cross-domain visual recognition. Our method generates a set of intermediate domains. These intermediate domains form a smooth path and bridge the gap between the source and target domains. Specifically, we not only learn a common dictionary to encode the domain-shared features, but also learn a set of domain-specific dictionaries to model the domain shift. The separation of the common and domain-specific dictionaries enables us to learn more compact and reconstructive dictionaries for domain adaptation. These dictionaries are learned by alternating between domain-adaptive sparse coding and dictionary updating steps. Meanwhile, our approach gradually recovers the feature representations of both source and target data along the domain path. By aligning all the recovered domain data, we derive the final domain-adaptive features for cross-domain visual recognition. Extensive experiments on three public datasets demonstrates that our approach outperforms most state-of-theart methods.
An empirical study on consumer acceptance of products in electronic markets: a transaction cost model

Electronic commerce is gaining much attention from researchers and practitioners. Although increasing numbers of products are being marketed on the web, little effort has been spent on studying what product is more suitable for marketing electronically and why. In this research, a model based on the transaction cost theory is developed to tackle the problem. It is assumed that customers will go with a channel that has lower transactional costs. In other words, whether a customer would buy a product electronically is determined by the transaction cost of the channel. The transaction cost of a product on the web is determined by the uncertainty and asset specificity. An empirical study involving eight-six Internet users was Ž conducted to test the model. Five products with different characteristics book, shoes, toothpaste, microwave oven, and . Ž . flower were used in the study. The results indicate that 1 different products do have different customer acceptance on the Ž . electronic market, 2 the customer acceptance is determined by the transaction cost, which is in turn determined by the Ž . uncertainty and asset specificity, and 3 experienced shoppers are concerned more about the uncertainty in electronic shopping, whereas inexperienced shoppers are concerned with both. q 1998 Elsevier Science B.V. All rights reserved.
Socioeconomic status and obesity: a review of the literature.

A review of 144 published studies of the relationship between socioeconomic status (SES) and obesity reveals a strong inverse relationship among women in developed societies. The relationship is inconsistent for men and children in developed societies. In developing societies, however, a strong direct relationship exists between SES and obesity among men, women, and children. A review of social attitudes toward obesity and thinness reveals values congruent with the distribution of obesity by SES in different societies. Several variables may mediate the influence of attitudes toward obesity and thinness among women in developed societies that result in the inverse relationship between SES and obesity. They include dietary restraint, physical activity, social mobility, and inheritance.
A positive tensions PID controller for a planar cable robot: An experimental study

In this paper design and control of planar cable-driven parallel robots are studied in an experimental prospective. Since in this class of manipulators, cable tensionability conditions must be met, feedback control of such robots becomes more challenging than for conventional robots. To meet these conditions, internal force control structure is introduced and used in addition to a PID control scheme to ensure that all cables remain in tension. A robust PID controller is proposed for partial knowledge of the robot, to keep the tracking errors bounded. Finally, the effectiveness of the proposed control algorithm is examined through experiments on K.N. Toosi planar cable-driven robot and it is shown that the proposed control structure is able to provide suitable performance in practice.
A Delegation Framework for Task-Role Based Access Control in WFMS

Access control is important for protecting information integrity in workflow management system (WfMS). Compared to conventional access control technology such as discretionary, mandatory, and role-based access control models, task-role-based access control (TRBAC) model, an access control model based on both tasks and roles, meets more requirements for modern enterprise environments. However, few discussions on delegation mechanisms for TRBAC are made. In this paper, a framework considering temporal constraints to improve delegation and help automatic delegation in TRBAC is presented. In the framework, the methodology for delegations requested from both users and WfMS is discussed. The constraints for delegatee selection such as delegation loop and separation of duty (SOD) are addressed. With the framework, a sequence of algorithms for delegation and revocation of tasks are constructed gradually. Finally, a comparison is made between our approach and the representative related works.
Webshell detection techniques in web applications

With widely adoption of online services, malicious web sites have become a malignant tumor of the Internet. Through system vulnerabilities, attackers can upload malicious files (which are also called webshells) to web server to create a backdoor for hackers' further attacks. Therefore, finding and detecting webshell inside web application source code are crucial to secure websites. In this paper, we propose a novel method based on the optimal threshold values to identify files that contain malicious codes from web applications. Our detection system will scan and look for malicious codes inside each file of the web application, and automatically give a list of suspicious files and a detail log analysis table of each suspicious file for administrators to check further. The Experimental results show that our approach is applicable to identify webshell more efficient than some other approaches.
Anatomical Basis for Safe and Effective Volumization of the Temple.

One of the earliest but often unaddressed signs of facial aging is volume loss in the temple. Treatment of the area can produce satisfying results for both patient and practitioner.



Safe injection requires explicit knowledge of the anatomy to avoid complications related to the multitude of vessels that course throughout the region at various depths. The authors aim to detail the anatomy of the area and provide a safe and easy-to-follow method for injection.



The authors review the relevant anatomy of the temporal region and its application to cosmetic filler injections.



The authors describe an easy-to-follow approach for a safe and effective injection window based on numerous anatomical studies. Injection in this area is not without risk, including potential blindness. The authors review the potential complications and their treatments.



Hollowing of the temple is an early sign of aging that, when corrected, can lead to significant patient and practitioner satisfaction. Proper anatomically knowledge is required to avoid potentially severe complications. In this study, the authors present a reliable technique to safely and effectively augment this often undertreated area of the aging face.
A Wide-Field-of-View Monocentric Light Field Camera

Light field (LF) capture and processing are important in an expanding range of computer vision applications, offering rich textural and depth information and simplification of conventionally complex tasks. Although LF cameras are commercially available, no existing device offers wide field-of-view (FOV) imaging. This is due in part to the limitations of fisheye lenses, for which a fundamentally constrained entrance pupil diameter severely limits depth sensitivity. In this work we describe a novel, compact optical design that couples a monocentric lens with multiple sensors using microlens arrays, allowing LF capture with an unprecedented FOV. Leveraging capabilities of the LF representation, we propose a novel method for efficiently coupling the spherical lens and planar sensors, replacing expensive and bulky fiber bundles. We construct a single-sensor LF camera prototype, rotating the sensor relative to a fixed main lens to emulate a wide-FOV multi-sensor scenario. Finally, we describe a processing toolchain, including a convenient spherical LF parameterization, and demonstrate depth estimation and post-capture refocus for indoor and outdoor panoramas with 15 x 15 x 1600 x 200 pixels (72 MPix) and a 138&#xb0; FOV.
A Performance Comparison of Open-Source Stream Processing Platforms

Distributed stream processing platforms is a new class of real-time monitoring systems that analyze and extracts knowledge from large continuous streams of data. This type of systems is crucial for providing high throughput and low latency required by Big Data or Internet of Things monitoring applications. This paper describes and analyzes three main open-source distributed stream- processing platforms: Storm Flink, and Spark Streaming. We analyze the system architectures and we compare their main features. We carry out two experiments concerning anomaly detection on network traffic to evaluate the throughput efficiency and the resilience to node failures. Results show that the performance of native stream processing systems, Storm and Flink, is up to 15 times higher than the micro-batch processing system, Spark Streaming. On the other hand, Spark Streaming is more robust to node failures and provides recovery without losses.
A survey of AIS-20/31 compliant TRNG cores suitable for FPGA devices

FPGAs are widely used to integrate cryptographic primitives, algorithms, and protocols in cryptographic systems-on-chip (CrySoC). As a building block of CrySoCs, True Random Number Generators (TRNGs) exploit analog noise sources in electronic devices to generate confidential keys, initialization vectors, challenges, nonces, and random masks in cryptographic protocols. TRNGs aimed at cryptographic applications must fulfill the security requirements defined in the German Federal Bureau for Information Security's (BSI) recommendations AIS-20/31, which has become a de facto standard in Europe. Many TRNG cores have already been published, only a few of which are suitable for FPGAs and even fewer comply with AIS-20/31. Here we present the results of the implementation of AIS-20/31 compliant TRNG cores in three FPGA families: Xilinx Spartan 6, Altera Cyclone V and Microsemi SmartFusion 2. In addition to common design parameters like area, bit rate and power/energy consumption, we compare and discuss the feasibility of generator cores in different FPGAs and the statistical quality of their output. These results will help designers select the best generator and the device family to match the requirements of the data security application. To ensure reproducibility of the results, the open source VHDL code of all generators adapted to individual families can be downloaded from the dedicated web page.
Model-based vision: a program to see a walking person

For a machine to be able to ‘see’, it must know something about the object it is ‘looking’ at, A common method in machine vision is to provide the machine with general rather than specific knowledge about the object. An alternative technique, and the one used in thti paper, b a model-based approach in which particulars aboat the object are given and this drives the analysis. The computer program described here, the WALKER model, maps images into a description in which a person is represented by the series of hierarchical levels, i.e. a person has an arm which has a lower-arm which has a hand. l7te performance of the program ti illustrated by superimposing the machinegenerated picture over the original photographic images.
Critical success factors revisited: success and failure cases of information systems for senior executives

Ž . The literature suggests the existence of critical success factors CSFs for the development of information systems that support senior executives. Our study of six organizations gives evidence for this notion of CSFs. The study further shows an interesting pattern, namely that companies either Aget it rightB, and essentially succeed on all CSFs, or Aget it completely wrongB, that is, fall short on each of the CSFs. Among the six cases for which data were collected through in-depth interviews with company executives, three organizations seemed to manage all the CSFs properly, while two others managed all CSFs poorly. Only one organization showed a mixed scorecard, managing some factors well and some not so well. At the completion of the study, this organization could neither be judged as a success, nor as a failure. This dichotomy between success and failure cases suggests the existence of an even smaller set of Ameta-successB factors. Based on our findings, we speculate that these Ameta-successB factors are AchampionshipB, Aavailability of resourcesB, and Alink to organization objectivesB. q 2001 Elsevier Science B.V. All rights reserved.
STATE REPRESSION AND POLITICAL ORDER

!  State repression includes harassment, surveillance/spying, bans, arrests, torture, and mass killing by government agents and/or affiliates within their territorial jurisdiction. Over the past 40 years, the systematic study of state repression has grown considerably. The development of this work, however, has been uneven. Though unified in their focus on the problem of order (i.e., trying to ascertain how political authorities wield coercive power amid potential and actual domestic challengers), different scholars tend to emphasize distinct aspects of the topic. Consequently, a great deal of progress has been made in specific areas but others have lagged behind. In this review, I attempt to identify the dominant traditions in the repression literature, the core empirical findings, and some persisting puzzles.