Colloquium Series Spring 2003

Matthew T. Mason

What are the fundamental principles of robotic manipulation? Perhaps by studying a variety of systems we can identify some common underlying issues, mechanisms, and even principles. This talk focuses on a comparison of two systems: a human juggler and an automated factory. The human and the factory have some interesting common elements. In particular, both systems exhibit a type of "minimalism"---they obtain advantages from employing fewer motors and sensors. Along the way we will briefly visit several other manipulation systems: an automated planning system for robotic manipulation, a robotic juggler, chimpanzees, and ancient hominids.

Susmita Sur-Kolay

Restriction enzyme mapping is a well-known technique in molecular biology and the Double Digest Problem (DDP) was formulated as a NP-complete combinatorial problem. Existing approaches are able to neither tackle large instances nor produce all distinct solutions. In this work, we propose an an elitist genetic algorithm to overcome both the short-comings and obtain efficiently all distinct solutions to an instance of DDP. The notion of a particular type of equivalence among the solutions is utilized. Our method comprises of two phases - first to employ the GA to find a representative solution from each equivalence class, and then for each of these to generate all members in its equivalence class. Experimental results tallied for instances with known results.

Donna Ghosh

The advent of the Internet followed by the accelerated macro-evolution of the World Wide Web (WWW) has profoundly altered the way we work, talk, relax, play, connect, affiliate, love, persuade, shop, sell, inform in short, how we conduct the business of life. As end users, we perceive only the end to end flow of information. However, the Internet Service Providers (ISPs) have to constantly manage and monitor their networks in order to deliver seamless end to end services to their users. Network state models are tools used by the ISPs for network management. In this talk, I shall describe two network state models which I have developed - for network performance analysis and QoS routing, respectively.

For performance analysis, I have modeled the network as a finite shared resource, more specifically as a multi-dimensional loss system with bursty call arrival processes. I have solved for the approximate steady state distribution of the above system. This has been an open problem since 1981. It is well known that the actual call arrival processes in the network are bursty in nature. Hence this model aims to realistically capture the operating characteristics of the network. I shall discuss sample results which demonstrate that the proposed model computes the steady state distribution more accurately in comparison to the existing Poisson approximation.

For QoS routing, I have developed schemes which use local statistics at the routers to compute iocompressedl. network state models. These models are periodically advertised to neighboring domains, and are used by them for their path computation decisions. The existing schemes use instantaneous measurements at the time of the advertisement to compute the model. Our rationale behind using local statistics for the model computation is to capture the statistical behavior or the time history of a domain within an inter-domain update interval. I shall discuss sample results which demonstrate that the proposed model performs better in comparison to the existing ones.

Keyao Zhu

Optical mesh-topology networks based on wavelength-division multiplexing (WDM) technology have the ability to satisfy the rapid growth of Internet bandwidth requirements of our future backbone networks. While a wavelength channel in optical WDM network has a transmission capacity of several Gbps, a WDM network is required to support traffic connections at rates from STS-1 (51.84 Mbps) upto the full wavelength capacity. As bandwidth becomes plentiful and inexpensive, the carriers' key challenge is to turn that bandwidth into services for their customers in a cost-effective and timely manner. This requires that the switching nodes of the WDM networks have certain ``grooming'' capability to multiplex/demultiplex and switch lower-rate traffic streams onto higher-capacity wavelength channels. In this talk, I will describe different design issues on optical crossconnect (OXC) architectures and network control and management systems to support efficient traffic-grooming mechanisms in an optical WDM network. Then I will introduce two recent optical networking standards, SONET Virtual Concatenation (VC) and Link Capacity Adjust Scheme (LCAS), and how these new standards will increase the opportunities and challenges to enable a bandwidth-on-demand (BoD) service architecture in optical WDM Networks.

Shudong Jin

Internet streaming applications present a formidable strain on system resources. Multicast-based streaming delivery is an attractive approach to lower server and network resource requirements of such applications.

