Query: Improving the Gaussian Process Sparse Spectrum Approximation by Representing Uncertainty in Frequency Inputs

Relevant passages:
Stochastic Variational Inference <=SEP=> We develop stochastic variational inference, a scalable algorithm for approximating posterior distributions. We develop this technique for a large class of probabilistic models and we demonstrate it with two probabilistic topic models, latent Dirichlet allocation and the hierarchical Dirichlet process topic model. Using stochastic variational inference, we analyze several large collections of documents: 300K articles from Nature, 1.8M articles from The New York Times, and 3.8M articles from Wikipedia. Stochastic inference can easily handle data sets of this size and outperforms traditional variational inference, which can only handle a smaller subset. (We also show that the Bayesian nonparametric topic model outperforms its parametric counterpart.) Stochastic variational inference lets us apply complex Bayesian models to massive data sets.

The Evidence Framework Applied to Classification Networks <=SEP=> Three Bayesian ideas are presented for supervised adaptive classifiers. First, it is argued that the output of a classifier should be obtained by marginalizing over the posterior distribution of the parameters; a simple approximation to this integral is proposed and demonstrated. This involves a "moderation" of the most probable classifier's outputs, and yields improved performance. Second, it is demonstrated that the Bayesian framework for model comparison described for regression models in MacKay (1992a,b) can also be applied to classification problems. This framework successfully chooses the magnitude of weight decay terms, and ranks solutions found using different numbers of hidden units. Third, an information-based data selection criterion is derived and demonstrated within this framework.

A Unifying View of Sparse Approximate Gaussian Process Regression <=SEP=> We provide a new unifying view, including all existing prope r probabilistic sparse approximations for Gaussian process regression. Our approach relies on exp ressing theeffective priorwhich the methods are using. This allows new insights to be gained, and highlights the relationship between existing methods. It also allows for a clear theoretically j ustified ranking of the closeness of the known approximations to the corresponding full GPs. Finall y we point directly to designs of new better sparse approximations, combining the best of the exi sting strategies, within attractive computational constraints.

Random Features for Large-Scale Kernel Machines <=SEP=> To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. Our randomized features are designed so that the inner products of the transformed data are approximately equal to those in the feature space of a user specified shift-invariant kernel. We explore two sets of random features, provide convergence bounds on their ability to approximate various radial basis kernels, and show that in large-scale classification and regression tasks linear machine learning algorithms that use these features outperform state-of-the-art large-scale kernel machines.

A Practical Bayesian Framework for Backpropagation Networks <=SEP=> A quantitative and practical Bayesian framework is described for learning of mappings in feedforward networks. The framework makes possible (1) objective comparisons between solutions using alternative network architectures, (2) objective stopping rules for network pruning or growing procedures, (3) objective choice of magnitude and type of weight decay terms or additive regularizers (for penalizing large weights, etc.), (4) a measure of the effective number of well-determined parameters in a model, (5) quantified estimates of the error bars on network parameters and on network output, and (6) objective comparisons with alternative learning and interpolation models such as splines and radial basis functions. The Bayesian "evidence" automatically embodies "Occam's razor," penalizing overflexible and overcomplex models. The Bayesian approach helps detect poor underlying assumptions in learning models. For learning models well matched to a problem, a good correlation between generalization ability and the Bayesian evidence is obtained.

The Effects of Intervention Using a Robot on the Levels of Compliance of Four Children with Autism to Requests Given by T heir Mothers <=SEP=> The Effects of Intervention Using a Robot on the Levels of Compliance of Four Children with Autism to Requests Given by Their Mothers Holly J. Nelson Department of Communication Disorders Master of Science The current study presents the use of a humanoid robot to facilitate compliant behaviors to two types of directives in four children with autism. The children participated in a three-month intervention program that incorporated core components of the SCERTS model in order to facilitate social communication (Prizant, Wetherby, Rubin, & Laurent, 2003). Treatment sessions were comprised of 40 minutes of traditional treatment and 10 minutes of interaction with a humanoid robot. Preand post-intervention assessment were conducted, each involving a 5 minute interaction with the child’s mother, in which they were presented with directives in the form of physical manipulation and verbal requests accompanied by a gesture or model. These preand post-intervention sessions were recorded, analyzed, and coded for compliant and noncompliant behavior to the directives, as well as any eye contact, language, or reciprocal action that accompanied their behavior. The overall results were variable, revealing that two participants made notable gains, one child remained consistent, and another participant showed a decrease in compliant behavior in the post-intervention sessions. Further research should be conducted to include a longer period of baseline and intervention, more systematic identification of the most effective probes for the child, and documentation of the child’s physical and emotional state.

