pgRouting 2.0 presentation 2013

•

3 likes•7,029 views

In 2013 pgRouting was presentated at three FOSS4G events, in Nottingham, Tokyo and Osaka. In case you have missed them all, take a look at the presentation slides.

Technology

An Extension for
PostgreSQL / PostGIS,
...

Feature Highlights
➔ Two new All Pairs Short Path algorithms
➔ Bi-directional Dijkstra and A-star algorithms
➔ One to many nodes shortest path search
➔ New TSP solver (with distance matrix)
➔ Turn Restricted shortest path (replaces Shooting
Star algorithm)
➔ A collection of useful utility and graph analytics
functions

More Highlights
➔ Modular library design
➔ Unit tests and automated tests with Travis
➔ Compatibility with PostgreSQL 9.1+ / PostGIS 2.0+
➔ Installs as PostgreSQL EXTENSION
➔ Added pgr_ prefix to functions and types
➔ Improved build process for Windows
➔ Better documentation in several languages
https://www.transifex.com/projects/p/pgrouting/

Big THANK YOU to
- Steve Woodbridge

- Regina Obe

… and the pgRouting community!

Most users need pgRouting for

Road Networks
How do they look like?

What makes them real?

Traffic lights

Signs

Road marking

pgRouting

extends

PostgreSQL/PostGIS
What does this mean?

SQL Function
SELECT * FROM pgr_dijkstra('
SELECT gid as id,
source::integer,
target::integer,
length::float8 as cost
FROM ways',
30, 60, false, false);

Query Result
seq | node | edge |
cost
-----+------+------+--------------------0 |
30 |
53 | 0.0591267653820616
1 |
44 |
52 | 0.0665408320949312
2 |
14 |
15 | 0.0809556879332114
3 |
13 |
14 |
0.072694271986776
4 |
12 |
13 |
0.081239348480584
5 |
11 |
12 | 0.00746935522787469
6 |
10 | 6869 | 0.0164274192597773
7 |
59 |
72 | 0.0109385169537801
8 |
60 |
-1 |
0
(9 rows)

gid,
source,
target,
cost,
reverse_cost,
x1, y1,
x2, y2,
rule,
to_cost

source

target

Traffic lights slow down

… so costs must increase.

B

C
1 min

A
cost(A) = cost(A) + 30sec
cost(B) = cost(B) + 30sec
cost(C) = cost(C) + 30sec
cost(D) = cost(D) + 30sec

D

Signs inform about
restrictions and rules

cost(A) = length(A)
reverse_cost(A) = ∞

A

Sometimes
the costs
have different
meaning.

cost(A) = length(A) / 2
reverse_cost(A) = length(A) * 4

B

A

Road type
can be used
for cost
calculation.

And you know
what is great about pgRouting?

All costs are dynamic!
… which is the opposite to pre-calculated

… there is a sign with
restrictions limited
to a certain time, ...

You don't need to
rebuild and reload
your network

You only need to adjust the cost
for this particular road,
… and the next search will go another way.

pgRouting can be used for
different kinds of networks

Roadmap for Version 2.1
➔ Add “Multi-modal public transit routing”
(GSoC 2011)
➔ Add “Time dependent shortest path” algorithm
(GSoC 2011)
➔ Add “Two Queue” Algorithm (GSoC 2012)
➔ Add DARP and VRP (GSoC 2013)
➔ Add Graph network partitioning (GSoC 2013)
➔ …. further improvements and bug fixes.

More Information
Website:

pgrouting.org

Documentation:
Workshop:
日本語 NEW
Support:

docs.pgrouting.org
workshop.pgrouting.org
workshop.pgrouting.org/ja
pgrouting.org/support.html

… or talk contact us directly:
➔ Daniel Kastl daniel@georepublic.co.jp
➔ Hal Seki hal@georepublic.co.jp

Photos from sxc.hu and
flickr under Creative Commons Licence.

What's hot

Geohash in mapping applications

Alex Tumanoff

Bellman ford algorithm

AnuragChaudhary70

Andrew Goldberg. Highway Dimension and Provably Efficient Shortest Path Algor...

Computer Science Club

As the amount of metrics, software that produce and process them, and people involved in them continue to increase, we need better ways to organize them, to make them self-describing, and do so in a way that is consistent. Leveraging this, we can then automatically build graphs and dashboards, given a query that represents an information need, even for complicated cases. We can build richer visualizations, alerting and fault detection. This talk will introduce the concepts and related tools, demonstrate possibilities using the Graph-Explorer interface, and lay the groundwork for future work.

Rethinking metrics: metrics 2.0 @ Lisa 2014

Dieter Plaetinck

Presentation: Plotting Systems in R

Ilya Zhbannikov

Matlab Visualizing Data

DataminingTools Inc