In the first part of this talk, I will demonstrate how charaterization of streaming access workloads (and the understaning of client access patterns) is critical to the evaluation of server bandwidth requirements of multicast-based streaming delivery protocols. My analysis indicates that to provide immediate service to asynchronous clients, the lower bound on server bandwidth grows as the square root of request arrival rate if access is non-sequential, much higher than the logarithmic lower bound if access is sequential. In the second part of this talk, I will demonstrate how characterization of Internet topologies (and the understanding of power laws and small-world behavior) is important for quantifying the network cost of multicast delivery protocols. I discovered that small-world behavior can be caused by high variability of vertex degrees and by the preference of vertices to have local connections. Capturing these causes leads to more accurate evaluation of multicast efficacy.

If time permits, I will elude to my other projects on improving the scalability and efficiency of content delivery on the Internet, and will hint to directions for future work.

Graduate Students

Yingfei Dong

Cable Broadband Networks (CBNs) have become one of the most important forms of broadband services, which significantly improve the bandwidth to home and spur many multimedia applications to reality. However, bandwidth contention is still a challenging problem in providing eff icient IP-based Video-On-Demand (VOD) service on CBNs. To address the bandwidth contention issue, we propose an efficient video session scheduling technique, named "optimal full-sharing". This technique fully exploits the unique characteristics of CBNs to reduce the band width consumption of video sessions sharing a cable channel of fixed capacity, thereby maximizing the number of simultaneous video sessions on the single channel. Furthermore, we design two adaptation algorithms which not only keep bandwidth consumption of video sessions minimize d but also significantly reduce the mean service delay. In addition, we analyze the expected bandwidth and the session blocking probability of a video under the full-sharing scheduling. Based on this analysis, we then design an efficient video assignment mechanism for maximizing the profit of a VOD system when scheduling videos on CBNs. The proposed approach is also applicable to many other broadcast networks in where clients have sufficient buffer and receiving capabilities, e.g., high-speed wireless networks.

Ying Cai

This presentation covers two research topics. We first focus on the communication issues in mobile ad-hoc networks. As this technology proliferates, one of the key success factors for its wide acceptance and deployment is support for energy conservation. Unfortunately, existing flooding techniques, used to discover and establish communication paths, either incur enormous amount of redundant broadcast retransmission or require excessive control overhead. To address these crucial problems, we propose a technique call Edge Forwarding. This new scheme minimizes the flooding traffic by leveraging location information to limit broadcast retransmissions to only hosts near the perimeter of each broadcast coverage. Furthermore, since each host only needs to track neighboring nodes within its one-hop distance, Edge Forwarding can be easily incorporated into many existing routing protocols without incurring any additional control overhead. The second part of this presentation looks at bandwidth issues in providing video-on-demand services. Today's applications use a dedicated stream for each service. This simple strategy quickly exhausts the server bandwidth, and is therefore very expensive and not scalable. Although multicast can be used to allow bandwidth sharing, users will have to wait until the next multicast. To achieve true-on-demand in a multicast environment, we introduce a novel idea called Patching. The advantages of Patching are twofold. First, users experience no delay since they do not have to wait until the next multicast. Second, each multicast is very efficient because it can expand over time to accommodate many more users.

Haiping Xu

The advent of multi-agent systems has brought us opportunities for the development of complex software that will serve as the infrastructure for advanced distributed applications. During the past decade, there have been many agent architectures proposed for implementing agent-based systems, and also a few efforts to formally specify agent behaviors. However, research on narrowing the gap between agent formal models and agent implementation is rare. In this talk, we present a model-based approach to designing and implementing intelligent agents for multi-agent systems (MAS). Instead of using formal methods for the purpose of specifying agent behavior, we bring formal methods into the design phase of the agent development life cycle. During the seminar, we first introduce the formalism called agent-oriented G-net model, which is based on the G-net formalism (a type of Petri nets), to serve as the high-level design for intelligent agents. To illustrate our formal modeling technique for multi-agent systems, an example of an agent family in electronic commerce is provided. Then we show how to use an existing Petri net tool to detect a deadlock error in our original design, and use model checking technique to verify some key behavioral properties of our agent models. Finally, based on the high-level design, we derive the agent architecture and the detailed design for agent implementation. To demonstrate the feasibility of our approach, we developed the toolkit called ADK (Agent Development Kit) that supports rapid development of intelligent agents for multi-agent systems.

