Spatial Cognition as Events

1992 ◽  
Author(s):  
Anders Böök
Keyword(s):  
Spatial Cognition ◽  
Large Scale ◽  
Model Building ◽  
Spatial Information ◽  
Real Life ◽  
Spatial Relations ◽  
Perceptual Identification ◽  
Time And Space ◽  
Spatial Choice ◽  
Theoretical Perspectives

This chapter deals with the question of how adults process information about large-scale physical features and their spatial relations during navigation between places. The presentation is based on the presumption that single acts of cognition are comparatively unimportant in real-life travel. Accordingly, sequential relations between acts are emphasized, which is the reason for the term event in the title. In general, ways of seeing how spatial cognition is organized in time and space should further the search for connections between the fields of spatial cognition, environmental assessment and action. However, the latter prospect is beyond the scope of this chapter. The aim—to make explicit the sequence aspect of cognitive acts in several problem areas of spatial cognition—is pursued in a spirit of inductive analysis in that a number of act sequences are discussed as examples of important spatial cognition events. The approach is first described in broad outline. Processing of large-scale spatial information may entail different theoretical perspectives on levels of mental functioning. Basic mechanisms and operations that underlie the occurrence of cognitive acts represent one level, being the main focus of contemporary theory construction and model building. Further, cognitive acts are reflected in conscious activity and self-consciousness, which represent a second level. Finally, a third level emerges to the extent that cognitive acts are reliably ordered continuously in time and space. Common categories of acts in large-scale spatial cognition are perceptual identification, encoding, recognition, and recall of environmental information, judgments of topological, projective, and metric spatial relations, spatial inference, visual-spatial imagery, and spatial choice. Detailed processing underlying these cognitive acts is progressively unraveled by means of refined task paradigms, deductive reasoning, mathematics, and procedures for controlling subjects’ behavioral and mental activities. This kind of knowledge is sparse in the field of large-scale spatial cognition (Pick, 1985). Independent variables in experiments have been related as often to issues of development, the structure of location information in cognitive maps, methodology, or application as to the nature of processing per se (cf. Evans, 1980). In the long run, theory about underlying processing is indispensible for any of these concerns, including the event approach to be presented here.

A Combination of Spatial Pyramid and Inverted Index for Large-Scale Image Retrieval

2018 ◽  
pp. 1307-1321
Author(s):  
Vinh-Tiep Nguyen ◽  
Thanh Duc Ngo ◽  
Minh-Triet Tran ◽  
Duy-Dinh Le ◽  
Duc Anh Duong
Keyword(s):  
Image Retrieval ◽  
Large Scale ◽  
Spatial Information ◽  
Real Life ◽  
Inverted Index ◽  
Bag Of Words ◽  
Visual Words ◽  
Benchmark Datasets ◽  
Large Scale Image Retrieval ◽  
Inverted Indexing

Large-scale image retrieval has been shown remarkable potential in real-life applications. The standard approach is based on Inverted Indexing, given images are represented using Bag-of-Words model. However, one major limitation of both Inverted Index and Bag-of-Words presentation is that they ignore spatial information of visual words in image presentation and comparison. As a result, retrieval accuracy is decreased. In this paper, the authors investigate an approach to integrate spatial information into Inverted Index to improve accuracy while maintaining short retrieval time. Experiments conducted on several benchmark datasets (Oxford Building 5K, Oxford Building 5K+100K and Paris 6K) demonstrate the effectiveness of our proposed approach.

A Combination of Spatial Pyramid and Inverted Index for Large-Scale Image Retrieval

2015 ◽  
Vol 6 (2) ◽  
pp. 37-51 ◽  
Author(s):  
Vinh-Tiep Nguyen ◽  
Thanh Duc Ngo ◽  
Minh-Triet Tran ◽  
Duy-Dinh Le ◽  
Duc Anh Duong
Keyword(s):  
Image Retrieval ◽  
Large Scale ◽  
Spatial Information ◽  
Real Life ◽  
Inverted Index ◽  
Bag Of Words ◽  
Visual Words ◽  
Benchmark Datasets ◽  
Large Scale Image Retrieval ◽  
Inverted Indexing

Large-scale image retrieval has been shown remarkable potential in real-life applications. The standard approach is based on Inverted Indexing, given images are represented using Bag-of-Words model. However, one major limitation of both Inverted Index and Bag-of-Words presentation is that they ignore spatial information of visual words in image presentation and comparison. As a result, retrieval accuracy is decreased. In this paper, the authors investigate an approach to integrate spatial information into Inverted Index to improve accuracy while maintaining short retrieval time. Experiments conducted on several benchmark datasets (Oxford Building 5K, Oxford Building 5K+100K and Paris 6K) demonstrate the effectiveness of our proposed approach.

