Monte carlo calculations of the conformal charge

The conformal charge is an important quantity which characterizes the nature of the two-dimensional phase transition. We report a first attempt to use a new numerical method to calculate the conformal charge. In this paper, we apply our method to the 2-dimensional, ⁴, continuous-spin Ising model. By varying the parameters in the Hamiltonian, one can change continuously from the known Gaussian limit to the Ising limit. It is well known that the critical points for these two systems are not in the same universality class. We study this behavior for the Gaussian model, the single-well ⁴ model, the border model, and the double-well ⁴ model for a large lattice. Our results, while giving a good general picture, are not so far sufficient to differentiate whether the non-Gaussian cases studied belong to the Ising model universality class or not. Further studies of other lattice sizes should serve to improve greatly our conclusions.     

基于有限域GF上圆锥曲线的公钥密码算法

圆锥曲线密码学是一种新型的公钥密码学,迄今对圆锥曲线密码学的研究成果都是以有限域GF(p)上的圆锥曲线为基础的.本文将有限域GF(p)上的圆锥曲线C(GF(p))推广为有限域GF(2ⁿ)上的圆锥曲线C(GF(2ⁿ)),证明了圆锥曲线C(GF(2ⁿ))上的点和加法运算构成有限交换群(C(GF(2ⁿ)),),并给出了圆锥曲线群(C(GF(2ⁿ)),)的阶的计算.此外,提出了使用有限域GF(2ⁿ)上的圆锥曲线群构造公钥密码系统,并给出了ElGamal加密方案和数字签名算法(DSA)在圆锥曲线C(GF(2ⁿ))上模拟的算法,最后分析其安全性.     

DSP最小应用系统的设计

介绍了基于DSP(数字信号处理)的最小应用系统的整体设计过程。系统采用TMS320VC5402作为主控芯片;ADC0809完成数据的采样及A/D转换,通过TMS320VC5402处理后,由DAC0832完成D/A转换并输出;外部存储器采用通用EPROM,TMS320VC5402采用8位并行EPROM引导方式;并加入了标准的14针JTAG接口,便于系统的调试与仿真。     

基于能量量化的小波域数字音频水印算法

利用混沌动力学系统中logistic映射先对水印图像进行置乱预处理以增强其鲁棒性，在小波域中将原始音频信号按比例分段，求得每段的能量然后将其按步长delta以及要嵌入的水印的值进行量化，然后用量化后的能量与量化前的能量之比乘以该段每一个值即完成一位水印的嵌入。反复执行以上步骤，完成全部水印的嵌入。若低频部分分组数大于水印序列个数则重复嵌入。采用StirMark for Audio攻击后的实验结果表明该方案对StirMark for Audio的部分攻击具有一定的鲁棒性。     

Discontinuous Galerkin methods on graphics processing units for nonlinear hyperbolic conservation laws

We present a novel implementation of the modal DG method for hyperbolic conservation laws in two dimensions on graphics processing units (GPUs) using NVIDIA's Compute Unified Device Architecture. Both flexible and highly accurate, DG methods accommodate parallel architectures well as their discontinuous nature produces element‐local approximations. High‐performance scientific computing suits GPUs well, as these powerful, massively parallel, cost‐effective devices have recently included support for double‐precision floating‐point numbers. Computed examples for Euler equations over unstructured triangle meshes demonstrate the effectiveness of our implementation on an NVIDIA GTX 580 device. Profiling of our method reveals performance comparable with an existing nodal DG‐GPU implementation for linear problems. Copyright © 2014 John Wiley & Sons, Ltd.     

Analysis of PCBs in Biotic Matrices by Two-Dimensional GC-ECD

Abstract

The suitability of three GC-ECD systems for the separation of a model mixture containing various congeners of PCBs together with persistent chlorinated aromatics (pesticides and their metabolites, industrial chemicals) was tested. Analyses were performed on two parallel capillaries, the stationary phase of one of them was always in routine practice very common 5% phenyl-methylpolysiloxane, the second one was either 50% phenylmethylpolysiloxane or 7% phenyl-7% cyanopropyl-methylpolysiloxane. The number of unresolved (coeluted) analytes was significantly reduced in these systems and thus unbiased quantitation of PCBs and other components used for regulation was possible. The utilization of this type of multidimensional chromatography for rapid and reliable analysis of real samples (fish oil, human fat) was documented.     

Progressive filling partitioning and mapping algorithm for Spark based on allocation fitness degree

The job execution mechanism of Spark was analyzed,task efficiency model and Shuffle model were established,then allocation fitness degree (AFD) was defined and the optimization goal was put forward.On the basis of the model definition,the progressive filling partitioning and mapping algorithm (PFPM) was proposed.PFPM established the data distribution scheme adapting Reducers’ computing ability to decrease synchronous latency during Shuffle process and increase cluster the computing efficiency.The experiments demonstrate that PFPM could improve the rationality of workload distribution in Shuffle and optimize the execution efficiency of Spark.     

Effect of gap and flow orientation on two-phase flow in an oil-wet gap: Relative permeability curves and flow structures

Naturally fractured reservoirs contain about 25–30% of the world supply of oil. In these reservoirs, fractures are the dominant flow path. Therefore, a good understanding of transfer parameters such as relative permeability as well as flow regimes occurring in a fracture plays an important role in developing and improving oil production from such complex systems. However, in contrast with gas–liquid flow in a single fracture, the flow of heavy oil and water has received less attention. In this research, a Hele-Shaw apparatus was built to study the flow of water in presence of heavy oil and display different flow patterns under different flow rates and analyze the effect of fracture orientations on relative permeability curves as well as flow regimes. The phase flow rates versus phase saturation results were converted to experimental relative permeability curves. The results of the experiments demonstrate that, depending on fracture and flow orientation, there could be a significant interference between the phases flowing through the fracture. The results also reveal that both phases can flow in both continuous and discontinuous forms. The relative permeability curves show that the oil–water relative permeability not only depends on fluid saturations and flow patterns but also fracture orientation.     

A chaotic-cipher-based packet body encryption algorithm for JPEG2000 images

A chaotic-cipher-based packet body encryption algorithm for JPEG2000 images is proposed in this paper. In order to produce a compliant codestream, a 2-byte block encryption procedure including bit-wise exclusive OR and cyclic rotation operations is investigated. Moreover, a repeatedly encryption process is adopted to eliminate the undesirable marker codes during encryption. The repeatedly encryption process only introduces a negligible computational overhead. Both simulations and analysis show that the proposed algorithm is of high security and simplicity. Therefore, these good properties make the algorithm efficient to process and useful for image applications.