Inspired by the movement of the particles in the atom, I demonstrated in [5] the existence of a polynomial algorithm of the order O(n 3 ) for finding Hamiltonian cycles in a graph with basis E= {x0,... , xn− 1 } . In this article I will give an improvement in space and in time of the algorithm says: we know that there exist several methods to find the Hamiltonian cycles such as the Monte Carlo method, Dynamic programming, or DNA computing. Unfortunately they are either expensive or slow to execute it. Hence the idea to use multiple servers to solve this problem : Each point xi in the graph will be considered as a server, and each server xi will communicate with each other server x j with which it is connected . And finally the server x0 will receive and display the Hamiltonian cycles if they exist

Atomic algorithm and the servers' s use to find the Hamiltonian cycles

IJERA Editor

General Programming on the GPU - Confoo

SirKetchup

In this Technical era the high speed and low area of VLSI chip are very- very essential factors. Day by day number of transistors and other active and passive elements are growing on VLSI chip. In Integral part of the processor adders play an important role. In this paper we are using proposed kogge-stone adders for binary addition to reduce the size and increase the efficiency or processors speed. Proposing kogge stone adder provides less components, less path delay and better speed compare to other existing kogge stone adder and other adders. Here we are comparing the kogge stone adders of different-different word size from other adders. The design and experiment can be done by the aid of Xilinx 14.1i Spartan 3 device family.

Design the High Speed Kogge-Stone Adder by Using

IJERA Editor

GC3 Beamer

Hirwanto Iwan

Rendering of Complex 3D Treemaps (GRAPP 2013)

Matthias Trapp

The concept of clipping planes is well known in computer graphics and can be used to create cut-away views. But clipping against just analytical defined planes is not always suitable for communicating every aspect of such visualization. For example, in hand-drawn technical illustrations, artists tend to communicate the difference between a cut and a model feature by using non-regular, sketchy cut lines instead of straight ones. To enable this functionality in computer graphics, this paper presents a technique for applying 2.5D clip-surfaces in real-time. Therefore, the clip plane equation is extended with an additional offset map, which can be represented by a texture map that contains height values. Clipping is then performed by varying the clip plane equation with respect to such an offset map. Further, a capping technique is proposed that enables the rendering of caps onto the clipped area to convey the impression of solid material. It avoids a re-meshing of a solid polygonal mesh after clipping is performed. Our approach is pixel precise, applicable in real-time, and takes fully advantage of graphics accelerators.

2.5D Clip-Surfaces for Technical Visualization

Matthias Trapp

For the full video of this presentation, please visit: https://www.embedded-vision.com/platinum-members/synopsys/embedded-vision-training/videos/pages/may-2017-embedded-vision-summit-michiels For more information about embedded vision, please visit: http://www.embedded-vision.com Tom Michiels, System Architect for Embedded Vision Processors at Synopsys, presents the "Moving CNNs from Academic Theory to Embedded Reality" tutorial at the May 2017 Embedded Vision Summit. In this presentation, you will learn to recognize and avoid the pitfalls of moving from an academic CNN/deep learning graph to a commercial embedded vision design. You will also learn about the cost vs. accuracy trade-offs of CNN bit width, about balancing internal memory size and external memory bandwidth, and about the importance of keeping data local to the CNN processor to improve bandwidth. Michaels also walks through an example customer design for a power- and cost-sensitive automotive scene segmentation application that requires high flexibility to adapt to future CNN graph evolutions.

"Moving CNNs from Academic Theory to Embedded Reality," a Presentation from S...

Edge AI and Vision Alliance

OL3-Cesium: 3D for OpenLayers maps

Andreas Hocevar

Model-counting Approaches For Nonlinear Numerical Constraints

Quoc-Sang Phan

Windows Phone

sunflat

Proof

thealanshow

ELECTRICAL POWER SYSTEMS ECONOMICS

MohammedMedani4

High-quality rendering of 3D virtual environments typically depends on high-quality 3D models with significant geometric complexity and texture data. One major bottleneck for real-time image-synthesis represents the number of state changes, which a specific rendering API has to perform. To improve performance, batching can be used to group and sort geometric primitives into batches to reduce the number of required state changes, whereas the size of the batches determines the number of required draw-calls, and therefore, is critical for rendering performance. For example, in the case of texture atlases, which provide an approach for efficient texture management, the batch size is limited by the efficiency of the texture-packing algorithm and the texture resolution itself. This paper presents a pre-processing approach and rendering technique that overcomes these limitations by further grouping textures or texture atlases and thus enables the creation of larger geometry batches. It is based on texture arrays in combination with an additional indexing schema that is evaluated at run-time using shader programs. This type of texture management is especially suitable for real-time rendering of large-scale texture-rich 3D virtual environments, such as virtual city and landscape models.

Geometry Batching Using Texture-Arrays

Matthias Trapp

Real-time or full-precision CRS imaging using a cloud computing portal: multi...

CRS4 Research Center in Sardinia

What's hot (20)

Geohash in mapping applications

Bellman ford algorithm

Andrew Goldberg. Highway Dimension and Provably Efficient Shortest Path Algor...

Rethinking metrics: metrics 2.0 @ Lisa 2014

