nils-herrmann/clean_scirepeval huggingface dataset:
Delaunay Meshing of Isosurfaces

We present an isosurface meshing algorithm, DelIso, based on the Delaunay refinement paradigm. This paradigm has been successfully applied to mesh a variety of domains with guarantees for topology, geometry, mesh gradedness, and triangle shape. A restricted Delaunay tri- angulation, dual of the intersection between the surface and the three dimensional Voronoi diagram, is often the main ingredient in Delaunay refinement. Computing and storing three dimensional Voronoi/Delaunay diagrams become bottlenecks for Delaunay refinement techniques since isosurface computations generally have large input datasets and output meshes. A highlight of our algorithm is that we find a simple way to recover the restricted Delaunay triangulation of the surface without computing the full 3D structure. We employ techniques for efficient ray tracing of isosurfaces to generate surface sample points, and demonstrate the effectiveness of our implementation using a variety of volume datasets.
Reference-Aware Language Models

We propose a general class of language models that treat reference as explicit stochastic latent variables. This architecture allows models to create mentions of entities and their attributes by accessing external databases (required by, e.g., dialogue generation and recipe generation) and internal state (required by, e.g. language models which are aware of coreference). This facilitates the incorporation of information that can be accessed in predictable locations in databases or discourse context, even when the targets of the reference may be rare words. Experiments on three representative applications show our model variants outperform models based on deterministic attention.
Unsupervized Image Clustering With SIFT-Based Soft-Matching Affinity Propagation

It is known that affinity propagation can perform exemplar-based unsupervised image clustering by taking as input similarities between pairs of images and producing a set of exemplars that best represent the images, and then assigning each nonexemplar image to its most appropriate exemplar. However, the clustering performance of affinity propagation is largely limited by the adopted similarity between any pair of images. As the scale invariant feature transform (SIFT) has been widely employed to extract image features, the nonmetric similarity between any pair of images was proposed by “hard” matching of SIFT features (e.g., counting the number of matching SIFT features). In this letter, we notice, however, that the decision of hard matching of SIFT features is binary, which is not necessary for deriving similarities. Hence, we propose a novel measure of similarities by replacing hard matching with the so-called soft matching. Experimental examples show that significant performance gains can be achieved by the resulting affinity propagation algorithm.
Deep Residual Bidir-LSTM for Human Activity Recognition Using Wearable Sensors

Human activity recognition (HAR) has become a popular topic in research because of its wide application. With the development of deep learning, new ideas have appeared to address HAR problems. Here, a deep network architecture using residual bidirectional long short-term memory (LSTM) cells is proposed. The advantages of the new network include that a bidirectional connection can concatenate the positive time direction (forward state) and the negative time direction (backward state). Second, residual connections between stacked cells act as highways for gradients, which can pass underlying information directly to the upper layer, effectively avoiding the gradient vanishing problem. Generally, the proposed network shows improvements on both the temporal (using bidirectional cells) and the spatial (residual connections stacked deeply) dimensions, aiming to enhance the recognition rate. When tested with the Opportunity data set and the public domain UCI data set, the accuracy was increased by 4.78% and 3.68%, respectively, compared with previously reported results. Finally, the confusion matrix of the public domain UCI data set was analyzed.
Predicting short-term interests using activity-based search context

A query considered in isolation offers limited information about a searcher's intent. Query context that considers pre-query activity (e.g., previous queries and page visits), can provide richer information about search intentions. In this paper, we describe a study in which we developed and evaluated user interest models for the current query, its context (from pre-query session activity), and their combination, which we refer to as intent. Using large-scale logs, we evaluate how accurately each model predicts the user's short-term interests under various experimental conditions. In our study we: (i) determine the extent of opportunity for using context to model intent; (ii) compare the utility of different sources of behavioral evidence (queries, search result clicks, and Web page visits) for building predictive interest models, and; (iii) investigate optimally combining the query and its context by learning a model that predicts the context weight for each query. Our findings demonstrate significant opportunity in leveraging contextual information, show that context and source influence predictive accuracy, and show that we can learn a near-optimal combination of the query and context for each query. The findings can inform the design of search systems that leverage contextual information to better understand, model, and serve searchers' information needs.
Wind noise reduction method for speech recording using multiple noise templates and observed spectrum fine structure

