Sorting on STAR

This paper gives timing comparisons for three sorting algorithms written for the CDC STAR computer. One algorithm is Hoare's Quicksort, which is the fastest or nearly the fastest sorting algorithm for most computers. A second algorithm is a vector version of Quicksort that takes advantage of the STAR's vector operations. The third algorithm is an adaptation of Batcher's sorting algorithm, which makes especially good use of vector operations but has a complexity of N (log N)2 as compared to a complexity of N log N for the Quicksort algorithms. In spite of its worse complexity, Batcher's sorting algorithm is competitive with the serial version of Quicksort for vectors up to the largest that can be treated by STAR. Vector Quicksort outperforms the other two algorithms and is generally preferred. These results indicate that unusual instruction sets can introduce biases in program execution time that counter results predicted by worst-case asymptotic complexity analysis.     

A new external sorting algorithm with no additional disk space

This paper is concerned with an external sorting algorithm with no additional disk space. The proposed algorithm is a hybrid one that uses Quicksort and special merging process in two distinct phases. The algorithm excels in sorting a huge file, which is many times larger than the available memory of the computer. This algorithm creates no extra backup file for manipulating huge records. For this, the algorithm saves huge disk space, which is needed to hold the large file. Also our algorithm switches to special merging process after the first phase that uses Quicksort. This reduces the time complexity and makes the algorithm faster.     

Computer-aided chemistry—II. A spectral database management program for use with microcomputers

A novel, specialized database management program, Spectra Manager, which organizes, manipulates, and plots spectral data, is described. The program, which was developed as a precursor to a database management program that will be used when all the spectral data recorded in a laboratory are stored on a common archival device, was designed specifically to handle 2-dimensional data sets completely graphically on the IBM S9000 laboratory computer. The IBM S9000 computer, which is based on the Motorola 68000 microprocessor, was selected because (i) high level languages can readily address memory in excess of 1 M byte, (ii) the processor is fast, and (iii) the IBM S9000 has a high resolution, memory-mapped CRT. These features allow the program to provide the scientist with a data processing environment that treats large sets of individual spectra much like numbers are tabulated and manipulated, with simple, spreadsheet-like database management programs. The program, also offers the scientist the novel capability of rapidly scanning through multiple sets of spectral data. Program and data manipulation functions are interactively controlled through on-screen menus and software programmable keys. Run-time monitoring information is displayed in four distinct display windows. Spectral data are input using standard or user-defined formats, and then manipulated with typical spectral processing procedures including: baseline subtraction, digital filter smoothing using a fast Fourier transform, and compilation of spectral overlay plots. The processed data can be output to devices such as a printer, plotter, or disk file. The program monitors each session and stores in a disk file, or prints on a printer, a summary of program activity that can be used as an audit trail.     

Efficient query processing for a subset of linear recursive binaryrules

We study the complexity of processing a class of rules called simple binary rule sets. The data referenced by the rules are stored in secondary memory. A necessary and sufficient condition that a simple binary rule set can be processed in a single pass of a file containing the base relations is given. Because not all simple binary rule sets can be processed in a single pass, a necessary and sufficient condition that a simple binary rule set can be processed by a constant number of passes is also given     

Constrained stabilization of discrete-time systems

Based on the growth rate of the set of states reachable with unit-energy inputs, we show that a discretetime controllable linear system is globally controllable to the origin with constrained inputs if and only if all of its eigenvalues lie in the closed unit disk. These results imply that the constrained Infinite-Horizon Model Predictive Control algorithm is stabilizing for a sufficiently large number of control moves if and only if the controlled system is stabilizable and all its eigenvalues lie in the closed unit disk. In the second part of the paper, we propose an implementable Model Predictive Control algorithm and show that with this scheme a discrete-time linear system with n poles on the unit disk (with any multiplicity) can be globally stabilized if the number of control moves is larger than n. For pure integrator systems, this condition is also necessary. Moreover, we show that global asymptotic stability is preserved for any asymptotically constant disturbance entering at the plant input.     

