面向最终用户的可定制数据统计服务

在传统企业应用中,开发人员要根据不同的业务需求开发对应的数据统计模块,这样的"预定义"数据统计方法很难满足不同用户对统计数据的个性化需求.为了简化数据统计模块的开发流程,同时满足不同用户的数据需求,提出了面向最终用户的可定制数据统计服务解决方案.本文着重介绍了面向用户的元数据模型和统计模型的表示方法,以及基于动态构建SQL的即席查询方法,并设计和实现了一套支持企业应用的数据统计服务.     

Query Processing in a Fragmented Relational Distributed System: Mermaid

This paper describes the query optimizer of the Mermaid system which provides a user with a unified view of multiple preexisting databases which may be stored under different DBMS's. The algorithm is designed for databases which may contain replicated or fragmented relations and for users who are primarily making interactive, ad hoc queries. Although the implementation of the algorithm is a front-end system, not an integrated distributed DBMS, it should be applicable to a distributed DBMS also.     

面向查询意图的搜索引擎设计与实现

搜索引擎存在很多问题，原因在于引擎不能准确地理解用户的查询意图。提出面向查询意图的搜索系统，该系统允许用户采用自然语言输入查询要求，然后系统展开语义联想，理解出用户的真实意图，并提交用户确认或修改，进而根据确认的真实意图构造查询实例，提交到各个Web搜索引擎搜索，并将返回结果根据用户意排序。同时系统还从用户对查询结果的交互中学习理解用户意图的知识。     

OLAP系统基于查询结构的用户浏览引导

联机分析处理（OLAP）系统是数据仓库主要的前端支持工具,在OLAP系统中用户以浏览的方式进行数据访问。通常,OLAP系统用户一般会有相对稳定的信息需求,而OLAP系统中查询的结构一定程度上反映了用户所关心的信息内容,因此,用户执行查询的结构也会保持一定的稳定性。以查询结构为基础,对OLAP系统用户的查询行为进行了分析,提出了一种建立OLAP系统用户轮廓文件的方法,并对如何根据轮廓文件对用户的行为进行预测,并进一步对用户的浏览进行引导的方法进行了探讨。以此为基础,当OLAP系统用户进行信息浏览时,可以在OLAP系统前端,对用户可能感兴趣的地方做出一定的标识,引导用户将要进行的浏览动作,使用户能轻松的完成信息搜索的工作。     

User-private information retrieval based on a peer-to-peer community

Private information retrieval (PIR) is normally modeled as a game between two players: a user and a database. The user wants to retrieve some item from the database without the latter learning which item is retrieved. Most current PIR protocols are ill-suited to provide PIR from a search engine or large database: (i) their computational complexity is linear in the size of the database; (ii) they assume active cooperation by the database server in the PIR protocol. If the database cannot be assumed to cooperate, a peer-to-peer (P2P) user community is a natural alternative to achieve some query anonymity: a user gets her queries submitted on her behalf by other users in the P2P community. In this way, the database still learns which item is being retrieved, but it cannot obtain the real query histories of users, which become diffused among the peer users. We name this relaxation of PIR user-private information retrieval (UPIR). A peer-to-peer UPIR system is described in this paper which relies on an underlying combinatorial structure to reduce the required key material and increase availability. Extensive simulation results are reported and a distributed key management version of the system is described.     

A Statistical Metadata Model for Simultaneous Manipulation of both Data and Metadata

There is a growing demand for more cost-efficient production processes in Statistical Institutes. One way to address this need is to equip Statistical Information Systems (SIS) with the ability to automatically produce statistical data and metadata of high quality and deliver them to the user via the Internet. Current approaches, although provide for the storage of appropriate metadata, do not use process metadata for guiding the production process. In this paper we present an approach on creating SISs that permits metadata-guided statistical processing based on an object-based, statistical metadata model. The model is not domain specific and can accommodate both microdata and macrodata. We have equipped the model with a set of transformations that can be used to automatically manipulate data and metadata. We show the applicability of transformations with some examples using actual statistical data for R&D expenditures. Finally, we demonstrate how the presented framework can be exploited for the construction of a web site that offers ad hoc query capabilities to the users of statistical data.     

元数据驱动的个性化查询工具设计与实现

