Vamping on Ultrafractal

Prolific fractal artist Michael Sussna has a varied and interdisciplinary academic background, however, as an artist, he is entirely self-taught. He grew up with a mother who painted and he had an extensive collection of art books long before he had an interest in creating art. "Combining that pursuit with my long-standing love for science fiction and the fantastic, my comfort with mathematics and computing, and my deep appreciation for the abstract, the dive into fractal art creation was a natural step for me," he said. Although he's been incredibly prolific over the years, the end is nowhere in sight.     

Simulating authenticated broadcasts to derive simple fault-tolerant algorithms

Fault-tolerant algorithms for distributed systems with arbitrary failures are simpler to develop and prove correct if messages can be authenticated. However, using digital signatures for message authentication usually incurs substantial overhead in communication and computation. To exploit the simplicity provided by authentication without this overhead, we present a broadcast primitive that provides properties of authenticated broadcasts. This gives a methodology for deriving non-authenticated algorithms. Starting with an authenticated algorithm, we replace signed communication with the broadcast primitive to obtain an equivalent non-authenticated algorithm. We have applied this approach to various problems and in each case obtained simpler and more efficient solutions than those previously known.T.K. Srikanth He received the B. Tech. degree in Mechanical Engineering from the Indian Institute of Technology, Madras, in 1981. He received the M.S. and Ph.D. degrees in computer science from Cornell University, in 1985 and 1986, respectively. He is currently a research scientist at XOX Corporation, Ithaca, New York. His research interests include distributed computing, fault-tolerance, and geometric modeling.Sam Toueg He received the B.Sc. Degree in computer science from the Technion, Israel Institute of Technology, in 1976, and the M.S.E., M.A., and Ph.D. degrees in computer science from Princeton University, in 1977, 1978, and 1979, respectively. He spent a post-doctoral year at the IBM Thomas J. Watson Research Center, at Yorktown Heights, in the Systems Analysis and Algorithms division. In 1981 he joined the Department of Computer Science at Cornell University, Ithaca, NY, where he is currently an Associate Professor. His current research interests include distributed computing, faulttolerance, computer networks, and distributed database systems. Dr. Toueg is a member of the Association for Computing Machinery SIGACT and SIGCOMM.Partial support for this work was provided by the National Science Foundation under grant MCS 83-03135     

Teaching new tricks to an old map

Geographic Information Systems (GISs) and digital maps are increasingly available to the computer-using humanities scholar. As a result, questions of data availability and validity are the more crucial. Digital maps may be stored in different formats, both as regards coordinate systems in use and the level of sophistication available for storing geographical information related to the maps. The maps themselves are often under copyright by a national survey agency and the situation in Norway is outlined. Historical sources may often contain geographic references to administrative units that are no longer valid. An example is taken from the University Museum of Antiquities in Oslo. Finally, an example is given of a project where maps from 1880 and 1910 are used in an architectural history project.Espen S. Ore holds a degree in the humanities from the University of Oslo. He has also studied computer science at the universities of Oslo and Bergen. Since 1984 he has been employed at the Norwegian Computing Centre for the Humanities. He has worked mostly with non-latin character sets, computer graphics and multimedia. Since 1993 he has been leading a project on a typology of runic writing based on character forms.     

Perspectives on molecular computing

In 1996, we began a research project on molecular computers under the new program “Research for the Future” funded by the Japan Society for the Promotion of Science. In this paper, we first summarize the research that has been completed in the field of DNA computing and the research problems that must be overcome. We also report some achievements of our research project in the first two years. We then propose a new direction in research towardsautonomous molecular computers, and describe the author’s work on the implementation of state machines using DNA molecules. We finally discuss the future perspectives on molecular computing based on our experiences. Masami Hagiya, Ph.D.: He received M.Sc. from University of Tokyo in 1982, and D.Sc. from Kyoto University in 1988. After the years in Research Institute for Mathematical Sciences, Kyoto University, he returned to University of Tokyo in 1992. He has been working on programming languages, verification and synthesis of programs, and automated deduction. In addition, he is interested in bio-computing since he was involved in the human genome project of Japan. He is currently organizing a project on molecular computing under the “Research for the Future” program of JSPS.     

