UNM Computer Science

Colloquia



Google Calendar of Colloquia

Future Colloquia (Tentative Schedule)

Info on Colloquia Requirements for Students

For students taking the colloquia course, here is some information on requirements for Fall 2009.

Artificial Cells as Fixed-Points of Distributed Virtual Machines

Date: Friday, November 20th, 2009
Time: 12 pm — 12:50 pm
Place: Centennial Engineering Center, Room 1041

Lance R. Williams
Associate Professor
Dept. of Computer Science
University of New Mexico

Abstract:
The thing which distinguishes animate from inanimate matter is that animate matter uses information processing to work against entropy and produce a state of increased order in the physical world. Even the simplest single cell organisms are able to translate self-descriptions stored on DNA molecules into copies of themselves. We believe that this remarkable feat, which more than any other defines life itself, is accomplished by means of a process which is intimately related to a topic at the heart of computer science, namely, compilation of programming languages.

Self-replicating systems based on von Neumann's universal constructor lack transparency and for this reason have had virtually no impact in biology. We believe that fundamental computational principles underlying their operation, e.g., self-reflection, are obscured by the complexity of low-level implementations, e.g., cellular automata. We wish to bridge the gap between principles and implementation by means of transparent automatic processes for translating abstract descriptions of self-reproducing machines into physical implementations. The abstract descriptions are expressions in high-level functional programming languages which are compiled into bytecode quines, i.e., virtual-machine fixed-points. Implementation of the bytecodes as lightweight processes, or actors, which accomplish evaluation by means of continuation passing, yields a self-replicating distributed virtual machine--or artificial cell.

Bio:
Lance R. Williams received the BS degree in computer science from the Pennsylvania State University and the MS and PhD degrees in computer science from the University of Massachusetts. Prior to joining UNM, he was a post-doctoral scientist at NEC Research Institute. His researches include computer vision and graphics, neural computation and digital image processing.

High Efficiency Model Identification for Statistical Graphical Models

Date: Friday, November 6th, 2009
Time: 12 pm — 12:50 pm
Place: Centennial Engineering Center, Room 1041

Terran Lane
Associate Professor
Department of Computer Science
University of New Mexico

This is a joint work with Ben Yackley, Blake Anderson, Eduardo Corona, Curt Storlie, Karl Friston, and Will Penny.

Abstract:
Statistical graphical models, such as Bayesian networks, Markov random fields, or factor graphs, have become increasingly important for data modeling in fields as diverse as economics, ecology, physics, neuroscience, computer vision, and genomics. These models are attractive because they efficiently and compactly represent the often complex probability distributions that arise in such fields, and because they provide semantically rich models to domain scientists. However, often the graph structure of the target model is initially unknown -- indeed, in many cases the model structure is, itself, the quantity of interest to the domain scientist. The problem of structure identification (or model selection, if you prefer) remains a prominent open question in this field. Statistically, the problem is one of identifying (conditional, multivariate) dependencies from data, and is reasonably well understood. Computationally, however, the task is quite challenging: Worst case analysis shows that optimal structure identification is NP-hard, while practical algorithms are typically high-order polynomial runtime and may require many scans over the complete data in order to accumulate sufficient statistics. In this talk, we present preliminary work on a new approach to structure identification that exploits the topology of graph structure space itself. The key insight is that we need not compute the exact optimality criterion for every model we evalute during search, if we can approximate it well. And building good function approximators is precisely what Machine Learning and Statistics are very good at... We demonstrate how to use this insight to build a structure search algorithm that runs orders of magnitude faster than conventional approaches, while achieving results that are at least as good, if not better. We give preliminary data demonstrating our approach on a number of synthetic and real-world data sets, including some challenging neuroimaging data sets that involve hidden variables.

Bio:
Terran Lane is an associate professor of computer science at UNM. His primary (academic) interests are: machine learning; reinforcement learning, behavior, and control; and artificial intelligence in general. Professor Lane is also interested in computer/information security/privacy and bioinformatics.

Unraveling the Intricacies of Spatial Organization of the ErbB Receptors and Downstream Signaling Pathways

Date: Friday, October 30th, 2009
Time: 12 pm — 12:50 pm
Place: Centennial Engineering Center, Room 1041


Jeremy Edwards
Associate Professor
Dept. of Molecular Genetics and Microbiology, UNM Health Sciences Center, and Dept. of Chemical Engineering
University of New Mexico

