nils-herrmann/clean_scirepeval huggingface dataset:
Few-Shot Image Recognition by Predicting Parameters from Activations

In this paper, we are interested in the few-shot learning problem. In particular, we focus on a challenging scenario where the number of categories is large and the number of examples per novel category is very limited, e.g. 1, 2, or 3. Motivated by the close relationship between the parameters and the activations in a neural network associated with the same category, we propose a novel method that can adapt a pre-trained neural network to novel categories by directly predicting the parameters from the activations. Zero training is required in adaptation to novel categories, and fast inference is realized by a single forward pass. We evaluate our method by doing few-shot image recognition on the ImageNet dataset, which achieves the state-of-the-art classification accuracy on novel categories by a significant margin while keeping comparable performance on the large-scale categories. We also test our method on the MiniImageNet dataset and it strongly outperforms the previous state-of-the-art methods.
Practical Variational Inference for Neural Networks

Variational methods have been previously explored as a tractable approximation to Bayesian inference for neural networks. However the approaches proposed so far have only been applicable to a few simple network architectures. This paper introduces an easy-to-implement stochastic variational method (or equivalently, minimum description length loss function) that can be applied to most neural networks. Along the way it revisits several common regularisers from a variational perspective. It also provides a simple pruning heuristic that can both drastically reduce the number of network weights and lead to improved generalisation. Experimental results are provided for a hierarchical multidimensional recurrent neural network applied to the TIMIT speech corpus.
NAWMS: nonintrusive autonomous water monitoring system

Water is nature's most precious resource and growing demand is pushing fresh water supplies to the brink of non-renewability. New technological and social initiatives that enhance conservation and reduce waste are needed. Providing consumers with fine-grained real-time information has yielded benefits in conservation of power and gasoline. Extending this philosophy to water conservation, we introduce a novel water monitoring system, NAWMS, that similarly empowers users.
 The goal of our work is to furnish users with an easy-to-install self-calibrating system that provides information on when, where, and how much water they are using. The system uses wireless vibration sensors attached to pipes and, thus, neither plumbing nor special expertise is necessary for its installation. By implementing a non-intrusive, autonomous, and adaptive system using commodity hardware, we believe it is cost-effective and widely deployable.
 NAWMS makes use of the existing household water flow meter, which is considered accurate, but lacks spatial granularity, and adds vibration sensors on individual water pipes to estimate the water flow to each individual outlet. Compensating for manufacturing, installation, and material variabilities requires calibration of these low cost sensors to achieve a reasonable level of accuracy. We have devised an adaptive auto-calibration procedure, which attempts to solve a two phase linear programming and mixed linear geometric programming problem.
 We show through experiments on a three pipe testbed that such a system is indeed feasible and adapts well to minimize error in the water usage estimate. We report an accuracy, over likely domestic flow-rate scenarios, with long-term stability and a mean absolute error of 7%.
Understanding and Controlling User Linkability in Decentralized Learning

Machine Learning techniques are widely used by online services (e.g. Google, Apple) in order to analyze andmake predictions on user data. Asmany of the provided services are user-centric (e.g. personal photo collections, speech recognition, personal assistance), user data generated on personal devices is key to provide the service. In order to protect the data and the privacy of the user, federated learning techniques have been proposed where the data never leaves the user’s device and “only” model updates are communicated back to the server. In our work, we propose a new threat model that is not concerned with learning about the content but rather is concerned with the linkability of users during such decentralized learning scenarios. We show that model updates are characteristic for users and therefore lend themselves to linkability attacks. We show identification and matching of users across devices in closed and open world scenarios. In our experiments, we find our attacks to be highly effective, achieving 20×-175× chance-level performance. In order to mitigate the risks of linkability attacks, we study various strategies. As adding random noise does not offer convincing operation points, we propose strategies based on using calibrated domain-specific data; we find these strategies offers substantial protection against linkability threats with little effect to utility.
On the Usefulness of Fibonacci Compression Codes

Recent publications advocate the use of various variable length codes for which each codeword consists of an integral number of bytes in compression applications using large alphabets. This paper shows that another tradeoff with similar properties can be obtained by Fibonacci codes. These are fixed codeword sets, using binary representations of integers based on Fibonacci numbers of order m ≥ 2. Fibonacci codes have been used before, and this paper extends previous work presenting several novel features. In particular, the compression efficiency is analyzed and compared to that of dense codes, and various table-driven decoding routines are suggested.
Efficient invariant interest point detector using Bilateral-Harris corner detector for object recognition application

