Extensions of abstract problems of attainability: Nonsequential version

Extension constructions of the problem of attainability in a topological space are studied. The constructions are based on compactification of the whole space of solutions or some of its fragments.     

On the construction of authentication and secrecy codes

We present several recursive constructions for authentication and secrecy codes using t-designs. These constructions are based on combinatorial structures called authentication perpendicular arrays, introduced by Stinson. As a by-product we obtain a method for constructing sets of permutations which are uniform and t-homogeneous for arbitrarily large t. A table of parameters for codes whose existence is known is included.     

Deterministic constructions of compressed sensing matrices

Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performance of compressed sensing on signal classes is directly related to Gelfand widths. Similar to the deeper constructions of optimal subspaces in Gelfand widths, most sampling algorithms are based on randomization. However, for possible circuit implementation, it is important to understand what can be done with purely deterministic sampling. In this note, we show how to construct sampling matrices using finite fields. One such construction gives cyclic matrices which are interesting for circuit implementation. While the guaranteed performance of these deterministic constructions is not comparable to the random constructions, these matrices have the best known performance for purely deterministic constructions.     

Mask Formulas for Cograssmannian Kazhdan-Lusztig Polynomials

We give two constructions of sets of masks on cograssmannian permutations that can be used in Deodhar’s formula for Kazhdan–Lusztig basis elements of the Iwahori–Hecke algebra. The constructions are respectively based on a formula of Lascoux–Schützenberger and its geometric interpretation by Zelevinsky. The first construction relies on a basis of the Hecke algebra constructed from principal lower order ideals in Bruhat order and a translation of this basis into sets of masks. The second construction relies on an interpretation of masks as cells of the Bott–Samelson resolution. These constructions give distinct answers to a question of Deodhar.     

Adding intelligent assessment: a Java framework for integrating dynamic mathematical software components into interactive learning activities

Dynamic geometry constructions are commonly embedded into hypertext documents to create interactive exercises. In practice, this approach often constrains the possibilities of creating complex learning environments due to technical limitations. A Java-based framework for the development of interactive learning environments based on exploration laboratories containing dynamic geometry applets is presented. Dynamic geometry software (DGS) applets of different types can be integrated into the same laboratory and interact with each other. Within our framework, interactive exercises based on DGS constructions can be enriched with automated and semi-automated assessment algorithms. Students?? learning processes can be recorded using capture-and-replay software. Two sample learning environments based on the framework are presented.     

A construction of fully diverse unitary space-time codes

Fully diverse unitary space-time codes are useful in multiantenna communications, especially in multiantenna differential modulation. Recently, two constructions of parametric fully diverse unitary space-time codes for three antennas system have been introduced. We propose a new construction method based on the constructions. In the present paper, fully diverse codes for systems of odd prime number antennas are obtained from this construction. Space-time codes from present construction are found to have bet...     

Empirical Balanced Truncation of Nonlinear Systems

Novel constructions of empirical controllability and observability gramians for nonlinear systems are proposed for subsequent use in a balanced truncation style of model reduction. The new gramians are based on a generalisation of the fundamental solution for a Linear Time-Varying system. Relationships between the given gramians for nonlinear systems and the standard gramians for both Linear Time-Invariant and Linear Time-Varying systems are established as well as relationships to prior constructions proposed for empirical gramians. Application of the new gramians is illustrated through a sample test-system.     

Variable strength covering arrays

We define and study variable strength covering arrays (also called covering arrays on hypergraphs), which are generalizations of covering arrays and covering arrays on graphs. Variable strength covering arrays have the potential for use in software testing, allowing the engineer to omit the parameter combinations known to not interact in order to reduce the number of tests required. The present paper shows that variable strength covering arrays are relevant combinatorial objects that have deep connections with hypergraph homomorphisms and generalize other important combinatorial designs. We give optimal constructions for special types of hypergraphs, constructions based on columns with uniform occurrence of symbols, and constructions for mixed alphabets.     

Balance in complete cohomology

The balance of complete cohomology for modules that admit complete resolutions has been established by Christensen and Jorgensen (2013), as well as by Enochs, Estrada and Iacob (2012), by using two types of constructions on a given bicomplex. In this paper, we show that these constructions are closely related to each other. We also present an alternative proof of balance, which is based on the corresponding assertion for ordinary cohomology.     

On the applications of Extremal Graph Theory to Coding Theory and Cryptography

Explicit constructions in Extremal graph theory give appropriate lower bound for Turan type problems. In the case of prohibited cycles explicit constructions can be used in various problems of Information Security. We observe algebraic constructions of regular graphs of large girth and graphs with large cycle indicator and describe some algorithms of Coding Theory and Cryptography based on such special families of graphs.     

一类基于m-序列的正形置换的构造与计数

正形置换在密码学中有着广泛的应用,利用m-序列的"三项式特性",给出了一个构造n元正形置换的新方法,该方法既不同于已有的由n-2元构造n元正形置换,也不同于基于正交拉丁方的由n元构造n+1元正形置换的方法.     

