Transformation rules for CNOT-based quantum circuits and their applications

This paper introduces a simple but nontrivial set of local transformation rules for designingControl-NOT(CNOT)-based combinatorial circuits. We also provide a proof that the rule set iscomplete, namely, for any two equivalent circuits,S ₁ andS ₂, there is a sequence of transformations, each of them in the rule set, which changesS ₁ toS ₂. Two applications of the rule set are also presented. One is to simulate Resolution with only polynomial overhead by the rule set. Therefore we can conclude that the rule set is reasonably powerful. The other is to reduce the cost of CNOT-based circuits by using the transformations in the rule set. This implies that the rule set might be used for the practical circuit design. Currently Graduate School of Information Science, Nara Institute of Science and Technology Kazuo Iwama, Ph.D.: Professor of Informatics, Kyoto University, Kyoto 606-8501, Japan. Received BE, ME, and Ph.D. degrees in Electrical Engineering from Kyoto University in 1978, 1980 and 1985, respectively. His research interests include algorithms, complexity theory and quantum computation. Editorial board of Information Processing Letters and Parallel Computing. Council Member of European Association for Theoretical Computer Science (EATCS). Shigeru Yamashita, Ph.D.: Associate Professor of Graduate School of Information Science, Nara Instutute of Science and Technology, Nara 630-0192, Japan. He received his B.E., M.E. and Ph.D. degrees in information science from Kyoto University, Kyoto, Japan, in 1993, 1995 and 2001, respectively. His research interests include new type of computer architectures and quantum computation. He received the 2000 IEEE Circuits and Systems Society Transactions on Computer-Aided Design of Integrated Circuits and Systems Best Paper Award.     

Trends of internet auctions and agent-mediated Web commerce

Electronic Commerce (EC) is a promising field for applying agent and Artificial Intelligence technologies. In this article, we give an overview of the trends of Internet auctions and agent-mediated Web commerce. We describe the theoretical backgrounds of auction protocols and introduce several Internet auction sites. Furthermore, we describe various activities aimed toward utilizing agent technologies in EC and the trends in standardization efforts on agent technologies. Makoto Yokoo, Ph.D.: He received the B.E. and M.E. degrees in electrical engineering, in 1984 and 1986, respectively, from the University of Tokyo, Japan, and the Ph.D. degree in information and communication engineering in 1995 from the University of Tokyo, Japan. He is currently a distinguished technical member in NTT Communication Science Laboratories, Kyoto, Japan. He was a visiting research scientist at the Department of Electrical Engineering and Computer Science, the University of Michigan, Ann Arbor, from 1990 to 1991. His current research interests include multi-agent systems, search, and constraint satisfaction. Satoru Fujita, D.Eng.: He received his B.E. and M.E. degrees in electronic engineering from the University of Tokyo in 1984 and 1986, respectively. He also received his D.Eng. from the University of Tokyo in 1989 for his research on context comprehension in natural language understanding. He joined NEC Corporation in 1989, and is now a principal researcher of Internet Systems Research Laboratories of NEC. He is engaged in research on mobile agents, distributed systems and Web services.     

A quantum algorithm using NMR computers to break secret-key cryptosystems

