Top-Down Heuristics for Multi-Dimensional Partitioning To Satisfy Imprecision Bounds

Abstract

Role-based Access Control (RBAC) agrees to important permissions on objects based on roles in an organization. An RBAC policy configuration is collected of a set of Users (U), a set of Roles (R), and a set of Permissions (P). The access control policies describe selection predicates obtainable to roles at the same time as the privacy obligation is to please the k-anonymity orl-diversity. An additional constraint that wants to be content by the PPM is the imprecision bound for each selection predicate. In our formulation of the aforementioned problem we suggest heuristics for anonymization algorithms and demonstrate empirically that the proposed approach gratify imprecision bounds for additional permissions and has subordinate total imprecision than the present state of the art.

Authors and Affiliations

V Anasuya, Penmetsa V. Krishna Raja, Aruna Rekha Gollapalli

Keywords

Related Articles

Smart Antennas Adaptive Beamforming through Statistical Signal Processing Techniques

The smart antenna improves the performance of wireless communication systems by increasing channel capacity and spectrum efficiency, extending range of coverage, steering multiple beams to track several mobiles. Smar...

Comparison and performance analysis of VLSI adders using 22nm Technology

Speed, power and chip area are the most important goal of the current nano meter technology, so it is very important to design and implement new VLSI circuits. Here we design and compare the various CMOS adders with...

Intuitionistic Fuzzy Sets: New Approach and Applications

This paper presents an extended definition of intuitionistic fuzzy set and some operations on intuitionistic fuzzy sets which will be very useful for solving the real life problems. In fact, the intuitionistic fuzzy...

Low Power 10 PAM Transmitter Using Mixed Signal Design Approach

The mixed signal design approach for 10- level pulse amplitude modulation (10-PAM) transmitter which transmit 4-bit per symbol. The frequency is reduced thereby the power dissipation is greatly reduced. The data rate...

http://www.ijrcct.org/index.php/ojs/article/download/1385/pdf

A performance efficient asynchronous parallel Self Timed Adder(PASTA) is presented in this paper. This adder achieves better performance even without any speedup circuitry/lookahed schem/carry skip unit. Skew problem...

Download PDF file
  • EP ID EP28274
  • DOI -
  • Views 297
  • Downloads 3

How To Cite

V Anasuya, Penmetsa V. Krishna Raja, Aruna Rekha Gollapalli (2015). Top-Down Heuristics for Multi-Dimensional Partitioning To Satisfy Imprecision Bounds. International Journal of Research in Computer and Communication Technology, 4(10), -. https://europub.co.uk/articles/-A-28274