Presentation: Plotting Systems in R

Matlab Visualizing Data

Atomic algorithm and the servers' s use to find the Hamiltonian cycles

General Programming on the GPU - Confoo

Design the High Speed Kogge-Stone Adder by Using

GC3 Beamer

Rendering of Complex 3D Treemaps (GRAPP 2013)

2.5D Clip-Surfaces for Technical Visualization

"Moving CNNs from Academic Theory to Embedded Reality," a Presentation from S...

OL3-Cesium: 3D for OpenLayers maps

Model-counting Approaches For Nonlinear Numerical Constraints

Windows Phone

Proof

ELECTRICAL POWER SYSTEMS ECONOMICS

Geometry Batching Using Texture-Arrays

Real-time or full-precision CRS imaging using a cloud computing portal: multi...

Similar to pgRouting 2.0 presentation 2013

Shortest Path Search with pgRouting

FOSS4G 2011

This presentation will show the inside and current state of pgRouting development. It will explain the shortest path search in real road networks and how the data structure is important for getting better routing results. We will show how you can improve the quality of the search with dynamic costs and make the result look closer to the reality. We will demonstrate the way of using pgRouting together with other Open Source tools. Also you will learn about difficulties and limitations of implementing routing functionality in GIS applications, the difference between algorithms and their performance. pgRouting is an extension of PostgreSQL and PostGIS. A predecessor of pgRouting - pgDijkstra, written by Sylvain Pasche from Camptocamp, was extended by Orkney (Japan) and renamed to pgRouting, which now is a part of the PostLBS project. pgRouting can perform: * shortest path search (with 3 different algorithms) * Traveling Salesperson Problem solution (TSP) * driving distance geometry calculation

Shortest path search for real road networks and dynamic costs with pgRouting

antonpa

141031_Lagrange Relaxation Based Method for the QoS Routing Problem

Eunice Lin

An open source multimodal journey planning system based on 'de facto' standards

Juangui Jordán

Slides from the Linux Conference Australia 2021 conference https://linux.conf.au/schedule/presentation/64/ . Tempesta TLS is an implementation of TLS handshakes for the Linux kernel. Since the kernel already provides symmetric ciphers, we focus on asymmetric cryptography only, elliptic curves in particular. Use used the mbed TLS library as the foundation and almost fully rewrote it to make is x40 faster. During our development we also use parts of WolfSSL library. While WolfSSL outperforms OpenSSL, it uses the same algorithms, which are 5-7 years of old. Tempesta TLS uses newer and more efficient algorithms from the modern cryptography research. While we still improving performance of Tempesta TLS, the implementation already establishes 40-80% more TLS handshakes per second than OpenSSL/Nginx and provides up to x4 lower latency in several tests. This talk covers following topics with plenty of benchmarks: * The fundamentals of elliptic curve computations and the most "hot spots" * Side channel attacks (SCA) and methods to prevent them * How the recent CPU vulnerabilities impact TLS handshakes * Basics of the new fast algorithms used in the Tempesta TLS * The design trade offs in OpenSSL, WolfSSL, mbed TLS, and Tempesta TLS

Mathematics and development of fast TLS handshakes

Alexander Krizhanovsky

Cs403 Parellel Programming Travelling Salesman Problem

Jishnu P

GPU_based Searching

jpawan33

Spanning Tree in data structure and .pptx

asimshahzad8611

Sigmod11 outsource shortest path

redhatdb

Algo labpresentation a_group

Umme habiba

dsa.pptx

18csjeyavarthini

Data Science is concerned with the analysis of large amounts of data. When the volume of data is really large, it requires the use of cooperating, distributed machines. The most popular method of doing this is Hadoop, a collection of programs to perform computations on connected machines in a cluster. Hadoop began life as an open-source implementation of MapReduce, an idea first developed and implemented by Google for its own clusters. Though Hadoop's MapReduce is Java-based, and quite complex, this talk focuses on the "streaming" facility, which allows Python programmers to use MapReduce in a clean and simple way. We will present the core ideas of MapReduce and show you how to implement a MapReduce computation using Python streaming. The presentation will also include an overview of the various components of the Hadoop "ecosystem." NYC Data Science Academy is excited to welcome Sam Kamin who will be presenting an Introduction to Hadoop for Python Programmers a well as a discussion of MapReduce with Streaming Python. Sam Kamin was a professor in the University of Illinois Computer Science Department. His research was in programming languages, high-performance computing, and educational technology. He taught a wide variety of courses, and served as the Director of Undergraduate Programs. He retired as Emeritus Associate Professor, and worked at Google until taking his current position as VP of Data Engineering in NYC Data Science Academy. -------------------------------------- Our fall 12-Week Data Science bootcamp starts on Sept 21st,2015. Apply now to get a spot! If you are hiring Data Scientists, call us at (1)888-752-7585 or reach info@nycdatascience.com to share your openings and set up interviews with our excellent students.

Streaming Python on Hadoop

Vivian S. Zhang