Information access in multimedia databases based on feature models

With the increasing popularity of the WWW, the main challenge in computer science has become content-based retrieval of multimedia objects. Access to multimedia objects in databases has long been limited to the information provided in manually assigned keywords. Now, with the integration of feature-detection algorithms in database systems software, content-based retrieval can be fully integrated with query processing. We describe our experimentation platform under development, making database technology available to multimedia. Our approach is based on the new notion of feature databases. Its architecture fully integrates traditional query processing and content-based retrieval techniques. Arjen P. de Vries, Ph.D.: He received his Ph.D. in Computer Science from the University of Twente in 1999, on the integration of content management in database systems. He is especially interested in the new requirements on the design of database systems to support content-based retrieval in multimedia digital libraries. He has continued to work on multimedia database systems as a postdoc at the CWI in Amsterdam as well as University of Twente. Menzo Windhouwer: He received his MSc in Computer Science and Management from the University of Amsterdam in 1997. Currently he is working in the CWI Database Research Group on his Ph.D., which is concerned with multimedia indexing and retrieval using feature grammars. Peter M.G. Apers, Ph.D.: He is a full professor in the area of databases at the University of Twente, the Netherlands. He obtained his MSc and Ph.D. at the Free University, Amsterdam, and has been a visiting researcher at the University of California, Santa Cruz and Stanford University. His research interests are query optimization in parallel and distributed database systems to support new application domains, such as multimedia applications and WWW. He has served on the program committees of major database conferences: VLDB, SIGMOD, ICDE, EDBT. In 1996 he was the chairman of the EDBT PC. In 2001 he will, for the second time, be the chairman of the European PC of the VLDB. Currently he is coordinating Editor-in-Chief of the VLDB Journal, editor of Data & Knowledge Engineering, and editor of Distributed and Parallel Databases. Martin Kersten, Ph.D.: He received his PhD in Computer Science from the Vrije Universiteit in 1985 on research in database security, whereafter he moved to CWI to establish the Database Research Group. Since 1994 he is professor at the University of Amsterdam. Currently he is heading a department involving 60 researchers in areas covering BDMS architectures, datamining, multimedia information systems, and quantum computing. In 1995 he co-founded Data Distilleries, specialized in data mining technology, and became a non-executive board member of the software company Consultdata Nederland. He has published ca. 130 scientific papers and is member of the editorial board of VLDB journal and Parallel and Distributed Systems. He acts as a reviewer for ESPRIT projects and is a trustee of the VLDB Endowment board.     

S.A. Lebedev and the birth of Soviet computing

In this article, we study the life and work of Sergei Alekseevich Lebedev, one of the world's pioneers in digital computing. Lebedev, working in Kiev, built the MESM, the first Soviet electronic digital stored-program computer (1947-1951). In 1950, Lebedev moved to Moscow, where he soon became the director of the newly established Institute of Precise Mechanics and Computer Technology. There he developed a long line of digital computers based on his work on the MESM. We examine in detail the first three of these machines: the BESM, the BESM-2 and the M-20. Lebedev achieved considerable success not only in the development of indigenous Soviet computers, but in the training of engineers, the founding of computer centers, and the establishment and nuturing of Soviet computing as a scientific discipline     

A separation method for DNA computing based on concentration control

