Relational semantics for locally nondeterministic programs

Introducing nondeterministic operators in a conventional deterministic language gives rise to various semantic difficulties. One of the problems is that there has been no semantic domain that is wholly satisfactory for denoting nondeterministic programs. In this paper, we propose an approach based on relational algebra. We divide the semantics of a nondeterministic program into two parts. The first part concerns the angelic aspect of programs and the second part concerns the demonic aspect of programs. Because each semantic function used in these parts is monotonic with respect to an ordering on relations, the existence of the fixed points of recursively defined nondeterministic programs is ensured. Liangwei Xu: His research interests are computational model, program transformation and derivation methodology. He received the B. E. degree from Shanghai Jiao Tong University in 1982 and the M.E. degree from University of Tokyo in 1992. He currently joins Mathematical Systems Institute Inc. Masato Takeichi, Dr. Eng.: He is a Professor of Department of Mathematical Engineering. Graduate School of Engineering, University of Tokyo. His research interests are functional programming, language implementation and constructive algorithmics. Hideya Iwasaki, Dr. Eng.: He is an Associate Professor of Faculty of Technology, Tokyo University of Agriculture and Technology. He received the M.E. degree in 1985, the Dr. Eng. degree in 1988 from University of Tokyo. His research interests are list processing languages, functional languages, parallel processing, and constructive algorithmics.     

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.     

Polynomial-time learning of elementary formal systems

An elementary formal system (EFS) is a logic program consisting of definite clauses whose arguments have patterns instead of first-order terms. We investigate EFSs for polynomial-time PAC-learnability. A definite clause of an EFS is hereditary if every pattern in the body is a subword of a pattern in the head. With this new notion, we show that H-EFS(m, k, t, r) is polynomial-time learnable, which is the class of languages definable by EFSs consisting of at mostm hereditary definite clauses with predicate symbols of arity at mostr, wherek andt bound the number of variable occurrences in the head and the number of atoms in the body, respectively. The class defined by all finite unions of EFSs in H-EFS(m, k, t, r) is also polynomial-time learnable. We also show an interesting series ofNC-learnable classes of EFSs. As hardness results, the class of regular pattern languages is shown not polynomial-time learnable unlessRP=NP. Furthermore, the related problem of deciding whether there is a common subsequence which is consistent with given positive and negative examples is shownNP-complete. Satoru Miyano, Dr. Sci.: He is a Professor in Human Genome Center at the University of Tokyo. He obtained B.S. in 1977, M.S. in 1979, and Dr. Sci. degree all in Mathematics from Kyushu University. His current interests include bioinformatics, discovery science, computational complexity, computational learning. He has been organizing Genome Informatics Workshop Series since 1996 and has served for the chair/member of the program committee of many conferences in the area of Computer Science and Bioinformatics. He is on the Editorial Board of Theoretical Computer Science and the Chief Editor of Genome Informatics Series. Ayumi Shinohara, Dr. Sci.: He is an Associate Professor in the Department of Informatics at Kyushu University. He obtained B.S. in 1988 in Mathematics, M.S. in 1990 in Information Systems, and Dr. Sci. degree in 1994 all from Kyushu University. His current interests include discovery science, bioinformatics, and pattern matching algorithms. Takeshi Shinohara, Dr. Sci.: He is a Professor in the Department of Artificial Intelligence at Kyushu Institute of Technology. He obtained his B.S. in Mathematics from Kyoto University in 1980, and his Dr. Sci. degree from Kyushu University in 1986. His research interests are in Computational/Algorithmic Learning Theory, Information Retrieval, and Approximate Retrieval of Multimedia Data.     

Algebraic retrieval of fragmentarily indexed video

When dealing with long video data, the task of identifying and indexing all meaningful subintervals that become answers to some queries is infeasible. It is infeasible not only when done by hand but even when done by using latest automatic video indexing techniques. Whether manually or automatically, it is only fragmentary video intervals that we can identify in advance of any database usage. Our goal is to develop a framework for retrieving meaningful intervals from such fragmentarily indexed video data. We propose a set of algebraic operations that includes ourglue join operations, with which we can dynamically synthesize all the intervals that are conceivably relevant to a given query. In most cases, since these operations also produce irrelevant intervals, we also define variousselection operations that are useful in excluding them from the answer set. We also show the algebraic properties possessed by those operations, which establish the basis of an algebraic query optimization. Katsumi Tanaka, D. Eng.: He received his B.E., M.E., and D.Eng. degrees in information science from Kyoto University, in 1974, 1976, and 1981, respectively. Since 1994, he is a professor of the Department of Computer and Systems Engineering and since 1997, he is a professor of the Division of Information and Media Sciences, Graduate School of Science and Technology, Kobe University. His research interests include object-oriented, multimedia and historical databases abd multimedia information systems. He is a member of the ACM, IEEE Computer Society and the Information Processing Society of Japan. Keishi Tajima, D.Sci.: He received his B.S, M.S., and D.S. from the department of information science of University of Tokyo in 1991, 1993, and 1996 respectively. Since 1996, he is a Research Associate in the Department of Computer and Systems Engineering at Kobe University. His research interests include data models for non-traditional database systems and their query languages. He is a member of ACM, ACM SIGMOD, Information Processing Society of Japan (IPSJ), and Japan Society for Software Science and Technology (JSSST). Takashi Sogo, M.Eng.: He received B.E. and M.E. from the Department of Computer and Systems Engineering, Kobe University in 1998 and 2000, respectively. Currently, he is with USAC Systems Co. His research interests include video database systems. Sujeet Pradhan, D.Eng.: He received his BE in Mechanical Engineering from the University of Rajasthan, India in 1988, MS in Instrumentation Engineering in 1995 and Ph.D. in Intelligence Science in 1999 from Kobe University, Japan. Since 1999 May, he is a lecturer of the Department of Computer Science and Mathematics at Kurashiki University of Science and the Arts, Japan. A JSPS (Japan Society for the Promotion of Science) Research Fellow during the period between 1997 and 1999, his research interests include video databases, multimedia authoring, prototypebased languages and semi-structured databases. Dr. Pradhan is a member of Information Processing Society of Japan.     

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).     