Steven M. LaValle

For more than a decade randomized algorithms have dominated much of the motion planning literature. One of the most influential frameworks within this context has been the probabilistic roadmap (PRM), which generates a network of paths by performing random sampling over the configuration space. In our work, we have carefully assessed the value of randomization in this context. By building on discrepancy and dispersion ideas from quasi-Monte Carlo literature, we have determined both theoretically and experimentally that randomization in the original PRM offers no advantages over certain deterministic schemes. In fact, even some forms of grid search offer advantages over the original PRM. In addition to comparisons between PRMs and deterministic alternatives, we present our current progress on developing general-purpose sampling algorithms, and on our attempts to derandomize Rapidly-exploring Random Trees (RRTs). We hope that insights gained from this research will lead to the development of better sampling-based motion planning algorithms.

Parts of this work are in collaboration with Michael Branicky, Stephen Lindemann, and Libo Yang.

Sarfraz Khurshid

For programs that manipulate complex structures, generating a good test suite is difficult and laborious. We have developed an approach for generating a suite completely automatically. The user needs to provide only an invariant or precondition characterizing the acceptable inputs, and a bound on input size. A tool then generates a collection of appropriate test cases, using a SAT solver as the underlying engine. In the talk, I will explain the details of this approach, and describe experience applying it to various problems, ranging from library code to stand-alone applications.

Experiments on checking some methods from the Java Collection Framework indicate that it is feasible to use SAT solvers to systematically generate a high quality test suite. The tool also uncovered previously unknown errors in several applications: an intentional naming scheme developed for the MIT Oxygen project, a constraint solver for first-order relational logic, and a fault-tree analysis system developed for NASA.

Cesare Tinelli

Propositional satisfiability (or SAT) is the problem of determining whether a given propositional formula is satisfied by some assignment of truth values to its variables. "Satisfiability modulo theories" is a strictly more general kind of satisfiability problem concerning the satisfiability of quantifier-free formulas in a logical theory T of interest. It is an important kind of satisfiability problem, with applications in such fields as circuit design, compiler optimization, software/hardware verification, planning, and scheduling. One of the most successful methods for SAT is due to Davis, Putman, Loveland, and Logemann. This method was originally presented, and is still described, procedurally. In this talk, we will abstract most of the control issues of the method and present it instead declaratively as a sequent calculus, the DPLL calculus. We will then describe an extension of DPLL to a new calculus, DPLL(T), for checking satisfiabily modulo a given theory T. The new calculus, parametrized by the theory T, can be used as the basis of novel and efficient implementations of satisfiability checkers for theories with decidable quantifier-free consequences. To support this claim, we will explain how several of the most effective techniques currently used to implement fast DPLL-based SAT checkers can be adapted to the implementation of the DPLL(T) calculus.

Alan Selman

A disjoint NP-pair is a pair (A, B) of nonempty, disjoint sets such that both A and B belong to NP. Given a disjoint NP pair, we are interested in whether there is a set S in P that separates them: S separates (A, B) if A is a subset of S and B is a subset of the complement of S.

The existence of disjoint pairs that are not separated by any set in P is closely connected to the existence of public-key cryptosystems. Also, disjoint pairs arise naturally in the study of propositional proof systems. This talk will explain these connections and will survey several results.

Jun-Hong Cui

Multicast is a mechanism to efficiently support multi-point communications. It will enable important future applications, such as teleconferencing, distributed network games, telemedicine, and teleeducation, etc.