Abstract:
Will be available shortly

Bio:
Prof. Edwards received both an MS and a PhD in Bioengineering from UCSD. He has held positions at Harvard Medical School and the University of Delaware before joining UNM in 2005. He is a member of the Cancer Research and Treatment Center at UNM.

Fear in Mediation, Exploiting the Windfall of Malice

Date: Friday, October 9th, 2009
Time: 12 pm — 12:50 pm
Place: Centennial Engineering Center, Room 1041


Jared Saia
Associate Professor
Department of Computer Science
University of New Mexico

Abstract:
In this talk, we consider a problem at the intersection of game theory and algorithms. Recent results show that the existence of malicious players in a game can, somewhat surprisingly, actually improve social welfare. This phenomena has been called the "windfall of malice". We ask: "Is it possible to achieve the windfall of malice, even without the actual existence of malicious players?" Surprisingly, we are able to show, that in some cases, the answer is yes. How can we achieve the beneficial impact of malicious players without their actual presence? Our approach is based on the concept of a mediator. Informally, a mediator is a trusted third party that suggests actions to each player. The players retain free will and can ignore the mediator's suggestions. The mediator proposes actions privately to each player, but the algorithm the mediator uses to decide what to propose is public knowledge. Surprisingly, it is possible to simulate a mediator, without the need of a trusted third party, through the technique of "cheap talk". This technique also applies to our own approach.

My talk will describe three results. First, we introduce a general method for designing mediators that is inspired by careful study of the windfall of malice effect. Second, we show the applicability of our approach by using it to design mediators for two particular games. Finally, we show the limits of our technique by proving an impossibility result that shows that for a large class of games, no mediator will improve the social welfare over the best Nash Equilibria.

Bio:
Jared Saia is an Associate Professor at the University of New Mexico. His broad research interests are in theory and algorithms with a focus on designing distributed algorithms that are robust against a computationally unbounded adversary. He is the recipient of several grants and awards including an NSF CAREER award and School of Engineering Faculty Research Excellence award.

Quantitative Analysis and Simulation of Latency-Related Pathways in a Murine Model of Mycobacterium tuberculosis Infection

Date: Friday, October 2nd, 2009
Time: 12 pm — 12:50 pm
Place: Centennial Engineering Center, Room 1041


Elebeoba E. May
Sandia National Lab

Abstract:
Tuberculosis (TB), caused by the bacterium Mycobacterium tuberculosis (Mtb), is a growing international health crisis. Mtb is able to persist in host tissues in a nonreplicating persistence (NRP) or latent state. This presents a challenge in the treatment of TB. Latent TB can re-activate in ~10% of individuals with normal immune systems, higher for those with compromised immune systems. A quantitative understanding of the interplay between genetic, metabolic, and host signal-transduction pathways that potentially impact the ability of Mtb to persist may help researchers develop more effective methods to battle the spread of TB and enable the reduction of associated fatalities. Drawing on in vitro and in vivo studies of latency, we develop a systems model of key pathways in M. tuberculosis that may impact entry into and exit from NRP and use BioXyce, a large-scale biological network simulator (May and Schiek, 2008), to understand the impact of mutations and environmental perturbations on bacterial growth and survival.

In vitro models have identified enzymes and associated pathways up regulated during NRP, which are thought to supply energy through alternative pathways to the biosynthetically restricted pathogen (Wayne and Sohaskey, 2001). In the hypoxic model of NRP, the tubercle bacilli can circumvent the shortage of oxygen by developing alternative energy generation mechanisms using pathways such as those involved in the glyoxylate-to-glycine shunt (GtG) that may serve to replenish NAD (Wayne and Sohaskey, 2001; Wayne and Lin, 1982). Using Michaelis-Menten and mass action kinetics, data from MetaCyc, and initial rates from BRENDA, we are constructing a BioXyce model of M.tuberculosis that includes pathways identified through in vitro and in vivo studies. Simulation and analysis of NRP-relevant pathways will enable quantitative assessment of the molecular basis of latency and reactivation in murine models of infection.

This work is supported by an NIH/NHLBI grant 5K25HL75105-3. Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company for the United States Department of Energy's National Nuclear Security Administration under contract DE-AC04-94AL85000.

