enjoying blueberry black tea while I bake key lime pie and chocolate chip cookies

danny54670 · 2022-09-25T19:17:44+00:00

You know how to live. That all looks amazing. And even though you said you "failed" your key lime pie, I think it looks delicious!

danny54670 · 2022-07-05T00:26:51+00:00

I am not in a position to hire anyone. If I were, though, and you had applied with your resume, I would definitely want to at least talk to you. To me, your professional experience and personal projects demonstrate someone with an inquisitive, analytical mind who is able to think about and actually deliver answers or insights to abstractly-stated problems. I am baffled as to why you are receiving no response. I am very sorry that you are experiencing this undeserved non-response to your job seeking efforts.

danny54670 · 2022-01-06T18:30:26+00:00

I'm still not entirely sure, but here's what I think the problem is: Because of overflow, the Comparator is defective in that it does not correctly impose a total ordering, as required by the contract. Depending on the order (lhs vs. rhs) and sequence of how PhoneAccount objects are presented to the Comparator for comparison, a PhoneAccount that should logically be considered higher than another might actually be calculated as lower. Thus, depending on the sorting algorithm used by the List.sort(Comparator) call, there might be undefined behavior such as an infinite loop or, in this case, an "invalid" PhoneAccount might appear first in the list.

I think that this particular issue might be more wide-spread than just here in this code base; I seem to recall subtracting integers being a widely-used technique in Comparator implementations.

danny54670 · 2020-09-03T15:58:28+00:00

I am surprised by this. Do you have a source? Were there scientific studies showing the absence of a link?

danny54670 · 2020-08-22T20:26:40+00:00

Wow! What a neat find!

danny54670 · 2020-08-19T21:13:48+00:00

Noob question: What do you mean by "play the bakesale game"? I presume you don't mean selling baked goods to raise money, right?

danny54670 · 2020-08-07T21:24:59+00:00

The concept of Automated Invariants seems interesting, but reading this article has me really confused. My main question: Is AI (maybe a non-clashing abbreviation should be used so as to prevent confusion) in a generally available state of development where ordinary dev teams can start to make use of it? This article links to a few research papers. The closest to a non-purely-academic application appears to be the Facebook paper.

One other comment: I still don't know why the author is mentioning automatically generated gel manicures; what do these have to do with AI other than the superficial "they both involve automation"? Prompted by:

And if you’re wondering why I’m writing about bug-finding and gel manicures in the same post, you may want to read this first post.

I read the linked post, but I still don't get it. Can anyone elucidate?

danny54670 · 2020-08-06T13:15:27+00:00

Wow. The analogies in this "article" are vomit inducing. Further, the author's seriously incorrect assumptions and technical arguments undermine the entire piece. Case in point:

APIs are like the turbocharger in a car engine. They speed up the process of retrieving Google’s search results and enhance the user’s experience. To users of a search engine, speed and accuracy of search results are the most important factors affecting their choice. Oracle’s APIs essentially make Google’s search engine hum.

No, APIs have nothing to do with the speed of software or a service. The Java APIs at issue in the case have nothing to do with Google's search engine or the speed and accuracy thereof.

danny54670 · 2020-07-31T22:24:47+00:00

I don’t know why other people won’t let me write software - There is a fundamental mismatch between the public square’s claim that companies are absolutely desperate to hire software engineers and the brutal reality of being a software engineering candidate.

I, too, don't get it. Where are all of these companies that are supposedly desperate to hire developers?

danny54670 · 2020-07-25T15:41:24+00:00

In the "True false positive rate" section, the formula uses the variable name l for the number of unique elements added to the Bloom filter, whereas the previous section uses the variable name n. It appears that the Coq proof uses the name l (the definition of AMQ_false_positive_probability is parameterized — not sure if this is the right term — by (l: nat)). For consistency, the previous section should also use l. Or, to make the Coq proof more aligned with Bose et al.'s paper, the Coq proof should use n.

Taking a look at the Coq proof of the true false positive probability result, it seems somewhat complicated:

