一种基于全IP蜂窝网络的实时业务传输机制*

针对无线蜂窝网络和Internet的业务特点,分析了在信道带宽有限、传输误码率高的无线网络中传输基于IP的实时业务所面临的问题.针对下一代蜂窝网络中基于IP技术实现多媒体业务要求,从无线网络上实际传送的码流角度,结合ROHC机制提出一种在信道传输速率不变的条件下,提高码流传输效率的方法,并且探究了空中链路的全IP机制.从采样编码后输出的净码流和经过封装后的码流两个角度来分析,提出了高效的针对全IP的蜂窝网络的实时交互式语音业务的新方案.     

芯壳乳液胶粘剂的研究

介绍乙酸乙烯酯－丙烯酸丁酯－丙烯酸芯结构乳液的制备方法，并将它们的性能与均匀共聚乳液作了测试与比较。     

Fast computation of computer-generated hologram using Xeon Phi coprocessor

We report fast computation of computer-generated holograms (CGHs) using Xeon Phi coprocessors, which have massively x86-based processors on one chip, recently released by Intel. CGHs can generate arbitrary light wavefronts, and therefore, are promising technology for many applications: for example, three-dimensional displays, diffractive optical elements, and the generation of arbitrary beams. CGHs incur enormous computational cost. In this paper, we describe the implementations of several CGH generating algorithms on the Xeon Phi, and the comparisons in terms of the performance and the ease of programming between the Xeon Phi, a CPU and graphics processing unit (GPU).     

应用质谱扫描测定胸腺肽相对分子质量

目的 精确测定胸腺肽相对分子质量分布。方法 采用质谱扫描法。结果 3批胸腺肽相对分子质量均在2000～4000,无10 000以上的大分子蛋白。结论 本方法灵敏度高,可直观地测定胸腺肽相对分子质量分布状况,为控制胸腺肽质量提供了新的检测方法。     

FP石膏在硫化轮胎模具上的应用

主要阐述FP石膏材料、制芯工艺过程及烘干工艺，阐述了应用硅橡胶母模复制石膏芯表面光洁度高，尺寸精度较好，硫化轮胎的铸造成品率达99％以上。     

基于BACnet/IP的设备与实时数据库通信实现

针对不同厂商、不同系统的楼宇自控设备互操作、互通信的局限性,分析了BACnet/IP技术和实时数据库,设计开发了一种基于BACnet/IP技术的实时数据库DasRdb的设备驱动程序。该设备驱动程序采用UDP通信方式,通过调用每个BACnet/IP设备的标准接口函数来驱动实时数据库DasRdb分别进行写操作和读操作,能够有效地实现BACnet/IP设备与实时数据库DasRdb之间的通信,从而使楼控设备的互操作成为可能。现场工程应用表明,该程序的运行契合BACnet的一致性要求,具有简单、高效、精确度高、实时性好的特点。     

基于AMBA总线的IIC协议IP核设计与验证

介绍了一种基于AMBA总线verilogHDL实现的IIC主机模式的IP核设计。该模块能够在标准和快速模式下运行,能够灵活配置为十位地址寻址或七位地址寻址模式。详细说明了该IP核的架构,各部分设计及状态转换过程。最后该模块通过了系统验证,并在xilinxFPGA上转化为硬件电路实现了所有功能。     

Memory E?cient Two-Pass 3D FFT Algorithm for Intelr Xeon PhiTM Coprocessor

Equipped with 512-bit wide SIMD instructions and large numbers of computing cores, the emerging x86-based Intelr Many Integrated Core (MIC) Architecture provides not only high floating-point performanc...     

Multi-label core vector machine with a zero label

Multi-label core vector machine (Rank-CVM) is an efficient and effective algorithm for multi-label classification. But there still exist two aspects to be improved: reducing training and testing computational costs further, and detecting relevant labels effectively. In this paper, we extend Rank-CVM via adding a zero label to construct its variant with a zero label, i.e., Rank-CVMz, which is formulated as the same quadratic programming form with a unit simplex constraint and non-negative ones as Rank-CVM, and then is solved by Frank–Wolfe method efficiently. Attractively, our Rank-CVMz has fewer variables to be solved than Rank-CVM, which speeds up training procedure dramatically. Further, the relevant labels are effectively detected by the zero label. Experimental results on 12 benchmark data sets demonstrate that our method achieves a competitive performance, compared with six existing multi-label algorithms according to six indicative instance-based measures. Moreover, on the average, our Rank-CVMz runs 83 times faster and has slightly fewer support vectors than its origin Rank-CVM.     

A novel clock generation algorithm for system-on-chip based on least common multiple

Due to increase in the number of Intellectual Property (IP) cores, clock generation in current day System-on-Chips (SoCs) is facing a crisis. The conventional method of using a dedicated Phase Locked Loop (PLL) to generate the clock for each IP core is becoming inefficient in terms of power and cost. We propose an algorithm based on Least Common Multiple (LCM) to minimize the number of PLLs required to generate the clocks for the IP cores in a SoC. This is done by finding an Optimum Operating Frequency (OOF) for each IP core within 10% below the maximum operating frequency of the core. The OOF is chosen such that the LCM of the OOF of all the IP cores is minimized. Simulated annealing is used to find the LCM. This LCM is the crucial high frequency from which maximum number of clocks can be derived by clock dividers.