Cantor Diagrams: A Unifying Discussion of Self-Reference

Within the framework of category theory, Cantor diagrams are introduced as the common structure of the self-reference constructions by Cantor, Russell, Richard, Gödel, Péter, Turing, Kleene, Tarski, according to the so-called Cantor diagonal method. Such diagrams consist not only of diagonal arrows but also of idempotent, identity and shift arrows. Cantor theorem states that no Cantor diagram is commutative. From this theorem, all the constructions above can be systematically retrieved. We do this by grouping them into two main classes: the class based on Cantor diagrams with a numerical shift function and the class based on Cantor diagrams with a Boolean shift function.     

圆弧和球面上的广义Ball多项式

本文以Ｂéｚｉｅｒ多项式理论为基础,引进了圆弧上的广义Ｂａｌ曲线及球面三角剖分上的广义Ｂａｌ曲面及其递归算法．     

Strongly regular Cayley graphs,skew Hadamard difference sets,and rationality of relative Gauss sums

In this paper, we give constructions of strongly regular Cayley graphs and skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields. Our results generalize ten of the eleven sporadic examples of cyclotomic strongly regular graphs given by Schmidt and White (2002) [23] and several subfield examples into infinite families. These infinite families of strongly regular graphs have new parameters. The main tools that we employed are relative Gauss sums instead of explicit evaluations of Gauss sums.     

Reed-Muller codes and Barnes-Wall lattices: Generalized multilevel constructions and representation over GF(2<Superscript><Emphasis Type="Italic">q</Emphasis></Superscript>)

Generalized multilevel constructions for binary RM(r,m) codes using projections onto GF(2 ^q ) are presented. These constructions exploit component codes over GF(2), GF(4),..., GF(2 ^q ) that are based on shorter Reed-Muller codes and set partitioning using partition chains of length-2 ^l codes. Using these constructions we derive multilevel constructions for the Barnes-Wall Λ(r,m) family of lattices which also use component codes over GF(2), GF(4),..., GF(2 ^q ) and set partitioning based on partition chains of length-2 ^l lattices. These constructions of Reed-Muller codes and Barnes-Wall lattices are readily applicable for their efficient decoding.      

Some constructions of highly arc-transitive digraphs

We construct infinite highly arc-transitive digraphs with finite out-valency and whose sets of descendants are digraphs which have a homomorphism onto a directed (rooted) tree. Some of these constructions are based on [4] and [5], and are shown to have universal reachability relation.     

On L-fuzzy systems

The concept of L-fuzzy systems is introduced. A universal structure of a special kind of L-fuzzy system and new constructions, based on a given L-fuzzy system, called the sup-quotient and inf-quotient L-fuzzy systems, respectively, are given. Problems of comparison and stabilities of L-fuzzy systems are discussed.     

About Tracing Problems in Dynamic Geometry

Dynamic Geometry is the field of interactively performing geometric construction on a computer. In addition to simulating ruler-and-compass constructions we allow a drag mode. This drag mode allows to move geometric objects that have at least one degree of freedom. The remaining part of the construction should adjust automatically. Thus, during the motion, we have to trace the resulting paths of all geometric objects. This path tracking problem is known as the Tracing Problem from Dynamic Geometry. It combines the step-by-step procedure of doing geometric constructions with the continuous concept of motions. This study is based on the model for Dynamic Geometry used in the interactive geometry software Cinderella. We give a numerical solution to the Tracing Problem based on continuation methods and a reliable algorithm based on real and complex interval arithmetic. Degenerate situations like the intersection of two identical lines lead to critical points in the configuration space and are treated separately.     

基于二维随机震源的地震波全波形反演研究

全波形反演利用全部的波场信息做反演求解,兼顾了地震波的运动学特征和动力学特征,是一种直接基于波动方程描述地震波在地下介质中的传播过程,能够获得地质结构和岩性资料的方法.但是作为一种非线性反演算法,如何提高全波形反演的计算速度和成像精度是目前优化反演的难点和重点.针对全波形反演的效率问题,采用分层和模块化的matlab工...     

Analysis of two new parareal algorithms based on the Dirichlet-Neumann/Neumann-Neumann waveform relaxation method for the heat equation

The Dirichlet-Neumann and Neumann-Neumann waveform relaxation methods are nonoverlapping spatial domain decomposition methods to solve evolution problems, while the parareal algorithm is in time parallel fashion. Based on the combinations of these space and time parallel strategies, we present and analyze two parareal algorithms based on the Dirichlet-Neumann and the Neumann-Neumann waveform relaxation method for the heat equation by choosing Dirichlet-Neumann/Neumann-Neumann waveform relaxation as two new kinds of fine propagators instead of the classical fine propagator. Both new proposed algorithms could be viewed as a space-time parallel algorithm, which increases the parallelism both in space and in time. We derive for the heat equation the convergence results for both algorithms in one spatial dimension. We also illustrate our theoretical results with numerical experiments finally.