In this paper, we discuss quantum algorithms that, for a given plaintextm _o and a given ciphertextc _o, will find a secret key,k _o, satisfyingc _o=E(k _o,m _o), where an encryption algorithm,E, is publicly available. We propose a new algorithm suitable for an NMR (Nuclear Magnetic Resonance) computer based on the technique used to solve the counting problem. The complexity of, our algorithm decreases as the measurement accuracy of the NMR computer increases. We discuss the possibility that the proposed algorithm is superior to Grover’s algorithm based on initial experimental results. Kazuo Ohta, Dr.S.: He is Professor of Faculty of Electro-Communications at the University of Electro-Communications, Japan. He received B.S., M.S., and Dr. S. degrees from Waseda University, Japan, in 1977, 1979, and 1990, respectively. He was researcher of NTT (Nippon Telegraph and Telephone Corporation) from 1979 to 2001, and was visiting scientist of Laboratory for Computer Science e of MIT (Massachusetts Institute of Technology) in 1991–1992 and visiting Professor of Applied Mathematics of MIT in 2000. He is presently engaged in research on Information Security, and theoretical computer science. Dr. Ohta is a member of IEEE, the International Association for Cryptologic Research, the Institute of Electronics, Information and Communication Engineers and the Information Processing Society of Japan. Tetsuro Nishino,: He received the B.S., M.S. and, D.Sc. degrees in mathematics from Waseda University, in 1982, 1984, and 1991 respectively. From 1984 to 1987, he joined Tokyo Research Laboratory, IBM Japan. From 1987 to 1992, he was a Research Associate of Tokyo Denki University, and from 1992 to 1994, he was an Associate Professor of Japan Advanced Institute of Science and Technology, Hokuriku. He is presently an Associate Professor in the Department of Communications and Systems Engineering, the University of Electro-Communications. His main interests are circuit complexity theory, computational learning theory and quantum complexity theory. Seiya Okubo,: He received the B.Eng. and M.Eng. degrees from the University of Electro-Communications in 2000 and 2002, respectively. He is a student in Graduate School of Electro-Communications, the University of Electro-Communications. His research interests include quantum complexity theory and cryptography. Noboru Kunihiro, Ph.D.: He is Assistant Professor of the University of Electro-Communications. He received his B. E., M. E. and Ph. D. in mathematical engineering and information physics from the University of Tokyo in 1994, 1996 and 2001, respectively. He had been engaged in the research on cryptography and information security at NTT Communication Science Laboratories from 1996 to 2002. Since 2002, he has been working for Department of Information and Communication Engineering of the University of Elector-Communications. His research interests include cryptography, information security and quantum computations. He was awarded the SCIS’97 paper prize.     

Quantum Bit-commitment for small storage based on quantum one-way permutations

We propose a quantum bit-commitment scheme based on quantum one-way permutations with the unconditionally binding and computationally concealing property. Our scheme reduces exponentially the number of bits which the receiver needs to store until, the opening phase compared with the classical counterpart. Keisuke Tanaka, Ph.D.: He is Assistant Professor of Department of Mathematical and Computing Sciences at Tokyo Institute of Technology. He received his B.S. from Yamanashi University in 1992 and his M.S. and Ph.D. from Japan Advanced Institute of Science and Technology in 1994 and 1997, respectively. For each degree, he majored in computer science. Before joining Tokyo Institute of Technology, he was Research Engineer at NTT Information Sharing Platform Laboratories. His research interests are cryptography, quantum computation, circuit complexity, and the design and analysis of algorithms.     

Cooperation of categorical and behavioral learning in a practical solution to the abstraction problem

Real robots should be able to adapt autonomously to various environments in order to go on executing their tasks without breaking down. They achieve this by learning how to abstract only useful information from a huge amount of information in the environment while executing their tasks. This paper proposes a new architecture which performs categorical learning and behavioral learning in parallel with task execution. We call the architectureSituation Transition Network System (STNS). In categorical learning, it makes a flexible state representation and modifies it according to the results of behaviors. Behavioral learning is reinforcement learning on the state representation. Simulation results have shown that this architecture is able to learn efficiently and adapt to unexpected changes of the environment autonomously. Atsushi Ueno, Ph.D.: He is a research associate in the Artificial Intelligence Laboratory at the Graduate School of Information Science at the Nara Institute of Science and Technology (NAIST). He received the B.E., the M.E., and the Ph.D. degrees in aeronautics and astronautics from the University of Tokyo in 1991, 1993, and 1997 respectively. His research interest is robot learning and autonomous systems. He is a member of Japan Association for Artificial Intelligence (JSAI). Hideaki Takeda, Ph.D.: He is an associate professor in the Artificial Intelligence Laboratory at the Graduate School of Information Science at the Nara Institute of Science and Technology (NAIST). He received his Ph.D. in precision machinery engineering from the University of Tokyo in 1991. He has conducted research on a theory of intelligent computer-aided design systems, in particular experimental study and logical formalization of engineering design. He is also interested in multiagent architectures and ontologies for knowledge base systems.     

Toward a real-world knowledge medium: Building a guidance system for exhibition tours

