An improved refutation system for intuitionistic predicate logic

In this paper a refutation calculus for intuitionistic predicate logic is presented where the necessity of duplicating formulas to which rules are applied is analyzed. In line with the semantics of intuitionistic logic in terms of Kripke models a new signF _C beside the SignsT andF is added which reduces the size of the proofs and the involved nondeterminism. The resulting calculus is proved to be correct and complete. An extension of it for Kuroda logic is given.     

基于谓词的无线传感器网络查询优化算法

无线传感器网络(WSNs)是一种能量受限的网络,WSNs采样查询执行中首先要考虑到如何节省能量的问题.针对查询参数复杂、参量变化细微的传感器网络应用背景,提出了一种基于谓词的WSNs查询优化(PQOA-WSNs)算法.从用户输入的谓词查询表达式着手,把查询表达式转换为等价的析取范式,再根据概率学的原理对采样谓词作最优排序,以减少整个查询上传的数据量,从而延长传感器网络生命期.PQOA-WSNs包括了词法与语法分析、表达式转换、概率算法3个子算法模块.对PQOA-WSNs仿真测试显示:采样谓词越多,本算法的优化率也越明显,在2,3,4,5,7个查询谓词的条件下,测试优化率分别为48%,65%,74%,78%和85%左右.     

Optimizing sort order query execution in balanced and nested gridfiles

Disk input/output (I/O) efficient query execution is an important topic with respect to DBMS performance. In this context, we elaborate on the construction of disk access plans for sort order queries in balanced and nested grid files. The key idea is to use the order information contained in the directory of the multiattribute search structure. The presented algorithms are shown to yield a significant decrease in the number of disk I/O operations by appropriate use of the order information. Two algorithms for the construction of appropriate disk access plans are proposed, namely a greedy approach and a heuristic divide-and-conquer approach. Both approaches yield considerable I/O savings compared to straightforward query processing without consideration of any directory order information. The former performs well for small buffer page allocations, i.e., for a small number of buffer pages relative to the number of data buckets processed in the query. The latter is superior to the greedy algorithm with respect to the total number of I/O operations and with respect to the overall maximum of buffer pages needed to achieve the minimal number of disk I/O operations. Both approaches rely on a binary trie as a temporary data structure. This trie is used as an explicit representation of the order information. The storage consumption of the temporary data structure is shown to be negligible in realistic cases, Even for pathological cases with respect to degenerated balanced and nested grid files, reasonable upper bounds can be given     

An efficient video summarization for surveillance system using normalized k-means and quick sort method

There has been a vast augmentation in quantity of Video Content (VC) generated amid the last some years. The Video Summarization (VS) approach is introduced for managing the VC. Prevailing VS techniques have endeavored to render the VS but the systems have Execution Time (ET) as well as condensing the video's content in domain specific manner. To triumph over such disadvantages, this paper proposed efficient VS for surveillance system using normalized k-means along with quick sort method. The proposed technique comprises eight stages, like split video into frames, pre-sampling, provide ID number, feature extraction, Feature Selection (FS), clustering, extract frames, video summary. Initially, the video frames are pre-sampled utilizing the proposed Three Step Cross Searching Algorithm (TSCS) technique. Then, give the ID number for every frame. Next, the features are extracted as of the frames. Then, the necessary features are selected using Entropy based Spider Monkey Algorithms (ESMA). In next stage, the features are grouped using Normalized K-Means (N-Kmeans) algorithm for identifying best candidate frames. Then select the minimum distance value based cluster set is the Key Frame (KF) selection. At last, the video is orderly summarized using quick sort method. Finally, in experimental evaluation the proposed work is compared with the prevailing methods. The proposed VS gave better outcome than the existing approaches.     

An image retrieval system with automatic query modification

Most interactive "query-by-example" based image retrieval systems utilize relevance feedback from the user for bridging the gap between the user's implied concept and the low-level image representation in the database. However, traditional relevance feedback usage in the context of content-based image retrieval (CBIR) may not be very efficient due to a significant overhead in database search and image download time in client-server environments. In this paper, we propose a CBIR system that efficiently addresses the inherent subjectivity in user perception during a retrieval session by employing a novel idea of intra-query modification and learning. The proposed system generates an object-level view of the query image using a new color segmentation technique. Color, shape and spatial features of individual segments are used for image representation and retrieval. The proposed system automatically generates a set of modifications by manipulating the features of the query segment(s). An initial estimate of user perception is learned from the user feedback provided on the set of modified images. This largely improves the precision in the first database search itself and alleviates the overheads of database search and image download. Precision-to-recall ratio is improved in further iterations through a new relevance feedback technique that utilizes both positive as well as negative examples. Extensive experiments have been conducted to demonstrate the feasibility and advantages of the proposed system.     

An Efficient Multiple Predicate Learner

In this paper,we examine the issue of learning multiple predicates from given training examples.A proposed MPL-CORE algorithm efficiently induces Horm clauses from examples and background knowledge by employing a single predicate learning module CORE.A fast failure mechanism is also proposed which contributes learning efficiency and learnability to the algorithm.MPL-CORE employs background knowledge that can be represented in intensional(Horn clauses)or extensional (ground atoms)orms during its learning process.With the fast failure mechanism,MPL-CORE outperforms precious multiple predicate learning systems in both the computational complexity and learnability.     

一种改进的堆排序算法

对传统堆排序算法进行分析并做出改进。利用堆的性质降低堆排序过程中的数据比较次数,从而在不提高空间复杂度的前提下改进了堆排序算法的效率。通过理论分析得到改进算法在堆重建过程中的数据比较次数是传统堆排序算法的一半,即改进算法的时间复杂度的主项系数是传统算法的1/2。同时,实验结果表明,改进算法的效率比传统算法提高了20%左右。     

基因调控信息集成数据库及查询

随着基因组研究的深入和生物信息学的发展,对基因调控信息的分析和应用引起人们越来越多的重视。客观要求我们建立起一套能够广泛搜集信息并实现信息共享,同时利用分析工具对基因调控信息进行分析的研究机制,进而能从现有信息中进一步获得更深层次的基因知识。GRI是一套建立在后台Oracle关系型数据库及前台Web技术的基础上、以基因调控信息为主的集成数据库系统,它具有搜集各类基因调控信息、进行数据动态更新、为用户提供信息查询的功能,同时具有基因调控信息分析和数据挖掘等功能。     

Polaris: a system for query, analysis, and visualization ofmultidimensional relational databases

In the last several years, large multidimensional databases have become common in a variety of applications, such as data warehousing and scientific computing. Analysis and exploration tasks place significant demands on the interfaces to these databases. Because of the size of the data sets, dense graphical representations are more effective for exploration than spreadsheets and charts. Furthermore, because of the exploratory nature of the analysis, it must be possible for the analysts to change visualizations rapidly as they pursue a cycle involving first hypothesis and then experimentation. In this paper, we present Polaris, an interface for exploring large multidimensional databases that extends the well-known pivot table interface. The novel features of Polaris include an interface for constructing visual specifications of table-based graphical displays and the ability to generate a precise set of relational queries from the visual specifications. The visual specifications can be rapidly and incrementally developed, giving the analyst visual feedback as he constructs complex queries and visualizations     

数据集成系统中的动态查询处理

为实现数据集成查询我们会用到查询优化器,而传统的查询优化器生成的执行计划会由于以下几个原因产生不良的结果：成本估计不正确,运行时可用的内存不足和数据传输率无法预测,所有这些问题都要求助于动态策略来修正静态的查询执行计划。介绍了一个动态的查询处理框架和这个框架用到的动态策略。     

基于Web的工程物性数据库查询系统

物性数据库是进行化工计算的基础,网络工程物性数据库一方面给用户提供了一种方便快捷的查询途径,另一方面也给化工网络仿真协作实验提供了后台数据。根据三层B/S结构,采用Java语言和Access数据库系统,设计了基于Web的工程物性数据库查询系统的实现框架、具体的体系结构及技术方案,实现了常见的化学物质的26种工程物性的查询。用户可以通过网络查询各种物质的物性数据,化工网络仿真实验也能通过这一网络数据库实时的读取数据。     

An intelligent query processing for distributed ontologies

In this paper, we propose an intelligent distributed query processing method considering the characteristics of a distributed ontology environment. We suggest more general models of the distributed ontology query and the semantic mapping among distributed ontologies compared with the previous works. Our approach rewrites a distributed ontology query into multiple distributed ontology queries using the semantic mapping, and we can obtain the integrated answer through the execution of these queries. Furthermore, we propose a distributed ontology query processing algorithm with several query optimization techniques: pruning rules to remove unnecessary queries, a cost model considering site load balancing and caching, and a heuristic strategy for scheduling plans to be executed at a local site. Finally, experimental results show that our optimization techniques are effective to reduce the response time.     

An XML query engine for network-bound data