Music composition by interaction between human and computer

This paper aims at constructing a music composition system that composes music by the interaction between human and a computer. Even users without special musical knowledge can compose 16-bar musical works with one melody part and some backing parts using this system. The interactive Genetic Algorithm is introduced to music composition so that users’ feeling toward music is reflected in the composed music. One chromosome corresponds to 4-bar musical work information. Users participate in music composition by evaluating composed works after GA operators such as crossover, mutation, virus infection are applied to chromosomes based on the evaluation results. From the experimental results, it is found that the users’ evaluation values become high over the progress of generations. That is, the system can compose 16-bar musical works reflecting users’ feeling. Muneyuki Unehara: He received his M.S. in Engineering in 2002 from Institute of Science and Engineering, University of Tsukuba. Currently, he is a Ph.D. candidate of Graduate School of Systems and Information Engineering, University of Tsukuba. His research interests include the construction of intelligent systems by considering soft computing techniques and human interface. Takehisa Onisawa, Ph.D.: He received Dr.Eng. in Systems Science in 1986 from Tokyo Institute of Technology. Currently, he is a Professor in the Graduate School of Systems and Information Engineering, University of Tsukuba. His research interests include applications of soft computing techniques to human centered systems thinking. He is a member of IEEE and IFSA.     

Program transformation system based on generalized partial computation

Generalized Partial Computation (GPC) is a program transformation method utilizing partial information about input data, abstract data types of auxiliary functions and the logical structure of a source program. GPC uses both an inference engine such as a theorem prover and a classical partial evaluator to optimize programs. Therefore, GPC is more powerful than classical partial evaluators but harder to implement and control. We have implemented an experimental GPC system called WSDFU (Waseda Simplify-Distribute-Fold-Unfold). This paper demonstrates the power of the program transformation system as well as its theorem prover and discusses some future works. Yoshihiko Futamura, Ph.D.: He is Professor of Department of Information and Computer Science and the director of the Institute for Software Production Technology (ISPT) of Waseda University. He received his BS in mathematics from Hokkaido University in 1965, MS in applied mathematics from Harvard University in 1972 and Ph.D. degree from Hokkaido University in 1985. He joined Hitachi Central Research Laboratory in 1965 and moved to Waseda University in 1991. He was a visiting professor of Uppsala University from 1985 to 1986 and a visiting scholar of Harvard University from 1988 to 1989. Automatic generation of computer programs and programming methodology are his main research fields. He is the inventor of the Futamura Projections in partial evaluation and ISO8631 PAD (Problem Analysis Diagram). Zenjiro Konishi: He is a visiting lecturer of Institute for Software Production Technology, Waseda University. He received his M. Sc. degree in mathematics from Waseda University in 1995. His research interests include automated theorem proving. He received JSSST Takahashi Award in 2001. He is a member of JSSST and IPSJ. Robert Glück, Ph.D., Habil.: He is an Associate Professor of Computer Science at the University of Copenhagen. He received his Ph.D. and Habilitation (venia docendi) from the Vienna University of Technology in 1991 and 1997. He was research assistant at the City University of New York and received twice the Erwin-Schrodinger-Fellowship of the Austrian Science Foundation (FWF). After being an Invited Fellow of the Japan Society for the Promotion of Science (JSPS), he is now funded by the PRESTO21 program for basic research of the Japan Science and Technology Corporation (JST) and located at Waseda University in Tokyo. His main research interests are advanced programming languages, theory and practice of program transformation, and metaprogramming.     

An approach to discovering risks in development process of large and complex systems