We propose a notion of a real-world knowledge medium by presenting our ongoing project to build a guidance system for exhibition tours. In order to realize a knowledge medium usable in the real world, we focus on the context-awareness of users and their environments. Our system is a personal mobile assistant that provides visitors touring exhibitions with information based on their spatial/temporal locations and individual interests. We also describe an application of knowledge sharing used in the actual exhibition spaces. Yasuyuki Sumi, Ph.D.: He has been a researcher at ATR Media Integration & Communications Research Laboratories since 1995. His research interests include knowledge-based systems, creativity supporting systems, and their applications for facilitating human collaboration. He received his B. Eng. degree from Waseda University in 1990, and M. Eng. and D. Eng. degrees in information engineering from the University of Tokyo in 1992 and 1995, respectively. He is a member of Institutes of Electronics, Information and Communication Engineers (IEICE) of Japan, the Information Processing Society of Japan (IPSJ), the Japanese Society for Artificial Intelligence (JSAI), and American Association for Artificial Intelligence (AAAI). Kenji Mase, Ph.D.: He received the B.S. degree in Electrical Engineering and the M.S. and Ph.D. degrees in Information Engineering from Nagoya University in 1979, 1981 and 1992 respectively. He has been with ATR (Advanced Telecommunications Research Institute) Media Integration & Communications Research Laboratories since 1995 and is currently the head of Department 2. He joined the Nippon Telegraph and Telephone Corporation (NTT) in 1981 and had been with the NTT Human Interface Laboratories. He was a visiting researcher at the Media Laboratory, MIT in 1988–1989. His research interests include image sequence processing of human actions, computer graphics, computer vision, artificial intelligence and their applications for computer-aided communications and human-machine interfaces. He is a member of the Information Processing Society of Japan (IPSJ), Institutes of Electronics, Information and Communication Engineers (IEICE) of Japan and IEEE Computer Society.     

Secure web transaction with anonymous mobile agent over internet

A major problem of mobile agents is their apparent mability to authenticate transactions in hostile environments,In this paper,a new secure anonymous mobile agent scheme is proposed for the prevention of agent tempering without compromising the mobility or autonomy of the agent.in the scheme,a mobile agent can produce valid signature on website‘s bid(it means to transact a contact with the web site)on behalf of its customer ,without-revealing the customer‘s real private key.In addition,the anonymity of the customer is also achieved when its agent tansacts with the websites.Furthermore,the customer who issues a malicious agent or denies the transaction can be identified and detected by Agent Management Center(AMC).Thererfore,the scheme is practical in the future elecronic commerce over Internet.     

Fair Electronic Cash Based on Double Signatures

In order to decrease crimes such as money laundering,blackmailing etc.in electronic cash systems,fair electronic cash has been a major focus of academic research in electronic commence.When a bank finds some dubious cash or owner,the trusted entity or trustee can help him to revoke the anonymity of the cash.In the previous protocols,the trustee knows all the information of the cash whether he is trusted or not,that is,he can trace the user or cash unconditionally,Furthermore,the dishonest trustee may deceive a user,which means that the may withdraw cash while tracing other users,Such cases are unfair to the honest users.A new fair electronic cash protocol based on untrustworkthy trustees is proposed in this paper.The key idea is that the coin structure should include the signatures of both the trustee and the bank so that the trustee shares the information of the cash with the bank,while we do not use the secret sharing scheme.In contrast with the previous protocols.neither the trustee nor the bank can trace the money without the help of the other entity.In this way,the privacy of the user is protected furthest.Also,the trustee is off-line in the protocol,which means that he will not be involved in withdrawing the cash.Therefore,the protocol is efficient for implementation.     

Distributed oblivious function evaluation and its applications

This paper is about distributed oblivious function evaluation (DOFE). In this setting one party (Alice) has a function f(x), and the other party (Bob) with an input α wants to learn f(α) in an oblivious way with the help of a set of servers. What Alice should do is to share her secret function f(x) among the servers.Bob obtains what he should get by interacting with the servers. This paper proposes the model and security requirements for DOFE and analyzes three distributed oblivious polynomial evaluation protocols presented in the paper.     

Intelligent systems using Web-pages as knowledge base for statistical decision making

In this paper, we propose an approach to the construction of an intelligent system that handles various domain information provided on the Internet. The intelligent system adopts statistical decision-making as its reasoning framework and automatically constructs probabilistic knowledge, required for its decision-making, from Web-pages. This construction of probabilistic knowledge is carried out using aprobability interpretation idea that transforms statements in Web-pages into constraints on the subjective probabilities of a person who describes the statements. In this paper, we particularly focus on describing the basic idea of our approach and on discussing difficulties in our approach, including our perspective. Kazunori Fujimoto: He received bachelor’s degree from Department of Electrical Engineering, Doshisha University, Japan, in 1989, and master’s degree from Division of Applied Systems Science, Kyoto University, Japan, in 1992. From there, he joined NTT Electrical Communications Laboratories, Tokyo, Japan, and has been engaged in research on Artificial Intelligence. He is currently interested in probabilistic reasoning, knowledge acquisition, and especially in quantitative approaches to research in human cognition and behavior. Mr. Fujimoto is a member of Decision Analysis Society, The Behaviormetric Society of Japan, Japanese Society for Artificial Intelligence, Information Processing Society of Japan, and Japanese Society for Fuzzy Theory and Systems. Kazumitsu Matsuzawa: He received B.S. and M.S. degrees in electronic engineering from Tokyo Institute of Technology, Tokyo, Japan, in 1975 and 1977. From there, he joined NTT Electrical Communications Laboratories, Tokyo, Japan, and has been engaged in research on computer architecture and the design of LSI. He is currently concerned with AI technology. Mr. Matsuzawa is a member of The Institute of Electronics, Information and Communication Engineers, Information Processing Society of Japan, Japanese Society for Artificial Intelligence, and Japanese Society for Fuzzy Theory and Systems.     

