A frame-based knowledge representation model and its mapping to nested relations

The first part of this paper introduces the basic constructs of a frame representation model and gives a formal definition for them. Subsequently the nested relational model (NF²) is described as an extension of the classical relational model to support relation-valued attributes. In the second part of this paper both models are compared with each other and a mapping of frame representation structures to NF² structures is specified. The structural similarities between frames and NF² relations are made clear and it is shown that their main difference is due to the type polymorphism introduced by the concept hierarchy of the frame model. This causes type collisions to occur in the strictly typed NF² model when frames are directly mapped to NF² structures. Two solutions to this problem are suggested and compared. The paper concludes with a reformulation of query operations of the frame model in terms of NF² algebra operations.     

EFFECTIVE PARALLELIZATION TECHNIQUES FOR LOOP NESTS WITH NON-UNIFORM DEPENDENCES

The parallelism of loop nests with non-uniform dependences is difficult to extract and ineffectively explored by the existing parallelization schemes. In this paper, we propose new efficient techniques in extracting parallelism of loop nests with non-uniform dependences using their irregularity. By this way, current highly parallel multiprocessor systems such as multithreaded and clustering multiprocessor systems can be fully utilized. These four mechanisms are (a) parallelization part splitting, (b) partial parallelization decomposition, (c) irregular loop interchange and (d) growing pattern detection. They explore parallelisms of special parallel patterns for nested loops with non-uniform dependences. The loop transformations used in uniform loops are also applied in non-uniform dependence loops after legality tests. We apply the results of classical convex theory and detect special parallel patterns of dependence vectors. We also proposed an algorithm that combines above mechanisms to enhance parallelism. We demonstrate that our technique gives much better speedup and extracts more parallelism than the existing techniques. Thus, we are encouraged by these apparent enhancements to pursue further development.     

Saturation-based switching anti-windup design for linear systems with nested input saturation

This paper proposes a saturation-based switching anti-windup design for the enlargement of the domain of attraction of a linear system subject to nested saturation. A nestedly saturated linear feedback is expressed as a linear combination of a set of auxiliary linear feedbacks, which form a convex hull where the nestedly saturated linear feedback resides. This set of auxiliary linear feedbacks is then partitioned into several subsets. The auxiliary linear feedbacks in each of these subsets form a convex sub-hull of the original convex hull. When the value of the nestedly saturated linear feedback falls into a convex sub-hull, it can be expressed as a linear combination of the subset of all the auxiliary feedbacks that form the convex sub-hull. A separate anti-windup gain is designed for each convex sub-hull by using a common quadratic Lyapunov function and is implemented when the value of the nestedly saturated linear feedback falls into this convex sub-hull. Simulation results indicate that such a saturation-based switching anti-windup design has the ability to significantly enlarge the domain of attraction of the closed-loop system.     

谈在.NET平台中DataList控件嵌套的应用

介绍在.NET平台下利用DataList控件的嵌套和绑定数据技术,处理主从关系数据和多列数据等多级关联数据的显示方法和技巧,为网站开发和教学提供一定实用技术支持和帮助。     

基于嵌套网的JADE建模

良好的形式化建模方法是大规模开发和应用多Agent系统(MAS)的必要条件之一,使用多层的嵌套网对JADE进行层次化建模,给出面向对象的MAS与NP-nets之间的对照关系。指出通过引入层次结构,不仅能有效地控制状态空间的规模,而且能通过网托肯的嵌套方式克服Petri网结构演化的困难。     

Adaptive locks: Combining transactions and locks for efficient concurrency

Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming model and maximizes concurrency. At the same time, transactions can suffer from interference that causes them to often abort, from heavy overheads for memory accesses, and from expressiveness limitations (e.g., for I/O operations). In this paper we propose an adaptive locking technique that dynamically observes whether a critical section would be best executed transactionally or while holding a mutex lock. The critical new elements of our approach include the adaptivity logic and cost–benefit analysis, a low-overhead implementation of statistics collection and adaptive locking in a full C compiler, and an exposition of the effects on the programming model. In experiments with both micro and macrobenchmarks we found adaptive locks to consistently match or outperform the better of the two component mechanisms (mutexes or transactions). Compared to either mechanism alone, adaptive locks often provide 3-to-10x speedups. Additionally, adaptive locks simplify the programming model by reducing the need for fine-grained locking: with adaptive locks, the programmer can specify coarse-grained locking annotations and often achieve fine-grained locking performance due to the transactional memory mechanisms.     

nSPARQL: A navigational language for RDF

Navigational features have been largely recognized as fundamental for graph database query languages. This fact has motivated several authors to propose RDF query languages with navigational capabilities. In this paper, we propose the query language nSPARQL that uses nested regular expressions to navigate RDF data. We study some of the fundamental properties of nSPARQL and nested regular expressions concerning expressiveness and complexity of evaluation. Regarding expressiveness, we show that nSPARQL is expressive enough to answer queries considering the semantics of the RDFS vocabulary by directly traversing the input graph. We also show that nesting is necessary in nSPARQL to obtain this last result, and we study the expressiveness of the combination of nested regular expressions and SPARQL operators. Regarding complexity of evaluation, we prove that given an RDF graph G and a nested regular expression E, this problem can be solved in time O(|G||E|).     

Operational state complexity of nested word automata

We introduce techniques to prove lower bounds for the number of states needed by finite automata operating on nested words. We study the state complexity of Boolean operations and obtain lower bounds that are tight within an additive constant. The results for union and complementation differ from corresponding bounds for ordinary finite automata. For reversal and concatenation, we establish lower bounds that are of a different order than the worst-case bounds for ordinary finite automata.     

分布式仿真多分辨率建模方法及一致性维护

在分布式仿真中,同一实体的多个分辨率模型并发以及不同实体的各个分辫率模型之间的交互会导致数据表现不一致的问题。在分析现有多分辨率建模方法的基础上,提出了适应分布式仿真环境的不同分辨率模型的树状结构建模方法,其主要由聚合级实体模型和平台级实体模型组成。为解决树状结构建模方法中不同分辫率模型的数据表现不一致问题,将不同分辨率模型间的交互看成分布式数据库中的事务,由此提出了一个嵌套两段式提交协议算法来有效解决不同分辨率模型的一致性维护问题。