According to data compiled by the National Highway Traffic Safety Administration, in 2016, an average of ~100 people were killed in automobile accidents every day in the United States. Agero, a market leader in software-enabled driver assistance services, has responded to this growing problem with a breakthrough consumer app that provides near real-time driver behavior analysis and actionable insights to its users on how to become safer drivers. As part of this effort, we have developed a methodology to identify the most frequent routes that each driver travels by applying Dynamic Time Warping time-series analysis techniques to spatial data. In this talk, we will give a high-level overview of the methodology, and discuss the performance improvement achieved by transitioning the software from stand-alone Python into PySpark + Databricks. Discussion points will include how to determine the best way to (re)design Python functions to run in Spark, the development and use of user-defined functions in PySpark, how to integrate Spark data frames and functions into Python code, and how to use PySpark to perform ETL from AWS on very large datasets.

Automobile Route Matching with Dynamic Time Warping Using PySpark with Cather...

Databricks

NVIDIA CUDA

Jungsoo Nam

MapReduceAlgorithms.ppt

CheeWeiTan10

PL/CUDA - Fusion of HPC Grade Power with In-Database Analytics

Kohei KaiGai

Parallel prefix adder is a kind of process for speeding up the addition of the system of writing and calculating with numbers which use only two digits. Parallel prefix adders are also known as carry-tree adders and they are known to have the best performance in VLSI designs. Due to constraints on logic blog configurations a routing overhead, this performance advantage does not translate directly into FPGA implementations. Identifying the absolutely accurate area-delay tradeoff curve of the parallel prefix is an interesting problem that has received more attention in research because parallel prefix adder on the other hand represents a type of general adder structure that displays publically in flexible area-time tradeoffs for the design of adder. Many different types of parallel prefix adders are made to increase for optimizing area, fan out, speed and performance. For high speed performance tree like structure is must which helps in greater way. There are many different method used for designing parallel prefix adder based on their speed, size and performance. For area optimization we use Brent-Kung method. If our main purpose is to get the least timing then we have to use Kogg-Stone adder method.

Design Of 64-Bit Parallel Prefix VLSI Adder For High Speed Arithmetic Circuits

IJRES Journal

The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is categorized within the search algorithms. Its purpose is to discover the shortest-route, from the beginning node (origin node) to any node on the tracks, and is applied to both directional and undirected graphs. However, all edges must have non-negative values. The problem of organizing inter-city flights is one of the most important challenges facing airplanes and how to transport passengers and commercial goods between large cities in less time and at a lower cost. In this paper, the authors implement the Dijkstra algorithm to solve this complex problem and also to update it to see the shortest-route from the origin node (city) to the destination node (other cities) in less time and cost for flights using simulation environment. Such as, when graph nodes describe cities and edge route costs represent driving distances between cities that are linked with the direct road. The experimental results show the ability of the simulation to locate the most cost-effective route in the shortest possible time (seconds), as the test achieved 95% to find the suitable route for flights in the shortest possible time and whatever the number of cities on the tracks application.

Flight-schedule using Dijkstra's algorithm with comparison of routes findings

IJECEIAES

I'm one of maintainers of the open source TimeSeries database VictoriaMetrics, written in Go. It is used for APM or Kubernetes monitoring. The average VictoriaMetrics installation is processing 2-4 million samples/s on the ingestion path, 20-40 million samples/s on the read path. The biggest installations have more than 100 million samples/s on the ingestion path for a single cluster. This requires being clever with data processing to keep it efficient and scalable. In the talk, I'll cover the following optimizations for keeping the database fast: 1. String interning for lowering GC pressure. We use string interning for storing time series metadata (aka labels). However, this approach has downside of increased memory usage. When it is worth it to use string interning? 2. Metadata processing may require many regular expression matching and strings modification operations. Caching results of such operations helps to save CPU. But the downside could be increased memory usage. Which operations should be cached and which are not? 3. Limiting the number of concurrently running goroutines with CPU-bound load by the number of available CPU cores. This helps to control the memory usage on load spikes (which is a frequent event in monitoring). The limit also improves the processing speed of each goroutine, since it reduces the number of context switches. The downside of the approach is its complexity - it is easy to make a mistake and end up with a deadlock or inefficient resource utilization. 4. The better understanding of `sync.Pool`. For us, `sync.Pool` shows itself the best when used in CPU-bound code, while in IO-bound code it leads to excessive memory usage. The CPU-bound code has short ownership over the objects retrieved from the pool. In combination with p.3 (limited number of goroutines processing CPU-bound code) it gives the most efficient processing speed and memory usage since the chance to get a "hot" object from the pool is much higher.

Writing a TSDB from scratch_ performance optimizations.pdf

RomanKhavronenko

Dijkstra’S Algorithm

ami_01

Similar to pgRouting 2.0 presentation 2013 (20)

Shortest Path Search with pgRouting

Shortest path search for real road networks and dynamic costs with pgRouting

141031_Lagrange Relaxation Based Method for the QoS Routing Problem

