] > 0619 2008 Dr. Daniel Bilar 2:30pm CERM 438 We discuss how to tackle the detection of highly evolved, modern malware. We first show some worrisome anti-virus detection trends and developments. We then impart the results of two years' worth of investigating structural properties of modern malware. We conclude that given the empirical, practical, and fundamental theoretical limitations of traditional 'white-box' AV, it is time to move on: From predominantly byte sequence-matching white-box AV premised on classic Turing Machine models (computation-as-functions) towards high entropic defenses, black-box process modeling, as expressed by interactive computing models (computation-as-interaction). If time permits, we shall scare the audience with malware to come: RoQ, Satan, generalized side channel, IC, and the idea of quantum malware. Wellesley College 0404 2008 Dr. Zeyun Yu 10:30am CERM 438 Intracellular calcium has been found to be the central regulator of cardiac cell contractions. Modeling calcium dynamics is hence fundamental in understanding the excitation-contraction (E-C) coupling in cardiac myocytes. Both experimental and computational studies have revealed that the geometry of calcium-regulating organelles, such as transverse-tubules (T-tubules) and junctional sarcoplasmic reticulum (jSR), can significantly affect the calcium dynamics, suggesting that 3D structures from imaging data would provide more realistic modeling of the EC coupling mechanism. To bridge the gap between imaging and simulation, I shall present a chain of image analysis and geometric processing approaches to constructing multiscale models of ventricular cells. In particular, two imaging techniques are considered: one is the two-photon laserscanning microscopy imaging at the micro-scale, and the other is the electron tomography imaging at the nano-scale. Accordingly, 3D realistic geometric models of T-tubular systems and individual calcium release units (CRUs) are computed from the imaging data and represented by high-quality surface and volumetric meshes. Both stochastic (Monte-Carlo-based) methods and deterministic (PDE-based) numerical approaches are utilized to simulate calcium release, buffering, and diffusion in ventricular myocytes. National Biomedicine Computation Resource, University of California, San Diego University of California, San Diego 0418 2008 Dr. Ittiphong Leevongwat 11:00am Math 303 The status of electricity deregulation in the United States will be presented and the use of Locational Marginal Pricing (LMP) in deregulated power markets will be described. The use of LMP in analyzing electricity pricing in a deregulated electric utility environment will also be presented. Using LMP, the proposed methodology for determining electricity prices in deregulated power markets is presented as an optimization problem that aims to minimize the total system production cost subject to physical and operational power system constraints. As building blocks in the modeling and analysis, NERC guidelines for regional generation and transmission planning are considered. Dr. Ittiphong Leevongwat earned his B.Eng. in Control Engineering from King Mongkut's Institute of Technology, Thailand in 1996, Master of Manufacturing Management from the Pennsylvania State University in 2002, and Ph.D. in Electrical Engineering and Computer Science from Tulane University in 2007 under Dr. Parviz Rastgoufard's advising. He worked in petrochemical and software industries. His research interests are power systems optimization and economics, energy efficiency, software development, and business intelligence. He is a Visiting Assistant Professor at the University of New Orleans. Visiting Assistant Professor, EE, UNO 0404 2008 Dr. Huimin Chen 1:00pm Math 303 In this talk, I will discuss the recent advances in sparse representation, model selection and compressed sensing. I will start with some data streaming and dimension reduction examples and bring the unified view of variable/model selection and compressed sensing through an optimization framework. The geometric interpretation and implication to some interesting applications in computer science area will be briefly mentioned. Dr. Huimin Chen received the B.E. and M.E. degrees from Department of Automation, Tsinghua University, Beijing, China, in 1996 and 1998, respectively, and the Ph.D. degree from the Department of Electrical and Computer Engineering, University of Connecticut, Storrs, in 2002, all in electrical engineering. He was a post doctorate research associate at Physics and Astronomy Department, University of California, Los Angeles, and a visiting researcher with the Department of Electrical and Computer Engineering, Carnegie Mellon University from July 2002 where his research focus was on weak signal detection for single electron spin microscopy. He joined the Department of Electrical Engineering, University of New Orleans in Jan. 2003 as an assistant professor. His research interests are in general areas of signal processing, estimation theory, and information theory with applications to target detection and target tracking. Assistant Professor, EE, UNO 0331 2008 Christopher Taylor 2:30pm CERM 438 We are entering an exciting era of genomic research that is being driven by constantly evolving DNA sequencing technologies. In just the last decade, we have witnessed the completion of the human genome sequence (Human Genome Project 2001), nearly 1000 bacterial genomes, and over 165 eukaryotic species. The advent of DNA microarrays has significantly decreased the cost of many resequencing applications and a number of emerging ultra high-throughput sequencing technologies promise to move us ever closer to the much sought-after $1,000 genome. This talk will present recent work using DNA microarray technology that investigates human DNA replication timing. The focus will be on algorithms developed to classify, visualize, and simulate the process of DNA replication and its timing. Due to the sheer size of the full human genome, efficiency of our algorithms are a paramount concern in terms of both timecomplexity and memory requirements. The computational challenges involved with anticipated ultra high-throughput sequencing technologies provide an ideal realm for future research which can build on the same algorithmic techniques we use to analyze and process microarray data. include security and privacy, pervasive computing, computer networks, distributed systems, and statistical system analysis and design. University of Virginia Computer Science 0328 2008 Dr. Dimitrios Charalampidis 2:00pm Math 303 A technique for synthesizing natural textures will be presented, with emphasis on quasiperiodic and structural textures. Textures are assumed to be composed of three components, namely illumination, structure, and stochastic. In contrast to previous techniques, a joint approach for handling the texture's global illumination, irregular structure, and stochastic component is used. Furthermore, the proposed technique does not produce verbatim copies in the synthesized texture. More specifically, a top-down approach is used for extraction of texture elements (textons) in which, in contrast to previous texton-based approaches, no assumptions regarding perfect periodicity are made. Results show that the proposed method is successful in synthesizing structural textures visually indistinguishable to the original. Moreover, the method is successful in synthesizing a variety of stochastic textures. Dr. Dimitrios Charalampidis received the Diploma degree in Electrical Engineering and Computer Technology from the University of Patras, Patras, Greece, in 1996, and the M.S. and Ph.D. degrees in Electrical Engineering from the University of Central Florida, Orlando, in 1998 and 2001, respectively. In 2001, he joined the Electrical Engineering department at University of New Orleans, where he is currently an Associate Professor and the Associate Chair of the department. His research interests include image and signal processing, pattern recognition, and neural networks. Assistant Professor, EE, UNO 0307 2008 Jingqi Wu 1:00pm Math 318 A mobile ad-hoc network (MANET) contains a cluster of mobile hosts, which communicate with each other through the shared wireless bandwidth. MAC (Medium Access Control) protocols are designed and implemented to reduce transmission collisions and to improve bandwidth sharing efficiency. While many of the existing MAC schemes take the single-channel approach, there are several multi-channel MAC schemes, in which the shared bandwidth is divided into several subchannels. In this talk, we will introduce several of such multi-channel MAC schemes and discuss their advantages and disadvantages. These include Dynamic Channel Assignment (DCA) and Multi-Channel MAC (MMAC). DCA requires two transceiver interfaces on each node but no time synchronization is needed. MMAC, on the other hand, needs time synchronization and only one transceiver interface. We will also briefly introduce and discuss our proposed multi-channel MAC scheme and its potential benefits. Mr. Jingqi Wu received his master of M.E. in 2003 at Zhejiang University, China, and his bachelor of E.E. in 2000 at the same university. He had 3 years experience of instructor at Zhejiang University of Technology before he joined the Department of Computer Science at the University of New Orleans as a graduate research assistant. His current research is mainly focused in the areas of Medium Access Control (MAC) and information assurance in wireless communication. Ph.D. student, CS, UNO 0228 2008 Dr. Lu Peng 4:00pm Math 303 In this talk, I will introduce a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based scheme, we implement a set associative SRAM based cache. We organize the IP routing table as a supernode tree (a tree bitmap structure). We add a small supernode cache in-between the processor and the low level memory containing the IP routing table in a tree structure. The supernode cache stores recently visited supernodes of the longest matched prefixes in the IP routing tree. A supernode hitting in the cache reduces the number of accesses to the low level memory, leading to a fast IP lookup. According to our simulations, up to 72% memory accesses can be avoided by a 128KB supernode cache for the selected three trace files. Average supernode cache miss ratio is as low as 4%. Compared to a TCAM with the same size, 77% of energy consumption can be reduced. Other on-going work in my group will be also introduced in this talk. Dr. Lu Peng received his Bachelor and Master degrees in Computer Science and Engineering from Shanghai Jiaotong University, China. He obtained his Ph.D. degree in Computer Engineering from the University of Florida in Gainesville in April 2005. He joined the Electrical and Computer Engineering department at Louisiana State University as an Assistant Professor in August, 2005. His research focus on memory hierarchy system, multi-core interconnection, power efficiency and other issues in CPU design. He also has interests in Network Processor. He received an ORAU Ralph E. Powe Junior Faculty Enhancement Awards in 2007 and a Best Paper Award from IEEE International Conference on Computer Design in 2001. Assistant Professor, ECE, LSU 0225 2008 Guofei Gu 2:30pm CERM 438 Most of the attacks and fraudulent activities on the Internet are carried by malware. In particular, botnets have become the primary "platforms" for attacks on the Internet. A botnet is a network of compromised computers (or, bots) that are under the control of an attacker (or, botmaster). A botnet typically has tens to hundreds of thousands of bots, but some have several millions of bots. Botnets are now used for distributed denial-of-service attacks, spam, phishing, information theft, etc. With the magnitude and the potency of attacks afforded by their combined bandwidth and processing power, botnets are now considered as the largest threat to Internet security. In this talk, I focus on addressing the botnet detection problem in an enterprise-like network environment. I present a correlation-based framework for botnet detection that consists detection technologies already demonstrated in several systems (BotHunter, BotSniffer, BotMiner, and BotProbe). The common thread of these systems is correlation analysis (vertical correlation, horizontal correlation, and cause-effect correlation). I will mainly discuss BotHunter, BotSniffer and their corresponding correlation techniques/algorithms in this talk. These systems have been evaluated in live networks and/or real-world network traces, and the results show that they can detect real-world botnets with a very low false positive rate. These systems are starting to make an impact in the real-world. For example, there have been more than 6,000 downloads of BotHunter in the first five months after its public release. In addition, BotHunter is now being transitioned into products by several security vendors. Georgia Tech College of Computing 0222 2008 Dr. Shuangqing Wei 2:30pm Math 303 In recent years, there have been growing interests in achieving perfect secrecy in physical layer of communication systems without restriction of computational complexity on eavesdroppers. It is a well known result from 70's and 80's that perfect secrecy is possible only when eavesdropper's channel is not as good as the channel between the legitimate transceiver in terms of receiver signal to noise ratios. In this talk, we focus on using feedback to achieve a strictly positive secrecy rate over an eavesdropped communication link when the eavesdropper's channel is less noisy than the legitimate receiver's channel. All channels are assumed binary and symmetric (BSC). The proposed novel scheme exploits the channel randomness inherent in feedback channels. We show that our feedback scheme not only achieves a positive secrecy rate when the eavesdropper's channel is better, but also improves the secrecy rate achievable by the Wyner's method when the eavesdropper's channel is worse. Some pre-/post-processing schemes to intentionally improve and degrade the equivalent wiretapper channels, respectively, are also proposed to further enhance the overall secrecy rate. Dr. Shuangqing Wei received his Ph.D. in 2003 at the University of Massachusetts, Amherst. He then assumed his current position as a tenure-tracked Assistant Professor in the Electrical and Computer Engineering Department of Louisiana State University, Baton Rouge. His current research interests are in the areas of information theory and communication theory, in particular their applications to wireless communication systems and networks. Assistant Professor, ECE, LSU 0213 2008 Muness Alrubaie 7:00pm Math 118 Test Driven Development is a central tenet of Agile software development methodologies and is a powerful design technique for any software developer. The reasons for this are many: it encourages more modular, simpler code. It helps you avoid YAGNI (You Aren't Gonna Need It). It can be used to document a software system, by providing a specification and examples of its use. A test suite is also a necessary safety net for any serious refactoring work. In this session we'll talk about these aspects of TDD, how it fits with other Agile development practices, what makes up a good test, testing myths and introduce tools you can use to TDD. Muness has 11 years of experience developing software in a variety of domains using various tools for the job at hand. Muness has built resilient systems that can adapt to changing business needs. To that end he has been a proponent of agile practices, Ruby on Rails, Domain-Specific Languages (DSLs) and tagging. Muness received his B.S and M.S in Computer Science from Franklin University, Columbus, OH, and was also an adjunct professor at Franklin. He has spoken at both the No Fluff Just Stuff (NFJS) Software Symposium Series and The O'Reilly Open Source Convention (OSCON). Principal, Relevance LLC, Chapel Hill, NC 1129 2007 Dr. Frank Adelstein 2:00pm CERM 438 Traditionally, digital forensic analysis is performed "post mortem" on a disk, after it has been seized and the power cord to the computer has been unceremoniously yanked out of the wall. In recent years, two forces have been changing this practice. First, as the disk space on a typical system grows, and court orders for shutting down all machines become harder to obtain, it is getting more difficult to perform a complete "old school" analysis. And second, a new generation of tools has been created that look at volatile information that helps provide context to the static analysis. In this talk, we will first describe "old school" forensics, the important priciples behind the techniques, and the information they yield. Then we will present live forensics, the type of information that is available, and how it can be used, not as a replacement for, but in concert with static analysis to help investigators understand what happened and what is happening now to a system. We will conclude with some predictions on how the field will change based on current trends. Dr. Frank Adelstein is the technical director of computer security at ATC-NY in Ithaca, NY. He is the principal designer of a live forensic investigation product (marketed as Online Digital Forensic Suite and LiveWire Investigator) and has worked in the area of live investigation for the last 5 years. He has also been the principal investigator on numerous research and development projects including security, wireless networking, intrusion detection, and training. Adelstein is the vice-chair of the Digital Forensic Research Workshop, the premier workshop on research advances in the area of digital forensics and a co-authored of the the book Fundamentals of Mobile and Pervasive Computing (McGraw-Hill). Technical Director of Computer Security at ATC-NY in Ithaca, NY 1116 2007 Mr. Lodovico Marziale 2:00pm Math 303 In the past, utilizing graphics processors for general purpose computing required re-engineering algorithms in terms applicable to graphics processors - vertices, fragments, shaders, etc... The added programming complexity was not worth the potential performance gains for many types of problems. Modern GPUs, however, have made significant advances on two fronts: their processing power has increased tremendously, and general purpose programming APIs for them have begun to appear. This has made them much more attractive for use as general purpose co-processors. In this talk, I will present the results of utilizing the power of modern GPUs (specifically, the NVIDIA G80 series) for sizable performance gains in computer forensics applications. Lodovico Marziale received a M.S. in Computer Science and a B.S. in Finance from the University of New Orleans and is currently pursuing a Ph.D. in Engineering and Applied Sciences. He is a research assistant in the department of Computer Science working on Next Generation File Carving. His research interests include Computer Security, Digital Forensics, and Parallel and Distributed Computing. University of New Orleans 1112 2007 Maik Flanagin 9:00am CERM 438 Creation of accurate and coherent surface models is vital to the effective planning and construction of flood control and hurricane protection projects. Typically, such topographic surface models are synthesized from Delaunay triangulations or interpolated raster grids. Although these techniques are adequate in most general situations, they do not effectively address the specific case where topographic data is available only as cross-section and profile centerline data, such as the elevation sampling produced by traditional hydrographic surveys. The hydraulic spline algorithm was developed to generate irregular two-dimensional channel grids from hydrographic cross-sections at any desired resolution. Hydraulic spline output grids can be easily merged with datasets of higher resolution, such as LIDAR data, to build a complete model of channel geometry and overbank topography. In testing, the hydraulic spline algorithm faithfully reproduces elevations of known input cross-section points where they exist, while generating a smooth transition between known cross-sections. The algorithm performs particularly well compared to traditional techniques with respect to aesthetics and accuracy when input data is sparse. These qualities make the hydraulic spline an ideal choice for practical applications where available data may be limited due to historic or budgetary reasons. Maik Flanagin's Ph.D Dissertation Defense. University of New Orleans 1026 2007 Professor Meikang Qiu 2:00pm Math 303 Embedded systems are driving an information revolution with their pervasion in our everyday lives. For heterogeneous parallel embedded systems, I exploit the time and power optimization in various aspects. In high-level architecture synthesis, I address high-level architecture synthesis for real-time Digital Signal Processing (DSP) using heterogeneous functional units (FUs). With more and more different types of FUs available, same type of operations can be processed by heterogeneous FUs with different costs, where the cost may relate to power, reliability, etc. Furthermore, some tasks may not have fixed execution time. Such tasks usually contain conditional instructions and/or operations that could have different execution times for different inputs. Therefore, for such special purpose architecture synthesis, an important problem is how to assign a proper function unit type to each operation of a DSP application and generate a schedule in such a way that I can minimize the total costs while satisfying timing constraints with guaranteed confidence probabilities. We proposed several efficient algorithms to solve it. The experiments show that my algorithms can effectively reduce the total cost compared with the previous work. Professor Meikang Qiu received BE and ME in Engineering from Shanghai Jiao Tong University (SJTU). Before he came to U.S., Dr. Qiu worked at IBM HSPC and Chinese Helicopter R & D Institute for several years. Dr. Qiu obtained his MS and Ph.D. in Computer Science from University of Texas at Dallas (UTD) in 2003 and 2007, respectively. His research areas of expertise are Embedded Systems, Heterogeneous Sensor Networks, Parallel Computing, Data Mining and Fusion, Information Security, and Mobile Interface Browsing. He is an IEEE Senior member and ACM member. University of New Orleans 1019 2007 Dr. Feng Zhu 2:00pm CERM 438 We prove our identities daily by showing the access tokens we possess. Using a key to open a lock may be the most common form, which has about 4000 years of history since ancient Egypt. As one may access many locks, traditional master keys were designed to enable accessing multiple locks with a single key. Nevertheless, master keys are not widely used because of their security design limitations. Instead, people carry multiple access tokens for entity authentications, for example, keys, magnetic stripe cards, smart cards, RFID tags, and other tokens. In pervasive computing environments, entity authentications might be ubiquitously necessary. The management of access tokens and memorizing the token-lock relationships become overwhelming as the number of tokens increases. An intuitive question is how to achieve both the advantages of traditional master keys and multiple access tokens while avoiding their disadvantages. In this talk, I will present the Master Key, a novel entity authentication approach for pervasive computing environments. Feng Zhu received the Ph.D. in Computer Science and Engineering, the M.S. in Statistics, and the M.S. in Computer Science and Engineering from Michigan State University and the B.S. in Computer Science from East China Normal University. He is a program manager at Microsoft. His research interests include security and privacy, pervasive computing, computer networks, distributed systems, and statistical system analysis and design. Microsoft Corporation 0928 2007 Dr. Alex Tchourbanov 2:00pm Math 303 Background: The Baum-Welch training procedure for Hidden Markov Models (HMMs), an Expectation Maximization (EM) method, provides powerful tool for tailoring HMM topologies to data for possible use in knowledge discovery and clustering. A procedure recently proposed by Miklos, I. and Meyer, I.M., for implementing a memory sparse version of Baum-Welch training, has opened the possibility for an efficient distributed implementation of this algorithm. The original description of the technique has certain omissions that we amend, and experimental results are given. Results: The Baum-Welch algorithm has been implemented in memory proportional to the number of states in the HMM, and then thoroughly tested on number of data sets. We heavily modified the originally proposed algorithm to meet our objectives in data series analysis. Particularly, we reversed the originally proposed forward sweep to estimate the prior HMM state probabilities. We have corrected and rewritten the recurrence relation for the emission parameter estimations and extended it to parameter estimates of the Normal distribution. We describe our scaling procedure, necessary in all real implementations of the algorithm to prevent underflow. We also discuss the parallel implementation of the method and carefully described interpretation to the somewhat counter-intuitive recurrent relations. In this paper we also describe our approach to a linear memory implementation of the Viterbi decoding algorithm and demonstrated its linear memory use in an extended Duration Hidden Markov Model (DHMM) and spike detection topologies. Conclusions: Our speed-optimized Java implementation of linear memory Baum-Welch algorithm is available at http://logos.cs.uno.edu/~achurban. The proposed methods and implementation will aid sequence alignment, gene structure prediction, HMM profile training, nanopore ionic flow blockades analysis, and many other domains that require efficient HMM training with EM. Dr. Tchourbanov received his Engineer degree in automation and remote control from the Southern - Urals State University, M.S. in Computer Science from the University of Nebraska - Omaha and his Ph.D. in Computer Science (bioinformatics track) from the University of Nebraska - Lincoln. Dr. Tchourbanov was a one-year postdoctoral research associate in department of molecular biology at University of Wyoming before taking postdoctoral researcher position at Children's hospital of New Orleans. Despite substantial recent progress, gene structural prediction remains a challenging problem in bioinformatics. The importance of detailed understanding of gene splicing can be underlined by noting that ~10-15% of human genetic disorders come from mutations disrupting splice junctions. Dr. Tchourbanov's doctoral research focused on understanding of the constitutive splicing. Number of tools have been created to predict the human splice sites better, among them GIGOgene, Bayesian splice cite sensor and SpliceScan. As postdoctoral researcher at University of Wyoming he was evolved with study of correlations between Ka/Ks ratios and fidelity of phylogenetic reconstruction. Currently Dr. Tchourbanov actively collaborates with Dr. Eugeny Koonoin's evolutionary genomics research group at NIH/NCBI to bring study of splice sites signals to the evolutionary context. At children's hospital Dr. Tchourbanov conducts research on nanopore ionic current blockade signal processing, which offers a promising new way to analyze single molecule properties, with potential implications for DNA sequencing. He developed and evaluated number of HMM topologies for duration modeling and spike detection in ionic flow. Linear memory HMM learning was implemented by him recently which opened venue to efficient distributed implementation of an HMM. University of New Orleans 0921 2007 Professor Jing Deng 2:00pm Math 303 In order to improve the throughput performance of Medium Access Control (MAC) schemes in wireless communication networks, some researchers proposed to divide a single shared channel into several sub-channels: one as control sub-channel and the others as data sub-channels. In this talk, we analyze and evaluate the maximum achievable throughput of a class of generic multi-channel MAC schemes that are based on the RTS/CTS (Ready-To-Send/Clear-To-Send) dialogue and on ALOHA contention resolution. Our analysis suggests some surprising conclusions. Dr. Jing Deng is an assistant professor in the Department of Computer Science (CS) at the University of New Orleans (UNO). He visited the Department of Electrical Engineering & Computer Science at Syracuse University from 2002 to 2004. He received his Ph.D. degree from School of Electrical and Computer Engineering at Cornell University, Ithaca, NY in January, 2002. Dr. Deng's research interests include Multiple Access Control (MAC), energy efficiency, Mobile Ad Hoc Networks (MANETs) and Wireless Sensor Networks (WSNs), key pre-distribution in WSNs, and information assurance. University of New Orleans 0419 2007 Xinyu Tang 2:00pm CERM 438 Modeling motion has a wide range of applications including robotics, computer animation, computer-aided design/virtual prototyping, computational biology, and drug design. Motion is particularly important for understanding many biochemical processes as it is often essential for functions. For example, some devastating diseases such as Alzheimer's and bovine spongiform encephalopathy (Mad Cow) are associated with the misfolding of proteins. Additionally, many biochemical processes such as gene regulation and catalysis are regulated by RNA folding. Despite the explosion in our knowledge of structural and functional data, our understanding of molecular movement is still very limited because it is difficult to measure experimentally and computationally expensive to simulate. In this talk, we describe a novel approach developed in our group for modeling biological molecular motions that is based on probabilistic road map methods (PRMs) originally proposed for robotics motion planning. We have successfully applied this strategy to protein and RNA folding, and ligand binding. After providing an overview of the general approach and it applications, we focus on our work in RNA folding. Our PRM-based framework uses a roadmap to approximate the folding energy landscape. By running folding simulations on the approximated energy landscape, we can study both global folding properties (such as folding rates) and microscopic features (e.g. folding of particular subsequences). We present comparisons with two experimental cases to show how we can use our method to predict kinetics-based functional rates of ColE1 RNAII and MS2 phage RNA and their mutants. Xinyu Tang is a Ph.D. candidate at Texas A&M University. Texas A&M University 0426 2007 Alain Laederach, Ph.D. 2:00pm CERM 438 The RNA folding problem is analogous to the protein-folding problem in that it amounts to predicting the three-dimensional conformation of a large bio-polymer. RNA is only comprised of four nucleotides, compared to 21 amino-acids in proteins. However, the promiscuous hydrogen-bonding chemistry of RNA bases allows for a surprisingly large number of different types of intermolecular interactions. As a result, the RNA folding problem remains hard. Fortunately, significant advances in our ability to crystallize RNA has greatly increased the availability of known structures enabling the development of knowledge-based modeling approaches. We will present an automated approach that incorporates a statistical analysis of the geometry for all known RNA structures that allows for ab initio prediction of structure. Using commodity distributed computing grids, we generate coarse-grained decoy structures, which can then be filtered using low-resolution RNA-specific experimental data. This hybrid method allows us to make predictions of RNA structures with as low as a 6 A RMSD. Dr. Alain Laederach is a post-doctoral fellow in the Department of Genetics at Stanford University working in Russ Altman’s lab (also known as The Helix Group). His primary research interests are in using computational methodology to understand and predict biomolecular structure and dynamics. He is currently focusing on modeling RNA structure and the process of RNA folding. More specifically, he is interested in using limited experimental information to generate models of RNA folding intermediates and in determining the information content of these experimental results. He holds a B.S. from the Swiss Federal Institute of Technology, Lausanne, and a Ph.D. from Iowa State University. He is the recipient of a Damon Runyan Cancer Research foundation fellowship. Stanford University 1201 2006 Jing Deng 1:00pm TBA We study routing misbehaviors in MANETs (Mobile Ad Hoc Networks) in this talk. In general, routing protocols for MANETs are designed based on the assumption that all participating nodes are fully cooperative. However, due to the open structure and scarcely available resources, node misbehaviors may exist. One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. In this talk, we analyze the adverse effects of such misbehaving nodes on data delivery performance and some prior solutions to this problem. We then propose a new technique termed 2ACK. The 2ACK scheme serves as an add-on technique for routing schemes to detect routing misbehaviors and to mitigate their adverse effect. The main idea of the 2ACK scheme is to send two-hop acknowledgment packets in the opposite direction of the routing path. We present the salient features and performance analysis of the 2ACK scheme in this talk. Dr. Jing Deng is an assistant professor in the Department of Computer Science at the University of New Orleans (UNO). He visited the Department of Electrical Engineering & Computer Science at Syracuse University from 2002 to 2004. He received his Ph.D. degree from School of Electrical and Computer Engineering at Cornell University, Ithaca, NY in January, 2002. His research website is at http://www.cs.uno.edu/~jing University of New Orleans 0415 2005 Jing Deng 3:00pm Math 303 In this talk, we present an efficient key pre-distribution scheme for Wireless Sensor Networks. Compared to previous schemes, our scheme substantially improves the resilience of the network. Our scheme exhibits a savvy threshold property: when the number of compromised nodes is less than the threshold, the probability that communications between any additional nodes are compromised is negligible. This desirable property lowers the initial payoff of smaller-scale network breaches to an adversary, and makes it necessary for the adversary to attack a large fraction of the network before it can achieve any significant gain. The background of the security problem and our approach will be presented in detail. We will also provide an in-depth analysis of our scheme in terms of network resilience and associated overhead. Dr. Jing Deng is an assistant professor in the Department of Computer Science at UNO. He received his Ph.D. degree in Electrical and Computer Engineering at Cornell University in 2002. Dr. Deng visited Syracuse University as a research assistant professor from 2002 to 2004. His research interests include Mobile Ad Hoc Networks, Wireless Sensor Networks, and Wireless Security. University of New Orleans 0330 2007 Professor Nauman Chaudhry 2:30pm Math 303 Expressions are used in a range of applications like publish/subscribe, website personalization, etc. Integrating support for expressions in a database management system (DBMS) provides an efficient and scalable platform for applications that use expressions. Additionally, in many cases these applications can benefit from support for uncertain data and expressions. Current DBMS lack such support. In this talk, I will discuss how expressions with uncertainty can be integrated in a DBMS and processed like other data stored in the DBMS. I will describe the underlying theory and implementation of UNXS (UNcertain eXpression System), a system that we have developed to handle uncertainty in expressions and data. We first develop a theoretical model to compare previous efforts in supporting uncertainty in DBMS and publish/subscribe systems. We propose new techniques for matching uncertain expressions to uncertain data. We then describe an implementation that integrates thissupport in the Postgresql DBMS. Prof. Nauman Chaudhry received his B.Sc. degree in Electrical Engineering from University of Engineering and Technology (UET) in Lahore, Pakistan in 1991. He received his Ph.D. in Computer Science & Engineering from the University of Michigan, Ann Arbor in 1998. He then worked at Oracle Corporation for 5 years. He is currently an Assistant Professor in the Dept. of Computer Science at the University of New Orleans. His research interests are in extending database management systems for advanced applications. Currently he is researching extensions to database systems to support uncertain data, and to support data streams. University of New Orleans 0316 2007 Michael E. Ruth 2:30pm Math 303 As Web services grow in maturity and use, so do the methods which are being used to test and maintain them. Regression Testing (RT) is a major component of most major testing systems but has only begun to be applied to Web Services. The majority of the tools and techniques applying RT to Web services are focused on test-case generation, thus ignoring the potential savings of regression test selection (RTS). RTS implies that a subset of tests can be selected, rather than all tests, while maintaining some level of confidence about the system performing at least as well as the unmodified version post-modification. A safe RTS technique implies that after selection, the level of confidence is as high as it would be if we removed no tests. Since safe RTS techniques generally involve code-based (white-box) testing, they cannot be directly applied to Web services due to their loosely-coupled, standards-based, and distributed nature. An approach to automate safe RTS in an end-to-end manner will be proposed. As part of this system, some issues regarding autonomous, distributed, and more importantly concurrent modifications will be presented along with their solutions in a set of algorithms which manage the RT and RTS processes throughout the system. Lastly, an empirical analysis showing how the described mechanism performs in terms of selectivity, which will show a measure of cost savings. Dr. Michael E. Ruth received his Bachelor of Science in Computer Science at the University of New Orleans in 2002. A year later, was awarded the Crescent City Doctoral Scholarship. In 2005, he received a Master's of Science in Computer Science at the University of New Orleans. Currently, he is a Research Assistant working towards a Doctorate in Engineering and Applied Science at the University of New Orleans. His research interests include Web services, distributed systems, and software engineering. University of New Orleans 0305 2007 Dr. Wayne Patterson 2:30pm CERM 438 The concept of a book is about to change. Although many will undoubtedly prefer to acquire, read, keep, and distribute literature in the way we have since Gutenberg, we will soon be in the era where most literature will be accessible electronically, and this may lead to many new approaches to the analysis of literature. Our current research explores the question of authentication of authorship using letter frequencies and classical pattern recognition techniques. Dr. Wayne Patterson is the Program Manager for the Office of International Science and Engineering at the National Science Foundation. National Science Foundation 0228 2007 Prahlad Fogla 3:00pm CERM 438 With the increase in the complexity of computer systems, security prevention measures are not enough to prevent all attacks. Intrusion detection systems (IDS) have become an integral part of computer security to detect attempted intrusions. Intrusion detection systems need to be robust against the attacks that are disguised to evade them. To analyze the robustness of network anomaly detection systems, we introduce a new class of polymorphic attacks, called polymorphic blending attacks (PBA). PBA can effectively evade a payload-based network anomaly IDS by carefully matching the statistics of the mutated attack instances to the normal profile. We present a formal framework for the analysis of PBAs. We show that in general, generating a PBA that optimally matches the normal traffic profile is a hard problem (NP-complete). However, the problem of finding a PBA can be reduced to the SAT or ILP problems so that solvers available in those domains can be used to find a nearoptimal solution. We also present a heuristic (hill-climbing) to find an approximate solution. We have experimented with our framework using the PAYL 1-gram and 2-gram anomaly detection system, and demonstrate that these attacks are indeed feasible. We provide some insight into possible countermeasures that can be used as defense against PBAs. Prahlad Fogla is a Ph.D. candidate in Computer Science specializing in Information Assurance at Georgia Institute of Technology. Georgia Institute of Technology 0208 2007 Dr. Christopher M. Summa 2:00pm CERM 301 Computational methods have become powerful enabling tools in modern structural biology, allowing the manipulation and prediction of protein structures with fairly high level of detail and control. The fields of de novo protein design and protein structure prediction are united by their common critical reliance on potential functions for modeling protein energetics. Computational aspects of protein design and structure prediction will be discussed, with highlights of some recent work on the generation of forcefields for automated refinement of close-to-native protein structure models (such as homology models). Dr. Summa is currently a NSF Fellow in Biological Informatics in the Department of Structural Biology at Stanford University Medical School. Stanford University School of Medicine 1117 2006 Professor Huimin Chen 1:00pm Math 303 In a peer-to-peer file distribution network, a large file is split into blocks residing in multiple storage locations. A peer node tries to retrieve the original file by downloading blocks from randomly chosen peers. We compare the performance of four storage strategies: uncoded, erasure coding, random linear coding, and random linear coding over coded blocks. We show that, in principle, random linear coding makes a better tradeoff between the storage requirement and decoding complexity. However, the sparsity of the file blocks is not fully exploited by random linear combinations of all original blocks. Motivated by the recent results from compressed sensing, we study the design tradeoff in random linear coding over coded blocks and propose an efficient decoding algorithm based on basis pursuit. We show that the minimum number of storage locations that a peer note has to connect to reconstruct the entire file with high probability can be significantly smaller than the total number of blocks that the file is broken into. Dr. Huimin Chen received the B.E. and M.E. degrees from Department of Automation, Tsinghua University, Beijing, China, in 1996 and 1998, respectively, and the Ph.D. degree from the Department of Electrical and Computer Engineering, University of Connecticut, Storrs, in 2002, all in electrical engineering. He was a post doctorate research associate at Physics and Astronomy Department, University of California, Los Angeles, and a visiting researcher with the Department of Electrical and Computer Engineering, Carnegie Mellon University from July 2002 where his research focus was on weak signal detection for single electron spin microscopy. He joined the Department of Electrical Engineering, University of New Orleans in Jan. 2003 as an assistant professor. His research interests are in general areas of signal processing, estimation theory, and information theory with applications to target detection and target tracking. University of New Orleans 1109 2006 Heng Huang 2:00pm Math 303 Dartmouth College 1103 2006 Professor Golden G. Richard III 1:00pm Math 303 Digital forensics is the science and discovering and preserving digital evidence, which exists on a wide variety of devices, from traditional computers to PDAs, voice recorders, copy machines, and cell phones. The traditional digital forensics investigative process involves stabilizing evidence, typically by making bit-perfect copies of evidence from a powered-down target, and then investigating the evidence using a variety of digital forensics tools. This investigation typically takes place in a laboratory environment, with the investigator using a single, powerful workstation. This simplistic approach will soon reach end-of-life, as investigators are pressed to provide faster case turnaround, to perform live investigations, to handle much larger targets, and to integrate evidence from many networked targets. The talk begins with a brief introduction to digital forensics investigation and then discusses "next generation" digital forensics research in the Department of Computer Science at the University of New Orleans. The aim of "next generation" digital forensics is to significantly improve the processes and tools available to an investigator, in all phases of the investigation. These improvements are partially motivated by overwhelming growth in the size of typical forensic targets; with 500GB hard drives available for under $200 and a correspondingly large appetite for storage of digital media, targets in excess of 1TB are common. An investigator trying to use traditional tools, powered by a single workstation, will be completely overwhelmed. The improvements in process and tools are also motivated by the need to investigate live, mission-critical targets, which cannot be taken down for investigation without disrupting business operations, and the need to effectively investigate networked targets. In order to modernize digital forensics investigation, the digital forensics research group at the University of New Orleans is creating new approaches and new software tools that allow investigative triage, where investigators may preview evidence before performing copies for further investigation, "live" forensics investigation of mission-critical computers, better file carving strategies, and the use of high-performance, cluster-based computing to speed investigations. This talk, rather than focusing on a single, specific research problem, quickly covers a number of ongoing projects, as well as some difficult, open problems, with the goal of (perhaps) revealing opportunities for collaboration. The speaker will provide homemade cookies in exchange for your rapt attention, polite criticism, and/or thoughtful questions. Prof. Golden G. Richard III, an experimental computer scientist and the third in a line of Golden's now numbering four, was born in 1964 in Jennings, LA. Golden's primary research areas are in digital forensics, specifically, next-generation digital forensics tools, network security, and operating systems internals. He is a GIAC-certified digital forensics investigator, co-founder of Digital Forensics Solutions, LLC, a private digital investigation firm, and technical advisor to the Gulf Coast Computer Forensics Laboratory. Golden is currently an Associate Professor in the Department of Computer Science at the University of New Orleans and director of the Networking, Security, and Systems Administration Laboratory (NSSAL). After Hurricane Katrina, he evacuated to Austin, TX, where he was a Visiting Associate Professor of Computer Science during 2005-2006. Golden completed his undergraduate degree in computer science at the University of New Orleans and holds the honor of being the first student ever to graduate with honors in computer science at UNO. His undergraduate advisor was the late Howard Evans. After UNO, he ventured north to Ohio State and braved the midwestern cold for almost 6 years, earning M.S. and Ph.D. degrees in computer science in 1991 and 1995, respectively. His Ph.D. advisor was Mukesh Singhal, who is now the Gartner Group Chair in Networking at the University of Kentucky. His Ph.D. dissertation was on process recovery mechanisms for message-passing and distributed shared memory systems. Golden set a record still unbroken among his peers by sending forth a single job application after graduation, to the University of New Orleans, where he was hired as an Assistant Professor in 1994. Golden is a notorious food snob, regularly shunning foods whose recipes contain the words "packet" or "can". When he's not engaged in benevolent hacking or dumping his brain contents into Powerpoint slides, he can be found cooking, gardening, consuming music (generally, jazz, reggae, trip hop, blues, or punk), or skateboarding. University of New Orleans 1027 2006 Michael E. Ruth 1:00pm Math 303 As Web services grow in maturity and use, so do the methods which are being used to test and maintain them. Regression Testing (RT) is a major component of most major testing systems but has only begun to be applied to Web Services. The majority of the tools and techniques applying RT to Web services are focused on test-case generation, thus ignoring the potential cost savings of regression test selection (RTS). RTS implies that we only test the system under test (SUT) using a minimum amount of test cases to prove that the system performs at least as well as the unmodified version with some level of confidence. Safe RTS (SRTS) implies that we remove tests safely, thus not removing any modification-revealing tests. Since SRTS involves white-box testing, SRTS cannot be directly applied to Web Services due to their loosely-coupled, standards-based, and distributed nature. We will propose a framework in which we will automate SRTS to Web Services in an End-to-End manner. Michael E. Ruth received his Bachelor of Science in Computer Science at the University of New Orleans in 2002. A year later, he was awarded the Crescent City Doctoral Scholarship. In 2005, he received a Master's of Science in Computer Science at the University of New Orleans. Currently he is a Research Assistant working towards a Doctorate in Engineering and Applied Science at the University of New Orleans. His current research interest include Web services, distributed systems, and software engineering. University of New Orleans 1020 2006 Dr. Stephen Winters-Hilt 1:00pm Math 303 Efforts by others to sequence ssDNA from its translocation blockade signal with a nanopore detector have not succeeded. The key reason being the paradox of the translocation-based detection mechanism: as you make your channel fit tighter around the translocating molecule -- to get a better interaction to reveal the molecules identity -- the surrounding current signal is reduced, thereby reducing the overall detector sensitivity. What retains detector sensitivity along with strong interaction, while allowing for an even greater spectrum of molecular sizes and linkages to be examined, is blockade analysis for molecules interacting with the channel opening but NOT translocating. The non-translocational signals are rich with information only some of the time, and noisy and prone to drift all of the time, creating a computationally intensive adaptive learning problem. For non-translocational signal analysis there is now a clearer role for bifunctional molecules: one function being to enter and blockade the channel in an information-rich self-modulating manner, the other function, for binding, located on a non-channel-captured portion of the molecule that is free to bind or rigidly link to a larger molecule of interest. Recent results indicate that it is possible to directly track the bound versus unbound state of a molecule by this means. Sophisticated machine learning software has been brought to bear on this type of signal analysis in what is referred to as "channel current cheminformatics". Studies of antibody binding are being pursued both via the antibody itself being the bifunctional molecule, or via (unique) linkage to a dsDNA gauge at its carboxy terminus. Studies of antibody- and aptamer-based biosensing and immunological screening protocols are being developed. The prospects for directed molecular design and rapid immunological screening by this means could have a dramatic impact on medicine and drug discovery. Dr. Stephen Winters-Hilt; BS Physics and Electrical Engineering, Caltech, 1987; MS Applied Physics, Caltech, 1990; Visiting Researcher, Mathematics Institute, Oxford, 1994; PhD Theoretical Physics, Univ. of Wisconsin, 1997; PhD Computer Science, UCSC, 2003; Asst Prof., UNO, 2003-present University of New Orleans 0317 2006 Dr. Jing Peng 3:00pm Math 303 Ensemble methods provide a principled framework in which to build high performance classifiers and represent many types of data. As a result, these methods can be useful for making inferences about biometric and biological events. We introduce an ensemble method for combining multiple representations (or views). The method is a multiple view generalization of AdaBoost. Similar to AdaBoost, weak classifiers are independently built from each represetation. However, all data types share the same sampling distribution computed from the type of data having the smallest error rate. As such, the most consistent data type dominates over time, thereby significantly reducing sensitivity to noise. The method is applied to the problem of facial and gender prediction based on biometric traits. The new method outperforms several competing techniques including kernel-based data fusion, and is provably better than AdaBoost trained on any single type of data. Jing Peng is on the faculty of Electrical Engineering and Computer Science at Tulane University. He received the M.A. and Ph.D. degrees in computer science from Brandeis University and Northeastern University, in 1987 and 1994, respectively. From 1994 to 1995, he was a poc-doc fellow in the Computer Vision Laboratory at the University of California, Riverside. From 1996 to 1997, he served as a Senior Scientist at in the Machine Vision Department at Amherst Systems. From 1999 to 2001, he was on the faculty of Computer Science at Oklahoma State University. Dr. Peng's research interests include machine learning, bioinformatics, biometrics and image databases. He has served as the Guest Co-Editor of the Special Issue on Learning in Computer Vision and Pattern Recognition, IEEE Transactions on Systems, Man, and Cybernetics. He has served on the program committees for various international conferences. He has authored or co-authored over 80 technical publications in the areas of his interests. Tulane University 0331 2006 Dr. Vassil Roussev 3:00pm Math 303 Recent work on distributed RAM sharing has largely focused on leveraging low-latency networking technolo-gies to optimize remote memory access. In contrast, we revisit the idea of RAM sharing on a commodity cluster with an emphasis on the prevalent Gigabit Ethernet tech-nology. The main point of the paper is to present a practi-cal solution-a distributed RAM disk (dRamDisk) with an adaptive read-ahead scheme-which demonstrates that spare RAM capacity can greatly benefit I/O-constrained applications. Specifically, our experiments show that se-quential read/write operations can be sped up approxi-mately 3.5 times relative to a commodity hard drive and that, for more random access patterns, such as the ones experienced on a server, the speedup can be much higher. Our experiments demonstrate that this speedup is ap-proximately 90% of what is practically achievable for the tested system. BS, MS in Computer Science, Sofia University, Bulgaria MS, PhD in Computer Science, University of North Carolina, Chapel Hill Research interests: distributed and collaborative systems, digital forensics and security, human-computer interaction, software engineering. Recent publications (w/ Golden Richard): two book chapters on digital forensics and an article in Communications of ACM (02/06). University of New Orleans 0407 2006 Dr. Huimin Chen 3:00pm Math 303 In this talk, I will give a comprehensive overview of statistical challenges with high dimensionality in diverse disciplines such as data mining and statistical inference. Then I will discuss the problem of variable selection and feature extraction using a unified framework: penalized likelihood methods. Issues relevant to the choice of penalty functions will be addressed. The desired properties in penalized likelihood framework and its connection to the structural risk minimization will also be discussed. The applicability of such a theory and method to diverse statistical problems will be illustrated with practical applications to a taxonomic problem and a stock selection problem. Huimin Chen received the B.E. and M.E. degrees from Department of Automation, Tsinghua University, Beijing, China, in 1996 and 1998, respectively, and the Ph.D. degree from the Department of Electrical and Computer Engineering, University of Connecticut, Storrs, in 2002, all in electrical engineering. He was a post doctorate research associate at Physics and Astronomy Department, University of California, Los Angeles, and a visiting researcher with the Department of Electrical and Computer Engineering, Carnegie Mellon University from July 2002 where his research focus was on weak signal detection for single electron spin microscopy. He joined the Department of Electrical Engineering, University of New Orleans in Jan. 2003 as an assistant professor. His research interests are in general areas of signal processing, estimation theory, and information theory with applications to target detection and target tracking. University of New Orleans 0421 2006 Dr. Stephen Winters-Hilt 3:00pm Math 303 HMM feature extraction methods are sought for tracking individual molecular interactions via the changes in channel current blockade "signal" that results from the interaction with (and occlusion of) a single nanometer-scale channel established in a lipid bilayer. This involves developing noise tolerant feature identification (knowledge discovery) and feature extraction methods for single molecule studies, and intra-molecular interaction studies (reaction kinetics). To this end, HMMs are used for level identification, HMM/EM with boosted variance emissions are used for level projection pre-processing, and time-domain FSAs are used to parse the level-projected waveform. This provides a robust kinetic feature extraction formalism with a minimal amount of tuning. Classification, and/or clustering, of the HMM-based feature vector associated with a given blockade is then done by a variety of SVM implementations. HMM feature extraction results are described for five DNA molecules, as is the SVM classification performance based on those feature vectors. Results for two SVM approaches to multiclass discrimination are also described: (1) internal multiclass (with a single optimization), and (2) external multiclass (using and optimized decision tree). Each SVM approach encapsulates a significant amount of model-fitting information in its choice of kernel. In work thus far, novel, information-theoretic, kernels were successfully employed for notably better performance over standard kernels. Sometimes the data isn't clearly separable, making for poor discrimination. For such problems signal clustering may still provide useful information – to this end, novel, SVM-based clustering methods are also described. BS Physics and Electrical Engineering, Caltech, 1987; MS Applied Physics, Caltech, 1990; Visiting Researcher, Mathematics Institute, Oxford, 1994; PhD Theoretical Physics, Univ. of Wisconsin, 1997; PhD Computer Science, UCSC, 2003; Asst Prof., UNO, 2003-present University of New Orleans 0428 2006 Dr. Nauman Chaudhry 3:00pm Math 303 University of New Orleans 0506 2006 Hongyi Wu 3:00pm Math 303 The cellular concept was introduced for wireless communication to address the problem of having scarce frequency resource. It is based on the sub-division of geographical area to be covered by the network into a number of smaller areas called cells. Frequency reuse in the cells far away from each other increases system's capacity. But at the same time, the cell boundaries prevent the channel resource of a system to be fully available for users. No access to the channel resources in other cell by the mobile host (or MH) limits the channel efficiency and consequently the system capacity. In this presentation, I will introduce a novel wireless system architecture based on the integration of cellular and modern ad hoc relaying technologies, called iCAR. It can efficiently balance traffic loads and share channel resource between cells by using ad hoc relaying stations (ARS) to relay traffic from one cell to another dynamically. This not only increases the system's capacity cost-effectively, but also reduces transmission power for MHs and extends system coverage. I will discuss an analytical model based on multi-dimensional Markov chains for performance evaluation. Our results show that with a limited number of ARSs and some increase in the signaling overhead (as well as hardware complexity), the call blocking/dropping probability in a congested cell as well as the overall system can be reduced. In addition, I will talk about several important design issues in iCAR, such as the ARS placement strategies involving a new performance metric called quality of (ARS) coverage (QoC), the signalling and routing protocols for establishing QoS guaranteed connections for IP traffic, as well as the ARS mobility management for adapting to the dynamic traffic load in the iCAR systems. Hongyi Wu received his Ph.D. degree in computer science and M.S. degree in electrical engineering from State University of New York (SUNY) at Buffalo in 2002 and 2000, respectively. He received his B.S. degree in scientific instruments from Zhejiang University in 1996. University of Louisiana (UL) at Lafayette 0408 2005 Stephen Winters-Hilt 3:00pm Math 303 University of New Orleans 0401 2005 Wayne Patterson 3:00pm Math 303 By "experimental mathematics"is meant an approach to gaining insight about mathematical phenomena that is realistically only possible when one is able to create and view a large enough body of data to be able to formulate hypotheses. This presentation will focus on four such examples: 1. Computation of determinants 2. An interesting sequence 3. The Goldbach conjecture 4. The Collatz conjecture Wayne Patterson Biographical Notes Wayne Patterson was born in Moncton, New Brunswick, Canada. He received the B. Sc. (Honours) in Applied Mathematics at the University of Toronto in 1966; M. Sc. in Mathematics also from Toronto in 1967; and the Ph. D. in Mathematics from the University of Michigan in 1971, in the field of differential topology. He also later received the M. Sc. in Computer Science from the University of New Brunswick in 1982. In 1968, he started the Michigan component of Project SEED, a national program of advanced mathematics for inner-city poverty and minority children. He taught the first Michigan classes in Project SEED, first in Ypsilanti and later in Detroit. He worked with then Senator Coleman Young to develop legislation, which eventually funded Project SEED statewide in Michigan. He also formed Project SEED, Incorporated, in 1970, and served as one of the founding directors of the corporation. He has continued to serve as a member of the Board of Directors since that time and has been the Chair of this Board since 1984. Dr. Patterson continued as Associate National Director of Project SEED, teaching in New Jersey, California, and Washington, DC, where he worked with congressional sponsors Senators Kennedy, Taft, Mondale and Magnuson to develop national funding for Project SEED. In his Project SEED teaching career, he taught classes in Lansing, Michigan, East Orange, New Jersey, Oakland, California, as well as those cities mentioned above. During this period, he also joined the mathematics faculty at both Princeton University and the University of California at Berkeley as a Post-Doctoral Fellow. In 1975, he returned to Canada to join the Government of Canada, serving as Special Assistant and Economic Advisor to the Secretary of State and later the Deputy Prime Minister of Canada. He returned to higher education as a professor of mathematics and later computer science at the Universit¨¦ de Moncton, the only French-language university in Canada outside of Qu¨¦bec. While teaching at Moncton, he also was a candidate for the House of Commons of Canada, and the Legislature of the Province of New Brunswick; and was twice elected as the national Vice-President of the Liberal Party of Canada. In 1984, Dr. Patterson was appointed Chair of the Department of Computer Science at the University of New Orleans, and in 1988 Associate Vice Chancellor for Research at that university. In 1993, he was appointed Vice President for Research and Professional and Community Services, and Dean of the Graduate School at the College of Charleston and the University of Charleston, South Carolina. In 1998, he was selected by the Council of Graduate Schools, the national organization of graduate deans and graduate schools, as the Dean in Residence at the national office in Washington, DC. His other service to the graduate community in the United States has included being elected to the Presidency of the Conference of Southern Graduate Schools, and also to the Board of Directors of the Council of Graduate Schools.In 1999, he was appointed Senior Fellow at the Council of Graduate Schools. Since the year 2000, he has been the Senior Fellow for International Programs and Academic Program Review in the Graduate School at Howard University, and Professor of Computer Science at Howard as well. In December 2003, he also became Associate Vice Provost for Research at Howard, in which office he continues to serve today. In his own research, Dr. Patterson has published more than 40 scholarly articles, and a leading textbook, Mathematical Cryptology (Rowman and Littlefield, 1986). He has been the principal investigator on over 20 external grants valued at over $6,000,000. As an administrator, he increased the external grants at New Orleans by over 400% and at Charleston by 250%. He also increased the number of degree-seeking graduate students at Charleston by over 70%. Among his other activities, Dr. Patterson also co-founded (with Savanah Williams) the North America-South Africa University Linkages Project, which has sponsored more than 40 exchanges with the Historically Black Universities of South Africa. He has also been a visiting faculty member or fellow at American University, Howard University, and the Oak Ridge National Laboratories. He has served on the boards of many community organizations, including Big Brothers, Chamber of Commerce, United Way, Cannon Street YMCA in Charleston (the oldest African-American YMCA in the US), Charleston Farmers¡¯ Market, and the College of Charleston Cougar Club. He has also competed for five years in the US Open Volleyball Championships, and has been official scorer for many college and professional baseball teams, including the Oakland As and New York Mets in the Grapefruit League. Howard University, Washington, DC 0318 2005 Commander Scott Langley 3:00pm Math 303 In this talk, CDR Langley will give us a capabilities brief about SSC NOLA. He will also help us learn how the Navy is handling various parts of IT management, and information on several distributed network and application efforts that SSC NOLA are currently working with. He will also discuss the current and future initiatives at SSC NO that may lend to case studies, thesis research or collaborative work efforts. Scott Langley is a Navy Commander and an executive officer of SSC NOLA SSC NOLA 0311 2005 Dehua Zhao 3:00pm Math 303 Histology is the science of understanding the structure of animals and plants, and studying the functional implications of biological structures. In this talk, we present a statistical modeling approach to human histological image categorization. Texture features of the images are characterized by localized Gabor filters. The probabilistic distribution of the texture patterns from each category is approximated by a finite Gaussian mixture model. Expectation maximization (EM) procedure and minimum message length (MML) principle are used to perform density estimation and model selection, respectively. Componentwise EM and weak component annihilation are applied to avoid The drawbacks of the standard EM. Experimental validation is provided based on images from different organs and parts of the body. Dehua Zhao received the B.S degree from National University of Defense Technology, China, the M.S degree from Shanghai University, China, both in Electrical Engineering. He received the M.S degree in Computer Science from University of Wyoming. Dehua Zhao is a graduate student in the Computer Science Department at the University of New Orleans, advised by Prof. Yixin Chen. His current research interests include statistical classification and modeling, and machine learning for medical image analysis and retrieval. University of New Orleans 0304 2005 Dr. Dongyan Chen 3:00pm Math 303 The presence of physical obstacles and radio interference results in the so called ¡°shadow regions¡± in wireless networks. When a mobile station roams into a shadow region, it loses its network connectivity. In cellular networks, in order to minimize the connection unreliability, careful cell planning is required to prevent the occurrence of the shadow regions in the first place. In 802.11b/g wireless LANs, however, due to the limited frequency spectrum, it is not always possible to prevent a shadow region by adding another cell at a different frequency. Our contribution in this paper is to propose the alternate approach of tolerating the existence of ¡°shadow regions¡± as opposed to prevention in order to enhance the connection dependability. A redundant access point (AP) is placed in the shadow region to serve the mobile stations which roam into that region. Since the redundant AP operates on the same frequency as the primary AP, it does not constitute a separate cell. In fact, the primary and the secondary AP communicate to grant medium access to stations within the shadow region. We consider two configurations, which differ in how the two APs communicate with each other. In the first, the secondary AP is connected to the same distribution system as the primary AP. In the second, the secondary AP acts as a wireless forwarding bridge for traffic to/from the mobile stations in the shadow region to the primary AP. The paper outlines the details of how redundancy may be implemented by making enhancements to the basic 802.11 channel access protocol. To evaluate the dependability of the network under study, we present the reliability, availability and survivability analysis of the two configurations and compare them with the scheme with no redundancy. With numerical examples, we show that the redundancy schemes demonstrate significant improvement in connection dependability over the scheme with no redundancy. Dongyan Chen received the B.S degree from Southeast University, China, the M.Eng degree from Nanyang Technological University, Singapore, and the Ph.D degree from Duke University in Electrical and Computer Engineering. He is now with Computer Sciences and Computer Engineering Department, Xavier University of Louisiana. Dongyan Chen's research interests include discrete and fluid modeling techniques and their applications to communication system design and reliability/performance evaluation. Xavier University 0218 2005 Dr. Jing Peng 3:00pm Math 303 Relevance feedback is an attractive approach to developing flexible metrics for content-based retrieval in image and video databases. Large image databases require an index structure in order to reduce nearest neighbor computation. However, flexible metrics can alter an input space in a highly nonlinear fashion, thereby rendering the index structure useless. Few systems have been developed that address the apparent flexible metric/indexing dilemma. In this talk we present a kernel indexing method to try to address this conflict. The key observation is that kernel distances may be non-linear and highly dynamic in the input space but remain Euclidean in a kernel induced space. It is this linear invariance in the induced space that enables us to learn customized distance functions without changing the index. As a result, kernel indexing supports efficient relevance feedback retrieval in large image databases. We demonstrate the efficacy of the kernel indexing method using a large set of image data.. Jing Peng is an Assistant Professor of Electrical Engineering and Computer Science at Tulane University. He completed his Ph.D. in the area of reinforcement learning from Northeastern University, 1994. Previously, he was on the faculty of Computer Science at Oklahoma State University. His research interests include machine learning and content-based image retrieval. He has served on the program committees of various international conferences. Currently, he is serving as the Guest Co-Editor of the Special Issue on Learning in Computer Vision and Pattern Recognition, IEEE Transactions on Systems, Man, and Cybernetics. He has authored a number of technical publications in the areas of his interests. Tulane University 0204 2005 Dr. Huimin Chen 3:00pm Math 303 There exist quite a few criteria for penalty based model selection. Although they have various justifications for large sample problems, their performance under small or moderate sample size is unclear which hinders the development of model combination methods using the appropriate penalty term. In this paper, we assess the performance of seven model selection criteria based on linear regression models with unknown noise variance. We set the true data generation mechanism to be within the model set and outside the model set. In the latter case, soft model selection through multiple model fusion is proposed and its difference from Bayesian model averaging is highlighted. The penalty term used in each model selection criterion provides a natural link to estimate the model probability without assuming any prior knowledge of the unknown parameter. An important question is whether the estimated model probabilities are consistent when multiple models are fused for prediction or interpolation. We argue that strong consistency only holds under large sample regime while soft model selection can still be better than choosing a single model with small sample size. Our numerical results using different model selection criteria for polynomial fitting indicate that the conditional model estimator (CME) has the best performance in selection the correct model order and fusing multiple models for prediction and interpolation. The minimum description length (MDL) based criteria are next to CME and outperform Bayesian information criterion (BIC) and Akaike information criterion (AIC) significantly. Huimin Chen received the B.E. and M.E. degrees from Department of Automation, Tsinghua University, Beijing, China, in 1996 and 1998, respectively, and the Ph.D. degree from the Department of Electrical and Computer Engineering, University of Connecticut, Storrs, in 2002, all in electrical engineering. He was a post doctorate research associate at Physics and Astronomy Department, University of California, Los Angeles, and a visiting researcher with the Department of Electrical and Computer Engineering, Carnegie Mellon University from July 2002 where his research focus was on weak signal detection for single electron spin microscopy. He joined the Department of Electrical Engineering, University of New Orleans in Jan. 2003 as an assistant professor. His research interests are in general areas of signal processing, estimation theory, and information theory with applications to target detection and target tracking. University of New Orleans 1203 2004 Dr. Bin Fu 3:00pm CERM 438 We introduce the notion of width bounded geometric separator, develop the techniques for its existence as well as algorithm. Combining it with our new local binding method, we improve the exact algorithms for a large class of NP-complete problems, and also obtain the first sub-exponential time algorithm for protein folding problem in the HP-model. We obtain a 2^{O(\sqrt{n})} time exact algorithm for the disk covering problem, which seeks to determine the minimal number of fixed size disks to cover n points on plane. Applying our separator to a class of NP-hard problems on disk graphs, we also greatly improve the exact algorithm for maximum independent set problem on disk graph to 2^{O(\sqrt{n})}-time from the previous n^{O(\sqrt{n})}. For a constant w>0 and a set of points Q on the plane, an w-wide separator is the region between two parallel lines of distance w that partitions Q into Q_1 (in the left side of the region), S (inside the region), and Q_2 (in the right side of the region). If the distance is at least one between every two points in the set Q with n points, called 1-separated set, there is an w-wide separator that partitions Q into Q_1,S and Q_2 such that |Q_1|,|Q_2|\le (2/3)n, and |S|\le 1.2126w\sqrt{n}. Bin Fu is an assistant professor in the Computer Science Department at the University of New Orleans. His research interests include Bioinformatics algorithm and computational complexity and security. He received a B.S. and M.S. degree in computer science from Wuhan University, P.R.China, and a PhD in computer science from Yale University at New Haven. He worked as both software and hardware engineers in California before he joined UNO computer science department. University of New Orleans 1119 2004 Dr. André Skupin 3:00pm CERM 438 Spatialization of text documents has received considerable attention in recent years, as it promises to make high-dimensional structures more readily accessible to the human cognitive system. One particularly promising approach lies in the fusion of geographic metaphors and cartographic principles with techniques developed in information science and computer science, so that decidedly map-like visualizations of non-geographic information can be derived. This presentation highlights some recent results of this endeavor, with particular focus on how text processing, neural computing, and cartographic design can be combined toward knowledge domain visualization. André Skupin is an associate professor in the Department of Geography at the University of New Orleans. His research interests include text document visualization, geographic visualization, cartographic animation and hypermedia, and cartographic generalization. He received a Dipl.-Ing. degree in cartography from the Technical University Dresden, Germany, and a PhD in geography from the State University of New York at Buffalo. He did graduate research with the National Center for Geographic Information and Analysis (NCGIA) and has worked in the GIS industry in the US, Germany, and South Africa. University of New Orleans 1112 2004 Dr. Sheila Tejada 3:00pm CERM 438 The Virtual Synergy interface combines a three dimensional graphical interface with physical robots to allow for collaboration among multiple people, simulated software agents and physical robots. I employed Virtual Synergy in a variety of areas, for the AiBee robot art project, for the UNO urban search and rescue robot team, and for robot construction workers on Mars at NASA/JPL. To make human-robot collaboration effective and safe both the user interface and the autonomous robots must be designed to specifically handle the issues that arise when multiple human operators must interact with teams of robots to perform tasks, such as urban search and rescue. Human-robot interaction raises issues such as: * Appropriate inputs from humans * Adjusting the level of autonomy of the robots * Changing the distribution of roles and responsibilities between autonomous robots and humans * Modeling humans and their tasks * Facilitating human understanding of the goals, tasks and contexts of robots Implementing adjustable autonomy via roles can allow for better team collaboration during urban search and rescue (USAR). In this talk I present results from preliminary experiments with our mixed-autonomy USAR team. Also, I describe in detail Virtual Synergy, the human-robot interface that we developed, as well as the projects where it was employed. Dr. Sheila Tejada is currently an Assistant Professor in the Computer Science Department at the University of New Orleans. In 1993 she received her Bachelor of Science degree in Computer Science from the University of California, Los Angeles. She was awarded her Masters and Doctoral degrees in Computer Science from the University of Southern California in 1998 and 2002, respectively. Dr. Tejada has developed awarding-winning robots, such as, the robot YODA that took the silver medal at the AAAI office navigation robot competition, held in Portland, Oregon, and the robot soccer team DreamTeam that were the first world champions at the RoboCup International Robot Soccer Competition in Nagoya, Japan. Most recently, the UNO Robotics Team won a technical award for research on human-agent-robot interfaces at the AAAI/IJCAI Urban Search and Rescue Competition in Acapulco, Mexico and an Open Interaction award at AAAI 2004 as the Audience's favorite for the AiBee interactive robotic art project. University of New Orleans 2004 Dr. Eduardo Kortright 3:00pm CERM 438 Current research indicates that, to maximize safety and reliability while containing costs, process monitoring and control systems will increasingly rely on distributed networks of intelligent, highly autonomous sensors. Such systems will be capable of reporting quantitative/qualitative sensor readings, assessing system status, explaining current conditions, predicting likely system behaviors, and proposing corrective actions. The resulting information complexity threatens to exceed the capacity of human understanding, especially in high-risk situations requiring rapid human response. Ways for such a system to convey a wealth of information quickly and effectively have not yet been investigated. We describe the development of a prototype visualization of a rocket engine testing subsystem as a first step toward the development of a framework for /visual intelligent integrated health management systems./ Although the system we hope to develop will immediately apply to the propulsion testing being done at NASA's Stennis Space Center, the resulting framework is likely to be applicable to many similar activities involving complex, intelligent systems, including monitoring and control during all phases of space flight. Eduardo Kortright holds a Ph.D. in Computer Science from the University of Alabama. His doctoral dissertation work investigated applications of graph algorithms. Dr. Kortright's main research interests are currently in the field of medical imaging and scientific visualization. He was introduced to medical imaging applications during his work as a post-doctoral fellow and research assistant at the University of Alabama at Birmingham. Dr. Kortright is investigating computational methods for quantitative measurement of blood flow using MRI phase contrast angiography in conjunction with the Allegheny Singer Research Institute in Pittsburgh and the University of Alabama at Birmingham. Most recently, Dr. Kortright has begun a research project in the area of visualization of intelligent integrated health management systems in support of rocket engine testing. University of New Orleans 1022 2004 Dr. Ming-Hsing Chiu 3:00pm CERM 438 Efficient resource management techniques are of critical importance to the growing cellular/PCS industry. Unlike FDMA/TDMA system where capacity is fixed due to the frequency/time allocation, the capacity of a CDMA system is determined by the overall quality of signal-to-interference ratio (SIR). Compared to FDMA/TDMA, CDMA offers a relatively higher capacity with the same quality of services. With the growing demand of multimedia services on the internet, the wireless network must also expand their services to users from voice service to the multimedia services using advanced multiple access techniques. Due to its attractive features such as high system capacity, soft handoff, multi-path mitigation, interference suppression and low power transmission, DS-CDMA systems have become dominant in the 3rd generation multi-media wireless communication. In CDMA, power control is significant not only for prolonging battery life, but also for minimizing the problem caused by near-far effect. If all mobiles were to transmit at the same power level, the mobile closest to the base station will overpower all others. Therefore, the goal of power control is to make the signal strength received at base station (uplink power control) to be equalized for all mobile stations at a minimum possible level. Power control and handoff have been two significant problems for cellular networks. While both problems have received considerable attention of late, the problems are not often treated in a joint manner. In this talk, some preliminary simulation results on Call Admission Control of a multimedia CDMA system with consideration of both handoff prioritization and power control will be presented. Dr. Ming-Hsing Chiu has been a faculty member of Computer Science Department at the University of New Orleans since 1999. He received his MS and Ph.D. degree in Computer Science from the University of Central Florida., Orlando. His research interests include Wireless Networks, Internet Measurements and workload Characterization, and Interactive Distributed Simulation. University of New Orleans 1014 2004 Dr. Vassil Roussev 3:00pm CERM 438 Current generation of digital forensic tools has reached a level of maturity that allows forensic investigators to find evidence without in-depth technical knowledge of the investigative target. At the same time, current tools exhibit a number of limitations with respect to performance, scalability, flexibility, and interoperability that are quickly becoming a bottleneck for digital forensics labs. In this talk, we will examine the specific technical issues that present interesting research problems and will present the current work in the digital forensics research group in the department. Our main focus is the development of an open framework that addresses current limitations and provides an extensible platform for including new forensic methods. To address performance and scalability concerns, we are developing the first (public) infrastructure for distributed processing of digital evidence. The goal is to turn the investigation of large targets into an interactive process by employing the resources of a (commodity) compute cluster. Furthermore, we are integrating this approach with our previous work for on-the-spot forensic investigation so that investigators can have a unified and flexible platform that can easily be deployed in different configurations. Another unique feature of our work the integration of multi-user capabilities that would allow a team of investigators to collaborate on solving a case and will eventually allow for much better use of scarce human expertise. Finally, we will discuss a number of advanced processing features that are still in the planning and design phases. The exciting (for us) part is that the computational needs of these new analytical tools dramatically exceed the capabilities of any single machine and are only become possible because of our cluster-based processing. Examples include content-based image analysis, speech/voice recognition, and various forms of cryptographic analysis. Vassil Roussev is an Assistant Professor of Computer Science at the University of New Orleans, where he has been a faculty since 2002. Dr. Roussev has M.S. and Ph.D. degrees in computer science from the University of North Carolina, Chapel Hill as well as B.S. and M.S. degrees in computer science from Sofia University (Bulgaria). His research interests include digital forensics, distributed multi-user systems, mobile devices, and software engineering pattern-based techniques, component- and service-based models, agile development methods. University of of New Orleans 1001 2004 Dr. Duncan A. Buell 3:00pm CERM 438 The use of Field Programmable Gate Arrays (FPGAs) for computing in hybrid computer architectures and on applications not well suited to traditional processor architectures is now several years old, but fundamental problems have continued to plague those who would use such machines for computation. At the heart of the problem is and always has been that implementing an application has been a "hardware design" process and not a "programming" process. It now appears, however, that programming of a commercial reconfigurable computer is possible. We will describe the implementation of the DARPA High Productivity Computing Systems Discrete Mathematics Benchmarks on the SRC Computers SRC-6. In most instances, these benchmarks can be programmed in C, debugged, and optimized using techniques that are familiar to programmers of high-end machines. In the few instances in which the compiler tools have proven insufficient, hardware design methods and tools are used to implement libraries and functions called by the C program. The effectiveness of the SRC-6 is still limited due to hardware constraints, but because we can now readily program applications, we are able to explore fully the parameters of memory bandwidth, space/time tradeoff in the use of silicon, and the hardware/software codesign issues of balancing computation on the host processor versus computation on the FPGAs. University of South Carolina 1215 2003 Dr. Jing Deng 2:00pm Math 303 Recent advances of electronic and computer technologies have paved the way for the proliferation of ubiquitous wireless networks. Wireless Ad Hoc Networks can be formed temporarily and quickly, without the requirement of any infrastructures. Due to resource constraints and the open nature of these networks, the efficiency and security problems become very important. In this talk, we will firstly discuss the hidden/exposed terminal problems at Multiple Access Control (MAC) layer in wireless ad hoc networks. We then present an efficient solution, the Dual Busy Tone Multiple Access (DBTMA) scheme, which uses the Request-To-Send (RTS) packet and two out-of-band narrow-bandwidth busy tones. Secondly, we will analyze the performance of MAC schemes that employ split-channel technique. Several other interesting studies related to efficiency and security of wireless ad hoc networks will be briefly discussed. Dr. Jing Deng is a Research Assistant Professor at Syracuse University. Syracuse University 1105 2003 Dr. L. Venkata Subramaniam 2:00pm Math 123 Sophisticated and massively parallel experimental techniques have led to a substantial increase in the rate at which new biomedical information is discovered and reported. The predominant reporting mechanism of newly discovered biomedical information is journals and conference proceedings, both of which represent the information as unstructured natural language documents. Data mining and knowledge discovery from such a corpus is extremely challenging if possible at all. I will present a system called BioAnnotator, for identifying biological terms in scientific literature. IBM India Research Lab 2003 Dr. John Kelly Model Software Corporation 1112 2003 Dr. Brad A. Myers 2:00pm CERM 438 With today's and tomorrow's wireless technologies, such as IEEE 802.11, BlueTooth, RF-Lite, and G3, mobile devices will frequently be in close, interactive communication. Many environments, including offices, meeting rooms, automobiles, and classrooms, already contain many computers and computerized appliances, and the smart homes of the future will have ubiquitous embedded computation. When the user enters one of these environments carrying a mobile device, how will that device interact with the immediate environment? We are exploring, as part of the Pebbles research project, the many ways that mobile devices such as Palm Personal Organizers or Pocket PC / Windows CE devices, can serve as a useful adjunct to the "fixed" computers in the user's vicinity. This brings up many interesting research questions, such as how to provide a user interface that spans multiple devices which might be in use at the same time? How will users and the system decide which functions should be presented in what manner on what device? Can the user's mobile device be effectively used as a "Personal Universal Controller" to provide an easy-to-use and familiar interface to all of the complex appliances available to the user? Can communicating mobile devices enhance the effectiveness of meetings and classroom lectures? This talk will provide our preliminary observations on these issues, and will include demonstrations of some of our systems that we are using to investigate them. Carnegie Mellon University 2003 Kevin Knight USC Information Sciences Institute 0618 2003 Yixin Chen 2:00pm CERM 438 With the rapid growth of the Internet and the falling price of storage devices, it has become increasingly popular to store texts, images, graphics, video, and audio in digital formats. This raises the challenging problem of designing techniques that support effective searching and navigating through the rich contents of large digital archives. As a part of this general problem, content-based image retrieval (CBIR) has been an active research area for more than a decade. It aims at efficient retrieval of relevant images from large image databases based on automatically derived imagery features. However, images with high feature similarities to the query image may be very different from the query in terms of semantics. This discrepancy between low-level content features (such as color, texture, and shape) and high-level semantic concepts (such as sunset, flowers, outdoor scene, etc.) is known as "semantic gap", which is an open challenging problem in current CBIR systems. In this talk, I will present my recent research on tackling this problem: (1) The first approach is motivated by an observation of human visual systems. Although color and texture are fundamental aspects of visual perceptions, human discernment of certain visual contents could potentially be associated with interesting classes of objects or semantic meanings of objects in the image. Therefore, we propose a fully automated algorithm that attempts to associate a semantic concept of images with objects contained in the images. (2) The second approach is a novel image retrieval scheme, CLUster-based rEtrieval of images by unsupervised learning (CLUE), which attempts to tackle the semantic gap problem based on a hypothesis that images of the same semantics are similar in a way, images of different semantics are different in their own ways. CLUE attempts to capture high-level semantic concepts by learning the way that images of the same semantics are similar and retrieving image clusters instead of a set of ordered images. Clustering in CLUE is dynamic. In particular, clusters formed depend on which images are retrieved in response to the query. Therefore, the clusters give the algorithm as well as the users semantic relevant clues as to where to navigate. Pennsylvania State University 0613 2003 Dr. Nauman Chaudhry 2:00pm CERM 438 Traditionally the main focus in database management systems (DBMS) research and development has been on achieving high performance. Consequently a large number of tuning knobs are provided in current systems to allow hand-tuning of these systems. However, the level of expertise required to use these tuning opportunities presents a barrier to end-customers' ability to effectively use these features. Recognition of this fact has led to significant efforts in making DBMS easier to tune - by making sub-systems self-tuning and by providing intelligent tuning tools. In my presentation, I will first present an overview of the complexity of the tuning task and approaches to simplify it. I will then focus on the specific problem of tuning physical database structures. I will present algorithms for physical structure tuning and describe systems that provide this functionality. Towards the end, efforts in tuning DBMS will be placed in context of the larger problem of building self-tuning and self-managing computing systems and avenues for future research would be identified. Oracle Corporation 0407 2003 Murali Mani 3:00pm Math 121 XML provides several favorable and powerful data modeling capabilities not present in other data models. For example, if we compare XML and relational models, XML allows the database designer to represent relationships using paths, which enables "easier" querying, XML can represent recursive relationships "better", and XML can represent union types and ordered relationships. Even conceptual models we use at present do not capture these features. In order to make effective use of the powerful data modeling features of XML, we need to extend existing conceptual models. In our talk, we will extend the Entity-Relationship (ER) model, and call it ERex. We examine how ERex can be used to come up with good XML models. This work also finds applications in translation between XML and relational models. University of California, Los Angeles 0402 2003 Yingfei Dong 3:00pm Math 121 We discuss the quality assurance issue in video streaming across the best-effort Internet and the optimal resource management issue in both wide-area multimedia overlay networks and cable broadband networks. To address the issue of random quality degradation in streaming across the best-effort Internet, we design a practical technique, named "staggered two-flow video streaming." In this framework, we first develop a novel application-aware transport protocol --- "controlled TCP (cTCP)", and further develop efficient application-aware flowcontrol and adaptation approaches to manage bandwidth sharing and interactions of streaming flows, by exploiting the inherent priority structure in videos, the storage space on proxy servers and the coarse-grain bandwidth assurance of VPN. Our prototype on FreeBSD systems demonstrated the efficacy of the technique in effectively protecting essential data and significantly reducing packet losses and storage requirements on proxy servers. To address the bandwidth contention issue in providing IP-based Video-On-Demand (VOD) service on Cable broadband Network (CBNs), we design an efficient video session scheduling technique, called "optimal full-sharing". This technique fully exploits the unique characteristics of CBNs to reduce the bandwidth 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 develop adaptation algorithms which not only minimize the bandwidth consumption of video sessions but also significantly reduce service delays. In addition, we analyze the expected bandwidth and the session blocking probability of the system, and further design an efficient video assignment mechanism to maximize the system profit. At the end of this talk, I will briefly discuss my future research in network security, overlay networks, and multimedia networking. University of Minnesota 0324 2003 Yan Huang 3:00pm Math 105 Given a collection of boolean spatial features, the co-location pattern discovery process finds the subsets of features frequently located together. For example, the analysis of an ecology dataset may reveal the frequent co-location of a fire ignition source feature with a needle vegetation type feature and a drought feature. The spatial co-location rule problem is different from the association rule problem. Even though boolean spatial feature types (also called spatial events) may correspond to items in association rules over market-basket datasets, there is no natural notion of transactions. This creates difficulty in using traditional measures (e.g., support, confidence) and applying association rule mining algorithms that use support-based pruning. We propose a notion of user-specified neighborhoods in place of transactions to specify groups of items. New interest measures for spatial co-location patterns are developed which are robust in the face of potentially infinite overlapping neighborhoods. We also design a family of algorithms to mine frequent spatial co-location patterns. Experimental results are provided to show the strength of each algorithm and design decisions related to performance tuning and benefits of enabling agents access to these knowledge bases. The target application is a real-time medical diagnosis system for responding to biological agents. University of Minnesota 0310 2003 Ali Saman Tosun 3:00pm Math 105 The first part of my talk will present my research on security schemes for video transmission. That is, techniques that help ensure the privacy of the video data being transmitted. As a baseline comparison, I will show how passive attacks on streaming video are possible, backed up by experimental results from real video streams. I will then describe a prevention scheme that I proposed for MPEG that reveals no information to hackers eavesdropping on the stream. Extending this research, I will then present several efficient encryption and authentication mechanisms for proxy-based streaming aimed at minimizing security overhead at a proxy using end-to-end semantics. Finally, I will describe a lossless video coding framework based on layered coding and an encryption mechanism that reduces the total amount of data encrypted and allows adaptation to network resources. In the second part of the talk, I will present my work on similarity search databases. A similarity search query requests the item closest to the query point. Recently, a secure framework was proposed based on returning the score of a search aimed at protecting contents of database. We show that, in fact, the contents are not protected and can be discovered using repeated queries. For queries that return a score, we developed a framework that rejects queries that can potentially reveal information to users. A query history is stored and the amount of information is reduced by representing a query by a single number. Hashing is used to determine whether to answer the query or reject the query. Ohio State University 1210 2002 Sean Mooney 9:30am Math 121 The completion of a draft human genome sequence, along with several other complete genomes, is a great success for modern biology. To take advantage of these successes, new computational methods must be developed to store, integrate, annotate, disseminate and mine the data these projects have created. The required datasets are often spread over many resources, stored in disparate formats, and determined with different experimental protocols. In order to understand the underlying biology, these data must be integrated and presented in a way that can be useful to other researchers and automatic data mining methods. My previous research focuses on several computationally interesting hurdles encountered by researchers in computational biology. Examples based on data within the resource MutDB illustrate how to develop molecular models of disease. First, I present my results in the annotation of human genomic variation with data important for understanding its underlying biological function. Second, I summarize my integration of several genomic resources and the construction of an intuitive interface to the data. Third, I present algorithms that I developed for predicting which human mutations are most likely to participate in causing specific diseases and their application to the annotated genomic variation data. Finally, I discuss the presentation portal, MutDB, as a novel interface for other researchers to understand the underlying function behind human genetic variations. Stanford University 1202 2002 Stephen Winters-Hilt 3:00pm Math 121 Machine Learning (ML) methods are central to recent advances in many ields, including Cheminformatics, Bioinformatics, Voice Recognition, Image Recognition, and Financial Analysis. ML methods provide powerful tools for structure identification, feature extraction and classification. Hidden Markov Models (HMM), for example have been an indispensable tool in bioinformatics, and Support Vector Machines (SVMs) provide a new, powerful, tool for classification (and clustering). This presentation briefly describes application of these tools, along with traditional power signal analysis and statistical methods, to channel current cheminformatics, microbial informatics, and mammalian informatics. In the first half of the talk I describe recent work in cheminformatics: classification of DNA molecules using an alpha-hemolysin channel current detector. Classification with better that 99% accuracy is obtained for DNA molecules that only differ in their terminal base-pairs. Tools from bioinformatics are used here: HMMs with EM are used for feature extraction, and a multi-class SVM hierarchy is used to classify. In the second half of the talk I describe work in bioinformatics: codon-void annotation and a generalized interpolating Markov model provide the basis for good gene prediction in prokaryotes and good identification of regulatory motifs in general. Gene prediction in eukaryotes involves more complicated structure (introns) and regulation (alternate splicing), and is being analyzed with a generalized interpolating HMM. SVMs provide a general use discriminator to help boost gene and regulatory motif identification, and are described here in application to expression analysis (vibrio cholerae) and transcription factor binding site identification (mammalian GPCRs). University of California 1111 2002 Bin Fu 3:00pm Math 121 DNA computing uses the biological manipulations of DNA sequences to do the computation. Since we can let each DNA strand simulate Boolean circuit, a test tube containing a large number of DNA strands can run as a highly parallel computer. The maximum number of strands used is very important measure of DNA computing algorithm's complexity. This measure is called the volume used by the algorithm. From this study, we demonstrate an important connection between DNA computing and classical computing, thus enabling us to transform a large class of recursive algorithms into DNA computing algorithms. The research results in much improved the DNA computing algorithms for important problems such as 2-SAT, independent set and 3-colorability. Yale University 0412 2002 Jundong Liu 3:00pm Math 100 The goal of image registration as a problem is the alignment of two or more images of the same scene or object. It is one of the most widely encountered problems in a variety of fields including, but not limited to, medical image analysis, remote sensing, satellite imaging, optical imaging, etc. Currently, mutual information (MI) based methods are widely accepted as the most effective way of handling rigid multi-modal image registration problems. But MI methods have their drawbacks, including being computationally intensive, lacking in robustness, and lack of ease in handling non-rigid motion. My dissertation, research is an attempt to provide an alternative in place of MI methods. In this talk, I will give a description of the three major components of our proposed algoritthm: (1) a local frequency image representation used to capture common information; (2) an ESD measure together with a modified Newton method to achieve a very fast implementation; and (3) L2E measure to handle the different fields of view problem. University of Florida 0402 2002 Vassil Roussev 3:00pm Math 105 Distributed multi-user applications allow a group of geographically dispersed users to cooperate on a common task. Most commonly, this is achieved by the user with the abstraction of a shared artifact, such as a shared document. The main challenges in building infrastructures that support the development of such multi-user applications in object-oriented systems stem from the apparent conflict between data encapsulation and the need to share state among distributed object replicas. This conflict has led infrastructure designers to provide solutions that either emphasize automation over flexibility or vice versa. In this talk, I will present a novel approach to object sharing, along with its Java implementation, that reconciles the needs of encapsulation and sharing, thereby allowing automation to be achieved without compromising flexibility. The key idea behind the approach is to reuse the naming conventions already present in the object’s design to derive its logical structure from its public appearance. For that purpose, I will introduce a formal XML language that allows informal naming conventions to be concisely expressed as programming patterns that in turn are used to automate the development process. Since pattern analysis can be performed at run time, this approach significantly improves the reuse of existing code, such as single-user versions of the target applications. I will also discuss the general use of patterns and will provide examples of services, such as XML object serialization, UPnP user/system interface generation, and object testing that have been implemented in a generic fashion through patterns. I will conclude my presentation by outlining future directions in which my work can be extended both in and outside the domain of distributed collaboration. University of North Carolina 0314 2002 Sheila Tejada 3:00pm Math 105 When integrating information from multiple websites, the same data objects can exist in inconsistent text formats across sites, making it difficult to identify matching objects using exact text match. We have developed an object identification system called Active Atlas, which compares the objects' shared attributes in order to identify matching objects. Certain attributes are more important for deciding if a mapping should exist between two objects. Previous method of object identification have required manual construction of object identification rules or mapping rules for determining the mappings between objects, as well as domain-dependent transformations for recognizing format inconsistencies. This manual process is time consuming and error-prone. In this approach, Active Atlas learns to simultaneously tailor both mapping rules and a set of general transformations to