首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
李天柱 《软件学报》1995,6(4):232-239
将面向对象模型与面向值的模型相结合,可兼得二者的优点.本文基于具有组合元组标识的NF2关系模型给出了强调嵌套结构特征的关系运算投影IIs和自然连接,并在此基础上研究NF2关系数据模型中的类、子类及其间的属性继承的语义及形式化定义;引入了-子类的概念;研究了公共子类及多属性继承的特征.所有的讨论基于组合元组标识,具有较强的面向对象模型的特征.  相似文献   

2.
IMDBS是一个集成式的多数据库系统,该系统是通过对已有的局部异构数据库进行信息和数据的集成,为全局用户提供共享的集成信息;同时每个局部应用仍能在被集成后的数据上运行,这样就保证了局部数据库的自治性.IMDBS系统主要是基于源标签集成机制,并与非一范式(NF2)模型相结合作为多源数据模型,多源数据语言为PSQL/NF,它是一个类SQL语言,非常方便于用户的使用.该系统具有自下而上集成关系、网状和层次数据库以及自上而下地进行分布数据管理的功能,较好地解决了异构分布库系统的全局分布透明性  相似文献   

3.
This paper explores various aspects of the image decomposition problem using modern variational techniques. We aim at splitting an original image f into two components u and ρ, where u holds the geometrical information and ρ holds the textural information. The focus of this paper is to study different energy terms and functional spaces that suit various types of textures. Our modeling uses the total-variation energy for extracting the structural part and one of four of the following norms for the textural part: L2, G, L1 and a new tunable norm, suggested here for the first time, based on Gabor functions. Apart from the broad perspective and our suggestions when each model should be used, the paper contains three specific novelties: first we show that the correlation graph between u and ρ may serve as an efficient tool to select the splitting parameter, second we propose a new fast algorithm to solve the TVL1 minimization problem, and third we introduce the theory and design tools for the TV-Gabor model. First online version published in February, 2006  相似文献   

4.
Points, lines, and regions are the three basic entities for constituting vector-based objects in spatial databases. Many indexing methods (G-tree, K-D-B tree, Quad-tree, PMR-tree, Grid-file, R-tree, and so on) have been widely discussed for handling point or region data. These traditional methods can efficiently organize point or region objects in a space into a hashing or hierarchical directory. They provide efficient access methods to meet the requirement of accurate retrievals. However, two problems are encountered when their techniques are applied to deal with line segments. The first is that representing line segments by means of point or region objects cannot exactly and properly preserve the spatial information about the proximities of line segments. The second problem is derived from the large dead space and overlapping areas in external and internal nodes of the hierarchical directory caused by the use of rectangles to enclose line objects. In this paper, we propose an indexing structure for line segments based on B + -tree to remedy these two problems. Through the experimental results, we demonstrate that our approach has significant improvement over the storage efficiency. In addition, the retrieval efficiency has also been significantly prompted as compared to the method using R-tree index scheme. These improvements derive mainly from the proposed data processing techniques and the new indexing method.  相似文献   

5.
We consider an Mx/G/1 queueing system with a vacation time under single vacation policy, where the server takes exactly one vacation between two successive busy periods. We derive the steady state queue size distribution at different points in times, as well as the steady state distributions of busy period and unfinished work (backlog) of this model.Scope and purposeThis paper addresses issues of model building of manufacturing systems of job-shop type, where the server takes exactly one vacation after the end of each busy period. This vacation can be utilized as a post processing time after clearing the jobs in the system. To be more realistic, we further assume that the arrivals occur in batches of random size instead of single units and it covers many practical situations. For example in manufacturing systems of job-shop type, each job requires to manufacture more than one unit; in digital communication systems, messages which are transmitted could consist of a random number of packets. These manufacturing systems can be modeled by Mx/G/1 queue with a single vacation policy and this extends the results of Levy and Yechiali, Manage Sci 22 (1975) 202, and Doshi, Queueing Syst 1 (1986) 29.  相似文献   

6.
There are at least two approaches advocated to obtain a pure H reduced-order dynamic controller for a given augmented plant. One approach is to eliminate completely the H2 aspect from a standard H2/H setting. A second approach is to equate the H2 aspect with the H aspect in that same setting. This paper invalidates the first approach but affirms the second approach and produces the correct equations resulting therefrom.  相似文献   

7.
Although widely advocated as a tool for the conceptual modelling of data, the Entity-Relationship (E-R) model [4] and its extensions are generally lacking in constructs to model the dynamic nature of the real world, making them inadequate for designing temporal databases. This research first extends the E-R model to a Temporal Event-Entity-Relationship Model (TEERM), by introducing events as an additional construct. Second, a method is proposed for mapping this conceptual model into a temporal relational model for the logical design of temporal relational databases with a corresponding set of integrity constraints. The model is illustrated with an example and evaluated using a set of criteria proposed by Batini et al. [2]. The model appears to be expressive, simple and easy to use, and should, therefore, aid the temporal database design process significantly.  相似文献   

