Polyurea is a special type of elastomer that features fast setting time as well as good chemical and fire resistance. It has also good mechanical properties such as its high toughness-to-density ratio and high strain rate-sensitivity, so its application is recently extended to structural purpose to form sandwich-type or multi-layered plates. Those structures can be used for retrofitting of mili...

A Finite Element Analysis (FEA) system was designed for the analysis of creep deformation and damage evolution in weldment. This project essentially consists of three parts which involves 1) transfer programme development, 2) numerical integration subroutine development, and 3) validation of complete FEA system. Firstly, the development of a user-friendly preand postprocessing transfer programm...

A RELAP5-3D model has been developed for the RBMK Kursk 1 NPP. The primary features of this model are the three-dimensional neutronics model of the reactor core and the user subroutine that generates the neutron cross-sections. This subroutine contains the same neutron cross-section libraries that are presently being used in the Russian STEPAN/KOBRA calculations. The implementation of the neutr...

Micali and Valiant proposed a mechanism for combinatorial auctions that is dominant-strategy truthful, guarantees reasonably high revenue, and is very resilient against collusions. Their mechanism, however, uses as a subroutine the VCG mechanism, that is not polynomial time. We propose a modification of their mechanism that is efficient, while retaining their collusion resilience and a good fra...

This works proposes a novel approach to develop higher-order finite elements by taking progressive damage into account in the formulation. The is based on Carrera’s unified formulation (CUF) while model continuum mechanics (CDM) principles, which implemented as UEL (User Element subroutine) written FORTRAN and linked Abaqus. assessed simulating plate under distributed sinusoidal loads. Besides,...

We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c;x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the capacity constraints. We consider the class of canonical utility functions, consisting of functions U that are symmetric, non-decreasing, concave, and satisfy U(0) = 0. Natural primal-dual algorithms exist for maximizing suc...