Indoor landmark-based path-finding utilising the expanded connectivity of an endpoint partition

2016 ◽  
Vol 45 (2) ◽  
pp. 233-252
Author(s):  
Pepijn Viaene ◽  
Alain De Wulf ◽  
Philippe De Maeyer
Keyword(s):  
Visual Information ◽  
Spatial Configuration ◽  
Shortest Paths ◽  
Minimal Amount ◽  
Path Finding ◽  
Breadth First Search ◽  
Length Increase ◽  
Efficient Communication ◽  
Indoor Wayfinding

Landmarks are ideal wayfinding tools to guide a person from A to B as they allow fast reasoning and efficient communication. However, very few path-finding algorithms start from the availability of landmarks to generate a path. In this paper, which focuses on indoor wayfinding, a landmark-based path-finding algorithm is presented in which the endpoint partition is proposed as spatial model of the environment. In this model, the indoor environment is divided into convex sub-shapes, called e-spaces, that are stable with respect to the visual information provided by a person’s surroundings (e.g. walls, landmarks). The algorithm itself implements a breadth-first search on a graph in which mutually visible e-spaces suited for wayfinding are connected. The results of a case study, in which the calculated paths were compared with their corresponding shortest paths, show that the proposed algorithm is a valuable alternative for Dijkstra’s shortest path algorithm. It is able to calculate a path with a minimal amount of actions that are linked to landmarks, while the path length increase is comparable to the increase observed when applying other path algorithms that adhere to natural wayfinding behaviour. However, the practicability of the proposed algorithm is highly dependent on the availability of landmarks and on the spatial configuration of the building.

Management of Optic Neuritis in Ayurveda - A Special Case Report

2018 ◽  
Vol 3 (5) ◽  
Author(s):  
Dr. Harsha S. ◽  
Dr. Mamatha KV.
Keyword(s):  
Optic Nerve ◽  
Optic Neuritis ◽  
Visual Information ◽  
Vision Loss ◽  
Specific Treatment ◽  
Interesting Case ◽  
Treatment Modalities ◽  
Further Development ◽  
Special Case

The optic nerve carries visual information from your eye to your brain. Optic neuritis is when your optic nerve becomes inflamed. Optic neuritis can flare up suddenly from an infection or nerve disease. The inflammation usually causes temporary vision loss that typically happens in only one eye. Those with Optic neuritis sometimes experience pain. As you recover and the inflammation goes away, your vision will likely return. There are no direct references in our classics regarding optic neuritis but can be contemplated as a condition by name Parimlayi Timira. The specific management as such is not cited but a transcendence approach can be done with adopting the treatment which has the ability to pacify the already occurred pathology and prevent the further development of the disease. One such interesting case study on Optic neuritis is elaborated here where in specific treatment modalities (Shodana, Shamana and Kriyakalpas) played role in pacifying the condition.

Computer algorithms

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Data Structures ◽  
Analysis Of Algorithms ◽  
Shortest Paths ◽  
Minimum Cut ◽  
Network Data ◽  
Computer Algorithms ◽  
Breadth First Search ◽  
Augmenting Path ◽  
Basic Concepts ◽  
Maximum Flows

This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut sets, and independent paths in networks.

scholarly journals A stochastic programming approach for Shelter location and evacuation planning

2018 ◽  
Vol 52 (3) ◽  
pp. 779-805 ◽  
Author(s):  
Vedat Bayram ◽  
Hande Yaman
Keyword(s):  
Stochastic Programming ◽  
Shortest Paths ◽  
Evacuation Planning ◽  
Programming Approach ◽  
Mean Values ◽  
The Road ◽  
Traffic Allocation ◽  
Evacuation Plan ◽  
Allocation Decisions

Shelter location and traffic allocation decisions are critical for an efficient evacuation plan. In this study, we propose a scenario-based two-stage stochastic evacuation planning model that optimally locates shelter sites and that assigns evacuees to nearest shelters and to shortest paths within a tolerance degree to minimize the expected total evacuation time. Our model considers the uncertainty in the evacuation demand and the disruption in the road network and shelter sites. We present a case study for a potential earthquake in Istanbul. We compare the performance of the stochastic programming solutions to solutions based on single scenarios and mean values.

scholarly journals Introducing an Educational Tool for Learning Branch & Bound Strategy

2017 ◽  
Vol 3 (1) ◽  
pp. 8 ◽  
Author(s):  
Sofriesilero Zumaytis ◽  
Oscar Karnalim
Keyword(s):  
Qualitative Evaluation ◽  
Performance Comparison ◽  
Brute Force ◽  
Educational Tool ◽  
Breadth First Search ◽  
Cost Matrix ◽  
Algorithm Visualization ◽  
Case Based

