JavaScript Menu Courtesy of Milonic.com
Stevens Computer Science Engineering & Science Stevens Computer Science
Stevens Institute of Technology Stevens Computer Science Homepage Stevens Computer Science Homepage
Stevens CS
ABOUT US
Overview
Mission Statement
News & Events
Publications
Seminars
Blogs
Gallery
Success Stories
        

News
gray gray Share/Save/Bookmark
Share
gray
Print
Stevens CS
Seminar List
 
Untitled Document

December 18, 2002

Experimental Analysis of Different Techniques for Bounded Model Checking

Ricardo Medel, Stevens Institute of Technology

Bounded Model Checking (BMC) is a procedure that searches for counterexamples for a given property in bounded executions of a non-terminating system. This paper compares the performance of SAT-based, BDD-based and explicit state based BMC on benchmarks drawn from commercial designs. Our experimental framework provides an uniform and comprehensive basis to evaluate each of these approaches based on a number of factors. Our results differ f ...read more

December 11, 2002

Web Server and Services Performance Portal: An example of a Real life Component Based Software Development

Reza Peyrovian, AT&T Labs

This presentation covers the software architecture of a performance management system that reports to it clients the health of the web servers and their applications along with the network metrics, such as alarms and thresholds on a web portal. The system reports on servers that are hosted on the Internet behind firewalls and millions of Internet users access them from around the globe for business and entertainment. This system was developed over a period of ...read more

For more information please contact:

Reza Peyrovian
Adjunct Professor
rpeyrovi@stevens.edu

December 6, 2002

Universal Re-encryption for Mixnets

Markus Jakobsson, RSA Laboratories

We introduce a new cryptographic technique that we call universal re-encryption. A conventional cryptosystem that permits re-encryption, such as ElGamal, does so only for a player with knowledge of the public key corresponding to a given ciphertext. In contrast, universal re-encryption may be performed without knowledge of public keys. We demonstrate an asymmetric cryptosystem with universal re-encryption that is half as efficient as standard ElGa ...read more

November 25, 2002

Statistical Methods for Real-time Video Surveillance

Ramesh Visvanathan, Siemens Corporate Research

The proliferation of cheap sensors and increased processing power has made real-time acquisition and processing of video information more feasible. Real-time video analysis tasks requiring object detection and tracking can increasingly be performed efficiently on standard PC's. Smart cameras are being designed that enable on-camera applications to directly output compressed data or meta-event information instead of raw video. These adv ...read more

November 22, 2002

CYCLONE: A Safe Dialect of C

Trevor Jim, AT&T Labs - Research

Cyclone is a dialect of C that is designed to be safe: free of buffer overflows, format string attacks, memory management errors, and other such bugs that are often the cause of security breaches.

Cyclone retains C's syntax, types, and low-level control over data representations and memory management, while ensuring safety through a combination of compile-time analysis and link- and run-time checks. The combination of safety and C com ...read more

November 15, 2002

Algebraic confluence for some overlapping rewrite systems

Eduardo Bonelli, Stevens Institute of Technology

One of the main syntactical results in lambda calculus is confluence: every two diverging rewrite sequences (derivations) may be made to converge. It was introduced in the 30's to establish the consistency of lambda calculus as a theory.

A stronger form of confluence was introduced by J-J.Levy in his 1978 PhD thesis: the algebraic theory of confluence. He establishes a notion of equivalence on derivations and shows that a ...read more

November 11, 2002

Visual Form, Art, Perception, and Image Transformations

Doug DeCarlo, Rutgers University

Each time we look at a picture, our visual system draws on the wealth of information there to infer what's going on in the scene. This process is guided by the structure of visual form: the intrinsic order and organization of natural imagery that manifests itself as visual cues such as contour, shading or texture. Artists implicitly draw upon this structure in a way that clarifies information and encourages specific interpretations; I'll show a ...read more

November 8, 2002

The Local Area pi Calculus