归并方式的多线程快速排序算法

本文基于Java平台针对经典快速排序提出改进方案,使用归并的思想对快速排序作了多线程优化,并对单、多线程下的快速排序进行了对比测试和分析。结果表明,通过多线程优化,快速排序在双核主机上对5千万个随机整型数据进行排序的速度是单线程的1.6倍,说明了该优化方法的有效性。该方法思路直观、容易理解,宜作为多核技术教学案例。     

Exploiting partial order with Quicksort

The widely known Quicksort algorithm does not attempt to actively take advantage of partial order in sorting data. A simple change can be made to the Quicksort strategy to give a bestcase performance of n, for ordered data, with a smooth transition to O(n log n) for random data. This algorithm (Transort) matches the performance of Sedgewick's claimed best implementation of Quicksort for random data.     

无线传感器网络中2-连通k-支配的容错连通支配集构造

无线传感器网络可采用连通支配集的虚拟骨干技术使平面网络层次化,但传感器节点的失效和链路的断裂会导致网络失败,虚拟骨干网最好具有容错性好、可靠性高的特性.对此,提出具有容错性的2-连通 -支配集的构造算法,以节点自身和邻域信息分布式地构造 -支配节点,利用最小生成树和块-割点图将 -支配节点2-连通.理论分析和实验仿真表明此算法具有较好的算法性能比,在中等规模网络中会产生更少的具有容错性的 -支配节点,可节省传感器节点的能量消耗和网络的通信开销.     

Performance assessment of multithreaded quicksort algorithm on simultaneous multithreaded architecture

Sorting huge amounts of datasets have become essential in many computer applications, such as search engines, database and web-based applications, in order to improve searching performance. Moreover, due to the witnessed prevalence of the commercial Simultaneous Multithreaded architecture (SMT), parallel programming using multithreading becomes a dire need for efficiently using all available hardware resources for one application. In this paper, one of the efficient and quick algorithms, the Quicksort, is applied as a parallel multithreaded algorithm on SMT architecture, where virtual parallelization has been achieved using the POSIX threads (Pthreads) library. The proposed algorithm is evaluated and compared with its sequential counterpart. The obtained analytical and experimental results reveal that multithreading is a viable technique for implementing the parallel Quicksort algorithm efficiently on SMT architecture, where it has been shown both analytically and experimentally that the parallel multithreaded Quicksort algorithm outperforms the sequential Quicksort algorithm in terms of various performance metrics including; time complexity and speedup.     

A new approach to digital PID controller design

In this note, we present a new approach to the problem of designing a digital proportional-integral-derivative (PID) controller for a given but arbitrary linear time invariant plant. By using the Tchebyshev representation of a discrete-time transfer function and some new results on root counting with respect to the unit circle, we show how the digital PID stabilizing gains can be determined by solving sets of linear inequalities in two unknowns for a fixed value of the third parameter. By sweeping or gridding over this parameter, the entire set of stabilizing gains can be recovered. The precise admissible range of this parameter can be predetermined. This solution is attractive because it answers the question of whether there exists a stabilizing solution or not and in case stabilization is possible the entire set of gains is determined constructively. Using this characterization of the stabilizing set we present solutions to two design problems: 1) maximally deadbeat design, where we determine for the given plant, the smallest circle within the unit circle wherein the closed loop system characteristic roots may be placed by PID control and 2) maximal delay tolerance, where we determine, for the given plant the maximal-loop delay that can be tolerated under PID control. In each case, the set of controllers attaining the specifications is calculated. Illustrative examples are included.     

基于邻域值差异度量的离群点检测算法