When building a large and complex system, such as satellites, all sorts of risks have to be managed if it were to be successful. For risks in the design of an artifact, various reliability analysis techniques such as FTA or FMEA have been employed in the engineering domain. However, risks exist as well in the development process, and they could result in a failure of the system. In this paper, we present an approach to discovering risks in development process by collecting and organizing information produced during development process at low cost. We describe a prototype system called IDIMS, and show how it can be used to discover risks from e-mail communications between developers. The motivation of our work is to overcome thecapture bottleneck problem, and utilize now wasted information to improve development process. Yoshikiyo Kato: He received his B. Eng. (1998) and M.Eng. (2000) degrees in aeronautics and astronautics from The University of Tokyo. From September 1998 to July 1999, he was an exchange student at Department of Computer Science and Engineering of University of California, San Diego, and worked on software engineering tools. From May 2001 to July 2002, he was a research assistant at National Institute of Informatics (Japan). He is currently a Ph.D. student at Department of Advanced Interdisciplinary Studies of the University of Tokyo. His research interests include knowledge management, CSCW, HCI and software engineering He is a member of AAAI and JSAI. Takahiro Shirakawa: He received his B.Eng. (2000) and M.Eng. (2002) degrees in aeronautics and astronautics from the University of Tokyo. He is currently an assistant examiner at Japan Patent Office. Kohei Taketa: He received his B.Eng. (2000) and M.Eng. (2002) degrees in aeronautics and astronautics from the University of Tokyo. He is currently a software engineer at NTT Data Corp. Koichi Hori, Dr.Eng.: He received B.Eng, M.Eng, and Dr.Eng. degrees in electronic engineering from the University of Tokyo, Japan, in 1979, 1981, and 1984, respectively. In 1984, he joined National Institute of Japanese Literature where he developed AI systems for literature studies. Since 1988, he has been with the U University of Tokyo. He is currently a professor with Department of Advanced Interdisciplinary Studies, The University of Tokyo. From September 1989 to January 1990, he also held a visiting position at University of Compiegne, France. His current research interests include AI technology for supporting human creative activities, cognitive engineering, and Intelligent CAD systems. He is a member of IEEE, ACM, IEICE, IPSJ, JSAI, JSSST and JCSS.     

Circular attribute grammars with remote attribute references and their evaluators

Attribute grammars (AGs) are a suitable formalism for the development of language processing systems. However, for languages including unrestricted labeled jumps, such as “goto” in C, the optimizers in compilers are difficult to write in AGs. This is due to two problems that few previous researchers could deal with simultaneously, i.e., references of attribute values on distant nodes and circularity in attribute dependency. This paper proposescircular remote attribute grammars (CRAGs), an extension of AGs that allows (1) direct relations between two distant attribute instances through pointers referring to other nodes in the derivation tree, and (2) circular dependencies, under certain conditions including those that arise from remote references. This extension gives AG programmers a natural means of describing language processors and programming environments for languages that include any type of jump structure. We also show a method of constructing an efficient evaluator for CRAGs called amostly static evaluator. The performance of the proposed evaluator has been measured and compared with dynamic and static evaluators. Akira Sasaki: He is a research fellow of the Advanced Clinical Research Center in the Institute of Medical Science at the University of Tokyo. He received his BSc and MSc from Tokyo Institute of Technology, Japan, in 1994 and 1996, respectively. His research interests include programming languages, programming language processors and programming environments, especially compiler compilers, attribute grammars and systematic debugging. He is a member of the Japan Society for Software Science and Technology. Masataka Sassa, D.Sc.: He is Professor of Computer Science at Tokyo Institute of Technology. He received his BSc, MSc and DSc from the University of Tokyo, Japan, in 1970, 1972 and 1978, respectively. His research interests include programming languages, programming language processors and programming environments, currently he is focusing on compiler optimization, compiler infrastructure, attribute grammars and systematic debugging. He is a member of the ACM, IEEE Computer Society, Japan Society for Software Science and Technology, and Information Processing Society of Japan.     

A New Approach to Humanitarian Demining