Adaptation and coaching of periodic motion primitives through physical and visual interaction <=SEP=> In this paper we propose and evaluate a control system to (1) learn and (2) adapt robot motion for continuous non-rigid contact with the environment. We present the approach in the context of wiping surfaces with robots. Our approach is based on learning by demonstration. First an initial periodicmotion, covering the essence of the wiping task, is transferred from a human to a robot. The system extracts and learns one period of motion. Once the user/demonstrator is content with the motion, the robot seeks and establishes contactwith a given surface,maintaining a predefined force of contact through force feedback. The shape of the surface is encoded for the complete period ofmotion, but the robot can adapt to a different surface, perturbations or obstacles. The novelty stems from the fact that the feedforward component is learned and encoded in a dynamic movement primitive. By using the feedforward component, the feedback component is greatly reduced if not completely canceled. Finally, if the user is not satisfied with the periodic pattern, he/she can change parts of motion through predefined gestures or through physical contact in a manner of a tutor or a coach. The complete system thus allows not only a transfer ofmotion, but a transfer ofmotionwithmatching correspondences, i.e. wiping motion is constrained to maintain physical contact with the surface to be wiped. The interface for both learning and adaptation is simple and intuitive and allows for fast and reliable knowledge transfer to the robot. Simulated and real world results in the application domain of wiping a surface are presented on three different robotic platforms. Results of the three robotic platforms, namely a 7 degree-of-freedom Kuka LWR-4 robot, the ARMAR-IIIa humanoid platform and the Sarcos CB-i humanoid robot, depict different methods of adaptation to the environment and coaching. © 2015 Elsevier B.V. All rights reserved. ⇤ Corresponding author. E-mail addresses: andrej.gams@ijs.si (A. Gams), tadej.petric@ijs.si (T. Petri£), martin.do@kit.edu (M. Do), bojan.nemec@ijs.si (B. Nemec), xmorimo@atr.jp (J. Morimoto), asfour@kit.edu (T. Asfour), ales.ude@ijs.si (A. Ude).

A Soldier Health Monitoring System for Military Applications <=SEP=> With recent advances in technology, various wearable sensors have been developed for the monitoring of human physiological parameters. A Body Sensor Network (BSN) consisting of such physiological and biomedical sensor nodes placed on, near or within a human body can be used for real-time health monitoring. In this paper, we describe an on-going effort to develop a system consisting of interconnected BSNs for real-time health monitoring of soldiers. We discuss the background and an application scenario for this project. We describe the preliminary prototype of the system and present a blast source localization application.

High-Conversion-Ratio Bidirectional DC–DC Converter With Coupled Inductor <=SEP=> In this paper, a high-conversion-ratio bidirectional dc-dc converter with coupled inductor is proposed. In the boost mode, two capacitors are parallel charged and series discharged by the coupled inductor. Thus, high step-up voltage gain can be achieved with an appropriate duty ratio. The voltage stress on the main switch is reduced by a passive clamp circuit. Therefore, the low resistance RDS(ON) of the main switch can be adopted to reduce conduction loss. In the buck mode, two capacitors are series charged and parallel discharged by the coupled inductor. The bidirectional converter can have high step-down gain. Aside from that, all of the switches achieve zero voltage-switching turn-on, and the switching loss can be improved. Due to two active clamp circuits, the energy of the leakage inductor of the coupled inductor is recycled. The efficiency can be further improved. The operating principle and the steady-state analyses of the voltage gain are discussed. Finally, a 24-V-input-voltage, 400-V-output-voltage, and 200-W-output-power prototype circuit is implemented in the laboratory to verify the performance.