By using a tree structure, IP multicast is resource-efficient in delivering data to a group of members simultaneously. However, it suffers from state scalability problems as the number of concurrent active multicast groups is large. In QoS multicast provisioning, the problem is exacerbated, since not only the forwarding state but also the resource requirement of a multicast group must be kept at the router.

In this talk, I will present a novel scheme, called aggregated multicast, to solve the state scalability problem. The key idea is that multiple groups are forced to share a single delivery tree. Using aggregated multicast, not only can the multicast state be reduced significantly, but also the multicast tree management can be simplified dramatically. In addition, I will also talk about a scalable QoS multicast provisioning architecture, called AQoSM. It utilizes the aggregated multicast idea and Diff-Serv capabilities to provide QoS multicasting. In AQoSM, we can easily achieve state (including multicast state and QoS state) scalability, efficient resource utilization, load-balancing, dynamic rerouting to meet QoS requirements, and enhanced fault-tolerance.

Xiaodong Zhang

Execution performance of both commercial and scientific applications is critically determined by how efficiently the memory hierarchy can be utilized. Although modern computer systems provide many caches at different levels of the memory hierarchy, locality exploitation is not guaranteed. In this talk, I will give an overview of a large project on software and hardware support for effective locality-aware high performance computing. I will present one selective research topic: efficient page replacement algorithms for buffer cache and system software implementations. I will discuss merits and limits of locality-aware techniques at different system levels.

Before the technical presentation, He will give a brief overview of the NSF Advanced Computational Research (ACR) program.

Christos Papadimitriou

The Internet is the first computational artifact that was not designed by a single entity, but emerged from the complex interaction of many - and hence must be approached as a mysterious object, akin to the universe and the cell, to be understood by observation and falsifiable theories. Game theory plays an important role in this endeavor, since the entities involved in the Internet are in various and varying degrees of collaboration and competition. We survey work in progress considering the Internet and its protocols as equilibria in appropriate games, and striving to explain phenomena such as the power law distributions of the degrees of the Internet topology in terms of the complex optimization problems faced by each node.

Samik Basu

Ensuring reliability and security of software are important concerns in a software development process. Formal methods offer a promising approach to specify and verify such critical behaviors of software. However verification of software models, which are inherently infinite state, is still in a state of infancy. Infiniteness of models arises due to the presence of infinite data domains, infinite control behavior and/or infinite number of sub-systems. As a part of my dissertation research, I have developed formal verification techniques to analyze infinite state systems in these three dimensions. In this talk, I will primarily focus on verification of (parameterized) systems consisting of unbounded number of sub-systems. I will present an automated technique based on compositional model checking to reason about such systems. Finally, I will give a brief overview of my work in verification of infinite state systems and its applications to mobile code security followed by an outline of future research avenues.

Hoh Peter In

The next generation of ubiquitous, distributed real-time and embedded middleware for mission-critical applications needs to be adaptable and secure. These applications need to take into account of relevant situation information to adaptively and securely communicate with each other across different network environment, such as mobile ad-hoc networks, the Internet, or peer-to-peering computing. It is a very challenging problem to verify these applications due to the state explosion problem. The applications generate information dynamically, and their states change with time. Often time a situation triggers another new situation. Existing model-checking techniques easily become impractical. I will present a new verification technique for dynamic, situation-aware middleware applications based on state space reduction methods using an innovative situation-deductive abstraction and colored graph-based incremental model-checking techniques that ameliorate the state explosion problem.

On the basis of the adaptive situation-aware middleware framework, I will show how to incorporate the following features: 1) situation-awareness, 2) automated component integration for combining crosscutting aspects using separation of aspects, 3) application and target middleware architecture optimization, and 4) security and survivability mechanisms utilizing software agents.

