一类二阶半线性时滞微分方程的振动准则

建立一类二阶半线性时滞微分方程的几个振动准则.利用一个新的方法,得到所有解振动的一些充分条件,新的结论改善和推广了一些相关文献的振动准则,给出的例子用来阐明新的结论.     

Implementation of AVS Jizhun decoder with HW/SW partitioning on a coarse-grained reconfigurable multimedia system

In this paper,a TPP(Task-based Parallelization and Pipelining)scheme is proposed to implement AVS(Audio Video coding Standard)video decoding algorithm on REMUS(REconfigurable MUltimedia System),which is a coarse-grained reconfigurable multimedia system.An AVS decoder has been implemented with the consideration of HW/SW optimized partitioning.Several parallel techniques,such as MB(Macro-Block)-based parallel and block-based parallel techniques,and several pipeline techniques,such as MB level pipeline and block level pipeline techniques are adopted by hardware implementation,for performance improvement of the AVS decoder.Also,most computation-intensive tasks in AVS video standards,such as MC(Motion Compensation),IP(Intra Prediction),IDCT(Inverse Discrete Cosine Transform),REC(REConstruct)and DF(Deblocking Filter),are performed in the two RPUs(Reconfigurable Processing Units),which are the major computing engines of REMUS.Owing to the proposed scheme,the decoder introduced here can support AVS JP(Jizhun Profile)1920×1088@39fps streams when exploiting a 200 MHz working frequency.     

面向视觉搜索的空间局部敏感哈希方法

目的 视觉检索需要准确、高效地从大型图像或者视频数据集中检索出最相关的视觉内容,但是由于数据集中图像数据量大、特征维度高的特点,现有方法很难同时保证快速的检索速度和较好的检索效果。方法 对于面向图像视频数据的高维数据视觉检索任务,提出加权语义局部敏感哈希算法（weighted semantic locality-sensitive hashing, WSLSH）。该算法利用两层视觉词典对参考特征空间进行二次空间划分,在每个子空间里使用加权语义局部敏感哈希对特征进行精确索引。其次,设计动态变长哈希码,在保证检索性能的基础上减少哈希表数量。此外,针对局部敏感哈希（locality sensitive hashing, LSH）的随机不稳定性,在LSH函数中加入反映参考特征空间语义的统计性数据,设计了一个简单投影语义哈希函数以确保算法检索性能的稳定性。结果 在Holidays、Oxford5k和DataSetB数据集上的实验表明,WSLSH在DataSetB上取得最短平均检索时间0.034 25 s;在编码长度为64位的情况下,WSLSH算法在3个数据集上的平均精确度均值（mean average precision,mAP）分别提高了1.2%32.6%、1.7%19.1%和2.6%28.6%,与几种较新的无监督哈希方法相比有一定的优势。结论 通过进行二次空间划分、对参考特征的哈希索引次数进行加权、动态使用变长哈希码以及提出简单投影语义哈希函数来对LSH算法进行改进。由此提出的加权语义局部敏感哈希（WSLSH）算法相比现有工作有更快的检索速度,同时,在长编码的情况下,取得了更为优异的性能。     

互联网延迟队列解决方案设计

针对互联网中广泛存在的延迟任务处理问题,本文分析了技术难点和常见的解决方案,并基于Redis中间件设计和实现了延迟队列系统。该系统具有轻量级、高可用、低耦合、高性能等特点,能够支撑业务系统的稳定运行。     

齐齐哈尔工业区春季大气中PBDEs的污染及气粒分配

齐齐哈尔富拉尔基区为典型的国家重工业集中区域,为研究其大气中多溴联苯醚(PBDEs)的质量浓度水平、污染特征和气/粒分配规律,分别在其下风向和上风向采集大气颗粒相和气相样品,对PBDEs的质量浓度进行测定.结果表明,大气中PBDEs总质量浓度为13.9~102 pg·m-3,平均值为53.6 pg·m-3,BDE-209是质量浓度最高的同系物.来源分析表明,PBDEs主要来源于商用五溴联苯醚和十溴联苯醚的使用.由log KP和log poL线性回归得到的斜率均高于平衡状态理论值-1,说明大气中的PBDEs气粒分配未达到平衡状态.采用Junge-Pankow吸附模型和Harner-Bidleman吸收模型对PBDEs颗粒态百分比(φ)进行了模拟,结果均高于实际值.     

Correspondence of bubble size and frother partitioning in flotation

