Line planning on tree networks with applications to the Quito Trolebús system

We discuss an optimization model for the line planning problem in public transport in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the computational complexity of this problem for tree network topologies as well as several categories of line operations that are important for the Quito Trolebús system. In practice, these instances can be solved quite well, and significant optimization potentials can be demonstrated.     

Correspondence of projected 3‐D points and lines using a continuous GRASP

The field of computer vision has experienced rapid growth over the past 50 years. Many computer vision problems have been solved using theory and ideas from algebraic projective geometry. In this paper, we look at a previously unsolved problem from object recognition, namely object recognition when the correspondences between the object and image data are not known a priori. We formulate this problem as a mixed‐integer non‐linear optimization problem in terms of the unknown projection relating the object and image, as well as the unknown assignments of object points and lines to those in the image. The global optimum of this problem recovers the relationship between the object points and lines with those in the image. When certain assumptions are enforced on the allowable projections mapping the object into the image, a proof is provided which permits one to solve the optimization problem via a simple decomposition. We illustrate this decomposition approach on some example scenarios.     

基于多指标的指纹图像质量综合评估研究

结合空域和频域特征的质量评估方法评估指纹图像质量。分割出指纹图像有效区域,分析该有效区域的面积、偏移度、干湿度等局部质量评估指标,并对其中心区域进行快速傅里叶变换获得全局质量评估指标,通过非线性加权融合5个质量评估指标的评估分数得到指纹图像的综合质量评估分数。实验结果表明,该方法能准确判断指纹图像的质量,有助于提高自动指纹识别系统的整体性能。     

On the determination of the steady film profile for a non-Newtonian thin droplet

A shooting method is used to determine a solution to a third-order ODE modeling the steady profile of a non-Newtonian thin droplet. We compare a direct approach to an iterative approach using a secant method. We obtain a nonlinear relationship between the contact angle ? and the position of the contact line r. From this nonlinear relationship we use curve fitting to obtain an empirical law of the form tan?∝r^f(k) where k is the power law coefficient and f is a nonlinear function of k.     

Analyzing evolution of variability in a software product line: From contexts and requirements to features

Context

In the long run, features of a software product line (SPL) evolve with respect to changes in stakeholder requirements and system contexts. Neither domain engineering nor requirements engineering handles such co-evolution of requirements and contexts explicitly, making it especially hard to reason about the impact of co-changes in complex scenarios.

Objective

In this paper, we propose a problem-oriented and value-based analysis method for variability evolution analysis. The method takes into account both kinds of changes (requirements and contexts) during the life of an evolving software product line.

Method

The proposed method extends the core requirements engineering ontology with the notions to represent variability-intensive problem decomposition and evolution. On the basis of problemorientation, the analysis method identifies candidate changes, detects influenced features, and evaluates their contributions to the value of the SPL.

Results and Conclusion

The process of applying the analysis method is illustrated using a concrete case study of an evolving enterprise software system, which has confirmed that tracing back to requirements and contextual changes is an effective way to understand the evolution of variability in the software product line.     

Application of extreme learning machine for series compensated transmission line protection

This paper proposes a new approach based on combined Wavelet Transform-Extreme Learning Machine (WT-ELM) technique for fault section identification (whether the fault is before or after the series capacitor as observed from the relay point), classification and location in a series compensated transmission line. This method uses the samples of fault currents for half cycle duration from the inception of fault. The features of fault currents are extracted by first level decomposition of the current samples using discrete wavelet transform (DWT) and the extracted features are applied as inputs to ELMs for fault section identification, classification and location. The feasibility of the proposed method has been tested on a 400 kV, 300 km series compensated transmission line for all the ten types of faults using MATLAB simulink. On testing 28,800 fault cases with varying fault resistance, fault inception angle, fault distance, load angle, percentage compensation level and source impedance, the performance of the proposed method has been found to be quite promising. The results also indicate that the proposed method is robust to wide variation in system and operating conditions.     

基于移动平均线组合和支持向量机的股市趋势研究

证券投资是一种高风险、高收益的理财方式,而对市场运行趋势的良好把握有助于投资者回避风险、把握机会。提出基于多条移动平均线斜率组合和支持向量机算法,判断当前市场运行趋势,从而采取相应的投资策略。模拟实验证明,该方法取得了良好的效果。     

基于几何不变量的直线匹配方法

针对目前直线匹配算法大多基于直线段支持区域的几何特性、灰度特性,但这些特性又极易受外界因素干扰造成匹配失败的情况,提出了基于直线几何不变量的匹配方法,该方法在无任何已知条件的情况下,运用叉积符号、点的线束交比不变量进行直线匹配。对于各个视点图像,采用Hough变换提取直线间交点集,再采用Graham扫描法构造一个最小的凸包,并通过匹配凸包顶点的交比序列来建立点与点的对应关系,选取其中一个对应关系完成直线的匹配。实验结果表明,该方法鲁棒性较好,具有广泛的应用性。     

Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines

This paper considers the flexible flow line problem with unrelated parallel machines at each stage and with a bottleneck stage on the line. The objective of the problem is to minimize the total tardiness. Two bottleneck-based heuristics with three machine selection rules are proposed to solve the problem. The heuristics first develop an indicator to identify a bottleneck stage in the flow line, and then separate the flow line into the upstream stages, the bottleneck stage, and the downstream stages. The upstream stages are the stages ahead of the bottleneck stage and the downstream stages are the stages behind the bottleneck stage. A new approach is developed to find the arrival times of the jobs at the bottleneck stage. Using the new approach, the bottleneck-based heuristics develop two decision rules to iteratively schedule the jobs at the bottleneck stage, the upstream stages, and the downstream stages. In order to evaluate the performance of the bottleneck-based heuristics, seven commonly used dispatching rules and a basic tabu search algorithm are investigated for comparison purposes. Seven experimental factors are used to design 128 production scenarios, and ten test problems are generated for each scenario. Computational results show that the bottleneck-based heuristics significantly outperform all the dispatching rules for the test problems. Although the effective performance of the bottleneck-based heuristics is inferior to the basic tabu search algorithm, the bottleneck-based heuristics are much more efficient than the tabu search algorithm. Also, a test of the effect of the experimental factors on the dispatching rules, the bottleneck-based heuristics, and the basic tabu search algorithm is performed, and some interesting insights are discovered.