What we need around here is more aliasing [computer graphics]

A brief tutorial is given on what aliasing means. Plots of some relevant functions are shown. Some of the conventional wisdom about aliasing is described, and why that wisdom may not be so wise is explained. Aliasing is actually an image processing phenomenon involving the Fourier transform, convolution and the convolution theorem     

Alias verification for Fortran code optimization

Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a common variable that is aliased with another formal parameter is modified. Compilers, assuming standard-conforming programs, consider that an assignment to one variable will not change the value of any other variable, allowing optimizations involving the aliased variables. Higher performance results but anything may happen: the program may appear to run normally, or may produce incorrect answers, or may behave unpredictably. The results may depend on the compiler and the optimization level.To guarantee the standard conformance of programs and to maintain the referential transparency in order to make program analyses exact and program optimizations safe, precise alias information retrieval at a reasonable cost, especially the determination of overlaps between arrays are studied in this paper. Static analyses and code instrumentation are used to find all violations of the prohibitions against aliasing in Fortran code. Alias violation tests are inserted only at places where it cannot be proved statically that they are useless in order to reduce the number of dynamic checks at run-time. A specific memory location naming technique is used to compact representation and enhance the precision of alias analysis. Modifications on the dependence graph created by aliasing are also studied to show the impact of aliases on some program optimizing transformations. Experimental results on SPEC95 benchmark are presented and some related issues are also discussed.     

联合估计混叠度，运动参数和高分辨率图像的JEMAP算法

本文提出一种空域联合估计混叠度，运动参数和高分辨率图像的JEMAP算法，以提高超分辨率处理的适应性，在地面上稳定地获得高于实测卫星图像中所用CCD设备成像精度的高清晰图像。算法根据星戡CCD设备的成像机理，定义卫星图像的混叠度，确定超分辨率处理模型，通过空域迭代联合估计混叠度，运动参数和高分辨率图像。实际卫星图像处理表明JEMAP算法具有很好的适应性和稳定性，包含先验约束能力较强，可以解开欠采样低分辨率输入图像的混叠，重构清晰卫星图像。     

Sub‐Pixel Anti‐Aliasing Via Triangle‐Based Geometry Reconstruction

Anti‐aliasing has recently been employed as a post‐processing step to adapt to the deferred shading technique in real‐time applications. Some of these existing algorithms store supersampling geometric information as geometric buffer (G‐buffer) to detect and alleviate sub‐pixel‐level aliasing artifacts. However, the anti‐aliasing filter based on sampled sub‐pixel geometries only may introduce unfaithful shading information to the sub‐pixel color in uniform‐geometry regions, and large G‐buffer will increase memory storage and fetch overheads. In this paper, we present a new Triangle‐based Geometry Anti‐Aliasing (TGAA) algorithm, to address these problems. The coverage triangle of each screen pixel is accessed, and then, the coverage information between the triangle and neighboring sub‐pixels is stored in a screen‐resolution bitmask, which allows the geometric information to be stored and accessed in an inexpensive manner. Using triangle‐based geometry, TGAA can exclude irrelevant neighboring shading samples and achieve faithful anti‐aliasing filtering. In addition, a morphological method of estimating the geometric edges in high‐frequency geometry is incorporated into the TGAA's anti‐aliasing filter to complement the algorithm. The implementation results demonstrate that the algorithm is efficient and scalable for generating high‐quality anti‐aliased images.     

On Legality Assertions in Euclid

The design of the programming language Euclid requires that a compiler for the language produce legality assertions to aid in verification of programs written in the language. This paper analyzes the legality assertions that must be produced and discusses the impact that this requirement has on the implementation of the language.     

Splatting errors and antialiasing

The paper describes three new results for volume rendering algorithms utilizing splatting. First, an antialiasing extension to the basic splatting algorithm is introduced that mitigates the spatial aliasing for high resolution volumes. Aliasing can be severe for high resolution volumes or volumes where a high depth of field leads to converging samples along the perspective axis. Next, an analysis of the common approximation errors in the splatting process for perspective viewing is presented. In this context, we give different implementations, distinguished by efficiency and accuracy, for adding the splat contributions to the image plane. We then present new results in controlling the splatting errors and also show their behavior in the framework of our new antialiasing technique. Finally, current work in progress on extensions to splatting for temporal antialiasing is demonstrated. We present a simple but highly effective scheme for adding motion blur to fast moving volumes     

A model for scheduling of object-based,distributed real-time systems

This paper describes a general model for pre-run-time scheduling of distributed real-time systems that are composed of abstract data types (definable in languages such as Ada, Clu and Modula-2) and abstract data objects (which can be defined in C++, Eiffel and RT Euclid). An architecture model, a programming paradigm, and execution and communication paradigms form the basis for this general model. The model includesabsolute timing constraints to represent periodicity and deadlines,relative timing constraints to model several kinds of timed precedence relations and synchronization requirements,independency constraints to capture non-determinism of conditionals and repetitions, andconsistency constraints to enforce consistent use of resources. In this paper, the model is formalized to obtain a mathematical foundation on which assignment (Verhoosel et al. 1993a, Welch 1992, Welch et al. 1993) and pre-run-time scheduling problems (Verhoosel et al. 1991, Verhoosel 1992, 1993a, 1993c) are defined. Additionally, the model is extended to allow exploitation of parallelism from programs, a technique that can be used during assignment and scheduling for meeting timing constraints.     