Interest point detection plays a significant role in computer vision applications. The most commonly used interest point detector algorithm is scale invariant feature transform (SIFT). The use of Gaussian filter in the SIFT algorithm fails to match interest points on the edge and it also causes blur annoyance in the rescaling process. To overcome this failure Bilateral-Harris Corner Detector (BHCD) has been proposed in this paper. In the proposed BHCD, a Bilateral filter preserves edges by smoothening and removing noise in an image. Accuracy in localization of interest points are improved by using the proposed dynamic blur metric calculation. The Harris corner has been added to get stable and reliable interest point detection. The proposed BHCD has been simulated for the evaluation criteria such as repeatability and matching score. Extensive experimental results show that the proposed method is more robust to illumination, scaling, rotation, compression and viewpoint changes. The experimental evaluation for BHCD has been carried for the object recognition benchmark datasets COIL-100, ZuBud, Caltech-101. The proposed BHCD achieves highest recognition rate compared to the other state-of-the-art methods.
Fatal dog attacks in Canada, 1990-2007.

In Canada, public debates on dog attacks are dominated by studies from the United States. An electronic search of media reports in the Canadian Newsstand database, for the years 1990 to 2007, identified 28 fatalities from dog-bite injuries. Predominant factors in this case series were owned, known dogs; residential location; children's unsupervised access to area with dogs; and rural/remote areas, including aboriginal reserves in the prairies. A higher proportion of sled dogs and, possibly, mixed-breed dogs in Canada than in the United States caused fatalities, as did multiple dogs rather than single dogs. Free-roaming dog packs, reported only from rural communities, caused most on-reserve fatalities. Future studies are needed to assess if this rural/urban divide is observed in nonfatal attacks and if the breeds that bite in Canada are different from the breeds that killed. Breed representation in this paper and, perhaps, multiple-dog overrepresentation should be understood in the context of the overall Canadian dog population.
Anatomisation with slicing: a new privacy preservation approach for multiple sensitive attributes

An enormous quantity of personal health information is available in recent decades and tampering of any part of this information imposes a great risk to the health care field. Existing anonymization methods are only apt for single sensitive and low dimensional data to keep up with privacy specifically like generalization and bucketization. In this paper, an anonymization technique is proposed that is a combination of the benefits of anatomization, and enhanced slicing approach adhering to the principle of k-anonymity and l-diversity for the purpose of dealing with high dimensional data along with multiple sensitive data. The anatomization approach dissociates the correlation observed between the quasi identifier attributes and sensitive attributes (SA) and yields two separate tables with non-overlapping attributes. In the enhanced slicing algorithm, vertical partitioning does the grouping of the correlated SA in ST together and thereby minimizes the dimensionality by employing the advanced clustering algorithm. In order to get the optimal size of buckets, tuple partitioning is conducted by MFA. The experimental outcomes indicate that the proposed method can preserve privacy of data with numerous SA. The anatomization approach minimizes the loss of information and slicing algorithm helps in the preservation of correlation and utility which in turn results in reducing the data dimensionality and information loss. The advanced clustering algorithms prove its efficiency by minimizing the time and complexity. Furthermore, this work sticks to the principle of k-anonymity, l-diversity and thus avoids privacy threats like membership, identity and attributes disclosure.
Performance of LoRa-Based IoT Applications on Campus

To promote smart campus, National Chiao Tung University is deploying several location-based IoT applications based on wireless communications technologies including LoRa and NB-IoT. The applications are indoor/outdoor environment conditions monitoring (such as PM2.5, temperature, and humidity), emergency buttons, and so on. This paper uses PM2.5 measurement application as an example to present the performance of LoRa when it is used on campus. We investigated the LoRa transmission performance from LoRa end-devices to the LoRa gateway. We show how packet losses were affected by the distance between the end-device and the gateway, the transmit power, the payload length, the antenna angle, the time of day, and the weather conditions. The pattern of LoRa packet losses were also measured and we found that in our long-term PM2.5 monitoring application, more than 99\% of LoRa packet losses occurred with three or less consecutive packet losses.
Centralities in Large Networks: Algorithms and Observations