Matthew T. Mason earned the BS, MS, and PhD degrees in Computer Science and Artificial Intelligence at MIT, finishing his PhD in 1982. Since that time he has been on the faculty at Carnegie Mellon University, where he is presently Professor of Computer Science and Robotics, and Chair of the Robotics PhD Program. His research interests are in robotic manipulation, automated manufacturing systems, and mobile manipulation. He is co-author of "Robot Hands and the Mechanics of Manipulation" (MIT Press 1985), co-editor of "Robot Motion: Planning and Control" (MIT Press 1982), and author of "Mechanics of Robotics Manipulation" (MIT Press 2001). He is a winner of the System Development Foundation Prize, a Fellow of the AAAI, and a Fellow of the IEEE.

Visit Matthew T. Mason's homepage here.

BACK

Susmita Sur-Kolay

Susmita Sur-Kolay received the B.Tech. degree in Electronics and Electrical Communication Engineering (summa cum laude)at IIT Kharagpur, India in 1980. She pursued doctoral studies in the Theoretical Computer Science group of Laboratory for Computer Science at MIT where her research in graph algorithms with applications to algorithmic VLSI physical design began. Since 1987, she has been in the Advanced Computing and Microelectronics Unit of Indian Statistical Institute, Kolkata, India where she is presently an Associate Professor. From 1993 to 1999, she was a Reader in the Department of Computer Science and Engineering of Jadavpur University, Kolkata, India. She has authored or co-authored over 30 papers, served on the Program Committees of several Conferences on VLSI Design and algorithm design, and collaborated on sponsored research projects. Her research interests are in combinatorial algorithms and algorithmic CAD for layout design and fault simulation.

BACK

Donna Ghosh

Donna Ghosh is a Ph.D. student in the Department of Computer Science and Engineering at the Pennsylvania State University, University Park . She obtained her Masters degree from the Department of Computer Science and Engineering at the State University of New York at Buffalo in 2000. She currently works with Dr. Raj Acharya in the Networked Multimedia & Visualization Laboratory. She is primarily interested in the areas of - Next Generation Internet - Quality of service, Pricing, Security, Scheduling, Policy based network management and planning, Web servers, Peer-to-peer networks, Content distribution, etc.

Visit Donna Ghosh's homepage here.

BACK

Keyao Zhu

Keyao Zhu is a PhD candidate in Department of Computer Science, University of California, Davis. Keyao received his B.S. degree from Peking University, Beijing (China) in 1998 and M.S. degree from UC Davis, in 2000. In 2001, he worked in Summit Networks,a startup company in San Jose, CA, as a technical staff and software engineer to develop a dense, high-capacity optical switch. In the summer of 2002, he was a visiting researcher in Sprint Advanced Technology Laboratories (ATL) in Burlingame, CA. His research interests include optical WDM network design and analysis, Internet QoS, etc.

Visit Keyao Zhu's homepage here.

BACK

Shudong Jin

Shudong is a Ph.D. candidate and research fellow at Boston University in the Computer Science Department. He is a member of Web and InterNetworking Group. He has broad interests in networking and system areas. Much of his work has focused on characterization of Web/streaming media traffic and Internet topology, streaming media workload generation (GISMO), and performance evaluation of large-scale streaming delivery techniques. He is also interested in streaming media caching and Web caching, multicast, network transport protocols, and storage management for Web servers. Before coming to the States, Shudong received BS and MS degrees in Computer Science and had been a research associate in Huazhong (Central-China) University of Science and Technology, China. During the years in the States, he worked at IBM T.J. Watson Research Center in summer 2000 and 2001, and received the IBM Ph.D. research fellowship in year 2001-2002.

Visit Shudong Jin's homepage here.

BACK

Graduate Students

Biography currently unavailable.

Visit Graduate Students's homepage here.

BACK

Yingfei Dong

Yingfei Dong is a Ph.D. candidate at the Department of Computer Science and Engineering, University of Minnesota at Twin Cities. His current research concentrates on networks security, multimedia streaming applications and network resource management, including secure network services, intrusion detection, service-overlay networks, multimedia streaming over the Internet, cable broadband networks and wireless networks, and peer-to-peer systems.

Visit Yingfei Dong's homepage here.

BACK

Ying Cai

Ying Cai received his Ph.D. in computer science from the University of Central Florida (UCF) in 2002, and his MS and BS, both in computer science, from Jiaotong University, Xi'an, China, in 1993 and 1990, respectively. His research interests include wireless networks, mobile computing, multimedia communications, storage systems, and database management systems. Dr. Cai has published many papers and made a few significant contributions to these fields. In particular, the paper on Patching techniques, he published in ACM Multimedia'98, has collected more than 50 citations; and "patching" has become a standard term used in the literature today. Because of his outstanding research work, he received the Hillman Award from UCF in 2002. Dr. Ying Cai is a member of IEEE and ACM.

Visit Ying Cai's homepage here.

BACK

Haiping Xu

Haiping Xu is a Ph.D student in Computer Science at the University of Illinois at Chicago (UIC). He obtained his M.S in Computer Science at Wright State University in 1998, following his M.S in Electrical Engineering at Zhejiang University, China, in 1992. He currently works in the Concurrent Software Systems Laboratory at UIC. He is primarily interested in distributed software engineering, model-based software development, including formal specification, design analysis, and model checking. He is a member of IEEE, ACM, IEEE Computer Society and IEEE SMC Society.

Visit Haiping Xu's homepage here.

BACK

Steven M. LaValle

Steven M. LaValle is an assistant professor of Computer Science and a faculty member of the Beckman Institute at the University of Illinois at Urbana-Champaign (UIUC). He received his Ph.D in Electrical Engineering from UIUC in 1995. From 1995-1997 he was a post-doctoral researcher at Stanford University, and an assistant professor in the Department of Computer Science at Iowa State University from 1997-2001. His research interests include robotics, motion planning, geometric motion strategy problems, vision and visibility analysis, nonholonomic planning, nonlinear systems, uncertainity issues, artificial intelligence, practical issues in real-world applications such as mobile robotics, drug design and virtual prototyping.

Visit Steven M. LaValle's homepage here.

BACK

Sarfraz Khurshid

Sarfraz Khurshid is completing his PhD in Computer Science at MIT. He received a BSc in Mathematics and Computer Science from Imperial College (London), and read Part III of the Mathematical Tripos at Trinity College Cambridge. His current research focuses on software testing, specification languages, code conformance, model checking, and applications of heuristics in program analysis.

Visit Sarfraz Khurshid's homepage here.

BACK

Cesare Tinelli

Dr. Tinelli is an assistant professor of Computer Science at the University of Iowa. He received a PhD and an MS degree in Computer Science from the University of Illinois at Urbana-Champaign, in 1995 and 1999 respectively. His recent work concentrates on constraint-based approaches and combination methods for automated reasoning, and their applications to software verification. His research interests include automated reasoning, formal methods, foundations of programming languages, and applications of logic in computer science.

Visit Cesare Tinelli's homepage here.

BACK

Alan Selman

Professor Alan L. Selman received a BS from City College of CUNY in 1962, MA from the University of California, Berkeley in 1964, and Ph.D. from the Pennsylvania State University in 1970. He held faculty positions at Florida State, Iowa State, and Northeastern universities prior to joining the University at Buffalo in 1990. He served as Chairman of the Computer Science Department at UB from 1990 to 1996. He is a Fellow of the ACM and has been a Senior Fulbright Scholar. He is Editor-in-Chief of Theory of Computing Systems (formerly Mathematical Systems Theory), and a member of the editorial boards of the Chicago Journal of Theoretical Computer Science and Journal of Computer and System Sciences. He is a founder of the IEEE Conference on Computational Complexity (formerly Structure in Complexity Theory) and served as its conference chairman 1986- 88. His book "Computability and Complexity Theory," coauthored with Steven Homer was recently published by Springer Verlag New York in the series "Texts in Computer Science."

Visit Alan Selman's homepage here.

BACK

Jun-Hong Cui

