nils-herrmann/clean_scirepeval huggingface dataset:
Novel Table Lookup-Based Algorithms for High-Performance CRC Generation

A framework for designing a family of novel fast cyclic redundancy code (CRC) generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optimizing their memory requirement to meet the constraints of specific computer architectures. In addition, our algorithms can be implemented in software using commodity processors instead of specialized parallel circuits. We use this framework to design two efficient algorithms that run in the popular Intel IA32 processor architecture. First, a "slicing-by-4" algorithm doubles the performance of existing software-based table-driven CRC implementations based on the Sarwate  algorithm while using a 4-Kbyte cache footprint. Second, a "slicing-by-8" algorithm triples the performance of existing software-based CRC implementations while using an 8-Kbyte cache footprint. Whereas well-known software-based CRC implementations compute the current CRC value from a bitstream reading 8 bits at a time, our algorithms read 32 and 64 bits at a time, respectively (this is an extended version of a paper that appeared at the 10th IEEE International Symposium on Computers and Communications (ISCC '05) in Cartagena, Spain, in June 2005). The slicing-by-8 source code is freely available for experimentation and can be found at http://sourceforge.net/projects/slicing-by-8.
An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters

In data-parallel computing frameworks, intermediate parallel data is often produced at various stages which needs to be transferred among servers in the datacenter network e.g., the shuffle phase in MapReduce. A stage often cannot start or be completed unless all the required data pieces from the preceding stage are received. Coflow is a recently proposed networking abstraction to capture such communication patterns. We consider the problem of efficiently scheduling coflows with release dates in a shared datacenter network so as to minimize the total weighted completion time of coflows. Several heuristics have been proposed recently to address this problem, as well as a few polynomial-time approximation algorithms with provable performance guarantees. Our main result in this paper is a polynomial-time deterministic algorithm that improves the prior known results. Specifically, we propose a deterministic algorithm with approximation ratio of 5, which improves the prior best known ratio of 12. For the special case when all coflows are released at time zero, our deterministic algorithm obtains approximation ratio of 4 which improves the prior best known ratio of 8. The key ingredient of our approach is an improved linear program formulation for sorting the coflows followed by a simple list scheduling policy. Extensive simulation results, using both synthetic and real traffic traces, are presented that verify the performance of our algorithm and show improvement over the prior approaches.
An Anomaly-Based Approach for Intrusion Detection in Web Traffic

A new system for web attack detection is presented. It follows the anomaly-based approach, therefore known and unknown attacks can be detected. The system relies on a XML file to classify the incoming requests as normal or anomalous. The XML file, which is built from only normal traffic, contains a description of the normal behavior of the target web application statistically characterized. Any request which deviates from the normal behavior is considered an attack. The system has been applied to protect a real web application. An increasing number of training requests have been used to train the system. Experiments show that when the XML file has enough information to closely characterize the normal behavior of the target web application, a very high detection rate is reached while the false alarm rate remains very low.
Initial Access, Mobility, and User-Centric Multi-Beam Operation in 5G New Radio

5G radio access networks are expected to provide very high capacity, ultra-reliability and low latency, seamless mobility, and ubiquitous end-user experience anywhere and anytime. Driven by such stringent service requirements coupled with the expected dense deployments and diverse use case scenarios, the architecture of 5G New Radio (NR) wireless access has further evolved from the traditionally cell-centric radio access to a more flexible beam-based user-centric radio access. This article provides an overview of the NR system multi-beam operation in terms of initial access procedures and mechanisms associated with synchronization, system information, and random access. We further discuss inter-cell mobility handling in NR and its reliance on new downlink-based measurements to compensate for a lack of always-on reference signals in NR. Furthermore, we describe some of the user-centric coordinated transmission mechanisms envisioned in NR in order to realize seamless intra/inter-cell handover between physical transmission and reception points and reduce the interference levels across the network.
A Novel Single-Stage High-Power-Factor AC/DC Converter Featuring High Circuit Efficiency

This paper proposes a novel single-stage high-power-factor ac/dc converter with symmetrical topology. The circuit topology is derived from the integration of two buck-boost power-factor-correction (PFC) converters and a full-bridge series resonant dc/dc converter. The switch-utilization factor is improved by using two active switches to serve in the PFC circuits. A high power factor at the input line is assured by operating the buck-boost converters at discontinuous conduction mode. With symmetrical operation and elaborately designed circuit parameters, zero-voltage switching on all the active power switches of the converter can be retained to achieve high circuit efficiency. The operation modes, design equations, and design steps for the circuit parameters are proposed. A prototype circuit designed for a 200-W dc output was built and tested to verify the analytical predictions. Satisfactory performances are obtained from the experimental results.
Automated model-based bias field correction of MR images of the brain

The authors propose a model-based method for fully automated bias field correction of MR brain images. The MR signal is modeled as a realization of a random process with a parametric probability distribution that is corrupted by a smooth polynomial inhomogeneity or bias field. The method the authors propose applies an iterative expectation-maximization (EM) strategy that interleaves pixel classification with estimation of class distribution and bias field parameters, improving the likelihood of the model parameters at each iteration. The algorithm, which can handle multichannel data and slice-by-slice constant intensity offsets, is initialized with information from a digital brain atlas about the a priori expected location of tissue classes. This allows full automation of the method without need for user interaction, yielding more objective and reproducible results. The authors have validated the bias correction algorithm on simulated data and they illustrate its performance on various MR images with important field inhomogeneities. They also relate the proposed algorithm to other bias correction algorithms.
The compact genetic algorithm

This paper introduces the compact genetic algorithm (cGA) which represents the population as a probability distribution over the set of solutions and is operationally equivalent to the order-one behavior of the simple GA with uniform crossover. It processes each gene independently and requires less memory than the simple GA. The development of the compact GA is guided by a proper understanding of the role of the GA’s parameters and operators. The paper clearly illustrates the mapping of the simple GA’s parameters into those of an equivalent compact GA. Computer simulations compare both algorithms in terms of solution quality and speed. Finally, this work raises important questions about the use of information in a genetic algorithm, and its ramifications show us a direction that can lead to the design of more efficient GA’s.
On the Depth and Dynamics of Online Search Behavior

This paper examines search across competing e-commerce sites. By analyzing panel data from over 10,000 Internet households and three commodity-like products (books, compact discs (CDs), and air travel services), we show that the amount of online search is actually quite limited. On average, households visit only 1.2 book sites, 1.3 CD sites, and 1.8 travel sites during a typical active month in each category. Using probabilistic models, we characterize search behavior at the individual level in terms of (1) depth of search, (2) dynamics of search, and (3) activity of search. We model an individual's tendency to search as a logarithmic process, finding that shoppers search across very few sites in a given shopping month. We extend the logarithmic model of search to allow for time-varying dynamics that may cause the consumer to evolve and, perhaps, learn to search over time. We find that for two of the three product categories studied, search propensity does not change from month to month. However, in the third product category we find mild evidence of time-varying dynamics, where search decreases over time from already low levels. Finally, we model the level of a household's shopping activity and integrate it into our model of search. The results suggest that more-active online shoppers tend also to search across more sites. This consumer characteristic largely drives the dynamics of search that can easily be mistaken as increases from experience at the individual level.
Applications of Circumscription to Formalizing Common-Sense Knowledge

We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects of various entities. Included are nonmonotonic treatments of is-a hierarchies, the unique names hypothesis, and the frame problem. The new circumscription may be called formula circumscription to distinguish it from the previously defined domain circumscription and predicate circumscription. A still more general formalism called prioritized circumscription is briefly explored.
TimeML: Robust Specification of Event and Temporal Expressions in Text

In this paper we provide a description of TimeML, a rich specification language for event and temporal expressions in natural language text, developed in the context of the AQUAINT program on Question Answering Systems. Unlike most previous work on event annotation, TimeML captures three distinct phenomena in temporal markup: (1) it systematically anchors event predicates to a broad range of temporally denotating expressions; (2) it orders event expressions in text relative to one another, both intrasententially and in discourse; and (3) it allows for a delayed (underspecified) interpretation of partially determined temporal expressions. We demonstrate the expressiveness of TimeML for a broad range of syntactic and semantic contexts, including aspectual predication, modal subordination, and an initial treatment of lexical and constructional causation in text.
A Direct Load Control Model for Virtual Power Plant Management

In the framework of liberalized electricity markets, distributed generation and controllable demand have the opportunity to participate in the real-time operation of transmission and distribution networks. This may be done by using the virtual power plant (VPP) concept, which consists of aggregating the capacity of many distributed energy resources (DER) in order to make them more accessible and manageable across energy markets. This paper provides an optimization algorithm to manage a VPP composed of a large number of customers with thermostatically controlled appliances. The algorithm, based on a direct load control (DLC), determines the optimal control schedules that an aggregator should apply to the controllable devices of the VPP in order to optimize load reduction over a specified control period. The results define the load reduction bid that the aggregator can present in the electricity market, thus helping to minimize network congestion and deviations between generation and demand. The proposed model, which is valid for both transmission and distribution networks, is tested on a real power system to demonstrate its applicability.
New multi-stage similarity measure for calculation of pairwise patent similarity in a patent citation network

Being able to effectively measure similarity between patents in a complex patent citation network is a crucial task in understanding patent relatedness. In the past, techniques such as text mining and keyword analysis have been applied for patent similarity calculation. The drawback of these approaches is that they depend on word choice and writing style of authors. Most existing graph-based approaches use common neighbor-based measures, which only consider direct adjacency. In this work we propose new similarity measures for patents in a patent citation network using only the patent citation network structure. The proposed similarity measures leverage direct and indirect co-citation links between patents. A challenge is when some patents receive a large number of citations, thus are considered more similar to many other patents in the patent citation network. To overcome this challenge, we propose a normalization technique to account for the case where some pairs are ranked very similar to each other because they both are cited by many other patents. We validate our proposed similarity measures using US class codes for US patents and the well-known Jaccard similarity index. Experiments show that the proposed methods perform well when compared to the Jaccard similarity index.
Staging Urban Interactions with Media Façades

Using media façades as a subcategory of urban computing, this paper contributes to the understanding of spatial interaction, sense-making, and social mediation as part of identifying key characteristics of interaction with media façades. Our research addresses in particular the open-ended but framed nature of interaction, which in conjunction with varying interpretations enables individual sense-making. Moreover, we contribute to the understanding of flexible social interaction by addressing urban interaction in relation to distributed attention, shared focus, dialogue and collective action. Finally we address challenges for interaction designers encountered in a complex spatial setting calling for a need to take into account multiple viewing and action positions. Our researchthrough-design approach has included a real-life design intervention in terms of the design, implementation, and reflective evaluation of a 180 m (1937 square feet) interactive media façade in operation 24/7 for more than 50 days.
Minimum-Area Rectangle Containing a Set of Points

3 The Rotating Calipers Algorithm 3 3.1 Computing the Initial Rectangle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.2 Updating the Rectangle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2.1 Distinct Supporting Vertices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2.2 Duplicate Supporting Vertices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2.3 Multiple Polygon Edges Attain Minimum Angle . . . . . . . . . . . . . . . . . . . . . 8 3.2.4 The General Update Step . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Real-time measurement of the three-axis contact force distribution using a flexible capacitive polymer tactile sensor

In this paper, we report real-time measurement results of various contact forces exerted on a new flexible capacitive three-axis tactile sensor array based on polydimethylsiloxane (PDMS). A unit sensor consists of two thick PDMS layers with embedded copper electrodes, a spacer layer, an insulation layer and a bump layer. There are four capacitors in a unit sensor to decompose a contact force into its normal and shear components. They are separated by a wall-type spacer to improve the mechanical response time. Four capacitors are arranged in a square form. The whole sensor is an 8 × 8 array of unit sensors and each unit sensor responds to forces in all three axes. Measurement results show that the full-scale range of detectable force is around 0–20 mN (250 kPa) for all three axes. The estimated sensitivities of a unit sensor with the current setup are 1.3, 1.2 and 1.2%/mN for the x-, yand z-axes, respectively. A simple mechanical model has been established to calculate each axial force component from the measured capacitance value. Normal and shear force distribution images are captured from the fabricated sensor using a real-time measurement system. The mechanical response time of a unit sensor has been estimated to be less than 160 ms. The flexibility of the sensor has also been demonstrated by operating the sensor on a curved surface of 4 mm radius of curvature. (Some figures in this article are in colour only in the electronic version)
Information-Based Compact Pose SLAM

Pose SLAM is the variant of simultaneous localization and map building (SLAM) is the variant of SLAM, in which only the robot trajectory is estimated and where landmarks are only used to produce relative constraints between robot poses. To reduce the computational cost of the information filter form of Pose SLAM and, at the same time, to delay inconsistency as much as possible, we introduce an approach that takes into account only highly informative loop-closure links and nonredundant poses. This approach includes constant time procedures to compute the distance between poses, the expected information gain for each potential link, and the exact marginal covariances while moving in open loop, as well as a procedure to recover the state after a loop closure that, in practical situations, scales linearly in terms of both time and memory. Using these procedures, the robot operates most of the time in open loop, and the cost of the loop closure is amortized over long trajectories. This way, the computational bottleneck shifts to data association, which is the search over the set of previously visited poses to determine good candidates for sensor registration. To speed up data association, we introduce a method to search for neighboring poses whose complexity ranges from logarithmic in the usual case to linear in degenerate situations. The method is based on organizing the pose information in a balanced tree whose internal levels are defined using interval arithmetic. The proposed Pose-SLAM approach is validated through simulations, real mapping sessions, and experiments using standard SLAM data sets.
Augmented reality for board games

We introduce a new type of Augmented Reality games: By using a simple webcam and Computer Vision techniques, we turn a standard real game board pawns into an AR game. We use these objects as a tangible interface, and augment them with visual effects. The game logic can be performed automatically by the computer. This results in a better immersion compared to the original board game alone and provides a different experience than a video game. We demonstrate our approach on Monopoly− , but it is very generic and could easily be adapted to any other board game.
Clustered Pose and Nonlinear Appearance Models for Human Pose Estimation

We investigate the task of 2D articulated human pose estimation in unconstrained still images. This is extremely challenging because of variation in pose, anatomy, clothing, and imaging conditions. Current methods use simple models of body part appearance and plausible configurations due to limitations of available training data and constraints on computational expense. We show that such models severely limit accuracy. Building on the successful pictorial structure model (PSM) we propose richer models of both appearance and pose, using state-of-the-art discriminative classifiers without introducing unacceptable computational expense. We introduce a new annotated database of challenging consumer images, an order of magnitude larger than currently available datasets, and demonstrate over 50% relative improvement in pose estimation accuracy over a stateof-the-art method.
Organizational learning culture, innovative culture and innovations in South Korean firms

0957-4174/$ see front matter 2010 Elsevier Ltd. A doi:10.1016/j.eswa.2010.02.080 * Corresponding author.  (M. Šk edu (J.H. Song), ymlee@sm.ac.kr (Y. Lee). URL: http://www.mihaskerlavaj.net (M. Škerlavaj) 1 Tel.: +1 4057443613. 2 Tel.: +82 220777050. The aim of this paper is to present and test a model of innovativeness improvement based on the impact of organizational learning culture. The concept of organizational learning culture (OLC) is presented and defined as a set of norms and values about the functioning of an organization. They should support systematic, in-depth approaches aimed at achieving higher-level organizational learning. The elements of an organizational learning process that we use are information acquisition, information interpretation, and behavioral and cognitive changes. Within the competing values framework OLC covers some aspects of all four different types of cultures: group, developmental, hierarchical, and rational. Constructs comprising innovativeness are innovative culture and innovations, which are made of technical (product and service) and administrative (process) innovations. We use data from 201 Korean companies employing more than 50 people. The impact of OLC on innovations empirically tested via structural equation modeling (SEM). The results show that OLC has a very strong positive direct effect on innovations as well as moderate positive indirect impact via innovative culture.
Practical and Optimal LSH for Angular Distance

We show the existence of a Locality-Sensitive Hashing (LSH) family for the angular distance that yields an approximate Near Neighbor Search algorithm with the asymptotically optimal running time exponent. Unlike earlier algorithms with this property (e.g., Spherical LSH [1, 2]), our algorithm is also practical, improving upon the well-studied hyperplane LSH  in practice. We also introduce a multiprobe version of this algorithm and conduct an experimental evaluation on real and synthetic data sets. We complement the above positive results with a fine-grained lower bound for the quality of any LSH family for angular distance. Our lower bound implies that the above LSH family exhibits a trade-off between evaluation time and quality that is close to optimal for a natural class of LSH functions.