A separation method for DNA computing based on concentration control is presented. The concentration control method was earlier developed and has enabled us to use DNA concentrations as input data and as filters to extract target DNA. We have also applied the method to the shortest path problems, and have shown the potential of concentration control to solve large-scale combinatorial optimization problems. However, it is still quite difficult to separate different DNA with the same length and to quantify individual DNA concentrations. To overcome these difficulties, we use DGGE and CDGE in this paper. We demonstrate that the proposed method enables us to separate different DNA with the same length efficiently, and we actually solve an instance of the shortest path problems. Masahito Yamamoto, Ph.D.: He is associate professor of information engineering at Hokkaido University. He received Ph.D. from the Graduate School of Engineering, Hokkaido University in 1996. His current research interests include DNA computing based the laboratory experiments. He is a member of Operations Research Society of Japan, Japanese Society for Artificial Intelligence, Information Processing Society of Japan etc. Atsushi Kameda, Ph.D.: He is the research staff of Japan Science and Technology Corporation, and has participated in research of DNA computing in Hokkaido University. He received his Ph.D. from Hokkaido University in 2001. For each degree he majored in molecular biology. His research theme is about the role of polyphosphate in the living body. As one of the researches relevant to it, he constructed the ATP regeneration system using two enzyme which makes polyphosphate the phosphagen. Nobuo Matsuura: He is a master course student of Division of Systems and Information Engineering of Hokkaido University. His research interests relate to DNA computing with concentration control for shortest path problems, as a means of solution of optimization problems with bimolecular. Toshikazu Shiba, Ph.D.: He is associate, professor of biochemical engineering at Hokkaido University. He received his Ph.D. from Osaka University in 1991. He majored in molecular genetics and biochemistry. His research has progressed from bacterial molecular biology (regulation of gene expression of bacterial cells) to tissue engineering (bone regeneration). Recently, he is very interested in molecular computation and trying to apply his biochemical idea to information technology. Yumi Kawazoe: She is a master course student of Division of Molecular Chemistry of Hokkaido University. Although her major is molecular biology, she is very interested in molecular computation and bioinformatics. Azuma Ohuchi, Ph.D.: He is professor of Information Engineering at the University of Hokkaido, Sapporo, Japan. He has been developing a new field of complex systems engineering, i.e., Harmonious Systems Engineering since 1995. He has published numerous papers on systems engineering, operations research, and computer science. In addition, he is currently supervising projects on DNA computing, multi-agents based artificial market systems, medical informatics, and autonomous flying objects. He was awarded “The 30th Anniversary Award for Excellent Papers” by the Information Processing Society of Japan. He is a member of Operations Research Society of Japan, Japanese Society for Artificial Intelligence, Information Processing Society of Japan, Japan Association for Medical Informatics, IEEE Computer Society, IEEE System, Man and Cybernetics Society etc. He received PhD from Hokkaido University in 1976.     

并行系统中时间偏移机制的典型应用算法分析

像其它许多领域一样,时间偏移机制在并行计算中也得到了充分的应用。实际上,并行计算并不能真正做到让各处理机都完全无时差地实现"并行"运算。由于各任务间存在数据依赖性,使得一些处理机不得不处于间歇等待状态,直至数据到达为止。通过一个典型的并行算法实例对时间偏移机制的作用过程作了详解,直观地描述了实现并行计算的实质,以便为用户在理解并行行为和设计并行程序时提供一些参考。     

A new method of embedded fourth order with four stages to study raster CNN simulation

A new Runge-Kutta （PK） fourth order with four stages embedded method with error control is presentea m this paper for raster simulation in cellular neural network （CNN） environment. Through versatile algorithm, single layer/raster CNN array is implemented by incorporating the proposed technique. Simulation results have been obtained, and comparison has also been carried out to show the efficiency of the proposed numerical integration algorithm. The analytic expressions for local truncation error and global truncation error are derived. It is seen that the RK-embedded root mean square outperforms the RK-embedded Heronian mean and RK-embedded harmonic mean.     

The myth of the educational computer

To dispel the delusion that the computer by itself can educate, the author believes computer professionals need to press for reforms that properly exploit digital technology in the classroom. He feels that the current computer-as-educator delusion is harmful and yet seems to go largely unquestioned, even by computing professionals. Despite the fact that good technical work is being done to develop courseware, what seems to be missing is a full appreciation of the relationship between technology and education. Literature on the subject suggests that much of the work done by computing professionals is isolated from what generally goes on in schools. The computing profession's focus seems to been how to find smart ways to use computers in the classroom, not on how to solve the really important problems deplored in the educational literature. The author claims that if the profession was doing all its educational computing work in close partnership with professional educators, more computing professionals would be pressing for the reforms needed to exploit digital technology properly. The primary responsibility for what happens in schools must remain with the professional educators. But educators need the support of the computing profession to ensure that they are fully and properly trained and supported in their use of computers     

