setback in elevation of a structure is a special irregularity with considerable effect on its seismic performance. this paper addresses multistory reinforced concrete (rc) frame buildings, regular and irregular in elevation. several multistory reinforced concrete moment resisting frames (rcmrfs) with different types of setbacks, as well as the regular frames in elevation, are designed according...

In this paper we investigate encoding the bit-stream resulting from coarse Sigma-Delta quantization of finite frame expansions (i.e., overdetermined representations) of vectors. We show that for a wide range of finite-frames, including random frames and piecewise smooth frames, there exists a simple encoding algorithm —acting only on the Sigma-Delta bit stream— and an associated decoding algori...

We design alternative dual frames for linearly reconstructing signals from Sigma-Delta (Σ∆) quantized finite frame coefficients. In the setting of sampling expansions for bandlimited functions, it is known that a stable rth order Sigma-Delta quantizer produces approximations where the approximation error is at most of order 1/λ , and λ > 1 is the oversampling ratio. We show that the counterpart...

By Isbell duality, each compact regular frame L is isomorphic to the frame of opens of a compact Hausdorff space X. In this note we study the spectrum Spec(L) of prime filters of a compact regular frame L. We prove that X is realized as the minimum of Spec(L) and the Gleason cover of X as the maximum of Spec(L). We also characterize zero-dimensional, extremally disconnected, and scattered compa...

This paper is a continuation of [Uniformities and covering properties for partial frames (I)], in which we make use of the notion of a partial frame, which is a meet-semilattice in which certain designated subsets are required to have joins, and finite meets distribute over these. After presenting there our axiomatization of partial frames, which we call $sels$-frames, we added structure, in th...

In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius ρ equal to 3 or 4, and are 1/2-th parts, for i ∈ {1, . . . , u} of binary (respectively, extended binary) Hamming codes of length n = 2 − 1 (respectively, 2), where m = 2u. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs...