Factoring and Automated Inference
نویسندگان
چکیده
We extend SQL’s grant/revoke model to handle all administration of permissions in a distributed database. The key idea is to “factor” permissions into simpler decisions that can be administered separately, and for which we can devise sound inference rules. The model enables us to simplify administration via separation of concerns (between technical DBAs and domain experts), and to justify fully automated inference for some permission factors. We show how this approach would coexist with current practices based on SQL permissions.
منابع مشابه
Efficient inference in Bayes networks as a combinatorial optimization problem
A number of exact algorithms have been developed to perform probabilistic inference in Bayesian belief networks in recent years. The techniques used in these algorithms are closely related to network structures and some of them are not easy to understand and implement. In this paper, we consider the problem from the combinatorial optimization point of view and state that e cient probabilistic i...
متن کاملCase-Based Probability Factoring in Bayesian Belief Networks
Bayesian network inference can be formulated as a combinatorial optimization problem, concerning in the computation of an optimal factoring for the distribution represented in the net. Since the determination of an optimal factoring is a computationally hard problem, heuristic greedy strategies able to nd approximations of the optimal factoring are usually adopted. In the present paper we inves...
متن کاملAnalysis of Effect of Pre-Logic Factoring on Cell Based Combinatorial Logic Synthesis
In this paper, an analysis is presented, which demonstrates the effect pre-logic factoring could have on an automated combinational logic synthesis process succeeding it. The impact of pre-logic factoring for some arbitrary combinatorial circuits synthesized within a FPGA based logic design environment has been analyzed previously. This paper explores a similar effect, but with the non-regenera...
متن کاملParallelizing Probabilistic Inference: Some Early Explorations
We report on an experimental investigation into opportunities for parallelism in belief net inference. Specifically, we report on a study performed of the available parallelism, on hypercube style machines, of a set of ran domly generated belief nets, using factoring (SPI) style inference algorithms. Our results indicate that substantial speedup is available, but that it is available only thr...
متن کاملAutomated Detection of Multiple Sclerosis Lesions Using Texture-based Features and a Hybrid Classifier
Background: Multiple Sclerosis (MS) is the most frequent non-traumatic neurological disease capable of causing disability in young adults. Detection of MS lesions with magnetic resonance imaging (MRI) is the most common technique. However, manual interpretation of vast amounts of data is often tedious and error-prone. Furthermore, changes in lesions are often subtle and extremely unrepresentati...
متن کامل