A motion compensated lifting wavelet codec for 3D video coding

A motion compensated lifting (MCLIFT) ramework for the 3D wavelet video coding is proposed in this paper,By using bi-directional motion compensation in each lifting step of the temporal direction,the video frames are effectively de-correlated,With the proper entropy coding and bit-stream packaging schemes,the MCLIFT wavelet video coder is scalable at frame rate and quality level .Experimental results show that the MCLIFT video coder outperforms the 3D wavelet video coder without motion by an average of 0.9-1.3dB,and outperforms MPEG-4 coder by an average of 0.2-0.6dB.     

Using discriminant analysis for multi-class classification: an experimental investigation

Many supervised machine learning tasks can be cast as multi-class classification problems. Support vector machines (SVMs) excel at binary classification problems, but the elegant theory behind large-margin hyperplane cannot be easily extended to their multi-class counterparts. On the other hand, it was shown that the decision hyperplanes for binary classification obtained by SVMs are equivalent to the solutions obtained by Fisher's linear discriminant on the set of support vectors. Discriminant analysis approaches are well known to learn discriminative feature transformations in the statistical pattern recognition literature and can be easily extend to multi-class cases. The use of discriminant analysis, however, has not been fully experimented in the data mining literature. In this paper, we explore the use of discriminant analysis for multi-class classification problems. We evaluate the performance of discriminant analysis on a large collection of benchmark datasets and investigate its usage in text categorization. Our experiments suggest that discriminant analysis provides a fast, efficient yet accurate alternative for general multi-class classification problems. Tao Li is currently an assistant professor in the School of Computer Science at Florida International University. He received his Ph.D. degree in Computer Science from University of Rochester in 2004. His primary research interests are: data mining, machine learning, bioinformatics, and music information retrieval. Shenghuo Zhu is currently a researcher in NEC Laboratories America, Inc. He received his B.E. from Zhejiang University in 1994, B.E. from Tsinghua University in 1997, and Ph.D degree in Computer Science from University of Rochester in 2003. His primary research interests include information retrieval, machine learning, and data mining. Mitsunori Ogihara received a Ph.D. in Information Sciences at Tokyo Institute of Technology in 1993. He is currently Professor and Chair of the Department of Computer Science at the University of Rochester. His primary research interests are data mining, computational complexity, and molecular computation.     

A futures market-based model for dynamic network resource allocation

Management of telecommunication network requires quick, continuous and decentralized allocation of network bandwidth to various sorts of demands. So as to achieve the efficient network resource allocation, this paper describes a market-based model combining futures market with the agent-based approach. That is, utilization time is divided into many timeslots, and futures markets in hereafter use of bandwidth are opened. In our model, all market participants (software agents) observe only market prices and decide to buy or sell bandwidth trying to maximize their utilities over time so that they can secure enough network resources. The authors discuss network resource allocation through simulation using the proposed model. Masayuki Ishinishi, Ph.D.: He graduated from National Defense Academy in 1995 and 2000. He received the B.E. (1995) and M.E.(2000) degrees in computer science from National Institution for Academic Degrees (NIAD). He received his Ph.D. degree from Tokyo Institute of Technology in 2003. He has been a communications officer at Air Communications and Systems Wing in Japan Air Self-Defence Force (JASDF) since 2003. His research interests include information assurance, agent-based modeling and simulation, multi-agent system and market-based control. He is a member of IEEJ, IPSJ and JSAI. Yuhsuke Koyama, Ph.D.: He received the B.Econ., M.Econ., and Ph.D. degrees in economics from Kyoto University, in 1996, 1998, 2002, respectively. He has been a research associate of Tokyo Institute of Technology since 2002. His research field is evolutionary economics, mathematical sociology and experimental economics. He is a member of JAFEE, JAMS, JASESS and JASAG. Hiroshi Deguchi, Ph.D.: He received his Ph.D. degree in systems science from Tokyo Institute of Technology, in 1986. He also received the Dr. Econ. degree from Kyoto University in 2001. He has been a Professor of Tokyo Institute of Technology since 2002. His research field is evolutionary economics, computational organization theory, agent-based modeling, social system theory, gaming simulation, and philosophy of science. He is a member of SICE, JAMS, IPSJ, PHSC, JASAG and JAFEE. Hajime Kita, Ph.D.: He received the B.E., M.E., and Ph.D. degrees in electrical engineering from Kyoto University, in 1982, 1984, 1991, respectively. He has been a Professor of Kyoto University since 2003, His research field is systems science/engineering, and his research interests are evolutionary computation, neural networks and socio-economic analysis of energy systems, and agentbased modeling. He is a member of IEEJ, IEICE, ISCIE, JNNS, JSER, ORSJ and SICE.     