航天嵌入式软件整数溢出的形式化验证方法

整数溢出引起的软件系统安全性问题屡见不鲜,已有的模型检测技术由于存在状态空间爆炸、不能有效支持中断驱动型程序检测等缺点而少有工程应用.结合真实案例,对航天嵌入式软件整数溢出问题的分布和特征进行了系统性的分析.在有界模型检测技术的基础上,结合整数溢出特征,提出了基于整数溢出变量依赖的程序模型约简技术;同时,针对中断驱动型程序,结合中断函数特征抽象,提出了基于干扰变量的中断驱动程序顺序化方法.经过基准测试程序和真实航天嵌入式软件实验,结果表明：该方法在保证整数溢出问题检出率的前提下,不仅能够提高分析效率,还使得已有的模型检测技术能够适用于中断驱动型程序整数溢出检测.     

Variable strength combinatorial testing of concurrent programs

Reachability testing is an important approach to testing concurrent programs. It generates and exercises synchronization sequences automatically and on-the-fly without saving any test history. Existing reachability testing can be classified into exhaustive and t-way testing. Exhaustive testing is impractical in many cases while t-way testing may decrease the capability of fault detection in some cases. In this paper, we present a variable strength reachability testing strategy, which adopts the dynamic framework of reachability testing and uses a variable strength combinatorial strategy. Different parameter groups are provided with different covering strength. Variable strength testing covers no t-way combinations but the necessary combinations of parameters having mutual interactions in a concurrent program. It is more reasonable than t-way testing because uniform interactions between parameters do not often exist in concurrent systems. We propose a merging algorithmthat implements the variable strength combinatorial testing strategy and conduct our experiment on several concurrent programs. The experimental results indicate that our variable strength reachability testing reaches a good tradeoff between the effectiveness and efficiency. It can keep the same capability of fault detection as exhaustive reachability testing while substantially reducing the number of synchronization sequences and decreasing the execution time in most cases.     

Minimizing address arithmetic instructions in embedded applications on DSPs

Address arithmetic instructions constitute a big part of the generated code for digital signal processors (DSPs). Most modern digital signal processors (DSPs) provide multiple address registers and a dedicated address generation unit (AGU) which performs address generation in parallel to instruction execution. There is no address computation overhead if the next address is within the auto-modify range. A careful placement of variables in memory is utilized to reduce the number of address arithmetic instructions and thus generate compact and efficient code. The simple offset assignment (SOA) problem concerns the layout of variables for machines with one address register and the general offset assignment (GOA) deals with multiple address registers. Both these problems assume that each variable needs to be allocated for the entire duration of a program. Both SOA and GOA are NP-complete. In this article, we present effective solutions using simulated annealing (SA) for the simple and the general offset assignment problems with variable coalescing where two or more non-interfering variables can be mapped into the same memory location. Results on several benchmarks show the significant improvement from our proposed techniques compared to other heuristics in the literature.     

低分辨雷达目标分类的最小代价拒判算法

为解决低分辨雷达目标自动识别中,干扰目标、虚假目标的存在以及不同类别目标样本集混叠的问题,提出了一种基于最小代价的拒判K近邻识别算法.该算法根据雷达识别系统最小代价的原则,利用Fisher判别函数,确定拒判门限.设计了基于两类拒判域的K近邻识别算法,第一类拒判根据训练样本集特征值的波动范围,对干扰目标和虚假目标进行拒判;第二类拒判根据测试样本与最近邻、次近邻的距离差,实现混叠区域的目标样本拒判.算法先对测试样本进行拒判分析,再利用K近邻算法识别分类.实验结果表明,基于以上算法的低分辨雷达目标识别系统具有较好的鲁棒性和识别性能.     

扫描地形图中等高线的识别

针对一般质量地形图的扫描过程中颜色混淆和错误现象比较严重,以致于在彩色分割等高线时不仅由于其自身与其他地图符号交叉或交叠而形成的断裂变得更为复杂,而且等高线间的密集排列也会造成粗线现象（等高线彼此粘连在一起）等问题提出一种有效的针对一般质量地形图中等高线的识别方法.该方法具有3个特点：一是彩色地图分割中使用关键颜色集技术以补偿混淆和错误颜色;二是在原图像中等高线出现断裂和粗线的地方采用局部窗口再分割算法,以解决等高线断裂和彼此粘连问题;最后利用等高线的全局拓扑性质滤波得到正确的等高线.实验结果表明该方法对于一些高质量和一般质量的地形图中等高线的识别都具有一定的应用潜力.     

例谈Bash与Tcsh的主要区别

