nils-herrmann/clean_scirepeval huggingface dataset:
Theory II: Landscape of the Empirical Risk in Deep Learning

Previous theoretical work on deep learning and neural network optimization tend to focus on avoiding saddle points and local minima. However, the practical observation is that, at least for the most successful Deep Convolutional Neural Networks (DCNNs) for visual processing, practitioners can always increase the network size to fit the training data (an extreme example would be ). The most successful DCNNs such as VGG and ResNets are best used with a small degree of “overparametrization”. In this work, we characterize with a mix of theory and experiments, the landscape of the empirical risk of overparametrized DCNNs. We first prove the existence of a large number of degenerate global minimizers with zero empirical error (modulo inconsistent equations). The zero-minimizers – in the case of classification – have a non-zero margin. The same minimizers are degenerate and thus very likely to be found by SGD that will furthermore select with higher probability the zero-minimizer with larger margin, as discussed in Theory III (to be released). We further experimentally explored and visualized the landscape of empirical risk of a DCNN on CIFAR-10 during the entire training process and especially the global minima. Finally, based on our theoretical and experimental results, we propose an intuitive model of the landscape of DCNN’s empirical loss surface, which might not be as complicated as people commonly believe. This work was supported by the Center for Brains, Minds and Machines (CBMM), funded by NSF STC award CCF 1231216. 1 ar X iv :1 70 3. 09 83 3v 1 [ cs .L G ] 2 8 M ar 2 01 7
Power electronics' circuit topology - the basic switching cells

In this paper, two basic switching cells, P-cell and Ncell, are presented to investigate the topological nature of power electronics circuits. Both cells consist of a switching device and a diode and are the basic building blocks for almost all power electronics circuits. The mirror relationship of the P-cell and Ncell will be revealed. This paper describes the two basic switching cells and shows how all dc-dc converters, voltage source inverters, current source inverters, and multilevel converters are constituted from the two basic cells. Through these two basic cells, great insights about the topology of all power electronics circuits can be obtained for the construction and decomposition of existing power electronic circuits. New power conversion circuits can now be easily derived and invented.
Leader-member exchange and citizenship behaviors: a meta-analysis.

This article provides a meta-analytic review of the relationship between the quality of leader-member exchanges (LMX) and citizenship behaviors performed by employees. Results based on 50 independent samples (N = 9,324) indicate a moderately strong, positive relationship between LMX and citizenship behaviors (rho = .37). The results also support the moderating role of the target of the citizenship behaviors on the magnitude of the LMX-citizenship behavior relationship. As expected, LMX predicted individual-targeted behaviors more strongly than it predicted organizational targeted behaviors (rho = .38 vs. rho = .31), and the difference was statistically significant. Whether the LMX and the citizenship behavior ratings were provided by the same source or not also influenced the magnitude of the correlation between the 2 constructs.
Automatic Detection and Tracking of Pedestrians in Videos with Various Crowd Densities

Manual analysis of pedestrians and crowds is often impractical for massive datasets of surveillance videos. Automatic tracking of humans is one of the essential abilities for computerized analysis of such videos. In this keynote paper, we present two state of the art methods for automatic pedestrian tracking in videos with low and high crowd density. For videos with low density, first we detect each person using a part-based human detector. Then, we employ a global data association method based on Generalized Graphs for tracking each individual in the whole video. In videos with high crowd-density, we track individuals using a scene structured force model and crowd flow modeling. Additionally, we present an alternative approach which utilizes contextual information without the need to learn the structure of the scene. Performed evaluations show the presented methods outperform the currently available algorithms on several benchmarks.
Indoor inertial waypoint navigation for the blind

Indoor navigation technology is needed to support seamless mobility for the visually impaired. This paper describes the construction and evaluation of an inertial dead reckoning navigation system that provides real-time auditory guidance along mapped routes. Inertial dead reckoning is a navigation technique coupling step counting together with heading estimation to compute changes in position at each step. The research described here outlines the development and evaluation of a novel navigation system that utilizes information from the mapped route to limit the problematic error accumulation inherent in traditional dead reckoning approaches. The prototype system consists of a wireless inertial sensor unit, placed at the users' hip, which streams readings to a smartphone processing a navigation algorithm. Pilot human trials were conducted assessing system efficacy by studying route-following performance with blind and sighted subjects using the navigation system with real-time guidance, versus offline verbal directions.
Automatic Gender Identification for Hindi Speech Recognition