Landmines can deprive whole areas of valuable resources, and continue to kill and cause injuries years after the end of armed conflicts. Armored vehicles are used for mine clearance, but with limited reliability. The final inspection of minefields is still performed by human deminers exposed to potentially fatal accidents. The aim of this research is to introduce automation as a way to improve the final level of humanitarian demining. This paper addresses mobility and manipulation, while sensing, communication and visualization shall be discussed in detail in a subsequent paper. After analyzing the merits and limitations of previous works, a new approach to tele-operated demining is considered, using off-road buggies equipped with combustion engines, and taking into account actual field requirements. Control of the automated buggies on rough terrain is also discussed, as well as the development of a new weight-balanced manipulator for landmine clearance operations.Paulo Debenest received the B. Eng. degree in mechanical engineering (major in automation and systems) from Polytechnic School of the University of São Paulo (EPUSP), Brazil, in 1998, and the M. Eng. degree in mechanical and aerospace engineering from Tokyo Institute of Technology (Tokyo Tech), Japan, in 2002. He is currently working toward the Ph.D. degree in mechanical science engineering at Tokyo Tech and member of IEEE. His current research activities include development of demining robots and mechanical design of machines for field applications.Edwardo F. Fukushima is an assistant professor in the Department of Mechanical and Aerospace Engineering at Tokyo Institute of Technology (Tokyo Tech). He received the B. Eng. degree in electric engineering (major in electronics and telecommunications) from Federal Center of Technological Education of Paraná (CEFET-PR), Brazil, in 1989, and M. Eng. degree in mechanical science engineering from Tokyo Tech in 1993. In 1994 he became a research associate in the same institute. During Sept.–Dec. 2001 he has been a Visiting Researcher at Stanford University, and during Aug.–Sept. 2004 Visiting Scientist at University of Zurich. He is also member of RSJ. His current research activities include development of demining robots, design of controllers for intelligent robots, and development of new brushless motors and drives.Yuki Tojo is a masters course student in the Department of Mechanical and Aerospace Engineering at Tokyo Institute of Technology (Tokyo Tech). He received the B. Eng. degree in mechanical and aerospace engineering from Tokyo Tech in 2003. His research interests include design and control of weight-compensated manipulator on mobile platform. He is also member of RSJ.Shigeo Hirose was born in Tokyo in 1947. He received his B.Eng. Degree with First Class Honors in Mechanical Engineering from Yokohama National University in 1971, and his M. Eng. and Ph.D. Eng. Degrees in Control Engineering from Tokyo Institute of Technology in 1973 and 1976, respectively. From 1976 to 1979 he was a Research Associate, and from 1979 to 1992 an Associate Professor. Since 1992 he has been a Professor in the Department of Mechanical and Aerospace Engineering at the Tokyo Institute of Technology. Since 2002, he has been Honorary Professor in Shengyang Institute of Technology, the Chinese Academy of Sciences. Fellow of JSME and IEEE. He is engaged in creative design of robotic systems. Prof. Hirose has been awarded more than twenty prizes.     

User-independent gesture recognition by relative-motion extraction and discriminant analysis

We propose a new method for user-independent gesture recognition from time-varying images. The method uses relative-motion extraction and discriminant analysis for providing online learning/recognition abilities. Efficient and robust extraction of motion information is achieved. The method is computationally inexpensive which allows real-time operation on a personal computer. The performance of the proposed method has been tested with several data sets and good generalization abilities have been observed: it is robust to changes in background and illumination conditions, to users’ external appearance and changes in spatial location, and successfully copes with the non-uniformity of the performance speed of the gestures. No manual segmentation of any kind, or use of markers, etc. is necessary. Having the above-mentioned features, the method could be successfully used as a part of more refined human-computer interfaces. Bisser R. Raytchev: He received his BS and MS degrees in electronics from Tokai University, Japan, in 1995 and 1997 respectively. He is currently a doctoral student in electronics and information sciences at Tsukuba University, Japan. His research interests include biological and computer vision, pattern recognition and neural networks. Osamu Hasegawa, Ph.D.: He received the B.E. and M.E. degrees in Mechanical Engineering from the Science University of Tokyo, in 1988, 1990 respectively. He received Ph.D. degree in Electrical Engineering from the University of Tokyo, in 1993. Currently, he is a senior research scientist at the Electrotechnical Laboratory (ETL), Tsukuba, Japan. His research interests include Computer Vision and Multi-modal Human Interface. Dr. Hasegawa is a member of the AAAI, the Institute of Electronics, Information and Communication Engineers, Japan (IEICE), Information Processing Society of Japan and others. Nobuyuki Otsu, Ph.D.: He received B.S., Mr. Eng. and Dr. Eng. in Mathematical Engineering from the University of Tokyo in 1969, 1971, and 1981, respectively. Since he joined ETL in 1971, he has been engaged in theoretical research on pattern recognition, multivariate data analysis, and applications to image recognition in particular. After taking positions of Head of Mathematical Informatics Section (since 1985) and ETL Chief Senior Scientist (since 1990), he is currently Director of Machine Understanding Division since 1991, and concurrently a professor of the post graduate school of Tsukuba University since 1992. He has been involved in the Real World Computing program and directing the R&D of the project as Head of Real World Intelligence Center at ETL. Dr. Otsu is members of Behaviormetric Society and IEICE of Japan, etc.     

An Efficient Support Vector Machine Learning Method with Second-Order Cone Programming for Large-Scale Problems