Bio:
Dr. Elebeoba E. May received her Ph.D. in computer engineering from North Carolina State University and is a Principle Member Technical Staff in Sandia National Laboratories Discrete Mathematics and Complex Systems Department. She is an Adjunct Research Assistant Professor in UNM-HSC',s Internal Medicine Department with a joint appointment as an Adjunct Research Assistant Professor in UNM's Electrical and Computer Engineering Department. Her research interests include the use and application of information theory, coding theory, and signal processing to the analysis of genetic regulatory mechanisms, the design and development of intelligent biosensors, and large-scale simulation and analysis of biological pathways and systems. Since joining SNL, Dr. May has provided computational biology leadership in the development of BioXyce, a large-scale systems biology simulation tool and continues leading development efforts in the application of BioXyce to simulation-based studies of host/pathogen interactions.

Dr. May is a recipient of the 2003 and 2008 Women of Color Research Sciences and Technology Award for Outstanding Young Scientist or Engineer and an NIH/NHLBI K25 Quantitative Research Career Development Grant to quantitatively decipher the genetic basis of latency in M. tuberculosis infection.

Exploiting and Providing Research Data: Finding Strategies to Help Researchers

Date: Friday, September 18, 2009
Time: 1pm
Place: Centennial Science and Engineering Library Cafe Area

Professor Malcolm Atkinson and Professor David De Roure

Topic Summary:
The presentation topic is critical for young scientists and any researcher using large data sets and/or researching Internet data. Data-intensive science is emerging as a leading new research method and a focus of NSF, DOE, DOD,NIH, NEH, and other national funding agencies. The speakers are both players in the global research environment. The effective use of data is key to advances in almost all disciplines. There are opportunities for significant advances as a result of the pervasive growth in digital data, communication and devices, however, there are many challenges in enabling researchers to become adept in this new fast-changing context.

Speakers:
Professor Malcolm Atkinson plays a leading role in UK science and data policy making, and is on numerous European Union advisory boards such as the Baltic Grid and GEON. He leads training and education of EU-funded projects such as the International Collaboration to Extend and Advance Grid Education. He is a member of the Global Grid Forum Steering Group and Data Area Director for GGF.

Professor David De Roure has developed myExperiment which is designed to preserve and share scientific workflows. A founding member of the School's Intelligence, Agents, Multimedia Group, he leads the e-Research activities and is a Director of the Pervasive Systems Centre, and is involved in the UK e-Science and e-Social Science programs. His work focuses on creating new research methods in and between multiple disciplines, and his projects draw on Web 2.0, Semantic Web and workflow

Computer Graphics 2.0 - The Virtual World is not Enough

Date: Friday, Sep 11th, 2009
Time: 12 am — 12:50 pm
Place: Centennial Engineering Center, Room 1041

Prof. Dr.-Ing. Marcus Magnor
Computer Graphics Lab
TU Braunschweig

Abstract:
Expectations on computer graphics performance are rising continuously: whether in flight simulators, surgical planning systems, or computer games, ever more realistic rendering results are to be achieved at real-time frame rates. In fact, thanks to progress in graphics hardware as well as rendering algorithms, visual realism is today within reach of off-the-shelf PCs. With rapidly advancing rendering capabilities, the modeling process is becoming the limiting factor in computer graphics. Higher visual realism can be attained only by having available more detailed and accurate scene descriptions. So far, however, modeling 3D geometry and object texture, surface reflectance characteristics and scene illumination, character animation and emotion is a labor-intensive, tedious process. The cost of visually authentic content creation using conventional approaches increasingly threatens to stall further progress in realistic rendering applications.

In my talk, I will present an alternative modeling approach. I will discuss and exemplify different approaches on how to recover digital models from real-world imagery. The models may be derived either based on the physics of the scene, or by regarding perceptional consequences only. While the former approach yields physically meaningful information about the scene, approaches of the latter kind may allow for easier modeling and more natural-appearing rendering results. This opens up various new opportunities, extending the scope of computer graphics beyond virtual worlds to encompass visual reality.