Node centrality measures are important in a large number of graph applications, from search and ranking to social and biological network analysis. In this paper we study node centrality for very large graphs, up to billions of nodes and edges. Various definitions for centrality have been proposed, ranging from very simple (e.g., node degree) to more elaborate. However, measuring centrality in billion-scale graphs poses several challenges. Many of the “traditional” definitions such as closeness and betweenness were not designed with scalability in mind. Therefore, it is very difficult, if not impossible, to compute them both accurately and efficiently. In this paper, we propose centrality measures suitable for very large graphs, as well as scalable methods to effectively compute them. More specifically, we propose effective closeness and LINERANK which are designed for billion-scale graphs. We also develop algorithms to compute the proposed centrality measures in MAPREDUCE, a modern paradigm for large-scale, distributed data processing. We present extensive experimental results on both synthetic and real datasets, which demonstrate the scalability of our approach to very large graphs, as well as interesting findings and anomalies.
Small Discrete Fourier Transforms on GPUs

Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data sizes. On the other hand, several applications perform multiple DFTs on small data sizes. In fact, even algorithms for large data sizes use a divide-and-conquer approach, where eventually small DFTs need to be performed. We discuss our DFT implementation, which is efficient for multiple small DFTs. One feature of our implementation is the use of the asymptotically slow matrix multiplication approach for small data sizes, which improves performance on the GPU due to its regular memory access and computational patterns. We combine this algorithm with the mixed radix algorithm for 1-D, 2-D, and 3-D complex DFTs. We also demonstrate the effect of different optimization techniques. When GPUs are used to accelerate a component of an application running on the host, it is important that decisions taken to optimize the GPU performance not affect the performance of the rest of the application on the host. One feature of our implementation is that we use a data layout that is not optimal for the GPU so that the overall effect on the application is better. Our implementation performs up to two orders of magnitude faster than cuFFT on an NVIDIA GeForce 9800 GTX GPU and up to one to two orders of magnitude faster than FFTW on a CPU for multiple small DFTs. Furthermore, we show that our implementation can accelerate the performance of a Quantum Monte Carlo application for which cuFFT is not effective. The primary contributions of this work lie in demonstrating the utility of the matrix multiplication approach and also in providing an implementation that is efficient for small DFTs when a GPU is used to accelerate an application running on the host.
Adding noise to the input of a model trained with a regularized objective

Regularization is a well studied problem in the context of neural networks. It is usually used to improve the generalization performance when the number of input samples is relatively small or heavily contaminated with noise. The regularization of a parametric model can be achieved in different manners some of which are early stopping (Morgan and Bourlard, 1990), weight decay, output smoothing that are used to avoid overfitting during the training of the considered model. From a Bayesian point of view, many regularization techniques correspond to imposing certain prior distributions on model parameters (Krogh and Hertz, 1991). Using Bishop’s approximation (Bishop, 1995) of the objective function when a restricted type of noise is added to the input of a parametric function, we derive the higher order terms of the Taylor expansion and analyze the coefficients of the regularization terms induced by the noisy input. In particular we study the effect of penalizing the Hessian of the mapping function with respect to the input in terms of generalization performance. We also show how we can control independently this coefficient by explicitly penalizing the Jacobian of the mapping function on corrupted inputs.
A Spectral Learning Approach to Knowledge Tracing

Bayesian Knowledge Tracing (BKT) is a common way of determining student knowledge of skills in adaptive educational systems and cognitive tutors. The basic BKT is a Hidden Markov Model (HMM) that models student knowledge based on five parameters: prior, learn rate, forget, guess, and slip.  Maximization (EM) is often used to learn these parameters from training data. However, EM is a time-consuming process, and is prone to converging to erroneous, implausible local optima depending on the initial values of the BKT parameters. In this paper we address these two problems by using spectral learning to learn a Predictive State Representation (PSR) that represents the BKT HMM. We then use a heuristic to extract the BKT parameters from the learned PSR using basic matrix operations. The spectral learning method is based on an approximate factorization of the estimated covariance of windows from students’ sequences of correct and incorrect responses; it is fast, local-optimum-free, and statistically consistent. In the past few years, spectral techniques have been used on real-world problems involving latent variables in dynamical systems, computer vision, and natural language processing. Our results suggest that the parameters learned by the spectral algorithm can replace the parameters learned by EM; the results of our study show that the spectral algorithm can improve knowledge tracing parameterfitting time significantly while maintaining the same prediction accuracy, or help to improve accuracy while still keeping parameter-fitting time equivalent to EM.
Simulation Model Verification and Validation: Increasing the Users' Confidence

This paper sets simulation model verification and validation (V&V) in the context of the process of performing a simulation study. Various different forms of V&V need to take place depending on the stage that has been reached. Since the phases of a study are performed in an iterative manner, so too are the various forms of V&V. A number of difficulties with verifying and validating models are discussed, after which a series of V&V methods are described. V&V is seen as a process of increasing confidence in a model, and not one of demonstrating absolute accuracy.
On Persistence in Mutual Fund Performance

