Benki โ†’ Bookmarks

โ‡  previous page next page โ‡ข

Weyl is an extensible algebraic manipulation substrate that has been designed to represent all types of algebraic objects. It deals not only with the basic symbolic objects like polynomials, algebraic functions and differential forms, but can also deal with higher level objects like groups, rings, ideals and vector spaces. Furthermore, to encourage the use of symbolic techniques within other applications, Weyl is implemented as an extension of Common Lisp using the Common Lisp Object Standard so that all of Common Lispโ€™s facilities and development tools can be used in concert with Weylโ€™s symbolic tools.

[H]ere are a few notes on how to configure operating systems and write code to support thousands of clients. The discussion centers around Unix-like operating systems, as that’s my personal area of interest, but Windows is also covered a bit.

I’m a little frustrated with finding “gdb examples” online that show the commands but not their output. gdb is the GNU Debugger, the standard debugger on Linux. I was reminded of the lack of example output when watching the Give me 15 minutes and I’ll change your view of GDB talk by Greg Law at CppCon 2015, which, thankfully, includes output! It’s well worth the 15 minutes.

It also inspired me to share a full gdb debugging example, with output and every step involved, including dead ends. This isn’t a particularly interesting or exotic issue, it’s just a routine gdb debugging session. But it covers the basics and could serve as a tutorial of sorts, bearing in mind there’s a lot more to gdb than I used here.

Boomerang is a programming language for writing lensesโ€”well-behaved bidirectional transformationsโ€”that operate on ad-hoc, textual data formats. Every lens program, when read from left to right, describes a function that maps an input to an output; when read from right to left, the very same program describes a “backwards” function that maps a modified output, together with the original input, back to a modified input.

Lenses have been used to solve problems across a wide range of areas in computing including: in data converters and synchronizers, in parsers and pretty printers, in picklers and unpicklers, in structure editors, in constraint maintainers for user interfaces, in software model transformations, in schema evolution, in tools for managing system configuration files, and in databases where they provide updatable views.

  • Browser interface for Issuing, Managing, and Using tokens
  • Supporting PKI, OTP, Information Cards, etc.
  • VSDs (Virtual Security Domains) enabling independent issuers securely Sharing a token container
  • Transaction Based Operation and E2ES (End To End Security) making on-line personalization of tokens Technically as secure and robust as traditional smart card production in a “bunker”
  • Unified system for enhanced smart cards and mobile phones with embedded security hardware
  • Compatible with an extended version of W3C’s WebCrypto (WebCrypto++)
  • Building on Standards like X.509, TLS, HTTP, JSON, NSA Suite B and Brainpool Elliptic Curves

For those who are heavy into authentication technologies, I have compiled a set of links to the most important documents.

Gonimo ist ein Babyphon, fรผr dessen Benutzung du einfach einen Web-Browser benรถtigst.

Ist in Haskell geschrieben und verwendet GHCJS und Reflex-DOM fรผr das Frontend.

This tutorial teaches you all you need to know to be able to craft powerful time-saving regular expressions. It starts with the most basic concepts, so that you can follow this tutorial even if you know nothing at all about regular expressions yet.

The tutorial doesn’t stop there. It also explains how a regular expression engine works on the inside, and alert you at the consequences. This helps you to quickly understand why a particular regex does not do what you initially expected. It will save you lots of guesswork and head scratching when you need to write more complex regexes.

โ‡  previous page next page โ‡ข