A challenge towards next-generation research infrastructure for advanced life science

Recently, life scientists have expressed a strong need for computational power sufficient to complete their analyses within a realistic time as well as for a computational power capable of seamlessly retrieving biological data of interest from multiple and diverse bio-related databases for their research infrastructure. This need implies that life science strongly requires the benefits of advanced IT. In Japan, the Biogrid project has been promoted since 2002 toward the establishment of a next-generation research infrastructure for advanced life science. In this paper, the Biogrid strategy toward these ends is detailed along with the role and mission imposed on the Biogrid project. In addition, we present the current status of the development of the project as well as the future issues to be tackled. Haruki Nakamura, Ph.D.: He is Professor of Protein Informatics at Institute for Protein Research, Osaka University. He received his B.S., M.A. and Ph.D. from the University of Tokyo in 1975, 1977 and 1980 respectively. His research field is Biophysics and Bioinformatics, and has so far developed several original algorithms in the computational analyses of protein electrostatic features and folding dynamics. He is also a head of PDBj (Protein Data Bank Japan) to manage and develop the protein structure database, collaborating with RCSB (Research Collaboratory for Structural Bioinformatics) in USA and MSD-EBI (Macromolecular Structure Database at the European Bioinformatics Institute) in EU. Susumu Date, Ph.D.: He is Assistant Professor of the Graduate School of Information Science and Technology, Osaka University. He received his B.E., M.E. and Ph.D. degrees from Osaka University in 1997, 2000 and 2002, respectively. His research field is computer science and his current research interests include application of Grid computing and related information technologies to life sciences. He is a member of IEEE CS and IPSJ. Hideo Matsuda, Ph.D.: He is Professor of the Department of Bioinformatic Engineering, the Graduate School of Information Science and Technology, Osaka University. He received his B.S., M.Eng. and Ph.D. degrees from Kobe University in 1982, 1984 and 1987 respectively. For M.Eng. and Ph.D. degrees, he majored in computer science. His research interests include computational analysis of genomic sequences. He has been involved in the FANTOM (Functional Annotation of Mouse) Project for the functional annotation of RIKEN mouse full-length cDNA sequences. He is a member of ISCB, IEEE CS and ACM. Shinji Shimojo, Ph.D.: He received M.E. and Ph.D. degrees from Osaka University in 1983 and 1986 respectively. He was an Assistant Professor with the Department of Information and Computer Sciences, Faculty of Engineering Science at Osaka University from 1986, and an Associate Professor with Computation Center from 1991 to 1998. During the period, he also worked as a visiting researcher at the University of California, Irvine for a year. He has been Professor with Cybermedia Center (then Computation Center) at Osaka University since 1998. His current research work focus on a wide variety of multimedia applications, peer-to-peer communication networks, ubiquitous network systems and Grid technologies. He is a member of ACM, IEEE and IEICE.     

Privacy preservation for data cubes

