Search

This article focuses on inclusion of new members in the editorial board of the periodical "IEEE Transactions on Computers," and reports on them. These new members include: Jean-Claude Bajard, Todd Brun, Frank Dehne, Michel Dubois, Antonio M. Gonzalez, Cecilia Metra, and Assaf Schuster. Jean-Claude Bajard received the MSc degree and the PhD degree in computer science from the École Normale Supérieure de Lyon and Claude Bernard University of France. He has served on the program committees of the IEEE Symposia on Computer Arithmetic and served as co-program chair for this symposium in 2003. He is also serving as a coeditor of a special issue of the IEEE Transactions on Computers. He is a member of the IEEE Computer Society. Todd Brim received the AB degree in physics from Harvard University in 1989 and the MS and PhD degrees in physics in 1991 and 1994 from California Institute of Technology. Since 2003, he has been a faculty member in the Department of Electrical Engineering at the University of Southern California, where he is an assistant professor. His research is in quantum computation and quantum information processing.

The list of reviewers for the 2008 issues of this journal includes Mark Aagaard, Stephen Brown, and Luca Benini.

People that the author would like to thank for reviewing their articles in the periodical "IEEE Transactions on Computers" from October 13, 2005 to November 6, 2006 are mentioned.

Wireless sensor networks have often been used to monitor and report the locations of moving objects. Since sensors can also be used for storage, a wireless sensor network can be considered a distributed database, enabling us to update and query the location information of moving objects. Many researchers have studied the problem of how to construct message-pruning trees that can update a database and query objects with minimum cost (the Minimum-Cost Message-Pruning Tree problem). The trees are constructed in such a way that the total cost of updating the database and querying objects is kept as minimal as possible, while the hardness of the Minimum-Cost Message-Pruning Tree problem remains unknown. In this paper, we first show that the Minimum-Cost Message-Pruning Tree problem is NP-complete. Subsequently, since the message-pruning tree with minimum cost is hard to construct in polynomial time, we propose a new data aggregation structure, a message-pruning tree with shortcuts, instead of the message- pruning tree. Simulation results show that the proposed data aggregation structure significantly reduces the total cost of updating the database and querying objects as compared to the message-pruning tree. [ABSTRACT FROM AUTHOR]