|
|
| Line 1: |
Line 1: |
| − | <!--Please sign your posts with ~~~~ and don't delete this text. New comments should be added at the bottom.-->
| + | Hey, |
| − | I don’t think this has anything to do with teleconferencing. Am I missing something? [[Special:Contributions/172.70.214.81|172.70.214.81]] 22:46, 15 August 2022 (UTC)
| |
| − | :Yes. The impliction is that people are expecting you to be available for online communications, and you can use the unreliable Internet connection as an excuse to get out of it. [[User:Barmar|Barmar]] ([[User talk:Barmar|talk]]) 22:51, 15 August 2022 (UTC)
| |
| − | ::I think it's more about communication in general. He doesn't want anybody calling him or sending him emails, so by saying he has an "unreliable" connection people might assume it will be hard to get in touch with him.
| |
| − | :::Back in the day, email was usually configured so that it could easily overcome such unreliability, and it's still doable,[https://discourse.mailinabox.email/t/running-from-home/6459/7] but today email for most people is a web or local client-server app, as opposed to a local mail store in a peer-to-peer app. Even people in urban areas can suffer unreliable internet, when squirrels or backhoes gnaw through data cables, copper theives strike, or 5G mind control base stations are congested. [[Special:Contributions/172.70.210.143|172.70.210.143]] 23:45, 15 August 2022 (UTC)
| |
| − | :::This could equally cover other instant communication methods where your availability is advertised (e.g. Whatsapp). It could also be about alleviating the social pressure the subject feels to continuously check and immediately respond to messages (including emails), because the immediacy is already hindered by the spotty connection (cf the standard "I will have limited access to email" out of office line, which gives the account owner psychological permission to check it infrequently). [[Special:Contributions/172.70.85.5|172.70.85.5]] 09:02, 16 August 2022 (UTC)
| |
| | | | |
| − | According to a PhET simulator (https://phet.colorado.edu/sims/html/plinko-probability/latest/plinko-probability_en.html) for this situation, the ideal standard deviation is 1.732 and ideal mean is 6. I don’t feel like doing the calculations :P [[Special:Contributions/172.70.211.134|172.70.211.134]] 23:34, 15 August 2022 (UTC)
| + | If you still haven't checked out DFY Suite... |
| − | :If we assume 50-50 for each bounce, the probability that internet is off will be about (11 choose 3)/(2^11), or 8%.--[[User:Account|Account]] ([[User talk:Account|talk]]) 23:51, 15 August 2022 (UTC)
| |
| − | ::My first thought was, why so complicated? ''If'' each of the twelve switches is equally (and solely) likely to be struck by each ball, it's (100/12)% of the time, or 8⅓%.
| |
| − | ::Although the equal-chance is wrong, so you're definitely doing "end up with exactly 7 bounce rights and 3 bounce lefts, but in any combination" or similar are you? I'd have summed it differently, though. And not sure where the choose ''3'' comes in... Just one bounce left off any row-end pin 11 sends to 11 if all others bounce right. Three bounces left hits switch 9, not eight. If I'm counting correctly. Or am I doing telegraph-poles/wires miscounting?
| |
| − | ::Too early in the morning for me to untangle. The only thing I'm sure about is your division by 2^11 (how many total paths there are to get down). [[Special:Contributions/172.70.91.78|172.70.91.78]] 05:00, 16 August 2022 (UTC)
| |
| − | :::Me again. I hadn't checked that the transcript (which said it was switch #8) was correct. Have now, and found it to be wrong. Have hence also just corrected the Transcript. So I'm gonna assume your 11-choose-3 is entirely correct after all. ;) [[Special:Contributions/172.70.91.78|172.70.91.78]] 05:08, 16 August 2022 (UTC)
| |
| − | :It's actually 12 switches, not 11, but that doesn't affect the math too much. I originally thought "off" was switch 10, which would have changed the math (to 3%), but that's just the one the current ball hit. The actual "off" switch is switch 9. [[User:N0lqu|-boB]] ([[User talk:N0lqu|talk]])
| |
| − | ::It previously said that there were eleven "on" switches and one "off" switch (which is twelve in total, but it didn't add them up explicitly), and the change to say that there are 12 Ons and 1 Off made it wrong. I corrected/rephrased it (see if you agree with however it looks by the time you get around to reading this) to avoid that reading error (one which happened to me with my own first glance at the phrasing used, but I thought that was just me at the time) without adding any new misinterpretation or easy misinterpretationality.
| |
| − | ::The maths above is indeed correct enough. The 2^11 relates to the total number of unique paths it can take (assuming a bounce left/right just enough to strike the nearest offset pin below to force a new left/right bounce choice) from the first divider through to any of the 11 final left-right pin-bounces (and onto the 12 switches, at which point we're not bothered with the bouncing - diagram suggests the balls leap outwards and don't hit any other switches).
| |
| − | ::"11 choose 3" is a way how to ask, given 11 items (possible bounces), how many unique and unordered combinations of exactly 3 of these must exist (leftward-bounces, the rest being right-bounces) to filter onto the off-connected switch. (This is the same as "11 choose 8", if you decide to ask how many right-bounces are necessary, the rest being left-bounces.) That could be layer 1 (the 1-pin), 2 (the 2-pins) and 3 (...), before going consistently right to the final strike of the switch, or layers 9+10+11 (after being pure-right 1..8), but with many intermediate tracks across the pin-spacs (165 in total, as it happens; and it would be 55 to hit switch 10. Or 2, instead of 3, if you orientate things the other way round).
| |
| − | :: 165/2048 (paths hitting the off-switch (at #9) divided by all paths that might happen) is a tad over 8%. On the assumption that it's fair and unbiased and you don't get more rattling around than a simple (single half-step) left/right distribution. [[Special:Contributions/172.70.91.78|172.70.91.78]] 03:20, 19 August 2022 (UTC)
| |
| | | | |
| | + | ...you're missing out BIG time. Why? |
| | | | |
| − | To whomever did [https://www.explainxkcd.com/wiki/index.php?title=2659:_Unreliable_Connection&diff=292862&oldid=292861], doesn't [https://drops.dagstuhl.de/opus/volltexte/2018/8817/pdf/LIPIcs-FUN-2018-26.pdf] prove that symmetrical configurations nearly identical to those shown can produce uniform distributions? They seem to show it's just a matter of horizontal pin spacing. However, I for one can not verify the proof, which uses unusual (novel?) non-Unicode math notation, and a fairly opaque method of proof. [[Special:Contributions/172.70.211.134|172.70.211.134]] 00:07, 16 August 2022 (UTC)
| + | Well, how does ''page 1 rankings in BOTH Google and YouTube in 30 minutes'' sound? |
| − | :Not sure, but [https://ja.wikipedia.org/wiki/%E9%87%98%E8%AA%BF%E6%95%B4 this Japanese Wikipedia article] is fascinating. [[Special:Contributions/172.70.206.213|172.70.206.213]] 01:51, 16 August 2022 (UTC)
| |
| − | :Please see section 3.5 on pp. 16-18 of the currently first reference [https://arxiv.org/pdf/1601.05706.pdf]. I am particularly intrigued by, "Open Problem 2: Is every uniform distribution of output probabilities of the form 1/2<sup>k</sup> constructible by a 50-50 Pachinko?" on p. 18. However I haven't dived in enough to even know where the parentheses are supposed to be in that expression, yet. [[User:Liv2splain|Liv2splain]] ([[User talk:Liv2splain|talk]]) 17:27, 16 August 2022 (UTC)
| |
| − | : Good question! https://ibb.co/sRwGwB9 don't look triangular, but it seems the proof might suggest much more triangular solutions. Worth thinking about! [[Special:Contributions/172.69.33.115|172.69.33.115]] 21:24, 16 August 2022 (UTC)
| |
| | | | |
| − | What is the chance that the ball will bounce off the first pin, go down the outside of the pins and miss all the switches?
| + | DFY Suite case study ==> https://bit.ly/dfysuite40 |
| − | :Probably quite high if it's a bouncy ball. With idealized physics though it'd just hit the leftmost/rightmost switch. [[Special:Contributions/172.70.254.127|172.70.254.127]] 00:45, 16 August 2022 (UTC) | |
| | | | |
| − | I would describe the device as a https://en.wikipedia.org/wiki/Galton_board. [[Special:Contributions/172.70.230.109|172.70.230.109]] 00:30, 16 August 2022 (UTC)
| + | This Case Study video gives you an insider look at how to get 1st page rankings... |
| | | | |
| − | I was watching the photo and hover-over text and the image disappeared and "Unreliable Connection" showed up in its place. I don't know how often this happens.
| + | You'll learn how to get as much targeted traffic from the search engines as you'd like. |
| − | : Very neat if not a fluke! Can anyone replicate this experience on https://xkcd.com ? [[Special:Contributions/172.70.211.134|172.70.211.134]] 14:21, 16 August 2022 (UTC)
| |
| | | | |
| − | "An added source of humour is that Randall could likely achieve the same effect by looking through the router's settings - which most modern ones have a feature to turn on and off at scheduled times - or via purchasing a smart power strip." But by using these other methods, the connection would still be reliable. If it goes out at regular or pre-scheduled intervals then you know when it will be available or not, hence reliable. I think the joke here is that the contraption does in fact make the connection unreliable. [[Special:Contributions/172.70.114.77|172.70.114.77]] 14:18, 16 August 2022 (UTC)
| + | Of course the immense power of DFY Suite has a lot to do with these results. |
| − | : Addressed at [https://www.explainxkcd.com/wiki/index.php?title=2659:_Unreliable_Connection&diff=292926&oldid=292924]. [[User:Liv2splain|Liv2splain]] ([[User talk:Liv2splain|talk]]) 14:44, 16 August 2022 (UTC)
| |
| − | :(Edit conflicted by at least the above, but my answer to the same question...) From a user POV, unless they happen to know that at 11:53 each day (and 12:14, 15:02, 15:07, 16:31, etc...) the scheduler disables tracfic for one (or two, or three) minutes, it is still unreliable, if ultimately predictable ''once you know'' the schedule, having seen it go round a few times and taken note. Similarly a timered power-strip could be used (or even several, in serial, the two or three daily interventions by the first also stopping and delaying the subsequent strips' interventions, making their timings uneven, further down the chain) and until you got the pattern it might as well be 'random', not entirely deterministic. (I'm wondering about some OR-gate-like/etc implementation, so power can pass by at least one parallel timer-shut-off to maintain power at the lower levels while ''some'' mid-way timers get depowered and thus 'shuffled' in interesting ways, and the resulting single output is governed by an intricate multi-dependent set of routes, but I bet an electrician would be wary about wiring that up...)
| |
| − | :You could hack (or patch) the management firmware to be a bit more (pseudo)random about it, though it would still be pseudorandom LFSR/Xorshift with a (long) repetition cycle.
| |
| − | :Or make it dependant upon an external factor (if the modulo 12 of the cumulative sum of all observed packet-destination IPs is zero, shut off for the five times the prior modulo 12 test value, in seconds..?), but that's ''practically'' the pachinko solution but with software hacking rather than hardware-making/hacking as per the comic.
| |
| − | :More effort is needed to make it ultimately unpredictable, but it can still be considered unreliable if it goes out just when you 'want' it.... [[Special:Contributions/172.70.85.5|172.70.85.5]] 15:02, 16 August 2022 (UTC)
| |
| | | | |
| − | For real though, isn't this kind of a good idea? [[User:Fephisto|Fephisto]] ([[User talk:Fephisto|talk]]) 14:34, 16 August 2022 (UTC)
| + | With "DFY Suite" you'll be able to: |
| − | :Talk to edtech people in the {{w|MOOC}} space and they will tell you asynchronous is worth it, but talk to people who study educational quality factors like time to receive answers to unanticipated questions, and they will have different ideas. [[User:Liv2splain|Liv2splain]] ([[User talk:Liv2splain|talk]]) 14:44, 16 August 2022 (UTC)
| |
| | | | |
| − | Does anyone have an openWRT (or other) implementation of this feature yet?
| + | – rank your niche websites on page 1 |
| − | :You can induce it on stock firmware without reflashing, but you need to know the parameters like how often balls come out of the hopper, and what exactly the on/off switches do. As pseudocode:
| + | – rank your e-commerce websites on page 1 |
| − | ::<tt>#!/bin/sh</tt>
| + | – rank your videos on page 1 |
| − | ::<tt>while true ; do</tt>
| + | – rank your local listings on page 1 |
| − | :::<tt>sleep </tt>''seconds''
| + | – rank your Amazon listings |
| − | :::<tt>if [ `rand100` -le 8 ] ; then</tt>
| + | – rank ANY URL you'd like to get traffic for... |
| − | ::::<tt>wifictrl off</tt>
| |
| − | :::<tt>else</tt>
| |
| − | ::::<tt>wifictrl on</tt>
| |
| − | :::<tt>fi</tt>
| |
| − | ::<tt>done</tt>
| |
| − | :[[Special:Contributions/172.70.214.81|172.70.214.81]] 00:38, 17 August 2022 (UTC)
| |
| | | | |
| − | There are spaces between the button that the balls can fall into, and this could complicate the stuff a bit. However if the ratio between probability of hitting ON and probability of hitting OFF remain the same (1883:165), the average OFF time will still be the same (165/2048 of the time). The behavior that the network is switching between ON and OFF will probably be changed though. [[User:Lamty101|Lamty101]] ([[User talk:Lamty101|talk]]) 04:44, 17 August 2022 (UTC)
| + | AND you can also rank any of your client's websites... and charge them for it! |
| | | | |
| − | I would have expected the negative reviews to have mentioned all the balls on the floor and perhaps the need to periodically refill the hopper. [[User:Philhower|Philhower]] ([[User talk:Philhower|talk]]) 16:18, 17 August 2022 (UTC)
| + | But possibly the BEST thing about all of this is... |
| − | :If it's a Pachinko machine instead of just a Galton board, then refilling the hopper is done automatically by robotics behind the back wall of the device. Someday remind me to tell you about the Japanese recession caused by out-of-work hopper refillers when that innovation was introduced. [[Special:Contributions/172.70.206.95|172.70.206.95]] 02:12, 31 August 2022 (UTC) | + | |
| | + | DFY Suite is extremely easy-to-use: |
| | + | |
| | + | 1) NO software to install |
| | + | 2) NO need to go through any training |
| | + | 3) NO previous SEO experience required |
| | + | 4) NO need to create any social accounts |
| | + | 5) NO content needed (besides your URL) |
| | + | 6) NO proxies needed |
| | + | 7) NO captchas required to solve |
| | + | ... NONE of that stuff. |
| | + | |
| | + | This simplified the ENTIRE process so that anyone can tap into the power of Page 1 rankings... even if they suck at SEO. |
| | + | |
| | + | With "DFY Suite", page #1 rankings are literally just 4 simple steps away: |
| | + | |
| | + | Step #1: Log into the web-based portal |
| | + | Step #2: Enter your keywords |
| | + | Step #3: Enter the URL you want traffic for |
| | + | Step #4: Hit "Submit" |
| | + | |
| | + | That's it! |
| | + | |
| | + | Yes it's working in 2023 and the Case Study was done in 2023 Only. |
| | + | |
| | + | To your Success |
| | + | |
| | + | Aaron S. |
| | + | 87 Silver Street, MI |
| | + | 88668 |
| | + | ====== |
| | + | Click here to Unsubscribe |
Hey,
If you still haven't checked out DFY Suite...
...you're missing out BIG time. Why?
Well, how does page 1 rankings in BOTH Google and YouTube in 30 minutes sound?
DFY Suite case study ==> https://bit.ly/dfysuite40
This Case Study video gives you an insider look at how to get 1st page rankings...
You'll learn how to get as much targeted traffic from the search engines as you'd like.
Of course the immense power of DFY Suite has a lot to do with these results.
With "DFY Suite" you'll be able to:
– rank your niche websites on page 1
– rank your e-commerce websites on page 1
– rank your videos on page 1
– rank your local listings on page 1
– rank your Amazon listings
– rank ANY URL you'd like to get traffic for...
AND you can also rank any of your client's websites... and charge them for it!
But possibly the BEST thing about all of this is...
DFY Suite is extremely easy-to-use:
1) NO software to install
2) NO need to go through any training
3) NO previous SEO experience required
4) NO need to create any social accounts
5) NO content needed (besides your URL)
6) NO proxies needed
7) NO captchas required to solve
... NONE of that stuff.
This simplified the ENTIRE process so that anyone can tap into the power of Page 1 rankings... even if they suck at SEO.
With "DFY Suite", page #1 rankings are literally just 4 simple steps away:
Step #1: Log into the web-based portal
Step #2: Enter your keywords
Step #3: Enter the URL you want traffic for
Step #4: Hit "Submit"
That's it!
Yes it's working in 2023 and the Case Study was done in 2023 Only.
To your Success
Aaron S.
87 Silver Street, MI
88668
==
Click here to Unsubscribe