A range query finds the aggregated values over all selected cells of an online analytical processing (OLAP) data cube where the selection is specified by the ranges of contiguous values for each dimension. An important issue in reality is how to preserve the confidential information in individual data cells while still providing an accurate estimation of the original aggregated values for range queries. In this paper, we propose an effective solution, called the zero-sum method, to this problem. We derive theoretical formulas to analyse the performance of our method. Empirical experiments are also carried out by using analytical processing benchmark (APB) dataset from the OLAP Council. Various parameters, such as the privacy factor and the accuracy factor, have been considered and tested in the experiments. Finally, our experimental results show that there is a trade-off between privacy preservation and range query accuracy, and the zero-sum method has fulfilled three design goals: security, accuracy, and accessibility. Sam Y. Sung is an Associate Professor in the Department of Computer Science, School of Computing, National University of Singapore. He received a B.Sc. from the National Taiwan University in 1973, the M.Sc. and Ph.D. in computer science from the University of Minnesota in 1977 and 1983, respectively. He was with the University of Oklahoma and University of Memphis in the United States before joining the National University of Singapore. His research interests include information retrieval, data mining, pictorial databases and mobile computing. He has published more than 80 papers in various conferences and journals, including IEEE Transaction on Software Engineering, IEEE Transaction on Knowledge & Data Engineering, etc. Yao Liu received the B.E. degree in computer science and technology from Peking University in 1996 and the MS. degree from the Software Institute of the Chinese Science Academy in 1999. Currently, she is a Ph.D. candidate in the Department of Computer Science at the National University of Singapore. Her research interests include data warehousing, database security, data mining and high-speed networking. Hui Xiong received the B.E. degree in Automation from the University of Science and Technology of China, Hefei, China, in 1995, the M.S. degree in Computer Science from the National University of Singapore, Singapore, in 2000, and the Ph.D. degree in Computer Science from the University of Minnesota, Minneapolis, MN, USA, in 2005. He is currently an Assistant Professor of Computer Information Systems in the Management Science & Information Systems Department at Rutgers University, NJ, USA. His research interests include data mining, databases, and statistical computing with applications in bioinformatics, database security, and self-managing systems. He is a member of the IEEE Computer Society and the ACM. Peter A. Ng is currently the Chairperson and Professor of Computer Science at the University of Texas—Pan American. He received his Ph.D. from the University of Texas–Austin in 1974. Previously, he had served as the Vice President at the Fudan International Institute for Information Science and Technology, Shanghai, China, from 1999 to 2002, and the Executive Director for the Global e-Learning Project at the University of Nebraska at Omaha, 2000–2003. He was appointed as an Advisory Professor of Computer Science at Fudan University, Shanghai, China in 1999. His recent research focuses on document and information-based processing, retrieval and management. He has published many journal and conference articles in this area. He had served as the Editor-in-Chief for the Journal on Systems Integration (1991–2001) and as Advisory Editor for the Data and Knowledge Engineering Journal since 1989.     

Public opinion channel for communities in the information age

In this paper, we propose as a new challenge a public opinion channel which can provide a novel communication medium for sharing and exchanging opinions in a community. Rather than simply developing a means of investigating public opinion, we aim at an active medium that can facilitate mutual understanding, discussion, and public opinion formation. First, we elaborate the idea of public opinion channels and identify key issues. Second, we describe our first step towards the goal using the talking virtualized egos metaphor. Finally, we discuss a research agenda towards the goal. Toyoaki Nishida, Dr.Eng.: He is a professor of Department of Information and Communication Engineering, School of Engineering, The University of Tokyo. He received the B.E., the M.E., and the Doctor of Engineering degrees from Kyoto University in 1977, 1979, and 1984 respectively. His research centers on artificial intelligence in general. His current research focuses on community computing and support systems, including knowledge sharing, knowledge media, and agent technology. He has been leading the Breakthrough 21 Nishida Project, sponsored by Ministry of Posts and Telecommunications, Japan, aiming at understanding and assisting networked communities. Since 1997, he is a trustee for JSAI (Japanese Society for Artificial Intelligence), and serves as the program chair of 1999 JSAI Annual Convention. He is an area editor (intelligent systems) of New Generation Computing and an editor of Autonomous Agents and Multiagent Systems. Nobuhiko Fujihara, Ph.D.: He is a fellow of Breakthrough 21 Nishida project, Communications Research Laboratory sponsored by Ministry of Posts and Telecommunications, Japan. He received the B.E., the M.E., and the Ph.D. in Human Sciences degrees from Osaka University in 1992, 1994, and 1998 respectively. He has a cognitive psychological background. His current research focuses on: (1) cognitive psychological analysis of human behavior in a networked community, (2) investigation of information comprehension process, (3) assessment and proposition of communication tools in networking society. Shintaro Azechi: He is a fellow of Breakthrough 21 Nishida project, Communications Research Laboratory sponsored by Ministry of Posts and Telecommunications, Japan. He received the B.E. and the M.E. of Human Sciences degrees from Osaka University in 1994 and 1996 respectively. He is a Doctoral Candidate of Graduate School of Human Sciences, Osaka University. His current researches focus on (1) human behavior in networking community (2) social infomation process in human mind (3) development of acessment technique for communication tools in networkingsociety. His approach is from social psychological view. Kaoru Sumi, Dr.Eng.: She is a Researcher of Breakthrough 21 Nishida Project. She received her Bachelor of Science at School of Physics, Science University of Tokyo. She received her Master of Systems Management at Graduate School of Systems Management, The university of Tsukuba. She received her Doctor of engineering at Graduate School of Engineering, The University of Tokyo. Her research interests include knowledge-based systems, creativity supporting systems, and their applications for facilitating human collaboration. She is a member of the Information Processing Society of Japan (IPSJ), the Japanese Society for Artificial Intelligence (JSAI). Hiroyuki Yano, Dr.Eng.: He is a senior research official of Kansai Advanced Research Center, Communications Research Laboratory, Ministry of Posts and Telecommunications. He received the B.E., the M.E., and the Doctor of Engineering degrees from Tohoku University in 1986, 1988, and 1993 respectively. His interests of research include cognitive mechanism of human communications. His current research focuses on discourse structure, human interface, and dialogue systems for human natural dialogues. He is a member of the Japanese Society for Artificial Intelligence, the Association for Natural Language Processing, and the Japanese Cognitive Science Society. Takashi Hirata: He is a doctor course student in Graduate School of Information Scienc at Nara Institute of Science and Technology (NAIST). He received a master of engineering from NAIST in 1998. His research interest is knowledge media and knowledge sharing. He is a member of Information Processing Society of Japan (IPSJ), Japan Association for Artificial Intelligence (JSAI) and The Institute of Systems, Control and Information Engineers (ISCIE).     

