Some applications of matrices to location of zeros of polynomials†

In previous papers classical theorems on location of zeros of a polynomial with respect to the left half plane Γ₁ or the unit circle Γ₂ have been reformulated more simply in terms of appropriate companion matrices. It is shown how this work can be extended to the problem of zero location with respect to more general regions Γ of the complex plane. The first approach is to apply the bilinear transformation to the given polynomial, so that for example Γ₁ can be mapped into Γ₂ and a matrix representation of this is derived. An alternative method is discussed which relies on transformation of Γ into Γ₂. Some examples illustrate how any theorem involving Hurwitz-typc minors can be expressed in companion matrix terms, with a consequent halving of the orders of the determinants involved.     

Measurement of the Kernels of a Non-linear System of Finite Order†

A method of measuring the Volterra kernels of a finite-order non-linear system is presented. The kernels are obtained individually as a multi-dimensional impulse response. The multi-dimensional kernel transforms also can be obtained by the method described. As an extension, a technique of obtaining the Volterra kernels from a multi-dimensional step response is presented. This technique is useful for non-linear systems which can be considered to be of a given finite order for only a limited range of input amplitudes.     

The Implementation of Graphic Display of FAS

The principle of the fire alarm system and the implementation techniques of its computer graphic display are presented. With the help of the designing thoughts and technology of OOP, a Fire Alarm System (FAS) has been developed by using visual C++ language. The system has been put into use in many important buildings and has played an important role in monitoring and controlling the fire.     

Visualization of curvature plots and evaluation of fairness: an analysis of the effect of ‘scaling’

Changing the aspect-ratio (scale) of a graphical plot significantly affects the “messages” getting across to a viewer. This is true also for curvature plots and other graphs currently used in Curve & Surface Modeling to evaluate fairness. In particular, the sharp corners appearing in such graphs, employed as local fairness indicators by current practices, are significantly affected by nonuniform scaling. A detailed study of this phenomenon is presented offering specific guidelines for correctly “reading” curvature plots.     

Evaluation of Fourier transform of impulse response of linear time invariant systems†

Evaluation of the Fourior transform of the system impulse response is an important aspect of the design of control systems. A method suggested hero requires only one cycle of sine or cosine wave to be applied as an input to the system. It is proved that the sum of the sampled values of the output response, at the sampling interval equal to the period of the input wave, directly yields the sign and cosine transforms respectively. The procedure is generalized to any number of complete cycles of input wave, as well as to n/2 cycles whore n is any odd positive integer.     

Contracted product of hypermatrices via STP of matrices

An equivalent definition of hypermatrices is introduced. The matrix expression of hypermatrices is proposed. Using permutation matrices, the conversion between different matrix expressions is revealed. The various kinds of contracted products of hypermatrices are realized by semi-tensor products (STP) of matrices via matrix expressions of hypermatrices.     

More Proofs of an Axiom of Łukasiewicz

This paper reports results and some new problems in one of the domains to which automatic first-order theorem provers have been most successfully applied: axiomatics of nonclassical propositional logics. It is well known that one of the standard axioms of the denumerable-valued pure implication logic of ukasiewicz becomes derivable from the remainder in the presence of negation. Here it is shown that the same axiom is similarly derivable using conjunction and disjunction instead of negation. This closes a problem left open by Harris and Fitelson (Journal of Automated Reasoning 27, 2001). Related problems are discussed, and five such open problems are proposed as challenges to the automated reasoning community.     

Optimization of linear systems of constrained configuration†

For the sake of simplicity it is often desirable to restrict the number of feedbacks in a controller. In this case the optimal feedbacks depend on the disturbance to which the system is subjected. Using a quadratic error integral as a measure of the response, three criteria of optimization are considered :

1. The response to a given initial disturbance.

2. The worst response to an initial disturbance of given magnitude.

3. The worst comparison with the unconstrained optimal system.

It is shown that for each of these criteria the gradient with respect to the feedbacks can be calculated by a uniform method. The solution may then be found either directly or by a descent procedure. The method is illustrated by an example.     

Stabilization of a class of switched nonlinear systems