An open source multimodal journey planning system based on 'de facto' standards

Mathematics and development of fast TLS handshakes

Cs403 Parellel Programming Travelling Salesman Problem

GPU_based Searching

Spanning Tree in data structure and .pptx

Sigmod11 outsource shortest path

Algo labpresentation a_group

dsa.pptx

Streaming Python on Hadoop

Automobile Route Matching with Dynamic Time Warping Using PySpark with Cather...

NVIDIA CUDA

MapReduceAlgorithms.ppt

PL/CUDA - Fusion of HPC Grade Power with In-Database Analytics

Design Of 64-Bit Parallel Prefix VLSI Adder For High Speed Arithmetic Circuits

Flight-schedule using Dijkstra's algorithm with comparison of routes findings

Writing a TSDB from scratch_ performance optimizations.pdf

Dijkstra’S Algorithm

More from Daniel Kastl

FOSS4G Software kann bei vielerlei Aufgaben mit Raumbezug helfen, Arbeitsabläufe zu verbessern und zu optimieren, und die Mitarbeiter bei Ihrer täglichen Arbeit zu entlasten. Dieser Vortrag stellt ein Konzept vor für "Location-based Task Management". Geschäftsleute müssen ihre Kunden besuchen, ambulantes Pflegepersonal Ihre Patienten. Städtische Mitarbeiter müssen in regelmäßigen Intervallen die öffentlichen Vermögenswerte und Infrastruktur überprüfen, usw.. Es gibt viele Beispiele aus dem Arbeitsalltag, bei denen Aufgaben einen besonderen Raumbezug haben. FOSS4G Software kann dabei helfen, diese Aufgaben zu organisieren und zu optimieren. Denn GIS Technologie bedeutet weit mehr, als ein paar farbige Marker auf einer Online-Karte darzustellen. Ortsbasierte Aufgaben durchlaufen in der Regel verschiedene Zustände, haben unterschiedlich hohe Prioritäten, können während der Bearbeitung an unterschiedliche Personen übertragen werden und folgen fast immer einem vordefinierten Ablauf. Mit der Optimierung von Arbeitsabläufen und Tourenplanung im Hinterkopf, und auf Grundlage verfügbarer Open-Source-Software und offenen Standards haben wir begonnen, eine Task-Management-Software zu entwickeln. In dieser Präsentation werden Sie Details zu unserem Konzept zu erfahren, und wie dies dazu beitragen kann, Dienstleistungen vor Ort zu erleichtern, die Servicequalität zu verbessern und die Effizienz zu steigern.

Location-based Task Management

Daniel Kastl

Diese Präsentation gibt einen Überblick über das pgRouting Projekt und den aktuellen Entwicklungsstand. Neben den bekannten "Shortest Path" Suchalgorithmen, Einzugsbereichsermittlung oder "Travelling Salesperson Problem" (TSP) Optimierung, erhalten Sie einen Ausblick und eine Einführung in die kommenden neuen Features wie den "Vehicle Routing Problem" (VRP) Algorithmus und ähnliche Werkzeuge zur Planung und Optimierung von Touren.

Routing in der Datenbank

Daniel Kastl

Solid-State Drives (SSDs) are recently becoming popular storage mediums in laptops, and are praised for their speed and shock resistance. However, there has been some debate over whether or not SSDs are ready for the data center. GIS software is known for its high demands on server hardware. Especially hard-drives became a bottleneck when serving map tiles, rendering map images or running spatial computations. SSDs seem to be one possibility to increase IO performance, but optimized server hardware is rare and still very expensive. We contacted a Korean maker specialising in high-performance SSD servers, mainly used to provide video-on-demand services, and we received two of their enterprise servers for testing and benchmarking with FOSS4G software. In this presentation we present our benchmarking results and explain the strong and weak points by comparing traditional hard-drives and solid-state disks.

Speed up your GIS server - run GIS software on solid-state drives (SSD)

Daniel Kastl

The Japanese OSM community had a very successful year 2010, a steadily growing community and lots of plans for 2011. We established the OSM Foundation Japan on Christmas 2010 and received a large donation of vector data. Right after the announcement Japan was hit by a 9.0 earthquake and a huge Tsunami, that killed thousands of people and devastated wide areas along the Pacific coast of Eastern Japan. This talk will explain how the earthquake changed the situation for OpenStreetMap in Japan, how priorities and plans shifted from one day to the next. Within a few hours the Humanitarian OSM Team and the local Japanese community were on hand to help. In a short time volunteers from various projects and communities helped to setup some infrastructure to collect, organize and distribute existing data sources, and to improve the coverage and quality of the available OpenStreetMap data. Furthermore you will hear about the difficulties and specific characteristics of mapping in Japan and how localized information and software is a crucial point for the success of OpenStreetMap.

OSM Japan before and after the Tsunami

Daniel Kastl

Where the streets have no name

Daniel Kastl

pgRouting (Deutsch)

Daniel Kastl

OpenVRP (Deutsch)

