
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jan C. Bioch, Toshihide Ibaraki, "Generating and Approximating Nondominated Coteries," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 9, pp. 905914, September, 1995.  
BibTex  x  
@article{ 10.1109/71.466629, author = {Jan C. Bioch and Toshihide Ibaraki}, title = {Generating and Approximating Nondominated Coteries}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {9}, issn = {10459219}, year = {1995}, pages = {905914}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.466629}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Generating and Approximating Nondominated Coteries IS  9 SN  10459219 SP905 EP914 EPD  905914 A1  Jan C. Bioch, A1  Toshihide Ibaraki, PY  1995 KW  Almostselfdual functions KW  coteries KW  dualization KW  monotone Boolean functions KW  mutualexclusion KW  nondominated coteries KW  positive Boolean functions KW  selfdual functions. VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
In this paper, we introduce an operator ρ, which transforms a positive selfdual function into another positive selfdual function, and the concept of almostselfduality, which is a close approximation to selfduality and can be checked in polynomial time (the complexity of checking positive selfduality is currently unknown). After proving several interesting properties of them, we propose a simple algorithm to check whether a given positive function is selfdual or not. Although this is not a polynomial algorithm, it is practically efficient in most cases. Finally, we present an incrementally polynomial algorithm that generates all positive selfdual functions (ND coteries) by repeatedly applying ρ operations. Based on this algorithm, all ND coteries of up to seven variables are computed.
[1] D. Agrawal and A. El Abbadi, “An Efficient and FaultTolerant Algorithm for Distributed Mutual Exclusion,” Proc. Eighth Ann. ACM Symp. Principles of Distributed Computing, pp. 193200, 1989.
[2] D. Avis and K. Fukuda,“A pivoting algorithm for convex hulls and vertexenumeration of arrangements and polyhedra,” Discrete and Computational Geometry, vol. 8, pp. 295313, 1992.
[3] D. Avis and K. Fukuda,“Reverse search for enumeration,” Research Report 925, Graduate School of Systems Management,Univ. of Tsukuba, 1992.
[4] D. Barbara and H. GarciaMolina, "The Vulnerability of Vote Assignments," ACM Trans. Computer Systems, vol. 4, pp. 187213, Aug. 1986.
[5] D. Barbara and H. GarciaMolina, "The Reliability of Voting Mechanisms," IEEE Trans. Computers, vol. 36, pp. 1,1971,208, Oct. 1987.
[6] L.J. Billera,“On the composition and decomposition of clutters,” J. Combinatorial Theory, vol. 11, pp. 234245, 1971.
[7] J.C. Bioch,“Decompositions of coteries and Boolean functions,” Tech. Rept., Dept. of Computer Science No. 2, Erasmus Univ., Rotterdam, The Netherlands, Jan. 1993. A revised version also appeared in Proc. of Computing Science in The Netherlands CSN93, pp. 7586, Nov. 1993.
[8] J.C. Bioch and T. Ibaraki,“Decompositions of positive selfdual Boolean functions,” Discrete Math, vol. 140, pp. 2346, 1995.
[9] J.C. Bioch and T. Ibaraki,“Complexity of identification and dualization ofpositive Boolean functions,” Report RRR2593, RUTCOR, Rutgers Univ., July 1993. To appear in Infomation and Computation.
[10] J.C. Bioch and T. Ibaraki,“Generating and approximating ND coteries,” Report RRR4294, RUTCOR, Rutgers Univ., Nov. 1994.
[11] E. Boros,P.L. Hammer,T. Ibaraki,, and K. Kawakami,“Identifying 2monotonic positive Boolean functions in polynomial time,” ISA’91 Algorithms, W.L. Hsu and R.C.T. Lee, eds., Springer Lecture Notes in Computer Science 557, pp. 104115, 1991.
[12] Y. Crama,“Dualization of regular Boolean functions,” Discrete Applied Math., vol. 16, pp. 7985, 1987.
[13] S.B. Davidson,“Replicated data and partition failures,” S. Mullender ed., Distributed Systems, ch.13, AddisonWesley, 1989.
[14] T. Eiter and G. Gottlob,“Identifying the minimal transversals of ahypergraph and related problems,” Tech. Report CDTR 91/16, Christian Doppler Labor für Expertensysteme,Technische Universität Wien, Jan. 1991. To appear in SIAM J. Computing.
[15] H. GarciaMolina and D. Barbara, “How to Assign Votes in a Distributed System,” J. ACM, vol. 32, no. 4, pp. 841860, Oct. 1985.
[16] T. Ibaraki and T. Kameda, "A Theory of Coteries: Mutual Exclusion in Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 779794, July 1993.
[17] T. Ibaraki,H. Nagamochi,, and T. Kameda,“Optimal coteries for rings andrelated networks,” Distributed Computing, vol. 8,. pp. 791201, 1995.
[18] D.S. Johnson,M. Yannakakis,, and C.H. Papadimitriou,“On generating allmaximal independent sets,” Information Processing Letters, vol. 27, pp. 119123, 1988.
[19] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558565, July 1978.
[20] K. Makino and T. Ibaraki,“The maximum latency and identification ofpositive Boolean functions,” ISAAC 1994, Algorithms and Computation, D. Z. Du and X. S. Zhang, eds., Springer Lecture Notes in Computer Science, vol. 834, pp. 324332, Aug. 1994.
[21] S. Muroga,Threshold Logic and Its Applications. WileyInterscience, 1971.
[22] S. Muroga,T. Tsuboi,, and C.R. Bauch,“Enumeration of threshold functionsof eight variables,” IEEE Trans. Computers, vol. 19, no. 9, pp. 818825, 1970.
[23] M.L. Nielsen and M. Mizuno,“Coterie join algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 582590, Sept. 1992.
[24] U.N. Peled and B. Simeone,“Polynomialtime algorithm for regularsetcovering and threshold synthesis,” Discrete Applied Math., vol. 12, pp. 5769, 1985.
[25] D. Peleg and A. Wool,“The availability of quorum systems,” Tech. Report CS9317, The Weizmann Institute of Science, 1993.
[26] K.G. Ramamurthy,Coherent Structures and Simple Games. Kluwer, 1990.
[27] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180209, June 1979.
[28] Z. Tong and R. Kain, "Vote Assignments in Weighted Voting Mechanisms," Proc. Seventh Symp. Reliable Distributed Systems, IEEE, Oct. 1988.
[29] I. Wegener,The Complexity of Boolean Functions. WileyTeubner, 1987.
[30] R.O. Winder,“Enumeration of sevenargument threshold functions,” IEEE Trans. Electronic Computers, vol. 14, no. 3, pp. 315325, 1965.