The stabilization of a class of switched nonlinear systems is investigated in the paper. The systems concerned are of （generalized） switched Byrnes-Isidori canonical form, which has all switched models in （generalized） Byrnes- Isidori canonical form. First, a stability result of switched systems is obtained. Then it is used to solve the stabilization problem of the switched nonlinear control systems. In addition, necessary and sufficient conditions are obtained for a switched affine nonlinear system to be feedback equivalent to （generalized） switched Byrnes-Isidori canonical systems are presented. Finally, as an application the stability of switched lorenz systems is investigated.     

In-pipe robot based on selective drive mechanism

This paper presents an in-pipe robot, called MRINSPECT V (Multifunctional Robotic crawler for In-pipe inSPECTion V), which is under development for the inspection of pipelines with a nominal 8-inch inside diameter. To travel freely in every pipeline element, the robot adopts a differential driving mechanism that we have developed. Furthermore, by introducing clutches in transmitting driving power to the wheels, MRINSPECT V is able to select the suitable driving method according to the shape of the pipeline and save the energy to drive in pipelines. In this paper, the critical points in the design and construction of the proposed robot are described with the preliminary results that yield good mobility and increased efficiency. Recommended by Editorial Board member Dong Hwan Kim under the direction of Editor Jae-Bok Song. This work was supported by the Postdoctoral Research Program of Sungkyunkwan University (2008). Se-gon Roh received the B.S., M.S., and Ph.D degrees in Mechatronics Engineering from Sungkyunkwan University, Korea, in 1997, 1999, and 2006 respectively, and is currently a Researcher of the School of Mechanical Engineering also at Sungkyunkwan University. His research interests include mechanism design, applications of mobile robots, and in-pipe robots. Do Wan Kim received the B.S. degree in Mechanical Engineering from Sungkyunkwan University, Korea, in 2007. He is currently working toward a M.S. degree in Mechanical Engineering also at Sungkyunkwan University. His research interests include field robotics, in-pipe robots, and autonomous mobile robots. Jung-Sub Lee received the B.S. degree in Mechanical Engineering in 2008 from Sungkyunkwan University, Suwon, Korea, where he is currently working toward a M.S. degree in mechatronics engineering. His research interests include robot mechanism design, automation, and in-pipe robot. Hyungpil Moon received the B.S. and M.S. degrees in Mechanical Engineering from POSTECH in 1996 and 1998 respectively, and Ph.D. degree in Mechanical Engineering from University of Michigan in 2005. He joined the faculty of School of Mechanical Engineering in Sungkyunkwan University as a Full-time Lecturer in 2008. He was a Post-doctoral fellow at Carnegie Mellon University, Robotics Institute until November 2007. His research interests include distributed manipulation, multiple robot navigation, SLAM, and biomimetic robotics. Hyouk Ryeol Choi received the B.S. degree from Seoul National University in 1984, the M.S. degree from Korea Advanced Technology of Science and Technology (KAIST) in 1986, and the Ph.D. degree from Pohang University of Science and Technology (POSTECH) in 1994, Korea. Since 1995, he has been with Sungkyunkwan University, where he is currently a Professor of the School of Mechanical Engineering. He worked as an Associate Engineer with LG Electronics Central Research Laboratory from 1986 to 1989. From 1993 to 1995, he was with Kyoto University as a grantee of a scholarship from the Japanese Educational Ministry. He visited Advanced Institute of Industrial Science Technology (AIST), Japan as the JSPS Fellow, from 1999 to 2000. He is now an Associate Editor of IEEE Transactions on Robotics, International Journal of Control, System, Automation(IJCAS), and International Journal of Intelligent Service Robots (JISR). His interests include dexterous mechanisms, field applications of robots, and artificial muscle actuator.     

Connolly Surface on an Atomic Structure via Voronoi Diagram of Atoms

One of the most important geometric structures of a protein is the Connolly surface of protein since a Connolly surface plays an important role in protein folding, docking, interactions between proteins, amongst other things. This paper presents an algorithm for precisely and efficiently computing the Connolly surface of a protein using a proposed geometric construct called β-shape based on the Voronoi diagram of atoms in the protein. Given the Voronoi diagram of atoms based on the Euclidean distance from the atom surfaces, the proposed algorithm first computes a β-shape with an appropriate probe. Then, the Connolly surface is computed by employing the blending operation on the atomic complex of the protein by the given probe.     

Generation of Discrete Bicubic G^1 B-Spline Ship Hullform Surfaces from a Given Curve Network Using Virtual Iso-Parametric Curves