scholarly journals Multiple-Membership Survival Analysis and Its Applications in Organizational Behavior and Management Research

2019 ◽  
pp. 109442811987745
Author(s):  
Hans Tierens ◽  
Nicky Dries ◽  
Mike Smet ◽  
Luc Sels
Keyword(s):  
Organizational Behavior ◽  
Large Scale ◽  
Model Building ◽  
Real Life ◽  
Hierarchical Structures ◽  
Survival Model ◽  
Survival Models ◽  
Data Set ◽  
Potential Applications ◽  
Multiple Membership

Multilevel paradigms have permeated organizational research in recent years, greatly advancing our understanding of organizational behavior and management decisions. Despite the advancements made in multilevel modeling, taking into account complex hierarchical structures in data remains challenging. This is particularly the case for models used for predicting the occurrence and timing of events and decisions—often referred to as survival models. In this study, the authors construct a multilevel survival model that takes into account subjects being nested in multiple environments—known as a multiple-membership structure. Through this article, the authors provide a step-by-step guide to building a multiple-membership survival model, illustrating each step with an application on a real-life, large-scale, archival data set. Easy-to-use R code is provided for each model-building step. The article concludes with an illustration of potential applications of the model to answer alternative research questions in the organizational behavior and management fields.

Models, Practices and Methods of Reading: Evolution in Time and Space

2009 ◽  
pp. 59-64
Author(s):  
Yulia P. Melentyeva
Keyword(s):  
Large Scale ◽  
Social Groups ◽  
National Program ◽  
Time And Space ◽  
Lack Of Information ◽  
The Individual

In recent years as public in general and specialist have been showing big interest to the matters of reading. According to discussion and launch of the “Support and Development of Reading National Program”, many Russian libraries are organizing the large-scale events like marathons, lecture cycles, bibliographic trainings etc. which should draw attention of different social groups to reading. The individual forms of attraction to reading are used much rare. To author’s mind the main reason of such an issue has to be the lack of information about forms and methods of attraction to reading.

Materialities of Political Commitment?

2018 ◽  
Author(s):  
David Fearn
Keyword(s):  
Material Culture ◽  
Lyric Poetry ◽  
Political Engagement ◽  
The Political ◽  
Political Commitment ◽  
Cultural Significance ◽  
Time And Space ◽  
Theoretical Perspectives

Eschewing historicist certainties, this chapter reassesses the political salience of Alcaeus’ lyric poetry by investigating his literary contribution to sympotic culture. Placing Alcaeus’ politically engaged voices within recent theoretical perspectives on deixis, ecphrasis, and the distinctiveness of lyric as a literary mode, the chapter argues that Alcaeus makes a systematic issue of the question of the accessibility of the contexts gestured towards, and in so doing opens up as an alluring prospect the idea of political engagement through literature. The literary and cultural significance of proverbial statements in Alcaeus is also discussed. Alcaeus’ lyric claims are felt across time and space via their special foregrounding of both material culture and political engagement, through performance and reception.

scholarly journals Neural methods for effective, efficient, and exposure-aware information retrieval

2021 ◽  
Vol 55 (1) ◽  
pp. 1-2
Author(s):  
Bhaskar Mitra
Keyword(s):  
Information Retrieval ◽  
Language Processing ◽  
Large Scale ◽  
Web Search ◽  
Real Life ◽  
Inverted Index ◽  
Information Need ◽  
Product Model ◽  
Performance Improvements ◽  
Deep Model

