Map, Filter and Reduce (en)
Lambda, filter, reduce und map (de)
s= [' abc ', ' ee ', 't ttt', ' q ', 'r ', ' t']
m = map(str.strip, s)
print(f'type={type(m)}') # type=<class 'map'> => Unterklasse von Iterator ?!
Python 3 Map function is not Calling up function
map(function, iterable, ...)
CP210x USB to UART Bridge VCP Drivers (CP2104)
Adafruit CP2104 Friend – USB to Serial Converter
LilyGO/TTGO-T-Beam
LilyGO/TTGO-LORA32-V2.0
LilyGO/TTGO-Lora-ESP32-OLED-ESP8266
osresearch/esp32-ttgo, Code for the TT GO ESP32 module
DeuxVis/Lora-TTNMapper-T-Beam, TTNMapper on the TTGO T-Beam
cyberman54/ESP32-Paxcounter, Wifi & BLE driven passenger flow metering with cheap ESP32 boards
The TTGO T-Beam, an ESP32 LoRa Board
Ttgo T-beam
ESP32 OGN DIY-Tracker
ESP32 – LoRa – OLED Module
Making a 1-3 channel LoRa – Gateway with an ESP32 from TTGO
How to calculate the perceptron decision boundary [duplicate]
Calculate the Decision Boundary of a Single Perceptron – Visualizing Linear Separability
Decision boundary plot for a perceptron
Perceptron Learning Rule (PDF)
Perceptron.py, The 2D Linear Perceptron [simple example]
The Nature of Code – Chapter 10. Neural Networks (Java)
The Data Science Lab – Machine Learning Classics: The Perceptron
How To Implement The Perceptron Algorithm From Scratch In Python
Simple Perceptron Classifier
Programming a Perceptron in Python
Skalarprodukt (dot product), für Vektoren
Matrizenmultiplikation (dot product), für Matrizen
Python Machine Learning – Part 1 : Implementing a Perceptron Algorithm in Python | packtpub.com, 12min
Standard form for linear equations | Algebra I | Khan Academy, 8min
Tariq Rashid – A Gentle Introduction to Neural Networks and making your own with Python, 55min
What does numpy.random.seed(0) do?
numpy.random.choice vs random.choice
Array objects
What is the difference between ndarray and array in numpy?
Python overriding class (not instance) special methods
Define Python class from C
NPY_NO_EXPORT PyTypeObject PyArray_Type = {
PyObject_HEAD_INIT(NULL)
0, /* ob_size */
"numpy.ndarray", /* tp_name */
[...]
(reprfunc)array_repr, /* tp_repr */
[...]
(reprfunc)array_str, /* tp_str */
(getattrofunc)0, /* tp_getattro */
(setattrofunc)0, /* tp_setattro */
[...]
(getiterfunc)array_iter, /* tp_iter */
(iternextfunc)0, /* tp_iternext */
array_methods, /* tp_methods */
0, /* tp_members */
array_getsetlist, /* tp_getset */
[...]
(initproc)0, /* tp_init */
(allocfunc)array_alloc, /* tp_alloc */
(newfunc)array_new, /* tp_new */
(freefunc)array_free, /* tp_free */
[...]
};
NPY_NO_EXPORT PyObject *
array_str(PyArrayObject *self)
{
[...]
}
static int
dump_data(...)
{
[...]
}
Python Virtual Environments: A Primer
# Install $ pip install virtualenv # Python 3 using apt install $ python3 -m venv myapp # Python 3 using pip install $ virtualenv -p python3 myapp $ source myapp/bin/activate (env) $ (env) $ deactivate $
$ python3 -m venv myapp
The virtual environment was not created successfully because ensurepip is not
available. On Debian/Ubuntu systems, you need to install the python3-venv
package using the following command.
apt-get install python3-venv
You may need to use sudo with that command. After installing the python3-venv
package, recreate your virtual environment.
Failing command: ['/home/XXX/myapp/bin/python3', '-Im', 'ensurepip', '--upgrade', '--default-pip']
$ pip install virtualenv Defaulting to user installation because normal site-packages is not writeable Collecting virtualenv Downloading virtualenv-20.0.20-py2.py3-none-any.whl (4.7 MB) Collecting distlib<1,>=0.3.0 Downloading distlib-0.3.0.zip (571 kB) Collecting importlib-metadata<2,>=0.12; python_version < "3.8" Downloading importlib_metadata-1.6.0-py2.py3-none-any.whl (30 kB) Collecting appdirs<2,>=1.4.3 Downloading appdirs-1.4.4-py2.py3-none-any.whl (9.6 kB) Collecting filelock<4,>=3.0.0 Downloading filelock-3.0.12-py3-none-any.whl (7.6 kB) Collecting importlib-resources<2,>=1.0; python_version < "3.7" Downloading importlib_resources-1.5.0-py2.py3-none-any.whl (21 kB) Requirement already satisfied: six<2,>=1.9.0 in /usr/lib/python3/dist-packages (from virtualenv) (1.11.0) Collecting zipp>=0.5 Downloading zipp-3.1.0-py3-none-any.whl (4.9 kB) Building wheels for collected packages: distlib Building wheel for distlib (setup.py) ... done Created wheel for distlib: filename=distlib-0.3.0-py3-none-any.whl size=336972 sha256=09fc154d5bab1f792599644aa5c06884f122de197a99cc8545827150f1ca945a Stored in directory: /home/bacr/.cache/pip/wheels/33/d9/71/e4e3cac73529e1947df418af0f140cd7589d5d9ec0e17ecfc2 Successfully built distlib Installing collected packages: distlib, zipp, importlib-metadata, appdirs, filelock, importlib-resources, virtualenv Successfully installed appdirs-1.4.4 distlib-0.3.0 filelock-3.0.12 importlib-metadata-1.6.0 importlib-resources-1.5.0 virtualenv-20.0.20 zipp-3.1.0
WARNING: The script virtualenv is installed in '/home/bacr/.local/bin' which is not on PATH. Consider adding this directory to PATH or, if you prefer to suppress this warning, use --no-warn-script-location.
WARNING: You are using pip version 20.0.2; however, version 20.1.1 is available. You should consider upgrading via the '/usr/bin/python3 -m pip install --upgrade pip' command.
$ which python /usr/bin/python
(env) $ which python /home/andreas/my_python_project/venv/bin/python
>>> import sys >>> sys.prefix '/usr' >>> import site >>> site.getsitepackages() [ '/usr/local/lib/python3.6/dist-packages', '/usr/lib/python3/dist-packages', '/usr/lib/python3.6/dist-packages' ]
>>> import sys >>> sys.prefix '/home/andreas/my_python_project/venv' >>> import site >>> site.getsitepackages() [ '/home/andreas/my_python_project/venv/lib/python3.6/site-packages', '/home/andreas/my_python_project/venv/local/lib/python3.6/dist-packages', '/home/andreas/my_python_project/venv/lib/python3/dist-packages', '/home/andreas/my_python_project/venv/lib/python3.6/dist-packages' ]
SNA Maximum Likelihood Boundry Bound Fehlerrate Kanalkapazität Erwartungswert Symbol Codewort Träger Modulation Shannon
Informationstheorie
Kodierungstheorie
Kanalkapazität
Blockcode (
Faltungscode (Convolutional Code)
Linearer Code
Quadratur-Amplituden-Modulation (QAM)
Low-Density-Parity-Check-Codes (LDPC)
Turbo-Code
MQTT (Message Queuing Telemetry Transport)
Eclipse Mosquitto, An open source MQTT broker
MQTT-Wireshark-Capture/mqtt_packets_tcpdump.pcap
Dissecting MQTT using Wireshark (old)
Dissecting MQTT using Wireshark (new)
Algorithmische Geometrie
Algorithmische Geometrie, Sommersemester 2014
Computational Geometry, Summer 2018
Geometric Algorithms (INFOGA) 2018, Block 2, Frank Staals
Wahrnehmung
Die vier Lerntypen
Die vier Lerntypen – der auditive Lerntyp
Die vier Lerntypen – der visuelle Lerntyp
Die vier Lerntypen – der haptische Lerntyp
Die vier Lerntypen – der kommunikative Lerntyp
Algorithmen 1, Vorlesung, SS 2019, 27.07.2019
21: Übung: Ameisenalgorithmen, Vertex Cover, Nachbarschaftsmetaheuristiken, 2.07.2017
Algorithmen 2, Vorlesung, WS2017/18, 08.02.2018
Algorithmen 2, WS 2018/19, 01.08.2019
19: Geometrische Algorithmen, Streckenschnitt, Überlappungen, 07.02.2019
20: Streckenschnitt, Konvexe Hülle, Geometrische Methoden, Übung, 12.02.2019
23: Online Algorithmen, Geometrische Algorithmen, Streckenschnitt, 26.01.2017
24: Konvexe Hüllen, Bereichssuche, Kleinste einschließende Kugel, 26.01.2017
25: Wavelet Tree, Sweepline, Linienschnitt, Geometrische Algorithmen,01.02.2017
Das Sweep-Verfahren der algorithmischen Geometrie
Closest Pair of Points | Divide and Conquer | GeeksforGeeks
Computational Geometry Lec 4 ( Sweep Line Algorithm ) ( in Arabic )
Computational Geometry – Line Sweep – 2 – Segments Intersection (Arabic)
Sweep line algorithm part 1
Sweep line algorithm part 2
Coding Math: Episode 32 – Line Intersections Part I
Coding Math: Episode 33 – Line Intersections Part II
11 2 Line Segment Intersection 546
11 1 1d Range Search 851
11 3 Kd Trees 2907
11 4 Interval Search Trees 1347
Given n line segments, find if any two segments intersect
Algorithmen und Datenstrukturen – Suchbaum (PDF)
MIT: Introduction to Algorithms – Lecture 24: Geometry (PDF)
Wikipedia – Binärer Suchbaum
Point location
Point set triangulation
Planar straight-line graph
Voronoi diagram
Voronoi-Diagramm
Delaunay triangulation
Delaunay-Triangulierung
time complexity
Analysis of Algorithms: Average Case Analysis
Analysis of Algorithms
Analysis of Algorithms | Set 1 (Asymptotic Analysis)
Analysis of Algorithms | Set 2 (Worst, Average and Best Cases)
ec 1 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005
Time complexity: Best and Worst cases | Quick Sort | GateAppliedcourse
Stochastik Übersicht, Wahrscheinlichkeit, beschreibende/beurteilende Statistik
Kombinatorik, Permutation mit Wiederholung, Beispiel am Wort Wetter | Mathe by Daniel Jung
Kombinatorik, Permutation, Variation, Kombination, Beispiele, Abzählverfahren | Mathe by Daniel Jung
Time complexity
Zeitkomplexität
Laufzeit (Informatik)
Sortierverfahren
codeadventurer.de
codeadventurer.de: Die O Notation. Wie schnell ist dein Code?
How to analyse time complexity: Count your steps
Time complexity of recursive functions [Master theorem]
Big O notation: definition and examples
Zeitkomplexität und O-Notation
Analysis of Algorithms
2.3. Big-O Notation
Problem Solving with Algorithms and Data Structures using Python
2d line intersection
Line–line intersection
How do you detect where two line segments intersect? [closed]
Line and Segment Intersections
Sweep (Informatik) (Sweep-Line)
Rot-Schwarz-Baum (red–black tree oder RB tree)
Wikipedia: JTS Topology Suite
LocationTech JTS Topology Suite
JavaDoc JTS Topology Suite 1.15.0-SNAPSHOT API
github.io JTS Topology Suite
JTS Frequently Asked Questions
github.com/locationtech/jts, The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
github.com/locationtech/jts/releases
github.com/locationtech/jts/blob/master/MIGRATION.md
github.com/locationtech/jts/blob/master/USING.md
github.com/locationtech/jts/blob/master/DEVELOPING.md
GIS Wiki: Java Topology Suite
OSGeoLive JTS Topology Suite
Wikipedia: Open Source Geospatial Foundation (OSGeo)
OSGeo – The Open Source Geospatial Foundation
OSGeo Libraries (GEOS, JTS Topology Suite)
Array sortieren mit Java
Converting between an Array and a List in Java
A Guide to TreeSet in Java
TreeSet in Java
Binary Search Tree Complete Implementation
Binary Search Tree – Java Implementation
Convex hull algorithms
Complexity of the QuickHull Algorithm?
Convex Hull Algorithms: Divide and Conquer
Divide and Conquer algorithm to find Convex Hull
Quick Hull Algorithm to find Convex Hull
Quickhull Algorithm for Convex Hull
Convex Hull using Divide and Conquer Algorithm
Tangents between two Convex Polygons
Convex Hull, COMP 215 Lecture 5, PDF
An efficient way of merging two convex hulls
Tangents to & between 2D Polygons
Planarer Graph
Dreiecksgraph
Eulerscher Polyedersatz
Vollständiger Graph
Grad (Graphentheorie)
Line segment intersection
Bentley–Ottmann algorithm
Schleife (Graphentheorie)
Zyklus (Graphentheorie)
Dreieckszahl
Satz von Kuratowski
Satz von Wagner
Bipartiter Graph
Freie Universität Berlin – Computational Geometry: Line segment intersection
The intersection of two line segments
Mathematik (WiSe 2013/2014 und SoSe 2014) (Playlist)
Planare Graphen
Vollständige Graphen
Graph (Graphentheorie)
Nachbarschaft (Graphentheorie)
Isomorphie von Graphen
Planar graph
Cycle graph
Star (graph theory)
Wheel graph
Cubic graph
Ladder graph
Category:Planar graphs
Category:Triangulation (geometry)
List of graphs by edges and vertices
Doubly-connected edge list
Half-Edge-Datenstruktur
Star Graph
Wheel Graph
Cubical Graph
Platonic Graph
Hypercube Graph
Halved Cube Graph
Families of Graphs (PDF)
Freie Universität Berlin – DCEL: Eine Datenstruktur für ebene Unterteilungen (PDF)
Plane Graphs and the DCEL (PDF)
Computergeometrie (Senior)
Computergeometrie (Senior) (übersetzt!)
Index of /farshi/Teaching/CG3921/Slides
Computing the Overlay of Two Subdivisions
Geometric Algorithms (INFOGA) 2018, Block 2
Computational Geometry – Lecture 2b: Subdivision representation and map overlay
Overlay of Two Subdivisions – PowerPoint PPT Presentation
2D Arrangements – Arrangement on Surface
Truncation (geometry)
Archimedean solid
Conway polyhedron notation
Graph Theory: 04. Families of Graphs
Graph Theory: 07 Adjacency Matrix and Incidence Matrix
Graph Theory: 27. Hamiltonian Graphs and Problem Set
Graph Theory: 57. Planar Graphs
Graph Theory: 61. Characterization of Planar Graphs
Do Maths with Pigeons and Handshakes
Planar Graphs – Worked Examples
Algorithms Course – Graph Theory Tutorial from a Google Engineer (6:44:39) => 6h!
Data structures
Graph Representation part 01 – Edge List
Graph Representation part 02 – Adjacency Matrix
Graph Representation part 03 – Adjacency List
Planar mesh data structure that uses vertices, half-edges and faces
Freie Universität Berlin – Lecture 4 (CGAL)
2D Triangulation
github.com/CGAL/cgal/tree/master/Triangulation_2/examples/Triangulation_2
Heap (Datenstruktur)
Min-Max-Heap
Vorrangwarteschlange
Stapelspeicher
14_Algorithmen&Datenstrukturen || Heap (Aufbau & Daten einfügen)
15_Algorithmen&Datenstrukturen || Heap (Daten löschen & Arraydarstellung)
Vorrangwarteschlange
Priority Queue Introduction
2.6.3 Heap – Heap Sort – Heapify – Priority Queues
Fastest Sorting Algorithm. Ever!
AlgoDat – 03: Heaps, Heapify-Funktion und Heapsort mit Beispiel und Code (C#)
Problem
Optimierungsproblem
Suchproblem
Heuristik
Komplexitätsklasse
Liste von Komplexitätsklassen
NP (Komplexitätsklasse)
NP-Schwere, NP-hard
P-NP-Problem
Polynomialzeit
Polynom
Laufzeit (Informatik)
Zeitkomplexität
Landau-Symbole
Single-machine scheduling, Performance measures: Tardiness, Earliness, Lateness Flowtime
Google OR-Tools: Job Shop
Sequencing and Scheduling – Johnson’s Algorithm
Job Sequencing Problem with Deadline, Greedy Algorithm
ICAPS 2015: “Iterated Local Search Heuristics for Minimizing Total Completion Time in …”
Michael Sambol Algorithms
4. Search: Depth-First, Hill Climbing, Beam (Beam Search: 35:15)
Hill Climbing – Bergsteigeralgorithmus Suchalgorithmen
beam search, search wrap up (4:30)
Solution Space Search,Beam Search
What is Beam search in artificial intelligence in hindi | lec 14 | Nauman Malik | CS607 | easy methd
mod10lec83-Beam Search (not exactly)
Beam Search Algorithm (Draft by Andrew Jungwirth)
Representing graphs
Graph and its representations
Graph Representation part 01 – Edge List
Graph representation. set, adjacency matrix and adjacency list
Data Structures using C Part 29 – Adjacency List Representation of Graph in c programming
Meta-Heuristic Optimization Techniques and Its Applications in Robotics
Algorithmen
Asymptotische Komplexität
Obere und untere Schranken
Approximation algorithms – Heuristic Algorithms (PDF)
Wikipedia: Approximation algorithm
Wikipedia: Algorithmus von Christofides
ApproximationAlgorithms
What does the 2 in a 2-approximation algorithm mean?
Algorithmen und Datenstrukturen
Erdős-Zahl
Bacon-Zahl
Interval Partitioning ( Greedy Algorithm ) – Algorithms
Rate Monotonic Scheduling
Sequencing Problem For More than 3 Machines|| Processing n Jobs on m Machines By JOLLY Coaching
Minimum tardiness problem
Scheduling with deadlines: minimizing lateness
Dijkstra’s Algorithm ( incl. Example and Step-By-Step Guide ) – Algorithms
Sequencing n jobs on 1 machine – Example 2
N jobs and 2 machines using Johnson’s algorithm in Hindi ( Lecture.40)
n jobs and 3 machines ( Johnson’s algorithm ) in Hindi ( Lecture.41)
Graph traversal
Tree traversal
Search tree
https://github.com/jackspyder/2-opt, Java 2-opt solution for TSP Coursework
2-opt
Lin–Kernighan heuristic, K. Helsgaun (LKH), LK local search
Complexity Zoo
APX
Optimierungsproblem
Kombinatorische Optimierung
Optimierung (Mathematik)
Approximationsalgorithmus
Time complexity – Polynomial time
Polynomial-time approximation scheme
List of NP-complete problems
NP-completeness
Linear programming
Dynamic programming
Breitensuche, (breadth-first search, BFS)
Tiefensuche, (depth-first search, DFS)
Iterative Tiefensuche, (Iterative Tiefensuche)
Bestensuche, (best-first search)
Nearest neighbor search
Suchverfahren, Informierte Suche = Heuristik
A Practical Introduction to Simulated Annealing
A Practical Introduction to Genetic Algorithms
github.com/thiagodnf/jacof, Java Ant Colony Optimization Framework
github.com/LazoCoder/Ant-Colony-Optimization-for-the-Traveling-Salesman-Problem, A population based stochastic algorithm for solving the Traveling Salesman Problem
TSP ACO Applet
Ant Colony Optimization Tutorial
github.com/eugenp/tutorials/tree/master/algorithms-genetic
meta-heuristics
Lineare Optimierung, Simplex-Verfahren, Operations Research (Linear Programming)
Quadratic assignment problem
Quadratic Assignment Problem
Quadratic Assignment on Different Data Models
Yuehaw Khoo — Clique-Based Semidefinite Relaxation of the Quadratic Assignment Problem
Assignment Problem using Branch and Bound
Assignment problem by branch and bound method
7.3 Traveling Salesman Problem – Branch and Bound
Steinerbaumproblem
Santa’s Stolen Sleigh
Geographische Länge
Geographische Breite
Geographische Koordinaten, Geographische Lage
Gradnetz
Hilbert R-tree
R-Baum, R-tree
Environment for DeveLoping KDD-Applications Supported by Index-Structures (ELKI)
Closest pair of points problem
Dichtestes Punktpaar
github.com/OSUCartography/JMapProjLib, JMapProjLib: Java Map Projection Library
Converting longitude/latitude to X/Y coordinate
Convert latitude/longitude point to a pixels (x,y) on mercator projection
Mercator projection
Mercator-Projektion
PROJ – a generic coordinate transformation software
github.com/OSGeo/proj.4, PROJ.4 – Cartographic Projections Library
PROJ.4
Lat/long (Geodetic alias)
Mercator
Java OpenGL (JOGL)
Where can I find the package javax.media.opengl?
Position of PerspectiveCamera in JavaFX 8
JAVA PROGRAMMING: ADD, ANIMATE, AND LIGHT UP OBJECTS IN 3D
github.com/mfeldheim/hermap, Hermap libraries: stuff related to maps
Overview of Coordinate Reference Systems (CRS) in R (PDF)
R Spatial – Coordinate Reference Systems
Choosing the correct value for proj4string for shapefile reading in R?
What Is Dynamic Programming and How To Use It
Learn Particle Swarm Optimization (PSO) in 20 minutes
Artificial Bee Colony (ABC) Visualized – Artificial Intelligence
Honey Bee Optimization (HBO) Algorithm
Bat Algorithm BA
Scheduling projects: How to determine the critical path using activity slack calculations?
Activity slack: Total, safety and free slack definitions
Scheduling, precedence diagramming and the critical path
How to Calculate Critical Path, Float, Early Start & Late Start, and Early Finish & Late Finish
Understanding Critical Path in Project Management (Example Included)
he Ultimate Guide to the Critical Path Method
Statt Projekte mit Arbeitspaketen nun nur Abhängigkeiten zwischen Tasks in EINEM Job. Etwas anderes Problem Projektplan/Netzplan vs. Scheduling.
Netzplan | Kritischer Pfad | Beispiel | Berechnung | Produktion (2/3) | Einfach sehr gut erklärt!
Kritischer Pfad im Projektablauf
Ein Referenzhandbuch für die Diagnoseanzeigen von Dell-OptiPlex
| Optiplex 980 | 2010 |
| Optiplex 790 | 2011 |
A reference guide to the Dell OptiPlex Diagnostic Indicators
How to Troubleshoot a No Power Issue on your Dell Desktop
dell optiplex 980 flashing orange light dell optiplex 980 blinking amber light problem code 1 & 3 diagnostic lights 1 & 3 flash
Optiplex 960 SFF, problem code 1 & 3, would someone please assist
Dell Optiplex 780 MiniTower, power light flashes amber diagnostic lights 1 & 3 flash
FIX AMBER LIGHT IN DELL OPTIPLEX 980 PC SOLUTION OR OTHER DESKTOP DELL PC
Fix the Dell Orange Light of Death