Discovery of network motifs based on induced subgraphs using a dynamic expansion tree

Biological networks are powerful representations of topological features in biological systems. Finding network motifs in biological networks is a computationally hard problem due to their huge size and abrupt increase of search space with the increase of motif size. Motivated by the computational challenges of network motif discovery and considering the importance of this topic, an efficient and scalable network motif discovery algorithm based on induced subgraphs in a dynamic expansion tree is proposed. This algorithm uses a pruning strategy to overcome the space limitation of the static expansion tree. The proposed algorithm can identify large network motifs up to size 15 by significantly reducing the computationally expensive subgraph isomorphism checks. Further, the present work avoids the unnecessary growth of patterns that do not have any statistical significance. The runtime performance of the proposed algorithm outperforms most of the existing algorithms for large network motifs.     

How similar is the performance of the cubic and the piecewise-linear circuits of Chua?

This Letter reports phase diagrams quantifying and contrasting the dynamical performance of the paradigmatic piecewise-linear and cubic circuits of Chua. Although both circuits may be regarded as macroscopically isomorphic over wide regions in control parameter space, we show that their microscopic structure displays a myriad of rather distinctive intrinsic features making them unique. Inhomogeneities embedded in periodic and chaotic phases complicate some applications of the circuits but may also adequately act as realistic noise proxies in synchronization problems. In addition, infinite cascades of spirals and hubs observed experimentally very recently in a related dissipative flow are shown to be also present in both circuits of Chua, emerging however in a rather distinctive asymmetric way. Thus Chua's circuits may be used to study experimentally elusive and theoretically intricate phenomena generating periodicity hubs.     

Obstructions to the equivalence of Poisson structures near a symplectic leaf of semisimple and compact type

We describe cohomological obstructions to the equivalence of Poisson structures around a symplectic leaf of semisimple and compact type. The result is based on Conn’s linearization theorem and the theory of Poisson coupling.     

SMALL INTO ISOMORPHISM FROM （C0） INTO C（Ω） TYPE

If T is an isomorphism of （c0） into C（Ω） （where Ω is a sequentially compact and paracompact space, or a compact metric space in particular）, which satisfies the condition ｜｜T｜｜·｜｜T^-1｜｜ ≤ 1 ＋ε for some ε ∈ （0,1/5）, then T/｜｜T｜｜ is close to an isometry with an error less than 9ε. The proof of this article is simple without using the dual space or adjoint operator.     

Spectral isometries onto algebras having a separating family of finite-dimensional irreducible representations

We prove that if A is a complex, unital semisimple Banach algebra and B is a complex, unital Banach algebra having a separating family of finite-dimensional irreducible representations, then any unital linear operator from A onto B which preserves the spectral radius is a Jordan morphism.     

基于集值映射的形式概念分析

Formal concept analysis (FCA) is a discipline that studied the hierarchical structares induced by a binary relation between a pair of sets,and applies in data analysis,information retrieval,knowledge discovery,etc.In this paper,it is shown that a formal context T is equivalent to a set-valued mapping S :G →P(M),and formal concepts could be defined in the set-valued mapping S.It is known that the topology and set-valued mapping are linked.Hence,the advantage of this paper is that the conclusion make us to construct formal concept lattice based on the topology.     

格的模糊软理想

将模糊软集与格的模糊理想概念相结合,引入了格的模糊软理想的概念,给出了它们的若干代数性质.定义了格的模糊软同态(同构)概念,证明了格的一个模糊软理想在模糊软同构(同态)下的像(原像)仍为模糊软理想的结论.     

算子代数上的Jordan初等映射(英文)

给定两个环R,R’.对于满足一定条件的环R,本文证明了若M:R→R’,M*:R’→R为满射且对A,C∈R和B,D∈R’满足M（AM*（B）C+CM*（B）A）=M（A）BM（C）+M（C）BM（A）,M*（BM（A）D+DM（A）B）=M*（B）AM*（D）+M*（D）AM*（B）则M和M*是可加的;若R和R’分别包含单位I和I’,M（I）,M*（I’）可逆,则存在环同构N使得M（A）=N（A）M（I）,M*（B）=N^-1（BM（I））.特别地,若R=R’为标准算子代数或Hilbert空间套代数,则M和M*可加且存在有界可逆的线性或共轭线性算子S和T使得M（A）=SAT,M*（B）=TBS或M（A）=TA*S,M*（B）=（SBT）*对任意的A,B∈R成立.     

$*$-双单型$A \omega^2$-半群的同构定理

在本文中,我们研究了满足条件$D^*=D(~)$的*-双单型$A\omega^2$-半群的同构,给出了它们之间的同构定理.     

Isomorphism classes and invariants of low-dimensional filiform Leibniz algebras

In the paper, we extend the result on classification of a subclass of filiform Leibniz algebras in low dimensions to dimensions seven and eight based on a technique used by Rakhimov and Bekbaev for classification of subclasses which arise from naturally graded non-Lie filiform Leibniz algebras. The class considered here arises from naturally graded filiform Lie algebras. It contains the class of filiform Lie algebras and consequently, by classifying this subclass, we again re-examine the classification result of filiform Lie algebras. The resulting list of filiform Lie algebras is compared with that given by Ancochéa-Bermúdez and Goze in 1988 and by Gómez, Jiménez-Merchán and Khakimdjanov in 1998.