Safeguarding 5G wireless communication networks using physical layer security <=SEP=> The fifth generation (5G) network will serve as a key enabler in meeting the continuously increasing demands for future wireless applications, including an ultra-high data rate, an ultrawide radio coverage, an ultra-large number of devices, and an ultra-low latency. This article examines security, a pivotal issue in the 5G network where wireless transmissions are inherently vulnerable to security breaches. Specifically, we focus on physical layer security, which safeguards data confidentiality by exploiting the intrinsic randomness of the communications medium and reaping the benefits offered by the disruptive technologies to 5G. Among various technologies, the three most promising ones are discussed: heterogenous networks, massive multiple-input multiple-output, and millimeter wave. On the basis of the key principles of each technology, we identify the rich opportunities and the outstanding challenges that security designers must tackle. Such an identification is expected to decisively advance the understanding of future physical layer security.

Deblurring Face Images with Exemplars <=SEP=> The human face is one of the most interesting subjects involved in numerous applications. Significant progress has been made towards the image deblurring problem, however, existing generic deblurring methods are not able to achieve satisfying results on blurry face images. The success of the state-of-the-art image deblurring methods stems mainly from implicit or explicit restoration of salient edges for kernel estimation. When there is not much texture in the blurry image (e.g., face images), existing methods are less effective as only few edges can be used for kernel estimation. Moreover, recent methods are usually jeopardized by selecting ambiguous edges, which are imaged from the same edge of the object after blur, for kernel estimation due to local edge selection strategies. In this paper, we address these problems of deblurring face images by exploiting facial structures. We propose a maximum a posteriori (MAP) deblurring algorithm based on an exemplar dataset, without using the coarse-to-fine strategy or ad-hoc edge selections. Extensive evaluations against state-of-the-art methods demonstrate the effectiveness of the proposed algorithm for deblurring face images. We also show the extendability of our method to other specific deblurring tasks.

MorusDB: a resource for mulberry genomics and genome biology <=SEP=> Mulberry is an important cultivated plant that has received the attention of biologists interested in sericulture and plant-insect interaction. Morus notabilis, a wild mulberry species with a minimal chromosome number is an ideal material for whole-genome sequencing and assembly. The genome and transcriptome of M. notabilis were sequenced and analyzed. In this article, a web-based and open-access database, the Morus Genome Database (MorusDB), was developed to enable easy-to-access and data mining. The MorusDB provides an integrated data source and an easy accession of mulberry large-scale genomic sequencing and assembly, predicted genes and functional annotations, expressed sequence tags (ESTs), transposable elements (TEs), Gene Ontology (GO) terms, horizontal gene transfers between mulberry and silkworm and ortholog and paralog groups. Transcriptome sequencing data for M. notabilis root, leaf, bark, winter bud and male flower can also be searched and downloaded. Furthermore, MorusDB provides an analytical workbench with some built-in tools and pipelines, such as BLAST, Search GO, Mulberry GO and Mulberry GBrowse, to facilitate genomic studies and comparative genomics. The MorusDB provides important genomic resources for scientists working with mulberry and other Moraceae species, which include many important fruit crops. Designed as a basic platform and accompanied by the SilkDB, MorusDB strives to be a comprehensive platform for the silkworm-mulberry interaction studies. Database URL: http://morus.swu.edu.cn/morusdb.

