2005 Semester I
11:00 - 12:00 Friday in AG CNS and AG TSV
Preliminary Study of Teaching/Learning & Assessment Activities
Abstract This preliminary study was conducted to look for evidence of the presence or otherwise of constructive alignment between the learning activities and assessment of each subject in the SIT. Developing constructive alignment between the subject objectives, learning activities and assessment of each subject is essential in order to maximize student outcomes and minimize student workload. Constructive alignment in the subject or program design exists when, Objectives, context, and assessment tasks all line up. (Dart 1998, p.118) (Biggs 2003, Clarke 2003) The subsequent reduction of cognitive load for students is especially relevant in areas like CS/IT with rapid expanding knowledge bases. (Touvinen 2000). In addition to facilitate student progress it is desirable that learning and assessment activities within a program or subject be ordered so that complex tasks are preceded by simple learning tasks that prepare the student for the later tasks. This talk is based on an in-house questionnaire/survey of teaching and learning activities conducted in order to provide a preliminary measure of the use of various teaching and learning activities in teaching/learning contexts such as Tutorials, Lectures, Practicals and Assessment. A simple list of Teaching/Learning/Assessment activities was created using informal feedback from teaching staff. Blooms Taxonomy of Learning (Knight 1995, p.102) was used to classify the complexity of each learning and assessment activity. The results of the questionnaire were then compiled and used to provide some simple measures of alignment between the various teaching/learning and assessment activities whose use was reported. The questionnaire also included questions about the use of groups in various learning contexts and in various learning and assessment tasks.Is the Search Space Paradigm Valid?
I have been investigating the circuit size of problems
in NP union co-NP (level 1 of the polytime hierarchy), and
it appears that polynomial size circuits suffice. This
calls into question an often unstated assumption, the
search space paradigm, whose validity is in fact not
based on P != NP, but rather on the circuit size question.
I report on my results so far and discuss the paradigm in light of
these.
Advanced Computational Methods for Bioimaging
Recent advances in fluorescent and microscopic imaging technology
significantly
assist life-science researchers in the study of the structures and
functions of
cells and molecules. Conventional studies require the manual
processing of
huge amounts of image data; therefore the analysis cannot be completely
carried out.
Such analysis often leads to poor interpretations and cannot provide
answers to
many biologically interesting questions.
In this talk, I will present some interesting projects on bioimaging
collaborated
with the Harvard Center for Bioinformatics at the Harvard Medical School.
Computational and pattern recognition methods to be developed are
intended to
aid biological researchers to study the mitotic data at dynamic ranges
for various
applications. The initial priority for the application of this research
will be high
throughput screening of novel anti-mitotic drugs as potential cancer
therapeutic agents.
Condor, Nimrod and Distributed Computing
Abstract: TBATalks on Current Research
Abstracts: TBACurrent Research
Abstracts: TBA2005 Semester II
11:00 - 12:00 Friday in AG CNS and AG TSV
- Aug. 12: Albin Zager (Student Talk)
Aussie Gems - Australian Exploration Management System
Abstract: This presentation is to inform the SIT staff of a software project currently in progress for CP3046/47. The project aims to design a software application for the geologists to manage drilling projects and or contracts that are not normally available with current off the shelf geological applications. While the CP3046/47 project is focusing on the management of business information, the client (Conglomerate Project Management (CPM)) eventually would like the application to assist in planing drill hole placement, managing equipment schedules to maximize resource utilization and produce visualizations of ore reserves based on results from geochemical testing. These areas may be of interest to researchers at SIT as they present some interesting oportunities for applied IT research. Talk outline: 1. Introduction/history 2. Problem/opportunity 3. drill rig management 4. Grid Transformation 5. Drill hole planning 6. drill program scheduling display 7. drill statistics (graphical output ) 8. Projects cost tracking 9. 2D cross sections based on geochemical results 10. 3D diagram of ore reserve calculated from geochemical results
2004 Semester II
11:00 - 12:00 Friday in AG CNS and AG TSV
- August 27: Dr. Hossein Ghodosi TBA
- September 10: Dr. Bruce Litow
Data Compression for Graphs
This talk will look at current research and problems associated with data compression methods for graphs. Special attention will be given to compression of highly symmetrical graphs.
- September 24: Lisa Dunnett
Syntenic Distance
Phylogeny describes the evolutionary relationships between different species. These relationships can be represented in the form of a phylogenetic tree. Determining the topology of this tree is particularly useful in assigning conservation priorities to a species, and in selecting areas appropriate for their conservation. Syntenic Distance has become a useful measure in constructing phylogenetic trees. Syntenic Distance is defined as the minimum number of chromosome rearrangements required to transform a single genome from one species into genome from another species. Three types of chromosome rearrangements are important to the computation of syntenic distance: 1. Fusion (Two chromosomes fuse together to create a single chromosome) 2. Fission (One chromosome splits to form two chromosomes) 3. Translocation (Two chromosomes exchange sets of genes) Previous research has proven that the syntenic distance problem is P-Hard. However, our research is based on the observation that this distance is bounded above (essentially) by chromosome number, not gene number, and so even exponential-time algorithms may be feasible. We propose to identify how far syntenic distance can be used to infer phylogenies, or at least how much evolutionary information can be extracted from its application to appropriate datasets - October 15: Ickjai Lee
Spatio-Temporal Association Rules-Based Data Mining
Spatiotemporal association rules mining is to reveal interrelationships within large spatiotemporal databases. One critical limitation of traditional approaches is that they are confined to qualitative attribute measures. Quantitative frequencies are either ignored or discretized. In this talk, I propose a robust data mining method that efficiently reveals frequency-incorporated associations in spatiotemporal databases.
- October 22: Dmitry Konovalov: NOTE: TG131, TSV ONLY!!
Annual ACS conference in Melbourne
- October 29: Ken Tollefson TBA
2004 Semester I
11:00 - 12:00 Friday in AG CNS and TG125(AG TSV)
- 11:00 - 12:00 Friday, March 19: Dr. Chris Gaskett
A Vision-based Control System for a Humanoid Robot
This presentation will describe my research at the Department of Humanoid Robotics and Computational Neuroscience, part of ATR International (Japan). I developed a vision-based control system for a hydraulically actuated humanoid robot.
The intention was to create human-like behaviour by using active, binocular vision, visual feedback, and exploiting the redundancy in the system. Rather than the traditional robotics approach of using the known kinematics of the robot and working in Cartesian space, Dr. Gaskett used a network of simple relationships with a learning system and worked in body and vision-based coordinates.
As well as appearing human-like, the approach avoids calibration and is highly robust. For example, the system degrades gracefully if one eye is covered or a joint fails. The system is now being used as a control and behaviour layer for further research at ATR.
- 11:00 - 12:00 Friday, March 26: Jarrod Trevathan
Secure Auction Protocols
An auction is an exchange mechanism where many potential buyers submit bids for a commodity that is usually awarded to the highest bidder. The Auctioneer accepts bids on behalf of the seller of the commodity and determines who the winner is according to the auction rules. In recent years, several companies have emerged that offer auctioning services over a network such as eBay and Onsale. These types of auctions have geographical advantages over traditional auctions as sellers and buyers need not be physically present at a central location during the auction proceedi ngs.
This allows for larger and more elaborate auctions reaching many more bidders than was possible with traditional auctions. However this also provides opportunities for the auction participants to cheat.
As participants are not co-present buyers or sellers might repudiate bids, refuse to pay for or deliver goods, collude to affect the settlement price or just disavow the auction outcome all together. Furthermore, the auctioneer might be biased or corrupt and can selectively block bids, abuse bidder information or award the auction to someone other than the legitimate winner. In addition, an outsider not privy to the auction might attempt to disrupt the auction protocol in some manner. Many different cryptographic schemes have been proposed to deal with these problems. However, there is no known means of comparison to assess how schemes perform based on fairness, security and design criteria. Furthermore no schemes have specifically addressed continuous double auctions. In this talk, we will discuss some of these issues.
- 11:00 - 12:00 Friday, April 16: Dr. Ickjai Lee
Postclustering and its applications in data-rich GIS environments
Fast data gathering process results in data-rich environments that exceed the capability of human analysis. Sophisticated data mining tools become necessary for handling massive databases. Among many other data mining techniques, clustering is one of the most popular and frequently used approach for finding undetected or unexpected patterns of concentrations residing in large spatio-temporal databases. That is, clustering provides answers for ``where?'' and ``when?'', and suggests leads into ``why?'' for post-clustering explorations. Thus, clustering is seen as a starting point for a series of knowledge discovery processes in massive spatio-temporal databases. Numerous clustering methods have been proposed in the data mining community with different emphasis and applicability. As clustering becomes mature, sophisticated post-clustering methods are greatly demanding. However, post-clustering processes have attracted less attention than clustering itself despite their importance. Identifying shapes (equivalently boundaries) of clusters is an intuitive way of reasoning about clusters. If shapes of clusters of a set P of points match with a particular feature data, then clusters exhibit a high association with the feature. However, it is not easy to extract the shape and still there is no method that can be considered as an absolute winner since most approaches are application-dependent. In this talk, I'll introduce an automatic boundary extraction process for clusters in point data requiring O(n) time and extend it to cluster polygonization. In addition, I'll provide a number of applications of postclustering. No prior knowledge is required for this talk.
- 11:00 - 12:00 Venue:TBA Friday, April 23: Dr. Dmitry Konovalov
KinGroup: A program for pedigree relationship reconstruction and kin group assignments using genetic markers
KinGroup is an open source java program implementing a maximum likelihood approach to pedigree relationships reconstruction and kin group assignment. KinGroup implements a new method of reconstructing groups of kin that share a common relationship by estimating an overall likelihood for alternative groupings. Three search algorithms are implemented to partition the data set into pedigree based subgroups. The program is available from www.kingroup.org or www.it.jcu.edu.au/kingroup websites.
- 11:00 - 12:00 Friday, April 30: Dr. Bruce Litow
A potentially serious weakness of RSA
RSA is the most important asymmetric key cipher in use today. It plays a crucial role in authentication and key sharing protocols on the internet, and is central to many public key set-ups. It is widely believed that 1024 bit RSA is secure from direct factoring attacks. We show a connection between factoring the RSA `key' (the so-called modulus) and an experimentally verifiable property of Chinese remaindering. We discuss the main components of the connection and show how, if experimental results (not yet known) are of a certain definite type, then the modulus can be factored almost surely in polynomial time. Aside from brushing up on your familiarity with how RSA actually works, no previous background is assumed, nearly.
- 11:00 - 12:00 Friday, May 21: Prof. Francois Coallier
Software standards
Prof. Coallier is the chairman of ISO /IEC JTC 1/SC7, an international standards group for World software markets. To get an idea of his talk, please see coallier.pdf
- 11:00 - 12:00 Friday, May 28: Mr. Ken Tollefson
Just around the Corner? - An Overview of the Ipv6
Ipv4 has served the Internet Community well but has a range of issues that have been known for a long time and some of these issues are growing in significance. There is a portion of the Internet Community that sees the end of Ipv4 being imminent because these issues have been addressed with temporary solutions to what are structural problems. Ipv6, a replacement protocol for Ipv4, has been in development for a considerable length of time and support for its implementation is growing in many sections of the Internet Community. There is a lot of serious research being undertaken and a lot of claims have been made about the benefits to be had from its implementation. This seminar will look at some of the issues involved in the implementation of Ipv6.
2003 Seminars
2001 Seminars
2000 Seminars
1999 Seminars
1998 Seminars
1997 Seminars
1996 Seminars
1995 Seminars
1994 Seminars
For any additional information about seminars (or if you wish to give a seminar) please contact the seminar coordinator .