偏最小二乘方法在中药指纹图谱相似度研究中的应用

本文介绍了偏最小二乘作为1种新的方法应用于指纹图谱的相似度比较计算中.偏最小二乘方法通过从中药色谱或光谱数据中提取大量信息来预测出1个响应值.本文中利用偏最小二乘方法为基础来计算中药色谱指纹图谱的相似度.相比较于传统的相似度计算方法,上述方法得到的结果更加明确可靠,并且计算量少于其他算法.     

浅析艺术类专业《计算机基础》的教学方法

近年来,高校的计算机基础教学在不断发展,教学方法也在不断地改进。如何根据学生特点,使用各种行之有效的教学方法是提高教学质量的关键。文章结合教学实际,分析探讨了如何针对艺术类专业学生的特点,进行《计算机基础》教学方法改革。     

Semi-supervised locally discriminant projection for classification and recognition

Semi-supervised dimensional reduction methods play an important role in pattern recognition, which are likely to be more suitable for plant leaf and palmprint classification, since labeling plant leaf and palmprint often requires expensive human labor, whereas unlabeled plant leaf and palmprint is far easier to obtain at very low cost. In this paper, we attempt to utilize the unlabeled data to aid plant leaf and palmprint classification task with the limited number of the labeled plant leaf or palmprint data, and propose a semi-supervised locally discriminant projection (SSLDP) algorithm for plant leaf and palmprint classification. By making use of both labeled and unlabeled data in learning a transformation for dimensionality reduction, the proposed method can overcome the small-sample-size (SSS) problem under the situation where labeled data are scant. In SSLDP, the labeled data points, combined with the unlabeled data ones, are used to construct the within-class and between-class weight matrices incorporating the neighborhood information of the data set. The experiments on plant leaf and palmprint databases demonstrate that SSLDP is effective and feasible for plant leaf and palmprint classification.     

语义驱动的关联规则挖掘算法研究

为了使传统的关联规则挖掘算法在结合到具体领域时具有更强的适应性,提出了DS-Apriori算法。该算法建立在语义本体的基础上,根据项集内部的语义相关度动态的确定该项集的最小支持度,并采用了项集语义相关度的增量计算方法。实验结果表明,DS-Apriori算法在很大程度上提高了关联规则挖掘算法的效率和效果。     

动态相位调整技术在FPGA中的设计与实现

提出一种基于FPGA的动态相位调整实现方案。在高速数据传输接口中,由于数据窗缩小以及传输路径不一致,造成数据和时钟信号在FPGA的接收端发生位偏移和字偏移。动态相位调整技术根据当前各数据线物理状态,对各信号线动态进行去偏移操作,克服了静态相位调整中参数不可再调的缺点,使接口不断适应外部环境的变化,从而保证数据的可靠传输。     

Utility function of TCP

Understanding the TCP congestion control mechanism from a global optimization point of view is not only important in its own right, but also crucial to the design of other transport layer traffic control protocols with provable properties. In this paper, we derive a global utility function and the corresponding optimal control law, known as TCP control law, which maximizes the global utility. The TCP control law captures the essential behaviors of TCP, including slow start, congestion avoidance, and the binary nature of congestion feedback in TCP. We find that the utility function of TCP is linear in the slow start phase and is proportional to the additive increase rate and approaches the well-known logarithm function as the data rate becomes large in the congestion avoidance phase. We also find that understanding the slow start phase with a fixed threshold is critical to the design of new transport layer control protocols to enable quality of service features. Finally, as an application, we design a Minimum Rate Guaranteed (MRG) traffic control law that shares the same utility function as the TCP control law. Our simulation study of the MRG control law indicates that it is indeed TCP friendly and can provide minimum rate guarantee as long as the percentage of network resource consumed by the MRG flows is moderately small.     

A new certificateless aggregate signature scheme

Aggregate signatures are useful in special areas where the signatures on many different messages generated by many different users need to be compressed. In this paper, we study aggregate signatures in certificateless public key settings. We first present the notion and security model of certificateless aggregate signature schemes. Then we give an efficient certificateless aggregate signature scheme. Our scheme is existentially unforgeable under adaptive chosen-message attacks assuming the computational Diffie–Hellman problem is hard.     

Multi-scale object-based measurement of arid plant community structure

The measurement of plant community structure provides an extensive understanding of its function, succession and ecological process. The detection of plant community boundary is rather a challenge despite in situ work. Recent advances in object-based image analysis (OBIA) and machine learning algorithms offer new opportunities to address this challenge. This study presents a multi-scale segmentation approach to accurately identify the boundaries of each vegetation and plant community for mapping plant community structure. Initially, a very high resolution (VHR) Worldview-2 image of a desert area is hierarchically segmented from scale parameter 2 to 500. Afterward, the peak values of the standard deviation of brightness and normalized difference vegetation index (NDVI) across the segmentation scales are detected to determine the optimal segmentation scales of homogeneous single plant and plant community boundaries. A multi-scale classification of vegetation characterization with features of multiple bands, NDVI, grey-level co-occurrence matrix (GLCM) entropy and shape index is performed to identify dryland vegetation types. Finally, the four vegetation structural features on the type, diversity, object size and shape are calculated within the plant community boundaries and composed to plant community structure categories. Comparing the results with the object fitting index (FI) of the reference data, the validation indicates that the optimal segmentations of tree, shrub and plant communities are consistent with the identified peak values.