Wind noise affects the quality of the speech recording in the field. In this paper, we propose a wind noise reduction method based on a signal processing technique. In the method, spectrum envelopes of wind noise are estimated by using referential multiple wind noise templates and the low frequency band spectrum envelope of the observed signal. Then, we estimate the noise spectrum using the estimated spectrum envelope and the fine structure of the observed signal. Finally, we subtract this estimated noise spectrum from the observed signal. For evaluating the proposed method, we conducted subjective and objective evaluation. The experimental results showed that the proposed method achieved much better improvement than conventional spectral subtraction.
ERP system implementation in SMEs: exploring the influences of the SME context

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opinions and views of the authors, and are not the views of or endorsed by Taylor & Francis. The accuracy of the Content should not be relied upon and should be independently verified with primary sources of information. Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content.
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving

Two important requirements when aggregating the preferences of multiple agents are that the outcome should be economically efficient and the aggregation mechanism should not be manipulable. In this article, we provide a computer-aided proof of a sweeping impossibility using these two conditions for randomized aggregation mechanisms. More precisely, we show that every efficient aggregation mechanism can be manipulated for all expected utility representations of the agents’ preferences. This settles an open problem and strengthens several existing theorems, including statements that were shown within the special domain of assignment. Our proof is obtained by formulating the claim as a satisfiability problem over predicates from real-valued arithmetic, which is then checked using a satisfiability modulo theories (SMT) solver. To verify the correctness of the result, a minimal unsatisfiable set of constraints returned by the SMT solver was translated back into a proof in higher-order logic, which was automatically verified by an interactive theorem prover. To the best of our knowledge, this is the first application of SMT solvers in computational social choice.
Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds

Third-party cloud computing represents the promise of outsourcing as applied to computation. Services, such as Microsoft's Azure and Amazon's EC2, allow users to instantiate virtual machines (VMs) on demand and thus purchase precisely the capacity they require when they require it. In turn, the use of virtualization allows third-party cloud providers to maximize the utilization of their sunk capital costs by multiplexing many customer VMs across a shared physical infrastructure. However, in this paper, we show that this approach can also introduce new vulnerabilities. Using the Amazon EC2 service as a case study, we show that it is possible to map the internal cloud infrastructure, identify where a particular target VM is likely to reside, and then instantiate new VMs until one is placed co-resident with the target. We explore how such placement can then be used to mount cross-VM side-channel attacks to extract information from a target VM on the same machine.
The Alternating Decision Tree Learning Algorithm

The application of boosting procedures to decision tree algorithms has been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a number of decision trees. Unfortunately, these classi ers are often large, complex and diÆcult to interpret. This paper describes a new type of classi cation rule, the alternating decision tree, which is a generalization of decision trees, voted decision trees and voted decision stumps. At the same time classi ers of this type are relatively easy to interpret. We present a learning algorithm for alternating decision trees that is based on boosting. Experimental results show it is competitive with boosted decision tree algorithms such as C5.0, and generates rules that are usually smaller in size and thus easier to interpret. In addition these rules yield a natural measure of classi cation con dence which can be used to improve the accuracy at the cost of abstaining from predicting examples that are hard to classify.
BER comparison between Convolutional, Turbo, LDPC, and Polar codes

Channel coding is a fundamental building block in any communications system. High performance codes, with low complexity encoding and decoding are a must-have for future wireless systems, with requirements ranging from the operation in highly reliable scenarios, utilizing short information messages and low code rates, to high throughput scenarios, working with long messages, and high code rates. We investigate in this paper the performance of Convolutional, Turbo, Low-Density Parity-Check (LDPC), and Polar codes, in terms of the Bit-Error-Ratio (BER) for different information block lengths and code rates, spanning the multiple scenarios of reliability and high throughput. We further investigate their convergence behavior with respect to the number of iterations (turbo and LDPC), and list size (polar), as well as how their performance is impacted by the approximate decoding algorithms.
Approach and Avoidance Achievement Goals and Intrinsic Motivation : A Mediational Analysis

Most contemporary achievement goal conceptualizations consist of a performance goal versus mastery goal dichotomy. The present research offers an alternative framework by partitioning the performance goal orientation into independent approach and avoidance motivational orientations. Two experiments investigated the predictive utility of the proposed approach-avoidance achievement goal conceptualization in the intrinsic motivation domain. Results from both experiments supported the proposed framework; only performance goals grounded in the avoidance of failure undermined intrinsic motivation. Task involvement was validated as a mediator of the observed effects on intrinsic motivation. Ramifications for the achievement goal approach to achievement motivation and future research avenues are discussed.
Design of Folded Cascode Operational Amplifier ( Op-Amp ) with Common-Mode Feedback ( CMFB ) for Pipeline ADC

