nils-herrmann/clean_scirepeval huggingface dataset:
The Uses of Big Data in Cities.

There is much enthusiasm currently about the possibilities created by new and more extensive sources of data to better understand and manage cities. Here, I explore how big data can be useful in urban planning by formalizing the planning process as a general computational problem. I show that, under general conditions, new sources of data coordinated with urban policy can be applied following fundamental principles of engineering to achieve new solutions to important age-old urban problems. I also show that comprehensive urban planning is computationally intractable (i.e., practically impossible) in large cities, regardless of the amounts of data available. This dilemma between the need for planning and coordination and its impossibility in detail is resolved by the recognition that cities are first and foremost self-organizing social networks embedded in space and enabled by urban infrastructure and services. As such, the primary role of big data in cities is to facilitate information flows and mechanisms of learning and coordination by heterogeneous individuals. However, processes of self-organization in cities, as well as of service improvement and expansion, must rely on general principles that enforce necessary conditions for cities to operate and evolve. Such ideas are the core of a developing scientific theory of cities, which is itself enabled by the growing availability of quantitative data on thousands of cities worldwide, across different geographies and levels of development. These three uses of data and information technologies in cities constitute then the necessary pillars for more successful urban policy and management that encourages, and does not stifle, the fundamental role of cities as engines of development and innovation in human societies.
3D strip meander delay line structure for multilayer LTCC-based SiP applications

Recently, the timing control of high-frequency signals is strongly demanded due to the high integration density in three-dimensional (3D) LTCC-based SiP applications. Therefore, to control the skew or timing delay, new 3D delay lines will be proposed. For frailty of the signal via, we adopt the concept of coaxial line and proposed an advanced signal via structure with quasi coaxial ground (QCOX-GND) vias. We will show the simulated results using EM and circuit simulator.
Emotional design in multimedia learning : Effects of shape and color on affect and learning

We examine design factors that may evoke positive emotions in learners and investigate the effects of these positive emotions on learning. Recent research showed that the emotional design of multimedia learning material can inducepositiveemotions in learners that in turn facilitate comprehensionand transfer.We sought to replicate these results with a different population and different mood induction procedure and examine individual emotions, and to decompose the effects of the design elements of color and shape. Study 1 showed that well-designed materials induced positive emotions and facilitated comprehension, though transfer performance was not affected by emotional design. Study 2 found that round face-like shapes both alone and in conjunctionwithwarm color induced positive emotions.Warm colors alone, however, did not affect learners’ emotions. Comprehensionwas facilitated bywarmcolors and round face-like shapes, independentlyaswell as together. Transfer was facilitated by round face-like shapes when used with neutral colors.
Downlink Channel Estimation in Multiuser Massive MIMO With Hidden Markovian Sparsity

Recently, compressive sensing based massive multiple input multiple output (MIMO) channel estimation (CE) has attracted intensive research interest. By exploiting the structured sparsity of massive MIMO channels, it is possible to design structured sparse channel estimation (SSCE) algorithms to significantly reduce the pilot/feedback overheads in massive MIMO downlink CE. However, most existing SSCE algorithms are designed based on oversimplified channel models with restrictive assumptions, and thus perform poorly under realistic channels. In this paper, we propose a Hidden-Markov-Model (HMM) to capture the structured sparsity of multiuser massive MIMO channels. The HMM has the flexibility to model different propagation environments that occur in practice. We derive an efficient approximate message passing algorithm called Turbo-orthogonal approximate message passing (OAMP) to solve the resulting sparse CE problem with an HMM prior. The proposed Turbo-OAMP does not require knowledge of the HMM channel parameters, which is automatically learned based on the expectation maximization framework. As a result, the proposed Turbo-OAMP algorithm derived from the HMM works well for realistic channels with complicated propagation environments and unknown channel parameters. Extensive simulations verify that the proposed Turbo-OAMP can achieve significant gains over the existing SSCE algorithms under realistic channels.
CIM: Community-Based Influence Maximization in Social Networks

Given a social graph, the problem of influence maximization is to determine a set of nodes that maximizes the spread of influences. While some recent research has studied the problem of influence maximization, these works are generally too time consuming for practical use in a large-scale social network. In this article, we develop a new framework, community-based influence maximization (CIM), to tackle the influence maximization problem with an emphasis on the time efficiency issue. Our proposed framework, CIM, comprises three phases: (i) community detection, (ii) candidate generation, and (iii) seed selection. Specifically, phase (i) discovers the community structure of the network; phase (ii) uses the information of communities to narrow down the possible seed candidates; and phase (iii) finalizes the seed nodes from the candidate set. By exploiting the properties of the community structures, we are able to avoid overlapped information and thus efficiently select the number of seeds to maximize information spreads. The experimental results on both synthetic and real datasets show that the proposed CIM algorithm significantly outperforms the state-of-the-art algorithms in terms of efficiency and scalability, with almost no compromise of effectiveness.
The Visual Analysis of Human Movement: A Survey