Bash与tcsh是目前Unix/Linux操作系统中两种流行的shell。通过举例,对这两种shell常用的功能和特性进行了对比,内容包括变量赋值、数组、环境设置、命令参数、数值计算、条件流程控制、循环语句和信号处理等。这些比较是对这二者主要区别的一个很好的总结,能够为bash与tcsh的学习和使用者提供便利和帮助。     

A Simple Sequential Reasoning Approach for Sound Modular Verification of Mainstream Multithreaded Programs

Reasoning about multithreaded object-oriented programs is difficult, due to the non-local nature of object aliasing, data races, and deadlocks. We propose a programming model that prevents data races and deadlocks, and supports local reasoning in the presence of object aliasing and concurrency. Our programming model builds on the multi-threading and synchronization primitives as they are present in current mainstream languages. Java or C# programs developed according to our model can be annotated by means of stylized comments to make the use of the model explicit. We show that such annotated programs can be formally verified to comply with the programming model. In other words, if the annotated program verifies, the underlying Java or C# program is guaranteed to be free from data races and deadlocks, and it is sound to reason locally about program behavior. Our approach supports immutable objects as well as static fields and static initializers. We have implemented a verifier for programs developed according to our model in a custom build of the Spec# programming system, and have validated our approach on a case study.     

具有抗环境热源干扰的热释电探测器的应用研究

热释电型探测器实际是一种对温度敏感的传感器.由于各种外界环境都可能产生一定的温度场变化,因此热释电型探测器难免受到外界干扰而引入误差.根据热释电敏感元件的探测原理,本文提出一种对正负脉冲信号和连续正负脉冲信号进行对称峰值检测的方法.若检测到的热释电信号为对称正负信号则表示被检测目标为动态热源,否则表示为静止热源.用这种方法对敏感元件的输出信号进行处理可以十分有效地消除位置固定(或移动速度很慢)的热源所产生的干扰.     

Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation

Mixed polynomial matrices are polynomial matrices with two kinds of nonzero coefficients: fixed constants that account for conservation laws and independent parameters that represent physical characteristics. The computation of their maximum degrees of minors is known to be reducible to valuated independent assignment problems, which can be solved by polynomial numbers of additions, subtractions, and multiplications of rational functions. However, these arithmetic operations on rational functions are much more expensive than those on constants. In this paper, we present a new algorithm of combinatorial relaxation type. The algorithm finds a combinatorial estimate of the maximum degree by solving a weighted bipartite matching problem, and checks if the estimate is equal to the true value by solving independent matching problems. The algorithm mainly relies on fast combinatorial algorithms and performs numerical computation only when necessary. In addition, it requires no arithmetic operations on rational functions. As a byproduct, this method yields a new algorithm for solving a linear valuated independent assignment problem.     

优先级有限时的单处理器静态优先级调度

静态优先级调度在实际应用中经常受到系统支持的优先级个数的影响,当任务个数多于系统优先级个数时,需要将几个任务优先级映射成一个系统优先级.这可能引起优先级映射问题,使映射前可调度的系统(任务集合)在映射后变得不可调度.解决这一问题需要减少时间复杂度的映射算法和判定映射后任务可调度性的充分必要条件主要存在3种映射算法:(1)按照任务优先级递减顺序进行映射的DPA(decreasing priority assignment)算法;(2)按照优先级递增顺序进行映射的IPA(Increasing priority assignment)算法;(3)阈值段间映射法(thresh01d segment mapping,简称TSM).描述了3种算法的实现和判定条件,论述并证明了算法特性,分析并通过仿真实验比较了算法的性能,最后总结了3种算法各自的适用场合.比较结果和结论对实时嵌入式系统的设计和实现具有一定的参考价值.     

Precise rendering method for exact anti-aliasing and highlighting

This paper introduces the Precise Rendering Method, which generates accurately anti-aliased and highlighted images from tessellated polygons. The Precise Rendering Method first solves the aliasing problems of hidden surface removal by using the Cross Scanline Algorithm. This algorithm can exactly calculate polygon areas projected onto each pixel by using horizontal and vertical scanlines. Aliasing artifacts in shading are then prevented by the Reflection Intergration Method, which analytically integrates the intensity of reflection in the solid angle defined by surface normals at vertices of the projected area. Several synthesized images are created to show the efficiency of the Precise Rendering Method.     

基于小波分析的扬声器故障诊断方法研究

本文提出了一种用于扬声器故障诊断的小波包图像处理方法，该方法可以得到各类故障扬声器在扫频信号激励下的时频信息，定义出标准扬声器的时频分布特征。通过比较不同故障扬声器的时频图像与标准扬声器的时频图像特征的欧氏距离，可以判断出扬声器的故障类别。     

Anomaly Detection in Concurrent Software by Static Data Flow Analysis

Algorithms are presented for detecting errors and anomalies in programs which use synchronization constructs to implement concurrency. The algorithms employ data flow analysis techniques. First used in compiler object code optimization, the techniques have more recently been used in the detection of variable usage errors in dngle process programs. By adapting these existing algorithms, the sane classes of variable usage errors can be detected in concurrent process programs. Important classes of errors unique to concurrent process programs are also described, and algorithms for their detection are presented.