Incremental maintenance of aggregate and outerjoin expressions

Views stored in a data warehouse need to be kept current. As recomputing the views is very expensive, incremental maintenance algorithms are required. Over recent years, several incremental maintenance algorithms have been proposed. None of the proposed algorithms handle the general case of relational expressions involving aggregate and outerjoin operators efficiently.     

基于增量式PID算法的帆板控制系统的设计

基于STC12C5A60S2单片机与增量式PID算法,实现对帆板系统的控制。该系统主要由键盘模块、显示模块、风扇驱动模块、角度测量模块、报警模块组成。角度传感器测量帆板的角度并反馈回单片机,通过增量式PID算法计算,并由PWM方法控制风扇的转速,从而实现精确控制风扇风力与帆板角度。     

An Incremental Roll Forming Process for Manufacturing Doubly Curved Sheets from General Quadrilateral Sheet Blanks with Enhanced Process Features

In order to manufacture a doubly curved sheet metal effectively, a flexible incremental roll forming process has been developed by adopting the advantages of the incremental forming process and the roll forming process by combining inherent flexibility of the incremental forming process and continuous deformation of the roll forming process. In the proposed roll forming system, a newly designed gripper system is attached in order to achieve automation and more precision manufacturing of the required sheet intended double curvature. The forming method has been further enhanced to form general quadrilateral blanks (including a square, a rectangle, a symmetrical trapezoid and an asymmetrical trapezoid, etc.) into doubly curved shapes by controlling the forming schedule developed by various experiments.     

Incrementally building frequent closed itemset lattice

A concept lattice is an ordered structure between concepts. It is particularly effective in mining association rules. However, a concept lattice is not efficient for large databases because the lattice size increases with the number of transactions. Finding an efficient strategy for dynamically updating the lattice is an important issue for real-world applications, where new transactions are constantly inserted into databases. To build an efficient storage structure for mining association rules, this study proposes a method for building the initial frequent closed itemset lattice from the original database. The lattice is updated when new transactions are inserted. The number of database rescans over the entire database is reduced in the maintenance process. The proposed algorithm is compared with building a lattice in batch mode to demonstrate the effectiveness of the proposed algorithm.     

Double auction mechanisms on Markovian networks

This paper studies the double auction (DA) mechanism in Ma and Li (2011) for a class of exchange economies. We extend their results to more general cases where sellers and buyers each form a complex time non-homogeneous Markovian chain, as specified in Ram et al. (2009), in the communication of their private information. A numerical example is also provided. Both bubbles and crashes are observed in the example, consistent with results of our theorems. Our example and theoretical results provide new evidence that a DA mechanism, widely utilized in real exchange markets, may contribute to the excess volatility identified in Shiller (1981) and LeRoy and Porter (1981).     

Accelerating incremental checkpointing for extreme-scale computing

Concern is beginning to grow in the high-performance computing (HPC) community regarding the reliability of future large-scale systems. Disk-based coordinated checkpoint/restart has been the dominant fault tolerance mechanism in HPC systems for the past 30 years. Checkpoint performance is so fundamental to scalability that nearly all capability applications have custom checkpoint strategies to minimize state and reduce checkpoint time. One well-known optimization to traditional checkpoint/restart is incremental checkpointing, which has a number of known limitations. To address these limitations, we describe libhashckpt, a hybrid incremental checkpointing solution that uses both page protection and hashing on GPUs to determine changes in application data with very low overhead. Using real capability workloads and a model outlining the viability and application efficiency increase of this technique, we show that hash-based incremental checkpointing can have significantly lower overheads and increased efficiency than traditional coordinated checkpointing approaches at the scales expected for future extreme-class systems.     

基于磁带分级存储的文件备份系统设计与实现

随着磁盘价格的不断下降,越来越多的容灾备份系统采用将本地数据经过网络传输到服务器磁盘进行备份,但是大数据时代的来,瞄,导致存储压力越来越大。然而在庞大的数据中,有很大一部分数据活跃率并不高。设计并实现了一种基于磁带分级存储的文件备份与恢复系统,采用索引的方式记录并组织备份文件,实现增量备份;该系统将服务器端拆分为两部分,首先将文件数据备份到服务器磁盘,再根据相关时间保留策略,将活跃率较低的数据归档到脏带中。保证了大数据时代服务器磁盘的高效利用。     

浅谈子程序在数控铣教学中的应用

子程序是数控编程过程中的一种常用功能,灵活使用子程序技术,可以减少编程时的程序量,增强数控机床的功能。本文针对子程序调用技术在数控铣床教学中的几种常用方法进行探讨与研究,希望对同行起一个抛砖引玉的作用。     

Single Point Incremental Forming and the Forming Criteria for AA3003

Single Point Incremental Forming (SPIF) is a modern method of forming sheet metal, where parts can be formed without the use of dedicated dies. The ability of SPIF to form a part is based on various forming parameters. Previous work was not accomplished with the help of design of experiments, thus reducing the number of parameters varied at any time. This paper presents two designs of experiments, which formalise the forming parameters critical in SPIF and the degree to which they affect formability.