Accelerating BPC-PaCo through Visually Lossless Techniques

Fast image codecs are a current need in applications that deal with large amounts of images. Graphics Processing Units (GPUs) are suitable processors to speed up most kinds of algorithms, especially when they allow fine-grain parallelism. Bitplane Coding with Parallel Coefficient processing (BPC-PaCo) is a recently proposed algorithm for the core stage of wavelet-based image codecs tailored for the highly parallel architectures of GPUs. This algorithm provides complexity scalability to allow faster execution at the expense of coding efficiency. Its main drawback is that the speedup and loss in image quality is controlled only roughly, resulting in visible distortion at low and medium rates. This paper addresses this issue by integrating techniques of visually lossless coding into BPC-PaCo. The resulting method minimizes the visual distortion introduced in the compressed file, obtaining higher-quality images to a human observer. Experimental results also indicate 12% speedups with respect to BPC-PaCo.     

A probabilistic approach to spectral analysis of growth-fragmentation equations

The growth-fragmentation equation describes a system of growing and dividing particles, and arises in models of cell division, protein polymerisation and even telecommunications protocols. Several important questions about the equation concern the asymptotic behaviour of solutions at large times: at what rate do they converge to zero or infinity, and what does the asymptotic profile of the solutions look like? Does the rescaled solution converge to its asymptotic profile at an exponential speed? These questions have traditionally been studied using analytic techniques such as entropy methods or splitting of operators. In this work, we present a probabilistic approach: we use a Feynman–Kac formula to relate the solution of the growth-fragmentation equation to the semigroup of a Markov process, and characterise the rate of decay or growth in terms of this process. We then identify the Malthus exponent and the asymptotic profile in terms of a related Markov process, and give a spectral interpretation in terms of the growth-fragmentation operator and its dual.     

Recyclable and reusable Pd(OAc)2/PPh3/PEG‐2000 system for homocoupling reaction of arylboronic acids under air without base

A stable and efficient Pd(OAc)₂/PPh₃/PEG‐2000 catalytic system for homocoupling of arylboronic acids has been developed. In the presence of Pd(OAc)₂ and PPh₃, the homocoupling reaction of arylboronic acids was carried out smoothly in PEG‐2000 at 70 °C under air without base to afford a variety of symmetric biaryls in good to excellent yields. The isolation of the products was readily performed by extraction with diethyl ether, and the Pd(OAc)₂/PPh₃/PEG‐2000 system could be easily recycled and reused six times without significant loss of catalytic activity. Copyright © 2014 John Wiley & Sons, Ltd.     

3G标准的技术性比较分析与研究

介绍了3G技术在国内外的发展情况，阐述了发展趋势，对3G技术的分类和所采用的主流技术、标准化情况进行了论述，并对CDMA2000，WCDMA和TD-SCDMA三种3G的三大主流应用技术标准进行比较分析。     

实时Motion JPEG2000视频编码系统设计

介绍了基于ADV202 JPEG2000编码芯片的Motion JPEG2000视频编码系统,该系统可实现SMPTE274M的实时编码,支持失真/无失真编码,与标准完全兼容.给出了系统硬件结构和软件流程设计,提出了一种利用帧间相关性减少编码计算量的码率控制方法.     

基于C6711处理器cdma2000 1X系统前向信道信号的处理

在cdma20001x前向信道中,要对一段信号进行传送,一般选用QPSK调制,因为QPSK调制比QAM更适合噪音环境。采用TI6000系列的TMS320C6711芯片处理前向信道信号,可以对复杂性和实时性较高的信号做采集、量化、编码、调制等实时处理,主要功能通过软件编程实现,从而使系统具有结构灵活、可靠性高、可扩展等优点。     

Windows2000环境下实时控制系统的软件实现

文章介绍了在windows2000环境下通过编写WDM（Windows Driver Model）设备驱动程序实现实时数据采集和控制的一种方法。采用研华数据采集卡PCL818L产生中断信号．通过编写WDM驱动程序实现了在windows2000环境下转台的位置控制。并在实验中调试通过。实验结果表明：在采样频率为1KHz的情况下。控制系统很好实现了输出对输入的跟踪，证明了采用方法的正确性。该方法解决了windows2000环境下的实时性问题，为在windows环境下实时控制系统的实现提供了有益的尝试。     

Rigidity and flexibility of virtual polytopes

All 3-dimensional convex polytopes are known to be rigid. Still their Minkowski differences (virtual polytopes) can be flexible with any finite freedom degree. We derive some sufficient rigidity conditions for virtual polytopes and present some examples of flexible ones. For example, Bricard's first and second flexible octahedra can be supplied by the structure of a virtual polytope.     

IS-2000规范在Walsh Code定义上的局限性

本文针对IS-2000规范关于W alsh Code的定义,发现IS-2000规范有关W alshCode的定义不合理,在前向RC 3下限制了最大数据用户数和最高数据速率;如按本文修改规范关于W alsh Code的定义,不但可以在前向RC 3下提高最大数据用户数,同时在理论上可以将最高数据速率提高一倍。