8.
G 2 interpolation and blending on surfaces   总被引:3,自引:0,他引:3  
We introduce a method for curvature-continuous (G 2) interpolation of an arbitrary sequence of points on a surface (implicit or parametric) with prescribed tangent and geodesic curvature at every point. The method can also be used forG 2 blending of curves on surfaces. The interpolation/blending curve is the intersection curve of the given surface with a functional spline (implicit) surface. For the construction of blending curves, we derive the necessary formulas for the curvature of the surfaces. The intermediate results areG 2 interpolation/blending methods in IR2.  相似文献   

9.
We define four different properties of relational databases which are related tothe notion of homogeneity in classical model theory. The main question for their definition is, for any given database to determine the minimum integer k, such that whenever two k-tuples satisfy the same properties which are expressible in first order logic with up to k variables (FO k ), then there is an automorphism which maps each of these k-tuples onto each other. We study these four properties as a means to increase the computational power of subclasses of the reflective relational machines (RRMs) of bounded variable complexity. These were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu and are known to be incomplete. For this sake we first give a semantic characterization of the subclasses of total RRM with variable complexity k (RRM k ) for every natural number k. This leads to the definition of classes of queries denoted as Q C Q k . We believe these classes to be of interest in their own right. For each k>0, we define the subclass Q C Q k as the total queries in the class C Q of computable queries which preserve realization of properties expressible in FO k . The nature of these classes is implicit in the work of S. Abiteboul, M. Vardi and V. Vianu. We prove Q C Q k =total(RRM k ) for every k>0. We also prove that these classes form a strict hierarchy within a strict subclass of total(C Q). This hierarchy is orthogonal to the usual classification of computable queries in time-space-complexity classes. We prove that the computability power of RRM k machines is much greater when working with classes of databases which are homogeneous, for three of the properties which we define. As to the fourth one, we prove that the computability power of RRM with sublinear variable complexity also increases when working on databases which satisfy that property. The strongest notion, pairwise k-homogeneity, allows RRM k machines to achieve completeness.  相似文献   

10.
In this paper we study theC p regularity of the flow of a nonlinear nonautonomous control system with respect to control maps belonging toL p withpr. The results obtained are applied to get first- and second-order optimality conditions when the control space isL p . The problem which we consider is in the Mayer form and includes endpoint constraints. We present first-order necessary conditions for a wide class of control systems. Moreover, we show that the usual second-order sufficient conditions are effective only if the mapf that defines the control system is a polynomial of degree two in the control variable and the controls belong toL 2.  相似文献   

11.
This paper deals with the l2-problem for time-varying discrete systems. The problem considered is a deterministic counterpart of the well-known LQG problem. An adequate l2-seminorm for linear bounded input-output operators is introduced in order to express the optimality criterion. The solution is obtained by successively reducing the original problem to simpler ones putting in evidence the Separation Principle of the optimal controller.  相似文献   

12.
13.
As the amount of text data grows explosively, an efficient index structure for large text databases becomes ever important. The n-gram inverted index (simply, the n-gram index) has been widely used in information retrieval or in approximate string matching due to its two major advantages: language-neutral and error-tolerant. Nevertheless, the n-gram index also has drawbacks: the size tends to be very large, and the performance of queries tends to be bad. In this paper, we propose the two-level n-gram inverted index (simply, the n-gram/2L index) that significantly reduces the size and improves the query performance by using the relational normalization theory. We first identify that, in the (full-text) n-gram index, there exists redundancy in the position information caused by a non-trivial multivalued dependency. The proposed index eliminates such redundancy by constructing the index in two levels: the front-end index and the back-end index. We formally prove that this two-level construction is identical to the relational normalization process. We call this process structural optimization of the n-gram index. The n-gram/2L index has excellent properties: (1) it significantly reduces the size and improves the performance compared with the n-gram index with these improvements becoming more marked as the database size gets larger; (2) the query processing time increases only very slightly as the query length gets longer. Experimental results using real databases of 1 GB show that the size of the n-gram/2L index is reduced by up to 1.9–2.4 times and, at the same time, the query performance is improved by up to 13.1 times compared with those of the n-gram index. We also compare the n-gram/2L index with Makinen’s compact suffix array (CSA) (Proc. 11th Annual Symposium on Combinatorial Pattern Matching pp. 305–319, 2000) stored in disk. Experimental results show that the n-gram/2L index outperforms the CSA when the query length is short (i.e., less than 15–20), and the CSA is similar to or better than the n-gram/2L index when the query length is long (i.e., more than 15–20).  相似文献   