The ability to recognize humans and their activities by vision is key for a machine to interact intelligently and effortlessly with a human-inhabited environment. Because of many potentially important applications, “looking at people” is currently one of the most active application domains in computer vision. This survey identifies a number of promising applications and provides an overview of recent developments in this domain. The scope of this survey is limited to work on whole-body or hand motion; it does not include work on human faces. The emphasis is on discussing the various methodologies; they are grouped in 2-D approaches with or without explicit shape models and 3-D approaches. Where appropriate, systems are reviewed. We conclude with some thoughts about future directions.
Gradient clock synchronization in wireless sensor networks

Accurately synchronized clocks are crucial for many applications in sensor networks. Existing time synchronization algorithms provide on average good synchronization between arbitrary nodes, however, as we show in this paper, close-by nodes in a network may be synchronized poorly. We propose the Gradient Time Synchronization Protocol (GTSP) which is designed to provide accurately synchronized clocks between neighbors. GTSP works in a completely decentralized fashion: Every node periodically broadcasts its time information. Synchronization messages received from direct neighbors are used to calibrate the logical clock. The algorithm requires neither a tree topology nor a reference node, which makes it robust against link and node failures. The protocol is implemented on the Mica2 platform using TinyOS. We present an evaluation of GTSP on a 20-node testbed setup and simulations on larger network topologies.
A study of age and gender seen through mobile phone usage patterns in Mexico

Mobile phone usage provides a wealth of information, which can be used to better understand the demographic structure of a population. In this paper we focus on the population of Mexican mobile phone users. Our first contribution is an observational study of mobile phone usage according to gender and age groups. We were able to detect significant differences in phone usage among different subgroups of the population. Our second contribution is to provide a novel methodology to predict demographic features (namely age and gender) of unlabeled users by leveraging individual calling patterns, as well as the structure of the communication graph. We provide details of the methodology and show experimental results on a real world dataset that involves millions of users.
Plot Induction and Evolutionary Search for Story Generation

In this paper we develop a story generator that leverages knowledge inherent in corpora without requiring extensive manual involvement. A key feature in our approach is the reliance on a story planner which we acquire automatically by recording events, their participants, and their precedence relationships in a training corpus. Contrary to previous work our system does not follow a generate-and-rank architecture. Instead, we employ evolutionary search techniques to explore the space of possible stories which we argue are well suited to the story generation task. Experiments on generating simple children’s stories show that our system outperforms previous data-driven approaches.
DETRAC: A New Benchmark and Protocol for Multi-Object Tracking

In recent years, most effective multi-object tracking (MOT) methods are based on the tracking-by-detection framework. Existing performance evaluations of MOT methods usually separate the target association step from the object detection step by using the same object detection results for comparisons. In this work, we perform a comprehensive quantitative study on the effect of object detection accuracy to the overall MOT performance. This is based on a new large-scale DETection and tRACking (DETRAC) benchmark dataset. The DETRAC benchmark dataset consists of 100 challenging video sequences captured from real-world traffic scenes (over 140 thousand frames and 1.2 million labeled bounding boxes of objects) for both object detection and MOT. We evaluate complete MOT systems constructed from combinations of state-of-the-art target association methods and object detection schemes. Our analysis shows the complex effects of object detection accuracy on MOT performance. Based on these observations, we propose new evaluation tools and metrics for MOT systems that consider both object detection and target association for comprehensive analysis.
Self-supervised Relation Extraction from the Web

Web extraction systems attempt to use the immense amount of unlabeled text in the Web in order to create large lists of entities and relations. Unlike traditional Information Extraction methods, the Web extraction systems do not label every mention of the target entity or relation, instead focusing on extracting as many different instances as possible while keeping the precision of the resulting list reasonably high. SRES is a self-supervised Web relation extraction system that learns powerful extraction patterns from unlabeled text, using short descriptions of the target relations and their attributes. SRES automatically generates the training data needed for its pattern-learning component. The performance of SRES is further enhanced by classifying its output instances using the properties of the instances and the patterns. The features we use for classification and the trained classification model are independent from the target relation, which we demonstrate in a series of experiments. We also compare the performance of SRES to the performance of the state-of-the-art KnowItAll system, and to the performance of its pattern learning component, which learns simpler pattern language than SRES.
Transformative Appetite: Shape-Changing Food Transforms from 2D to 3D by Water Interaction through Cooking