This work proposed a design of folded cascode operational amplifier (op-amp) with common-mode feedback (CMFB) circuit for Pipeline Analog-to-Digital Converter (ADC) with high gain and large unity bandwidth. The folded cascode topology with CMFB has been implemented in CMOS 0.13 μm Silterra process technology with 1.8 V supply voltage. The simulation results show that the DC gain is 62.69dB, the phase margin (PM) is 68.36 degree, and the unity gain bandwidth (UGB) of 133.1 MHz is achieved. The power consumption of this op-amp is only 0.3 mW and 22.6 V/μs of slew rate with 72.4 ns settling time. The performance of schematic is evaluated using Cadance simulations.
Power Attack on Small RSA Public Exponent

In this paper, we present a new attack on RSA when the public exponent is short, for instance 3 or 2 +1, and when the classical exponent randomization is used. This attack works even if blinding is used on the messages. From a Simple Power Analysis (SPA) we study the problem of recovering the RSA private key when non consecutive bits of it leak from the implementation. We also show that such information can be gained from sliding window implementations not protected against SPA.
Bee Colony Optimization (BCO)

Swarm Intelligence is the part of Artificial Intel ligence based on study of actions of individuals in various decentralized sys tems. The Bee Colony Optimization (BCO) metaheuristic has been introduce fairly recently as a new direction in the field of Swarm Intelligence. Artif icial bees represent agents, which collaboratively solve complex combinatorial optimiz ation problem. The chapter presents a classification and analysis of the resul ts achieved using Bee Colony Optimization (BCO) to model complex engineering and management processes. The primary goal of this chapter is to acquaint readers with the basic principles of Bee Colony Optimization, as well as to indicate potenti al BCO applications in engineering and management.
Adaptive Nonlocal Filtering: A Fast Alternative to Anisotropic Diffusion for Image Enhancement

Nonlinear anisotropic diffusion algorithms provide significant improvement in image enhancement as compared to linear filters. However, the excessive computational cost of solving nonlinear PDEs precludes their use in real-time vision applications. In the present paper, we show that two orders of magnitude speed improvement is provided by a new image filtering paradigm in which an adaptively determined vector field specifies nonlocal application points for an image filter.
Implementation of AES-GCM encryption algorithm for high performance and low power architecture Using FPGA

Evaluation of the Advanced Encryption Standard (AES) algorithm in FPGA is proposed here. This Evaluation is compared with other works to show the efficiency. Here we are concerned about two major purposes. The first is to define some of the terms and concepts behind basic cryptographic methods, and to offer a way to compare the myriad cryptographic schemes in use today. The second is to provide some real examples of cryptography in use today. The design uses an iterative looping approach with block and key size of 128 bits, lookup table implementation of S-box. This gives low complexity architecture and easily achieves low latency as well as high throughput. Simulation results, performance results are presented and compared with previous reported designs. Since its acceptance as the adopted symmetric-key algorithm, the Advanced Encryption Standard (AES) and its recently standardized authentication Galois/Counter Mode (GCM) have been utilized in various security-constrained applications. Many of the AES-GCM applications are power and resource constrained and requires efficient hardware implementations. In this project, AES-GCM algorithms are evaluated and optimized to identify the high-performance and low-power architectures. The Advanced Encryption Standard (AES) is a specification for the encryption of electronic data. The Cipher Block Chaining (CBC) mode is a confidentiality mode whose encryption process features the combining (“chaining”) of the plaintext blocks with the previous Cipher text blocks. The CBC mode requires an IV to combine with the first plaintext block. The IV need not be secret, but it must be unpredictable. Also, the integrity of the IV should be protected. Galois/Counter Mode (GCM) is a block cipher mode of operation that uses universal hashing over a binary Galois field to provide authenticated encryption. Galois Hash is used for authentication, and the Advanced Encryption Standard (AES) block cipher is used for encryption in counter mode of operation. To obtain the least-complexity S-box, the formulations for the Galois Field (GF) sub-field inversions in GF (24) are optimized By conducting exhaustive simulations for the input transitions, we analyze the synthesis of the AES S-boxes considering the switching activities, gate-level net lists, and parasitic information. Finally, by implementation of AES-GCM the high-performance GF (2128) multiplier architectures, gives the detailed information of its performance. An optimized coding for the implementation of Advanced Encryption Standard-Galois Counter Mode has been developed. The speed factor of the algorithm implementation has been targeted and a software code in Verilog HDL has been developed. This implementation is useful in wireless security like military communication and mobile telephony where there is a grayer emphasis on the speed of communication.
Mechanical recycling of waste electric and electronic equipment: a review.