Neural networks with deep architectures have demonstrated significant performance improvements in computer vision, speech recognition, and natural language processing. The challenges in information retrieval (IR), however, are different from these other application areas. A common form of IR involves ranking of documents---or short passages---in response to keyword-based queries. Effective IR systems must deal with query-document vocabulary mismatch problem, by modeling relationships between different query and document terms and how they indicate relevance. Models should also consider lexical matches when the query contains rare terms---such as a person's name or a product model number---not seen during training, and to avoid retrieving semantically related but irrelevant results. In many real-life IR tasks, the retrieval involves extremely large collections---such as the document index of a commercial Web search engine---containing billions of documents. Efficient IR methods should take advantage of specialized IR data structures, such as inverted index, to efficiently retrieve from large collections. Given an information need, the IR system also mediates how much exposure an information artifact receives by deciding whether it should be displayed, and where it should be positioned, among other results. Exposure-aware IR systems may optimize for additional objectives, besides relevance, such as parity of exposure for retrieved items and content publishers. In this thesis, we present novel neural architectures and methods motivated by the specific needs and challenges of IR tasks. We ground our contributions with a detailed survey of the growing body of neural IR literature [Mitra and Craswell, 2018]. Our key contribution towards improving the effectiveness of deep ranking models is developing the Duet principle [Mitra et al., 2017] which emphasizes the importance of incorporating evidence based on both patterns of exact term matches and similarities between learned latent representations of query and document. To efficiently retrieve from large collections, we develop a framework to incorporate query term independence [Mitra et al., 2019] into any arbitrary deep model that enables large-scale precomputation and the use of inverted index for fast retrieval. In the context of stochastic ranking, we further develop optimization strategies for exposure-based objectives [Diaz et al., 2020]. Finally, this dissertation also summarizes our contributions towards benchmarking neural IR models in the presence of large training datasets [Craswell et al., 2019] and explores the application of neural methods to other IR tasks, such as query auto-completion.

Machine Learning Based Assembly of Fragments of Ancient Papyrus

2021 ◽  
Vol 14 (3) ◽  
pp. 1-21
Author(s):  
Roy Abitbol ◽  
Ilan Shimshoni ◽  
Jonathan Ben-Dov
Keyword(s):  
Machine Learning ◽  
Spatial Information ◽  
Real Life ◽  
Dead Sea ◽  
Machine Learning Techniques ◽  
Automated Classification ◽  
Learning Techniques ◽  
Test Batch ◽  
Validation Set ◽  
Local Edge

The task of assembling fragments in a puzzle-like manner into a composite picture plays a significant role in the field of archaeology as it supports researchers in their attempt to reconstruct historic artifacts. In this article, we propose a method for matching and assembling pairs of ancient papyrus fragments containing mostly unknown scriptures. Papyrus paper is manufactured from papyrus plants and therefore portrays typical thread patterns resulting from the plant’s stems. The proposed algorithm is founded on the hypothesis that these thread patterns contain unique local attributes such that nearby fragments show similar patterns reflecting the continuations of the threads. We posit that these patterns can be exploited using image processing and machine learning techniques to identify matching fragments. The algorithm and system which we present support the quick and automated classification of matching pairs of papyrus fragments as well as the geometric alignment of the pairs against each other. The algorithm consists of a series of steps and is based on deep-learning and machine learning methods. The first step is to deconstruct the problem of matching fragments into a smaller problem of finding thread continuation matches in local edge areas (squares) between pairs of fragments. This phase is solved using a convolutional neural network ingesting raw images of the edge areas and producing local matching scores. The result of this stage yields very high recall but low precision. Thus, we utilize these scores in order to conclude about the matching of entire fragments pairs by establishing an elaborate voting mechanism. We enhance this voting with geometric alignment techniques from which we extract additional spatial information. Eventually, we feed all the data collected from these steps into a Random Forest classifier in order to produce a higher order classifier capable of predicting whether a pair of fragments is a match. Our algorithm was trained on a batch of fragments which was excavated from the Dead Sea caves and is dated circa the 1st century BCE. The algorithm shows excellent results on a validation set which is of a similar origin and conditions. We then tried to run the algorithm against a real-life set of fragments for which we have no prior knowledge or labeling of matches. This test batch is considered extremely challenging due to its poor condition and the small size of its fragments. Evidently, numerous researchers have tried seeking matches within this batch with very little success. Our algorithm performance on this batch was sub-optimal, returning a relatively large ratio of false positives. However, the algorithm was quite useful by eliminating 98% of the possible matches thus reducing the amount of work needed for manual inspection. Indeed, experts that reviewed the results have identified some positive matches as potentially true and referred them for further investigation.

scholarly journals Multi-GPU approach to global induction of classification trees for large-scale data mining

2021 ◽  
Author(s):  
Krzysztof Jurczuk ◽  
Marcin Czajkowski ◽  
Marek Kretowski
Keyword(s):  
Data Mining ◽  
Large Scale ◽  
Real Life ◽  
Population Based ◽  
Tree Structure ◽  
Global Approach ◽  
Data Parallel ◽  
Large Scale Data ◽  
The Impact ◽  
Scale Data

