pinecone/core-2020-05-10-deduplication huggingface dataset:
Gender Differences in Spatial Ability: Implications for STEM Education and Approaches to Reducing the Gender Gap for Parents and Educators

While men and women do not differ in levels of general intelligence, gender differences do exist for more specific cognitive abilities. In particular, gender gaps in spatial ability are the largest of all gender differences in cognitive abilities. Research on gender differences in spatial ability is reviewed, including the role that parents and educators can play in encouraging these skills using formal instruction, at home and through play. A variety of psychobiosocial factors contribute to these gender differences. Research has shown that the development of spatial ability lays down the foundation for quantitative reasoning, a collective term for mathematical and science skills. For this reason, some researchers have claimed that they contribute to the underrepresentation of women in STEM-fields. However, like other cognitive skills, instruction and practice can yield dramatic improvements in performance on spatial tasks, reducing the magnitude of gender differences. There is also evidence of transfer effects and persistence across the passage of time. A growing number of educational psychologists have argued that early education of spatial intelligence is necessary as a matter of equity for all students, and that it may offer substantial benefits for the later development of mathematical and scientific skills across all ability levels. Parents and caregivers can also encourage children by using spatial language, providing children with enrichment activities that offer spatial learning experiences. Concerted efforts to address the gender gap in spatial ability has the potential to translate into a reduction of the gender gap in STEM, but further research is required to determine which types of training and at what intervals is most efficacious.Griffith Health, School of Applied PsychologyFull Tex
SuMGra: Querying Multigraphs via Efficient Indexing

International audienceMany real world datasets can be represented by a network with a set of nodes interconnected with each other by multiple relations. Such a rich graph is called a multigraph. Unfortunately, all the existing algorithms for subgraph query matching are not able to adequately leverage multiple relationships that exist between the nodes. In this paper we propose an efficient indexing schema for querying single large multi-graphs, where the indexing schema aptly captures the neighbourhood structure in the data graph. Our proposal SuMGra couples this novel indexing schema with a subgraph search algorithm to quickly traverse though the solution space to enumerate all the matchings. Extensive experiments conducted on real benchmarks prove the time efficiency as well as the scalability of SuMGra
Quality Prediction in Collaborative Platforms: A Generic Approach by Heterogeneous Graphs

As everyone can enrich or rather impoverish crowd-sourcing contents, it is a crucial need to continuously improve automatic quality contents assessment tools. Structural-based analysis methods developed for such quality prediction purposes generally handle a limited or manually fixed number of families of nodes and relations. This lack of genericity prevents existing algorithms for being adaptable to platforms evolutions. In this work, we propose a generic and adaptable algorithm, called HSQ, generalising various state-of-the-art models and allowing the consideration of graphs defined by an arbitrary number of nodes semantics. Evaluations performed over the two representative crowd-sourcing platforms Wikipedia and Stack Exchange state that the consideration of additional nodes semantics and relations improve the performances of state-of-the-art approaches
Constructing Data Graphs for Keyword Search

A data graph is a convenient paradigm for supporting keyword search that
takes into account available semantic structure and not just textual relevance.
However, the problem of constructing data graphs that facilitate both
efficiency and effectiveness of the underlying system has hardly been
addressed. A conceptual model for this task is proposed. Principles for
constructing good data graphs are explained. Transformations for generating
data graphs from RDB and XML are developed. The results obtained from these
transformations are analyzed. It is shown that XML is a better starting point
for getting a good data graph.Comment: Full version of DEXA'16 pape
An anomaly in space and time and the origin of dynamics

The Hamiltonian defines the dynamical properties of the universe. Evidence
from particle physics shows that there is a different version of the
Hamiltonian for each direction of time. As there is no physical basis for the
universe to be asymmetric in time, both versions must operate equally. However,
conventional physical theories accommodate only one version of the Hamiltonian
and one direction of time. This represents an unexplained anomaly in
conventional physics and calls for a reworking of the concepts of time and
space. Here I explain how the anomaly can be resolved by allowing dynamics to
emerge phenomenologically. The resolution offers a picture of time and space
that lies below our everyday experience, and one in which their differences are
epiphenomenal rather than elemental.Comment: 17 pages, 3 figures, 1 equation. Invited essay for volume on "Space,
  Time, and Frontiers of Human Understanding
Principles for re-designing information systems for environmental sustainability

Many information systems claim to be “green”, meaning in support of environmental sustainability. But at closer look we find that these claims are often unsubstantiated; in other words, many green systems are not making any environment more sustainable. We identify three main root causes. First, the ‘environment’ is often ill-defined. Second, systems often overlook that ‘sustainability’ is a targeted function dependent on the goals of some stakeholders, which may include designers, users, organizations, policy makers, society or the planet as a whole. Third, we find that research on green information systems often overlooks conceptualizations such as ecology, environment or sustainability that originate in the sciences of the system, i.e., the basis on which information systems are built. To address these issues we present eight new design principles unique to the development of Green Information Systems that can act as prescriptive coherent design theory for developing information systems that improve environmental sustainability
A note on induced Ramsey numbers