Bio:
Marcus Magnor heads the Computer Graphics Lab of the Computer Science Department at Braunschweig University of Technology (TU Braunschweig). He received his BA (1995) and MS (1997) in Physics from the University of Würzburg and the University of New Mexico, respectively, and his PhD (2000) in Electrical Engineering from the Telecommunications Lab at the University of Erlangen. For his post-graduate studies, he joined the Computer Graphics Lab at Stanford University. In 2002, he established the Independent Research Group Graphics-Optics-Vision at the Max-Planck-Institut Informatik in Saarbrücken. He completed his habilitation and received the venia legendi in Computer Science from Saarland University in 2005. His research interests meander along the visual information processing pipeline, from image formation, acquisition, and analysis to image synthesis, display, perception, and cognition. Recent and ongoing research topics include video-based rendering, 3D-TV, augmented vision, video editing, optical phenomena, as well as astrophysical visualization (research).

U-Control: User-controlled Privacy Management in Social Networks

Date: Tuesday, May 5th, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Dongwan Shin
New Mexico Tech

Abstract:
As the use of personal information in online social networking seems manifold, including the representation of an individual's digital persona (social role) and identification, so does the abuse or misuse of the information. The issue of privacy is critically important in this context. Privacy encompasses the right to control information about individuals, including the right to limit access to that information, and the loss of such control often makes us exposed to a bewildering excess of intentional and unintended consequences, including criminal activities ranging from identity theft to online and physical stalking; from embarrassment to price discrimination and blackmailing. In this talk, I will present a novel framework for enabling user-controlled sharing of sensitive personal information for better privacy protection in current online social networks. Specifically, the framework called U-Control is proposed to facilitate digital persona and privacy management (DPPM) in a user-centric way that it can satisfy diverse privacy requirements and specification, and social network environments

Bio:
Dr. Shin is currently an assistant professor of Computer Science and Engineering at New Mexico Tech. His research interest lies in the areas of computer security and privacy, especially, access control, digital identity, pervasive computing security, and applied cryptography. His research at Tech has been supported by National Science Foundation, Sandia National Laboratories, Department of Defense, Intel, and New Mexico Tech. He is currently the director of Secure Computing Laboratory at New Mexico Tech. Prior to joining Tech, he was actively involved in a variety of research projects sponsored by NSA, DoE, ETRI, and Bank of America. Dongwan received his PhD in Information Technology from the University of North Carolina at Charlotte.

What is it like to be a molecular robot?

Date: Thursday, May 7th, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Milan Stojanovic
Columbia University and Center for Molecular Cybernetics

Abstract:
Primary focus of the seminar will be on robotic behaviors in single molecules. We start with legs implementing local residency rules, and build higher-order behaviors by adding leg-leg communications, and introducing various sensors. Current robots walk directionally over prescriptive landscapes or walk randomly searching for sticky points. But, could they leave their well-controlled environments and interact with living tissues?

Digital Forensics and Investigation

Date: Thursday, April 23rd, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Jonathan J. Mandeville
Verizon FNS (at Sandia National Laboratories)

Abstract:
Digital forensics is a branch of forensic science that seeks to understand artifacts in computers, portable electronic devices, and any other form of electronic media. The goal may be to investigate a cyber intrusion, employee waste/fraud/abuse, or other criminal activities. Each year millions of dollars are spent on digital forensics equipment, training, and personnel by corporations and governments around the world. There is also a growing industry in private-sector data recovery and investigation that uses principles of digital forensics. Closely related to digital forensic are Intrusion Detection and Cyber Security. This presentation will cover the basics of digital forensics, including chain of custody and evidence-gathering methods, software and hardware tools, courtroom testimony, as well as discuss preparation for internships or employment with law enforcement or other government agencies. If there is time, some discussion of IDS will be included.

Bio:
Jonathan J. Mandeville is a contractor at Sandia National Labs in the Cyber Monitoring and Policies group. Prior to his current role he helped develop and deploy a program at Sandia that secures laptop computers for travel abroad. He is in the process of receiving his ENCE certification, and is a Certified Ethical Hacker. He expects to graduate with his B.S. in Computer Science from the University of New Mexico in the Spring of 2010.

Distributed Graph Databases and the Emerging Web of Data

Date: Thursday, April 16th, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Marko A. Rodriguez
Center for Nonlinear Studies
Los Alamos National Laboratory