In this paper we propose a new fast learning algorithm for the support vector machine (SVM). The proposed method is based on the technique of second-order cone programming. We reformulate the SVM's quadratic programming problem into the second-order cone programming problem. The proposed method needs to decompose the kernel matrix of SVM's optimization problem, and the decomposed matrix is used in the new optimization problem. Since the kernel matrix is positive semidefinite, the dimension of the decomposed matrix can be reduced by decomposition (factorization) methods. The performance of the proposed method depends on the dimension of the decomposed matrix. Experimental results show that the proposed method is much faster than the quadratic programming solver LOQO if the dimension of the decomposed matrix is small enough compared to that of the kernel matrix. The proposed method is also faster than the method proposed in (S. Fine and K. Scheinberg, 2001) for both low-rank and full-rank kernel matrices. The working set selection is an important issue in the SVM decomposition (chunking) method. We also modify Hsu and Lin's working set selection approach to deal with large working set. The proposed approach leads to faster convergence. Rameswar Debnath is a Ph.D candidate at the University of Electro-Communications, Tokyo, Japan and also a lecturer of the Computer Science & Engineering Discipline at Khulna University, Bangladesh. He received the bachelor's degree in computer science and engineering from Khulna University in 1997 and masters of engineering degree in communication and systems from the University of Electro-Communications in 2002. His research interests include support vector machines, artificial neural networks, pattern recognition, and image processing. Masakazu Muramatsu is an associate professor of the Department of Computer Science at the University of Electro-Communications, Japan. He received a bachelor's degree from the University of Tokyo in 1989, master's degree in engineering from University of Tokyo in 1991, and Ph.D from the Graduate University for Advanced Studies in 1994. He was an assistant professor of the Department of Mechanical Engineering at Sophia University from 1994 to 2000, when he moved to the current university. His research interests include mathematical programming, second-order cone programming and its application to machine learning. Haruhisa Takahashi was born in Shizuoka Prefecture Japan, on March 31, 1952. He graduated from the University of Electro-Communications. He received the Dr Eng. degree from Osaka University. He was a faculty member of the Department of Computer Science and Engineering at Toyohashi University of Technology from 1980 to 1986. Since 1986, he has been with the University of Electro-Communications where he is currently professor of the Department of Information and Communication Engineering. He was previously engaged in the fields of nonlinear network theory, queueing theory and performance evaluation of communication systems. His current research includes learning machines, artificial neural networks, and cognitive science.     

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.     

GigaE PM: a high performance communication facility using a Gigabit Ethernet

A high performance communication facility, called theGigaE PM, has been designed and implemented for parallel applications on clusters of computers using a Gigabit Ethernet. The GigaE PM provides not only a reliable high bandwidth and low latency communication, but also supports existing network protocols such as TCP/IP. A reliable communication mechanism for a parallel application is implemented on the firmware on a NIC while existing network protocols are handled by an operating system kernel. A prototype system has been implemented using an Essential Communications Gigabit Ethernet card. The performance results show that a 58.3 μs round trip time for a four byte user message, and 56.7 MBytes/sec bandwidth for a 1,468 byte message have been achieved on Intel Pentium II 400 MHz PCs. We have implemented MPICH-PM on top of the GigaE PM, and evaluated the NAS parallel benchmark performance. The results show that the IS class S performance on the GigaE PM is 1.8 times faster than that on TCP/IP. Shinji Sumimoto: He is a Senior Researcher of Parallel and Distributed System Software Laboratory at Real World Computing Partnership, JAPAN. He received BS degree in electrical engineering from Doshisha University. His research interest include parallel and distributed systems, real-time systems, and high performance communication facilities. He is a member of Information Processing Society of Japan. Hiroshi Tezuka: He is a Senior Researcher of Parallel and Distributed System Software Laboratory at Real World Computing Partnership, JAPAN. His research interests include real-time systems and operating system kernel. He is a member of the Information Processing Society of Japan, and Japan Society for Software Science and Technology. Atsushi Hori, Ph.D.: He is a Senior Researcher of Parallel and Distributed System Software Laboratory at Real World Computing Partnership, JAPAN. His current research interests include parallel operating system. He received B.S. and M.S. degrees in Electrical Engineering from Waseda University, and received Ph.D. from the University of Tokyo. He worked as a researcher in Mitsubishi Research Institute from 1981 to 1992. Hiroshi Harada: He is a Senior Researcher of Parallel and Distributed System Software Laboratory at Real World Computing Partnership, JAPAN. His research interests include distributed/parallel systems and distributed shared memory. He received BS degree in physics from Science University of Tokyo. He is a member of ACM and Information Processing Society of Japan. Toshiyuki Takahashi: He is a Researcher at Real World Computing Partnership since 1998. He received his B.S. and M.S. from the Department of Information Sciences of Science University of Tokyo in 1993 and 1995. He was a student of the Information Science Department of the University of Tokyo from 1995 to 1998. His current interests are in meta-level architecture for programming languages and high-performance software technologies. He is a member of Information Processing Society of Japan. Yutaka Ishikawa, Ph.D.: He is the chief of Parallel and Distributed System Software Laboratory at Real World Computing Partnership, JAPAN. He is currently temporary retirement from Electrotechnical Laboratory, MITI. His research interests include distributed/parallel systems, object-oriented programming languages, and real-time systems. He received the B.S., M.S. and Ph.D degrees in electrical engineering from Keio University. He is a member of the IEEE Computer Society, ACM, Information Processing Society of Japan, and Japan Society for Software Science and Technology.     