针对离群点检测中传统距离法不能有效处理符号型属性和经典粗糙集方法不能有效处理数值型属性的问题,利用邻域粗糙集的粒化特征提出了改进的邻域值差异度量（NVDM）方法进行离群点检测。首先,将属性取值归一化并以混合欧氏重叠度量（HEOM）和具有自适应特征的邻域半径构建邻域信息系统（NIS）;其次,以NVDM构造对象的邻域离群因子（NOF）;最后,设计并实现了基于邻域值差异度量的离群点检测（NVDMOD）算法,该算法在计算单属性邻域覆盖（SANC）的方式上充分利用有序二分和近邻搜索思想改进了传统的无序逐一计算模式。在UCI标准数据集上与现有离群点检测算法——邻域离群点检测（NED）算法、基于距离的离群点检测（DIS）算法和K最近邻（KNN）算法进行了实验对比、分析。实验结果表明,NVDMOD算法具有更好的适应性和有效性,为混合型属性数据集的离群点检测提供了一条更有效的新途径。     

Discrimination of axonal neuropathy using sensitivity and specificity statistical measures

In needle electromyography, general mathematical methods of pattern recognition and signal analysis can be used to detect motor unit potentials and to classify various types of muscle diseases. The goal of the paper is to contribute to various methods enabling discrimination of individuals with axonal neuropathy (a positive set) from normal cases (a control set) using signals acquired from muscle activities. Data from a control set of 104 individuals and a set of 76 patients were used to validate selected methods of their separation and classification. Different features in both the time and frequency domains were studied to obtain the most reliable results . This novel approach involves comparison of individual features based on adaptive signal thresholding, as well as their combination, using supervised sigmoidal neural networks for their classification. Specificity, sensitivity and accuracy of the features used to detect individuals with axonal neuropathy was analysed using the receiver operating characteristic curves and confusion analysis. An accuracy higher than 93 % was achieved for the given sets of individuals and the optimal criterion values. The proposed modified Willison amplitude together with statistical and spectral properties of signal components classified individuals into sets of healthy and neuropathic patients by artificial neural networks with sensitivity 96.1 % and sufficient accuracy in the wide range of criterion values.     

基于Kalman滤波的滑模控制在磁盘驱动系统中的应用

针对磁盘驱动伺服系统中存在的诸多随机干扰和随机噪声等特点,常规的PID控制在该类系统中存在滞后或超调,以及传统的滑模控制要求系统不确定因素的边界为已知等缺点,本文提出了基于Kalman滤波算法的指数趋近律滑模变结构控制方法,以指数趋近律作为到达条件设计滑模变结构控制器。该方法能够较好地处理磁盘驱动伺服系统中的不确定性问题,而且对外界干扰不敏感。在MAT-LAB环境下对该算法进行了仿真试验研究,结果表明,该方法能够很好地削弱抖振和抑制伺服系统的随机干扰。将该方法应用于磁盘驱动伺服系统可以显著地改善系统的动态特性,并能使系统的稳定性和控制精度大大提高。     

一种线性系统可重构控制分析方法

提出了一种线性系统在线或者离线的可重构控制分析方法,该方法基于功能目标模型,能够定性分析线性系统的可重构控制问题, 包括发生多个故障时是否具有可重构能力,采用哪些组件和何种控制方法,以及重构后系统是否能达到期望的控制目标等.首先定义了功能、目标、最小重构单元状态、可行集等概念,并基于这些概念建立系统功能目标模型.该模型由功能目标关系和各个目标的可行集组成. 总目标的可行集为系统顶层可行集,可重构控制方案的选择基于顶层可行集.应用本文方法,离线建立起控制系统的功能目标模型后, 可以在线或离线分析其多种故障模式下的可重构问题,还可以用于指导可重构性设计.最后,给出一个卫星控制系统可重构控制分析的例子.     

WSN中有效的最小单位圆集覆盖算法*