We propose a method that automatically generates discrete bicubic G^1 continuous B-spline surfaces that interpolate the curve network of a ship huliform.First,the curves in the network are classified into two types;boundary curves and ＂reference curves＂,The boundary curves correspond to a set of rectangular（or triangular）topological type that can be representes with tensot-product （or degenerate）B-spline surface patches.Next,in the interior of the patches,surface fitting points and cross boundary derivatives are estimated from the reference curves by constructing ＂virtual＂isoparametric curves.Finally,a discrete G^1 continuous B-spline surface is gencrated by a surface fitting algorithm.Several smooth ship hullform surfaces generated from curve networks corresponding to actual ship hullforms demonstrate the quality of the method.     

Design and analysis of the Dual-Torus Network

In this paper, we propose a new topology called theDual Torus Network (DTN) which is constructed by adding interleaved edges to a torus. The DTN has many advantages over meshes and tori such as better extendibility, smaller diameter, higher bisection width, and robust link connectivity. The most important property of the DTN is that it can be partitioned into sub-tori of different sizes. This is not possible for mesh and torus-based systems. The DTN is investigated with respect to allocation, embedding, and fault-tolerant embedding. It is shown that the sub-torus allocation problem in the DTN reduces to the sub-mesh allocation problem in the torus. With respect to embedding, it is shown that a topology that can be embedded into a mesh with dilation δ can also be embedded into the DTN with less dilation. In fault-tolerant embedding, a fault-tolerant embedding method based on rotation, column insertion, and column skip is proposed. This method can embed any rectangular grid into its optimal square DTN when the number of faulty nodes is fewer than the number of unused nodes. In conclusion, the DTN is a scalable topology well-suited for massively parallel computation. Sang-Ho Chae, M.S.: He received the B.S. in the Computer Science and Engineering from the Pohang University of Science and Technology (POSTECH) in 1994, and the M.E. in 1996. Since 1996, he works as an Associate Research Engineer in the Central R&D Center of the SK Telecom Co. Ltd. He took part in developing SK Telecom Short Message Server whose subscribers are now over 3.5 million and Advanced Paging System in which he designed and implemented high availability concepts. His research interests are the Fault Tolerance, Parallel Processing, and Parallel Topolgies. Jong Kim, Ph.D.: He received the B.S. degree in Electronic Engineering from Hanyang University, Seoul, Korea, in 1981, the M.S. degree in Computer Science from the Korea Advanced Institute of Science and Technology, Seoul, Korea, in 1983, and the Ph.D. degree in Computer Engineering from Pennsylvania State University, U.S.A., in 1991. He is currently an Associate Professor in the Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Korea. Prior to this appointment, he was a research fellow in the Real-Time Computing Laboratory of the Department of Electrical Engineering and Computer Science at the University of Michigan from 1991 to 1992. From 1983 to 1986, he was a System Engineer in the Korea Securities Computer Corporation, Seoul, Korea. His major areas of interest are Fault-Tolerant Computing, Performance Evaluation, and Parallel and Distributed Computing. Sung Je Hong, Ph.D.: He received the B.S. degree in Electronics Engineering from Seoul National University, Korea, in 1973, the M.S. degree in Computer Science from Iowa State University, Ames, U.S.A., in 1979, and the Ph.D. degree in Computer Science from the University of Illinois, Urbana, U.S.A., in 1983. He is currently a Professor in the Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Korea. From 1983 to 1989, he was a staff member of Corporate Research and Development, General Electric Company, Schenectady, NY, U.S.A. From 1975 to 1976, he was with Oriental Computer Engineering, Korea, as a Logic Design Engineer. His current research interest includes VLSI Design, CAD Algorithms, Testing, and Parallel Processing. Sunggu Lee, Ph.D.: He received the B.S.E.E. degree with highest distinction from the University of Kansas, Lawrence, in 1985 and the M.S.E. and Ph.D. degrees from the University of Michigan, Ann Arbor, in 1987 and 1990, respectively. He is currently an Associate Professor in the Department of Electronic and Electrical Engineering at the Pohang University of Science and Technology (POSTECH), Pohang, Korea. Prior to this appointment, he was an Associate Professor in the Department of Electrical Engineering at the University of Delaware in Newark, Delaware, U.S.A. From June 1997 to July 1998, he spent one year as a Visiting Scientist at the IBM T. J. Watson Research Center. His research interests are in Parallel, Distributed, and Fault-Tolerant Computing. Currently, his main research focus is on the high-level and low-level aspects of Inter-Processor Communications for Parallel Computers.     

