The nonlinear evolution of the Richtmyer–Meshkov RM instability is investigated using numerical simulations with the FLASH code in two dimensions. The purpose of the simulations is to develop an empirical nonlinear model of the RM instability that is applicable to inertial confinement fusion ICF and ejecta formation, namely, at large Atwood number A and scaled initial amplitude kho k wave numbe...

Since 2003, Algebraic Attacks have received a lot of attention in the cryptography literature. In this context, algebraic immunity quantifies the resistance of a Boolean function to the standard algebraic attack of the pseudo-random generators using it as a nonlinear Boolean function. A high value of algebraic immunity is now an absolutely necessary cryptographic criterion for a resistance to a...

Recently, (linear) codes over and quasi-cyclic (QC) codes (over fields) have been shown to yield useful results in coding theory. Combining these two ideas we study -QC codes and obtain new binary codes using the usual Gray map. Among the new codes, the lift of the famous Golay code to produces a new binary code, a (92 2 28)-code, which is the best among all binary codes (linear or nonlinear). ...

We present a mixed-integer nonlinear programming (MINLP) formulation to achieve minimum-cost designs for reinforced concrete (RC) structures that satisfy building code requirements. The objective function includes material and labor costs for concrete, steel reinforcing bars, and formwork according to typical contractor methods. Restrictions enforce correct geometry of the cross-section dimensi...

A time-domain numerical code (the so-called Texas code) that solves the Khokhlov-Zabolotskaya-Kuznetsov (KZK) equation has been extended from an axis-symmetric coordinate system to a three-dimensional (3D) Cartesian coordinate system. The code accounts for diffraction (in the parabolic approximation), nonlinearity and absorption and dispersion associated with thermoviscous and relaxation proces...

We introduce a computer program PENNON for the solution of problems of convex Nonlinear and Semidefinite Programming (NLP-SDP). The algorithm used in PENNON is a generalized version of the Augmented Lagrangian method, originally introduced by Ben-Tal and Zibulevsky for convex NLP problems. We present generalization of this algorithm to convex NLP-SDP problems, as implemented in PENNON and detai...