{"title":"Enterprise data management in research organizations: data the way you want it","authors":"M. Blake","doi":"10.1145/948542.948554","DOIUrl":"https://doi.org/10.1145/948542.948554","url":null,"abstract":"Raw data and processed information are essential to organizations that perform operational analysis and build simulation systems. In such domains, the dissemination and management of this information is a daunting task. Not only must this data support a heterogeneous array of researchers, but also the requirements on this data are constantly changing. To achieve maximum utility, data of this sort must be made available in distributed locations and offered in various custom formats. Such approaches as relational-to-XML, XML-XSL-based custom formats, and web-accessible database reporting tools offer some solutions for this domain. However, there are some requirements that the current state of the art do not fulfill. In this paper, there is a characterization of the state of the art for this distributed data management domain and a discussion of the current short-comings.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"514 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131821188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Vuppu, Antonio A. Garcia, S. Saha, P. Phelan, R. Calhoun, M. Hayes
{"title":"Modeling flow around a microrotor in creeping flow using a quasi-steady-state analysis","authors":"A. Vuppu, Antonio A. Garcia, S. Saha, P. Phelan, R. Calhoun, M. Hayes","doi":"10.1145/948542.948543","DOIUrl":"https://doi.org/10.1145/948542.948543","url":null,"abstract":"Paramagnetic microsphere suspensions placed in a rotating magnetic field aggregate to form rotating magnetic chains. These chains that are several tens of micrometers in length act as microrotors, and can be modeled as circular cylinders. The flow and associated micromixing around these cylinders rotating about their radial axis is studied for a very low Reynolds number, creeping-flow system.. Time-scales for momentum transfer are much smaller than boundary movement, hence a quasi-steady approximation can be used. The flow is derived at every instant from the case of a steady motion of a horizontally translating cylinder, with the rotation approximated to a series of incremental translations. A numerical simulation was used to determine the pathlines and material lines of point fluid elements, which were analyzed to understand the behavior of the microfluidic system. The results indicate the flow to be unsteady, with chaotic advection observed in the system. The flow is primarily two-dimensional with planar fluid movement limited to the immediate area around the rotating cylinder, with a small disturbance in the axial direction that is experienced up to many diameters away. Elliptic and star shaped pathlines, including periodic orbits, are observed depending on the fluid element's initial location. The trajectories and phase angles compare well with the limited experimental results, as well as with data from particle dynamics simulations. Material lines and streaklines display stretching and folding, which are indicative of the chaotic behavior of the system. The material lines have similar lengths for the same amount of rotation at different speeds, and the affect of rotational speeds appears to be primarily to change the time of mixing.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129896384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Iterative detection of a CFSK system","authors":"L. C. Pérez, Chen Xia","doi":"10.1145/948542.948553","DOIUrl":"https://doi.org/10.1145/948542.948553","url":null,"abstract":"The MAP consensus decoder using iterative detection for a collision frequency-shift-keyed (CFSK) system is investigated in this paper. This consensus decoder decodes each user's message in a joint and iterative manner. For a specific user, interference from other users is canceled by the iteration process. The metric of the CFSK channel will introduce high complexity to the MAP algorithm when the system is highly loaded. The K-most probable combinations (KMPC) approach and two-most probable combinations (TMPC) approach are applied to simplify the metric. Analysis shows that the TMPC method keeps fairness for all the users, even though some users put high weights on the probabilities of part of the frequencies.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129730408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A generalized model for network survivability","authors":"John Koroma, W. Li, D. Kazakos","doi":"10.1145/948542.948552","DOIUrl":"https://doi.org/10.1145/948542.948552","url":null,"abstract":"The high expectation of network to be available and perform at all time has created growing concerns between network operators and engineers all over the globe. Network should be available to users whenever they want to use them. In the wake of an attack, network should be also able to recover as soon as possible. A survivable network is one that can provide services in the presence of an attack or failure and be able to recover fully in a timely manner. Designing a model for network survivability basically involves the understanding of three key issues, i.e, how the system will function in the wake of failures, what will be the impact of failures on the user, and how to overcome these failures. To achieve these goals, this paper proposes a quantitative approach to evaluate the network survivability in terms of using a generalized model; we consider a more complex system with several faults to study the survivability of a network using Markov chain. In presenting a better survivability performance, some numerical comparisons for the network availability, failure frequency and survivability is also developed.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123786647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The neem dream","authors":"C. Ellis, Paulo Barthelmess","doi":"10.1145/948542.948548","DOIUrl":"https://doi.org/10.1145/948542.948548","url":null,"abstract":"Imagine an environment in which computerized agents assist in human to human interaction via voice, video, and other multi-media/multi-modal mechanisms. The Project Neem work introduces virtual participants Kwaku, Kwabena, and Kwesi - virtual participants who endeavor to make distributed meetings more effective, more efficient, and more pleasant.This document provides an overview of project Neem; its goals and directions, and its motivation. Neem is a research project at the University of Colorado concerned with understanding, enhancing and augmenting highly interactive distributed collaborations through advanced technology. A major novel aspect of this research is the use of intelligent artificial agents as full-fledged meeting participants. Goals of this interdisciplinary project include the enhancement of distributed group interaction understanding, and the creation and testing of prototype distributed meeting environments. With the encouragement and partnership of iAAEC (the Institute for African American Electronic Community), we have built and are testing a prototype distributed meeting system.Research methods include theoretical modeling, meetings analyses, prototype implementation and testing in real world environments, and meeting metrics development and application. Tools for understanding the social and organizational context of these meetings include the SYMLOG methodology applied by social agents, and the IBIS methodology applied by organizational agents. A new model enabling these agent analyses is the GraspIce model, explained in this document. The work described herein is part of a larger ongoing effort within the Collaboration Technology Research Group at the University of Colorado to understand human collaboration, and to assist and enhance that collaboration via technology.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123812932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new infeasible interior-point algorithm for linear programming","authors":"M. Argáez, L. Velázquez","doi":"10.1145/948542.948545","DOIUrl":"https://doi.org/10.1145/948542.948545","url":null,"abstract":"In this paper we present an infeasible path-following interior-point algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as a central region. The algorithm starts from an infeasible point which satisfies that the norm of the dual condition is less than the norm of the primal condition. We use weighted sets as proximity measures of the quasicentral path, and a new merit function for making progress toward this central region. We test the algorithm on a set of NETLIB problems obtaining promising numerical results.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123054708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"User modeling for personalized universal appliance interaction","authors":"O. Omojokun, C. Isbell","doi":"10.1145/948542.948555","DOIUrl":"https://doi.org/10.1145/948542.948555","url":null,"abstract":"One of the driving applications of ubiquitous computing is universal appliance interaction. It is the ability to use arbitrary mobile devices-some of which we traditionally think of as computers (e.g. handhelds and wearables), and some of which we do not (e.g. cell phones)-to interact with arbitrary appliances such as TVs, printers, and lights. We believe that universal appliance interaction is best supported through the deployment of appliance user-interfaces (UIs) that are personalized to a user's habits and information needs. We are building a UI deployment system for universal appliance interaction to support various personalization features based on predicting a user's behavior. It is our belief that we can achieve these features in our system by modeling user actions using machine learning (ML) algorithms. The initial step in building such a system that relies on ML for prediction is to show that there are patterns in user appliance interaction. In this paper, our goal is to present evidence demonstrating these patterns.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122934807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An object oriented library to manage the collection of Schittkowski test problems for nonlinear optimization","authors":"J. Meza, Ricardo A. Oliva","doi":"10.1145/948542.948544","DOIUrl":"https://doi.org/10.1145/948542.948544","url":null,"abstract":"This paper describes a C++ library that allows handling these test problems in an object-oriented manner without replacing the original Fortran code. The class includes wrappers for evaluating the functions defining each problem, in addition to methods that allow the user to query whether certain features are present in a given test problem. This makes it possible to classify and select subsets of the problems according to criteria specific for the code being tested.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130511384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic and robust capacity allocation in wireless networks carrying heterogeneous traffics","authors":"A. Burrell, P. Papantoni-Kazakos","doi":"10.1145/948542.948556","DOIUrl":"https://doi.org/10.1145/948542.948556","url":null,"abstract":"We consider wireless networks carrying heterogeneous traffics. We assume that the characteristics of the traffic classes are time varying: at each point in time, a traffic class is described by a process randomly selected from within a set of non parametrically defined stochastic processes.For the wireless environment described above, we compare two multiplexing transmission techniques: a dynamic Time-Division-Based and a dynamic CDMA-Based techniques, in terms of a number of pertinent performance metrics. The dynamics of both techniques manifest themselves as dynamic capacity allocations to the various traffic classes and are implemented via the deployment of a Robust Traffic Monitoring Algorithm (RTMA). The performance metrics studied include delays, traffic rejection rates and wasted capacity rates. Qualitatively speaking, a major controlling factor in the choice among the Time-Division-Based and the CDMA-Based techniques is the speed of the transmission channel: high speeds favor CDMA-Based transmissions.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"10 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126968605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}