The induced Ramsey number $r_{\mathrm{ind}}(F)$ of a $k$-uniform hypergraph
$F$ is the smallest natural number $n$ for which there exists a $k$-uniform
hypergraph $G$ on $n$ vertices such that every two-coloring of the edges of $G$
contains an induced monochromatic copy of $F$. We study this function, showing
that $r_{\mathrm{ind}}(F)$ is bounded above by a reasonable power of $r(F)$. In
particular, our result implies that $r_{\mathrm{ind}}(F) \leq 2^{2^{ct}}$ for
any $3$-uniform hypergraph $F$ with $t$ vertices, mirroring the best known
bound for the usual Ramsey number. The proof relies on an application of the
hypergraph container method.Comment: Dedicated to the memory of Jirka Matou\v{s}ek, 10 pages, second
  version addresses changes arising from the referee report
On the Complexity of Computing Treebreadth

International audienceDuring the last decade, metric properties of the bags of tree-decompositions of graphs have been studied. Roughly, the length and the breadth of a tree-decomposition are the maximum diameter and radius of its bags respectively. The treelength and the treebreadth of a graph are the minimum length and breadth of its tree-decompositions respectively. Pathlength and pathbreadth are defined similarly for path-decompositions. In this paper, we answer open questions of [Dragan and Köhler , Algorithmica 2014] and [Dragan, Köhler and Leitert, SWAT 2014] about the computational complexity of treebreadth, pathbreadth and pathlength. Namely, we prove that computing these graph invariants is NP-hard. We further investigate graphs with treebreadth one, i.e., graphs that admit a tree-decomposition where each bag has a dominating vertex. We show that it is NP-complete to decide whether a graph belongs to this class. We then prove some structural properties of such graphs which allows us to design polynomial-time algorithms to decide whether a bipartite graph, resp., a planar graph, has treebreadth one
Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations

We address the problem of enumeration of seating arrangements of married
couples around a circular table such that no spouses sit next to each other and
no k consecutive persons are of the same gender. While the case of k=2
corresponds to the classical probl\`eme des m\'enages with a well-studied
solution, no closed-form expression for the number of seating arrangements is
known when k>=3.
  We propose a novel approach for this type of problems based on enumeration of
walks in certain algebraically weighted de Bruijn graphs. Our approach leads to
new expressions for the menage numbers and their exponential generating
function and allows one to efficiently compute the number of seating
arrangements in general cases, which we illustrate in detail for the ternary
case of k=3
Well-quasi-ordering versus clique-width : new results on bigenic classes.

Daligault, Rao and Thomassé conjectured that if a hereditary class of graphs is well-quasi-ordered by the induced subgraph relation then it has bounded clique-width. Lozin, Razgon and Zamaraev recently showed that this conjecture is not true for infinitely defined classes. For finitely defined classes the conjecture is still open. It is known to hold for classes of graphs defined by a single forbidden induced subgraph H, as such graphs are well-quasi-ordered and are of bounded clique-width if and only if H is an induced subgraph of P4P4. For bigenic classes of graphs i.e. ones defined by two forbidden induced subgraphs there are several open cases in both classifications. We reduce the number of open cases for well-quasi-orderability of such classes from 12 to 9. Our results agree with the conjecture and imply that there are only two remaining cases to verify for bigenic classes
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently

$\newcommand{\dist}{\operatorname{dist}}$ In this paper we define the notion
of a probabilistic neighborhood in spatial data: Let a set $P$ of $n$ points in
$\mathbb{R}^d$, a query point $q \in \mathbb{R}^d$, a distance metric $\dist$,
and a monotonically decreasing function $f : \mathbb{R}^+ \rightarrow [0,1]$ be
given. Then a point $p \in P$ belongs to the probabilistic neighborhood $N(q,
f)$ of $q$ with respect to $f$ with probability $f(\dist(p,q))$. We envision
applications in facility location, sensor networks, and other scenarios where a
connection between two entities becomes less likely with increasing distance. A
straightforward query algorithm would determine a probabilistic neighborhood in
$\Theta(n\cdot d)$ time by probing each point in $P$.
  To answer the query in sublinear time for the planar case, we augment a
quadtree suitably and design a corresponding query algorithm. Our theoretical
analysis shows that -- for certain distributions of planar $P$ -- our algorithm
answers a query in $O((|N(q,f)| + \sqrt{n})\log n)$ time with high probability
(whp). This matches up to a logarithmic factor the cost induced by
quadtree-based algorithms for deterministic queries and is asymptotically
faster than the straightforward approach whenever $|N(q,f)| \in o(n / \log n)$.
  As practical proofs of concept we use two applications, one in the Euclidean
and one in the hyperbolic plane. In particular, our results yield the first
generator for random hyperbolic graphs with arbitrary temperatures in
subquadratic time. Moreover, our experimental data show the usefulness of our
algorithm even if the point distribution is unknown or not uniform: The running
time savings over the pairwise probing approach constitute at least one order
of magnitude already for a modest number of points and queries.Comment: The final publication is available at Springer via
  http://dx.doi.org/10.1007/978-3-319-44543-4_3
A product feature-based user-centric product search model

During the online shopping process, users would search for interesting products and quickly access those that fit with their needs among a long tail of similar or closely related products. Our contribution addresses head queries that are frequently submitted on e-commerce Web sites. Head queries usually target featured products with several variations, accessories, and complementary products. We present in this paper a product feature-based user-centric model for product search involving in addition to product characteristics the user engagement toward the product. This model has been evaluated through the product search track of the LL4IR lab at CLEF 2015 in order to highlight the effectiveness of our model as well as the impact of the user engagement factor
How Relevant is the Long Tail? A Relevance Assessment Study on Million
  Short

Users of web search engines are known to mostly focus on the top ranked
results of the search engine result page. While many studies support this well
known information seeking pattern only few studies concentrate on the question
what users are missing by neglecting lower ranked results. To learn more about
the relevance distributions in the so-called long tail we conducted a relevance
assessment study with the Million Short long-tail web search engine. While we
see a clear difference in the content between the head and the tail of the
search engine result list we see no statistical significant differences in the
binary relevance judgments and weak significant differences when using graded
relevance. The tail contains different but still valuable results. We argue
that the long tail can be a rich source for the diversification of web search
engine result lists but it needs more evaluation to clearly describe the
differences.Comment: to appear in Experimental IR Meets Multilinguality, Multimodality,
  and Interaction. 7th International Conference of the CLEF Association, CLEF
  2016, \'Evora, Portugal, September 5-8, 201
General Overview of ImageCLEF at the CLEF 2016 Labs

This paper presents an overview of the ImageCLEF 2016 evaluation campaign, an event that was organized as part of the CLEF (Conference and Labs of the Evaluation Forum) labs 2016. ImageCLEF is an ongoing initiative that promotes the evaluation of technologies for annotation, indexing and retrieval for providing information access to collections of images in various usage scenarios and domains. In 2016, the 14th edition of ImageCLEF, three main tasks were proposed: 1) identi cation, multi-label classi cation and separation of compound gures from biomedical literature; 2) automatic annotation of general web images; and 3) retrieval from collections of scanned handwritten documents. The handwritten retrieval task was the only completely novel task this year, although the other two tasks introduced several modi cations to keep the proposed tasks challenging
LifeCLEF 2016: Multimedia Life Species Identification Challenges

International audienceUsing multimedia identification tools is considered as one of the most promising solutions to help bridge the taxonomic gap and build accurate knowledge of the identity, the geographic distribution and the evolution of living species. Large and structured communities of nature observers (e.g., iSpot, Xeno-canto, Tela Botanica, etc.) as well as big monitoring equipment have actually started to produce outstanding collections of multimedia records. Unfortunately, the performance of the state-of-the-art analysis techniques on such data is still not well understood and is far from reaching real world requirements. The LifeCLEF lab proposes to evaluate these challenges around 3 tasks related to multimedia information retrieval and fine-grained classification problems in 3 domains. Each task is based on large volumes of real-world data and the measured challenges are defined in collaboration with biologists and environmental stakeholders to reflect realistic usage scenarios. For each task, we report the methodology, the data sets as well as the results and the main outcom
Assessors agreement: A case study across assessor type, payment levels, query variations and relevance dimensions

Relevance assessments are the cornerstone of Information Retrieval evaluation. Yet, there is only limited understanding of how assessment disagreement influences the reliability of the evaluation in terms of systems rankings. In this paper we examine the role of assessor type (expert vs. layperson), payment levels (paid vs. unpaid), query variations and relevance dimensions (topicality and understandability) and their influence on system evaluation in the presence of disagreements across assessments obtained in the different settings. The analysis is carried out in the context of the CLEF 2015 eHealth Task 2 collection and shows that disagreements between assessors belonging to the same group have little impact on evaluation. It also shows, however, that assessment disagreement found across settings has major impact on evaluation when topical relevance is considered, while it has no impact when understandability assessments are considered
So What Do You Do? Experimenting with Space for Social Creativity

This chapter investigates the relationship between physical space and processes of creative thinking and action. The authors build on organizational and sociological literature about social space and aesthetics, then illustrate how the latter two aspects influenced each other in five action experiments. Small mixed groups explored how they would use a studio to facilitate social innovation and to strengthen the link between the Max Stern Jezreel Valley College in Israel and the surrounding communities. Analysis of the video recordings identified seven configurations of social space that changed over time as the participants engaged in the task. The authors suggest that the undifferentiated and unencrusted nature of the space was both a source of uncertainty and potential for the participants. Some groups generated more innovative processes and products than others. The study also offers insights into the importance of embodied action and verbal discourse in innovative processes
Rationality and Discursive Articulation in Place-Making

Contains fulltext :
                  183217.pdf (publisher's version ) (Open Access)In the debate on action-theoretic and the poststructuralist approaches in human geography, the former relies on a theory of modernity; the latter, on praxis theory. Action-theoretic approaches rest on the assumption of the effectivity of various kinds of rational and deliberative decision-making and actions. Proponents of poststructuralist approaches, their critical stance notwithstanding, often tend to refrain from deliberative interventions and emphasize the structural aspects of discourse, especially power structures. Laclau and Mouffe (Hegemony and socialist strategy: towards a radical democratic politics. Verso, London, 1985), by contrast, try to retain and restore the possibility of deliberative interventions in these discursive structures by inverting Foucault’s power/knowledge equation. The author of this chapter explores the extent to which this inversion reinstates responsible and rational spatial decisions and actions as a focus of research in human geography. Rationality could be reconstituted as a culturally contingent phenomenon, and critical geographical analysis could again contribute to concrete problem-solving, though in a culturally much more informed and embedded way than if one maintains critical distance
Tree-structured Bayesian networks for wrapped Cauchy directional distributions

Modelling the relationship between directional variables is a\ud
nearly unexplored field. The bivariate wrapped Cauchy distribution has\ud
recently emerged as the first closed family of bivariate directional distri-\ud
butions (marginals and conditionals belong to the same family). In this\ud
paper, we introduce a tree-structured Bayesian network suitable for mod-\ud
elling directional data with bivariate wrapped Cauchy distributions. We\ud
describe the structure learning algorithm used to learn the Bayesian net-\ud
work. We also report some simulation studies to illustrate the algorithms\ud
including a comparison with the Gaussian structure learning algorithm\ud
and an empirical experiment on real morphological data from juvenile\ud
rat somatosensory cortex cells
Mobilities of knowledge: an introduction

This is an Open Access Article. It is published by Springer under the Creative Commons Attribution 4.0 Unported Licence (CC BY). Full details of this licence are available at: http://creativecommons.org/licenses/by/4.0/Mobilities of Knowledge examines how geographical mobility of people and (im)material things has impacted epistemic systems of knowledge in different historical and geographical contexts. In this chapter, the authors introduce concepts and debates in interdisciplinary research on spatial mobility and the production, dissemination, and transfer of knowledge. They suggest extending Urry’s (2007) typology of interdependent mobilities that constitute the space of flows and the space of places (Castells, 1996) from five to six dimensions through the consideration of mobile knowledges, concepts, and practices. Finally, they outline how the chapters of this volume help to identify generic as well as context-specific practices and processes of knowledge production, dissemination, and transfer and call for more empirical case studies to further the collective development of flexible conceptual understandings
Collaboration and knowledge exchange between scholars in Britain and the empire, 1830–1914

In recent years there has been a growing interest among historians in the British Empire as a space of knowledge production and circulation. Much of this work assumes that scholarly cooperation and collaboration between individuals and institutions within the Empire had the effect (and often also the aim) of strengthening both imperial ties and the idea of empire. This chapter argues, however, that many examples of scholarly travel, exchange, and collaboration were undertaken with very different goals in mind. In particular, it highlights the continuing importance of an ideal of scientific internationalism, which stressed the benefits of scholarship for the whole of humanity and prioritized the needs and goals of individual academic and scientific disciplines. As the chapter shows, some scholars even went on to develop nuanced critiques of the imperial project while using the very structures of empire to further their own individual, disciplinary and institutional goals
What’s a (Childless) Man Without a Woman?

Using rich couple data from the Netherlands Kinship Panel Study, we investigated to what extent there were gender differences in couple dynamics within childless couples (N = 163). Though the childless partners reported similar relationship satisfaction, we found gender differences in the link between relationship conflict and relationship satisfaction - the childless men were more strongly affected by the negative aspects of the partnership. This gender difference was not evident for the association between partner support and relationship satisfaction - the positive aspects of the partnership were equally important for the male and the female childless partners. Furthermore, the association between relationship satisfaction and health was stronger for the childless men than for the childless women and this difference was particularly evident when the levels of relationship satisfaction were low. These results indicate that when they are in unsatisfying romantic relationships, childless men are at a greater risk than childless women of physical and mental ill health