针对具有不同传输半径的无线传感器网络覆盖与广播数据转发问题,提出了一种以最小单位圆覆盖集作为广播数据转发集的算法。该算法能有效计算出覆盖范围的轮廓集,具有最优的时间复杂度O(n log n)。对每个节点,该算法以其最少数量的邻居节点子集实现所有邻居节点的覆盖,并证明了该算法找到的最小单位圆覆盖集与其轮廓集是相等的。详细的仿真实验及与现有算法的比较表明,提出的覆盖算法不仅以最少数量的节点实现了网络覆盖与广播数据转发,同时延长了网络生命期。     

Distributed minimum dominating set approximations in restricted families of graphs

A dominating set is a subset of the nodes of a graph such that all nodes are in the set or adjacent to a node in the set. A minimum dominating set approximation is a dominating set that is not much larger than a dominating set with the fewest possible number of nodes. This article summarizes the state-of-the-art with respect to finding minimum dominating set approximations in distributed systems, where each node locally executes a protocol on its own, communicating with its neighbors in order to achieve a solution with good global properties. Moreover, we present a number of recent results for specific families of graphs in detail. A unit disk graph is given by an embedding of the nodes in the Euclidean plane, where two nodes are joined by an edge exactly if they are in distance at most one. For this family of graphs, we prove an asymptotically tight lower bound on the trade-off between time complexity and approximation ratio of deterministic algorithms. Next, we consider graphs of small arboricity, whose edge sets can be decomposed into a small number of forests. We give two algorithms, a randomized one excelling in its approximation ratio and a uniform deterministic one which is faster and simpler. Finally, we show that in planar graphs, which can be drawn in the Euclidean plane without intersecting edges, a constant approximation factor can be ensured within a constant number of communication rounds.     

Multiple Solutions in Euler’s Elastic Problem

The paper is devoted to multiple solutions of the classical problem on stationary configurations of an elastic rod on a plane; we describe boundary values for which there are more than two optimal configurations of a rod (optimal elasticae). We define sets of points where three or four optimal elasticae come together with the same value of elastic energy. We study all configurations that can be translated into each other by symmetries, i.e., reflections at the center of the elastica chord and reflections at the middle perpendicular to the elastica chord. For the first symmetry, the ends of the rod are directed in opposite directions, and the corresponding boundary values lie on a disk. For the second symmetry, the boundary values lie on a Möbius strip. As a result, we study both sets numerically and in some cases analytically; in each case, we find sets of points with several optimal configurations of the rod. These points form the currently known part of the reachability set where elasticae lose global optimality.     

Local 7-coloring for planar subgraphs of unit disk graphs

We study the problem of computing locally a coloring of an arbitrary planar subgraph of a unit disk graph. Each vertex knows its coordinates in the plane and can communicate directly with all its neighbors within unit distance. Using this setting, first a simple algorithm is given whereby each vertex can compute its color in a 9-coloring of the planar graph using only information on the subgraph located within at most 9 hops away from it in the original unit disk graph. A more complicated algorithm is then presented whereby each vertex can compute its color in a 7-coloring of the planar graph using only information on the subgraph located within a constant number (201, to be exact) of hops away from it.     

关于二型模糊集合的一些基本问题

采用集合论的方法给出了单位模糊集合和二型模糊集合及其在一点的限制等定义,使得二型模糊集合更易于理解.通过定义嵌入单位模糊集合来描述一般二型模糊集合,并给出离散、半连通二型模糊集合的表达式.根据论域、主隶属度及隶属函数的特性将二型模糊集合分为四种类型:离散、半连通、连通及复合型,并根据连通的特点将连通二型模糊集合分为单连通及多连通两类.利用支集的闭包（Closure of support,CoS）划分法表述主隶属度及区间二型模糊集合.提出了CoS二、三次划分法分别来表述单、复连通二型模糊集合,并使每一个子区域的上下边界及次隶属函数在该子区域上的限制分别具有相同的解析表述式.最后,探讨了二型模糊集合在一点的限制、主隶属度、支集、嵌入单位模糊集合之间的关系.