Abstract—According to our informal survey, Branch & Bound strategy is considerably difficult to learn compared to other strategies. This strategy consists of several complex algorithmic steps such as Reduced Cost Matrix (RCM) calculation and Breadth First Search. Thus, to help students understanding this strategy, AP-BB, an educational tool for learning Branch & Bound is developed. This tool includes four modules which are Brute Force solving visualization, Branch & Bound solving visualization, RCM calculator, and case-based performance comparison. These modules are expected to enhance student’s understanding about Branch & Bound strategy and its characteristics. Furthermore, our work incorporates TSP as its case study and Brute Force strategy as a baseline to provide a concrete impact of Branch & Bound strategy. According to our qualitative evaluation, AP-BB and all of its features fulfil student necessities for learning Branch & Bound strategy. Keywords— Educational Tool; Branch & Bound; Algorithm Strategy; Algorithm Visualization

scholarly journals PLANNING OF PRIVATE GATED DEVELOPMENT: AN ANALYSIS OF GATED VS NON-GATED NEIGHBOURHOODS, CITY OF GURUGRAM, INDIA

2019 ◽  
Vol 17 ◽  
Author(s):  
Ajay Kaushik
Keyword(s):  
Urban Landscape ◽  
Spatial Configuration ◽  
Space Syntax ◽  
Gated Community ◽  
Neighbourhood Environment ◽  
Scholarly Literature ◽  
The World ◽  
Recent Trends ◽  
The City

The cities are expanding rapidly all over the world. India has also experienced this phenomenon and has continued the pace of growth. The recent trends in spatial growth of the cities are a new phenomenon in Indian urban landscape. The cities in India are witnessing development with the help of private developers for the last couple of decades. Being private properties these are by nature of exercising control have gates and boundaries. In scholarly literature these are called as Gated Community/Gated Development. Authors have argued them from various perspectives of anthropology, law, management and sociology etc. but very little has been discussed about their planning and morphology. Although, the rise of Gated Development is majorly attributed to the sense of fear and need for security, yet architects and urban designers, and even sociologist stress upon other methods to make the neighbourhoods secured. Hence the security aspects are not made part of the research here. The aspects of how these gated development impacts the perception of neighbourhood by residents is not touched upon. The paper discusses the distinction between the gated and non-gated neighbourhoods and also how residents perceive their neighbourhoods at large. For explaining this phenomenon, three neighbourhoods in the city of Gurugram in Haryana state in India have been identified as case study. These are identified on the basis of different morphological images that are identified. Space syntax and space cognition through sketch mapping is used for the analysis of the three neighbourhoods. The paper suggest that the continuity and connectivity of any spatial configuration is of utmost importance to make neighbourhood environment worthy of living life more socially connected.

scholarly journals The Reconfiguration of the Theatre Space and the Relationship between Public and Private in the Case of Apartment Theatre

2017 ◽  
Vol 18 (3) ◽  
pp. 77
Author(s):  
Andreea Gabriela Lupu
Keyword(s):  
Empirical Investigation ◽  
Spatial Configuration ◽  
Participant Observation ◽  
Domestic Space ◽  
Public And Private ◽  
The Public ◽  
Artistic Production ◽  
The Relationship ◽  
Artistic Product

<p>This article tackles the means of theatre space reconfiguration in the apartment theater (<em>lorgean theater</em>), simultaneously analyzing the relation between public and private specific to this form of art. Structured around both a theoretical analysis and a qualitative empirical investigation, this paper emphasizes the traits of the theatre space as component of an artistic product received by the audience, and its value in the process of artistic production, within the theatre sector. The case study of <em>lorgean theater, </em>including a participant observation and an individual interview, enables the understanding of these two aspects of the spatial configuration, emphasizing its hybrid nature in terms of spatial configuration and the public-private relation as well as the act of reappropriation of the domestic space through an alternative practice of theatre consumption.</p>

scholarly journals The Number of Moves of the Largest Disc in Shortest Paths on Hanoi Graphs

10.37236/4252 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Simon Aumann ◽  
Katharina A.M. Götz ◽  
Andreas M. Hinz ◽  
Ciril Petr
Keyword(s):  
Shortest Paths ◽  
General Setting ◽  
Optimal Number ◽  
Numerical Results ◽  
Breadth First Search ◽  
Tower Of Hanoi ◽  
Optimal Paths ◽  
Widespread Interest ◽  
Binary Strings