A portable approach to dynamic optimization in run-time specialization

This paper proposes arun-time bytecode specialization (BCS) technique that analyzes programs and generates specialized programs at run-time in an intermediate language. By using an intermediate language for code generation, a back-end system canoptimize the specialized programs after specialization. The system uses Java virtual machine language (JVML) as the intermediate language, which allows the system to easily achieve practicalportability and to use existing sophisticated just-in-time (JIT) compilers as its back-end. The binding-time analysis algorithm is based on a type system, and covers a non-object-oriented subset of JVML. The specializer generates programs on a per-instruction basis, and can performmethod inlining at run-time. Our performance measurements show that a non-trivial application program specialized at run-time by BCS runs approximately 3–4 times faster than the unspecialized one. Despite the large overhead of JIT compilation of specialized code, we observed that the overall performance of the application can be improved. This paper is an extended version of “A Portable Approach to Generating Optimized Specialized Code”, inProceedings of Second Symposium on Programs as Data Objects (PADO-II), Lecture Notes in Computer Science, vol. 2053, pp. 138–154, Aarhus, Denmark, May 2001.²³) Hidehiko Masuhara, D.Sc.: He is an Assistant Professor at Department of Graphics and Computer Science, Graduate School of Arts and Sciences, University of Tokyo. He received his B.S., M.S. and D.Sc. degrees from Department of Information Science, University of Tokyo in 1992, 1994, and 1999, respectively. His research interests are in programming languages, especially in mechanisms to support flexible and efficient computation such as dynamic optimization and reflection. He received the best-paper award from Information Processing Society of Japan in 1996. Akinori Yonezawa, Ph.D.: He is a Professor of computer science at Department of Computer Science, University of Tokyo. He received Ph.D. in Computer Science from the Massachusetts Institute of Technology in 1977. His current major research interests are in the areas of concurrent/parallel computation models, programming languages, object-oriented computing, and distributed computing. He is the designer of an object-oriented concurrent language ABCL/1 and the editor of several books and served as an associate editor of ACM Transaction of Programming Languages and Systems (TOPLAS). Since 1998, he has been an ACM Fellow.     

A Framework for Design Tradeoffs

Designs almost always require tradeoffs between competing design choices to meet system requirements. We present a framework for evaluating design choices with respect to meeting competing requirements. Specifically, we develop a model to estimate the performance of a UML design subject to changing levels of security and fault-tolerance. This analysis gives us a way to identify design solutions that are infeasible. Multi-criteria decision making techniques are applied to evaluate the remaining feasible alternatives. The method is illustrated with two examples: a small sensor network and a system for controlling traffic lights. Dr. Anneliese Amschler Andrews is Professor and Chair of the Department of Computer Science at the University of Denver. Before that she was the Huie Rogers Endowed Chair in Software Engineering at Washington State University. Dr. Andrews is the author of a text book and over 130 articles in the area of Software Engineering, particularly software testing and maintenance. Dr. Andrews holds an MS and PhD from Duke University and a Dipl.-Inf. from the Technical University of Karlsruhe. She served as Editor-in-Chief of the IEEE Transactions on Software Engineering. She has also served on several other editorial boards including the IEEE Transactions on Reliability, the Empirical Software Engineering Journal, the Software Quality Journal, the Journal of Information Science and Technology, and the Journal of Software Maintenance. She was Director of the Colorado Advanced Software Institute from 1995 to 2002. CASI's mission was to support technology transfer research related to software through collaborations between industry and academia. Ed Mancebo studied software engineering at Milwaukee School of Engineering and computer science at Washington State University. His masters thesis explored applying systematic decision making methods to software engineering problems. He is currently a software developer at Amazon.com. Dr. Per Runeson is a professor in software engineering at Lund University, Sweden. His research interests include methods to facilitate, measure and manage aspects of software quality. He received a PhD from Lund University in 1998 and has industrial experience as a consulting expert. He is a member of the editorial board of Empirical Software Engineering and several program committees, and currently has a senior researcher position funded by the Swedish Research Council. Robert France is currently a Full Professor in the Department of Computer Science at Colorado State University. His research interests are in the area of Software Engineering, in particular formal specification techniques, software modeling techniques, design patterns, and domain-specific modeling languages. He is an Editor-in-Chief of the Springer journal on Software and System Modeling (SoSyM), and is a Steering Committee member and past Steering Committee Chair of the MoDELS/UML conference series. He was also a member of the revision task forces for the UML 1.x standards.     

Information gathering and searching approaches on the Web