This paper presents the preliminary work done towards the development of a Gender Recognition System that can be incorporated into the Hindi Automatic Speech Recognition (ASR) System. Gender Recognition (GR) can help in the development of speaker-independent speech recognition systems. This paper presents a general approach to identifying feature vectors that effectively distinguish gender of a speaker from Hindi phoneme utterances. 10 vowels and 5 nasals of the Hindi language were studied for their effectiveness in identifying gender of the speaker. All the 10 vowel Phonemes performed well, while b] bZ] Å] ,] ,s] vks and vkS showed excellent gender distinction performance. All five nasals 3]  ́] .k] u and e which were tested, showed a recognition accuracy of almost 100%. The Mel Frequency Cepstral Coefficients (MFCC) are widely used in ASR. The choice of MFCC as features in Gender Recognition will avoid additional computation. The effect of the MFCC feature vector dimension on the GR accuracy was studied and the findings presented. General Terms Automatic speech recognition in Hindi
Empirically validated web page design metrics

A quantitative analysis of a large collection of expert-rated web sites reveals that page-level metrics can accurately predict if a site will be highly rated. The analysis also provides empirical evidence that important metrics, including page composition, page formatting, and overall page characteristics, differ among web site categories such as education, community, living, and finance. These results provide an empirical foundation for web site design guidelines and also suggest which metrics can be most important for evaluation via user studies.
Multi-view Response Selection for Human-Computer Conversation

In this paper, we study the task of response selection for multi-turn human-computer conversation. Previous approaches take word as a unit and view context and response as sequences of words. This kind of approaches do not explicitly take each utterance as a unit, therefore it is difficult to catch utterancelevel discourse information and dependencies. In this paper, we propose a multi-view response selection model that integrates information from two different views, i.e., word sequence view and utterance sequence view. We jointly model the two views via deep neural networks. Experimental results on a public corpus for context-sensitive response selection demonstrate the effectiveness of the proposed multi-view model, which significantly outperforms other single-view baselines.
Centrality Estimation in Large Networks

Centrality indices are an essential concept in network analysis. For those based on shortest-path distances the computation is at least quadratic in the number of nodes, since it usually involves solving the single-source shortest-paths (SSSP) problem from every node. Therefore, exact computation is infeasible for many large networks of interest today. Centrality scores can be estimated, however, from a limited number of SSSP computations. We present results from an experimental study of the quality of such estimates under various selection strategies for the source vertices. ∗Research supported in part by DFG under grant Br 2158/2-3
A novel evolutionary approach for load balanced clustering problem for wireless sensor networks

Clustering sensor nodes is an effective topology control method to reduce energy consumption of the sensor nodes for maximizing lifetime of Wireless Sensor Networks (WSNs). However, in a cluster based WSN, the leaders (cluster heads) bear some extra load for various activities such as data collection, data aggregation and communication of the aggregated data to the base station. Therefore, balancing the load of the cluster heads is a challenging issue for the long run operation of the WSNs. Load balanced clustering is known to be an NP-hard problem for a WSN with unequal load of the sensor nodes. Genetic Algorithm (GA) is one of the most popular evolutionary approach that can be applied for finding the fast and efficient solution of such problem. In this paper, we propose a novel GA based load balanced clustering algorithm for WSN. The proposed algorithm is shown to performwell for both equal as well as unequal load of the sensor nodes. We perform extensive simulation of the proposed method and compare the results with some evolutionary based approaches and other related clustering algorithms. The results demonstrate that the proposed algorithm performs better than all such algorithms in terms of various performance metrics such as load balancing, execution time, energy consumption, number of active sensor nodes, number of active cluster heads and the rate of convergence. & 2013 Elsevier B.V. All rights reserved.
Apparel Classification with Style

We introduce a complete pipeline for recognizing and classifying people’s clothing in natural scenes. This has several interesting applications, including e-commerce, event and activity recognition, online advertising, etc. The stages of the pipeline combine a number of state-of-the-art building blocks such as upper body detectors, various feature channels and visual attributes. The core of our method consists of a multi-class learner based on a Random Forest that uses strong discriminative learners as decision nodes. To make the pipeline as automatic as possible we also integrate automatically crawled training data from the web in the learning process. Typically, multi-class learning benefits from more labeled data. Because the crawled data may be noisy and contain images unrelated to our task, we extend Random Forests to be capable of transfer learning from different domains. For evaluation, we define 15 clothing classes and introduce a benchmark data set for the clothing classification task consisting of over 80, 000 images, which we make publicly available. We report experimental results, where our classifier outperforms an SVM baseline with 41.38 % vs 35.07 % average accuracy on challenging benchmark data.
Machine Comprehension using Rich Semantic Representations