传统查询定制工具只关注动态组合SQL语句,并没有关注与业务相关的实体,如用户、专业等。用户无法定制个性化的查询,企业不能对数据按专业、查询对象和用户等组织多维度、多专业的数据查询。为解决上述问题,提出了一个元数据驱动的个性化查询定制框架,用元数据描述用户需求和企业环境。用户通过个性定制工具,形成用户需求的元数据描述,查询引擎通过元数据读取用户需求,然后查询专业数据库并形成个性化界面。既有通用查询的通用数据接口,又有友好、个性化的用户接口,在油田企业信息集成中得到应用,并取得良好应用效果。     

An efficient resource allocation for maximizing benefit of users and resource providers in ad hoc grid environment

Ad hoc grids allow a group of individuals to accomplish a mission that involves computation and communication among the grid components, often without fixed structure. In an ad hoc grid, every node in the network can spontaneously arise as a resource consumer or a resource producer at any time when it needs a resource or it possesses an idle resource. At the same time, the node in ad hoc grid is often energy constrained. The paper proposes an efficient resource allocation scheme for grid computing marketplace where ad hoc grid users can buy usage of memory and CPU from grid resource providers. The ad hoc grid user agents purpose to obtain the optimized quality of service to accomplish their tasks on time with a given budget, and the goal of grid resource providers as profit-maximization. Combining perspectives of both ad hoc grid users and resource providers, the paper present ad hoc grid resource allocation algorithm to maximize the global utility of the ad hoc grid system which are beneficial for both grid users and grid resource providers. Simulations are conducted to compare the performance of the algorithms with related work.     

RETENTION: A reactive trust-based mechanism to detect and punish malicious nodes in ad hoc grid environments

In ad hoc grid environments, resources are not always available since nodes can spontaneously connect and disconnect at any time. Thus, these environments demand the correct execution of tasks to guarantee good performance. However, there are malicious users that affect the normal operation of these grids. These users modify tasks results and even cheat security mechanisms. Therefore, to assure high performance in these grid computing scenarios, it is essential to use punishment procedures based on trust models. These solutions have been used in wireless ad hoc networks, but not in the context of ad hoc grid computing. Thus, in this paper, we first present an analysis of mathematical trust models in ad hoc grid scenarios, using different ways to treat detection information passed on by other nodes. Then, we provide a comparison and a performance evaluation of these models using a grid simulator platform. Besides that, we choose the most accurate trust model among the evaluated ones to propose RETENTION: a reactive trust-based mechanism to detect and punish malicious nodes in ad hoc grid environments. Simulation results demonstrate the effectiveness of the proposed approach in detecting and punishing up to 100% of malicious nodes without generating false-positives. The results can be a valuable tool for network designers in planning trust models in ad hoc grid network deployments.     

Fuzzy User Modeling for Information Retrieval on the World Wide Web

Information retrieval from the World Wide Web through the use of search engines is known to be unable to capture effectively the information needs of users. The approach taken in this paper is to add intelligence to information retrieval from the World Wide Web, by the modeling of users to improve the interaction between the user and information retrieval systems. In other words, to improve the performance of the user in retrieving information from the information source. To effect such an improvement, it is necessary that any retrieval system should somehow make inferences concerning the information the user might want. The system then can aid the user, for instance by giving suggestions or by adapting any query based on predictions furnished by the model. So, by a combination of user modeling and fuzzy logic a prototype system has been developed (the Fuzzy Modeling Query Assistant (FMQA)) which modifies a user's query based on a fuzzy user model. The FMQA was tested via a user study which clearly indicated that, for the limited domain chosen, the modified queries are better than those that are left unmodified. Received 10 November 1998 / Revised 14 June 2000 / Accepted in revised form 25 September 2000     

Enterprise Information Access and the User Experience

Today, digitally stored information isn't only ubiquitous, it's also increasing in volume at an exponential rate. And not only is the volume increasing, but so is the variety, as well as the ways of combining information from different sources to derive insights. Not surprisingly, our most pressing technological and business problem is finding what we need in this sea of information. The dominant paradigm for addressing this problem is information retrieval (Modem Information Retrieval, Ricardo Baeza-Yates and Berthier Ribeiro-Neto, ACM Press, 1999). In this paradigm, the user enters a query (typically a few words typed into a search box), and the system retrieves documents matching the query, ranking the matches based on an estimate of their relevancy to the query. If the system finds many matches, the user sees only the highest-ranked matches. The popularity of Web search systems such as Google shows that the information retrieval paradigm can be effective. An information access framework empowers users by explicitly focusing on the interaction between users and the system. The key problem for information access systems isn't guessing which matching document is most relevant, but establishing a dialogue in which users progressively communicate their information goals while the system provides immediate, incremental feedback that guides users in the pursuit of those goals     