The information accessible through the Internet is increasing explosively as the Web is getting more and more widespread. In this situation, the Web is indispensable information resource for both of information gathering and information searching. Though traditional information retrieval techniques have been applied to information gathering and searching in the Web, they are insufficient for this new form of information source. Fortunately some Al techniques can be straightforwardly applicable to such tasks in the Web, and many researchers are trying this approach. In this paper, we attempt to describe the current state of information gathering and searching technologies in the Web, and the application of AI techniques in the fields. Then we point out limitations of these traditional and AI approaches and introduce two aapproaches: navigation planning and a Mondou search engine for overcoming them. The navigation planning system tries to collect systematic knowledge, rather than Web pages, which are only pieces of knowledge. The Mondou search engine copes with the problems of the query expansion/modification based on the techniques of text/web mining and information visualization. Seiji Yamada, Dr. Eng.: He received the B.S., M.S. and Ph.S. degrees in control engineering and artificial intelligence from Osaka University, Osaka, Japan, in 1984, 1986 and 1989, respectively. From 1989 to 1991, he served as a Research Associate in the Department of Control Engineering at Osaka University. From 1991 to 1996, he served as a Lecturer in the Institute of Scientific and Industrial Research at Osaka University. In 1996, he joined the Department of Computational Intelligence and Systems Science at Tokyo Institute of Technology, Yokohama, Japan, as an Associate Professor. His research interests include artificial intelligence, planning, machine learning for a robotics, intelligent information retrieval in the WWW, human computer interaction, He is a member of AAAI, IEEE, JSAI, RSJ and IEICE. Hiroyuki Kawano, Dr.Eng.: He is an Associate Professor at the Department of Systems Science, Graduate School of Informatics, Kyoto University, Japan. He obtained his B.Eng. and M.Eng. degrees in Applied Mathematics and Physics, and his Dr.Eng. degree in Applied Systems Science from Kyoto University. His research interests are in advanced database technologies, such as data mining, data warehousing, knowledge discovery and web search engine (Mondou). He has served on the program committees of several conferences in the areas of Data Base Systems, and technical committes of advanced information systems.     

Oscillation amplitude-controlled resonant accelerometer design using a reference tracking automatic gain control

In this paper, it is presented a novel approach for the self-sustained resonant accelerometer design, which takes advantages of an automatic gain control in achieving stabilized oscillation dynamics. Through the proposed system modeling and loop transformation, the feedback controller is designed to maintain uniform oscillation amplitude under dynamic input accelerations. The fabrication process for the mechanical structure is illustrated in brief. Computer simulation and experimental results show the feasibility of the proposed accelerometer design, which is applicable to a control grade inertial sense system. Recommended by Editorial Board member Dong Hwan Kim under the direction of Editor Hyun Seok Yang. This work was supported by the BK21 Project ST·IT Fusion Engineering program in Konkuk University, 2008. This work was supported by the Korea Foundation for International Cooperation of Science & Technology(KICOS) through a grant provided by the Korean Ministry of Education, Science & Technology(MEST) in 2008 (No. K20601000001). Authors also thank to Dr. B.-L. Lee for the help in structure manufacturing. Sangkyung Sung is an Assistant Professor of the Department of Aerospace Engineering at Konkuk University, Korea. He received the M.S and Ph.D. degrees in Electrical Engineering from Seoul National University in 1998 and 2003, respectively. His research interests include inertial sensors, avionic system hardware, navigation filter, and intelligent vehicle systems. Chang-Joo Kim is an Assistant Professor of the Department of Aerospace Engineering at Konkuk University, Korea. He received the Ph.D. degree in Aeronautical Engineering from Seoul National University in 1991. His research interests include nonlinear optimal control, helicopter flight mechanics, and helicopter system design. Young Jae Lee is a Professor of the Department of Aerospace Engineering at Konkuk University, Korea. He received the Ph.D. degree in Aerospace Engineering from the University of Texas at Austin in 1990. His research interests include integrity monitoring of GNSS signal, GBAS, RTK, attitude determination, orbit determination, and GNSS related engineering problems. Jungkeun Park is an Assistant Professor of the Department of Aerospace Engineering at Konkuk University. Dr. Park received the Ph.D. in Electrical Engineering and Computer Science from the Seoul National University in 2004. His current research interests include embedded real-time systems design, real-time operating systems, distributed embedded real-time systems and multimedia systems. Joon Goo Park is an Assistant Professor of the Department of Electronic Engineering at Gyung Book National University, Korea. He received the Ph.D. degree in School of Electrical Engineering from Seoul National University in 2001. His research interests include mobile navigation and adaptive control.     

The superstructure toward open bioinformatics grid

