Karp complexity and classes with the independence property

A class K of structures is controlled if for all cardinals λ, the relation of L_∞,λ-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that no pseudo-elementary class with the independence property is controlled. By contrast, there is a pseudo-elementary class with the strict order property that is controlled (see Arch. Math. Logic 40 (2001) 69–88).     

Entropy,Universal Coding,Approximation, and Bases Properties

We shall present here results concerning the metric entropy of spaces of linear and nonlinear approximation under very general conditions. Our first result computes the metric entropy of the linear and m-terms approximation classes according to a quasi-greedy basis verifying the Temlyakov property. This theorem shows that the second index r is not visible throughout the behavior of the metric entropy. However, metric entropy does discriminate between linear and nonlinear approximation. Our second result extends and refines a result obtained in a Hilbertian framework by Donoho, proving that under orthosymmetry conditions, m-terms approximation classes are characterized by the metric entropy. Since these theorems are given under the general context of quasi-greedy bases verifying the Temlyakov property, they have a large spectrum of applications. For instance, it is proved in the last section that they can be applied in the case of L _p norms for R ^d for 1 < p < \infty. We show that the lower bounds needed for this paper in fact follow from quite simple large deviation inequalities concerning hypergeometric or binomial distributions. To prove the upper bounds, we provide a very simple universal coding based on a thresholding-quantizing constructive procedure.     

一种数据特征敏感的高效数据聚集编码方案

物联网中数据聚集算法设计面临的主要困难是：数据聚集时数据冗余的发现和消除,数据特征的发现均需要周密的思考,数据聚集时通信效率的提升通常需要较高超的数据编码技巧,精巧的算法设计思路。因此,研究数据聚集的高效率编码算法对于降低数据聚集的能耗具有重要的意义。当前研究中对于数据聚集中编码的综合讨论尚不充分,论文首先对问题进行建模,提出数据平滑泛型的概念,并通过分析得到数据平滑泛型将显著提高通信效率提升指数,在此基础上,论文提出了一套数据特征敏感的物联网高效数据聚集编码方案,包括数据聚集前的数据特征敏感的编码方法,基于CRT的数据编码准备方法,以及多节点数据聚集的可聚集变换方法。所给出的方法均经过严格的理论分析和证明论证,表明了方案的可行性。     

Sequence-based analysis of 5′UTR and coding regions of CASP3 in terms of miRSNPs and SNPs in targetting miRNAs

Apoptosis is described as a mechanism of cell death occurring after adequate cellular harm. Deregulation of apoptosis occurs in many human conditions such as autoimmune disorders, ischemic damage, neurodegenerative diseases and different cancer types. Information relating miRNAs to cancer is increasing. miRNAs can affect development of cancer via many different pathways, including apoptosis. Polymorphisms in miRNA genes or miRNA target sites (miRSNPs) can change miRNA activity. Although polymorphisms in miRNA genes are very uncommon, SNPs in miRNA-binding sites of target genes are quite common. Many researches have revealed that SNPs in miRNA target sites improve or decrease the efficacy of the interaction between miRNAs and their target genes. Our aim was to specify miRSNPs on CASP3 gene (caspase-3) and SNPs in miRNA genes targeting 5′UTR and coding exons of CASP3, and evaluate the effect of these miRSNPs and SNPs of miRNA genes with respect to apoptosis. We detected 141 different miRNA binding sites (126 different miRNAs) and 7 different SNPs in binding sites of miRNA in 5′UTR and CDS of CASP3 gene. Intriguingly, miR-339-3p’s binding site on CASP3 has a SNP (rs35372903, G/A) on CASP3 5′UTR and its genomic sequence has a SNP (rs565188493, G/A) at the same nucleotide with rs35372903. Also, miR-339-3p has two other SNPs (rs373011663, C/T rs72631820, A/G) of which the first is positioned at the binding site. Here, miRSNP (rs35372903) at CASP3 5′UTR and SNP (rs565188493) at miR-339-3p genomic sequence cross-matches at the same site of binding region. Besides, miR-339-3p targets many apoptosis related genes (ZNF346, TAOK2, PIM2, HIP1, BBC3, TNFRSF25, CLCF1, IHPK2, NOL3) although it had no apoptosis related interaction proven before. This means that miR-339-3p may also have a critical effect on apoptosis via different pathways other than caspase-3. Hence, we can deduce that this is the first study demonstrating a powerful association between miR-339-3p and apoptosis upon computational analysis.     

MIMO-OFDM underwater acoustic communication systems—A review

The ever increasing demand for bandwidth, efficiency, spatial diversity and performance of underwater acoustic (UWA) communication has opened doors for the use of Multi-Input Multi-Output (MIMO). A combination of MIMO and Orthogonal Frequency Division Multiplexing (OFDM) has proved to be a promising solution for many scenarios in UWA communication; on the contrary, it also amplifies the design challenges for implementing such schemes to acquire the required bandwidth efficiency. The goal of this study is to provide a comprehensive survey of the latest researches in the field of UWA MIMO-OFDM communication. The previous works are summarized, reviewed and compared according to their years of publication while problems faced by UWA MIMO-OFDM communication are highlighted. The articles are classified according to the focused techniques like channel estimation, equalization, coding and detection. Furthermore the works are compared based on the complexity and performance of the algorithms while some future research issues are identified.     

Semisimple finite group algebra of a generalized strongly monomial group

The complete algebraic structure of semisimple finite group algebra of a generalized strongly monomial group is provided. This work extends the work of Broche and del Río on strongly monomial groups. The theory is complimented by an algorithm and is illustrated with an example.     

Derivations on group algebras with coding theory applications

This paper classifies the derivations of group algebras in terms of the generators and defining relations of the group. If RG is a group ring, where R is commutative and S is a set of generators of G then necessary and sufficient conditions on a map from S to RG are established, such that the map can be extended to an R-derivation of RG. Derivations are shown to be trivial for semisimple group algebras of abelian groups. The derivations of finite group algebras are constructed and listed in the commutative case and in the case of dihedral groups. In the dihedral case, the inner derivations are also classified. Lastly, these results are applied to construct well known binary codes as images of derivations of group algebras.     

Countably categorical coloured linear orders

In this paper, we give a classification of (finite or countable) ?₀‐categorical coloured linear orders, generalizing Rosenstein's characterization of ?₀‐categorical linear orderings. We show that they can all be built from coloured singletons by concatenation and ?_n‐combinations (for n ≥ 1). We give a method using coding trees to describe all structures in our list (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Latin squares with bounded size of row prefix intersections

A latin square is a matrix of size n×n with entries from the set {1,…,n}, such that each row and each column is a permutation on {1,…,n}. We show how to construct a latin square such that for any two distinct rows, the prefixes of length h of the two rows share at most about h²/n elements. This upper bound is close to optimal when contrasted with a lower bound derived from the Second Johnson bound [6].