Apologies for Cross Posting CALL FOR CHAPTER PROPOSALS Proposal Submission Deadline: June 30, 2012 Force-Based Data Visualization and Visual Analytics A book edited by Dr. Maolin Huang and Dr. Weidong Huang University of Technology, Sydney, Australia To be published by IGI Global: http://bit.ly/IPelWH http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=23351©ownerid=1... Introduction Force-based methods have been one of the most widely used techniques for visualizing and analysing networks. Due to rapid advances in storage hardware and network technologies, network data have become increasingly large and complex. As a result, making sense of them has been a challenging issue. In response to this challenge, force-directed methods have undergone further developments in both research and application in recent years. In one direction, many classic force-directed algorithms have been fine-tuned and extended to draw graphs nicely.  In another, the idea of forces has been used to meet specific visual requirements and application needs, such as edge bundling.  Therefore, there exists a need for an edited collection to reflect these latest trends and developments in these directions. Objective of the Book This book will aim to provide an overview of the current state of the art research on force-based and force-related data visualization and visual analytics. It addresses the issues related to design, develop, evaluation and application of force-based algorithms and force-related visualization techniques for data visualization and visual analytics. This book is an edited volume whose contributors include well-established experts and active researchers in this area worldwide. Target Audience The target audience of this book will be composed of professionals and researchers working in the field of data analysis and visualization in various disciplines. Advanced-level students in science and engineering will also find this book useful as a secondary text or reference. Recommended topics include, but are not limited to, the following: Part I: Introduction and background Current status and future challenges of data visualization Current status and future challenges of visual analytics Survey of force-based graph drawing algorithms and their applications Survey of force-related visualization techniques and their applications Part II: algorithms, techniques and applications Theoretic and behavior investigations of force-based algorithms Force-based algorithms for graph drawing Force-based techniques for information visualization Domain specific graph drawing algorithms and their applications Domain specific force-based techniques and their applications Evaluations and case studies of force-based algorithms and techniques Submission Procedure Researchers and practitioners are invited to submit on or before June 30, 2012, a 2-3 page chapter proposal clearly explaining the mission and concerns of his or her proposed chapter. Authors of accepted proposals will be notified by July 15, 2012 about the status of their proposals and sent chapter guidelines. Full chapters are expected to be submitted by September 30, 2012. All submitted chapters will be peer-reviewed. Contributors may also be requested to serve as reviewers for this project. Publisher This book is scheduled to be published by IGI Global (formerly Idea Group Inc.), publisher of the “Information Science Reference” (formerly Idea Group Reference), “Medical Information Science Reference,” “Business Science Reference,” and “Engineering Science Reference” imprints. For additional information regarding the publisher, please visit www.igi-global.com. This publication is anticipated to be released in 2013. Important Dates June 30, 2012:  Proposal Submission Deadline July 15, 2012:  Notification of Acceptance September 30, 2012:     Full Chapter Submission October 15, 2012:       Review Results Returned November 1, 2012:       Final Chapter Submission Inquiries and submissions can be forwarded electronically (Word document) or by mail to: Dr. Weidong Huang E-mail: whua5569@gmail.com * * * * * *