A Generalized Double Crossproduct and Drinfeld Double

In this paper we construct a new and more complicated algebra construction of two algebras B and H, a generalized double crossproduct B H. The left generalized smash product, the right generalized smash product, Majids double crossproduct, especially, the smash product, the Drinfeld Double D(H) and Doi-Takeuchi algebra B H are all special cases as our algebra structure. Next, we analyze conditions under which this new algebra B H is a Hopf algebra termed a generalized double crossproduct of Hopf algebra, and describe a coquasitriangular structure over the generalized double crossproduct Hopf algebra B H. Finally, what we do is to construct a new braided monoidal category ^J_JMod^Q_Q obtained from the structure of the generalized double crossproduct, and establish a kind of new quantum Yang-Baxter operators.AMS Subject Classification (1991): 16W20, 16D90, 16S40, 16W30     

双缸单作用活塞泵中活塞匀速运动的探讨

通常双缸单作用活塞泵的恒转速运行会导致管路流量波动,使之在恒流量场合较少应用.对双缸单作用活塞泵的运动建立微分方程,给出了MATLAB7的仿真结果,提出了活塞近似匀速运动的条件,并对电动机转轴的角速度的计算方法作了讨论,得出了在中、低速运行时采用变角速度控制能近似实现恒流量的结论.     

A constraints-aware Reweighted Feasibility Pump approach

We extend the Reweighted Feasibility Pump (RFP) approach of De Santis et al. (2014) [9], De Santis et al. (2013) [8], which is based on the interpretation of the (main step of the) Feasibility Pump as the Frank-Wolfe method applied to an appropriate penalty function that drives the search towards integer solutions. We modify the function that is minimized by incorporating barrier terms that provide information about how much changing a variable is possible due to it being involved in (almost) active constraints. The corresponding Constraints-Aware RWP is experimentally tested on two sets of hard pure binary feasibility problems, and the results show that, all other things being equal, the modification leads to a more effective and robust method w.r.t. the original RFP one.     

关于一个二重积分计算公式

约定f为连续函数,分别利用交换积分次序、变量替换、等位线法等三种方法证明二重积分计算公式∫0^a∫0^a f（x＋y）dxdy=∫0^a（a-t）f（t＋a）dt＋∫0^atf（t）dt,并得到一个类似公式∫0^a∫0^af（x-y）dxdy=∫0^atf（t-a）dt＋∫0^a（a-t）f（t）dt.     

保费随机收取的广义二元复合非齐次Poisson风险模型

研究了一类双险种风险模型,其中索赔到达计数过程和保费到达计数过程均为非齐次Po isson过程,用鞅方法得到了有限时间破产概率的一个上界,并给出了当两个险种的个体索赔均服从指数分布时,有限时间破产概率的上界估计.     

Membrane fission: A computational complexity perspective

Membrane fission is a process by which a biological membrane is split into two new ones in the manner that the content of the initial membrane is separated and distributed between the new membranes. Inspired by this biological phenomenon, membrane separation rules were considered in membrane computing. In this work, we investigate cell‐like P systems with symport/antiport rules and membrane separation rules from a computational complexity perspective. Specifically, we establish a limit on the efficiency of such P systems which use communication rules of length at most two, and we prove the computational efficiency of this kind of models when using communication rules of length at most three. Hence, a sharp borderline between tractability and NP –hardness is provided in terms of the length of communication rules. © 2015 Wiley Periodicals, Inc. Complexity 21: 321–334, 2016     

A Note on 5-Cycle Double Covers

The strong cycle double cover conjecture states that for every circuit C of a bridgeless cubic graph G, there is a cycle double cover of G which contains C. We conjecture that there is even a 5-cycle double cover S of G which contains C, i.e. C is a subgraph of one of the five 2-regular subgraphs of S. We prove a necessary and sufficient condition for a 2-regular subgraph to be contained in a 5-cycle double cover of G.     

双险种的Cox风险模型

由于保险公司经营规模的不断扩大，险种类型的增多，用古典风险模型及其其它推广的单一险种风险模型来研究其风险经营过程存在着局限性，因而需要建立多险种的风险模型。本文研究了一类两种险种且理赔次数服从Cox过程的模型。得到了破产概率满足推广的Lundberg不等式。以及在特殊情况时ψ（0）的明确表达式。     

A Feasibility Pump for mixed integer nonlinear programs