Guidelines for haptic interpersonal communication applications: an exploration of foot interaction styles <=SEP=> A new method for researching haptic interaction styles is presented, based on a layered interaction model and a classification of existing devices. The method is illustrated by designing a new foot interaction device. The aim of which is to enhance non-verbal communication over a computer network. A layered protocols interaction model allows to consider all aspects of the haptic communication process: the intention to perform an action, limitations of the human body, and specifications of the communication device and the network. We demonstrate how this model can be used to derive design-guidelines by analyzing and classifying existing communication devices. By designing and evaluating a foot interaction device, we not only demonstrate that feet are suited for personal, concealed communication over a network, but also show the added value of the design-guidelines. Results of user tests provide clues for designing stimuli for foot interaction and indicate applications of foot communication devices.

20.7 A 13.8µW binaural dual-microphone digital ANSI S1.11 filter bank for hearing aids with zero-short-circuit-current logic in 65nm CMOS <=SEP=> This paper presents an ANSI S1.11 1/3-octave filter-bank chip for binaural hearing aids with two microphones per ear. Binaural multimicrophone systems significantly suppress noise interference and preserve interaural time cues at the cost of significantly higher computational and power requirements than monophonic single-microphone systems. With clock rates around the 1MHz mark, these systems are ideal candidates for low-power implementation through charge-recovery design. At such low clock frequencies, however, charge-recovery logic suffers from short-circuit currents that limit its theoretical energy efficiency [1]. The chip described in this paper is designed in 65nm CMOS using a new charge-recovery logic, called zero-short-circuit-current (ZSCC) logic, that drastically reduces short-circuit current. It processes 4 input streams at 1.75MHz with a charge recovery rate of 92%, achieving 9.7× lower power per input compared with the 40nm monophonic single-input chip that represents the published state of the art [2].

Credit scoring using support vector machines with direct search for parameters selection <=SEP=> Support vector machines (SVM) is an effective tool for building good credit scoring models. However, the performance of the model depends on its parameters’ setting. In this study, we use direct search method to optimize the SVM-based credit scoring model and compare it with other three parameters optimization methods, such as grid search, method based on design of experiment (DOE) and genetic algorithm (GA). Two real-world credit datasets are selected to demonstrate the effectiveness and feasibility of the method. The results show that the direct search method can find the effective model with high classification accuracy and good robustness and keep less dependency on the initial search space or point setting.

Capability Model for Open Data: An Empirical Analysis <=SEP=> Creating superior competitiveness is central to open data organization's survivability in the fast changing and competitive open data market. In their quest to develop and increase competitiveness and survivability, many of these organizations are moving towards developing open data capabilities. Research-based knowledge on open data capabilities and how they relate to each other remains sparse, however, with most of the open data literature focusing on social and economic value of open data, not capabilities required. By exploring the related literature on business and organizational capabilities and linking the findings to the empirical evidence collected through the survey of 49 open data organizations around the world, this study develops an open data capability model. The model emerged from our deductive research process improves both theoretical and practical understanding of open data capabilities and their relationships required to help increase competitiveness and survivability of these types of organizations.

Automatic detection of diabetic retinopathy exudates from non-dilated retinal images using mathematical morphology methods <=SEP=> Diabetic retinopathy is a complication of diabetes that is caused by changes in the blood vessels of the retina. The symptoms can blur or distort the patient's vision and are a main cause of blindness. Exudates are one of the primary signs of diabetic retinopathy. Detection of exudates by ophthalmologists normally requires pupil dilation using a chemical solution which takes time and affects patients. This paper investigates and proposes a set of optimally adjusted morphological operators to be used for exudate detection on diabetic retinopathy patients' non-dilated pupil and low-contrast images. These automatically detected exudates are validated by comparing with expert ophthalmologists' hand-drawn ground-truths. The results are successful and the sensitivity and specificity for our exudate detection is 80% and 99.5%, respectively.

