Abstract On the basis of elaborating connotation intensive city block, it is pointed out that structure organization key to realize block. The order complexity block formed by close connection, overlapping elements, depth difference and their compound association. This paper constructs basic pedigree design from three levels street configuration, plot building layout, forms derivation comprehen...

This paper presents a modular and extensible style of language speciication based on meta-computations. This style uses two monads to factor the static and dynamic parts of the speci-cation, thereby staging the speciication and achieving strong binding-time separation. Because metacomputations are deened in terms of monads, they can be constructed modularly and ex-tensibly using monad transform...

Transpose form finite-impulse response (FIR) filters are inherently pipelined and support multiple constant multiplications (MCM) technique that results in significant saving of computation. However, transpose form configuration does not directly support the block processing unlike direct form configuration. In this paper, we explore the possibility of realization of block FIR filter in transpo...

Introduction: Block-oriented structures are useful to model a nonlinear system. Applications range from RF amplifiers over chemical processes to physiological systems [1]. A block-oriented model consists of two types of blocks: Linear Time Invariant (LTI) and static nonlinear blocks. The most simple block-oriented model structures are the Wiener (a LTI block followed by a static nonlinear block...

In this report, we examine the validity of the haplotype block concept by comparing block decompositions derived from public data sets by variants of several leading methods of block detection. We first develop a statistical method for assessing the concordance of two block decompositions. We then assess the robustness of inferred haplotype blocks to the specific detection method chosen, to arb...

Due to the editorial process, there may be slight discrepancies between this version and the published one. Abstract|The problem of minimizing the vertex count at a given time index in the trellis for a general (nonlinear) code is shown to be NP-complete. Examples are provided that show that 1) the minimal trellis for a nonlinear code may not be observable, i.e., some codewords may be represent...

A method for the inversion of block tridiagonal matrices encountered in electronic structure calculations is developed, with the goal of efficiently determining the matrices involved in the Fisher–Lee relation for the calculation of electron transmission coefficients. The new method leads to faster transmission calculations compared to traditional methods, as well as freedom in choosing alterna...

Most multivariate variance models suffer from a common problem, the " curse of dimensionality ". For this reason, most are fitted under strong parametric restrictions that reduce the interpretation and flexibility of the models. Recently, the literature has focused on multivariate models with milder restrictions, whose purpose was to combine the need for interpretability and efficiency faced by...

In this paper essential aspects of block-oriented world viewing are emphasized and presented in a relation to simulation models of systems managed by complex and sophisticated decision rules. The construction of such models can be essentially simplified when one combines the agent-oriented, object-oriented and blockoriented paradigms of programming. The use of the described way leads to certain...

Community detection is an important task in network analysis, in which we aim to learn a network partition that groups together vertices with similar community-level connectivity patterns. By finding such groups of vertices with similar structural roles, we extract a compact representation of the network’s large-scale structure, which can facilitate its scientific interpretation and the predict...