Może używają tego do rozpoznawania ciebie z większych odległości? Z większych odległości dobrze widać kolor, a gorzej cokolwiek związanego z krojem, więc to pasuje do ich błędnego założenia.
(Wydaje mi się, że u mnie rozkład tego, które ubrania i jakie ich własności pamiętam pasuje do tego. Np. kojarzę kolor czepka i ramiączek kostiumu pływackiego większości moich znajomych, podobnie kolor ubrania na narty. Słabiej kojarzę kolory np. spodni, które typowo noszą.)
Question answerer strongly reminds me of https://en.wikipedia.org/wiki/The_Steerswoman
A way of using it that I found not irritating was to use it for questions of examples of things where (a) you are reasonably convinced they don't exist (b) it's easyish to verify if they do (e.g. molecules that contain helium). You don't run the risk of being fooled by its overeloquence on account of (a), and you don't end up unsure on account of (b). (The way (b) works is usually by way of you looking for a name of a thing that you can then look up.)
Nie rozumiem tak dużego wzburzenia na temat tego, że atak DoS zatrzymujący pociągi da się przeprowadzić np. z samolotu. Jeśli ktoś by to uczynił to (a) bardzo łatwo byłoby stwierdzić, który samolot to robi (b) mógłby spowodować większe zamieszanie nadając np. fałszywe sygnały GPS.
Might some of them be unable to see what's in front of you (as in, unable to see that you can't overtake the obstruction)?
BTW. https://github.com/google/wuffs/blob/main/doc/spec/rac-spec.md is an example of a spec that describes what a decoder must do, in a case where there are nontrivial constraints on it (that serve to make sure that you can't construct a compressed file that will decompress differently depending on whether you read from the beginning or not).
Well, it's a spec for the format. It says things like "a valid ZIP file MUST ...", but doesn't specify the behaviour of the parser (can the parser assume that this holds? must the parser fail if it doesn't hold? what if it doesn't hold in a part of the file the parser wouldn't even ordinarily read? etc.).
Quick grepping through those appnotes doesn't reveal any expectations around path other than ones in 4.4.17, which don't specify anything about uniqueness (nor about interpretation of nonuniqueness, but that is not something I'd expect in a specification of format as opposed to parsing).
Why isn't this just <insert archive format you like> base64-encoded?
Is the zip format standardized, or parsing of zips? Without looking I expect the former, because there are multiple ways to parse a zipfile: there's the infamous "does first or last entry for a given path count" problem (exacerbated by the distinction between "first in the directory in footer" and "first in byte order in the file itself").
@kravietz @EugeneMcParland @vfrmedia
The unprotectedness of the mechanism is (or maybe was) IMO a feature: it's hard to conceive of a way in which e.g. some trains obey a stop signal while others don't (as long as they have their radios set to the locally-correct channel). The extent of testing of train-local systems consists of sending the signal on a test channel (and making sure a test receiver acknowledged it) and asking a test transmitter to send a signal on the test channel (and checking that the appropriate actuation happened). If there was any authentication, then there'd be more potential failure modes.
Sure, I get that _this_ is very different (both in mean and variance). But aren't the effects of trying to stay well above the-value-that-got-randomized-for-today similar? (Or are you saying that for many people this range starts so high that they never get to experience trying to stay in it for more than a day at a time?)
Huh. I thought this is a universal property of humans (for basically any axis of capacity I can think of).
ISO 8601 also defines lots of totally crazy formats (for weeks, seasons, quarters, ...). RFC 3339 defines what, I think, you want.
I think it's more of a case of there being very popular architectures without LL/SC, so people consider a paper that does something with just CAS to be stronger than one that uses LL/SC (because as you've described it's trivial to make CAS out of LL/SC but not v.v.). I don't recall off the top of my head of any data structure where we'd have a significantly better result (either wait-free or lock-free, either on memory or time complexity) if LL/SC was available.
That said, most of my knowledge comes from the theoretical side, so: (a) I might be missing an area where this is actually used a lot (b) the theoretical side uses IMO very questionable measures of complexity[1] so there might be cases where LL/SC allows for some great savings that they ignore.
[1] I haven't seen (nor did I manage to construct one) a measure of complexity that would count how many nontrivial cache coherency protocol invocations we'll need to wait for. (The problem with constructing one is iirc a combination of (a) we want to count depth of the dependency graph rather than total count (b) it's unclear what kind of quantification over states of the world before the operation we want: worst case is *not* sensible, because then we'll assume that every cache line is exclusive somewhere else).
By "not seeing hazard pointers used outside of theory" I meant that in places which would use them I'd see RCU used instead (with the thing that deallocates -- which might be a thing to the side of everything else -- waiting on the RCU "lock").
I was under the impression that ll/sc in hardware is terribly rare, so everyone makes do with CAS. They then use of the tricks to prevent ABA in CAS-based setups (either counters we trust to never wrap around, or pointers to objects that the actor who does the CAS keeps alive[1]). If we had ll/sc those tricks would be unnecessary.
So, I think that people don't use that property of ll/sc because they don't use ll/sc, because it's very rarely available.
[1]
roughly:
- read ptr from X
- increment refcount on *ptr
- read X again, verify it's still equal to ptr (if not: decrement refcount, start from scratch)
- ...
- CAS X from ptr to something else
- decrement refcount on *ptr (and potentially handle the case when it decrements to 0)
This guarantees ABA-freeness of the CAS if each potential target of the pointer in X can become it only once in its lifetime (which is pretty common in structures such as queues, stacks, approximate queues, ...).
This is a reasonably common pattern in lockfree data structures that need to do their own memory management (i.e. for environments without a garbage collector) and that don't want to use thread IDs (if they can, refcounts often get replaced with hazard pointers; that said, I've never seen hazard pointers used outside of theory).
There was a case 10~20 years ago of a teenager who started triggering emergency stop for fun using self-modified radio equipment. I was actually surprised that no vandalism-leaning person did something similar in a massively disruptive way (by hiding multiple transmitters and doing so in a well-chosen location), so I wouldn't exclude the vandalism hypothesis yet.
BTW. The physical proximity requirement is not that strong: the range is limited by terrain and R^2, and fixed transmitters of rail dispatchers have a range of iirc small tens of km. I would wager that using a transmitter with ERP of 100W or so from a good vantage point would give you at least as much.
Dzięki.
Wiesz może coś o historii tego słowa (albo skąd je znasz)? Jedyne referencje jakie do niego umiem znaleźć (w znaczeniach niezwiązanych z walką) są z nomenklatury używanej przez PPS, a też nie umiem znaleźć go w żadnym słowniku (co prawda nie mam teraz żadnego papierowego słownika języka polskiego w domu); nawet w takich, w których jest np. "deszczochron". Ciekaw jestem, czy to jest po prostu bardzo rzadkie słowo, czy jest regionalne (lub slangowe z jakiejś subkultury), czy...?
OT: co dokładnie znaczy ogólnobojowy?
I enjoy things around information theory (and data compression), complexity theory (and cryptography), read hard scifi, currently work on weird ML (we'll see how it goes), am somewhat literal minded and have approximate knowledge of random things. I like when statements have truth values, and when things can be described simply (which is not exactly the same as shortly) and yet have interesting properties.
I live in the largest city of Switzerland (and yet have cow and sheep pastures and a swimmable lake within a few hundred meters of my place :)). I speak Polish, English, German, and can understand simple Swiss German and French.
If in doubt, please err on the side of being direct with me. I very much appreciate when people tell me that I'm being inaccurate. I think that satisfying people's curiosity is the most important thing I could be doing (and usually enjoy doing it). I am normally terse in my writing and would appreciate requests to verbosify.
I appreciate it if my grammar or style is corrected (in any of the languages I use here).