Providing group anonymity as a minimum cost network flow problem
Journal Title: Vìsnik Nacìonalʹnogo unìversitetu "Lʹvìvsʹka polìtehnìka". Serìâ Ìnformacìjnì sistemi ta merežì - Year 2015, Vol 829, Issue
Abstract
In the paper, it is shown that the task of providing group anonymity can be treated as a generalized minimum cost flow problem, where fuzzy restrictions are imposed on the network architecture. To solve this task, a novel information technology is proposed. Results of applying this technology are illustrated with a real data based example.
Authors and Affiliations
D. Tavrov, O. Chertov
Keywords
Related Articles
- EP ID EP617404
- DOI -
- Views 154
- Downloads 0
Synthesis of integrated automated control systems of enterprise
The basic 4-level structure of IACS of company has been developed. Following principles of its construction have been selected: consistency, variable composition of equipment, modularity, transparency, compatibility, dev...
Features of formation of goals social and social communication components in the projects of the “smart bridge”
The article presents results of the search and analysis of publications, which investigated the influence of the ’human factor’ on the formation of goals in the socio-communicative section of the portfolio of projects ’S...
The statistical method of determination of labial phoneme group styledifferentiating capability in the system of English styles
In the present paper the phonostatistical characteristics of labial phoneme group have been determined by a mathematical statistical method on the material of texts from English functional styles (belles-lettres, colloqu...
Інформаційна технологія управління Web-ресурсом на основі нечіткої логіки
The method of content management as its life cycle stage based on fuzzy logic is proposed. The method of content management describes the commercial Web resources forming and automation technology that simplifies the con...
Definition of the extended Galois field GF(dm) with multiplier minimal hardware complexity
The paper compares realised on modern FPGA Galois fields multipliers hardware costs to select Galois field GF(dm) with approximately the same number of elements and the lowest multiplier hardware complexity. The total in...