Tom Chothia, Stevens Institute of Technology

The Internet groups hosts into islands of local communication. It is the agreed conventions and shared knowledge that connect these islands, just as much as the switches and wires that run between them.

For my PhD I developed a process calculus to capture this phenomenon. The local area pi calculus, an extension of the pi-calculus, allows a communication channel to have within its scope several, disjoint local areas. Such a c ...read more

October 28, 2002

The AVENUE Automated Site Modeling Project: Geometry and Texture Recovery of Scenes of Large Scale

Peter Allen, Columbia University

The AVENUE project's goal is to automate the site modeling process. The main component of AVENUE is a system for photo-realistic 3D model acquisition from the combination of range and image sensing. The input is a sequence of unregistered range scans of the scene and a sequence of unregistered 2-D photographs of the same scene. The output is a true texture-mapped geometric model of the scene. Segmentation algorithms simplify the dense data-sets and pr ...read more

October 18, 2002

Software Architecture for Component-Based Middleware Applications

Virginia de Paula

Component-based development is a current trend in software engineering mainly because it promises to concretize the idea of reusing existing components by plugging-and-playing them in order to compose an application. Frameworks for component interoperability are playing an important role in component-based application development because they offer support for working with heterogeneous components despite differences in language and in the execution platform. The CORBA model ...read more

October 16, 2002

The MD-Join: An Operator for Complex OLAP

Samuel Kim, Stevens Institute of Technology

OLAP queries (i.e., group-by or cube-by queries with aggregation) have proven to be valuable for data analysis and exploration. Many decision support applications need very complex OLAP queries, requiring a fine degree of control over both the group definition and the aggregates that are computed. For example, suppose that the user has access to a data cube whose measure attribute is Sum(Sales). Then the user might wish to compute the sum ...read more

October 14, 2002

Instrinsic Mappings between Implicit Surfaces

Dr. H. Quynh Dinh ,Stevens Institute of Technology, Hoboken, NJ

A mapping between two surfaces describes pairs of corresponding points on the two surfaces, where each pair consists of a point on one surface and a point on the second surface. Mappings have a variety of uses, including texture transfer, model simplification, multi-way morphing, and surface analysis. Given a four dimensional implicit function in 3D space and time that defines a transformation between two surfaces, we ...read more

October 11, 2002

Language-Based Information-Flow Security

Andrei Sabelfeld, Cornell University

Current standard security practices do not provide substantial assurance that the end-to-end behavior of a computing system satisfies important security policies such as confidentiality. An end-to-end confidentiality policy might assert that secret input data cannot be inferred by an attacker through the attacker's observations of system output; this policy regulates information flow.

Conventional security mechanisms such as access contro ...read more

October 4, 2002

Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes

We provide efficient constructions and strong lower bounds for shared memory systems accessed by n processes, up to t of which may exhibit Byzantine faults, in a model previously explored by Malkhi et al. (DISC 2000). We show that sticky bits are universal in the Byzantine failure model provided n is at least 3t+1, an improvement over the previous result requiring n to be at least (2t+1)(t+1). Our result follows from a new strong consensus construction that uses sticky bits and tolerates t Byzantine ...read more

For more information please contact:

Rebecca Wright
Professor
rwright@cs.stevens.edu

September 25, 2002

E-business Security and Information Assurance

Information is one of the major assets of any organization or business. Security and Information Assurance are recognized as critical issues in In formation Technology today. This talk presents some of these issues with an emphasis on their business impacts. It describes Information Assurance: the operations that protect information and information systems by ensuring information availability, integrity, and confidentiality. Typical vulnerabilities and attack techniques, and the corresponding ...read more

For more information please contact:


September 6, 2002

What's new in primality testing

Carl Pomerance, Bell Labs I describe the new deterministic, polynomial time primality test of Agrawal, Kayal, and Saxena.

 