Daniel Kastl

The Open Vehicle Route Planner (OpenVRP) is the ideal routing optimization software for fleet management and transportation businesses. It minimizes operation costs, optimizes schedules, handles resources efficiently and maximizes the level service. OpenVRP Engine is built on top of PostgreSQL/PostGIS and its algorithms are part of pgRouting library. OpenVRP is Open Source software under GPL2 license.

OpenVRP Introduction

Daniel Kastl

Shortest Path Search in Real Road Networks with pgRouting

Daniel Kastl

More from Daniel Kastl (9)

Location-based Task Management

Routing in der Datenbank

Speed up your GIS server - run GIS software on solid-state drives (SSD)

OSM Japan before and after the Tsunami

Where the streets have no name

pgRouting (Deutsch)

OpenVRP (Deutsch)

OpenVRP Introduction

Shortest Path Search in Real Road Networks with pgRouting

Recently uploaded

How to Troubleshoot Apps for the Modern Connected Worker

ThousandEyes

Abhishek Deb(1), Mr Abdul Kalam(2) M. Des (UX) , School of Design, DIT University , Dehradun. This paper explores the future potential of AI-enabled smartphone processors, aiming to investigate the advancements, capabilities, and implications of integrating artificial intelligence (AI) into smartphone technology. The research study goals consist of evaluating the development of AI in mobile phone processors, analyzing the existing state as well as abilities of AI-enabled cpus determining future patterns as well as chances together with reviewing obstacles as well as factors to consider for more growth.

Exploring the Future Potential of AI-Enabled Smartphone Processors

debabhi2

As privacy and data protection regulations evolve rapidly, organizations operating in multiple jurisdictions face mounting challenges to ensure compliance and safeguard customer data. With state-specific privacy laws coming up in multiple states this year, it is essential to understand what their unique data protection regulations will require clearly. How will data privacy evolve in the US in 2024? How to stay compliant? Our panellists will guide you through the intricacies of these states' specific data privacy laws, clarifying complex legal frameworks and compliance requirements. This webinar will review: - The essential aspects of each state's privacy landscape and the latest updates - Common compliance challenges faced by organizations operating in multiple states and best practices to achieve regulatory adherence - Valuable insights into potential changes to existing regulations and prepare your organization for the evolving landscape

TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments

TrustArc

🐬 The future of MySQL is Postgres 🐘

RTylerCroy

BooK Now Call us at +918448380779 to hire a gorgeous and seductive call girl for sex. Take a Delhi Escort Service. The help of our escort agency is mostly meant for men who want sexual Indian Escorts In Delhi NCR. It should be noted that any impersonator will get 100 attention from our Young Girls Escorts in Delhi. They will assume the position of reliable allies. VIP Call Girl With Original Photos Book Tonight +918448380779 Our Cheap Price 1 Hour not available 2 Hours 5000 Full Night 8000 TAG: Call Girls in Delhi, Noida, Gurgaon, Ghaziabad, Connaught Place, Greater Kailash Delhi, Lajpat Nagar Delhi, Mayur Vihar Delhi, Chanakyapuri Delhi, New Friends Colony Delhi, Majnu Ka Tilla, Karol Bagh, Malviya Nagar, Saket, Khan Market, Noida Sector 18, Noida Sector 76, Noida Sector 51, Gurgaon Mg Road, Iffco Chowk Gurgaon, Rajiv Chowk Gurgaon All Delhi Ncr Free Home Deliver

08448380779 Call Girls In Greater Kailash - I Women Seeking Men

Delhi Call girls

GenCyber Cyber Security Day Presentation

Michael W. Hawkins

What are drone anti-jamming systems? The drone anti-jamming systems and anti-spoof technology protect against interference, jamming, and spoofing of the UAVs. To protect their security, countries are beginning to research drone anti-jamming systems, also known as drone strike weapons. The anti-jam and anti-spoof technology protects against interference, jamming and spoofing. A drone strike weapon is a drone attack weapon that can attack and destroy enemy drones. So what is so unique about this amazing system?

What Are The Drone Anti-jamming Systems Technology?

Antenna Manufacturer Coco

Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...

Neo4j

Sara Mae O’Brien Scott and Tatiana Baquero Cakici, Senior Consultants at Enterprise Knowledge (EK), presented “AI Fast Track to Search-Focused AI Solutions” at the Information Architecture Conference (IAC24) that took place on April 11, 2024 in Seattle, WA. In their presentation, O’Brien-Scott and Cakici focused on what Enterprise AI is, why it is important, and what it takes to empower organizations to get started on a search-based AI journey and stay on track. The presentation explored the complexities of enterprise search challenges and how IA principles can be leveraged to provide AI solutions through the use of a semantic layer. O’Brien-Scott and Cakici showcased a case study where a taxonomy, an ontology, and a knowledge graph were used to structure content at a healthcare workforce solutions organization, providing personalized content recommendations and increasing content findability. In this session, participants gained insights about the following: Most common types of AI categories and use cases; Recommended steps to design and implement taxonomies and ontologies, ensuring they evolve effectively and support the organization’s search objectives; Taxonomy and ontology design considerations and best practices; Real-world AI applications that illustrated the value of taxonomies, ontologies, and knowledge graphs; and Tools, roles, and skills to design and implement AI-powered search solutions.

