nils-herrmann/clean_scirepeval huggingface dataset:
Web Caching with Consistent Hashing

A key performance measure for the World Wide Web is the speed with which content is served to users. As traffic on the Web increases, users are faced with increasing delays and failures in data delivery. Web caching is one of the key strategies that has been explored to improve performance. An important issue in many caching systems is how to decide what is cached where at any given time. Solutions have included multicast queries and directory schemes. In this paper, we offer a new Web caching strategy based on consistent hashing. Consistent hashing provides an alternative to multicast and directory schemes, and has several other advantages in load balancing and fault tolerance. Its performance was analyzed theoretically in previous work; in this paper we describe the implementation of a consistent-hashing-based system and experiments that support our thesis that it can provide performance improvements.  1999
Clickstream clustering using weighted longest common subsequences

Categorizing visitors based on their interactions with a we bsite is a key problem in web usage mining. The clickstreams generated by various users often follow disti nct patterns, the knowledge of which may help in providing customized content. In this paper, we propose a novel and eff ective algorithm for clustering webusers based on a function of the longest common subsequence of their clickst reams that takes into account both the trajectory taken through a website and the time spent at each page. Results are presented on weblogs of www.sulekha.com to illustrate the techniques. keywords : web usage mining, clickstream, subsequence, clustering.
Nonword repetition and sentence repetition as clinical markers of specific language impairment: the case of Cantonese.

Recent research suggests that nonword repetition (NWR) and sentence repetition (SR) tasks can be used to discriminate between children with SLI and their typically developing age-matched (TDAM) and younger (TDY) peers.



Fourteen Cantonese-speaking children with SLI and 30 of their TDAM and TDY peers were compared on NWR and SR tasks. NWR of IN nonwords (CV combinations attested in the language) and OUT nonwords (CV combinations unattested in the language) were compared. SR performance was compared using 4 different scoring methods.



The SLI group did not score significantly lower than the TDAM group on the test of NWR (overall results were TDAM = SLI > TDY). There were nonsignificant group differences on IN syllables but not on OUT syllables. The results do not suggest a limitation in phonological working memory in Cantonese-speaking children with SLI. The SR task discriminated between children and their TDAM peers but not between children with SLI and their TDY peers matched for mean length of utterance.



SR but not NWR discriminates between children with SLI and their TDAM peers. Poorer NWR for English-speaking children with SLI might be attributable to weaker use of the redintegration strategy in word repetition. Further cross-linguistic investigations of processing strategies are required.
An experience in blending the traditional and Agile methodologies to assist in a small software development project

Agile methodology has been adopted for many software development projects, due to its ability to deal with changing product requirements, while Traditional methods are better suited to dealing with projects that have clearly defined requirements. Because of the differences in the two methodologies and their diverse approaches to solving development problems, it is necessary to understand their individual approaches in order for the benefits to be compared and synthesized. This study is necessary to understand the differences and diversities of the two methodologies using the checklist table to select and adopt the appropriate methodology for particular development projects. Results of this study not only provide positive answers but also offer suggestions for better integration.
Deep learning classifier for fall detection based on IR distance sensor data

The goal of research is the fall detection in elderly residents based on infra red depth sensor measurements. Our attention is focused on statistical properties as generalization. The effectiveness of discriminative statistical classifiers (multilayer perceptron) is improved by addition of feature selection block by Gram-Schmidt orthogonalization, which determines the ranking of the features, and NPCA block, which transforms the raw data into a nonlinear manifold and reduces the dimensionality of the data. Performance of our system measured in terms of sensitivity is 92% and precision is 93%, which means it can be used for real life applications.
Hierarchical organization versus self-organization

In this paper the difference between hierarchical organization and selforganization is investigated. Organization is defined as a structure with a function. But how does the structure affect the function? I will start to examine this by doing two simulations. The idea is to have a given network of agents, which influence their neighbors. How the result differs in three different types of networks, is then explored. In the first simulation, agents try to align with their neighbors. The second simulation is inspired by the ecosystem. Agents take certain products from their neighbors, and transform them into products their neighbors can use.
Past, Present, and Future of Recommender Systems: An Industry Perspective

When the Netflix Prize launched in 2006, it put a spotlight on the importance and use of recommender systems in real-world applications. The competition provided many lessons, and many more have been learned since the Grand Prize was awarded in 2009. The use of recommender systems in industry has continued to grow driven by the availability of many kinds of user data and the continued interest for the area within the research community. In this paper, we will describe what we see as the past, present, and future of recommender systems from an industry perspective.
Self-configuration of IEEE 802.1 TSN networks