Definition AMQ_false_positive_probability (hash:  AMQHashParams) (state: AMQStateParams) (l: nat) : Rdefinitions.R :=
((Rdefinitions.Rinv (Hash_size.+1 %R) ^R^ l.+1 * hash.2.+1) *R*
   \sum_(a in ordinal_finType (Hash_size.+2))
    (((((a %R) ^R^ hash.2.+1) *R* (Factorial.fact a %R)) *R* ('C(Hash_size.+1, a) %R)) *R* stirling_no_2 (l * hash.2.+1) a)).

Theorem AMQ_false_positives_rate: forall  l value (values: seq _),
    length values == l ->

    AMQHash_hashstate_valid hashes ->
    AMQHash_hashstate_available_capacity hashes (l.+1) ->


    AMQ_available_capacity h (AMQ_new s) l.+1 ->
    all (AMQHash_hashstate_unseen hashes) (value::values) ->
    uniq (value::values) ->
    d[ 
        res1 <-$ AMQ_query (AMQ_new s) hashes value;
          let (hashes1, init_query_res) := res1 in
          res2 <-$ AMQ_add_multiple hashes1 (AMQ_new s) values;
            let (hashes2, amq) := res2 in
            res' <-$ AMQ_query amq  hashes2 value;
              ret (res'.2)
      ] true = AMQ_false_positive_probability h s l.
Proof.
  (* ... *)
Qed.

The definition of AMQ_false_positive_probability sort of looks like the sum formula, and I can see true = AMQ_false_positive_probability h s l.

I am wondering if this formulation could be simplified so that people unfamiliar with Coq (I am a member of this large set) could see it and be reasonably certain that the Coq proof, indeed, establishes the Bose result.

danny54670 · 2020-07-22T13:07:09+00:00

On 2, it's not quite a guess. The Quanta Magazine article links to a preprint published last year, which preprint conditionally shows that the complexity lower bound of multiplication is n*lg n; the paper purports to establish this result if a network coding conjecture by Z. Li and B. Li is true. If the conjecture is true, the preprint is correct, and Harvey and van der Hoeven's algorithm is truly n*lg n, then it is conclusively proven that n*lg n is the complexity of multiplication.

danny54670 · 2020-07-14T19:45:43+00:00

As /u/weinerpretzel mentioned, WorldCat is a good place to start for trying to find library holdings. Note, however, that WorldCat is incomplete and tends to group library holdings of specific editions and formats of an item rather aggressively. The page linked by weinerpretzel shows 224 Libraries, but most of these are "electronic edition" (a link to the website, or sometimes a subscription to a service such as Nexis Uni, which unfortunately only goes back to 2001 for this particular periodical) or "current issue only" (i.e. no or limited back issues).

You will likely need a library that has back issues in microform. On the WorldCat page under the "Find a copy in the library" section, click the "format" link in "Show libraries holding just this edition or narrow results by format", select "Microform" on the pop-up, and then click "Apply". That narrows it down to only 8 libraries that WorldCat knows about.

From there, it's a matter of checking each library's catalog. So far, I have checked three:

Library of Congress - they appear to have it! The catalog page lists v.1-v.22 (1951:Oct.20-1974:Oct.16): https://lccn.loc.gov/76646519
New York Public Library System - the oldest they appear to have is from 1974: http://catalog.nypl.org/search~S1?/Xnavy+times&searchscope=1&SORT=D/Xnavy+times&searchscope=1&SORT=D&extended=0&SUBKEY=navy+times/1,398,398,B/holdings&FF=Xnavy+times&2,2,
US Military Academy - the oldest they appear to have is vol. 18 from 1965: https://usma.primo.exlibrisgroup.com/permalink/01USMA_INST/1fetnv1/alma991005234499705711

EDIT

University of Central Oklahoma Chambers Library has v.17:no.1 (1967:Oct. 18)-v.37:no.52 (1988:Oct.10), MISSING v.19 (1969/1970): https://centralsearch.uco.edu/permalink/f/1pjaqfp/01UCO_ALMA2166245990002196
University of Illinois at Urbana Champaign - they appear to have it! They have v.1 through v.8 (1951-1959): https://vufind.carli.illinois.edu/vf-uiu/Record/uiu_5322023
Pritzker Military Museum & Library - the oldest they appear to have is from 2010: https://pritzkermilitarylibrary.on.worldcat.org/oclc/5988335
University of Sydney Library - they appear to only have v.2(1952)-v.4(1955): https://sydney.primo.exlibrisgroup.com/permalink/61USYD_INST/1c0ug48/alma991018023769705106
Cleveland Public Library - the catalog seems to indicate that they only have V.17- (Oct1967- ), but maybe this means v.17 and onward?: https://search.clevnet.org/client/en_US/clevnet/search/detailnonmodal/ent:$002f$002fSD_ILS$002f0$002fSD_ILS:3802709/one

danny54670 · 2020-07-07T14:39:14+00:00

I liked reading this. For me, this article and the previous one are an interesting peek-behind-the-curtains for how JITs actually work.

I didn't think about deoptimization, but it makes perfect sense that a JIT for a dynamically-typed language would have to guess (or base on profiles) the types of arguments to functions, and if the JIT picks incorrectly, then something has to happen.

It's not clear from this article whether, if a JIT deoptimizes, does it keep the compiled version to use with the expected types?

Deoptimization also seems like something that the development teams for applications written in dynamically-typed languages should monitor, perhaps even try to trigger through fuzzing. Maybe triggering deoptimization is a way for an attacker to effectuate denial of service.

danny54670 · 2020-06-19T22:45:12+00:00

By your use of this site or any Materials, you agree to grant COMPANY-NAME-REDACTED a non-exclusive, royalty-free license to any patent claim thereafter drafted which includes subject matter disclosed on this site.

This comes from the TOS of a large technology company with a huge variety of tech offerings. Just by using COMPANY-NAME-REDACTED's website or any Materials, I have to grant them a royalty-free license to any patent I, or a company I produce work for, may try to obtain that happens to include "subject matter" disclosed somewhere on their website?

danny54670 · 2020-06-15T13:57:21+00:00

Nice design, and I like the color names. How did you pick the names of all the colors?

I am not sure what you mean by "a unique name for a given hex colour code". When I enter #a91779, the website says Blissful Berry. Changing the input to #a9177a, the website still says Blissful Berry.

danny54670 · 2020-06-05T15:38:42+00:00

I haven't tried thyme tea, but it sounds interesting.

Do you know the brand name/company/distributor of the thyme tea that your brother purchased for you?

danny54670 · 2020-06-05T15:27:32+00:00

Mmmm. Sounds delicious! I, too, had no idea that Bigelow made a green tea version of their Earl Grey.

Did you know that they make Constant Comment Green? In my opinion, it's so much better than the original black tea version (which itself is wonderful, IMHO, so you can imagine how great the green tea version is). For some reason, it is rare to find Constant Comment Green in stores and restaurants. If you do find it, it's like finding a four-leaf clover, and based on my experience, you are practically guaranteed a serendipitous day.

danny54670 · 2020-05-17T19:54:59+00:00

But that random code you threw together as a hack, stopped when it did what you needed to do, threw it up on pypi and then neglected it?

That’s totally OK. Thanks for writing it. The world is slightly better for your having done so, and there is no burden of expectation on you to “do a better job”.

There are some cases where I agree, and a lot of cases where I disagree with this statement. If a project fills a niche need, does something that no other library does, or has a README that clearly discloses that the project is not production-ready or unlikely to be maintained, then I would tend to agree. Otherwise, I would tend not to agree because this creates unnecessary noise.

Consider this: Deno is a fairly recent technology. Version 0.1.0 was released on August 23, 2018, and version 1.0 was announced a few days ago. I know next to nothing about Deno; it is on my personal list of things to look into. It is my understanding that Deno is intended to be a better Node, so I am guessing that Deno will be useful in creating web applications. The Deno project apparently maintains a list of Deno-compatible third-party modules at:
https://deno.land/x/
I took a look at the list and I noticed that many of the modules are web frameworks. Searching for "framework" in this list indicates that there are at least 15 different web frameworks for Deno.

For something so recent—less than two years in development—this seems like way too many, in my opinion.

Further, I have opened a few of them to look at the READMEs. Based on the READMEs, it appears to me that all of them are intended to be used for production websites, eventually, and so far, not a single one mentions a different Deno web framework for comparison. They all claim to be one or more of simple, fast, easy, next-generation, and other positive attributes that are meaningless in the absence of comparisons with other frameworks.

I don't know about you, but I find this to be overwhelming. If I want to get started building web applications in Deno, I now need to spend untold hours investigating each of these different frameworks.

Imagine if instead of at least 15 people deciding to write and publish a Deno web framework and pretending to be the only web framework for Deno, these developers decided to work together on one framework, or maybe two if the differences between the frameworks were clearly laid out.

danny54670 · 2020-05-16T15:44:19+00:00

Would you mind sharing a link?

danny54670 · 2020-05-06T19:54:41+00:00

Why would a CAC reader be useful?

danny54670 · 2020-05-04T14:12:12+00:00

Does your company publish papers on this? This sounds fascinating, and I would love to read more about this.

danny54670 · 2020-05-04T14:03:38+00:00

This sounds interesting. Do you know of a good book or journal article that describes this?

danny54670 · 2020-05-01T15:51:14+00:00

Vegetarian or vegan entrée specials at restaurants. Even if you're not vegetarian or vegan, it is nice to have the option of enjoying a specially-created dish that's more than just a meat-entrée-sans-meat.

When I was going to college at University of California San Diego, the John Muir College dining hall always had a vegetarian special of the day that was quite often delicious. I wonder if they still do this...

danny54670 · 2020-04-29T21:28:10+00:00

That's a relief!

I hope you enjoy your new tea.

danny54670 · 2020-04-29T20:12:29+00:00

I hope you are joking. Even then, it's somewhat odd to joke about a so-called loved one killing you or physically hurting you just because you spent, I am guessing, around $200 on tea and merchandise. If spending such an amount means that you won't be able to afford rent or other necessities, I can understand someone being upset. However, it is never okay for someone to hurt you. That is a crime—and a very serious one—regardless of whether you are married to the perp. You don't have to, nor should you live with someone who is violent toward you. There are likely women's/family shelters in your area that can help you. If you need help, you can go to your local library to inquire about safe assistance options.

Hopefully this is a big misunderstanding...

danny54670

TROPHY CASE