Algebraic specification and proof of a distributed recovery algorithm

An algebraic specification is given of an algorithm for recovery from catastrophe by a deterministic process. A second version of the algorithm also includes check-points. The algorithms are formulated in the notations of Communicating Sequential Processes (Hoare 1985) and the proofs of correctness are conducted wholly by application of algebraic laws (together with the unique fixed point theorem). He Jifeng received the B.S. degree in mathematics from Fudan University, Shanghai (China), in 1965. Then he taught in the department of mathematics, Shanghai Normal University. In 1972 he moved to East China Normal University where he was a lecturer of computer science. Since September 1986 he has been a professor of computer science at East China Normal University. He is currently working at Oxford University Computing Laboratory. His major research interests are programming language semantics, software engineering and distributed computing. Tony Hoare is Professor of Computation at the University of Oxford. He received his MA from Oxford in Classical Languages, Literature, History and Philosophy. He worked for eight years as programmer, manager and research scientist with a small computer manufacturer. He is the recipient of several honours for his contributions to the study of computer programming languages, and is generally famed for Hoare's Law: inside every large program there is a small program trying to get out.     

AgentTeamwork: Coordinating grid-computing jobs with mobile agents

AgentTeamwork is a grid-computing middleware system that dispatches a collection of mobile agents to coordinate a user job over remote computing nodes in a decentralized manner. Its utmost focus is to maintain high availability and dynamic balancing of distributed computing resources to a parallel-computing job. For this purpose, a mobile agent is assigned to each process engaged in the same job, monitors its execution at a different machine, takes its periodical execution snapshot, moves it to a lighter-loaded machine, and resumes it from the latest snapshot upon an accidental crash. The system also restores broken inter-process communication involved in the same job using its error-recoverable socket and mpiJava libraries in collaboration among mobile agents. We have implemented the first version of our middleware including a mobile agent execution platform, error-recoverable socket and mpiJava API libraries, a job wrapper program, and several types of mobile agents such as commander, resource, sentinel, and bookkeeper agents, each orchestrating, allocating resources to, monitoring and maintaining snapshots of a user process respectively. This paper presents AgentTeamwork’s execution model, its implementation techniques, and our performance evaluation using the Java Grande benchmark test programs. Munehiro Fukuda received a B.S. from the College of Information Sciences and an M.S. from the Master’s Program in Science and Enginnering at the University of Tsukuba in 1986 and 1988. He received his M.S. and Ph.D. in Information and Computer Science at the University of California at Irvine in 1995 and 1997, respectively. He worked at IBM Tokyo Research Laboratory from 1988 to 1993 and taught at the University of Tsukuba from 1998 to 2001. Since 2001, he has been an assistant professor at Computing & Software Systems, the University of Washington, Bothell. His research interests include mobile agents, multi-threading, cluster computing, grid computing and distributed simulations. Koichi Kashiwagi received a Bachelor of Science degree from the Faculty of Science, Ehime University in 2000 and a Master of Engineering degree from the Department of Compter Science, Ehime University in 2002. In 2004 he became a research assistant in Department of Compter Science, Ehime University. His research interests include distributed computing, job scheduling, and grid computing. Shin-ya Kobayashi received the B.E. degree, M.E. degree, and Dr.E. degree in Communication Engineering from Osaka University in 1985, 1988, and 1991 respectively. From 1991 to 1999, he was on the faculty of Engineering at Kanazawa University, Japan. From 1999 to 2004, He was an Associate Professor in the Department of Computer Science, Ehime University. He is a Professor at Graduate School of Science and Engineering, Ehime University. His research interests include distributed processing, and parallel processing. He is a member of the Information Processing Society of Japan, the Institute of Electrical Engineers of Japan, IEEE, and ACM.     

P transducers