Machine comprehension tests the system’s ability to understand a piece of text through a reading comprehension task. For this task, we propose an approach using the Abstract Meaning Representation (AMR) formalism. We construct meaning representation graphs for the given text and for each question-answer pair by merging the AMRs of comprising sentences using cross-sentential phenomena such as coreference and rhetorical structures. Then, we reduce machine comprehension to a graph containment problem. We posit that there is a latent mapping of the question-answer meaning representation graph onto the text meaning representation graph that explains the answer. We present a unified max-margin framework that learns to find this mapping (given a corpus of texts and question-answer pairs), and uses what it learns to answer questions on novel texts. We show that this approach leads to state of the art results on the task.
Using Ontologies in the Semantic Web: A Survey

The Semantic Web is well recognized as an effective infrastructure to enhance visibility of knowledge on the Web. The core of the Semantic Web is “ontology”, which is used to explicitly represent our conceptualizations. Ontology engineering in the Semantic Web is primarily supported by languages such as RDF, RDFS and OWL. This chapter discusses the requirements of ontology in the context of the Web, compares the above three languages with existing knowledge representation formalisms, and surveys tools for managing and applying ontology. Advantages of using ontology in both knowledge-base-style and database-style applications are demonstrated using three real world applications.
A Motion-Tolerant Adaptive Algorithm for Wearable Photoplethysmographic Biosensors

The performance of portable and wearable biosensors is highly influenced by motion artifact. In this paper, a novel real-time adaptive algorithm is proposed for accurate motion-tolerant extraction of heart rate (HR) and pulse oximeter oxygen saturation (SpO2) from wearable photoplethysmographic (PPG) biosensors. The proposed algorithm removes motion artifact due to various sources including tissue effect and venous blood changes during body movements and provides noise-free PPG waveforms for further feature extraction. A two-stage normalized least mean square adaptive noise canceler is designed and validated using a novel synthetic reference signal at each stage. Evaluation of the proposed algorithm is done by Bland-Altman agreement and correlation analyses against reference HR from commercial ECG and SpO2 sensors during standing, walking, and running at different conditions for a single- and multisubject scenarios. Experimental results indicate high agreement and high correlation (more than 0.98 for HR and 0.7 for SpO2 extraction) between measurements by reference sensors and our algorithm.
Classification With a Non-Gaussian Model for PolSAR Data

In this paper, we present a generalized Wishart classifier derived from a non-Gaussian model for polarimetric synthetic aperture radar (PolSAR) data. Our starting point is to demonstrate that the scale mixture of Gaussian (SMoG) distribution model is suitable for modeling PolSAR data. We show that the distribution of the sample covariance matrix for the SMoG model is given as a generalization of the Wishart distribution and present this expression in integral form. We then derive the closed-form solution for one particular SMoG distribution, which is known as the multivariate K-distribution. Based on this new distribution for the sample covariance matrix, termed as the K -Wishart distribution, we propose a Bayesian classification scheme, which can be used in both supervised and unsupervised modes. To demonstrate the effect of including non-Gaussianity, we present a detailed comparison with the standard Wishart classifier using airborne EMISAR data.
Operational profiles in software-reliability engineering

A systematic approach to organizing the process of determining the operational profile for guiding software development is presented. The operational profile is a quantitative characterization of how a system will be used that shows how to increase productivity and reliability and speed development by allocating development resources to function on the basis of use. Using an operational profile to guide testing ensures that if testing is terminated and the software is shipped because of schedule constraints, the most-used operations will have received the most testing and the reliability level will be the maximum that is practically achievable for the given test time. For guiding regression testing, it efficiently allocates test cases in accordance with use, so the faults most likely to be found, of those introduced by changes, are the ones that have the most effect on reliability.<<ETX>>
Comparing Ubisense, BeSpoon, and DecaWave UWB Location Systems: Indoor Performance Analysis

Most ultrawideband (UWB) location systems already proposed for position estimation have only been individually evaluated for particular scenarios. For a fair performance comparison among different solutions, a common evaluation scenario would be desirable. In this paper, we compare three commercially available UWB systems (Ubisense, BeSpoon, and DecaWave) under the same experimental conditions, in order to do a critical performance analysis. We include the characterization of the quality of the estimated tag-to-sensor distances in an indoor industrial environment. This testing space includes areas under line-of-sight (LOS) and diverse non-LOS conditions caused by the reflection, propagation, and the diffraction of the UWB radio signals across different obstacles. The study also includes the analysis of the estimated azimuth and elevation angles for the Ubisense system, which is the only one that incorporates this feature using an array antenna at each sensor. Finally, we analyze the 3-D positioning estimation performance of the three UWB systems using a Bayesian filter implemented with a particle filter and a measurement model that takes into account bad range measurements and outliers. A final conclusion is drawn about which system performs better under these industrial conditions.
Third-Person Imitation Learning