A classification method using a hybrid genetic algorithm combined with an adaptive procedure for the pool of ellipsoids

This paper presents a hybrid classification method that utilizes genetic algorithms (GAs) and adaptive operations of ellipsoidal regions for multidimensional pattern classification problems with continuous features. The classification method fits a finite number of the ellipsoidal regions to data pattern by using hybrid GAs, the combination of local improvement procedures and GAs. The local improvement method adaptively expands, rotates, shrinks, and/or moves the ellipsoids while each ellipsoid is separately handled with a fitness value assigned during the GA operations. A set of significant features for the ellipsoids are automatically determined in the hybrid GA procedure by introducing “don’t care” bits to encode the chromosomes. The performance of the method is evaluated on well-known data sets and a real field classification problem originated from a deflection yoke production line. The evaluation results show that the proposed method can exert superior performance to other classification methods such as k nearest neighbor, decision trees, or neural networks. Ki K. Lee received the B.S. degree from Han Yang University, Seoul, Korea in 1994, and the M.S. and Ph.D. degrees in industrial engineering from Korea Advanced Institute Science and Technology (KAIST), Daejeon, Korea in 1996 and 2005, respectively. From 2001 to 2004, he was a senior research engineer in telecommunication systems laboratory of LG Electronics Inc. Since 2005, he has been an assistant professor in the School of Management at Inje University, Kimhae, Korea. His research interests include intelligent decision support systems, soft computing, and pattern recognition. Wan C. Yoon received the B.S. degree from Seoul National University, Korea in 1977, the M.S. degree from KAIST, Korea in 1979, and the Ph.D. degree in industrial and systems engineering from Georgia Institute of Technology in 1987. He is professor of the Department of Industrial Engineering at KAIST, Korea. His research interests include application of artificial intelligence, human decision-making and aiding, information systems, and joint intelligent systems. Dong H. Baek received the B.S. degree from Han Yang University, Seoul, Korea in 1992, and the M.S. and Ph.D. degrees in industrial engineering from Korea Advanced Institute Science and Technology (KAIST), Daejeon, Korea in 1994 and 1999, respectively. He is an assistant professor in management information systems at department of business administration, Hanyang University, Korea. His research interests include management information systems, system engineering, and machine learning.     

Biologically inspired control of quadruped walking robot

In this paper, we present a control method for a quadruped walking robot inspired from the locomotion of quadrupeds. A simple and useful framework for controlling a quadruped walking robot is presented, which is obtained by observing the stimulus-reaction mechanism, the gravity load receptor and the manner of generating repetitive motions from quadrupeds. In addition, we propose a new rhythmic pattern generator that can relieve the large computational burden on solving the kinematics. The proposed method is tested via a dynamic simulation and validated by implementation in a quadruped walking robot, called AiDIN-I (Artificial Digitigrade for Natural Environment I). Recommended by Editorial Board member Sangdeok Park under the direction of Editor Jae-Bok Song. This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2005-D00031). Ig Mo Koo received the B.S. degree in Mechanical Engineering from Myongji University, Yongin, Korea, in 2003, the M.S. degree in Mechanical Engineering from the Sungkyunkwan University, Suwon, Korea, in 2005, where he is currently working toward a Ph.D. degree in Mechanical Engineering from Sungkyunkwan University. His research interests include artificial muscle actuators, haptics, tactile display, biomimetics and quadruped walking robots systems. Tae Hun Kang received the B.S., M.S., and Ph.D. degrees in Mechanical Engineering from Sungkyunkwan University, Korea, in 2000, 2002, and 2006, respectively. His current research interests focus on biomimetics and quadruped walking robot. Gia Loc Vo received the B.S degree in Mechanical Engineering form Ha Noi University of Technology in Vietnam 2003, the M.S. degree Mechanical Engineering form Sungkyunkwan University, Suwon, Korea, in 2006, where he is currently working toward a Ph.D. degree in Mechanical Engineering from Sungkyunkwan University. His research interests include legged locomotion, walking and climbing robot. Tran Duc Trong received the B.S degree in Mechatronics from HoChiMinh City University of Technology in Vietnam in 2005, where he is currently working toward a M.S. degree in Mechanical Engineering from Sungkyunkwan University. His research interests include biological inspired control and adaptive control of quadruped walking robot. Young Kuk Song received the B.S. degree in Mechanical Engineering from Sungkyunkwan University, Suwon, Korea, in 2006, where he is currently working toward a M.S. degree in Mechanical Engineering from Sungkyunkwan University. His research interests include biomimetics, hydraulic robotics system and quadruped walking robot. Hyouk Ryeol Choi received the B.S. degree from Seoul National University, Seoul, Korea, in 1984, the M.S. degree from the Korea Advanced Technology of Science and Technology (KAIST), Daejeon, Korea, in 1986, and the Ph.D. degree from the Pohang University of Science and Technology (POSTECH), Pohang, Korea, in 1994. Since 1995, he has been with Sungkyunkwan University, Suwon, Korea, where he is currently a Professor in the School of Mechanical Engineering. He was an Associate Engineer with LG Electronics Central Research Laboratory, Seoul, Korea, from 1986 to 1989. From 1993 to 1995, he was with Kyoto University, Kyoto, Japan, as a grantee of scholarship funds from the Japanese Educational Administry. He visited the Advanced Institute of Industrial Science Technology (AIST), Tsukuba, Japan, as a JSPS Fellow from 1999 to 2000. He is now an Associate Editor in IEEE Transactions on Robotics, Journal of Intelligent Service Robotics, International Journal of Control, Automation and Systems (IJCAS). His interests includes dexterous mechanisms, field application of robots, and artificial muscle actua tors.     