Block cipher based on reversible cellular automata

We propose a new encryption algorithm relying on reversible cellular automata (CA). The behavior complexity of CA and their parallel nature makes them interesting candidates for cryptography. The proposed algorithm belongs to the class of symmetric key systems. Marcin Seredynski: He is a Ph.D. student at University of Luxembourg and Polish Academy of Sciences. He received his M.S. in 2004 from Faculty of Electronics and Information Technology in Warsaw University of Technology. His research interests include cryptography, cellular automata, nature inspired algorithms and network security. Currently he is working on intrusion detection algorithms for ad-hoc networks. Pascal Bouvry, Ph.D.: He earned his undergraduate degree in Economical & Social Sciences and his Master degree in Computer Science with distinction (’91) from the University of Namur, Belgium. He went on to obtain his Ph.D. degree (’94) in Computer Science with great distinction at the University of Grenoble (INPG), France. His research at the IMAG laboratory focussed on Mapping and scheduling task graphs onto Distributed Memory Parallel Computers. Next, he performed post-doctoral researches on coordination languages and multi-agent evolutionary computing at CWI in Amsterdam. He gained industrial experience as manager of the technology consultant team for FICS in the banking sector (Brussels, Belgium). Next, he worked as CEO and CTO of SDC (Ho Chi Minh city, Vietnam) in the telecom, semi-conductor and space industry. After that, He moved to Montreal Canada as VP Production of Lat45 and Development Director for MetaSolv Software in the telecom industry. He is currently serving as Professor in the group of Computer Science and Communications (CSC) of the Faculty of Sciences, Technology and Communications of Luxembourg University and he is heading the Intelligent & Adaptive Systems lab. His current research interests include: ad-hoc networks & grid-computing, evolutionary algorithms and multi-agent systems.     

Delay-dependent robust stability criteria for delay neural networks with linear fractional uncertainties

