A novel fast distance relay for series compensated transmission lines

This paper presents a fast distance relay for series compensated transmission lines based on the R–L differential-equation algorithm using the theory of equal transfer process of transmission lines. The measuring distances based on the proposed algorithm can fast approach the actual value of fault distance when a fault occurs in front of the series capacitor. When a fault occurs behind of the series capacitor, the fault loop, including the series capacitor, does not match the R–L transmission line model, so the measuring distances fluctuate severely. Based on this, the relative position of the fault with respect to the series capacitor can be judged effectively according to the fluctuation range of the measuring distances, and the accurate fault location can be obtained fast. A variety of PSCAD/EMTDC simulation tests show that the new relay has fast operating speed and high accuracy when applied to the long series compensated transmission lines.     

Time-series clustering – A decade review

Clustering is a solution for classifying enormous data when there is not any early knowledge about classes. With emerging new concepts like cloud computing and big data and their vast applications in recent years, research works have been increased on unsupervised solutions like clustering algorithms to extract knowledge from this avalanche of data. Clustering time-series data has been used in diverse scientific areas to discover patterns which empower data analysts to extract valuable information from complex and massive datasets. In case of huge datasets, using supervised classification solutions is almost impossible, while clustering can solve this problem using un-supervised approaches. In this research work, the focus is on time-series data, which is one of the popular data types in clustering problems and is broadly used from gene expression data in biology to stock market analysis in finance. This review will expose four main components of time-series clustering and is aimed to represent an updated investigation on the trend of improvements in efficiency, quality and complexity of clustering time-series approaches during the last decade and enlighten new paths for future works.     

以一种新的距离度量作为反馈的相关跟踪方法

基于相关的模板匹配方法在图像跟踪中得到了广泛的应用,但是这种方法的主要缺点是对图像噪声非常敏感,而且由这种方法得出的相关曲面比较平坦。为了有效抑制噪声和局部遮挡对图像的影响,提出用鲁棒统计中的一个值代替相关值作为距离度量。它不是计算两幅图像的对应像素差值,而是计算两幅图像中差别不大的对应像素对的个数。实验证明这样得到的曲面相对　　收稿日期:2003 08 31;　修订日期:2003 10 28作者简介:张桂林(1944 ),男,天津人,教授,博士生导师,主要研究方向为自动识别、人体生物统计特征识别、图像处理算法与系统性能评估等。　　　　　　　要尖锐得多。当上述的距离度量应用于跟踪过程中时,模板的合理更新对跟踪非常重要。基于上述的距离度量方法,提出了一种新的模板更新策略。利用两幅图像中近似像素在整修匹配模板像素中所占的比例大小决定加权系数。这种加权策略可以自适应地根据图像序列的变化选择更新相关模板,同时在一定程度上减小模板漂移的危险。     

挤压力对晶体生长速度及枝晶间距的影响

研究了挤压铸造时挤压力对宏观晶体生长速度的影响，给出了晶体生长速度表达式。结果表明：挤压力对合金宏观晶体生长速度的影响除与合金成分有关外，在某些挤压条件下，当形核率的增加幅度超过长大速度时，则挤压力可使宏观晶粒细化；反之，会使宏观晶粒变粗。随着挤压力的提高，合金凝固速度加快，一次枝晶间距和二次枝晶间距都随之减小，从而细化了树枝晶。     

Education-driven research in CAD

We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals.     

亚毫米波系统探测距离分析

本文提出了距离的概率分布函数作为系统的性能指标，提高了系统评价的准确性。     

条形码中距离动态识别技术研究

本文讨论了条形码中距离动态识别技术中扫描景深与扫描光束波长和条宽等要素之间的关系，提出了改善条形码读取距离的３种方法。为扩大条形码在工业过程控制、企业管理等领域的应用范围提供了理论依据。     

A New Image Analysis Based Method for Measuring Electrospun Nanofiber Diameter

In this paper, a new image analysis based method for electrospun nanofiber diameter measurement has been presented. The method was tested by a simulated image with known characteristics and a real web. Mean (M) and standard deviation (STD) of fiber diameter obtained using this method for the simulated image were 15.02 and 4.80 pixels respectively, compared to the true values of 15.35 and 4.47 pixels. For the real web, applying the method resulted in M and STD of 324 and 50.4 nm which are extremely close to the values of 319 and 42 nm obtained using manual method. The results show that this approach is successful in making fast, accurate automated measurements of electrospun fiber diameters.     

Computing distance transformations in convex and non-convex domains

It is shown that the well known two-pass sequential local transformation algorithm for computing a distance transformation in rectangular domains may fail in some convex integer domains, but that a four-pass algorithm is sufficient in all two-dimensional convex domains. For non-convex domains the number of passes necessary is shown to be generally greater. Two propagation algorithms for computing the distance transformation are described and shown theoretically and experimentally to be computationally more efficient than the sequential local transformation algorithm in non-convex domains of complex shape. The relationship of the distance transformation in non-convex domains to some more general transformations is explored.     

Adoption of Technology-Mediated Distance Education: A longitudinal analysis

We investigated the factors that facilitated the fast adoption and utilization of Technology-Mediated Distance Education (TMDE) among higher education institutions. Our analysis was based on a rich data set on the utilization of TMDE between the 1997–1998 and 2000–2001 academic years. The analysis showed that size, public/private status, and location significantly predicted its actual adoption. Being in an urban location negatively affected enrollment in the courses at the undergraduate but not at the graduate level. While the intent to adopt TMDE correlated significantly with actual adoption, many schools that were not interested in TMDE in 1997–1998 adopted it by 2000–2001. Interestingly, late adopters utilized certain technologies as frequently as early adopters, such as synchronous Internet-based instruction and the use of CD-ROMs.