We introduce in this paper four classes of P transducers: arbitrary, initial, isolated arbitrary, isolated and initial. The first two classes are universal, they can compute the same word functions as Turing machines, the latter two are incomparable with finite state sequential transducers, generalized or not. We study the effect of the composition, and show that iteration increases the power of these latter classes, also leading to a new characterization of recursively enumerable languages. The “Sevilla carpet” of a computation is defined for P transducers, giving a representation of the control part for these P transducers. Gabriel Ciobanu, Ph.D.: He has graduated from the Faculty of Mathematics, “A.I.Cuza” University of Iasi, and received his Ph.D. from the same university. He is a senior researcher at the Institute of Computer Science of the Romanian Academy. He has wide-ranging interests in computing including distributed systems and concurrency, computational methods in biology, membrane computing, and theory of programming (semantics, formal methods, logics, verification). He has published around 90 papers in computer science and mathematics, a book on programming semantics and a book on network programming. He is a co-editor of three volumes. He has visited various universities in Europe, Asia, and North America, giving lectures and invited talks. His webpage is http://www.info.uaic.ro/gabriel Gheorghe Păun, Ph.D.: He has graduated from the Faculty of Mathematics, University of Bucharest, in 1974 and received his Ph.D. from the same university in 1977. Curently he works as senior researcher in the Institute of Mathematics of the Romanian Academy, as well as a Ramon y Cajal researcher in Sevilla University, Spain. He has repeatedly visited numerous universities in Europe, Asia, and North America. His main research areas are formal language theory and its applications, computational linguistics, DNA computing, and membrane computing (a research area initiated by him). He has published over 400 research papers (collaborating with many researchers worldwide), has lectured at over 100 universities, and gave numerous invited talks at recognized international conferences. He has published 11 books in mathematics and computer science, has edited about 30 collective volumes, and also published many popular science books and books on recreational mathematics (games). He is on the editorial boards of fourteen international journals in mathematics, computer science, and linguistics, and was/is involved in the program/steering/organizing commitees for many recognized conferences and workshops. In 1997 he was elected a member of the Romanian Academy. Gheorghe Ştefănescu, Ph.D.: He received his B.Sc./M.Sc./Ph.D. degrees in Computer Science from the University of Bucharest. Currently, he is a Professor of Computer Science at the University of Bucharest and a Senior Fellow at the National University of Singapore. Previously, he was a researcher at the Institute of Mathematics of the Romanian Academy and has held visiting positions in The Netherlands, Germany, and Japan. His current research focuses on formal methods in computer science, particularly on process and network algebras, formal methods for interactive, real-time, and object-oriented systems. Some of his results may be found in his book on “Network Algebra,” Springer, 2000.     

Efficient minimum spanning tree algorithms on the reconfigurable mesh

1 IntroductionLet G = (V, E) be a connected, undirected graph with a weight function W on the set Eof edges to the set of reals. A spanning tree is a subgraph T = (V, ET), ET G E, of C suchthat T is a tree. The weight W(T) of a spanning tree T is the sum of the weights of its edges.A spanning tree with the smallest possible'weight is called a minimum spanning tree (MST)of G. Computing an MST of a given weighted graph is an important problem that arisesin many applications. For this …     

Atomic computing

Technological progress comes from pushing hard at the limitsof what is currently possible, not from merely following trendsothers have set. In computing a good illustration of this principleis the life and work of the 19th century computer pioneer CharlesBabbage (1791-1870), who spent most of his adult life tryingto build a digital computer. Babbage first invented such a machinein 1834. He called it the Analytical Engine.     

Ten reasons to use divisible load theory

During the past decade, divisible load theory has become a powerful tool for modeling data-intensive computational problems. DLT emerged from a desire to create intelligent sensor networks, but most recent applications involve parallel and distributed computing. Like other linear mathematical models such as Markovian queuing theory and electric resistive circuit theory, DLT offers easy computation, a schematic language, and equivalent network element modeling. While it can incorporate stochastic features, the basic model does not make statistical assumptions, which can be the Achilles' heel of a performance evaluation model.     

Family of models for describing one class of metallographic images

