Neural codes are collections of binary strings motivated by patterns of neural activity. In this paper, we study algorithmic and enumerative aspects of convex neural codes in dimension 1 (i.e. on a line or a circle). We use the theory of consecutive-ones matrices to obtain some structural and algorithmic results; we use generating functions to obtain enumerative results.

Many application codes, such as Ž nite element structural analyses and computational  uid dynamics codes, are capable of producing many sensitivity derivatives at a small fraction of the cost of the underlying analysis. A simple variance reduction method is described that exploits such inexpensive sensitivity derivatives to increase the accuracy of sampling methods. Five examples, including a ...

This paper examines the possible causes of collapse of a primary school in San Giuliano, Italy, in the 2002 Molise earthquake, which killed 27 students and one teacher. It also considers the general sources of seismic vulnerability of school buildings in Italy prior to the introduction of new seismic zonation and new seismic codes in 2003. In addition to incomplete seismic zonation and inadequa...

Many application codes, such as finite-element structural analyses and computational fluid dynamics codes, are capable of producing many sensitivity derivatives at a small fraction of the cost of the underlying analysis. This paper describes a simple variance reduction method that exploits such inexpensive sensitivity derivatives to increase the accuracy of sampling methods. Three examples, inc...

‎s‎. ‎kim et al‎. ‎have been analyzed the girth of some algebraically‎ ‎structured quasi-cyclic (qc) low-density parity-check (ldpc)‎ ‎codes‎, ‎i.e‎. ‎tanner $(3,5)$ of length $5p$‎, ‎where $p$ is a prime of‎ ‎the form $15m+1$‎. ‎in this paper‎, ‎by extension this method to‎ ‎tanner $(3,7)$ codes of length $7p$‎, ‎where $p$ is a prime of the‎ ‎form $21m‎+ ‎1$‎, ‎the girth values of tanner $(3,7...

Bearing or compressive-strength capacity perpendicular to the grain of timber beams is a troublesome issue. Not only do many different load cases occur in practice that are not covered by structural timber design codes, but also these codes provide only a basic provision and vary throughout continents. Code design rules require the standardized compressive or bearing strength to be determined b...

In this paper, we propose a nonlinear structural hashing (NSH) approach to learn compact binary codes for scalable video search. Unlike most existing video hashing methods which consider image frames within a video separately for binary code learning, we develop a multi-layer neural network to learn compact and discriminative binary codes by exploiting both the structural information between di...

in this paper, we propose space-time block codes based on constituent intersectant orthogonal designs. after channel model is formulated, we studied the space-time block codes from constituent intersectant orthogonal designs. at last we made simulations for the space-time block codes from complex orthogonal design and the space-time block codes from constituent intersectant orthogonal design to...

Let R = Zq + uZq, where q = p and u = 0. In this paper, some structural properties of cyclic codes and quasi-cyclic (QC) codes over the ring R are considered. A QC code of length ln with index l over R is viewed both as in the conventional row circulant form and also as an R[x]/(x − 1)-submodule of GR(R, l)[x]/(x − 1), where GR(R, l) is the Galois extension ring of degree l over R. A necessary ...

Let R = Zq + uZq, where q = p s and u = 0. In this paper, some structural properties of cyclic codes and quasi-cyclic (QC) codes over the ring R are considered. A QC code of length ln with index l over R is viewed both as in the conventional row circulant form and also as an R[x]/(xn − 1)-submodule of GR(R, l)[x]/(xn − 1), where GR(R, l) is the Galois extension ring of degree l over R. A necess...