On-Line Flatness Measurement in the Steelmaking Industry <=SEP=> Shape is a key characteristic to determine the quality of outgoing flat-rolled products in the steel industry. It is greatly influenced by flatness, a feature to describe how the surface of a rolled product approaches a plane. Flatness is of the utmost importance in steelmaking, since it is used by most downstream processes and customers for the acceptance or rejection of rolled products. Flatness sensors compute flatness measurements based on comparing the length of several longitudinal fibers of the surface of the product under inspection. Two main different approaches are commonly used. On the one hand, most mechanical sensors measure the tensile stress across the width of the rolled product, while manufacturing and estimating the fiber lengths from this stress. On the other hand, optical sensors measure the length of the fibers by means of light patterns projected onto the product surface. In this paper, we review the techniques and the main sensors used in the steelmaking industry to measure and quantify flatness defects in steel plates, sheets and strips. Most of these techniques and sensors can be used in other industries involving rolling mills or continuous production lines, such as aluminum, copper and paper, to name a few. Encompassed in the special issue, State-of-the-Art Sensors Technology in Spain 2013, this paper also reviews the most important flatness sensors designed and developed for the steelmaking industry in Spain.

MOBA: a New Arena for Game AI <=SEP=> Games have always been popular testbeds for Artificial Intelligence (AI). In the last decade, we have seen the rise of the Multiple Online Battle Arena (MOBA) games, which are the most played games nowadays. In spite of this, there are few works that explore MOBA as a testbed for AI Research. In this paper we present and discuss the main features and opportunities offered by MOBA games to Game AI Research. We describe the various challenges faced along the game and also propose a discrete model that can be used to better understand and explore the game. With this, we aim to encourage the use of MOBA as a novel research platform for Game AI.

An OpenNaaS Based SDN Framework for Dynamic QoS Control <=SEP=> Network Service Providers should offer provisioning services with guaranteed Quality of Service (QoS), specifically adapted to the characteristics of the applications running on their network. In this paper we propose the Network Control Layer (NCL), a software framework solution based on Software Defined Networks (SDN), OpenFlow and Network as a Service (NaaS) paradigms. It addresses a major innovation area in the field of network control and management providing on-demand end-to-end network provisioning services with guaranteed QoS, based on the specific requirements of on-top running interactive applications. The NCL implementation is based on the OpenNaaS framework, and it includes mechanisms for network status monitoring and SDN switches configuration based on the interactive applications' QoS network requirements. We demonstrate NCL's utility in the context of control plane models making use of a practical use case.

A Feature-Based Approach for Group-Wise Grid Map Registration <=SEP=> For autonomous vehicles and advanced driver assistance systems, information on the actual state of the environment is fundamental for localization and mapping tasks. Localization benefits from multiple observations of the same location at different times as these may provide important information on static and mobile objects. For efficient mapping, the environment may be explored in parallel. For these purposes, multiple observations represented by grid maps have to be aligned into one mutual frame. This paper addresses the problem of group-wise grid map registration using an image processing approach. For registration, a rotational-invariant descriptor is proposed in order to provide the correspondences of points of interest in radar-based occupancy grid maps. As pairwise registration of multiple grid maps suffers from bias, this paper proposes a graph-based approach for robust registration of multiple grid maps. This will facilitate highly accurate range sensor maps for the aforementioned purposes. Large-scale experiments show the benefit of the proposed methods and compare it to state-of-the-art algorithms on radar measurements.

Very Small Ultra-Wide-Band MMIC Magic T and Applications to Combiners and Dividers <=SEP=> An FET-sized 1-18 GHz monolithic active magic T (1 W hybrid) is proposed. It unifies two different dividers, electrically isolated from each other, in a novel GaAs FET electrode configuration, viz. the LUFET concept. Its characteristics and experiment results are presented. Applications of the magic T to miniature wide-band RF signal processing. . .

The big five personality traits: psychological entities or statistical constructs? <=SEP=> The present study employed multivariate genetic item-level analyses to examine the ontology and the genetic and environmental etiology of the Big Five personality dimensions, as measured by the NEO Five Factor Inventory (NEO-FFI) [Costa and McCrae, Revised NEO personality inventory (NEO PI-R) and NEO five-factor inventory (NEO-FFI) professional manual, 1992; Hoekstra et al., NEO personality questionnaires NEO-PI-R, NEO-FFI: manual, 1996]. Common and independent pathway model comparison was used to test whether the five personality dimensions fully mediate the genetic and environmental effects on the items, as would be expected under the realist interpretation of the Big Five. In addition, the dimensionalities of the latent genetic and environmental structures were examined. Item scores of a population-based sample of 7,900 adult twins (including 2,805 complete twin pairs; 1,528 MZ and 1,277 DZ) on the Dutch version of the NEO-FFI were analyzed. Although both the genetic and the environmental covariance components display a 5-factor structure, applications of common and independent pathway modeling showed that they do not comply with the collinearity constraints entailed in the common pathway model. Implications for the substantive interpretation of the Big Five are discussed.