We developed a concept of transformative appetite, where edible 2D films made of common food materials (protein, cellulose or starch) can transform into 3D food during cooking. This transformation process is triggered by water adsorption, and it is strongly compatible with the 'flat packaging' concept for substantially reducing shipping costs and storage space. To develop these transformable foods, we performed material-based design, established a hybrid fabrication strategy, and conducted performance simulation. Users can customize food shape transformations through a pre-defined simulation platform, and then fabricate these designed patterns using additive manufacturing. Three application techniques are provided - 2D-to-3D folding, hydration-induced wrapping, and temperature-induced self-fragmentation, to present the shape, texture, and interaction with food materials. Based on this concept, several dishes were created in the kitchen, to demonstrate the futuristic dining experience through materials-based interaction design.
CadentFlow : An Application-Driven Network Abstraction for the Cloud

Cloud applications typically have a set of correlated flows between stages of computation. The coflow abstraction, which takes into account this structure, helps improve the performance by enabling collective optimization on the set of related flows. However, an application may have implicit preferences among component flows which is not captured by the coflow abstraction. A network controller unaware of these inter-flow preferences may make sub-optimal decisions. In this paper, we put forward a new abstraction, CadentFlow, with per-flow metrics and an optimization objective, to capture the application requirements effectively. Using distributed deep learning as a representative application, we show that minimizing the Coflow Completion Time (CCT) does not always lower application completion time, and may even hurt performance. Compared to CCT minimization, application performance can be improved by up to 25% during training in distributed deep learning using flow-level information provided by CadentFlow. We discuss the implications of this abstraction in network scheduling and application design.
Improving the Recruitment Process through Ontology-based Querying

While using semantic data can enable improved retrieval of suitable jobs or applicants in a recruitment process, cases of inconsistent or overly specific queries which would return no results still have to be dealt with. In this paper the extension of a semantic job portal with a novel query relaxation technique is presented which is able to return results even in such cases. Subsymbolic methods estimate the (quantitative) similarity between job or applicant descriptions. Symbolic approaches allow a more intuitive way to formulate and handle preferences and domain knowledge. But due to their partial preference order they can not rank all results in practice like subsymbolic approaches. In this paper we propose a query relaxation method which combines both methods. This method demonstrates that by having data based on formal ontologies, one can improve the retrieval also in a user-friendly way.
Cognitive Complexity and Attentional Control in the Bilingual Mind

In the analysis and control framework, Bialystok identifies analysis (representation) and control (selective attention) as components of language processing and has shown that one of these, control, develops earlier in bilingual children than in comparable monolinguals. In the theory of cognitive complexity and control (CCC), Zelazo and Frye argue that preschool children lack the conscious representation and executive functioning needed to solve problems based on conflicting rules. The present study investigates whether the bilingual advantage in control can be found in a nonverbal task, the dimensional change card sort, used by Zelazo and Frye to assess CCC. This problem contains misleading information characteristic of high-control tasks but minimal demands for analysis. Sixty preschool children, half of whom were bilingual, were divided into a group of younger ( M 5 4,2) and older ( M 5 5,5) children. All the children were given a test of English proficiency (PPVT-R) and working memory (Visually-Cued Recall Task) to assure comparability of the groups and then administered the dimensional change card sort task and the moving word task. The bilingual children were more advanced than the monolinguals in the solving of experimental problems requiring high levels of control. These results demonstrate the role of attentional control in both these tasks, extends our knowledge about the cognitive development of bilingual children, and provides a means of relating developmental proposals articulated in two different theoretical frameworks, namely, CCC and analysis-control.
Densely Connected Convolutional Networks

Recent work has shown that convolutional networks can be substantially deeper, more accurate, and efficient to train if they contain shorter connections between layers close to the input and those close to the output. In this paper, we embrace this observation and introduce the Dense Convolutional Network (DenseNet), which connects each layer to every other layer in a feed-forward fashion. Whereas traditional convolutional networks with L layers have L connections&#x2014;one between each layer and its subsequent layer&#x2014;our network has L(L+1)/2 direct connections. For each layer, the feature-maps of all preceding layers are used as inputs, and its own feature-maps are used as inputs into all subsequent layers. DenseNets have several compelling advantages: they alleviate the vanishing-gradient problem, strengthen feature propagation, encourage feature reuse, and substantially reduce the number of parameters. We evaluate our proposed architecture on four highly competitive object recognition benchmark tasks (CIFAR-10, CIFAR-100, SVHN, and ImageNet). DenseNets obtain significant improvements over the state-of-the-art on most of them, whilst requiring less memory and computation to achieve high performance. Code and pre-trained models are available at https://github.com/liuzhuang13/DenseNet.
Fingerprint Template Protection: From Theory to Practice