A Power-Aware Branch Predictor by Accessing the BTB Selectively

Microarchitects should consider power consumption, together with accuracy, when designing a branch predictor, especially in embedded processors. This paper proposes a power-aware branch predictor, which is based on the gshare predictor, by accessing the BTB （Branch Target Buffer） selectively. To enable the selective access to the BTB, the PHT （Pattern History Table） in the proposed branch predictor is accessed one cycle earlier than the traditional PHT if the program is executed sequentially without branch instructions. As a side effect, two predictions from the PHT are obtained through one access to the PHT, resulting in more power savings. In the proposed branch predictor, if the previous instruction was not a branch and the prediction from the PHT is untaken, the BTB is not accessed to reduce power consumption. If the previous instruction was a branch, the BTB is always accessed, regardless of the prediction from the PHT, to prevent the additional delay/accuracy decrease. The proposed branch predictor reduces the power consumption with little hardware overhead, not incurring additional delay and never harming prediction accuracy. The simulation results show that the proposed branch predictor reduces the power consumption by 29-47%.     

Anti-aliased rendering of water surface

Water surface is one of the most important components of landscape scenes. When rendering spacious water surface such as that of the lakes and reservoirs, aliasing and/or moiré artifacts frequently occur in the regious far from the viewpoint. This is because water surface consists of stochastic water waves which are usually modeled by periodic bump mapping. The incident rays on the water surface are actually scattered by the bumped waves, and the reflected rays at each sample point are distributed in a solid angle. To get rid of the artifacts of moiré pattern, we estimate this solid angle of reflected rays and trace these rays. An image-based accelerating method is adopted so that the contribution of each reflected ray can be quickly obtained without elaborate intersection calculation. We also demonstrate anti-aliased shadows of sunlight and skylight on the water surface. Both the rendered images and animations show excellent effects on the water surface of a reservoir. The first, third and fifth co-authors were partially supported by the National Natural Science Foundation of China (Grant Nos. 60021201 and 60373035), Key Research Project of Ministry of Education (Grant No.01094) and the National Grand Fundamental Research 973 Program of China (Grant No.2002CB312102). Xue-Ying Qin is an associated professor of State Key Laboratory of CAD&CG, Zhejiang University. She received her Ph.D. degree from Hiroshima University in 2001, B.S. and M.S. degrees in Mathematics from Peking University in 1988 and from Zhejiang University in 1991, respectively. Her research interests include computer graphics, visions and image processing. Eihachiro Nakamae is currently Chairman of Sanei Co. He was granted the title of emeritus professor from both Hiroshima University and Hiroshima Institute of Technology. He was appointed as a researcher associate at Hiroshima University in 1956, a professor from 1968 to 1992 and an associated researcher at Clarkson College of Technology, Potsdam, N.Y., from 1973 to 1974. He was a professor at Hiroshima Prefectural University from 1992 to 1995 and a professor at Hiroshima Institute of Technology from a996 to the end of March 1999. He received his B.E., M.E., and Ph.D. degrees in electrical engineering in 1954, 1956, and 1967 from Waseda University. His research interests include computer graphics, image processing and electric machinery. He is a member of IEEE, ACM, CGS, Eurographics, IEE of Japan, and IPS of Japan. Wei Hua received his Ph.D. degree in applied mathematics from Zhejiang University in 2002. He joined the CAD&CG State Key Lab in 2002. His main interests include real-time simulation and rendering, virtual reality and software engineering. Yasuo Nagai is now an associate professor of Hiroshima Institute of Technology. He was appointed a researcher associate at Hiroshima Institute of Technology in 1965, and an associate professor in 1984. His research interests include computer graphics and image processing. He is a member of IEE, IEICE, IPSJ, and ITE of Japan. Qun-Sheng Peng was born in 1947. He received his Ph.D. degree in computer science from the University of East Anglia, U.K., in 1983. He is a professor and his research interests include computer graphics, computer animation, virtual reality, and point-based modeling and rendering.     

