Did we read the same paragraph? The problem with his first thesis was that, though he presented a brilliant and original result, he didn’t show that he’d studied enough prior research.
Nothing to do with schmoozing, everything to do with scholarly integrity.
We’re looking for someone to help us integrate SAML authentication into a Python/Flask web app (as a Service Provider, wanting to authenticate against IdPs). There is already a full authentication system in-place — all that needs doing is integration with SAML-based SSO.
Knowledge of Python or Flask is not needed but extensive experience of SAML — and, ideally, the UK Access Management Federation and/or comparable schemes around the world — will be needed.
> Freedom of speech is not freedom from criticism.
“Sorry, you wrote this and we don’t like it, therefore you’re not invited to this conference on an irrelevant topic” or “… therefore we’re not going to a conference to which you were invited” is not valid criticism of an idea.
12 years experience, 5 professional, in Python and Ruby web development, with popular frameworks (Rails, Sinatra, Flask). Additional experience in PHP, JavaScript, etc. Open-source work is at https://github.com/dpk and https://gist.github.com/dpk
Perl 6 uses rationals by default. They have the advantages of being base-agnostic, able to accurately represent any recurring digit expansion accurately regardless of eventual base, and also faster (since, especially if you normalize (convert to lowest terms) lazily, most operations are just a few integer instructions with no branching, looping, or bit-twiddling involved).
The Oxford Dictionary of National Biography (https://en.wikipedia.org/wiki/Dictionary_of_National_Biograp...) follows a similar model to the SEP to deliver on the comprehensive/authoritative/up-to-date trifecta. Unfortunately it’s paywalled, unlike SEP, but it’s certainly the best biographical encyclopedia I know of because of this.
If it is, it’s big news. But bear in mind that ‘John le Fucker’, recorded 1278, (https://en.wikipedia.org/wiki/John_le_Fucker) would be a further antedating from a personal name if it were somehow to be confirmed as a use of the word.
The Unicode case-mapping algorithm is customizable by locale (e.g. uppercase i is İ in Turkish). A application which needed long s (for German Fraktur, for instance) could use a custom locale.
My mistake, I meant O(2 ^ n) indeed. Regardless, having exponential time complexity in terms of the regular expression (which is usually controlled by the programmer) where the processing is done at compile-time is much better than having exponential complexity in terms of the input string (which often comes from an untrusted source) where the processing is done at run-time.
Not true. Finite automata (NFAs, DFAs) can match that pattern (and any pattern that doesn't involve backreferences or lookaround) in O(n) time where n is the size of the input string. DFA implementations are worst-case O(n ^ 2) in the number of states of the regular expression, but this is far better in most cases than the exponential worst-case time in terms of the input string offered by backtracking implementations.