A Knowledge-Based Approach to Effective Document Retrieval

This paper presents a knowledge-based approach to effective document retrieval. This approach is based on a dual document model that consists of a document type hierarchy and a folder organization. A predicate-based document query language is proposed to enable users to precisely and accurately specify the search criteria and their knowledge about the documents to be retrieved. A guided search tool is developed as an intelligent natural language oriented user interface to assist users formulating queries. Supported by an intelligent question generator, an inference engine, a question base, and a predicate-based query composer, the guided search collects the most important information known to the user to retrieve the documents that satisfy users' particular interests. A knowledge-based query processing and search engine is devised as the core component in this approach. Algorithms are developed for the search engine to effectively and efficiently retrieve the documents that match the query.     

Protection of Database Security via Collaborative Inference Detection

Malicious users can exploit the correlation among data to infer sensitive information from a series of seemingly innocuous data accesses. Thus, we develop an inference violation detection system to protect sensitive data content. Based on data dependency, database schema and semantic knowledge, we constructed a semantic inference model (SIM) that represents the possible inference channels from any attribute to the pre-assigned sensitive attributes. The SIM is then instantiated to a semantic inference graph (SIG) for query-time inference violation detection. For a single user case, when a user poses a query, the detection system will examine his/her past query log and calculate the probability of inferring sensitive information. The query request will be denied if the inference probability exceeds the prespecified threshold. For multi-user cases, the users may share their query answers to increase the inference probability. Therefore, we develop a model to evaluate collaborative inference based on the query sequences of collaborators and their task-sensitive collaboration levels. Experimental studies reveal that information authoritativeness, communication fidelity and honesty in collaboration are three key factors that affect the level of achievable collaboration. An example is given to illustrate the use of the proposed technique to prevent multiple collaborative users from deriving sensitive information via inference.     

A knowledge infrastructure for intelligent query answering in location-based services

Intelligent query answering in Location-based Services refers to their capability to provide mobile users with personalized and contextualized answers. Personalization is expected to lead to answers that better match user’s interests, as inferable from the user’s profile. Contextualization aims at not selecting answers that for some reason would not be appropriate at the time and place of the user query. These goals are beyond the current state of art in LBS, or are provided based on ad hoc solutions specific to the application at hand. This paper reports on the results of an investigation aiming at defining the knowledge infrastructure that should be developed within the LBS to make it capable of returning intelligent answers. We first discuss the data management features that make LBS different from other query answering systems. Next we propose a data infrastructure that builds on the idea of modular ontologies. We explain how the relevant knowledge may be incrementally set up and dynamically maintained based on an application-independent approach. Last we show how this knowledge is used to reformulate user’s queries via personalized and contextualized rewriting.     

Distributed cooperative spectrum sensing in cognitive radio for ad hoc networks

Cognitive radio refers to an intelligent radio with the capability of sensing the radio environment and dynamically reconfiguring the operating parameters. Recent research has focused on using cognitive radios in ad hoc environments. Spectrum sensing is the most important aspect of successful cognitive radio ad hoc network deployment to overcome spectrum scarcity. Multiple cognitive radio users can cooperate to sense the primary user and improve sensing performance. Cognitive radio ad hoc networks are dynamic in nature and have no central point for data fusion. In this paper, gradient-based fully distributed cooperative spectrum sensing in cognitive radio is proposed for ad hoc networks. The licensed band used for TV transmission is considered the primary user. The gradient field changes with the energy sensed by cognitive radios, and the gradient is calculated based on the components, which include energy sensed by secondary users and received from neighbors. The proposed scheme was evaluated from the perspective of reliable sensing, convergence time, and energy consumption. Simulation results demonstrated the effectiveness of the proposed scheme.     

Distributed power control in cooperative cognitive ad hoc networks

In this paper, a relay selection strategy and distributed power control algorithm are proposed for the underlay spectrum sharing mode based cooperative cognitive ad hoc network with energy-limited users. The study aims to minimize the total power consumption of cooperative cognitive ad hoc network while ensuring the quality of service (QoS) requirement of cognitive user and keeping the interference to primary user below interference tolerance. The power control problem is transformed into a convex optimization problem. Based on Lagrange dual decomposition theory, a gradient iterative algorithm is constructed to search for the optimal solution and complete distributed power optimization. Simulation results show that the algorithm converges fast and reduces transmit power of cognitive users effectively while guaranteeing the QoS requirement.     