Relationship between the cayley-dickson fourier transform and the hartley transform of multidimensional real signals <=SEP=> The paper shows relations between two different frequency representations of n-dimensional signals (n = 1, 2, 3): the Cayley-Dickson Fourier transform and the Hartley transform. The formulas relating the n-D complex Fourier transform and the n-D Hartley transform are presented. New formulas relating the Quaternion and Octonion Fourier transforms and respectively the 2-D and 3-D Hartley transforms are developed. The paper is illustrated with examples of Hartley transforms of 1-D, 2-D and 3-D Gaussian signals.

Budgeted Optimization with Constrained Experiments <=SEP=> Motivated by a real-world problem, we study a novel budgeted optimization problem where the goal is to optimize an unknown function f(·) given a budget by requesting a sequence of samples from the function. In our setting, however, evaluating the function at precisely specified points is not practically possible due to prohibitive costs. Instead, we can only request constrained experiments. A constrained experiment, denoted by Q, specifies a subset of the input space for the experimenter to sample the function from. The outcome of Q includes a sampled experiment x, and its function output f(x). Importantly, as the constraints of Q become looser, the cost of fulfilling the request decreases, but the uncertainty about the location x increases. Our goal is to manage this trade-off by selecting a set of constrained experiments that best optimize f(·) within the budget. We study this problem in two different settings, the non-sequential (or batch) setting where a set of constrained experiments is selected at once, and the sequential setting where experiments are selected one at a time. We evaluate our proposed methods for both settings using synthetic and real functions. The experimental results demonstrate the efficacy of the proposed methods.

Kwyjibo: automatic domain name generation <=SEP=> Automatically generating ‘good’ domain names that are random yet pronounceable is a problem harder than it first appears. The problem is related to random word generation, and we survey and categorize existing techniques before presenting our own syllable-based algorithm that produces higher-quality results. Our results are also applicable elsewhere, in areas such as password generation, username generation, and even computer-generated poetry. Copyright © 2008 John Wiley & Sons, Ltd.

Asynchronous MPC with a strict honest majority using non-equivocation <=SEP=> Multiparty computation (MPC) among n parties can tolerate up to tsynchronous communication setting; however, in an asynchronous communication setting, the resiliency bound decreases to only t < n/3 active corruptions. We improve the resiliency bound for asynchronous MPC (AMPC) to match synchronous MPC using non-equivocation.
 Non-equivocation is a message authentication mechanism to restrict a corrupted sender from making conflicting statements to different (honest) parties. It can be implemented using an increment-only counter and a digital signature oracle, realizable with trusted hardware modules readily available in commodity computers and smartphone devices. A non-equivocation mechanism can also be transferable and allows a receiver to verifiably transfer the authenticated statement to other parties. In this work, using transferable non-equivocation, we present an AMPC protocol tolerating t < n/2 faults. From a practical point of view, our AMPC protocol requires fewer setup assumptions than the previous AMPC protocol with t < n/2 by Beerliova-Trubiniova, Hirt and Nielsen [PODC 2010]: unlike their AMPC protocol, it does not require any synchronous broadcast round at the beginning of the protocol and avoids the threshold homomorphic encryption setup assumption. Moreover, our AMPC protocol is also efficient and provides a gain of Θ(n) in the communication complexity per multiplication gate, over the AMPC protocol of Beerliova-Trubiniova et al. In the process, using non-equivocation, we also define the first asynchronous verifiable secret sharing (AVSS) scheme with t < n/2, which is of independent interest to threshold cryptography.