RHiNET-2/SW: a high-throughput, compact network-switch using 8.8-gbit/s optical interconnection

We have developed a high-throughput, compact network switch (the RHiNET-2/SW) for a distributed parallel computing system. Eight pairs of 800-Mbit/s×12-channel optical interconnection modules and a CMOS ASIC switch are integrated on a compact circuit board. To realize high-throughput (64 Gbit/s) and low-latency network, the SW-LSI has a customized high-speed LVDS I/O interface, and a high-speed internal SRAM memory in a 784-pin BGA one-chip package. We have also developed device implementation technologies to overcome the electrical problems (loss and crosstalk) caused by such high integration. The RHiNET-2/SW system enables high-performance parallel processing in a distributed computing environment. Shinji Nishimura: He is a researcher in the Department of Network System at the Central Research Laboratory, Hitachi Ltd., at Tokyo. He obtained his bachelors degree in Electronics Engineering from the University of Tokyo in 1989, and his M.E. from the University of Tokyo in 1991. He joined a member of the Optical Interconnection Hitachi Laboratory from 1992. His research interests are in hardware technology for the optical interconnection technologies in the computer and communication systems. Katsuyoshi Harasawa: He is a Senior Enginner of Hitachi Communication Systems Inc. He obtained his bachelors degree in Electrical Engineering from Tokyo Denki University. He is a chief of development of the devices and systems for the optical telecommunication. He was engaged in Development of Optical Reciever and Transmitter module. He joined RWCP project from 1997. His research interests are in hardward technology for optical interconnection in distributed parallel computing system (RHiNET). Nobuhiro Matsudaira: He is a engineer in the Hitachi Communication Systems, Inc. He obtained his bachelors degree in Mercantile Marine Engineering from the Kobe University of Mercantile Marine in 1986. He was engaged in Development of Optical Reciever and Transmitter module at 2.4 Gbit/s to 10Gbit/s. He joined RWCP project from 1998. His reserch interests are in hardware technology for the optical interconnection technology in the computer and communication systems. Shigeto Akutsu: He is a staff in Hitachi Communication Systems Inc. He obtained his bachelors degree in Electronics from Kanagawa University, Japan in 1998. His research interests are hardware technology for the optical interconnection technology in the computer and communication systems. Tomohiro Kudoh, Ph.D.: He received Ph.D. degree from Keio University, Japan in 1992. He has been chief of the parallel and distributed architecture laboratory, Real World Computing Partnership since 1997. His research interests include the area of parallel processing and network for high performance computing. Hiroaki Nishi: He received B.E., M.E. from Keio University, Japan, in 1994, 1996, respectively. He joined Parallel & Distributed Architecture Laboratory, Real World Computing Partnership in 1999. He is currently working on his Ph.D. His research interests include area of interconnection networks. Hideharu Amano, Ph.D.: He received Ph.D. degree from Keio University, Japan in 1986. He is now an Associate Professor in the Department of Information and Computer Science, Keio University. His research interests include the area of parallel processing and reconfigurable computing.     

Secure web transaction with anonymous mobile agent over internet

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