A secure arithmetic coding based on Markov model

We propose a modification of the standard arithmetic coding that can be applied to multimedia coding standards at entropy coding stage. In particular, we introduce a randomized arithmetic coding scheme based on order-1 Markov model that achieves encryption by scrambling the symbols’ order in the model and choosing the relevant order’s probability randomly, which is done with higher compression efficiency and good security. Experimental results and security analyses indicate that the algorithm can not only resist to existing attacks based on arithmetic coding, but also be immune to other cryptanalysis.     

A cooperation index based on the Rényi entropy of correlation matrix spectrum

We propose an index to measure cooperation among different time-series based on the Rényi entropy of the eigenvalues of the signal correlation matrix and an optimization step. The index could be considered as a generalization of a previously known index, based instead on the Shannon entropy. The extension to Rényi entropy and the optimization step allow a better use of the information conveyed by the correlation matrix, especially when dealing with a small number of signals.     

High resolution quantization and entropy coding of jump processes

We study the quantization problem for certain types of jump processes. The probabilities for the number of jumps are assumed to be bounded by Poisson weights. Otherwise, jump positions and increments can be rather generally distributed and correlated. We show in particular that in many cases entropy coding error and quantization error have distinct rates. Finally, we investigate the quantization problem for the special case of R^d${\mathbb{R}}^d$-valued compound Poisson processes.     

GLS coding based security solution to JPEG with the structure of aggregated compression and encryption

There exists close relation among chaos, coding and cryptography. All the three can be combined into a whole as aggregated chaos-based coding and cryptography (ATC) to compress and encrypt data simultaneously. In particular, image data own high redundancy and wide transmission and thereby it is well worth doing research on ATC for image, which is very helpful to real application.JPEG with high compression ratio has not provided security. If JPEG is incorporated into powerful cryptographic features, its application can be further extended. For this reason, in this paper, GLS coding as a special form of ATC, which attains synchronous compression and encryption, is used to modify JPEG and fill its gap. An image is first initialized using DCT, quantization and run-length coding in turn, just as JPEG. Then, it is encoded and encrypted simultaneously by utilizing GLS coding and binary keystream resulting from the chaotic generator. Results demonstrate that our scheme can not only achieve good compression performance but also resist known/chosen-plaintext attacks efficiently.     

A novel chaotic encryption scheme based on arithmetic coding

In this paper, under the combination of arithmetic coding and logistic map, a novel chaotic encryption scheme is presented. The plaintexts are encrypted and compressed by using an arithmetic coder whose mapping intervals are changed irregularly according to a keystream derived from chaotic map and plaintext. Performance and security of the scheme are also studied experimentally and theoretically in detail.     

一种基于双链量子编码的动态车辆路径问题解决策略

针对配送调度事件动态变化的动态车辆路径问题(DVRP), 以最小化运输成本、最小化配送时间 与最大化载货率为目标, 建立了问题的数学模型,提出了改进的多相量子粒子群算法. 针对DVRP问题的特点,提出基于车辆链和货物链的双链量子编码方法; 同时设计了基于周期和 重调度因子驱动的动态调度策略. 最后将方法应用于动态仿真算例, 并与其他经典算法比较, 结果验证了所提出方法的有效性.     

A chaos secure communication scheme based on multiplication modulation

A secure spread spectrum communication scheme using multiplication modulation is proposed. The proposed system multiplies the message by chaotic signal. The scheme does not need to know the initial condition of the chaotic signals and the receiver is based on an extended Kalman filter (EKF). This signal encryption scheme lends itself to cheap implementation and can therefore be used effectively for ensuring security and privacy in commercial consumer electronics products. To illustrate the effectiveness of the proposed scheme, a numerical example based on Genesio-Tesi system and also Chen dynamical system is presented and the results are compared.     

A switch-modulated method for chaos digital secure communication based on user-defined protocol

In this paper, a scheme for digital secure communication is proposed. In this scheme, we use a control function which is defined by two communicants based on chaos synchronization. At first, different signals are sent according to the promissory transmission situation of control signal, then transmission field which is consist of protocol and transmission content is produced. After these processing, the correlation of the transmitted signals are decreased. In addition, the using of the compound non-linear function transformation can further intercalate the secret key, so a determined intruder is very difficult to retrieve the message using forecasting method.     

一个安全有效的智能卡远程用户认证方案

2000年,Hwang和Li提出了一个新的智能卡远程用户认证方案,随后Chan和Cheng对该方案进行了成功的攻击.最近Shen,Lin和Hwang针对该方案提出了一种不同的攻击方法,并提供了一个改进方案用于抵御这些攻击.2003年,Leung等认为Shen-Lin-Hwang改进方案仍然不能抵御Chan和Cheng的攻击,他们用改进后的Chang-Hwang攻击方法进行了攻击.文中主要在Hwang-Li方案的基础上,提出了一个新的远程用户认证方案,该方案主要在注册阶段和登录阶段加强了安全性,抵御了类似Chan-Cheng和Chang-Hwang的攻击.     

Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS

LaMacchia, Lauter and Mityagin recently presented a strong security definition for authenticated key agreement strengthening the well-known Canetti-Krawczyk definition. They also described a protocol, called NAXOS, that enjoys a simple security proof in the new model. Compared to MQV and HMQV, NAXOS is less efficient and cannot be readily modified to obtain a one-pass protocol. On the other hand MQV does not have a security proof, and the HMQV security proof is extremely complicated. This paper proposes a new authenticated key agreement protocol, called CMQV (‘Combined’ MQV), which incorporates design principles from MQV, HMQV and NAXOS. The new protocol achieves the efficiency of HMQV and admits a natural one-pass variant. Moreover, we present a relatively simple and intuitive proof that CMQV is secure in the LaMacchia-Lauter-Mityagin model.      

Oracle inequalities for support vector machines that are based on random entropy numbers

In this paper, we present a new technique for bounding local Rademacher averages of function classes induced by a loss function and a reproducing kernel Hilbert space (RKHS). At the heart of this technique lies the observation that certain expectations of random entropy numbers can be bounded by the eigenvalues of the integral operator associated with the RKHS. We then work out the details of the new technique by establishing two new oracle inequalities for support vector machines, which complement and generalize previous results.     

A free analogue of Shannon's problem on monotonicity of entropy

We prove a free probability analog of a result of [S. Artstein, K. Ball, F. Barthe, A. Naor, Solution of Shannon's problem on monotonicity of entropy, J. Amer. Math. Soc. 17 (2004) 975-982]. In particular, we prove that if X₁,X₂,… are freely independent identically distributed random variables, then the function

     

Extreme events and entropy: A multiple quantile utility model

This paper introduces a multiple quantile utility model of Cumulative Prospect Theory in an ambiguous setting. We show a representation theorem in which a prospect is valued by a composite value function. The composite value function is able to represent asymmetric attitude on extreme events and a rational prudence on ordinary events.     

A note on solution of large sparse maximum entropy problems with linear equality constraints

This paper describes a method to solve large sparse maximum entropy problems with linear equality constraints using Newtons and the conjugate gradient method. A numerical example is given to introduce the reader to possible applications of entropy models and this method. Some experience from large scale problems is also reported.     

A note on the uniqueness of entropy solutions of nonlinear degenerate parabolic equations

Following the lead of [Carrillo, Arch. Ration. Mech. Anal. 147 (1999) 269-361], recently several authors have used Kru?kov's device of “doubling the variables” to prove uniqueness results for entropy solutions of nonlinear degenerate parabolic equations. In all these results, the second order differential operator is not allowed to depend explicitly on the spatial variable, which certainly restricts the range of applications of entropy solution theory. The purpose of this paper is to extend a version of Carrillo's uniqueness result to a class of degenerate parabolic equations with spatially dependent second order differential operator. The class is large enough to encompass several interesting nonlinear partial differential equations coming from the theory of porous media flow and the phenomenological theory of sedimentation-consolidation processes.     

Algebraic methods and arithmetic filtering for exact predicates on circle arcs

The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae of two intersection points of circle arcs, which is known to be a difficult predicate involved in the computation of arrangements of circle arcs. We present an algorithm for deciding the x-order of intersections from the signs of the coefficients of a polynomial, obtained by a general approach based on resultants. This method allows the use of efficient arithmetic and filtering techniques leading to fast implementation as shown by the experimental results.     

A hardware-friendly arithmetic method and efficient implementations for designing digital fuzzy adders

A new hardware-friendly mathematical method for realizing low-complexity universal Adder cells as well as its efficient hardware implementations is proposed in this paper. This method can be used in binary logic, Multiple-Valued Logic (MVL) and specifically digital fuzzy systems. The proposed mathematical method can be implemented in both voltage and current modes. The voltage-mode hardware implementation is very simple and is based on input capacitors and MVL or analog inverters and buffers. In addition, the current-mode hardware implementation leads to simple and efficient structures for digital fuzzy systems. Simulations are carried out for ternary logic as well as for digital fuzzy logic with high precision by using 180 nm standard CMOS technology and at 1.8 V supply voltage. Simulation results demonstrate that the proposed designs have excellent functionality and are very suitable for implementing MVL and fuzzy arithmetic circuits.     

A branch and bound network approach to the canonical constrained entropy problem

In this paper, we present a branch and bound algorithm for solving the constrained entropy mathematical programming problem. Unlike other methods for solving this problem, our method solves more general problems with inequality constraints. The advantage of the proposed technique is that the relaxed problem solved at each node is a singly constrained network problem. The disadvantage is that the relaxed problem has twice as many variables as the original problem. An application to regional planning is given, and an example problem is solved.     

调和分析与信道编解码研究——献给陆善镇教授75华诞

信道编码是通信系统的关键技术之一,其传统的理论工具是代数和有限域GF（p）.本文在有噪信道的信道编码数学模型基础上,介绍基于调和分析的新型信道编码理论,分别应用调和分析的重要工具压缩感知与Walsh-Hadamard变换实现信道编解码和信道编码盲识别.本文综述基于调和分析的信道编码的一些基本结果并介绍最新进展,主要包括：Gilbert-Varshamov界、l1解码、RIP（restricted isometry property）条件和Walsh-Hadamard变换等.