The Evolution of Culturally-Variable Sex Differences : Men and Women Are Not Always Different , but When They Are ... It Appears Not to Result from Patriarchy or Sex Role Socialization <=SEP=> © Springer International Publishing Switzerland 2014 T. K. Shackelford, R. D. Hansen (eds.), The Evolution of Sexuality, Evolutionary Psychology DOI 10.1007/978-3-319-09384-0_11 D. P. Schmitt () Department of Psychology, Bradley University, 75 Bradley Hall, Peoria, IL 61625, USA e-mail: dps@bradley.edu Just like all other sexually reproducing species, male and female humans are more similar than different. Even so, men’s and women’s psychological traits sometimes differ in important ways, both in terms of typical or average levels (Buss 1989; Del Giudice 2009; Ellis 2011) and in terms of variability (Archer and Mehdikhani 2003; Borkenau et al. 2013; Lippa 2009). Sex differences in numerous traits have been well-established as moderate to large in size1 and as culturally pervasive. For example, sex differences in negative emotion-related traits have been documented across several meta-analyses (Feingold 1994; Miettunen et al. 2007; Whissell 1996), integrative neuroscientific reviews (Hyde et al. 2008; Stevens and Hamann 2012), and large cross-cultural surveys (Costa et al. 2001; Hopcroft and McLaughlin 2012; Lippa 2009; McCrae and Terracciano 2005; Schmitt et al. 2008; Van de Velde et al. 2010). Using a multivariate approach, Del Giudice et al. (2012) documented across 16 personality traits—ranging from dominance and liveliness to perfectionism and tension—that sex differences in personality are astonishingly large, with only 10 % overlap in men’s and women’s overall distributions. Beyond sex differences in personality traits, psychologists have uncovered dozens of ways that men and women differ in affect, behavior, and cognition across most cultures (Archer 2014; Browne 1998; Mealey 2000). In one comprehensive review, Ellis (2011) identified 63 psychological sex differences that have been replicated across multiple cultures and at least 10 studies, with not a single replication failure (probably an overly strict exclusionary criterion; see Schmitt et al. 2014). In another wide-ranging review, Archer (2014) reported culturally-pervasive sex differences are reliably found in the assessment of negative emotions (e.g., fear, anxiety, depression), anti-social behaviors (e.g., aggression, violence, criminality), cognitive abilities (e.g., mental rotation, object location,

Matching Curves to Imprecise Point Sets using Fréchet Distance <=SEP=> Let P be a polygonal curve in R of length n, and S be a point-set of size k. The Curve/Point Set Matching problem consists of finding a polygonal curve Q on S such that the Fréchet distance from P is less than a given ε. We consider eight variations of the problem based on the distance metric used and the omittability or repeatability of the points. We provide closure to a recent series of complexity results for the case where S consists of precise points. More importantly, we formulate a more realistic version of the problem that takes into account measurement errors. This new problem is posed as the matching of a given curve to a set of imprecise points. We prove that all three variations of the problem that are in P when S consists of precise points become NP-complete when S consists of imprecise points. We also discuss approximation re-

Toward Computational Fact-Checking <=SEP=> Our news are saturated with claims of “facts” made from data. Database research has in the past focused on how to answer queries, but has not devoted much attention to discerning more subtle qualities of the resulting claims, e.g., is a claim “cherry-picking”? This paper proposes a framework that models claims based on structured data as parameterized queries. A key insight is that we can learn a lot about a claim by perturbing its parameters and seeing how its conclusion changes. This framework lets us formulate practical fact-checking tasks—reverse-engineering (often intentionally) vague claims, and countering questionable claims—as computational problems. Along with the modeling framework, we develop an algorithmic framework that enables efficient instantiations of “meta” algorithms by supplying appropriate algorithmic building blocks. We present real-world examples and experiments that demonstrate the power of our model, efficiency of our algorithms, and usefulness of their results.