Configuration processes of real-time networks are costly both in terms of time and engineering effort and require the system to be shutdown during the reconfiguration phase thus resulting in significant down time as well. The convergence of IT/OT technologies is bringing a whole world of possibilities for the configuration and management of real-time networks for the automation industry. With software defined networking (SDN) features like the separation of the data and control plane and standards like IEEE 802.1 developed with the goal of adding deterministic capabilities to traditionally dynamic switched Ethernet networks, the plug and play paradigm is almost around the corner. In this paper, we go one step further and start looking into the self-configuration of real-time networks. To achieve that we propose to introduce a Configuration Agent in the network, an entity that continuously monitors the network to detect changes and automatically update the configuration to adapt to such changes while maintaining desired quality of service. We present here the complete framework for the Configuration Agent that will provide self-configuration capabilities to real-time networks. The proposed framework has IEEE 802.1 as its core, but also shows how the set of standards need to be extended in order to achieve the self-configuration requirements. Concretely we examine the role of existing communication protocols like NETCONF and OPC-UA and propose the essential ingredients (managed objects) for a YANG model for the learning aspects in the bridges, including different working modes.
Least-Squares Fitting of Two 3-D Point Sets

Two point sets {pi} and {p'i}; i = 1, 2,..., N are related by p'i = Rpi + T + Ni, where R is a rotation matrix, T a translation vector, and Ni a noise vector. Given {pi} and {p'i}, we present an algorithm for finding the least-squares solution of R and T, which is based on the singular value decomposition (SVD) of a 3 × 3 matrix. This new algorithm is compared to two earlier algorithms with respect to computer time requirements.
Multi-user lax communications: A multi-armed bandit approach

Inspired by cognitive radio networks, we consider a setting where multiple users share several channels modeled as a multi-user multi-armed bandit (MAB) problem. The characteristics of each channel are unknown and are different for each user. Each user can choose between the channels, but her success depends on the particular channel chosen as well as on the selections of other users: if two users select the same channel their messages collide and none of them manages to send any data. Our setting is fully distributed, so there is no central control. As in many communication systems, the users cannot set up a direct communication protocol, so information exchange must be limited to a minimum. We develop an algorithm for learning a stable configuration for the multi-user MAB problem. We further offer both convergence guarantees and experiments inspired by real communication networks, including comparison to state-of-the-art algorithms.
Ground penetrating radar hyperbola detection using Scale-Invariant Feature Transform

Ground-penetrating radar (GPR) is a geophysical method used for subsurface targets identification. However, a sophisticated processing of GPR data is necessary to extract targets signature. Traditionally, we use the Hough Transform to detect the hyperbolas caused by targets reflections. This one is very difficult in implementation because we deal with a three-dimensional parametric space. In fact, the Hough transform consume a huge execution time and gives random results. In a previous work, we proposed a modified Hough Transform algorithm, based on a pre-treatment phase of the B-Scans images, that give acceptable results but its a little time consuming. This paper proposes an application of one modern computer vision feature extraction technique, named Scale Invariant Feature Transform (SIFT), to hyperbola detection in GPR Bscans data. First, we will apply the SIFT algorithm to localize the hyperbolas regions, and then we apply the Hough transform on the detected regions. The results presented indicates that SIFT features provide a robust tool for target identification for both classification and prescreening.
Fault classification and fault signature production for rolling element bearings in electric machines

Most condition monitoring techniques for rolling element bearings are designed to detect the four characteristic fault frequencies. This has lead to the common practice of categorizing bearing faults according to fault location (i.e., inner race, outer race, ball, or cage fault). While the ability to detect the four characteristic fault frequencies is necessary, this approach neglects another important class of faults that arise in many industrial settings. This research introduces the notion of categorizing bearing faults as either single-point defects or generalized roughness. These classes separate bearing faults according to the fault signatures that are produced rather than by the physical location of the fault. Specifically, single-point defects produce the four predictable characteristic fault frequencies while faults categorized as generalized roughness produce unpredictable broadband changes in the machine vibration and stator current. Experimental results are provided from bearings failed in situ via a shaft current. These results illustrate the unpredictable and broadband nature of the effects produced by generalized roughness bearing faults. This issue is significant because a successful bearing condition monitoring scheme must be able to reliably detect both classes of faults.
Concurrent Reinforcement Learning from Customer Interactions

In this paper, we explore applications in which a company interacts concurrently with many customers. The company has an objective function, such as maximising revenue, customer satisfaction, or customer loyalty, which depends primarily on the sequence of interactions between company and customer. A key aspect of this setting is that interactions with different customers occur in parallel. As a result, it is imperative to learn online from partial interaction sequences, so that information acquired from one customer is efficiently assimilated and applied in subsequent interactions with other customers. We present the first framework for concurrent reinforcement learning, using a variant of temporal-difference learning to learn efficiently from partial interaction sequences. We evaluate our algorithms in two largescale test-beds for online and email interaction respectively, generated from a database of 300,000 customer records.
Time optimal path planning considering acceleration limits

A robot path planning technique is proposed in the paper. It was developed for robots with differential drive, but with minor modifications it could be used for all types of nonholonomic robots. The path was planned in the way to minimise the time of reaching the end point in desired direction and with desired velocity, starting from the initial state described by the start point, initial direction and initial velocity. The limitation was the grip of the tires that results in the acceleration limits. The path is presented as a spline curve and was optimised by placing the control points through which the curve should pass.
Text Classification Using the N-Gram Graph Representation Model Over High Frequency Data Streams

A prominent challenge in our information age is the classification over high frequency data streams. In this research, we propose an innovative and high-accurate text stream classificationmodel that is designed in an elastic distributed way and is capable to service text load with fluctuated frequency. In this classification model, text is represented as N-Gram Graphs and the classification process takes place using text pre-processing, graph similarity and feature classification techniques following the supervised machine learning approach. The work involves the analysis of many variations of the proposed model and its parameters, such as various representations of text as N-Gram Graphs, graph comparisons metrics and classification methods in order to conclude to the most accurate setup. To deal with the scalability, the availability and the timely response in case of high frequency text we employ the Beam programming model. Using the Beam programmingmodel the classification process occurs as a sequence of distinct tasks and facilitates the distributed implementation of the most computational demanding tasks of the inference stage. The proposed model and the various parameters that constitute it are evaluated experimentally and the high frequency stream emulated using two public datasets (20NewsGroup and Reuters-21578) that are commonly used in the literature for text classification.
Hardware Covert Attacks and Countermeasures

Computing platforms deployed in many critical infrastructures, such as smart grid, financial systems, governmental organizations etc., are subjected to security attacks and potentially devastating consequences. Computing platforms often get attacked 'physically' by an intruder accessing stored information, studying the internal structure of the hardware or injecting a fault. Even if the attackers fail to gain sensitive information stored in hardware, they may be able to disrupt the hardware or deny service leading to other kinds of security failures in the system. Hardware attacks could be covert or overt, based on the awareness of the intended system. This work classifies existing hardware attacks. Focusing mainly on covert attacks, they are quantified using a proposed schema. Different countermeasure techniques are proposed to prevent such attacks.
Deception Detection using Real-life Trial Data

Hearings of witnesses and defendants play a crucial role when reaching court trial decisions. Given the high-stake nature of trial outcomes, implementing accurate and effective computational methods to evaluate the honesty of court testimonies can offer valuable support during the decision making process. In this paper, we address the identification of deception in real-life trial data. We introduce a novel dataset consisting of videos collected from public court trials. We explore the use of verbal and non-verbal modalities to build a multimodal deception detection system that aims to discriminate between truthful and deceptive statements provided by defendants and witnesses. We achieve classification accuracies in the range of 60-75% when using a model that extracts and fuses features from the linguistic and gesture modalities. In addition, we present a human deception detection study where we evaluate the human capability of detecting deception in trial hearings. The results show that our system outperforms the human capability of identifying deceit.
Integrating perceived playfulness into expectation-confirmation model for web portal context

This paper investigated the value of including "playfulness" in expectation-confirmation theory (ECT) when studying continued use of a web site. Original models examined cognitive beliefs and effects that influence a person's intention to continue to use an information system. Here, an extended ECT model (with an additional relationship between perceived playfulness and satisfaction) was shown to provide a better fit than a simple path from perceived usefulness to satisfaction. The results indicated that perceived playfulness, confirmation to satisfaction, and perceived usefulness all contributed significantly to the users' intent to reuse a web site. Thus, we believe that the extended ECT model is an appropriate tool for the study of web site effects.
Model-predictive target defense by team of unmanned surface vehicles operating in uncertain environments

In this paper, we present a heuristic planning approach for guarding a valuable asset by a team of autonomous unmanned surface vehicles (USVs) operating in a continuous state-action space. The team's objective is to maximize the amount of time it takes an intruder boat to reach the asset. The team must cooperatively deal with uncertainty about which boats are actual intruders, employ active blocking to slow down intruders' movement towards the asset, and intelligently distribute themselves around the target to optimize future guarding opportunities. Our planner incorporates a market-based algorithm for allocating tasks to individual USVs by forward-simulating the mission and assigning estimated utilities to candidate task-allocation plans. The planner can be automatically adapted to a specific mission by optimizing the behaviors used to fulfil individual tasks. We present detailed simulation results that demonstrate the effectiveness of our approach.
Revisiting Requirements Elicitation Techniques

The importance of Requirements Engineering (RE) has been well recognized by the research community in the last decade. There is no doubt to say that requirements phase is the foundation of the entire Software Development Life Cycle (SDLC) on which the entire software is built. With the proper management of various activities falling under requirements phase, a project can deliver the right solution within the time and budget. Requirement elicitation, requirement specification, and requirement validation are the important stages to assure the quality of requirement documentations. Out of these, elicitation is the first major activity, which requires proper attention by Requirement Engineers and other related stakeholders. Literature reveals various elicitation techniques, which can be used for the purpose depending upon the nature of project/s. In this paper, an attempt is made to cover all the major elicitation techniques along with their significant aspects at one place. Such a review would enable the concerned stakeholders to understand and select the most appropriate technique to be used for their project/s.
Speed measurement algorithm for low speed permanent magnet synchronous motor based on overlapped measurement regions

In order to improve the speed measurement performance of low speed PMSM drives equipped with absolute optical encoders, this paper proposes a speed measurement method based on overlapped measurement regions. The proposed method replaces the long measurement region of the conventional backward differentiation method with several short ones which are overlapped at most regions. In one speed measurement process, the results obtained from the short regions are averaged to improve precision. Then the relationship between precision, time delay and region length, overlap times, are analyzed using expectation and variance as performance index. Based on the analysis, an optimal design method of the measurement region is derived. Experimental researches are carried out on a low speed permanent magnet synchronous motor equipped with a 13 bit absolute encoder. The results prove the validity and effectiveness of the proposed method.
A Review of Smart Homes—Past, Present, and Future

A smart home is an application of ubiquitous computing in which the home environment is monitored by ambient intelligence to provide context-aware services and facilitate remote home control. This paper presents an overview of previous smart home research as well as the associated technologies. A brief discussion on the building blocks of smart homes and their interrelationships is presented. It describes collective information about sensors, multimedia devices, communication protocols, and systems, which are widely used in smart home implementation. Special algorithms from different fields and their significance are explained according to their scope of use in smart homes. This paper also presents a concrete guideline for future researchers to follow in developing a practical and sustainable smart home.
A Reduced Reference Image Quality assessment for Multiply Distorted Images

In this paper, we propose a new Reduced Reference Image Quality Metric for multiply degraded images based on a features extraction step and its combination. The selected features are extracted from the original image and its degraded version. Some of them aim to quantify the level of the considered degradation types, while the others quantify its sharpness. These features are then combined to obtain a single value, which corresponds to the predicted subjective score. Our method has been evaluated and compared in terms of correlation with subjective judgments to some recent methods by using the LIVE Multiply Distorted Image Quality Database.
Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics

Frequent subgraph mining has been extensively studied on certain graph data. However, uncertainties are inherently accompanied with graph data in practice, and there is very few work on mining uncertain graph data. This paper investigates frequent subgraph mining on uncertain graphs under probabilistic semantics. Specifically, a measure called φ-frequent probability is introduced to evaluate the degree of recurrence of subgraphs. Given a set of uncertain graphs and two numbers 0 < φ,τ < 1, the goal is to quickly find all subgraphs with φ-frequent probability at least τ. Due to the NP-hardness of the problem, an approximate mining algorithm is proposed for this problem. Let 0 < δ < 1 be a parameter. The algorithm guarantees to find any frequent subgraph S with probability at least (1 - δ/2)s, where s is the number of edges of S. In addition, it is thoroughly discussed how to set δ to guarantee the overall approximation quality of the algorithm. The extensive experiments on real uncertain graph data verify that the algorithm is efficient and that the mining results have very high quality.