Mounting CIFS with automount on Ubuntu 18:
-
Install the necessary applications/servers:
sudo apt install autofs smbclient cifs-utils
-
Configure autofs
create /etc/auto.cifs
, with this variant from auto.smb
, courtesy howtoforge
Mounting CIFS with automount on Ubuntu 18:
Install the necessary applications/servers:
sudo apt install autofs smbclient cifs-utils
Configure autofs
create /etc/auto.cifs
, with this variant from auto.smb
, courtesy howtoforge
The Gilbert–Johnson–Keerthi (GJK) distance algorithm is a method of determining the minimum distance between two convex sets. The algorithm's stability, speed which operates in near-constant time, and small storage footprint make it popular for realtime collision detection.
Unlike many other distance algorithms, it has no requirments on geometry data to be stored in any specific format, but instead relies solely on a support function to iteratively generate closer simplices to the correct answer using the Minkowski sum (CSO) of two convex shapes.
This folder provides simulation of the BlueROV2 using Gazebo for the dynamics and ArduPilot SITL for the communication and ground control. | |
Source: https://gist.github.com/patrickelectric/60a1d300e0afadf85066cc5d8e3d51ff | |
http://discuss.bluerobotics.com/t/ardusub-simulation-sitl/481/30 | |
------------------------------------------------------------------------------------------------------------------------- | |
;;; initfile --- Summary: | |
;;; Commentary: | |
;; Emacs 25.1 and newer tested | |
;;; Code: | |
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; | |
;; Configuration/Customization: | |
;; Defines global variables that are later used to customize and set | |
;; up packages. | |
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; |
launchctl load ~/Library/LaunchAgents/com.sean.python.slactive.plist
cv::Mat createLOGKernel1D(int ksize, float sigma) | |
{ | |
using namespace cv; | |
float std2 = sigma * sigma; | |
std::vector<float> seq(ksize); | |
std::iota(begin(seq), end(seq), -(ksize-1)/2); | |
Mat_<float> kSeq(1, ksize, seq.data()); | |
Mat XX; |
#include <opencv2/opencv.hpp> | |
#include <opencv2/imgproc.hpp> | |
#include <assert.h> | |
// Calculates Laplace of Gaussian kernel | |
cv::Mat createLOGKernel(int ksize, double sigma) | |
{ | |
using namespace cv; | |
using namespace std; |
#include <boost/exception/exception.hpp> | |
#include <boost/thread.hpp> | |
#include <boost/chrono.hpp> | |
#include "opencv2/opencv.hpp" | |
#include "opencv2/highgui.hpp" | |
using namespace cv; | |
using namespace std; |
Abraham Lincoln once asked one of his secretaries, If you call a tail a leg, how many legs does a horse | |
have?. | |
Five, replied the secretary. | |
No, said the President, The answer is four. Calling a tail a leg doesn't make it a leg. | |
A group of frogs were traveling through the woods, when two of them fell into a deep pit. All the other | |
frogs gathered around the pit. When they saw how deep it was, they told the two frogs that they were as | |
good as dead. | |
The two frogs ignored the comments and tried to jump up out of the pit with all of their might. The other | |
frogs kept telling them to stop, that they were as good as dead. Finally, one of the frogs took heed to what |