This article investigates the problem of robust stability for neural networks with time-varying delays and parameter uncertainties of linear fractional form. By introducing a new Lyapunov-Krasovskii functional and a tighter inequality, delay-dependent stability criteria are established in term of linear matrix inequalities (LMIs). It is shown that the obtained criteria can provide less conservative results than some existing ones. Numerical examples are given to demonstrate the applicability of the proposed approach. Recommended by Editorial Board member Naira Hovakimyan under the direction of Editor Young-Hoon Joo. This work was supported by the National Science foundation of China under Grant no. 60774013 and Key Laboratory of Education Ministry for Image Processing and Intelligent Control under grant no. 200805. Tao Li received the Ph.D. degree in The Research Institute of Automation Southeast University, China. Now He is an Assistant Professor in Department of Information and Communication, Nanjing University of Information Science and Technology. His current research interests include time-delay systems, neural networks, robust control, fault detection and diagnosis. Lei Guo received the Ph.D. degree in the Research Institute of Automation Southeast University, China. From 1999 to 2004, he has worked at Hong Kong University, IRCCyN (France), Glasgow University, Loughborough University and UMIST, UK. Now He is a Professor in School of Instrument Science and Opto-Electronics Engineering, Beihang University. His current research interests include robust control, fault detection and diagnosis. Lingyao Wu received the Ph.D. degree in The Research Institute of Automation Southeast University, China. Now He is an Assistant Professor in the Research Institute of Automation Southeast University. His current research interests include time-delay systems, neural networks, robust control, fault detection and diagnosis. Changyin Sun received the Ph.D. degree in the Research Institute of Automation Southeast University, China. Now He is a Professor in the Research Institute of Automation Southeast University. His current research interests include timedelay systems, neural networks.     

Forms and theories of communication: from multimedia to Kansei Mediation

In this paper we describe a form of communication that could be used for lifelong learning as contribution to cultural computing. We call it Kansei Mediation. It is a multimedia communication concept that can cope with non-verbal, emotional and Kansei information. We introduce the distinction between the concepts of Kansei Communication and Kansei Media. We then develop a theory of communication (i.e. Kansei Mediation) as a combination of both. Based on recent results from brain research the proposed concept of Kansei Mediation is developed and discussed. The biased preference towards consciousness in established communication theories is critically reviewed and the relationship to pre- and unconscious brain processes explored. There are two tenets of the Kansei Mediation communication theory: (1) communication based on connected unconciousness, and (2) Satori as the ultimate form of experience. Ryohei Nakatsu received the B.S. (1969), M.S. (1971) and Ph.D. (1982) degrees in electronic engineering from Kyoto University. After joining NTT in 1971, he mainly worked on speech recognition technology. He joined ATR (Advanced Telecommunications Research Institute) as the president of ATR Media Integration & Communications Research Laboratories (1994–2002). From the spring of 2002 he is full professor at School of Science and Technology, Kwansei Gakuin University in Sanda (Japan). At the same time he established a venture company, Nirvana Technology Inc., and became the president of the company. In 1978, he received Young Engineer Award from the Institute of Electronics, Information and Communication Engineers Japan (IEICE-J). In 1996, he received the best paper award from the IEEE International Conference on Multimedia. In 1999, 2000 and 2001, he was awarded Telecom System Award from Telecommunication System Foundation and the best paper award from Virtual Reality Society of Japan. In 2000, he got the best paper award from Artificial Intelligence Society of Japan. He is a fellow of the IEEE and the Institute of Electronics, Information and Communication Engineers Japan (IEICE-J), a member of the Acoustical Society of Japan, Information Processing Society of Japan, and Japanese Society for Artificial Intelligence. Matthias Rauterberg received the B.S. in psychology (1978) at the University of Marburg (Germany), the B.S. in philosophy (1981) and computer science (1983), the M.S. in psychology (1981) and computer science (1985) at the University of Hamburg (Germany), and the Ph.D. in computer science (1995) at the University of Zurich (Switzerland). He was a senior lecturer for ‘usability engineering’ in computer science and industrial engineering at the Swiss Federal Institute of Technology (ETH) in Zurich. He was the head of the Man–Machine Interaction research group (MMI) of the Institute for Hygiene and Applied Physiology (IHA) from the Department of Industrial Engineering at the ETH, Zurich. Since 1998, he is a fulltime professor for ‘human communication technology’ at the Department of Industrial Design at the Technical University Eindhoven (The Netherlands), and also since 2004, he is appointed as a visiting professor at the Kwansei Gakuin University (Japan). He received the German GI-HCI award for the best Ph.D. in 1997 and the Swiss Technology Award together with Martin Bichsel for the BUILD-IT system in 1998. Since 2005, he is elected as a member of the Cream of Science in The Netherlands. Ben Salem received the Dip.Arch. (1987) at the Ecole Polytechnique d'Architecture et d'Urbanisme EPAU (Algiers), the M.Arch. (1993) at the School of Architectural Studies of the University of Sheffield (UK), and the Ph.D. in electronics (2003) at the Department of Electronic and Electrical Engineering, University of Sheffield (UK). Since 2001, he is director of Polywork Ltd. (UK). Since 2003. he has a PostDoc position at the Department of Industrial Design of the Technical University Eindhoven (The Netherlands).