Meeting Agenda - 2000.01.12
Meeting Agenda - 2000.01.12
In 1948, Fary and Sten showed that any planar drawing has a straight-line drawings. In 1990, two algorithms, FPP and Schnyder, are given to do the planar graph drawing on an grid. In my talk, I will introduce the algorthms briefly and show our implementation of the algorithm.
This is part of the cs760k project, which is done by Teresa and I last term.
A Proof-of-Deposit (POD) System is an image-based client-server system that uses advanced imaging and recognition technologies to automate and streamline over-the-counter proof-of-deposit operations by banks. It is a process of determining debits equal credits in deposits.
On each business day, transactions are collected from branches of banks and are processed by the POD system. Items arrive processing centers at different times of the day, and there are deadlines for processing cohering to government regulations. The rate of processing depends on the amount of resources allocated for POD operations. It is important for banks to allocate enough resources, including machinery and human operators, to finish daily POD operations on time while minimizing operational costs.
In this thesis, we develop a simulation model of the POD system. It provides estimations of processing workflow and finishing times under different volumes of work, different resources allocation strategies, and different configurations. This model can be used to search for optimal system configurations and resources allocations in daily POD operations, and thus helps banks to realize the best-cost savings possible.
I will give the definition of the Colin de Verdiere number of graph, and discuss some of its properties. I will do this in a way that is somewhat simpler than the usual approach, but I still do not know how to make it easy :-(
A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e1 and e2 such that G - {e1, e2} is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subgraphs. The theorem extends an earlier characterisation of Pfaffian bipartite graphs.
Traditionally, private networks have involved terminals and servers hardwired within one or several buildings. Security mainly focused on userid's passwords, and physical access to the environment. However, with the advent of IP mobility and wireless technology, this traditional network is evolving into a more ``virtual'' network using such tools as cell phones, palm pilots, laptops, and other mobile devices. However, as one still wishes this network to be ``private'', this technology presents new challenges from a security point of view.
In this talk I will detail the work I did on Virtual Private Networks over this past summer which I spent at Motorola Research Labs. I will describe the problems and challenges that we faced, our attempts to solve them, the tools that we used (WTLS, IPsec, MobileIP), and the problems we encountered along the way.
Most of us have experience giving presentations either as a student or at academic conferences where we "tell" our audience about our research topic. But giving a lecture, despite some similarities to presentations in terms of delivery skills, should actually be planned and structured in quite a different way to facilitate students' learning of the material. In this workshop you will see firsthand the differences between telling and teaching. You will also be given some useful tips to help you make the transition from presentations to lectures.
The workshop is open to anyone who teaches at UW and can be counted towards the Certificate in University Teaching if a workshop response paper is submitted and accepted. Please bring your lunch. Juice will be provided.
Please register for this workshop by sending an email to: trace@watserv1 by Tuesday, January 18, 2000, or by sending the form below to TRACE, MC 4055. If you have any questions, please contact TRACE at ext. 3132.
Dr. Kim J. Vicente is the director of the Cognitive Engineering Laboratory at the University of Toronto. He is affiliated with the Department of Mechanical and Industrial Engineering. He is the author of numerous journal articles, as well as the recent book "Cognitive Work Analysis: Toward Safe, Productive, and Healthy Computer-Based Work".
This presentation contributes to ongoing discussions defining the future of cognitive engineering research by examining a part of its past. The intellectual history of one particular line of research, that of the Electronics Department at Riso National Laboratory, is reviewed. A number of influential studies, conducted between 1962 and 1979, are described. Among these are operational experience acquired from the introduction of a prototype digital console in a nuclear research reactor, two field studies of professional operators conducting representative tasks in representative settings (electronic trouble-shooting and conventional power plant control), and analyses of over 645 human error reports in the nuclear and aviation industries. Examples of the influence that the Riso work has had on basic and applied problems are reviewed. Also, some of the themes characterizing the Riso research in cognitive engineering are identified. These themes help define what cognitive engineering is, and what it might be concerned with in the future.
Reception to follow at Grad House, 5 - 7 p.m.
For more info, contact Margaret Pacey, WatCHI chair mepacey@engmail.uwaterloo.ca, x3831 or x5607