Jun-Hong Cui is a Ph.D. candidate at University of California, Los Angeles, working within the Network Research Laboratory. She received her B.S. degree in Computer Science from Jilin University, China, in 1995, and her M.S. degree in Computer Engineering from Institute of Computing Technology, Chinese Academy of Sciences, in 1998. Her research interests cover the design, modeling, and performance evaluation of networks and distributed systems. Recently, her research mainly focuses on multicasting and quality of services (QoS) support in the Internet and wireless networks, multicast modeling, and location-aware computing. She is a member of IEEE, IEEE Computer Society, IEEE Communication Society, and ACM SIGCOMM.

Visit Jun-Hong Cui's homepage here.

BACK

Xiaodong Zhang

Xiaodong Zhang is the Program Director of Advanced Computational Research at the National Science Foundation. His home institution is the College of William and Mary where he is a Professor of Computer Science. He has served on the editorial board of IEEE Transactions on Parallel and Distributed Systems, and is an associate editor of IEEE Micro. His research interests are in the area of high performance and distributed computing and systems, and computer architecture.

Visit Xiaodong Zhang's homepage here.

BACK

Christos Papadimitriou

Professor Christos Papadimitriou received his BS in Electrical Engineering from Athens Polytechnic in 1972, MS in Electrical Engineering from Princeton University in 1974, and PhD in Electrical Engineering and Computer Science from Princeton University in 1976. Since then, he has served on the faculty at Harvard, MIT, Stanford, Athens Polytechnic and UCSD, before joining UC Berkeley in 1996 as C. Lester Hogan Professor of Computer Science. His primary interests are in algorithms and complexity theory, and their applications to various fields, including optimization, databases, AI, economics and the internet. He is a member of the National Academy of Engineering, and holds an honorary doctorate from ETH, Zurich. He has written four technical books in theoretical computer science. His latest book, Turing (a Novel about Computation) will be published by MIT Press in the summer of 2003.

Visit Christos Papadimitriou's homepage here.

BACK

Samik Basu

Samik Basu is a Ph.D. candidate in the department of Computer Science, State University of New York at Stony Brook. He is expected to graduate in August 2003. He received his M.S. degree from the same department in 2000 following B.E. degree from Department of Computer Science and Engineering, Jadavpur University, India in 1998. He is currently associated to Applied Logic Lab.(ALL) and Secure & Reliable Systems Lab.(SECLAB) at SUNY. His primary research interests include specification and verification of computer systems and the application of formal techniques for automatic detection of software flaws and vulnerabilities.

Visit Samik Basu's homepage here.

BACK

Hoh Peter In

Dr. Hoh Peter In is an assistant professor at Texas A&M University. He received his Ph.D. from University of Southern California in 1998, and his BS and MS degrees from Korea University in 1990 and 1992, all in Computer Science. He won a best paper award in IEEE ICRE (Requirements Engineering), 1996. He has served as Vice Chair of Software Engineering on the Internet at the 2002 SAINT (International Symposium on Applications and the Internet), Publication Chair of the 2001 IEEE RTES (International Workshop on Real-Time Embedded Systems), and Program Committee of the IEEE COMPSAC (International Computer Software and Applications Conference) in 2001 and 2000. His research interests include distributed component architectures, embedded middleware systems, information assurance, requirements engineering, groupware, and agent-based software engineering.

Visit Hoh Peter In's homepage here.

BACK

---

Archives

• Fall 2002
• Spring 2002
• Fall 2001
• Spring 2001
• Fall 2000
• Spring 2000
• Fall 1999
• Spring 1999
• Fall 1998
• Summer 1998
• Spring 1998
• Fall 1997
• Spring 1997

(Top)

---

Contacts

Thank you for visiting this page. Please send your suggestions and comments to one of us in the Computer Science colloquium committee.

• Soma Chaudhuri . chaudhur@cs.iastate.edu
• Anantharaman Kalyanaraman. ananthk@cs.iastate.edu

(Top)

---

ananthk@cs.iastate.edu