Bøger af Shinsuke Tamura

Different from other available path planning algorithms for manipulators which exploit heuristics extensively, BFA is a deterministic algorithm. It determines whether paths exist or not correctly, and always finds paths if they exist much faster than other algorithms do. Namely, its computation volume is proportional to the number of links and does not change with the complexity of environments. Therefore, it is easy to estimate the computation time. Although this book is an English version of the one published in 2018, the computation volume of other deterministic algorithms still increases exponentially with the number of links.

The Asia Simulation Conference 2006 (JSST 2006) was aimed at exploring challenges in methodologies for modeling, control and computation in simu- lation, and their applications in social, economic, and financial fields as well as established scientific and engineering solutions. The conference was held in Tokyo from October 30 to November 1, 2006, and included keynote speeches presented by technology and industry leaders, technical sessions, organized sessions, poster sessions, and vendor exhibits. It was the seventh annual inter- national conference on system simulation and scientific computing, which is organized by the Japan Society for Simulation Technology (JSST), the Chi- nese Association for System Simulation (CASS), and the Korea Society for Simulation (KSS). For the conference, all submitted papers were refereed by the international technical program committee, each paper receiving at least two independent reviews. After careful reviews by the committee, 65 papers from 143 submis- sions were selected for oral presentation. This volume includes the keynote speakers' papers along with the papers presented at the oral sessions and the organized sessions. As a result, we are publishing 87 papers for the conference in this volume. In addition to the scientific tracts presented, the conference featured keynote presentations by five invited speakers. We are grateful to them for accepting our invitation and for their presentations. We also would like to express our gratitude to all contributors, reviewers, technical program conmiittee members, and organizing committee members who made the conference very successful.

Although e-cash systems are widely used, currently available e-cash is not a complete replacement of real cash, e.g. authorities can know merchandise for which the e-cash was paid from information included in e-cash despite they may be secrets of the cash holders. Also, protection of e-cash from dishonest entities in offline environments is not easy. A payee of e-cash cannot determine whether the e-cash a payer is paying was used already at other places or not when databases about already used e-cash are not available for example. To completely replace real cash with e-cash, this book develops a self-issuable e-cash scheme that satisfies all essential requirements. Namely, cash holders cannot forge e-cash and only a legitimate cash holder can use its e-cash. Also, no one except cash holders themselves can know their purchases or can link their consecutive purchases. In addition, cash holders can divide their e-cash into ones of arbitrary values to pay for small purchases, they can use e-cash that was paid by others, and e-cash is protected from dishonest uses even in offline environments where databases about issued or used e-cash are not available.

Outlines the benefits and drawbacks of anonymous security technologies designed to obscure the identities of users. These technologies may help solve various privacy issues and encourage more people to make full use of information and communication technologies, and may help to establish more secure, convenient, efficient, and environmentally-friendly societies.