Querying through a user interface

In contrast to a traditional setting where users express queries against the database schema, we assert that the semantics of data can often be understood by viewing the data in the context of the user interface (UI) of the software tool used to enter the data. That is, we believe that users will understand the data in a database by seeing the labels, drop-down menus, tool tips, or other help text that are built into the user interface. Our goal is to allow domain experts with little technical skill to understand and query data. In this paper, we present our GUi As View (Guava) framework and describe how we use forms-based UIs to generate a conceptual model that represents the information in the user interface. We then describe how we generate a query interface from the conceptual model. We characterize the resulting query language using a subset of the relational algebra. Since most application developers want to craft a physical database to meet desired performance needs, we present here a transformation channel that can be configured by instantiating one or more of our transformation operators. The channel, once configured, automatically transforms queries from our query interface into queries that address the underlying physical database and delivers query results that conform to our query interface. In this paper, we define and formalize our database transformation operators. The contributions of this paper are that first, we demonstrate the feasibility of creating a query interface based directly on the user interface and second, we introduce a general purpose database transformation channel that will likely shorten the application development process and increase the quality of the software by automatically generating software artifacts that are often made manually and are prone to errors.     

Querying through a user interface

In contrast to a traditional setting where users express queries against the database schema, we assert that the semantics of data can often be understood by viewing the data in the context of the user interface (UI) of the software tool used to enter the data. That is, we believe that users will understand the data in a database by seeing the labels, drop-down menus, tool tips, or other help text that are built into the user interface. Our goal is to allow domain experts with little technical skill to understand and query data. In this paper, we present our GUi As View (Guava) framework and describe how we use forms-based UIs to generate a conceptual model that represents the information in the user interface. We then describe how we generate a query interface from the conceptual model. We characterize the resulting query language using a subset of the relational algebra. Since most application developers want to craft a physical database to meet desired performance needs, we present here a transformation channel that can be configured by instantiating one or more of our transformation operators. The channel, once configured, automatically transforms queries from our query interface into queries that address the underlying physical database and delivers query results that conform to our query interface. In this paper, we define and formalize our database transformation operators. The contributions of this paper are that first, we demonstrate the feasibility of creating a query interface based directly on the user interface and second, we introduce a general purpose database transformation channel that will likely shorten the application development process and increase the quality of the software by automatically generating software artifacts that are often made manually and are prone to errors.     

车载边缘计算中基于信誉值的计算卸载方法研究*

将移动边缘计算（Mobile edge computing, MEC）引入车载自组网形成车载边缘计算,从而使服务提供商直接利用MEC服务器在网络边缘服务用户,以提升用户体验质量和丰富用户满意度。随后,研究在车载边缘计算环境下车辆用户的计算卸载问题。针对此问题,提出相应的系统模型与使用讨价还价博弈方法以解决MEC服务器如何根据不同的任务要求与车辆信誉值分配自身的计算资源以执行不同的卸载任务。最后,通过实验仿真,验证了方案的有效性和可靠性。算资源以执行不同的卸载任务。最后,通过实验仿真,验证了方案的有效性和可靠性。     

Enhancing Concept-Based Retrieval Based on Minimal Term Sets

There is considerable interest in bridging the terminological gap that exists between the way users prefer to specify their information needs and the way queries are expressed in terms of keywords or text expressions that occur in documents. One of the approaches proposed for bridging this gap is based on technologies for expert systems. The central idea of such an approach was introduced in the context of a system called Rule Based Information Retrieval by Computer (RUBRIC). In RUBRIC, user query topics (or concepts) are captured in a rule base represented by an AND/OR tree. The evaluation of AND/OR tree is essentially based on minimum and maximum weights of query terms for conjunctions and disjunctions, respectively. The time to generate the retrieval output of AND/OR tree for a given query topic is exponential in number of conjunctions in the DNF expression associated with the query topic. In this paper, we propose a new approach for computing the retrieval output. The proposed approach involves preprocessing of the rule base to generate Minimal Term Sets (MTSs) that speed up the retrieval process. The computational complexity of the on-line query evaluation following the preprocessing is polynomial in m. We show that the computation and use of MTSs allows a user to choose query topics that best suit their needs and to use retrieval functions that yield a more refined and controlled retrieval output than is possible with the AND/OR tree when document terms are binary. We incorporate p-Norm model into the process of evaluating MTSs to handle the case where weights of both documents and query terms are non-binary.