One of the potential vulnerabilities in a biometric system is the leakage of biometric template information, which may lead to serious security and privacy threats. Most of the available template protection techniques fail to meet all the desired requirements of a practical biometric system like revocability, security, privacy, and high matching accuracy. In particular, protecting the fingerprint templates has been a difficult problem due to large intra-user variations (e.g., rotation, translation, nonlinear deformation, and partial prints). There are two fundamental challenges in any fingerprint template protection scheme. First, we need to select an appropriate representation scheme that captures most of the discriminatory information, but is sufficiently invariant to changes in finger placement and can be secured using available template protection algorithms. Secondly, we need to automatically align or register the fingerprints obtained during enrollment and matching without using any information that could reveal the features, which uniquely characterize a fingerprint. This chapter analyzes how these two challenges are being addressed in practice and how the design choices affect the trade-off between the security and matching accuracy. Though much progress has been made over the last decade, we believe that fingerprint template protection algorithms are still not sufficiently robust to be incorporated into practical fingerprint recognition systems. Anil K. Jain Department of Computer Science & Engineering, Michigan State University, East Lansing, MI 48824, USA and Department of Brain & Cognitive Engineering, Korea University, Seoul.  A*STAR, Fusionopolis, Singapore.  knandakumar@i2r.astar.edu.sg, Abhishek Nagar Department of Computer Science & Engineering, Michigan State University, East Lansing, MI 48824, USA.  nagarabh@cse.msu.edu
Heuristic evaluation of user interfaces

Heuristic evaluation is an informal method of usability analysis where a number of evaluators are presented with an interface design and asked to comment on it. Four experiments showed that individual evaluators were mostly quite bad at doing such heuristic evaluations and that they only found between 20 and 51% of the usability problems in the interfaces they evaluated. On the other hand, we could aggregate the evaluations from several evaluators to a single evaluation and such aggregates do rather well, even when they consist of only three to five people.
Video Object Tracking in the Compressed Domain Using Spatio-Temporal Markov Random Fields

Despite the recent progress in both pixel-domain and compressed-domain video object tracking, the need for a tracking framework with both reasonable accuracy and reasonable complexity still exists. This paper presents a method for tracking moving objects in H.264/AVC-compressed video sequences using a spatio-temporal Markov random field (ST-MRF) model. An ST-MRF model naturally integrates the spatial and temporal aspects of the object's motion. Built upon such a model, the proposed method works in the compressed domain and uses only the motion vectors (MVs) and block coding modes from the compressed bitstream to perform tracking. First, the MVs are preprocessed through intracoded block motion approximation and global motion compensation. At each frame, the decision of whether a particular block belongs to the object being tracked is made with the help of the ST-MRF model, which is updated from frame to frame in order to follow the changes in the object's motion. The proposed method is tested on a number of standard sequences, and the results demonstrate its advantages over some of the recent state-of-the-art methods.
A Review on Security Evaluation for Pattern Classifier against Attack

The systems which can be used for pattern classification are used in adversarial application, for example spam filtering, network intrusion detection system, biometric authentication. This adversarial scenario&apos;s exploitation may sometimes affect their performance and limit their practical utility. In case of pattern classification conception and contrive methods to adversarial environment is a novel and relevant research direction, which has not yet pursued in a systematic way. To address one main open issue: evaluating at contrive phase the security of pattern classifiers (for example the performance degradation under potential attacks which incurs during the operation). To propose a framework for evaluation of classifier security and also this framework can be applied to different classifiers on one of the application from the
Supervised probabilistic principal component analysis

Principal component analysis (PCA) has been extensively applied in data mining, pattern recognition and information retrieval for unsupervised dimensionality reduction. When labels of data are available, e.g., in a classification or regression task, PCA is however not able to use this information. The problem is more interesting if only part of the input data are labeled, i.e., in a semi-supervised setting. In this paper we propose a supervised PCA model called SPPCA and a semi-supervised PCA model called S2PPCA, both of which are extensions of a probabilistic PCA model. The proposed models are able to incorporate the label information into the projection phase, and can naturally handle multiple outputs (i.e., in multi-task learning problems). We derive an efficient EM learning algorithm for both models, and also provide theoretical justifications of the model behaviors. SPPCA and S2PPCA are compared with other supervised projection methods on various learning tasks, and show not only promising performance but also good scalability.