Digital time‐modulation pixel memory circuit in LTPS technology

Abstract— A digital time‐modulation pixel memory circuit on glass substrate has been designed and verified for a 3‐μm low‐temperature polysilicon (LTPS) technology. From the experimental results, the proposed circuit can generate 4‐bit digital codes and the corresponding inversion data with a time‐modulation technique. While the liquid‐crystal‐display (LCD) panel operates in the still mode, which means the same image is displayed on the panel, a data driver for an LCD panel is not required to provide the image data of the frame by the proposed pixel memory circuit. This pixel memory circuit can store the frame data and generate its corresponding inversion data to refresh a static image without activating the data driver circuit. Therefore, the power consumption of a data driver can be reduced in the LCD panel.     

Near-Entropy Hotlink Assignments

Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by the root of T. Each web page i carries a probability p _i representative of the frequency with which it is visited. By adding hotlinks—shortcuts from a node to one of its descendents—we wish to minimize the expected number of steps l needed to visit pages from the home page, expressed as a function of the entropy H(p) of the access probabilities p. This paper introduces several new strategies for effectively assigning hotlinks in a tree. For assigning exactly one hotlink per node, our method guarantees an upper bound on l of 1.141H(p)+1 if d>2 and 1.08H(p)+2/3 if d=2. We also present the first efficient general methods for assigning at most k hotlinks per node in trees of arbitrary maximum degree, achieving bounds on l of at most \frac2H(p)log(k+1)+1\frac{2H(p)}{\log(k+1)}+1 and \fracH(p)log(k+d)-logd+1\frac{H(p)}{\log(k+d)-\log d}+1 , respectively. All our methods are strong, i.e., they provide the same guarantees on all subtrees after the assignment. We also present an algorithm implementing these methods in O(nlog n) time, an improvement over the previous O(n ²) time algorithms. Finally we prove a Ω(nlog n) lower bound on the running time of any strong method that guarantee an average access time strictly better than 2H(p).     

基于小波分析的交通数据自适应消噪算法研究

针对实际采样环境中存在的各种干扰,以及交通数据的非平稳特性,在交通数据小波变换特性分析的基础上,提出基于小波分析的交通数据自适应消噪算法:对交通数据进行小波分解,然后对高频系数的自相关函数进行白噪声检验,从而确定小波分解的层数和阈值。采用实际检测交通流数据,对算法的有效性进行了验证分析。     

基于奇异值分解的稀疏重构近场声源定位*

针对近场声源定位问题,提出一种基于奇异值分解的稀疏重构定位方法。该方法通过奇异值分解得到信号子空间,然后在信号子空间约束l₁范数求解优化问题实现声源的定位。与直接对接收信号进行稀疏重构相比,该方法通过奇异值分解降低了计算量,有效抑制了噪声。仿真结果表明,与子空间方法相比,提高了定位的抗噪声性能和分辨率。     

Weighted principal component analysis-based service selection method for multimedia services in cloud

Cloud computing has rendered its ever-increasing advantages in flexible service provisions, which attracts the attentions from large-scale enterprise applications to small-scale smart uses. For example, more and more multimedia services are moving towards cloud to better accommodate people’s daily uses on various smart devices that support cloud, some of which are similar or equivalent in their functionality (e.g., more than 1,000 video services that share similar “video-play” functionality are present in APP Store). In this situation, it is necessary to discriminate these functional-equivalent multimedia services, based on their Quality of Service (QoS) information. However, due to the abundant information of multimedia content, dozens of QoS criteria are often needed to evaluate a multimedia service, which places a heavy burden on users’ multimedia service selection. Besides, the QoS criteria of multimedia services are usually not independent, but correlated, which cannot be accommodated very well by the traditional selection methods, e.g., traditional simple weighting methods. In view of these challenges, we put forward a multimedia service selection method based on weighted Principal Component Analysis (PCA), i.e., Weighted PCA-based Multimedia Service Selection Method (W_PCA_MSSM). The advantage of our proposal is two-fold. First, weighted PCA could reduce the number of QoS criteria for evaluation, by which the service selection process is simplified. Second, PCA could eliminate the correlations between different QoS criteria, which may bring a more accurate service selection result. Finally, the feasibility of W_PCA_MSSM is validated, by a set of experiments deployed on real-world service quality set QWS Dataset.     

目标提取与哈希机制的多标签图像检索

目的 哈希是大规模图像检索的有效方法。为提高检索精度,哈希码应保留语义信息。图像之间越相似,其哈希码也应越接近。现有方法首先提取描述图像整体的特征,然后生成哈希码。这种方法不能精确地描述图像包含的多个目标,限制了多标签图像检索的精度。为此提出一种基于卷积神经网络和目标提取的哈希生成方法。方法 首先提取图像中可能包含目标的一系列区域,然后用深度卷积神经网络提取每个区域的特征并进行融合,通过生成一组特征来刻画图像中的每个目标,最后再产生整幅图像的哈希码。采用Triplet Loss的训练方法,使得哈希码尽可能保留语义信息。结果 在VOC2012、Flickr25K和NUSWIDE数据集上进行多标签图像检索。在NDCG(normalized discounted cumulative gain)性能指标上,当返回图像数量为 1 000时,对于VOC2012,本文方法相对于DSRH(deep semantic ranking hashing)方法提高24个百分点,相对于ITQ-CCA(iterative quantization-canonical correlation analysis)方法能提高36个百分点;对于Flickr25,本文方法比DSRH方法能提高2个左右的百分点;对于NUSWIDE,本文方法相对于DSRH方法能提高4个左右的百分点。对于平均检索准确度,本文方法在NUSWIDE和Flickr25上能提高25个百分点。根据多项评价指标可以看出,本文方法能以更细粒度来精确地描述图像,显著提高了多标签图像检索的性能。结论 本文新的特征学习模型,对图像进行细粒度特征编码是一种可行的方法,能够有效提高数据集的检索性能。     

污水处理在线监测系统研究

针对当前污水处理没有实现自动控制和污水处理工艺分散的特点,设计了基于CAN总线结构的污水处理集散控制系统(DCS)模型构建一体化氧化沟的整个控制系统。用CAN总线对上位机与下位机之间进行数据通信,解决了多台设备监控的实时传输。对CAN总线和DeviceNet协议作了详细的解释,并给出了DLL以及DeviceNet协议中控室的应用程序。     

模糊直接转矩控制系统

文章采用MATLAB5 .2 /SIMULINK建立模糊直接转矩控制系统的仿真模型 ,介绍了用SIMULINK软件进行封装、S函数设计及用模糊工具箱设计模糊控制器的方法 ,并通过仿真结果验证了此模型的正确性     

用XML表示和发布图文混合信息

可扩展标识语言XML以其合理的数据组织结构和可扩展的特性,广泛适合于表示各类复杂的数据形式。利用XML表示和发布图文混合信息具有很重要的实际价值。基于实例介绍了使用XML表示和发布图文混合信息内容的方法和过程。