We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs and mixed integer linear programs. We also discuss how the algorithm can be iterated so as to improve the first solution it finds, as well as its integration within an outer approximation scheme. We report computational results. P. Bonami is supported in part by a grant from IBM and by ANR grant BLAN06-1-138894. G. Cornuéjols is supported in part by NSF grant CMMI-0653419, ANR grant BLAN06-1-138894 and ONR grant N00014-03-1-0188. Part of this research was carried out when Andrea Lodi was Herman Goldstine Fellow of the IBM T.J. Watson Research Center whose support is gratefully acknowledged. F. Margot is supported in part by a grant from IBM and by ONR grant N00014-03-1-0188.     

A Double Bounded Version of Schur's Partition Theorem

Dedicated to the memory of Paul Erdős Schur's partition theorem states that the number of partitions of n into distinct parts (mod 3) equals the number of partitions of n into parts which differ by 3, where the inequality is strict if a part is a multiple of 3. We establish a double bounded refined version of this theorem by imposing one bound on the parts (mod 3) and another on the parts (mod 3), and by keeping track of the number of parts in each of the residue classes (mod 3). Despite the long history of Schur's theorem, our result is new, and extends earlier work of Andrews, Alladi-Gordon and Bressoud. We give combinatorial and q-theoretic proofs of our result. The special case L=M leads to a representation of the generating function of the underlying partitions in terms of the q-trinomial coefficients extending a similar previous representation of Andrews. Received November 18, 1999 Research of the first author supported in part by NSF Grant DMS-0088975.     

为PPS抽样而进行双重抽样的方法

本文把双重抽样技术用于ＰＰＳ抽样，给出了该方法下总体总值的无偏估计量，估计量的方差及方差的无偏估计公式。     

A Double Tiling of Triangles and Regular Hexagons

A tiling of triangles and regular hexagons, which wraps around a focal point and covers the plane twice, is investigated using both synthetic triangle geometry and complex numbers. Received February 12, 1999, and in revised form October 25, 1999. Online publication May 16, 2000.     

解变分不等式的一种二次投影算法

该文研究一种新的解变分不等式的二次投影算法.通过构造一类新的严格分离当前迭代和变分不等式解集的超平面,进而建立了解决伪单调变分不等式投影算法的一种新的框架.通过改进已有结果的证明方法,证明了该算法生成的无穷序列是全局收敛的,并且在局部误差和Lipschitz条件下给出了收敛率分析.     

一种抗高阶旁路攻击的LED密码算法

LED密码算法是2011年提出的超轻量级密码算法,主要是为资源受限下物联网加密应用研发的.轻量级密码算法结构相对简单,更容易被旁路攻击成功.随机掩码是一种有效抗旁路攻击的方法,在深入LED密码算法结构研究的基础上,提出一种全随机掩码的LED密码算法CMLED.论述了CMLED算法的设计方法,从形式化方面给出了抗高阶旁路攻击选择掩码的原则.同时,对全随机掩码的CMLED与原始算法进行了硬件资源占用与加密效率对比,实验表明CMLED仍然可以高效地在智能卡上实现.     

On The Span Of A Random Channel Assignment Problem

In the radio channel assignment problems considered here, we must assign a ‘channel’ from the set 1,2,... of positive integers to each of n transmitters, and we wish to minimise the span of channels used, subject to the assignment leading to an acceptable level of interference. A standard form of this problem is the ‘constraint matrix’ model. The simplest case of this model (the 0, 1 case) is essentially graph colouring. We consider here a random model for the next simplest case (with lengths 0, 1 or 2), and determine the asymptotic behaviour of the span of channels needed as n→∞. We find that there is a ‘phase change’ in this behaviour, depending on the probabilities for the different lengths.     

Channel metrization

We present an algorithm that, given a channel, determines if there is a distance for it such that the maximum likelihood decoder coincides with the minimum distance decoder.We also show that any metric, up to a decoding equivalence, can be isometrically embedded into the hypercube with the Hamming metric, and thus, in terms of decoding, the Hamming metric is universal.     

求解非单调变分不等式的一种二次投影算法北大核心CSCD

投影算法是求解变分不等式问题的主要方法之一.目前,有关投影算法的研究通常需要假设映射是单调且Lipschitz连续的,然而在实际问题中,往往不满足这些假设条件.该文利用线搜索方法,提出了一种新的求解非单调变分不等式问题的二次投影算法.在一致连续假设下,证明了算法产生的迭代序列强收敛到变分不等式问题的解.数值实验结果表明了该文所提算法的有效性和优越性.