14.
We study the parallel complexity of a bounded size dictionary version (LRU deletion heuristic) of the LZ2 compression algorithm. The unbounded version was shown to be P-complete. When the size of the dictionary is O(logkn), the problem of computing the LZ2 compression is shown to be hard for the class of problems solvable simultaneously in polynomial time and O(logkn) space (that is, SCk). We also introduce a variation of this heuristic that turns out to be an SCk-complete problem (the original heuristic belongs to SCk+1). In virtue of these results, we argue that there are no practical parallel algorithms for LZ2 compression with LRU deletion heuristic or any other heuristic deleting dictionary elements in a continuous way. For simpler heuristics (SWAP, RESTART, FREEZE), practical parallel algorithms are given.  相似文献   

15.
基于元数据的关系数据库语义集成方法   总被引:2,自引:0,他引:2       下载免费PDF全文
提出一种基于元数据的关系数据库语义集成方法,将关系数据库动态转换成具有丰富语义的虚拟资源描述框架(RDF)视图,使关系数据库中的数据成为语义网上可以被机器理解和处理的“智能数据”。介绍语义集成框架并分析关系数据库与领域本体语义映射的原理和方法,提出语义元数据描述模型。分析语义查询分解与转换的方法,描述原型系统的实现与应用情况。  相似文献   

16.
分析了视频数据的两种数据模型(关系模型、NF^2模型)的特点后,提出了一种面向对象模型。利用该面向对象的数据模型可以建立一个功能较强的视频数据库。  相似文献   

17.
参数曲面上的插值与混合   总被引:10,自引:0,他引:10       下载免费PDF全文
如何表示曲面上的曲线,在处理诸如数控加工中的路径设计以及CAD/CAM等领域频繁出现的曲面裁剪问题时显得日益重要.给出了数据点的切方向(切方向及曲率向量或测地曲率值)指定而G1连续(G2连续)插值曲面上任意点列的方法.作为曲面上曲线插值问题的特例,还讨论了曲面上曲线的混合问题.基本思想是借助于微分几何的有关结论,曲面上曲线的插值问题被转化为其参数平面上类似的曲线插值问题.该方法能够用二维隐式方程来表示曲面上的插值曲线,从而把在显示该曲线时所面对的曲面求交的几何问题转化为计算隐式曲线的代数问题.实验证明该方法是可行的,而且适用于CAD/CAM及计算机图形学等领域.  相似文献   

18.
王进鹏  张亚非  苗壮 《计算机科学》2010,37(12):134-137
为实现异构关系数据库的语义集成,针对传统集成技术存在的问题,在对语义网等相关技术进行分析的基础上,研究基于本体的关系数据集成系统中的查询处理问题,提出了一种基于本体的关系数据库集成框架。设计了基于本体的关系数据的描述方法,使用本体作为集成的全局模式来描述关系模式的语义。设计了查询重写算法,该算法可以将基于全局模式的SPARQL查询重写为针对具体关系数据库的查询,从而实现对异构关系数据库的集成。实验表明,该算法具有良好的可扩展性。  相似文献   

19.
The image template matching problem is one of the fundamental problems of and has many practical applications in image processing, pattern recognition, and computer vision. It is a useful operation for filtering, edge detection, image registration, and object detection [13]. In this paper, we first design twoO[(M2/p2)log logM] andO[(M2/p2)+(M/p)log logp] time parallel image template matching algorithms on a 3-D processor array with a reconfigurable bus system usingp2N2processors with each processor containingO(1) andO(M/p) restricted memory for 1 ≤pMN, respectively, for anN×Ndigital image and anM×Mtemplate. By increasing the number of processors, these two proposed algorithms can be run inO(M2/p2) time for speeding up the time complexity usingp2M1/cN2andp2+1/cN2processors, respectively, wherecis a constant andc≥1. Furthermore, anO(1) time can be also obtained from these two proposed algorithms by usingM2+1/cN2processors. These results improve the best known bounds and achieve both optimal and optimal speed-up in their time and processor complexities.  相似文献   

20.
On the strict logic foundation of fuzzy reasoning   总被引:2,自引:0,他引:2  
This paper focuses on the logic foundation of fuzzy reasoning. At first, a new complete first-order fuzzy predicate calculus system K* corresponding to the formal system L* is built. Based on the many-sort system Kms* corresponding to K*, the triple I methods of FMP and FMT for fuzzy reasoning and their consistency are formalized, thus fuzzy reasoning is put completely and rigorously into the logic framework of fuzzy logic.The author is indebted to anonymous referee for his useful comments which have helped to improve the paper.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号