IAC 2024 - IA Fast Track to Search Focused AI Solutions

Enterprise Knowledge

Strategies for Landing an Oracle DBA Job as a Fresher

Remote DBA Services

CNv6 Instructor Chapter 6 Quality of Service

giselly40

This presentations targets students or working professionals. You may know Google for search, YouTube, Android, Chrome, and Gmail, but did you know Google has many developer tools, platforms & APIs? This comprehensive yet still high-level overview outlines the most impactful tools for where to run your code, store & analyze your data. It will also inspire you as to what's possible. This talk is 50 minutes in length.

Powerful Google developer tools for immediate impact! (2023-24 C)

wesley chun

Imagine a world where information flows as swiftly as thought itself, making decision-making as fluid as the data driving it. Every moment is critical, and the right tools can significantly boost your organization’s performance. The power of real-time data automation through FME can turn this vision into reality. Aimed at professionals eager to leverage real-time data for enhanced decision-making and efficiency, this webinar will cover the essentials of real-time data and its significance. We’ll explore: FME’s role in real-time event processing, from data intake and analysis to transformation and reporting An overview of leveraging streams vs. automations FME’s impact across various industries highlighted by real-life case studies Live demonstrations on setting up FME workflows for real-time data Practical advice on getting started, best practices, and tips for effective implementation Join us to enhance your skills in real-time data automation with FME, and take your operational capabilities to the next level.

From Event to Action: Accelerate Your Decision Making with Real-Time Automation

Safe Software

08448380779 Call Girls In Diplomatic Enclave Women Seeking Men

Delhi Call girls

How to convert PDF to text with Nanonets

naman860154

The Raspberry Pi 5 was announced on October 2023. This new version of the popular embedded device comes with a new iteration of Broadcom’s VideoCore GPU platform, and was released with a fully open source driver stack, developed by Igalia. The presentation will discuss some of the major changes required to support this new Video Core iteration, the challenges we faced in the process and the solutions we provided in order to deliver conformant OpenGL ES and Vulkan drivers. The talk will also cover the next steps for the open source Raspberry Pi 5 graphics stack. (c) Embedded Open Source Summit 2024 April 16-18, 2024 Seattle, Washington (US) https://events.linuxfoundation.org/embedded-open-source-summit/ https://eoss24.sched.com/event/1aBEx

Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...

Igalia

08448380779 Call Girls In Friends Colony Women Seeking Men

Delhi Call girls

ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke

Product Anonymous

In an era where artificial intelligence (AI) stands at the forefront of business innovation, Information Architecture (IA) is at the core of functionality. See “There’s No AI Without IA” – (from 2016 but even more relevant today) Understanding and leveraging how Information Architecture (IA) supports AI synergies between knowledge engineering and prompt engineering is critical for senior leaders looking to successfully deploy AI for internal and externally facing knowledge processes. This webinar be a high-level overview of the methodologies that can elevate AI-driven knowledge processes supporting both employees and customers. Core Insights Include: Strategic Knowledge Engineering: Delve into how structuring AI's knowledge base is required to prevent hallucinations, enable contextual retrieval of accurate information. This will include discussion of gold standard libraries of use cases support testing various LLMs and structures and configurations of knowledge base. Precision in Prompt Engineering: Learn the art of crafting prompts that direct AI to deliver targeted, relevant responses, thereby optimizing customer experiences and business outcomes. Unified Approach for Enhanced AI Performance: Explore the intersection of knowledge and prompt engineering to develop AI systems that are not only more responsive but also aligned with overarching business strategies. Guiding Principles for Implementation: Equip yourself with best practices, ethical guidelines, and strategic considerations for embedding these technologies into your business ecosystem effectively. This webinar is designed to empower business and technology leaders with the knowledge to harness the full potential of AI, ensuring their organizations not only keep pace with digital transformation but lead the charge. Join us to map a roadmap to fully leverage Information Architecture (IA) and AI chart a course towards a future where AI is a key pillar of strategic innovation and business success.

EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx

Earley Information Science

Handwritten Text Recognition for manuscripts and early printed texts

Maria Levchenko

Recently uploaded (20)

How to Troubleshoot Apps for the Modern Connected Worker

Exploring the Future Potential of AI-Enabled Smartphone Processors

TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments

🐬 The future of MySQL is Postgres 🐘

08448380779 Call Girls In Greater Kailash - I Women Seeking Men

GenCyber Cyber Security Day Presentation

What Are The Drone Anti-jamming Systems Technology?

Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...

IAC 2024 - IA Fast Track to Search Focused AI Solutions

Strategies for Landing an Oracle DBA Job as a Fresher

CNv6 Instructor Chapter 6 Quality of Service