Models for images syntax are developed, tried, and tested in describing the syntax of microstructural metallographic images of wrought aluminum alloys. Gennadii Mikhailovich Tsibul’skii was born in 1947 and graduated from Krasnoyarsk Polytechnic Institute in 1973. Since 1975, he has been involved in the analysis of digital images. In 1978, he completed his postgraduate course at the Lenin Leningrad Electronic Technical Institute. He received his candidate’s degree in 1987 and a doctoral degree in engineering in 2006. He was appointed a professor in 2007. In 1996, he founded the Artificial Intelligence Systems Department and has worked there as a chairman since then. His scientific interests include the multiagent approach to images analysis, and he is the author of more than 70 publications (including one book published by the Siberian Branch of the Russian Academy of Sciences). At present, Gennadii Tsibul’skii is the director of the Space and Information Technologies Institute at Krasnoyarsk Siberian Federal University. Yurii Anatol’evich Maglinest was born 1965 and graduated from Krasnoyarsk Polytechnic Institute in 1973; he then pursued postgraduate studies there. He received his candidate’s degree in engineering in 1996 in the analysis of metallographic images. He is an associate professor at the State Commission for Academic Degrees and Titles of the Russian Federation. At present, he is a chair of the Scientific University Laboratory of Flexible Software Systems at the Artificial Intelligence Systems Department at Krasnoyarsk Siberian Federal University. His scientific interests include aerospace information storage, processing and analysis, and flexible software systems. Dmitrii Al’bertovich Perfil’ev was born in 1968 and graduated from Krasnoyarsk Polytechnic Institute in 1992. Since 2000, he has been specializing in problems in digital images analysis and, in particular, in describing microstructural pictures of aluminum alloys. He received his candidate’s degree in engineering in 2007 and is the author of 8 publications related to the problem in question. At present, he is a researcher and a lecturer at the Artificial Intelligence Systems Department at Krasnoyarsk Siberian Federal University.     

New Meta-Heuristic for Combinatorial Optimization Problems: Intersection Based Scaling

Combinatorial optimization problems are found in many application fields such as computer science,engineering and economy. In this paper, a new efficient meta-heuristic, Intersection-Based Scaling (IBS for abbreviation), is proposed and it can be applied to the combinatorial optimization problems. The main idea of IBS is to scale the size of the instance based on the intersection of some local optima, and to simplify the search space by extracting the intersection from the instance, which makes the search more efficient. The combination of IBS with some local search heuristics of different combinatorial optimization problems such as Traveling Salesman Problem (TSP) and Graph Partitioning Problem (GPP) is studied, and comparisons are made with some of the best heuristic algorithms and meta-heuristic algorithms. It is found that it has significantly improved the performance of existing local search heuristics and significantly outperforms the known best algorithms.     

A control-design-based solution to robotic ecology: Autonomy of achieving cooperative behavior from a high-level astronaut command

