手机广告链中移动运营商的努力动机研究与仿真

建立了由单手机广告主、手机广告代理商和移动运营商构成的三级广告产业链之间的基于协作的收益共享契约模型,分析了在以移动运营商为主导的手机广告链中,移动运营商的努力动机受收益共享和努力成本补偿参数的影响.采用量化分析和模拟仿真结合的方法,得出契约参数只有在满足一定条件下,移动运营商所做出的最优努力水平投入决策,将使得整个手机产业链收益最大化,实现多方共赢.     

Batch processor sharing with hyper-exponential service time

We study the Processor Sharing queueing model with a hyper-exponential service time distribution and Poisson batch arrival process. In the case of the hyper-exponential service time distribution we find an analytical expression for the expected conditional response time function and obtain an alternative proof of its concavity with respect to the service time.     

Boundary value problems on weighted networks

We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the discrete version of the Dirichlet Principle and we apply it to the analysis of the inverse problem of identifying the conductivities of the network in a very general framework. Our approach is based on the development of an efficient vector calculus on weighted networks which mimetizes the calculus in the smooth case. The key tool is an adequate construction of the tangent space at each vertex. This allows us to consider discrete vector fields, inner products and general metrics. Then, we obtain discrete versions of derivative, gradient, divergence and Laplace-Beltrami operators, satisfying analogous properties to those verified by their continuous counterparts. On the other hand we develop the corresponding integral calculus that includes the discrete versions of the Integration by Parts technique and Green’s Identities. Finally, we apply our discrete vector calculus to analyze the consistency of difference schemes used to solve numerically a Robin boundary value problem in a square.     

无源高温超导磁浮轴承两种方案比较

无源磁浮轴承的优点是结构简单、造价低廉、无需有源控制。文中探讨了两种无源磁浮轴承的方案 ;对两种方案的悬浮力、悬浮品质因数、悬浮刚度与悬浮稳定性进行了讨论、计算、比较 ;并且讨论了两种方案的优缺点及应用。比较结果表明 ,方案 1更适合于小型的飞轮储能系统 ,方案 2较适合于大中型飞轮储能系统。     

On maximal actions and <Emphasis Type="Italic">w</Emphasis>-maximal actions of finite hypergroups

Sunder and Wildberger (J. Algebr. Comb. 18, 135–151, 2003) introduced the notion of actions of finite hypergroups, and studied maximal irreducible actions and *-actions. One of the main results of Sunder and Wildberger states that if a finite hypergroup K admits an irreducible action which is both a maximal action and a *-action, then K arises from an association scheme. In this paper we will first show that an irreducible maximal action must be a *-action, and hence improve Sunder and Wildberger’s result (Theorem 2.9). Another important type of actions is the so-called w-maximal actions. For a w-maximal action π:K→Aff (X), we will prove that π is faithful and |X|≥|K|, and |K| is the best possible lower bound of |X|. We will also discuss the strong connectivity of the digraphs induced by a w-maximal action.     

An improvement of discrete Tardos fingerprinting codes

It has been proven that the code lengths of Tardos’s collusion-secure fingerprinting codes are of theoretically minimal order with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced as some preceding studies have revealed. In this article we improve a recent discrete variant of Tardos’s codes, and give a security proof of our codes under an assumption weaker than the original Marking Assumption. Our analysis shows that our codes have significantly shorter lengths than Tardos’s codes. For example, when c = 8, our code length is about 4.94% of Tardos’s code in a practical setting and about 4.62% in a certain limit case. Our code lengths for large c are asymptotically about 5.35% of Tardos’s codes. A part of this work was presented at 17th Applied Algebra, Algebraic Algorithms, and Error Correcting Codes (AAECC-17), Bangalore, India, December 16–20, 2007.     

Numerical approximations of one-dimensional linear conservation equations with discontinuous coefficients

Conservative linear equations arise in many areas of application, including continuum mechanics or high-frequency geometrical optics approximations. This kind of equation admits most of the time solutions which are only bounded measures in the space variable known as duality solutions. In this paper, we study the convergence of a class of finite-difference numerical schemes and introduce an appropriate concept of consistency with the continuous problem. Some basic examples including computational results are also supplied.

     

Scheme for implementing quantum secret sharing via cavity QED

An experimentally feasible scheme for implementing quantum secret sharing via cavity quantum electrodynamics （QED） is proposed. The scheme requires the large detuning of the cavity field from the atomic transition, the cavity is only virtually excited, thus the requirement on the quality factor of the cavity is greatly loosened.     

基于分时原理的多相流体比例分配方法

提出了从“时间”上对多相流进行分配的新思路,分析了分时分配的基本原理,并设计了具体的实现方式。在空气-水实验回路上对分时分配装置进行了实验研究和验证。分时分配的基本原理就是通过“分时”的方法,使整个分配器“空间”内的多相流都能按照给定的时间份额周期性地交替流向对应的支路,从而保证各支路内的多相流具有高度一致的相含量和确定的流量比例。实验研究证明,分时分配法具有切实的可行性,分流比等于分时比且与流量和流体的物性无关,仅取决于分配器的几何参数。