XML has become the lingua franca for data exchange and integration across administrative and enterprise boundaries. Nearly all data providers are adding XML import or export capabilities, and standard XML Schemas and DTDs are being promoted for all types of data sharing. The ubiquity of XML has removed one of the major obstacles to integrating data from widely disparate sources - namely, the heterogeneity of data formats. However, general-purpose integration of data across the wide are a also requires a query processor that can query data sources on demand, receive streamed XML data from them, and combine and restructure the data into new XML output - while providing good performance for both batch-oriented and ad hoc, interactive queries. This is the goal of the Tukwila data integration system, the first system that focuses on network-bound, dynamic XML data sources. In contrast to previous approaches, which must read, parse, and often store entire XML objects before querying them, Tukwila can return query results even as the data is streaming into the system. Tukwila is built with a new system architecture that extends adaptive query processing and relational-engine techniques into the XML realm, as facilitated by a pair of operators that incrementally evaluate a query's input path expressions as data is read. In this paper, we describe the Tukwila architecture and its novel aspects, and we experimentally demonstrate that Tukwila provides better overall query performance and faster initial answers than existing systems, and has excellent scalability.     

基于Web的工程物性数据库查询系统

物性数据库是进行化工计算的基础，网络工程物性数据库一方面给用户提供了一种方便快捷的查询途径，另一方面也给化工网络仿真协作实验提供了后台数据。根据三层B/S结构，采用Java语言和Access数据库系统，设计了基于Web的工程物性数据库查询系统的实现框架、具体的体系结构及技术方案，实现了常见的化学物质的26种工程物性的查询。用户可以通过网络查询各种物质的物性数据，化工网络仿真实验也能通过这一网络数据库实时的读取数据。     

Deductive sort and climbing sort: new methods for non-dominated sorting

In recent years an increasing number of real-world many-dimensional optimisation problems have been identified across the spectrum of research fields. Many popular evolutionary algorithms use non-dominance as a measure for selecting solutions for future generations. The process of sorting populations into non-dominated fronts is usually the controlling order of computational complexity and can be expensive for large populations or for a high number of objectives. This paper presents two novel methods for non-dominated sorting: deductive sort and climbing sort. The two new methods are compared to the fast non-dominated sort of NSGA-II and the non-dominated rank sort of the omni-optimizer. The results demonstrate the improved efficiencies of the deductive sort and the reductions in comparisons that can be made when applying inferred dominance relationships defined in this paper.     

Reconfiguring system hierarchies with multi-valued logic

We propose a mathematical formalism to define a system hierarchy and choose a way to reconfigure it based on multi-valued logic. We consider an application of this formalism to control over a group surveying the danger zone after a natural disaster.     

RELOOP, an algebra based query language for an object-oriented database system

In most object-oriented databases, as opposed to value-oriented databases, data are accessed by a programming language instead of a declarative query language. End users do not have a simple tool to perform their queries. This paper is concerned with the definition of an SQL-like query language on top of the O₂ object-oriented database system. We study the influence of the object-oriented paradigm on a query language, describe our language through examples, define its semantics by means of an algebra and sketch the compilation of RELOOP in one of the languages supported by the O₂ system.     

A high-performance,ad hoc,fuzzy query processing system

Database queries involving imprecise or fuzzy predicates are currently an evolving area of academic and industrial research (Buckles and Perty 1987; Bosc et al. 1988; Bosc and Pivert 1991; Kacprzyk et al. 1989; Prade and Testemale, 1987; Tahani, 1977; Umano, 1983; Zemankova and Kandel, 1985). Such queries place severe stress on the indexing and I/O subsystems of conventional database systems since they frequently involve the search of large numbers of records. The Datacycle (Datacycle is a trademark of Bellcore.) architecture and research prototype is a database processing system that uses filtering technology to perform an efficient, exhaustive search of an entire database. It has been modified to include fuzzy predicates in its query processing. The approach obviates the need for complex index structures, provides high-performance query throughput, permits the use of ad hoc fuzzy membership functions and provides deterministic response time largely independent of query complexity and load. This paper describes the Datacycle prototype implementation of fuzzy queries and some recent performance results.     

一个基于模式的快速查询构建系统

介绍了如何设计和实现一个基于模式的J2EE快速查询生成系统。系统主要有两种角色的使用人员,设计人员与用户。系统让设计人员定义面向用户的数据库信息,包括表、表的字段及其显示风格;系统允许用户从已设计好的界面模式中选择自己喜欢的界面风格,在用户定制完自己的查询内容后,系统采用广度优先搜索来判断查询的合理性,并用最短路径算法优化查询。系统极大地简化了基于Web的查询系统的开发和维护。