Carl Pomerance is one of the world's top number theorists. He received his PhD from Harvard University (under John Tate) in 1972. After graduating, he immediately joined the faculty at the University of Georgia, becoming full professor in 1982. He is now with Bell Labs, at Lucent. He has won many teaching and research awards, including the Chauvenet Prize in 19 ...read more

September 5, 2002

From Movies to 3D Models: the Structure-from-Motion Problem

John Oliensis, NEC Research Institute

I describe some of my recent results on Structure from Motion (SFM). SFM is the most studied problem in Computer Vision and the most robust way to make inferences about the 3D world from images. The problem is: given a sequence of photographic images of a fixed 3D scene, taken by a moving camera, estimate 1) a 3D geometric model of the scene (structure), 2) the camera's motion, i.e., its position and orientation for each image. Solving SFM will ...read more

April 26, 2002

Lattice Basis Reductions and Cryptography

Susanne Wetzel, Stevens Institute of TechnologyCo-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

For more information please contact:

Susanne Wetzel
Associate Professor
Babbio
Room 634
Phone: 201.216.5610
Fax: 201.216.8249

swetzel@cs.stevens.edu

April 22, 2002

TBA

Ross J. Michaels, Lehigh UniversitySponsored by Laboratory for Multimedia Vision and Visualization.

April 4, 2002

Spreading Rumors Cheaply, Quickly, Reliably

Yaron Minsky, Cornell UniversityCo-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

April 3, 2002

Regular languages definable by Lindstrom quantifiers

Zoltan Esik, University of Szeged

March 26, 2002

Some security issues and concerns in the financial services industry

Dan Schutzer, CitigroupCo-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

March 25, 2002

TBA

Jim Gee, University of PennsylvaniaSponsored by Laboratory for Multimedia Vision and Visualization.

March 22, 2002

Cryptographic key generation using features in a speaker's voice

Fabian Monrose, Lucent Bell LabsCo-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

March 21, 2002

Security in Distributed Computation

Rebecca Wright, AT&T Research LabsCo-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

For more information please contact:

Rebecca Wright
Professor
rwright@cs.stevens.edu

March 15, 2002

Symposium on Cyber Security and Trustworthy Software

Co-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

March 6, 2002

Implicit Shapes: Reconstruction and Transformation

Huong Dinh, Georgia Institute of TechnologySponsored by Laboratory for Multimedia Vision and Visualization.

March 1, 2002

Scalable Secret-Ballot Elections

Aggelos Kiayias, CUNYCo-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

February 20, 2002

A Type-Preserving Compiler Infrastructure

Christopher League, Yale UniversityCo-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

February 20, 2002

Tools for comparing executables without access to source code

Brenda S. Baker, Lucent Bell Labs

February 15, 2002

A Linearly typed assembly language for safe reuse of memory

Co-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

For more information please contact:

Adriana Compagnoni
Associate Professor
Lieb
Room 312
Phone: 201.216.5046
Fax: 201.216.8249

abc@cs.stevens.edu

February 12, 2002

Public key cryptography: toward ultimate security?

Vladimir Shpilrain, CUNYCo-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

January 18, 2002

Verifying Safety Architectures in Meta-Logical Frameworks

Carsten Schuermann, Yale UniversityCo-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

Stevens CS
        

News
gray gray Share/Save/Bookmark
Share
gray
Print
gray
Contacts  
 

Daniel Duchamp
Research Professor & Department Director
Lieb
Room 313
Phone: 201.216.5390
Fax: 201.216.8249
dduchamp@stevens.edu

Dawn Garcia
Administrative Assistant
Lieb
Room 317
Phone: 201.216.5578
Fax: 201.216.8249
dgarcia@cs.stevens.edu

Sherry Dorso
Assistant to the Director
Lieb 317
Phone: 201.216.5328
Fax: 201.216.8249
sdorso@stevens.edu

Stevens CS
Stevens CS Stevens CS Stevens CS
View my Iframe Content