In this paper, we propose a cooperative control strategy for a group of robotic vehicles to achieve the specified task issued from a high-level astronaut command. The problem is mathematically formulated as designing the cooperative control for a general class of multiple-input-multiple-output (MIMO) dynamical systems in canonical form with arbitrary but finite relative degrees such that the outputs of the overall system converge to the explicitly given steady state. The proposed cooperative control for individual vehicle only need to use the sensed and communicated outputs information from its local neighboring vehicles. No fixed leader and time-invariant communication networks are assumed among vehicles. Particularly, a set of less-restrictive conditions on the connectivity of the sensor/communication networks are established, under which it is rigorously proven by using the newly found nice properties of the convergence of sequences of row stochastic matrices that the cooperative objective of the overall system can be achieved. Simulation results for a group of vehicles achieving a target and surrounding a specified object in formation are provided to support the proposed approach in this paper. Jing Wang received his B.S. degree and Ph.D. degree in control theory and control engineering, both from Central South University of Technology, China, in 1992 and 1997, respectively. He was a Postdoctoral Research Fellow at the Institute of Computing Technology, Chinese Academy of Sciences, from 1997 to 1999, and at the National University of Singapore, Singapore, from 1999 to 2002. Since March 2002, he has been with School of Electrical and Computer Science of University of Central Florida and now is a research assistant professor. He is the co-recipient of Best Theoretical Paper Award in 2002 at the 4th World Congress on Intelligent Control and Automation, Shanghai, China. His current research interests include cooperative control of multi-robot systems, nonlinear controls, robot control and motion planning, trajectory optimization, and control applications. He is a Member of IEEE and AIAA. Zhihua Qu received his Ph.D. degree in electrical engineering from the Georgia Institute of Technology in 1990. Since then, he has been with the University of Central Florida. Currently, he is a Professor in the Department of Electrical and Computer Engineering. His main research interests are nonlinear systems, robust and adaptive control designs, and robotics. He has published a number of papers in these areas and is the author of two books, Robust Control of Nonlinear Uncertain Systems by Wiley Interscience and Robust Tracking Control of Robotic Manipulators by IEEE Press. He is presently serving as an Associate Editor for Automatica and for International Journal of Robotics and Automation. He is a senior member of IEEE. Curtis M. Ihlefeld has been an electronics engineer for the National Aeronautics and Space Administration at the Kennedy Space Center since 1989. He is currently a member of the Kennedy Space Center Applied Physics Lab and has performed embedded processor systems design and control systems design for numerous Kennedy Space Center laboratories including the NASA Analytical Chemistry Lab, Optical Instrumentation Lab, Transducers Lab, and Data Acquisition Lab. Current projects include a control system design for a Lunar chemistry experiment that searches for water on the moon’s surface, a control system design and image processing tool set for space shuttle engine compartment photography, and a control system and image processing tool set for a space shuttle window defect measurement system. Presently he is performing research in the control of electroactive polymers. He holds an MS degree in electrical engineering from the University of Central Florida, and the title of his thesis was Application of Lyapunov Based Sensor Fault Detection in a Reverse Water Gas Shift Generator. He has one published conference proceedings paper and one journal article in the area of nonlinear fault tolerant control. Richard A. Hull received his B.S. in Engineering Science and Mechanics from the University of Florida, 1972, his M.S. and Ph.D. in Electrical Engineering from the University of Central Florida in 1993 and 1996, respectively. He has served as a Guidance and Control System Engineer in the Aerospace Industry for over 30 years, working for Lockheed Martin, Coleman Aerospace, McDonnell Douglas, and Boeing companies. He is currently a Principal Engineer in the Advanced Concepts Business Unit of Science Applications International Corporation (SAIC). He was a former recipient of the U.S. Air Force Laboratory Graduate Fellowship in Guidance and Control, and formerly served as Vice-Chairman of the Lockheed Martin Corporate Technical Focus Group for Guidance, Navigation and Control. His expertise and experience includes synthesis, simulation and analysis of guidance and control systems for hypersonic interceptor missiles, exo-atmospheric space vehicles, supersonic turbo-jets, space launch vehicle rockets, and high performance fighter aircraft. He is also a principal investigator for research in nonlinear robust control design methods, cooperative control of multiple platforms, and genetic algorithm design methods for aerospace applications. He has authored or co-authored over twenty conference and journal articles in the fields of nonlinear or cooperative control. He is a member of Institute of Electrical and Electronics Engineers (IEEE), a senior member of American Institute of Aeronautics and Astronautics (AIAA) and a member of the IEEE Control System Society. He has served as an Associate Editor of the Conference Editorial Board for the IEEE Control System Society since 1998, and is an adjunct professor and member of the graduate advisory council in Electrical Engineering for the Florida Institute of Technology (FIT).     

一种适合移动设备的数字图像签名方案

根据移动商务中计算能力不对等的特点,针对数字图像,提出了一种新的有效的数字签名方案。在不泄漏图像原始信息的情况下,将信息分块之后发送给TP(Third-party)进行签名计算,然后将中间结果发回移动设备进行组合。描述了该协议的运行过程,分析了其在运算速度方面的性能,证明了该协议对各种网络攻击和网络意外所具有的安全解决能力。理论证明该方法可以在一定程度上解决未来移动商务中计算能力不对等的问题,并且可以保证通信的安全性。