Powerful Google developer tools for immediate impact! (2023-24 C)

From Event to Action: Accelerate Your Decision Making with Real-Time Automation

08448380779 Call Girls In Diplomatic Enclave Women Seeking Men

How to convert PDF to text with Nanonets

Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...

08448380779 Call Girls In Friends Colony Women Seeking Men

ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke

EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx

Handwritten Text Recognition for manuscripts and early printed texts

pgRouting 2.0 presentation 2013

1. Shortest Path Search with pgRouting

2. What is pgRouting ?

3. An Extension for PostgreSQL / PostGIS, ...

4. An Open Source project, ...

5. A Library providing, ...

6. Shortest Path

7. Driving Distance

8. Traveling Salesperson

9. v2.0

10. Feature Highlights ➔ Two new All Pairs Short Path algorithms ➔ Bi-directional Dijkstra and A-star algorithms ➔ One to many nodes shortest path search ➔ New TSP solver (with distance matrix) ➔ Turn Restricted shortest path (replaces Shooting Star algorithm) ➔ A collection of useful utility and graph analytics functions

11. More Highlights ➔ Modular library design ➔ Unit tests and automated tests with Travis ➔ Compatibility with PostgreSQL 9.1+ / PostGIS 2.0+ ➔ Installs as PostgreSQL EXTENSION ➔ Added pgr_ prefix to functions and types ➔ Improved build process for Windows ➔ Better documentation in several languages https://www.transifex.com/projects/p/pgrouting/

12. Big THANK YOU to - Steve Woodbridge - Regina Obe … and the pgRouting community!

13. Most users need pgRouting for Road Networks How do they look like?

14. Like this ...

15. … or like this ...

16. … or sometimes like this.

17. What makes them real? Traffic lights Signs Road marking

18. pgRouting extends PostgreSQL/PostGIS What does this mean?

19. SQL Function SELECT * FROM pgr_dijkstra(' SELECT gid as id, source::integer, target::integer, length::float8 as cost FROM ways', 30, 60, false, false);

20. Query Result seq | node | edge | cost -----+------+------+--------------------0 | 30 | 53 | 0.0591267653820616 1 | 44 | 52 | 0.0665408320949312 2 | 14 | 15 | 0.0809556879332114 3 | 13 | 14 | 0.072694271986776 4 | 12 | 13 | 0.081239348480584 5 | 11 | 12 | 0.00746935522787469 6 | 10 | 6869 | 0.0164274192597773 7 | 59 | 72 | 0.0109385169537801 8 | 60 | -1 | 0 (9 rows)

21. gid, source, target, cost, reverse_cost, x1, y1, x2, y2, rule, to_cost source target

22. Traffic lights slow down … so costs must increase.

23. B C 1 min A cost(A) = cost(A) + 30sec cost(B) = cost(B) + 30sec cost(C) = cost(C) + 30sec cost(D) = cost(D) + 30sec D

24. Signs inform about restrictions and rules

25.

26. cost(A) = length(A) reverse_cost(A) = ∞ A

27. Sometimes the costs have different meaning.

28. cost(A) = length(A) / 2 reverse_cost(A) = length(A) * 4 B A

29. Road type can be used for cost calculation.

30. Not only road types but also conditions

31. And you know what is great about pgRouting?

32. All costs are dynamic! … which is the opposite to pre-calculated

33. If the road is closed ...

34. … or there is an accident, ...

35. … there is a sign with restrictions limited to a certain time, ...

36. … bad weather conditions ...

37. You don't need to rebuild and reload your network

38. You only need to adjust the cost for this particular road, … and the next search will go another way.

39. Flexiblity vs. Speed

40. Cost can be virtually anything

41. pgRouting can be used for different kinds of networks

42. Canals and Rivers

43. Hiking trails

44. … or any other kind of networks

45. Roadmap for Version 2.1 ➔ Add “Multi-modal public transit routing” (GSoC 2011) ➔ Add “Time dependent shortest path” algorithm (GSoC 2011) ➔ Add “Two Queue” Algorithm (GSoC 2012) ➔ Add DARP and VRP (GSoC 2013) ➔ Add Graph network partitioning (GSoC 2013) ➔ …. further improvements and bug fixes.

46. https://github.com/pgRouting

47. More Information Website: pgrouting.org Documentation: Workshop: 日本語 NEW Support: docs.pgrouting.org workshop.pgrouting.org workshop.pgrouting.org/ja pgrouting.org/support.html … or talk contact us directly: ➔ Daniel Kastl daniel@georepublic.co.jp ➔ Hal Seki hal@georepublic.co.jp

48. Photos from sxc.hu and flickr under Creative Commons Licence.

pgRouting 2.0 presentation 2013

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Similar to pgRouting 2.0 presentation 2013

Similar to pgRouting 2.0 presentation 2013 (20)

More from Daniel Kastl

More from Daniel Kastl (9)

Recently uploaded

Recently uploaded (20)

pgRouting 2.0 presentation 2013