The size of bubbles created in the flotation process is of great importance to the efficiency of the mineral separation achieved. Meanwhile, it is believed that frother transport between phases is perhaps the most important reason for the interactive nature of the phenomena occurring in the bulk and froth phases in flotation, as frother adsorbed in the surface of rising bubbles is removed from the bulk phase and then released into the froth as a fraction of the bubbles burst. This causes the increased concentration in the froth compared to the bulk concentration, named as frother partitioning. Partitioning reflects the adsorption of frother on bubbles and how to influence bubble size is not known. There currently exists no such a topic aiming to link these two key parameters. To fill this vacancy, the correspondence between bubble size and frother partitioning was examined. Bubble size was measured by sampling-for-imaging （SFI） technique. Using total organic carbon （TOC） analysis to measure the frother partitioning between froth and bulk phases was determined. Measurements have shown, with no exceptions including four different frothers, higher frother concentration is in the bulk than in the froth. The results also show strong partitioning giving an increase in bubble size which implies there is a compelling relationship between these two, represented byCFroth/CBulk andD32. TheCFroth/CBulk andD32 curves show similar exponential decay relationships as a function of added frother in the system, strongly suggesting that the frother concentration gradient between the bulk solution and the bubble interface is the driving force contributing to bubble size reduction.     

Monitoring of tool wear using measured machining forces and neuro-fuzzy modelling approaches during machining of GFRP composites

The challenges of machining, particularly milling, glass fibre-reinforced polymer (GFRP) composites are their abrasiveness (which lead to excessive tool wear) and susceptible to workpiece damage when improper machining parameters are used. It is imperative that the condition of cutting tool being monitored during the machining process of GFRP composites so as to re-compensating the effect of tool wear on the machined components. Until recently, empirical data on tool wear monitoring of this material during end milling process is still limited in existing literature. Thus, this paper presents the development and evaluation of tool condition monitoring technique using measured machining force data and Adaptive Network-Based Fuzzy Inference Systems during end milling of the GFRP composites. The proposed modelling approaches employ two different data partitioning techniques in improving the predictability of machinability response. Results show that superior predictability of tool wear was observed when using feed force data for both data partitioning techniques. In particular, the ANFIS models were able to match the nonlinear relationship of tool wear and feed force highly effective compared to that of the simple power law of regression trend. This was confirmed through two statistical indices, namely r² and root mean square error (RMSE), performed on training as well as checking datasets.     

LTE-A飞蜂窝网络自相似业务流的端到端时延边界分析

LTE-A是一种4G移动通信标准,可满足移动数据业务对传输带宽的要求。为解决移动通信网络中室内信号质量较差的问题,LTE-A标准采用飞蜂窝技术作为室内无线接入解决方案。针对LTE-A飞蜂窝网络的时延边界问题,运用随机网络演算方法分析业务流的自相似性质和MIMO信道的时变特性,构建了LTE-A飞蜂窝网络中自相似业务流的随机到达与随机服务模型。围绕所构建的到达与服务模型,运用有效带宽理论和chernoff界方法,给出了自相似业务流的端到端时延边界。NS3仿真验证表明,在信道带宽和业务流优先级等指标不同的情形下,所给出的理论端到端时延边界与仿真时延的偏差在2ms以内,较为准确有效,可为确保LTE-A飞蜂窝网络的服务质量提供依据。     

基于延迟特性的改进随机Petri网建模与分析

随机Petri网能够分析过程中的随机特性,但是不能有效地描述延迟和花费问题.为了解决上述问题,提出了一种基于延迟特性的随机Petri网模型.该模型能根据延迟时间和过程的随机性得到总的时间和花费特性.给出了状态类延迟时间和延迟花费的串联及并联化简方法.最后,通过首都机场的实例说明该方法能更好地表示出应急救援的时间和花费特性.     

Memory-based adaptive partitioning (MAP) of search space for the enhancement of convergence in Pareto-based multi-objective evolutionary algorithms

A new algorithm, dubbed memory-based adaptive partitioning (MAP) of search space, which is intended to provide a better accuracy/speed ratio in the convergence of multi-objective evolutionary algorithms (MOEAs) is presented in this work. This algorithm works by performing an adaptive-probabilistic refinement of the search space, with no aggregation in objective space. This work investigated the integration of MAP within the state-of-the-art fast and elitist non-dominated sorting genetic algorithm (NSGAII). Considerable improvements in convergence were achieved, in terms of both speed and accuracy. Results are provided for several commonly used constrained and unconstrained benchmark problems, and comparisons are made with standalone NSGAII and hybrid NSGAII-efficient local search (eLS).