The production of electric and electronic equipment (EEE) is one of the fastest growing areas. This development has resulted in an increase of waste electric and electronic equipment (WEEE). In view of the environmental problems involved in the management of WEEE, many counties and organizations have drafted national legislation to improve the reuse, recycling and other forms of recovery of such wastes so as to reduce disposal. Recycling of WEEE is an important subject not only from the point of waste treatment but also from the recovery of valuable materials.WEEE is diverse and complex, in terms of materials and components makeup as well as the original equipment's manufacturing processes. Characterization of this waste stream is of paramount importance for developing a cost-effective and environmentally friendly recycling system. In this paper, the physical and particle properties of WEEE are presented. Selective disassembly, targeting on singling out hazardous and/or valuable components, is an indispensable process in the practice of recycling of WEEE. Disassembly process planning and innovation of disassembly facilities are most active research areas. Mechanical/physical processing, based on the characterization of WEEE, provides an alternative means of recovering valuable materials. Mechanical processes, such as screening, shape separation, magnetic separation, Eddy current separation, electrostatic separation, and jigging have been widely utilized in recycling industry. However, recycling of WEEE is only beginning. For maximum separation of materials, WEEE should be shredded to small, even fine particles, generally below 5 or 10mm. Therefore, a discussion of mechanical separation processes for fine particles is highlighted in this paper. Consumer electronic equipment (brown goods), such as television sets, video recorders, are most common. It is very costly to perform manual dismantling of those products, due to the fact that brown goods contain very low-grade precious metals and copper. It is expected that a mechanical recycling process will be developed for the upgrading of low metal content scraps.
Essential oils as alternatives to antibiotics in swine production

This review article summarizes the efficacy, feasibility and potential mechanisms of the application of essential oils as antibiotic alternatives in swine production. Although there are numerous studies demonstrating that essential oils have several properties, such as antimicrobial, antioxidative and anti-inflammatory effects, feed palatability enhancement and improvement in gut growth and health, there is still a need of further investigations to elucidate the mechanisms underlying their functions. In the past, the results has been inconsistent in both laboratory and field studies because of the varied product compositions, dosages, purities and growing stages and conditions of animals. The minimal inhibitory concentration (MIC) of essential oils needed for killing enteric pathogens may not ensure the optimal feed intake and the essential oils inclusion cost may be too high in swine production. With the lipophilic and volatile nature of essential oils, there is a challenge in effective delivery of essential oils within pig gut and this challenge can partially be resolved by microencapsulation and nanotechnology. The effects of essential oils on inflammation, oxidative stress, microbiome, gut chemosensing and bacterial quorum sensing (QS) have led to better production performance of animals fed essential oils in a number of studies. It has been demonstrated that essential oils have good potential as antibiotic alternatives in feeds for swine production. The combination of different essential oils and other compounds (synergistic effect) such as organic acids seems to be a promising approach to improve the efficacy and safety of essential oils in applications. High-throughput systems technologies have been developed recently, which will allow us to dissect the mechanisms underlying the functions of essential oils and facilitate the use of essential oils in swine production.
New Trends of Digital Data Storage in DNA

With the exponential growth in the capacity of information generated and the emerging need for data to be stored for prolonged period of time, there emerges a need for a storage medium with high capacity, high storage density, and possibility to withstand extreme environmental conditions. DNA emerges as the prospective medium for data storage with its striking features. Diverse encoding models for reading and writing data onto DNA, codes for encrypting data which addresses issues of error generation, and approaches for developing codons and storage styles have been developed over the recent past. DNA has been identified as a potential medium for secret writing, which achieves the way towards DNA cryptography and stenography. DNA utilized as an organic memory device along with big data storage and analytics in DNA has paved the way towards DNA computing for solving computational problems. This paper critically analyzes the various methods used for encoding and encrypting data onto DNA while identifying the advantages and capability of every scheme to overcome the drawbacks identified priorly. Cryptography and stenography techniques have been analyzed in a critical approach while identifying the limitations of each method. This paper also identifies the advantages and limitations of DNA as a memory device and memory applications.