Low-Code, No-Code, What's Under the Hood?

The order: No Code.

Algebraic Matching of Vulnerabilities in a Low-Level Code

This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...

New Code Changes under the 2009 IBC

The evolution of building codes typically produce design provisions that are expected to create safer and more accurate designs. We as engineers expect building codes to advance the state of the art with each successive edition. The 2009 International Building Code (IBC) and the Building Code Requirements for Structural Concrete (ACI 318-08) have significant revisions affecting the design of ti...

A&a Manuscript No. an Sph Code for Galaxy Formation Problems Presentation of the Code

We present and test a code for two-uid simulations of galaxy formation, one of the uids being collision-less. The hydrodynamical evolution is solved through the SPH method while gravitational forces are calculated using a tree method. The code is Lagrangian, and fully adaptive both in space and time. A signiicant fraction gas in simulations of hierarchical galaxy formation ends up in tight clum...

The Golay Code Outperforms the Extended Golay Code Under Hard-Decision Decoding

We show that the binary Golay code is slightly more power efficient than the extended binary Golay code under maximum-likelihood (ML), hard-decision decoding. In fact, if a codeword from the extended code is transmitted, one cannot achieve a higher probability of correct decoding than by simply ignoring the 24th symbol and using an ML decoder for the non-extended code on the first 23 symbols. T...