一种面向无线安全的双核SOC平台

提出了一种适用于无线网络安全应用的片上系统(SOC)平台.该平台采用主控CPU加专用安全处理器的双核架构,可以灵活支持多种无线网络安全协议.所用到的安全处理器集成了多个硬件加速器,能够对多种常用的密码学算法提供硬件加速.相比于传统的CPU加协处理器的架构,该架构能够提供更高的系统效率,消耗更少CPU资源.此系统在0.18μm CMOS工艺下流片成功,并通过更改其固件,完成了多种功能的测试.该SOC平台具有高性能,低成本,多功能的特点,可广泛应用于各种手持设备.     

Orbits of arcs in PG(N,K) under projectivities

The symmetric group on k symbols is made to operate on a certain set of matrices in such a way that its orbits are in one-to-one correspondence with the orbits of the k-arcs of an N-dimensional projective space under the group of projectivities. This leads to a formula for the number of such orbits.     

空间有理参数多项式曲线的整数级绘制算法

讨论了空间有理曲线中心投影后导数上界的估计，基于曲线各阶差分的递推计算，给出了空间有理参数多项式曲线的快速绘制算法．算法只用到整数的加减法，效率高．     

Moduli of twisted spin curves

In this note we give a new, natural construction of a compactification of the stack of smooth -spin curves, which we call the stack of stable twisted -spin curves. This stack is identified with a special case of a stack of twisted stable maps of Abramovich and Vistoli. Realizations in terms of admissible -spaces and -line bundles are given as well. The infinitesimal structure of this stack is described in a relatively straightforward manner, similar to that of usual stable curves.

We construct representable morphisms from the stacks of stable twisted -spin curves to the stacks of stable -spin curves and show that they are isomorphisms. Many delicate features of -spin curves, including torsion free sheaves with power maps, arise as simple by-products of twisted spin curves. Various constructions, such as the -operator of Seeley and Singer and Witten's cohomology class go through without complications in the setting of twisted spin curves.

     

Bernstein-Walsh inequalities and the exponential curve in

It is shown that for the pluripolar set in there is a global Bernstein-Walsh inequality: If is a polynomial of degree on and on , this inequality gives an upper bound for which grows like . The result is used to obtain sharp estimates for .

     

Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints

We consider a canonical Ramsey type problem. An edge‐coloring of a graph is called m‐good if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m, G) denote the smallest n such that every m‐good edge‐coloring of K_n yields a properly edge‐colored copy of G, and let g(m, G) denote the smallest n such that every m‐good edge‐coloring of K_n yields a rainbow copy of G. We give bounds on f(m, G) and g(m, G). For complete graphs G = K_t, we have c₁mt²/ln t ≤ f(m, K_t) ≤ c₂mt², and cmt³/ln t ≤ g(m, K_t) ≤ cmt³/ln t, where c₁, c₂, c, c are absolute constants. We also give bounds on f(m, G) and g(m, G) for general graphs G in terms of degrees in G. In particular, we show that for fixed m and d, and all sufficiently large n compared to m and d, f(m, G) = n for all graphs G with n vertices and maximum degree at most d. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

广义Sierpinski集

本文考察了包括平面上的各种广义 Cantor集 ,Sierpinski集和包括某些连续不可微曲线在内的广义 Sierpinski集 .由相似变换 ,导出了它们的级数表达式 ,并利用它和字符串空间的对应关系 ,计算出它们的Hausdorff维数     

Subregular Representations of {\mathfrak{s}}{\mathfrak{l}}_n and Simple Singularities of Type A n−1

Alexander Premet has stated the following problem: what is a relation between subregular nilpotent representations of a classical semisimple restricted Lie algebra and non-commutative deformations of the corresponding singularities? We solve this problem for type A.     

Algebraic Operations and Generic Effects

Given a complete and cocomplete symmetric monoidal closed category V and a symmetric monoidal V-category C with cotensors and a strong V-monad T on C, we investigate axioms under which an Ob C-indexed family of operations of the form _x :(Tx) ^v (Tx) ^w provides semantics for algebraic operations on the computational -calculus. We recall a definition for which we have elsewhere given adequacy results, and we show that an enrichment of it is equivalent to a range of other possible natural definitions of algebraic operation. In particular, we define the notion of generic effect and show that to give a generic effect is equivalent to giving an algebraic operation. We further show how the usual monadic semantics of the computational -calculus extends uniformly to incorporate generic effects. We outline examples and non-examples and we show that our definition also enriches one for call-by-name languages with effects.