See boilerplate information at the bottom.

    Journals

  1. Self-stabilizing gathering of mobile robots under crash or Byzantine faults. X. Défago, M. Potop-Butucaru, P. Raipin-Parvédy. Distrib. Comput., 2019. doi: 10.1007/s00446-019-00359-x online
  2. Tight bound on mobile Byzantine Agreement. F. Bonnet, X. Défago, T.-D. Nguyen, M. Potop-Butucaru. Theor. Comput. Sci. 609:361-373 (2016). doi: 10.1016/j.tcs.2015.10.019
  3. Reliability Prediction for Component-based Software Dealing with Concurrent Propagating Errors. T.-T. Pham, X. Défago, Q.-T. Huynh. Science of Computer Programming 97:426-457 (2015). doi: 10.1016/j.scico.2014.03.016
  4. Reliability Prediction for Component-based Software Systems with Architectural level Fault-tolerance Mechanisms (extended version). T.-T. Pham, F. Bonnet, X. Défago. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications 5(1):4–36 (2014). online
  5. The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. T. Izumi, S. Souissi, Y. Katayama, N. Inuzuka, X. Défago, K. Wada, M. Yamashita. SIAM Journal on Computing 41(1):26-46 (2012). doi: 10.1137/100797916
  6. Fault-tolerant flocking for a group of autonomous mobile robots. Yan Yang, Samia Souissi, X. Défago, Makoto Takizawa. Journal of Systems and Software 84(1):29-36 (2011). doi: 10.1016/j.jss.2010.08.026
  7. The cost of probabilistic agreement in oblivious robot networks. Julien Clement, X. Défago, Maria Gradinariu Potop-Butucaru, Taisuke Izumi, Stéphane Messika. Inf. Process. Lett. 110(11):431-438 (2010). doi: 10.1016/j.ipl.2010.04.006
  8. Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. Samia Souissi, X. Défago, Masafumi Yamashita. ACM Trans. on Autonomous and Adaptive Systems, 2009. doi: 10.1145/1462187.1462196
  9. Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. X. Défago, Samia Souissi. Theor. Comput. Sci. 396(1-3):97-112 (2008). doi: 10.1016/j.tcs.2008.01.050
  10. Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems. Wei Sun, Chen Yu, X. Défago, Yasushi Inoguchi. IEICE Trans. on Information & Systems 91-D(3):796-806 (2008). doi: 10.1093/ietisy/e91-d.3.796
  11. A novel numerical algorithm based on self-tuning controller to support TCP flows. Naixue Xiong, Laurence Tianruo Yang, Yan Yang, X. Défago, Yanxiang He. Mathematics and Computers in Simulation 79(4):1178-1188 (2008). doi: 10.1016/j.matcom.2007.10.001
  12. Collision Prevention Platform for a Dynamic Group of Asynchronous Cooperative Mobile Robots. Rami Yared, X. Défago, Julien Iguchi-Cartigny, Matthias Wiesmann. Journal of Networks 2(4):28-39 (2007). doi: 10.4304/jnw.2.4.28-39
  13. Total order broadcast and multicast algorithms: Taxonomy and survey. X. Défago, A. Schiper, and P. Urbán. ACM Computing Surveys 36(4):372-421 (2004). doi: 10.1145/1041680.1041682
  14. Semi-passive replication and Lazy Consensus. X. Défago and A. Schiper. Journal of Parallel and Distributed Computing 64(12):1380-1398 (2004). doi: 10.1016/j.jpdc.2004.08.006
  15. Comparative performance analysis of ordering strategies in atomic broadcast algorithms. X. Défago, A. Schiper, and P. Urbán. IEICE Trans. on Information and Systems E86-D(12):2698-2709 (2003). online
  16. Neko: A single environment to simulate and prototype distributed algorithms. P. Urbán, X. Défago, and A. Schiper. Journal of Information Science and Engineering 18(6):981-997 (2002). online
  17. Abstractions pour la programmation concurrente dans GARF. B. Garbinato, X. Défago, R. Guerraoui, and K. R. Mazouni. Calculateurs parallèles 6(2):85-98 (1994).
  18. Conferences

  19. Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding. K. Okumura, M. Machida, X. Défago, Y. Tamura. In Proc. 28th Intl. Joint Conf. on Artificial Intelligence (IJCAI), pp. 535-542, Aug. 2019. doi: 10.24963/ijcai.2019/76
  20. Approximate QoS Rule Derivation Based on Root Cause Analysis for Cloud Computing. Satoshi Konno, X. Défago. In 24th IEEE Pacific Rim Intl. Symp. on Dependable Computing (PRDC), pp. 33-42, Dec. 2019. doi: 10.1109/PRDC47002.2019.00020
  21. Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space. Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada. In 33rd Intl. Symp. on Distributed Computing (DISC), pp. 41:1-3, Oct. 2019. doi: 10.4230/LIPIcs.DISC.2019.41
  22. Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights. Takashi Okumura, Koichi Wada, X. Défago. In Proc. 22nd Intl. Conf. on Principles of Distributed Systems (OPODIS), pp. 24:1-16, Dec. 2018. doi: 10.4230/LIPIcs.OPODIS.2018.24
  23. Optimally Gathering Two Robots. Adam Heriban, X. Défago, Sébastien Tixeuil. In Proc. 19th Intl. Conf. on Distributed Computing and Networking (ICDCN), pp. 3:1-10, Jan. 2018. doi: 10.1145/3154273.3154323
  24. Amoeba Exploration: Coordinated Exploration with Distributed Robots. Keisuke Okumura, Yasumasa Tamura, Xavier Défago. In 9th Intl. Conf. on Awareness Science and Technology (iCAST), pp. 191-195, Sep. 2018. doi: 10.1109/ICAwST.2018.8517225
  25. Killing Nodes as a Countermeasure to Virus Expansion. F. Bonnet, Quentin Bramas, X. Défago, Thanh Dang Nguyen. In Proc. 24th Intl. Coll. Structural Information and Communication Complexity (SIROCCO), LNCS 10641, pp. 227-243, Jun. 2017. doi: 10.1007/978-3-319-72050-0_14
  26. Flocking with Oblivious Robots. Davide Canepa, X. Défago, Taisuke Izumi, Maria Potop-Butucaru. In Proc. 18th Intl. Symp. Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS 10083, pp. 94-108, Nov. 2016. doi: 10.1007/978-3-319-49259-9_8
  27. Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures. A.Maurer, S.Tixeuil, X. Défago. In Proc. 34th IEEE Symposium on Reliable Distributed Systems (SRDS), pp. 238-245, Oct. 2015. doi: 10.1109/SRDS.2015.10
  28. Tight Bound on Mobile Byzantine Agreement. F. Bonnet, X. Défago, Thanh Dang Nguyen, Maria Potop-Butucaru. In Proc. 28th Intl. Symp. on Distributed Computing (DISC), LNCS 8784, pp. 76-90, Oct. 2014. doi: 10.1007/978-3-662-45174-8_6
  29. Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments. Gianlorenzo D'Angelo, X. Défago, Nicolas Nisse. In Proc. 2nd Intl. Symp. on Computing and Networking (CANDAR), pp. 50-59, Dec. 2014. doi: 10.1109/CANDAR.2014.95
  30. Mitigating the Spread of a Virus in the Internet. T.D. Nguyen, F. Bonnet, X. Défago. In Proc. SRDS Workshops, 2nd Workshop on Planetary-Scale Distributed Systems (W-PSDS), pp. 14-19, Oct. 2014. doi: 10.1109/SRDSW.2014.26
  31. Discovering and Assessing Fine-grained Metrics in Robot Networks Protocols. F. Bonnet, X. Défago, Franck Petit, Maria Potop-Butucaru, Sébastien Tixeuil. In Proc. SRDS Workshops, Workshop on Self-organization in Swarm of Robots (WSSR), pp. 50-59, Oct. 2014. doi: 10.1109/SRDSW.2014.34
  32. A Taxonomy of Congestion Control Techniques for TCP in Wired and Wireless Networks. Lee Chin Kho, X. Défago, Azman Osman Lim, Yasuo Tan. In IEEE Symp. Wireless Technology & Applications (ISWTA), pp. 147-152, 2013. doi: 10.1109/ISWTA.2013.6688758
  33. Reliability Prediction for Component-Based Software Systems with Architectural-Level Fault Tolerance Mechanisms. Thanh-Trung Pham, X. Défago. In Proc. 8th Intl. Conf. on Availability, Reliability and Security (ARES), pp. 11-20, 2013. doi: 10.1109/ARES.2013.8
  34. Reliability Prediction for Component-based Systems: Incorporating Error Propagation Analysis and Different Execution Models. Thanh-Trung Pham, X. Défago. In Proc. 12th Intl. Conf. on Quality Software (QSIC'12), pp. 106-115, Aug. 2012. doi: 10.1109/QSIC.2012.20
  35. A Fast and Robust Optimistic Total Order Broadcast for Online Video Games. Samuel Bernard, X. Défago, Sébastien Tixeuil. In Proc. 8th Intl. Symp. on Frontiers of Information Systems and Network Applications (FINA), pp. 189–196, Mar. 2012. doi: 10.1109/WAINA.2012.105
  36. Fault-Tolerant Flocking of Mobile Robots with Whole Formation Rotation. Yan Yang, Samia Souissi, X. Défago, Makoto Takizawa. In Proc. 23rd Intl. Conf. on Advanced Information Networking and Applications (AINA), pp. 830-837, 2009. doi: 10.1109/AINA.2009.104
  37. Self-stabilized Flocking of a Group of Mobile Robots under Memory Corruption. Yan Yang, X. Défago, Makoto Takizawa. In Proc. 12th Intl. Conf. on Network-Based Information Systems (NBiS), pp. 532-538, 2009. doi: 10.1109/NBiS.2009.60
  38. Fault-Tolerant Flocking in a k-Bounded Asynchronous System. Samia Souissi, Yan Yang, X. Défago. In Proc. 12th Intl. Conf. Principles of Distributed Systems (OPODIS), pp. 145-163, 2008. doi: 10.1007/978-3-540-92221-6_11
  39. An Energy Efficient Routing Scheme for Mobile Wireless Sensor Networks. L.T.Nguyen, X. Défago, R.Beuran, Y.Shinoda. In Proc. IEEE Intl. Symp. on Wireless Communication Systems. (ISWCS), pp. 568–572, 2008. doi: 10.1109/ISWCS.2008.4726120
  40. Collision prevention using group communication for asynchronous cooperative mobile robots. Rami Yared, X. Défago, Matthias Wiesmann. In Proc. 21st Intl. Conf. on Advanced Information Networking and Applications (AINA), pp. 244-249, 2007. doi: 10.1109/AINA.2007.44
  41. Anonymous Stabilizing Leader Election using a Network Sequencer. Matthias Wiesmann, X. Défago. In Proc. 21st Intl. Conf. on Advanced Information Networking and Applications (AINA), pp. 673-678, 2007. doi: 10.1109/AINA.2007.38
  42. Comparative Analysis of QoS and Memory Usage of Adaptive Failure Detectors. Naixue Xiong, Yan Yang, X. Défago. In Proc. 13th IEEE Pacific Rim Intl. Symp. on Dependable Computing (PRDC), pp. 27-34, 2007. doi: 10.1109/PRDC.2007.60
  43. Robust Self-Deployment for a Swarm of Autonomous Mobile Robots with Limited Visibility Range. Geunho Lee, Nak Young Chong, X. Défago. In Proc. 16th IEEE Intl. Symp. on Robot & Human Interactive Communication (RO-MAN), pp. 925-930, 2007. doi: 10.1109/ROMAN.2007.4415216
  44. Gathering two stateless mobile robots using very inaccurate compasses in finite time. Masafumi Yamashita, Samia Souissi, X. Défago. In Proc. 1st Intl. Conf. on Robot Communication and Coordination (ROBOCOMM), pp. 48:1-4, 2007. doi: 10.4108/icst.robocomm2007.2199
  45. Hybrid Overloading and Stochastic Analysis for Redundant Real-time Multiprocessor Systems. Wei Sun, Yuanyuan Zhang, Chen Yu, X. Défago, Yasushi Inoguchi. In Proc. 26th IEEE Symp. on Reliable Distributed Systems (SRDS), pp. 265-274, 2007. doi: 10.1109/DS-RT.2007.12
  46. Fault-Tolerant and Self-stabilizing Mobile Robots Gathering. X. Défago, Maria Gradinariu, Stéphane Messika, Philippe Raipin Parvédy. In Proc. 20th Intl. Symp. Distributed Computing (DISC), pp. 46-60, 2006. doi: 10.1007/11864219_4
  47. Design and Analysis of a Self-Tuning Proportional and Integral Controller for Active Queue Management Routers to Support TCP Flows. Naixue Xiong, X. Défago, Xiaohua Jia, Yan Yang, Yanxiang He. In Proc. 25th IEEE Intl. Conf. on Computer Communications (INFOCOM), pp. 1-12, 2006. doi: 10.1109/INFOCOM.2006.189
  48. Gathering Asynchronous Mobile Robots with Inaccurate Compasses. Samia Souissi, X. Défago, Masafumi Yamashita. In Proc. 10th Intl. Conf. Principles of Distributed Systems (OPODIS), pp. 333-349, 2006. doi: 10.1007/11945529_24
  49. End-to-end consensus using end-to-end channels. Matthias Wiesmann, X. Défago. In Proc. 12th IEEE Pacific Rim Intl. Symp. on Dependable Computing (PRDC), pp. 341-350, 2006. doi: 10.1109/PRDC.2006.32
  50. An SNMP based failure detection service. Matthias Wiesmann, Péter Urbán, X. Défago. In Proc. 25th IEEE Symp. on Reliable Distributed Systems (SRDS), pp. 365-376, 2006. doi: 10.1109/SRDS.2006.9
  51. Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility. Samia Souissi, X. Défago, Masafumi Yamashita. In Proc. 8th Intl. Symp. Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 484-500, 2006. doi: 10.1007/978-3-540-49823-0_34
  52. Fault-Tolerant Group Membership Protocols Using Physical Robot Messengers. Rami Yared, X. Défago, Takuya Katayama. In Proc. 19th Intl. Conf. on Adv. Inform. Networking and Applications (AINA), pp. 921-926, 2005. doi: 10.1007/11864219_4
  53. Towards a Theory of Self-organization. Emmanuelle Anceaume, X. Défago, Maria Gradinariu, Matthieu Roy. In Proc. 9th Intl. Conf. Principles of Distributed Systems (OPODIS), pp. 191-205, 2005. doi: 10.1007/11795490_16
  54. Definition and specification of accrual failure detectors. X. Défago, P. Urbán, N. Hayashibara, T. Katayama. In Proc. IEEE/IFIP Intl. Conf. on Dependable Systems and Networks (DSN), pp. 206-215, 2005. doi: 10.1109/DSN.2005.37
  55. Fault-tolerant group membership protocols using physical robot messengers. R. Yared, X. Défago, and T. Katayama. In Proc. 19th IEEE Intl. Conf. on Advanced Information Networking and Applications (AINA), Vol. 1, pp. 921-926, 2005. doi: 10.1109/AINA.2005.187
  56. The φ accrual failure detector. N. Hayashibara, X. Défago, R. Yared, and T. Katayama. In Proc. 23rd IEEE Intl. Symp. on Reliable Distributed Systems (SRDS), pp. 66-78, 2004. doi: 10.1109/RELDIS.2004.1353004
  57. Agent-based approach to dynamic meeting scheduling problems. A. Ben Hassine, X. Défago, and T. B. Ho. In Proc. 3rd Intl. Joint Conf. on Autonomous Agents and Multi Agent Systems (AAMAS), pp. 1130-1137, 2004. doi: 10.1109/AAMAS.2004.49
  58. An integrated system for distributed bioinformatics environment on grids. K. Satou, Y. Nakajima, S. Tsuji, X. Défago, and A. Konagaya. In Grid Computing in Life Science: First Intl. Life Science Grid Workshop (LSGRID), LNCS 3370/2005, 2004. doi: 10.1007/978-3-540-32251-1_2
  59. Decomposition of fundamental problems for cooperative autonomous mobile systems. S. Souissi, X. Défago, and T. Katayama. In Proc. 24th IEEE Intl. Conf. on Distributed Computing Systems Workshops (ICDCSW); 2nd Intl. Workshop on Mobile Distributed Computing (MDC), pp. 554-560, 2004. doi: 10.1109/ICDCSW.2004.1284087
  60. Asynchronous peer-to-peer communication for failure resilient distributed genetic algorithms. J. C. Clemente Litrán, X. Défago, and K. Satou. In Proc. 15th IASTED Intl. Conf. on Parallel and Distributed Computing and Systems (PDCS), Vol. II, pp. 769-773, 2003.
  61. Two-ways adaptive failure detection with the φ-failure detector. N. Hayashibara, X. Défago, and T. Katayama. In Proc. Workshop on Adaptive Distributed Systems (WADiS), pp. 22-27, 2003.
  62. On the design of a failure detection service for large scale distributed systems. X. Défago, N. Hayashibara, and T. Katayama. In Proc. Intl. Symp. Towards Peta-Bit Ultra-Networks (PBit), pp. 88-95, 2003.
  63. Group communication based on standard interfaces. M. Wiesmann, X. Défago, and A. Schiper. In Proc. 2nd IEEE Intl. Symp. on Network Computing and Applications (NCA), pp. 140-147, 2003. doi: 10.1109/NCA.2003.1201148
  64. Circle formation for oblivious anonymous mobile robots with no common sense of orientation. X. Défago and A. Konagaya. In Proc. 2nd ACM Annual Workshop on Principles of Mobile Computing (POMC), pp. 97-104, 2002. doi: 10.1145/584490.584509
  65. Broadcasting messages in fault-tolerant distributed systems: the benefit of handling input-triggered and output-triggered suspicions differently. B. Charron-Bost, X. Défago, and A. Schiper. In Proc. 21st IEEE Intl. Symp. on Reliable Distributed Systems (SRDS), pp. 244-249, 2002. doi: 10.1109/RELDIS.2002.1180193
  66. Impact of a failure detector on the performance of Consensus. N. Sergent, X. Défago, and A. Schiper. In Proc. 8th IEEE Pacific Rim Symp. on Dependable Computing (PRDC), pp. 137-145, 2001. doi: 10.1109/PRDC.2001.992690
  67. Chasing the FLP impossibility result in a LAN or how robust can a fault-tolerant server be?. P. Urbán, X. Défago, and A. Schiper. In Proc. 20th IEEE Intl. Symp. on Reliable Distributed Systems (SRDS), pp. 190-193, 2001. doi: 10.1109/RELDIS.2001.970767
  68. Distributed computing on the move: From mobile computing to cooperative robotics and nanorobotics (a position paper). X. Défago. In Proc. 1st ACM Annual Workshop on Principles of Mobile Computing (POMC), pp. 49-55, 2001.
  69. Neko: A single environment to simulate and prototype distributed algorithms. P. Urbán, X. Défago, and A. Schiper. In Proc. 15th IEEE Intl. Conf. on Information Networking (ICOIN), pp. 503-511, 2001. doi: 10.1109/ICOIN.2001.905471
  70. Time vs space in fault-tolerant distributed systems. B. Charron-Bost, X. Défago, and A. Schiper. In Proc. 6th IEEE Intl. Workshop on Object-oriented Real-time Dependable Systems (WORDS), pp. 21-27, 2001. doi: 10.1109/WORDS.2001.945109
  71. Contention-aware metrics for distributed algorithms: Comparison of atomic broadcast algorithms. P. Urbán, X. Défago, and A. Schiper. In Proc. 9th IEEE Intl. Conf. on Computer Communications and Networks (ICCCN), pp. 582-589, 2000. doi: 10.1109/ICCCN.2000.885548
  72. Failure detectors as first class objects. P. Felber, X. Défago, R. Guerraoui, and P. Oser. In Proc. Intl. Symp. on Distributed Objects and Applications (DOA), pp. 132-141, 1999. doi: 10.1109/DOA.1999.794001
  73. Replicating CORBA objects: a marriage between active and passive replication. P. Felber, X. Défago, P. Eugster, and A. Schiper. In Proc. 2nd IFIP Intl. Working Conf. on Distributed Applications and Interoperable Systems (DAIS), pp. 375-387, 1999. doi: 10.1007/978-0-387-35565-8_30
  74. Optimization techniques for replicating CORBA objects. X. Défago, P. Felber, and A. Schiper. In Proc. 4th IEEE Intl Workshop on Object-oriented Real-time Dependable Systems (WORDS), pp. 2-8, 1999. doi: 10.1109/WORDS.1999.806554
  75. Semi-passive replication. X. Défago, A. Schiper, and N. Sergent. In Proc. 17th IEEE Symp. on Reliable Distributed Systems (SRDS), pp. 43-50, 1998. doi: 10.1109/RELDIS.1998.740473
  76. Highly available trading system: Experiments with CORBA. X. Défago, K. R. Mazouni, and A. Schiper. In Middleware'98: IFIP Intl. Conf. on Distributed Systems Platforms and Open Distributed Processing, pp. 91-104, 1998. doi: 10.1007/978-1-4471-1283-9_6
  77. Reliability with CORBA event channels. X. Défago, P Felber, B. Garbinato, and R. Guerraoui. In Proc. 3rd USENIX Conf. on Object-Oriented Technologies and Systems (COOTS), pp. 237-240, 1997.
  78. Objets protégés cryptographiquement. U. G. Wilhelm and X. Défago. In Actes RenPar'9, 1997.
  79. Issues in building a parallel Java virtual machine on Cenju-3/DE. X. Défago and A. Konagaya. In First Cenju Workshop; with High Performance Computing Asia (HPC Asia), pp. 50-59, 1997.
  80. Reliability issues with CORBA event channels. X. Défago. In Proc. 2nd European Research Seminar on Advances in Distributed Systems (ERSADS), pp. 153-158, 1997.
  81. Book chapters

  82. Fault-Tolerant Mobile Robots. X. Défago, Maria Potop-Butucaru, Sébastien Tixeuil. In Distributed Computing by Mobile Entities, LNCS 11340, pp. 234-251, 2019. doi: 10.1007/978-3-030-11072-7_10
  83. Atomic Broadcast. X. Défago. In Encyclopedia of Algorithms, 2nd ed., pp. 155-160, 2016. doi: 10.1007/978-1-4939-2864-4_37
  84. Causal Order, Logical Clocks, State Machine Replication. X. Défago. In Encyclopedia of Algorithms, 2nd ed., pp. 283-286, 2016. doi: 10.1007/978-1-4939-2864-4_65
  85. 「合意問題」. T.Izumi, X. Défago, N.Hayashibara, C.Fetzer. In 電子情報通信学会「知識ベース」, Book6, Vol.7, Chap.2-2, pp. 7–20, 2009. online
  86. Atomic Broadcast. X. Défago. In Encyclopedia of Algorithms, Part 1, 2008. doi: 10.1007/978-0-387-30162-4_37
  87. Causal Order, Logical Clocks, State Machine Replication. X. Défago. In Encyclopedia of Algorithms, Part 3, 2008. doi: 10.1007/978-0-387-30162-4_65

Boilerplate Information

This list of publications is intended to provide rapid dissemination of scientific material for research and education. Please see the necessary disclaimers below. Note also that the electronic version of papers might slightly differ from the published version both in layout and content. If you have questions regarding the content of any of these papers, please feel free to contact me by email.

IEEE Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of the works published in IEEE publications in other works must be obtained from the IEEE.

If you have any questions about this please contact the authors.

ACM Copyright Notice

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.