Using a sample free of survivor bias, I demonstrate that common factors in stock returns and investment expenses almost completely explain persistence in equity mutual funds' mean and risk-adjusted returns. Hendricks, Patel and Zeckhauser's (1993) "hot hands" result is mostly driven by the one-year momentum effect of Jegadeesh and Titman (1993), but individual funds do not earn higher returns from following the momentum strategy in stocks. The only significant persistence not explained is concentrated in strong underperformance by the worst-return mutual funds. The results do not support the existence of skilled or informed mutual fund portfolio managers. PERSISTENCE IN MUTUAL FUND performance does not reflect superior stock-picking skill. Rather, common factors in stock returns and persistent differences in mutual fund expenses and transaction costs explain almost all of the predictability in mutual fund returns. Only the strong, persistent underperformance by the worst-return mutual funds remains anomalous. Mutual fund persistence is well documented in the finance literature, but not well explained. Hendricks, Patel, and Zeckhauser (1993), Goetzmann and Ibbotson (1994), Brown and Goetzmann (1995), and Wermers (1996) find evidence of persistence in mutual fund performance over short-term horizons of one to three years, and attribute the persistence to "hot hands" or common investment strategies. Grinblatt and Titman (1992), Elton, Gruber, Das, and Hlavka (1993), and Elton, Gruber, Das, and Blake (1996) document mutual fund return predictability over longer horizons of five to ten years, and attribute this to manager differential information or stock-picking talent. Contrary evidence comes from Jensen (1969), who does not find that good subsequent performance follows good past performance. Carhart (1992) shows that persistence in expense ratios drives much of the long-term persistence in mutual fund performance. My analysis indicates that Jegadeesh and Titman's (1993) one-year momentum in stock returns accounts for Hendricks, Patel, and Zeckhauser's (1993) hot hands effect in mutual fund performance. However, funds that earn higher * School of Business Administration, University of Southern California. I have benefited from helpful conversations with countless colleagues and participants at various workshops and seminars. I express particular thanks to Gene Fama, my dissertation committee chairman. I am also grateful to Gene Fama, the Oscar Mayer Fellowship, and the Dimensional Fund Advisors Fellowship for financial support. I thank Cliff Asness, Gene Fama, Ken French, and Russ Wermers for generously providing data. Finally, I thank Bill Crawford, Jr., Bill Crawford, Sr., and ICDI/ Micropal for access to, and assistance with, their database.
Wireless Body Sensor Network With Adaptive Low-Power Design for Biometrics and Healthcare Applications

A four-levels hierarchical wireless body sensor network (WBSN) system is designed for biometrics and healthcare applications. It also separates pathways for communication and control. In order to improve performance, a communication cycle is constructed for synchronizing the WBSN system with the pipeline. A low-power adaptive process is a necessity for long-time healthcare monitoring. It includes a data encoder and an adaptive power conserving algorithm within each sensor node along with an accurate control switch system for adaptive power control. The thermal sensor node consists of a micro control unit (MCU), a thermal bipolar junction transistor sensor, an analog-to-digital converter (ADC), a calibrator, a data encoder, a 2.4-GHz radio frequency transceiver, and an antenna. When detecting ten body temperature or 240 electrocardiogram (ECG) signals per second, the power consumption is either 106.3 ¿W or 220.4 ¿W. By switching circuits, multi sharing wireless protocol, and reducing transmission data by data encoder, it achieves a reduction of 99.573% or 99.164% in power consumption compared to those without using adaptive and encoding modules. Compared with published research reports and industrial works, the proposed method is 69.6% or 98% lower than the power consumption in thermal sensor nodes which consist only of a sensor and ADC (without MCU, 2.4-GHz transceiver, modulator, demodulator, and data encoder) or wireless ECG sensor nodes which selected Bluetooth, 2.4-GHz transceiver, and Zigbee as wireless protocols.
How do self-interest and other-need interact in the brain to determine altruistic behavior?

Altruistic behavior, i.e., promoting the welfare of others at a cost to oneself, is subserved by the integration of various social, affective, and economic factors represented in extensive brain regions. However, it is unclear how different regions interact to process/integrate information regarding the helper's interest and recipient's need when deciding whether to behave altruistically. Here we combined an interactive game with functional Magnetic Resonance Imaging (fMRI) and transcranial direct current stimulation (tDCS) to characterize the neural network underlying the processing/integration of self-interest and other-need. At the behavioral level, high self-risk decreased helping behavior and high other-need increased helping behavior. At the neural level, activity in medial prefrontal cortex (MPFC) and right dorsolateral prefrontal cortex (rDLPFC) were positively associated with self-risk levels, and activity in right inferior parietal lobe (rIPL) and rDLPFC were negatively associated with other-need levels. Dynamic causal modeling further suggested that both MPFC and rIPL were extrinsically connected to rDLPFC; high self-risk enhanced the effective connectivity from MPFC to rDLPFC, and the modulatory effect of other-need on the connectivity from rIPL to rDLPFC positively correlated with the modulatory effect of other-need on individuals' helping rate. Two tDCS experiments provided causal evidence that rDLPFC affects both self-interest and other-need concerns, and rIPL selectively affects the other-need concerns. These findings suggest a crucial role of the MPFC-IPL-DLPFC network during altruistic decision-making, with rDLPFC as a central node for integrating and modulating motives regarding self-interest and other-need.