Neural systems have been assumed to represent knowledge through the embodiment of sensory experiences. This type representation is considered fundamentally different from artificial intelligence approach, which implements using ‘symbolic’ approach.Recent behavioral and neuroimaging studies color (and other visual knowledge) with without experience provide empirical evidence for neural coding no...

In this paper, we propose a new scheme for the geometry coding of three-dimensional (3-D) mesh models using a dual graph. In order to compress the mesh geometry information, we generate a fixed spectral basis using the dual graph derived from the mesh topology. After we partition a 3-D mesh model into several independent submeshes to reduce coding complexity, each submesh geometry is projected ...

Self-dual maximum distance separable codes (self-dual MDS codes) and self-dual near (NMDS) are very important in coding theory practice. Thus, it is interesting to construct or NMDS codes. In this paper, we not only give parity-check matrices of dual twisted generalized Reed–Solomon (TGRS but also present a sufficient necessary condition TGRS over $${\mathbb {F}}_q$$ with q an odd prime. Moreov...

In this paper, an dual-polarization 4-bit coding metasurface is proposed to achieve flexible manipulation of different polarization electromagnetic wave reflection angles and generation dual-mode vortex beams by independent orthogonal linearly polarized waves. The composed "H" type metal patch, dielectric substrate grounding layer from top bottom. To prove the concept, we design fabricate four ...

Association schemes form one of the main objects of algebraic combinatorics, classically defined on finite sets. At the same time, direct extensions of this concept to infinite sets encounter some problems even in the case of countable sets, for instance, countable discrete Abelian groups. In an attempt to resolve these difficulties, we define association schemes on arbitrary, possibly uncounta...

We consider linear codes over some fixed finite field extension Fqm/Fq, where Fq is an arbitrary finite field. In [1], Gabidulin introduced rank metric codes, by endowing linear codes over Fqm with a rank weight over Fq and studied their basic properties in analogy with linear codes and the classical Hamming distance. Inspired by the characterization of the security in wiretap II codes in terms...

Let k be an algebraically closed field and let T be the k-linear algebraic triangulated category generated by a w-spherical object for an integer w. For certain values of w this category is classical. For instance, if w = 0 then it is the compact derived category of the dual numbers over k. As main results of the paper we show that for w ≤ 0, the category T has no non-trivial t-structures, but ...

In a recent dissertation study, research was conducted to evaluate online instructors’ characteristics and preferences concerning the use of a telementor, or online instructor’s assistant, as a part on an online course. Those who participated in the anonymous survey came from a sample of two thousand online instructors from colleges and universities located across the United States. Of those co...

It is still an open challenge in coding theory how to design a systematic linear (n, k)− code C over GF(2) with maximal minimum distance d. In this study, based on matroid theory (MT), a limited class of good systematic binary linear codes (n, k, d ) is constructed, where n = 2 1 + · · · + 2 δ and d = 2 − 2 + · · · + 2 δ− 1 for k≥ 4, 1≤ δ < k. These codes are well known as special cases of code...