nils-herrmann/clean_scirepeval huggingface dataset:
Capacity of Neural Networks for Lifelong Learning of Composable Tasks

We investigate neural circuits in the exacting setting that (i) the acquisition of a piece of knowledge can occur from a single interaction, (ii) the result of each such interaction is a rapidly evaluatable subcircuit, (iii) hundreds of thousands of such subcircuits can be acquired in sequence without substantially degrading the earlier ones, and (iv) recall can be in the form of a rapid evaluation of a composition of subcircuits that have been so acquired at arbitrary different earlier times.We develop a complexity theory, in terms of asymptotically matching upper and lower bounds, on the capacity of a neural network for executing, in this setting, the following action, which we call {\it association}: Each action sets up a subcircuit so that the excitation of a chosen set of neurons A will in future cause the excitation of another chosen set B.% As model of computation we consider the neuroidal model, a fully distributed model in which the quantitative resources n, the neuron numbers, d, the number of other neurons each neuron is connected to, and k, the inverse of the maximum synaptic strength, are all accounted for.A succession of experiences, possibly over a lifetime, results in the realization of a complex set of subcircuits. The composability requirement constrains the model to ensure that, for each association as realized by a subcircuit, the excitation in the triggering set of neurons A is quantitatively similar to that in the triggered set B, and also that the unintended excitation in the rest of the system is negligible. These requirements ensure that chains of associations can be triggeredWe first analyze what we call the Basic Mechanism, which uses only direct connections between neurons in the triggering set A and the target set B. We consider random networks of n neurons with expected number d of connections to and from each. We show that in the composable context capacity growth is limited by d^2, a severe limitation if the network is sparse, as it is in cortex. We go on to study the Expansive Mechanism, that additionally uses intermediate relay neurons which have high synaptic weights. For this mechanism we show that the capacity can grow as dn, to within logarithmic factors. From these two results it follows that in the composable regime, for the realistic cortical estimate of d=n^{\frac{1}{2}, superlinear capacity of order n^{\frac{3}{2}} in terms of the neuron numbers can be realized by the Expansive Mechanism, instead of the linear order n to which the Basic Mechanism is limited. More generally, for both mechanisms, we establish matching upper and lower bounds on capacity in terms of the parameters n, d, and the inverse maximum synaptic strength k.The results as stated above assume that in a set of associations, a target B can be triggered by at most one set A. It can be shown that the capacities are similar if the number m of As that can trigger a B is greater than one but small, but become severely constrained if m exceeds a certain threshold.
LUBM: A benchmark for OWL knowledge base systems

We describe our method for benchmarking Semantic Web knowledge base systems with respect to use in large OWL applications. We present the Lehigh University Benchmark (LUBM) as an example of how to design such benchmarks. The LUBM features an on-tology for the university domain, synthetic OWL data scalable to an arbitrary size, fourteen extensional queries representing a variety of properties, and several performance metrics. The LUBM can be used to evaluate systems with different reasoning capabilities and storage mechanisms. We demonstrate this with an evaluation of two memory-based systems and two systems with persistent storage.
Accelerated Alternating Direction Method of Multipliers

Recent years have seen a revival of interest in the Alternating Direction Method of Multipliers (ADMM), due to its simplicity, versatility, and scalability. As a first order method for general convex problems, the rate of convergence of ADMM is O(1=k) [4, 25]. Given the scale of modern data mining problems, an algorithm with similar properties as ADMM but faster convergence rate can make a big difference in real world applications. In this paper, we introduce the Accelerated Alternating Direction Method of Multipliers (A2DM2) which solves problems with the same structure as ADMM. When the objective function is strongly convex, we show that A2DM2 has a O(1=k2) convergence rate. Unlike related existing literature on trying to accelerate ADMM, our analysis does not need any additional restricting assumptions. Through experiments, we show that A2DM2 converges faster than ADMM on a variety of problems. Further, we illustrate the versatility of the general A2DM2 on the problem of learning to rank, where it is shown to be competitive with the state-of-the-art specialized algorithms for the problem on both scalability and accuracy.
“The Internet is a Mask”: High School Students' Suggestions for Preventing Cyberbullying

Interactions through technology have an important impact on today's youth. While some of these interactions are positive, there are concerns regarding students engaging in negative interactions like cyberbullying behaviors and the negative impact these behaviors have on others. The purpose of the current study was to explore participant suggestions for both students and adults for preventing cyberbullying incidents.



Forty high school students participated in individual, semi-structured interviews. Participant experiences and perceptions were coded using constant comparative methods to illustrate ways in which students and adults may prevent cyberbullying from occurring within their school and community.



Students reported that peers would benefit from increasing online security, as well as becoming more aware of their cyber-surroundings. Regarding adult-provided prevention services, participants often discussed that there is little adults can do to reduce cyberbullying. Reasons included the difficulties in restricting online behaviors or providing effective consequences. However, some students did discuss the use of in-school curricula while suggesting that adults blame people rather than technology as potential ways to prevent cyberbullying.



Findings from the current study indicate some potential ways to improve adult efforts to prevent cyberbullying. These strategies include parent/teacher training in technology and cyberbullying, interventions focused more on student behavior than technology restriction, and helping students increase their online safety and awareness.
Progressive Growing of GANs for Improved Quality, Stability, and Variation

We describe a new training methodology for generative adversarial networks. The key idea is to grow both the generator and discriminator progressively: starting from a low resolution, we add new layers that model increasingly fine details as training progresses. This both speeds the training up and greatly stabilizes it, allowing us to produce images of unprecedented quality, e.g., CELEBA images at 1024. We also propose a simple way to increase the variation in generated images, and achieve a record inception score of 8.80 in unsupervised CIFAR10. Additionally, we describe several implementation details that are important for discouraging unhealthy competition between the generator and discriminator. Finally, we suggest a new metric for evaluating GAN results, both in terms of image quality and variation. As an additional contribution, we construct a higher-quality version of the CELEBA dataset.
Practical Byzantine Fault Tolerance

Our growing reliance on online services accessible on the Internet demands highly-available systems that provide correct service without interruptions. Byzantine faults such as software bugs, operator mistakes, and malicious attacks are the major cause of service interruptions. This thesis describes a new replication algorithm, BFT, that can be used to build highly-available systems that tolerate Byzantine faults. It shows, for the first time, how to build Byzantine-fault-tolerant systems that can be used in practice to implement real services because they do not rely on unrealistic assumptions and they perform well. BFT works in asynchronous environments like the Internet, it incorporates mechanisms to defend against Byzantine-faulty clients, and it recovers replicas proactively. The recovery mechanism allows the algorithm to tolerate any number of faults over the lifetime of the system provided fewer than 1/3 of the replicas become faulty within a small window of vulnerability. The window may increase under a denial-of-service attack but the algorithm can detect and respond to such attacks and it can also detect when the state of a replica is corrupted by an attacker. BFT has been implemented as a generic program library with a simple interface. The BFT library provides a complete solution to the problem of building real services that tolerate Byzantine faults. We used the library to implement the first Byzantine-fault-tolerant NFS file system, BFS. The BFT library and BFS perform well because the library incorporates several important optimizations. The most important optimization is the use of symmetric cryptography to authenticate messages. Public-key cryptography, which was the major bottleneck in previous systems, is used only to exchange the symmetric keys. The performance results show that BFS performs 2% faster to 24% slower than production implementations of the NFS protocol that are not replicated. Therefore, we believe that the BFT library can be used to build practical systems that tolerate Byzantine faults. Thesis Supervisor: Barbara H. Liskov Title: Ford Professor of Engineering
PERFORMANCE COMPARISON OF APRIORI , ECLAT AND FP-GROWTH ALGORITHM FOR ASSOCIATION RULE LEARNING GAYATHRI

The main aim is to generate a frequent itemset. Big Data analytics is the process of examining big data to uncover hidden patterns. Association Rule Learning is a technique which is used to implement big data. It finds the frequent items in the dataset. Frequent itemsets are those items which occur frequently in the database. To find the frequent itemsets, we are using three algorithms APRIORI ALGORITHM, ECLAT ALGORITHM and FP-GROWTH ALGORITHM. The performance of these three algorithms is compared based on the Time efficiency. After the comparison, we conclude that APRIORI algorithm is the fastest algorithm for large dataset and FP-GROWTH algorithm is the fastest algorithm for small dataset. It takes less time to generate the frequent item-sets as compared to other algorithm, that is, ECLAT algorithm.  Big Data analytics, Association Rule Learning, frequent item-sets
Sharing Residual Units Through Collective Tensor Factorization in Deep Neural Networks

Residual units are wildly used for alleviating optimization difficulties when building deep neural networks. However, the performance gain does not well compensate the model size increase, indicating low parameter efficiency in these residual units. In this work, we first revisit the residual function in several variations of residual units and demonstrate that these residual functions can actually be explained with a unified framework based on generalized block term decomposition. Then, based on the new explanation, we propose a new architecture, Collective Residual Unit (CRU), which enhances the parameter efficiency of deep neural networks through collective tensor factorization. CRU enables knowledge sharing across different residual units using shared factors. Experimental results show that our proposed CRU Network demonstrates outstanding parameter efficiency, achieving comparable classification performance to ResNet-200 with the model size of ResNet-50. By building a deeper network using CRU, we can achieve stateof-the-art single model classification accuracy on ImageNet-1k and Places365-Standard benchmark datasets. (Code and trained models are available on GitHub3)
Haptic stylus with inertial and vibro-tactile feedback

In this paper, we introduce a novel stylus capable of displaying two haptic effects to the user. The first effect is a tactile flow effect up and down along the pen, and the other is a rotation effect about the long axis of the pen. The flow effect is based on the haptic illusion of “apparent tactile motion”, while the rotation effect comes from the reaction torque created by an electric motor placed along the stylus shaft. The stylus is embedded with two vibration actuators at the ends, and a DC motor with a rotating balanced mass in the middle. We show that, it is possible to create flow and rotation effects on the stylus by driving the actuators on the stylus. Furthermore, we show that the timing and the actuation patterns of the vibration actuators and DC motor on the stylus significantly affect the discernibility of the synthesized perceptions; hence these parameters should be selected carefully. Two psychophysical experiments, each performed with 10 subjects, shed light on the discernability of the two haptic effects as a function of various actuation parameters. Our results show that, with carefully selected parameters, the subjects can successfully identify the flow of motion and the direction of rotation with high accuracies.
Understanding the Factors Driving NFC-Enabled Mobile Payment Adoption: an Empirical Investigation

Though NFC mobile payment offers both convenience and benefits to consumers, its adoption rate is still very low. This study aims to explore the factors determining consumers’ adoption of NFC mobile payment. In this study, building on TAM, an extended adoption intention model is developed by incorporating three sorts of variables into it, namely mobile payment system factors (compatibility and perceived complementarity), user characteristics (mobile payment knowledge), and a risk-related factor (perceived risk). The model is empirically tested with a sample of 377 validated respondents. Compatibility, perceived ease of use and mobile payment knowledge are found to be the factors determining individuals’ intention to use NFC mobile payment. Against our expectations, perceived usefulness and perceived risk do not affect use intention significantly in adopting NFC mobile payments among consumers. We discuss the theoretical and practical implications of these findings, and point out the limitations and need for future research.
An introduction to ROC analysis

Receiver operating characteristics (ROC) graphs are useful for organizing classifiers and visualizing their performance. ROC graphs are commonly used in medical decision making, and in recent years have been used increasingly in machine learning and data mining research. Although ROC graphs are apparently simple, there are some common misconceptions and pitfalls when using them in practice. The purpose of this article is to serve as an introduction to ROC graphs and as a guide for using them in research.
Use of genetic algorithms to solve production and operations management problems: A review

Operations managers and scholars in their search for fast and good solutions to real-world problems have applied genetic algorithms to many problems. While genetic algorithms are promising tools for problem solving, future research will benefit from a review of the problems that have been solved and the designs of the genetic algorithms used to solve them. This paper provides a review of the use of genetic algorithms to solve operations problems. Reviewed papers are classified according to the problems they solve. The basic design of each genetic algorithm is described, the shortcomings of the current research are discussed and directions for future research are suggested.
Temporal QoS-aware web service recommendation via non-negative tensor factorization

With the rapid growth of Web Service in the past decade, the issue of QoS-aware Web service recommendation is becoming more and more critical. Since the Web service QoS information collection work requires much time and effort, and is sometimes even impractical, the service QoS value is usually missing. There are some work to predict the missing QoS value using traditional collaborative filtering methods based on user-service static model. However, the QoS value is highly related to the invocation context (e.g., QoS value are various at different time). By considering the third dynamic context information, a Temporal QoS-aware Web Service Recommendation Framework is presented to predict missing QoS value under various temporal context. Further, we formalize this problem as a generalized tensor factorization model and propose a Non-negative Tensor Factorization (NTF) algorithm which is able to deal with the triadic relations of user-service-time model. Extensive experiments are conducted based on our real-world Web service QoS dataset collected on Planet-Lab, which is comprised of service invocation response-time and throughput value from 343 users on 5817 Web services at 32 time periods. The comprehensive experimental analysis shows that our approach achieves better prediction accuracy than other approaches.
Directly Fabricating Soft Robotic Actuators With an Open-Source 3-D Printer

3-D printing silicone has been a long sought for goal by roboticists. Fused deposition manufacturing (FDM) is a readily accessible and simple 3-D printing scheme that could hold the key to printing silicone. This study details an approach to 3-D print silicone elastomer through use of a thickening additive and heat curing techniques. We fabricated an identical control actuator using molding and 3-D printing techniques for comparison. By comparing the free space elongation and fixed length force of both actuators, we were able to evaluate the quality of the print. We observed that the 3-D printed linear actuator was able to perform similarly to the molded actuator, with an average error of 5.08% in actuator response, establishing the feasibility of such a system. We envision that further development of this system would contribute to the way soft robotic systems are fabricated.
Multi-factor Authentication Framework for Cloud Computing

Cloud computing is a new paradigm to deliver services over the Internet.  Security is the most critical issues in a cloud computing environment. Authentication is a key technology for information security, which is a mechanism to establish proof of identities to get access of information in the system. Traditional password authentication does not provide enough security for information in cloud computing environment to the most modern means of attacks. In this paper, we propose a new multi-factor authentication framework for cloud computing. The proposed framework provides a feasible and a most efficient mechanism which can closely integrate with the traditional authentication system.The proposed framework is verified by developing Cloud Access Management (CAM) system which authenticates the user based on multiple factors. Also using secret-splitting and encrypted value of arithmetic captcha is innovative factor for user authentication for cloud computing environment. Prototype model for cloud computing own cloud server is implemented using open sources technology. The proposed framework shows the close agreement with the standard criteria for security.
CHAPTER 5 SOFTWARE TESTING

As more extensively discussed in the Software Quality chapter of the Guide to the SWEBOK, the right attitude towards quality is one of prevention: it is obviously much better to avoid problems, rather than repairing them. Testing must be seen as a means primarily for checking whether the prevention has been effective, but also for identifying anomalies in those cases in which, for some reason, it has been not. It is perhaps obvious, but worth recognizing, that even after successfully completing an extensive testing campaign, the software could still contain faults; nor is defect free code a synonymous for quality product. The remedy to system failures that are experienced after delivery is provided by (corrective) maintenance actions. Maintenance topics are covered into the Software Maintenance chapter of the Guide to the SWEBOK.
If You Measure It, Can You Improve It?: Exploring The Value of Energy Disaggregation

Over the past few years, dozens of new techniques have been proposed for more accurate energy disaggregation, but the jury is still out on whether these techniques can actually save energy and, if so, whether higher accuracy translates into higher energy savings. In this paper, we explore both of these questions. First, we develop new techniques that use disaggregated power data to provide actionable feedback to residential users. We evaluate these techniques using power traces from 240 homes and find that they can detect homes that need feedback with as much as 84% accuracy. Second, we evaluate whether existing energy disaggregation techniques provide power traces with sufficient fidelity to support the feedback techniques that we created and whether more accurate disaggregation results translate into more energy savings for the users. Results show that feedback accuracy is very low even while disaggregation accuracy is high. These results indicate a need to revisit the metrics by which disaggregation is evaluated.
IMPLEMENTATION OF IMAGE PROCESSING ALGORITHMS ON THE PARALLEL PLATFORM USING MATLAB

Application with sequential algorithm can no longer rely on technology scaling to improve performance. Image processing applications exhibits high degree of parallelism and are excellent source for multicore platform. Major challenge of parallel processing is not only aim to high performance but is to give solution is less time and better utilization of resources. This paper focus on calculating the various parameters such as fork time, join time, serial time, parallel time, overheads. The results show that the leveraging of multicore platforms can speed up considerably the processing of images through the use of parallel computing tools in matlab. Image Processing; Parallelism; Performance Metrics
Interactive Data Integration through Smart Copy & Paste

In many scenarios, such as emergency response or ad hoc collaboration, it is critical to reduce the overhead in integrating data. Here, the goal is often to rapidly integrate “enough” data to answer a specific question. Ideally, one could perform the entire process interactively under one unified interface: defining extractors and wrappers for sources, creating a mediated schema, and adding schema mappings — while seeing how these impact the integrated view of the data, and refining the design accordingly. We propose a novel smart copy and paste (SCP) model and architecture for seamlessly combining the design-time and run-time aspects of data integration, and we describe an initial prototype, the CopyCat system. In CopyCat, the user does not need special tools for the different stages of integration: instead, the system watches as the user copies data from applications (including the Web browser) and pastes them into CopyCat’s spreadsheet-like workspace. CopyCat generalizes these actions and presents proposed auto-completions, each with an explanation in the form of provenance. The user provides feedback on these suggestions — through either direct interactions or further copy-and-paste operations — and the system learns from this feedback. This paper provides an overview of our prototype system, and identifies key research challenges in achieving SCP in its full generality.