In Canada I had no such option.
682 karma · joined January 6, 2021
meet.hn/city/us-San-Jose
Socials: - linkedin.com/in/skzv - github.com/skzv - reddit.com/user/kolmogorovcomplexity - skzv.at.hn - x.com/_skzv
Interests: AI/ML, Entrepreneurship, Fitness, Hacking, Music, Networking, Robotics, Travel
---
In Canada I had no such option.
Fourier series is a discrete sum over integer multiple of frequencies, while Fourier transform is a continuous integral over all frequencies.
The former works for periodic functions, the latter for an arbitrary function. Because you need all frequencies to bound a function.
The implication is that the further out the option, the blurrier the picture gets, because we're applying more Gaussian blur.
One thing that Veritasium glosses over is that BS assumes that the stock price is lognormal distributed, so it follows a geometric brownian process instead of just a regular one. That's why the drift term on a stock price is (r - sigma^2/2) instead of just r in terms of geometric returns. Volatility lowers compounding returns. This is called volatility drag [0].
[0] https://www.kitces.com/blog/volatility-drag-variance-drain-m...
[0] https://www.youtube.com/watch?v=fNk_zzaMoSs&list=PLZHQObOWTQ...
The gist is that you can formulate the PageRank problem as a flow equation r = Mr, where r is a vector of PageRanks and M is a stochastic adjacency matrix, which can be interpreted as the probability of visiting one page from another.
This matrix is huge and hence this is tough to solve.
But since M is a stochastic matrix, it has the property that its largest eigenvalue is exactly 1, and all other eigenvalues are < 1. And the equation r = Mr can be interpreted as r being the eigenvector of M with eigenvalue 1, as this equation implies multiplying by M is equivalent to multiplying by 1.
Repeatedly multiplying by M hence shrinks every eigenvector except the eigenvector with eigenvalue 1. So you start with some initialization of r, and repeatedly multiply by M until it converges. The resulting value of r solves r = Mr since all other eigenvectors shrank towards zero.
This is a much more efficient way to compute r, and hence makes PageRank computationally feasible.
> NIMH, Lexington, KY. First official mind control and electronic attack research, design, development. Some Black Projects.
[0] https://www.linkedin.com/in/john-williams-42055536/
[1] (screenshot) https://prnt.sc/cNw6R6Qggie0
Various topics.
[0] https://usa.kaspersky.com/blog/triangulation-attack-on-ios/2...
[0] https://play.google.com/store/apps/details?id=com.google.and...
Later experiments that relied on individual photons could detect them individually [0]
Here's an article on single photon sources [1]
[0](https://en.wikipedia.org/wiki/Double-slit_experiment#/media/...)
I don't think this happens often in practice. Improvements in efficiency often have the paradoxical effect of increasing resource utilization. This is known as Jevons Paradox [0], and it's been observed in many real world situations.
[0] https://insidegnss-com.exactdn.com/wp-content/uploads/2021/0...
There's also an API to specify an antenna pattern [2]
[0] https://developer.android.com/reference/android/location/Gns...()
[1] https://developer.android.com/reference/android/location/Gns...()
[2] https://developer.android.com/reference/android/location/Gns...
[0] https://insidegnss-com.exactdn.com/wp-content/uploads/2021/0...
[1] https://insidegnss.com/end-game-for-urban-gnss-googles-use-o...
[0] https://developer.android.com/guide/topics/sensors/gnss
[1] https://developer.android.com/reference/android/location/Gns...
[0] https://1.bp.blogspot.com/-FskvGHx-IOc/X8qtZi1GUNI/AAAAAAAAP...
[1] https://android-developers.googleblog.com/2020/12/improving-...
[2] https://insidegnss.com/end-game-for-urban-gnss-googles-use-o...
My manager worked at Qualcomm back in the day and played a huge role in creating the first GNSS smartphone chipsets.
Likewise, I've learned a lot from him and other veterans in my org.