AbstractThis paper concerns the evolutionary induction of decision trees (DT) for large-scale data. Such a global approach is one of the alternatives to the top-down inducers. It searches for the tree structure and tests simultaneously and thus gives improvements in the prediction and size of resulting classifiers in many situations. However, it is the population-based and iterative approach that can be too computationally demanding to apply for big data mining directly. The paper demonstrates that this barrier can be overcome by smart distributed/parallel processing. Moreover, we ask the question whether the global approach can truly compete with the greedy systems for large-scale data. For this purpose, we propose a novel multi-GPU approach. It incorporates the knowledge of global DT induction and evolutionary algorithm parallelization together with efficient utilization of memory and computing GPU’s resources. The searches for the tree structure and tests are performed simultaneously on a CPU, while the fitness calculations are delegated to GPUs. Data-parallel decomposition strategy and CUDA framework are applied. Experimental validation is performed on both artificial and real-life datasets. In both cases, the obtained acceleration is very satisfactory. The solution is able to process even billions of instances in a few hours on a single workstation equipped with 4 GPUs. The impact of data characteristics (size and dimension) on convergence and speedup of the evolutionary search is also shown. When the number of GPUs grows, nearly linear scalability is observed what suggests that data size boundaries for evolutionary DT mining are fading.

scholarly journals Robots for Elderly Care in the Home: A Landscape Analysis and Co-Design Toolkit

2021 ◽  
Author(s):  
Gianluca Bardaro ◽  
Alessio Antonini ◽  
Enrico Motta
Keyword(s):  
Large Scale ◽  
Daily Life ◽  
Elderly Care ◽  
Real Life ◽  
Robotic Platform ◽  
Holistic View ◽  
Personal Assistants ◽  
Healthcare Interventions ◽  
The Impact ◽  
The Eu

AbstractOver the last two decades, several deployments of robots for in-house assistance of older adults have been trialled. However, these solutions are mostly prototypes and remain unused in real-life scenarios. In this work, we review the historical and current landscape of the field, to try and understand why robots have yet to succeed as personal assistants in daily life. Our analysis focuses on two complementary aspects: the capabilities of the physical platform and the logic of the deployment. The former analysis shows regularities in hardware configurations and functionalities, leading to the definition of a set of six application-level capabilities (exploration, identification, remote control, communication, manipulation, and digital situatedness). The latter focuses on the impact of robots on the daily life of users and categorises the deployment of robots for healthcare interventions using three types of services: support, mitigation, and response. Our investigation reveals that the value of healthcare interventions is limited by a stagnation of functionalities and a disconnection between the robotic platform and the design of the intervention. To address this issue, we propose a novel co-design toolkit, which uses an ecological framework for robot interventions in the healthcare domain. Our approach connects robot capabilities with known geriatric factors, to create a holistic view encompassing both the physical platform and the logic of the deployment. As a case study-based validation, we discuss the use of the toolkit in the pre-design of the robotic platform for an pilot intervention, part of the EU large-scale pilot of the EU H2020 GATEKEEPER project.

scholarly journals Stacked Community Prediction: A Distributed Stacking-Based Community Extraction Methodology for Large Scale Social Networks

2021 ◽  
Vol 5 (1) ◽  
pp. 14
Author(s):  
Christos Makris ◽  
Georgios Pispirigos
Keyword(s):  
Social Networks ◽  
Graph Partitioning ◽  
Large Scale ◽  
Real Life ◽  
Information Networks ◽  
Digital Marketing ◽  
Partitioning Problems ◽  
Iterative Solutions ◽  
Community Extraction ◽  
Stability And Accuracy

Nowadays, due to the extensive use of information networks in a broad range of fields, e.g., bio-informatics, sociology, digital marketing, computer science, etc., graph theory applications have attracted significant scientific interest. Due to its apparent abstraction, community detection has become one of the most thoroughly studied graph partitioning problems. However, the existing algorithms principally propose iterative solutions of high polynomial order that repetitively require exhaustive analysis. These methods can undoubtedly be considered resource-wise overdemanding, unscalable, and inapplicable in big data graphs, such as today’s social networks. In this article, a novel, near-linear, and highly scalable community prediction methodology is introduced. Specifically, using a distributed, stacking-based model, which is built on plain network topology characteristics of bootstrap sampled subgraphs, the underlined community hierarchy of any given social network is efficiently extracted in spite of its size and density. The effectiveness of the proposed methodology has diligently been examined on numerous real-life social networks and proven superior to various similar approaches in terms of performance, stability, and accuracy.

Sign in / Sign up

Export Citation Format

Share Document