Abstract:
The World Wide Web is the defacto medium for publicly exposing a corpus of interrelated documents. In its current form, the World Wide Web is the Web of Documents. The next generation of the World Wide Web will support the Web of Data. The Web of Data utilizes the same Uniform Resource Identifier (URI) address space as the Web of Documents, but instead of a exposing a graph of documents, the Web of Data exposes a graph of data. Given that the URI address space of the Web is distributed and infinite, the Web of Data provides a single unified space by which the worlds data can be publicly exposed and interrelated. The Web of Data is supported by both graph databases (which structure the data) and distributed computing mechanism (which process the data). This presentation will discuss the Web of Data, graph databases, and models of computing in this emerging space.

Bio:

Marko A. Rodriguez is a Director's Fellow at the Center for Nonlinear Studies at the Los Alamos National Laboratory. While Marko has degrees in both cognitive (BS) and computer science (MS and PhD), he is very eclectic in his research interests. Marko focuses on multi-relational graph analysis techniques, models of computing on the Web, novel logics and reasoning mechanisms, as well as computational systems to support various ethical theories. Finally, Marko is also the co-founder and chief technology officer of the Santa Fe-based Knowledge Reef Systems Inc., where he focuses on novel algorithms to support the scholarly communication process. Please visit Marko at http://markorodriguez.com for more information.

System Software for Cloud Computing

Date: Thursday, April 2nd, 2009
Time: 11 am — 12:15 pm
Place: Centennial Engineering Center Auditorium

Dilma da Silva
IBM T. J. Watson Research Center

Abstract:
Cloud Computing has been receiving a lot of attention from the computing community. It is perceived by some as the "IT fad of the moment" and by others as a revolutionary approach to deliver computing services. In this talk we analyze cloud computing from the perspective of system software, exploring how this new model impacts current practices in operating systems and distributed computing. We identify a set of exciting research opportunities in resource management for cloud computing and discuss how cloud computing itself affects the way we carry out research projects