The grid design strongly depends on not only a network infrastructure but also a superstructure, that is, a social structure of virtual organizations where people trust each other, share resources and work together. Open Bioinformatics Grid (OBIGrid) is a grid aimed at building a cooperative bioinformatics environment for computer sicentists and biologists. In October 2003, OBIGrid consisted of 293 nodes with 492 CPUs provided by 27 sites at universities, laboratories and other enterprises, connected by a virtual private network over the Internet. So many organizations have participated because OBIGrid has been conscious of constructing a superstructure on a grid as well as a grid infrastructure. For the benefit of OBIGrid participants, we have developed a series of life science application services: an open bioinformatics environment (OBIEnv), a scalable genome database (OBISgd), a genome annotation system (OBITco), a biochemical network simulator (OBIYagns), and to name a few. Akihiko Konagaya, Dr.Eng.: He is Project Director of Bioinformatics Group, RIKEN Genomic Sciences Center. He received his B.S. and M.S. from Tokyo Institute of Technology in 1978 and 1980 in Informatics Science, and joined NEC Corporation in 1980, Japan Advanced Institute of Science and Technology in 1997, RIKEN GSC in 2003. His research covers wide area from computer architectures to bioinformatics. He has been much involved into the Open Bioinformatics Grid project since 2002. Fumikazu Konishi, Dr.Eng.: He is researcher at Bioinformatics Group, RIKEN Genomic Sciences Center since 2000. He received his M.S. (1996) and Ph.D. (2001) from Tokyo Metropolitan Institute of Technology. He served as an assistant in Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology since 2000. He also works in Structurome Research Group, RIKEN Harima Institute from 2001. His research interests include concurrent engineering, bioinformatics and the Grid. He has deeply affected to the design of OBIGrid. Mariko Hatakeyama, Ph.D.: She recieved her Ph.D. degree from Tokyo University of Agriculture and Technology. She is Research Scientist at Bioinformactis Group, RIKEN Genomic Sciences Center. Her research topics are: microbiology, enzymology and signal transduction of mammalian cells. She is now working on computational simulation of signal transduction systems and on thermophilic bacteria project. Kenji Satou, Ph.D.: He is Associate Professor of School of Knowledge Science at Japan Advanced Institute of Science and Technology. He received B.S., M.E. and Ph.D. degrees from Kyushu University, in 1987, 1989 and 1995 respectively. For each degree, he majored in computer engineering. His research interests have progressed from deductive database application through data mining to Grid computing and natural language processing. His current field of research is bioinformatics. He prefers set-oriented manner of thinking, and usually wonders how he can construct an intelligent-looking system based on large amount of heterogeneous data and computer resources.     

A grid-oriented genetic algorithm framework for bioinformatics

In this paper, we propose a framework for enabling for researchers of genetic algorithms (GAs) to easily develop GAs running on the Grid, named “Grid-Oriented Genetic algorithms (GOGAs)”, and actually “Gridify” a GA for estimating genetic networks, which is being developed by our group, in order to examine the usability of the proposed GOGA framework. We also evaluate the scalability of the “Gridified” GA by applying it to a five-gene genetic network estimation problem on a grid testbed constructed in our laboratory. Hiroaki Imade: He received his B.S. degree in the department of engineering from The University of Tokushima, Tokushima, Japan, in 2001. He received the M.S. degree in information systems from the Graduate School of Engineering, The University of Tokushima in 2003. He is now in Doctoral Course of Graduate School of Engineering, The University of Tokushima. His research interests include evolutionary computation. He currently researches a framework to easily develop the GOGA models which efficiently work on the grid. Ryohei Morishita: He received his B.S. degree in the department of engineering from The University of Tokushima, Tokushima, Japan, in 2002. He is now in Master Course of Graduate School of Engineering, The University of Tokushima, Tokushima. His research interest is evolutionary computation. He currently researches GA for estimating genetic networks. Isao Ono, Ph.D.: He received his B.S. degree from the Department of Control Engineering, Tokyo Institute of Technology, Tokyo, Japan, in 1994. He received Ph.D. of Engineering at Tokyo Institute of Technology, Yokohama, in 1997. He worked as a Research Fellow from 1997 to 1998 at Tokyo Institute of Technology, and at University of Tokushima, Tokushima, Japan, in 1998. He worked as a Lecturer from 1998 to 2001 at University of Tokushima. He is now Associate Professor at University of Tokushima. His research interests include evolutionary computation, scheduling, function optimization, optical design and bioinformatics. He is a member of JSAI, SCI, IPSJ and OSJ. Norihiko Ono, Ph.D.: He received his B.S. M.S. and Ph.D. of Engineering in 1979, 1981 and 1986, respectively, from Tokyo Institute of Technology. From 1986 to 1989, he was Research Associate at Faculty of Engineering, Hiroshima University. From 1989 to 1997, he was an associate professor at Faculty of Engineering, University of Tokushima. He was promoted to Professor in the Department of Information Science and Intelligent Systems in 1997. His current research interests include learning in multi-agent systems, autonomous agents, reinforcement learning and evolutionary algorithms. Masahiro Okamoto, Ph.D.: He is currently Professor of Graduate School of Systems Life Sciences, Kyushu University, Japan. He received his Ph.D. degree in Biochemistry from Kyushu University in 1981. His major research field is nonlinear numerical optimization and systems biology. His current research interests cover system identification of nonlinear complex systems by using evolutional computer algorithm of optimization, development of integrated simulator for analyzing nonlinear dynamics and design of fault-tolerant routing network by mimicking metabolic control system. He has more than 90 peer reviewed publications.