Granular Computing on Binary Relations Analysis of Conflict and Chinese Wall Security Policy
In this paper, a study of the granular computing on binary relations is presented. The result is applied to the analysis of conflict of interests relation(CIR) and the Chinese wall security policy (CWSP).
KeywordsChinese wall security policy binary relation conflict of interests
Unable to display preview. Download preview PDF.
- 1.David D. C. Brewer and Michael J. Nash: “The Chinese Wall Security Policy” IEEE Symposium on Security and Privacy, Oakland, May, 1988, pp. 206–214Google Scholar
- 2.T. Y. Lin, “Chinese Wall Security Policy-An Aggressive Model”, Proceedings of the Fifth Aerospace Computer Security Application Conference, December 4–8, 1989, pp. 286–293.Google Scholar
- 3.T. Y. Lin “Granular Computing on Binary Relations I: Data Mining and Neighborhood Systems.” In: Rough Sets In Knowledge Discovery, A. Skoworn and L. Polkowski (eds), Physica-Verlag, 1998, 107–121Google Scholar
- 4.T. Y. Lin “Chinese Wall Security Model and Conflict Analysis,” the 24th IEEE Computer Society International Computer Software and Applications Conference (Compsac2000) Taipei, Taiwan, Oct 25–27, 2000Google Scholar
- 6.Z. Pawlak, Analysis of Conflicts, Joint Conference of Information Science, Research Triangle Park, North Carolina, March 1–5, 1997, 350–352.Google Scholar
- 7.Polkowski, L., Skowron, A., and Zytkow, J., (1995), Tolerance based rough sets. In: T.Y. Lin and A. Wildberger (eds.), Soft Computing: Rough Sets, Fuzzy Logic Neural Networks, Uncertainty Management, Knowledge Discovery, Simulation Councils, Inc. San Diego CA, 1995, 55–58.Google Scholar
- 8.Lotfi A. Zadeh “Some Reflections on Information Granulation and its Centrality in Granular Computing, Computing with Words, the Computational Theory of Perceptions and Precisiated Natural Language,” In: Data Mining, Rough Sets and Granular Computing, T. Y. Lin, Y. Y. Yao, L. Zadeh (eds), Physica-Verlag, 2002.Google Scholar