Bio:
Dilma da Silva is a researcher at the IBM T. J. Watson Research Center, in New York. She manages the Advanced Operating Systems group. She received her Ph.D in Computer Science from Georgia Tech in 1997. Prior to joining IBM, she was an Assistant Professor at University of Sao Paulo, Brazil. Her research in operating systems addresses the need for scalable and customizable system software. She has published more than 60 technical papers. Dilma is a member of the board of CRA-W (Computer Research Association's Committee on the Status of Women in Computing Research) and a co-founder of the Latinas in Computing group. For relaxation and inspiration, Dilma spends time reading novels, knitting, and coming up with plots for books she may write one day.

For more information, visit www.research.ibm.com/people/d/dilma

Scalable Data Services for Data-Intensive Computing Environments

Date: Thursday, March 26th, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Patrick Widener, Ph.D.
Department of Computer Science
University of New Mexico

Abstract:
Future I/O systems for increasingly data-intensive computing environments face a challenging set of requirements. Data extraction must be efficient, fast, and flexible; on-demand data annotation — metadata creation and management — must be possible without modifying application code; and data products must be available for concurrent use by multiple applications (such as visualization and storage), requiring consistency management and scheduling. In this talk, I will present a collection of techniques (DataTaps, IOgraphs, and Metabots) designed to address these challenges by decoupling data operations in space and in time from core application codes. Our research results show that these techniques can extract data efficiently and without perturbing compute nodes, that they can be used to perform application-specific transformations while maintaining acceptable I/O bandwidth and avoiding back-pressure, and that they can exploit "in-band" and "out-of-band" decoupling to improve overall I/O performance. Our approach enables the creation of scalable data services which can keep pace with the next generation of data-intensive applications.

Bio:
Patrick M. Widener is a Research Assistant Professor in the Department of Computer Science at the University of New Mexico. Dr. Widener's research interests include experimental systems, I/O and storage software for large-data environments, middleware, and the generation and use of metadata. He focuses primarily on high-performance, enterprise, and pervasive application domains. Dr. Widener received his Ph.D. in Computer Science from the Georgia Institute of Technology in 2005. Prior to beginning his Ph.D. study, he was employed as a software developer by several companies which no longer exist. He also holds a Master of Computer Science degree from the University of Virginia (1992), and a Bachelor of Science in Computer Science from James Madison University (1990).

Analyzing Security Critical Components with a System Level Perspective

Date: Thursday, March 12th, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Edward J. Nava
Sandia National Laboratories

Abstract:
Considerable work is done today to analyze hardware, application software, operating systems, and network communication components for security issues and to develop enhancements for each in an effort to achieve a more secure system. A typical approach is to develop and analyze each of these independently and then develop security enhancements for each. With this approach, improvements can be made but the overall system security may still be weak. In order to effectively analyze a system and develop a secure solution, all components of the system must be included in the process. The operating environment and the life cycle of the system must also be considered. This presentation describes some of the shortcomings of current designs and outlines the beginning steps for a systems-level approach for designing a secure computing system.

Biography:
A graduate of New Mexico State University, University of New Mexico, and Stanford University, he has worked at Sandia National Laboratories since 1979. His initial assignment was in the intrusion detection sensors division, where he conducted research on new sensors, sensor configurations, and signal processing techniques. Later, he moved to the exploratory systems division, where he developed Kalman Filter based, real-time aided navigation systems for use on military terrestrial and space applications. In 1987, he was promoted and led a group that designed multi-processor flight computers for real-time applications and other electronic weapon subsystems. In 1996, he moved to the Systems Analysis and Research Center, where he leads vulnerability analyses activities for high-consequence systems for the US Government. In 1985 he was commissioned as an Engineering Duty Officer in the US Navy Reserve. As part of his Navy duties, he focused on Information Security for ship-borne systems. In 2001, he was recalled to active duty by the US Navy, first to teach at the US Naval Academy, and later to represent the Navy at Los Alamos National Laboratory. He was released from active duty in 2006 and returned to Sandia.

Natural Immunity and Machine Security: The curious problem of creating nature-inspired security systems

Date: Thursday, Feburary 24th, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Scott Miller
LANL

Abstract:
Economic forces and user demand have driven computer systems to increasing complexity and to increasing deployment speed. All complex systems have complicated failure modes, we've become reliant on prophylactic anti-malware systems that are increasingly expensive and decreasingly effective. How does the human immunity prevent and manage infection without an A/V subscription or updates? This talk will overview some of the key systems present in human immunity -- self/non-self, data reduction, federated system, security in depth -- from a Computer Science perspective.

Biography:
Scott Miller works in the Advanced Computing Solutions Program, a Los Alamos National Laboratory organization chartered with the forward-thinking research and development of next generation security systems. He holds a Masters in Computer Science from the New Mexico Institute of Mining and Technology, his thesis being "A Bioinformatics Approach to the Automated Analysis of Binary Executables."

Performance Prediction of Software Performance: A Model Interoperability Approach

Date: Thursday, Feburary 19th, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Connie U. Smith
L&S Computer Technology, Inc

Abstract:
Performance, both responsiveness and scalability, is an important quality of today's software. Yet many software systems cannot be used as they are initially implemented due to performance problems. These performance failures can translate into significant costs due to damaged customer relations, lost income, and time and budget overruns to correct the problem. Our experience is that performance problems are most often due to fundamental architectural or design problems rather than inefficient coding. Thus, performance problems are introduced early in the development process but are typically not discovered until late, when they are more difficult and costly to fix.

The talk first introduces the Software Performance Engineering (SPE) approach for predicting performance during the early stages of development, before the architecture is fully determined. Next, the software and system performance model technology and data requirements are explained. Then an overview of the foundations of the software performance model interoperability approach is presented. It presents two performance model interchange formats: S-PMIF and PMIF, and proof of concept results of model interoperability in the SPE process. We briefly cover recent extensions to the model interoperability approach, and conclude with a discussion of future work.

Bio:
Connie U. Smith, Ph.D. is a principal consultant of the Performance Engineering Services Division of L&S Computer Technology, Inc. She received a BA in mathematics from the University of Colorado and MA and Ph.D. degrees in computer science from the University of Texas at Austin. She is the author of Performance Engineering of Software Systems published in 1990 by Addison-Wesley, Performance Solutions: A Practical Guide to Creating Responsive, Scalable Software published in 2002 in Addison-Wesley's Object Technology Series, and approximately 100 scientific papers. She is the creator of the SPE-ED™ performance engineering tool and collaborated on developing several performance model interchange formats. She has over 25 years of experience in the practice, research and development of the SPE performance prediction techniques, computer performance modeling and evaluation, performance patterns and antipatterns, tool interoperability, and tool development. Dr. Smith received the Computer Measurement Group's prestigious AA Michelson lifetime achievement award for technical excellence and professional contributions for her SPE work.

She frequently serves on conference and program committees, including founding and chairing the First International Workshop on Software and Performance (WOSP) in 1998, serving on Conference and Program Committees for subsequent WOSP conferences, and currently leads the WOSP Advisory Committee. She served as an officer of ACM SIGMETRICS for 10 years, is a past ACM National Lecturer, is an active member of the Computer Measurement Group and the Quantitative Evaluation of Systems (QEST) conferences. She was previously a faculty member of the computer science department at Duke University. Since then she has been with L&S Computer Technology specializing in the development and support of the software performance engineering tool, SPE-ED™, applying performance prediction techniques to software, teaching SPE seminars, and research and writing on SPE. Dr. Smith can be reached by email at . A list of publications may be found at http://www.spe-ed.com.

Listening to the Earth

Date: Thursday, Feburary 12th, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Andrea Polli
Director, Interdisciplinary Film and Digital Media (IFDM)
UNM

Abstract:
As has been seen in recent Hurricane disasters, many lives can depend on the interpretation of global information. Developing a language or series of languages for communicating this mass of data must evolve, and part of that evolution must include the work of artists.

The interpretation and presentation of data using sound is part of a growing movement in what is called data sonification. Like its more popular counterpart, data visualization, sonification transforms data in an attempt to communicate meaning.

Andrea Polli presents her sonification research interpreting actual and simulated data that describe local and global climates.

Bio:
http://www.andreapolli.com/bio.htm

Tree-based Overlay Networks

Date: Thursday, Feburary 5th, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Dorian Arnold
Professor, UNM Computer Science

Abstract:
As high performance computing (HPC) systems continue to increase in size, scalable, reliable computational models become critical. Tree-based overlay networks (TBONs) leverage the logarithmic scaling properties of the tree organization to provide scalable data multicast, data gather, and data aggregation services. In this talk, I describe our use of the tree-based overlay network (TBON) model to address tool and application scalability. In particular, I present MRNet, our TBON prototype, and several example MRNet applications including debugging and profiling tools developed and used at the Lawrence Livermore and the Los Alamos National Laboratories. I will also highlight some novel algorithms we developed for failure recovery in TBON environments and describe the major research directions I am currently exploring.

Bio:
Dorian is an assistant professor in Department of Computer Science at University of New Mexico. His research focuses on the scalable performance and reliability of extremely large scale systems with tens of thousands, hundreds of thousands or even millions of cores. Dorian earned his Ph.D. at the University of Wisconsin in 2008, where he developed MRNet with Phil Roth and their advisor, Barton Miller. He received M.S. and B.S. degrees from the University of Tennessee in 1998 and Regis University in 1996. Dorian also worked in the Innovative Computing Laboratory, directed by Dr. Jack Dongarra, as technical lead of the NetSolve project from 1999 - 2001 -- NetSolve won an R&D Top 100 award in 2000. As a student scholar at the Lawrence Livermore National Laboratory in 2006, Dorian (in collaboration with LLNL researchers) developed the Stack Trace Analysis Tool for effectively debugging large scale applications.

Visualizing Evolutionary History

Date: Thursday, January 29th, 2009
Time: 11 am — 12:15 pm
Place: ME 218

Prof. Nina Amenta
UC Davis

Abstract:
Evolutionary histories for groups of living organisms are now routinely constructed based on genomic data. These phylogenies imply theories about what the hypothetical ancestor species looked like, which can be visualized dramatically using modern computer graphics.

As an example, we present some visualizations of the skulls of the hypothetical ancestors of the Old World monkeys, based on the skulls of their living descendants. But these reconstructions are clearly not the whole story; the oldest fossils in the group are quite different from the our reconstructions.

We consider integrating the information from fossils into the tree, in order to not only improve the visualization, but also to study the differences between possible placements of the fossil in the tree.

Bio:
Prof. Nina Amenta studies computational geometry and three-dimensional geometry processing, and applications of these computational techniques to the visualization of biological data. She got her BA at Yale Univeristy in 1979, and worked for several years in the medical ultrasound industry. She holds a PhD from the University of California at Berkeley and was a professor at the University of Texas at Austin from 1997-2002, prior to her current appointment at the University of California at Davis. She is U.C. Davis Chancellor's Fellow, and an editor of ACM Transactions on Graphics.

Colloquia Archives