In contrast to the widespread interest in the Frame-Stewart conjecture (FSC) about the optimal number of moves in the classical Tower of Hanoi task with more than three pegs, this is the first study of the question of investigating shortest paths in Hanoi graphs $H_p^n$ in a more general setting. Here $p$ stands for the number of pegs and $n$ for the number of discs in the Tower of Hanoi interpretation of these graphs. The analysis depends crucially on the number of largest disc moves (LDMs). The patterns of these LDMs will be coded as binary strings of length $p-1$ assigned to each pair of starting and goal states individually. This will be approached both analytically and numerically. The main theoretical achievement is the existence, at least for all $n\geqslant p(p-2)$, of optimal paths where $p-1$ LDMs are necessary. Numerical results, obtained by an algorithm based on a modified breadth-first search making use of symmetries of the graphs, lead to a couple of conjectures about some cases not covered by our ascertained results. These, in turn, may shed some light on the notoriously open FSC.

scholarly journals The forest or the trees: preference for global over local image processing is reversed by prior experience in honeybees

2015 ◽  
Vol 282 (1799) ◽  
pp. 20142384 ◽  
Author(s):  
Aurore Avarguès-Weber ◽  
Adrian G. Dyer ◽  
Noha Ferrah ◽  
Martin Giurfa
Keyword(s):  
Visual Processing ◽  
Visual Information ◽  
Visual Recognition ◽  
Spatial Configuration ◽  
Local Information ◽  
Insect Vision ◽  
Hierarchical Stimuli ◽  
Spatial Configurations ◽  
Holistic Perception ◽  
Local Cues

Traditional models of insect vision have assumed that insects are only capable of low-level analysis of local cues and are incapable of global, holistic perception. However, recent studies on honeybee ( Apis mellifera ) vision have refuted this view by showing that this insect also processes complex visual information by using spatial configurations or relational rules. In the light of these findings, we asked whether bees prioritize global configurations or local cues by setting these two levels of image analysis in competition. We trained individual free-flying honeybees to discriminate hierarchical visual stimuli within a Y-maze and tested bees with novel stimuli in which local and/or global cues were manipulated. We demonstrate that even when local information is accessible, bees prefer global information, thus relying mainly on the object's spatial configuration rather than on elemental, local information. This preference can be reversed if bees are pre-trained to discriminate isolated local cues. In this case, bees prefer the hierarchical stimuli with the local elements previously primed even if they build an incorrect global configuration. Pre-training with local cues induces a generic attentional bias towards any local elements as local information is prioritized in the test, even if the local cues used in the test are different from the pre-trained ones. Our results thus underline the plasticity of visual processing in insects and provide new insights for the comparative analysis of visual recognition in humans and animals.

Framework for metaphor-based spatial configuration design: a case study of Japanese rock gardens

2019 ◽  
Vol 34 (2) ◽  
pp. 223-232
Author(s):  
Yuval Kahlon ◽  
Haruyuki Fujii
Keyword(s):  
Design Process ◽  
Spatial Configuration ◽  
Configuration Design ◽  
Design Phase ◽  
Rock Composition ◽  
Conceptual Design Phase ◽  
Spatial Configurations ◽  
Visual Potential ◽  
Alternative Designs

AbstractMetaphors are powerful tools for design, enabling designers to encapsulate sets of properties and relations as short verbal descriptions. This paper aims to clarify how simple spatial configurations may emerge from concise metaphoric descriptions at the conceptual design phase. To this aim, we propose a framework for a metaphor-based design process. As a basis for the framework, we introduce the concept of “complementary visual potential” – a property which ties the spatial configuration of the objects in the composition with their metaphoric roles. The framework is developed by studying the practice of metaphor-based spatial configuration design in Japanese rock gardens. Accordingly, it is implemented and tested in this context by attempting to generate alternative designs for an existing rock composition in the famous garden of Ryōan-ji. This is followed by a discussion of its possible implications and potential for generalization to other areas of design.

Understanding the use of ground-penetrating radar for assessing clandestine tunnel detection

2019 ◽  
Vol 38 (6) ◽  
pp. 453-459
Author(s):  
Nectaria Diamanti ◽  
A. Peter Annan
Keyword(s):  
Ground Penetrating Radar ◽  
Minimal Amount ◽  
Operational Environment ◽  
Field Case ◽  
Tunnel Detection ◽  
Specific Focus ◽  
Key Aspects ◽  
Ground Penetrating

We provide a coherent approach for developing an understanding of how and where ground-penetrating radar (GPR) can be deployed for tunnel detection. While tunnels in general are of interest, the more specific focus is tunnels that are hand dug or created with a minimal amount of equipment and resources for clandestine purposes. Determining whether GPR can be used for tunnel detection is impossible without an in-depth knowledge of the operational environment and constraints. To effectively address the question, we define the general characteristics of clandestine tunnels, discuss how to estimate the responses amplitude, define the dominant noise types associated with GPR data, and point out how those factors are affected by the GPR system. The key aspects are illustrated using a controlled field case study.

Sign in / Sign up

Export Citation Format

Share Document