Reinforcement learning (RL) makes it possible to train agents capable of achieving sophisticated goals in complex and uncertain environments. A key difficulty in reinforcement learning is specifying a reward function for the agent to optimize. Traditionally, imitation learning in RL has been used to overcome this problem. Unfortunately, hitherto imitation learning methods tend to require that demonstrations are supplied in the first-person: the agent is provided with a sequence of states and a specification of the actions that it should have taken. While powerful, this kind of imitation learning is limited by the relatively hard problem of collecting first-person demonstrations. Humans address this problem by learning from third-person demonstrations: they observe other humans perform tasks, infer the task, and accomplish the same task themselves. In this paper, we present a method for unsupervised third-person imitation learning. Here third-person refers to training an agent to correctly achieve a simple goal in a simple environment when it is provided a demonstration of a teacher achieving the same goal but from a different viewpoint; and unsupervised refers to the fact that the agent receives only these third-person demonstrations, and is not provided a correspondence between teacher states and student states. Our methods primary insight is that recent advances from domain confusion can be utilized to yield domain agnostic features which are crucial during the training process. To validate our approach, we report successful experiments on learning from third-person demonstrations in a pointmass domain, a reacher domain, and inverted pendulum.
Secondary Wireless Mesh Network Design Using Leased Frequency Spectra

This paper considers the design of secondary wireless mesh networks which use leased frequency channels. In a given geographic region, the available channels are individually priced and leased exclusively through a primary spectrum owner. The usage of each channel is also subject to published interference constraints so that the primary user is not adversely affected. When the network is designed and deployed, the secondary user would like to minimize the costs of using the required resources while satisfying its own traffic and interference requirements. This problem is formulated as a mixed integer optimization which gives the optimum deployment cost as a function of the secondary node positioning, routing, and frequency allocations. Because of the problem's complexity, the optimum result can only be found for small problem sizes. To accommodate more practical deployments, two algorithms are proposed and their performance is compared to solutions obtained from the optimization. The first algorithm is a greedy flow-based scheme (GFB) which iterates over the individual node flows based on solving a much simpler optimization at each step. The second algorithm (ILS) uses an iterated local search whose initial solution is based on constrained shortest path routing. Our results show that the proposed algorithms perform well for a variety of network scenarios.
Integrating paper and digital information on EnhancedDesk: a method for realtime finger tracking on an augmented desk system

This article describes a design and implementation of an augmented desk system, named EnhancedDesk, which smoothly integrates paper and digital information on a desk. The system provides users an intelligent environment that automatically retrieves and displays digital information corresponding to the real objects (e.g., books) on the desk by using computer vision. The system also provides users direct manipulation of digital information by using the users' own hands and fingers for more natural and more intuitive interaction. Based on the experiments with our first prototype system, some critical issues on augmented desk systems were identified when trying to pursue rapid and fine recognition of hands and fingers. To overcome these issues, we developed a novel method for realtime finger tracking on an augmented desk system by introducing a infrared camera, pattern matching with normalized correlation, and a pan-tilt camera. We then show an interface prototype on EnhancedDesk. It is an application to a computer-supported learning environment, named Interactive Textbook. The system shows how effective the integration of paper and digital information is and how natural and intuitive direct manipulation of digital information with users' hands and fingers is.
Position and force control of a robotic finger with twisted strings actuation

Actuation and control of robotic hands is one of the difficult problems in mechatronics that still needs to be solved. In this paper we present a kinematic analysis of a robotic finger that is actuated by twisted strings mechanism, which we named Twist Drive. The principle of actuation is briefly described in the paper and a structure of the developed robotic finger is presented. Forward kinematics for a finger with nonlinearly coupled joints is given. The obtained Jacobian is used in position control and in force control on the finger's tip. Experimental results are presented. Force control in two directions is successfully demonstrated.
Enhanced intercell interference coordination challenges in heterogeneous networks

3GPP LTE-Advanced has recently been investigating heterogeneous network (HetNet) deployments as a cost effective way to deal with the unrelenting traffic demand. HetNets consist of a mix of macrocells, remote radio heads, and low-power nodes such as picocells, femtocells, and relays. Leveraging network topology, increasing the proximity between the access network and the end users, has the potential to provide the next significant performance leap in wireless networks, improving spatial spectrum reuse and enhancing indoor coverage. Nevertheless, deployment of a large number of small cells overlaying the macrocells is not without new technical challenges. In this article, we present the concept of heterogeneous networks and also describe the major technical challenges associated with such network architecture. We focus in particular on the standardization activities within the 3GPP related to enhanced intercell interference coordination.