@conference {13391,
	title = {On Computing Compression Trees for Data Collection in Wireless Sensor Networks},
	booktitle = {2010 Proceedings IEEE INFOCOM},
	year = {2010},
	month = {2010/03/14/19},
	pages = {1 - 9},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and understanding how close we can get to the known theoretical lower bounds. Our proposed approach is based on finding an optimal or a near-optimal compression tree for a given sensor network: a compression tree is a directed tree over the sensor network nodes such that the value of a node is compressed using the value of its parent. We focus on broadcast communication model in this paper, but our results are more generally applicable to a unicast communication model as well. We draw connections between the data collection problem and a previously studied graph concept called weakly connected dominating sets, and we use this to develop novel approximation algorithms for the problem. We present comparative results on several synthetic and real-world datasets showing that our algorithms construct near-optimal compression trees that yield a significant reduction in the data collection cost.},
	keywords = {Approximation algorithms, Base stations, Communications Society, Computer networks, Computer science, computing compression trees, Costs, data collection, Data communication, data compression, designing algorithms, Educational institutions, Entropy, graph concept, Monitoring, Protocols, trees (mathematics), weakly connected dominating sets, Wireless sensor networks},
	isbn = {978-1-4244-5836-3},
	doi = {10.1109/INFCOM.2010.5462035},
	author = {Li,Jian and Deshpande, Amol and Khuller, Samir}
}
@conference {16275,
	title = {Inexact Local Alignment Search over Suffix Arrays},
	booktitle = {IEEE International Conference on Bioinformatics and Biomedicine, 2009. BIBM {\textquoteright}09},
	year = {2009},
	month = {2009/11/01/4},
	pages = {83 - 87},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may contain insertions and deletions. We present a generalized heuristic for finding such seeds efficiently and prove that the heuristic does not affect sensitivity. We show how to adapt this algorithm to work over the memory efficient suffix array with provably minimal overhead in running time. We demonstrate the effectiveness of our algorithm on two tasks: whole genome alignment of bacteria and alignment of the DNA sequences of 177 genes that are orthologous in human and mouse. We show our algorithm achieves better sensitivity and uses less memory than other commonly used local alignment tools.},
	keywords = {bacteria, Bioinformatics, biology computing, Computational Biology, Costs, DNA, DNA homology searches, DNA sequences, Educational institutions, generalized heuristic, genes, Genetics, genome alignment, Genomics, human, inexact local alignment search, inexact seeds, local alignment, local alignment tools, memory efficient suffix array, microorganisms, molecular biophysics, mouse, Organisms, Sensitivity and Specificity, sequences, suffix array, USA Councils},
	isbn = {978-0-7695-3885-3},
	doi = {10.1109/BIBM.2009.25},
	author = {Ghodsi,M. and Pop, Mihai}
}
@conference {14516,
	title = {Efficient Conversion of X.Y Surround Sound Content to Binaural Head-Tracked Form for HRTF-Enabled Playback},
	booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007},
	volume = {1},
	year = {2007},
	month = {2007/04//},
	pages = {I-21-I-24 - I-21-I-24},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Binaural presentation of X.Y sound is usually performed using virtual audio principles - that is, by attempting to virtually reproduce the setup of the X+Y loudspeakers in the reference room configuration. The computational cost of such playback is linear in the number of channels in the X.Y setup. We present a novel scheme that computes, offline, a spatio-temporal representation of the sound field in the listening area and store it as a multipole expansion. During head-tracked playback, the binaural signal is obtained by evaluating the multipole expansion at the ear position corresponding to the current user pose, resulting in a fixed playback cost. The representation is further extended to incorporate individualized HRTFs at no additional cost. Simulation results are presented.},
	keywords = {Acoustic fields, Acoustic scattering, acoustic signal processing, audio acoustics, Audio systems, binaural head-tracked, binaural presentation, Computational efficiency, Costs, Ear, head-related transfer function, Headphones, HRTF-enabled playback, Loudspeakers, Music, reverberation, sound field, spatio-temporal representation, surround sound, surround sound content, Transfer functions, virtual audio principles},
	isbn = {1-4244-0727-3},
	doi = {10.1109/ICASSP.2007.366606},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.}
}
@conference {18458,
	title = {Fast Multipole Accelerated Boundary Elements for Numerical Computation of the Head Related Transfer Function},
	booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007},
	volume = {1},
	year = {2007},
	month = {2007/04//},
	pages = {I-165-I-168 - I-165-I-168},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The numerical computation of head related transfer functions has been attempted by a number of researchers. However, the cost of the computations has meant that usually only low frequencies can be computed and further the computations take inordinately long times. Because of this, comparisons of the computations with measurements are also difficult. We present a fast multipole based iterative preconditioned Krylov solution of a boundary element formulation of the problem and use a new formulation that enables the reciprocity technique to be accurately employed. This allows the calculation to proceed for higher frequencies and larger discretizations. Preliminary results of the computations and of comparisons with measured HRTFs are presented.},
	keywords = {Acceleration, Acoustic measurements, Acoustic scattering, audio signal processing, boundary element formulation, Boundary element method, Boundary element methods, boundary-elements methods, Costs, Ear, Fast Multipole Method, Frequency, Head related transfer function, HUMANS, Irrigation, iterative methods, multipole accelerated boundary elements, multipole based iterative preconditioned Krylov solution, numerical computation, Reciprocity, Transfer functions},
	isbn = {1-4244-0727-3},
	doi = {10.1109/ICASSP.2007.366642},
	author = {Gumerov, Nail A. and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@article {12378,
	title = {Contention-conscious transaction ordering in multiprocessor DSP systems},
	journal = {IEEE Transactions on Signal Processing},
	volume = {54},
	year = {2006},
	month = {2006/02//},
	pages = {556 - 569},
	abstract = {This paper explores the problem of efficiently ordering interprocessor communication (IPC) operations in statically scheduled multiprocessors for iterative dataflow graphs. In most digital signal processing (DSP) applications, the throughput of the system is significantly affected by communication costs. By explicitly modeling these costs within an effective graph-theoretic analysis framework, we show that ordered transaction schedules can significantly outperform self-timed schedules even when synchronization costs are low. However, we also show that when communication latencies are nonnegligible, finding an optimal transaction order given a static schedule is an NP-complete problem, and that this intractability holds both under iterative and noniterative execution. We develop new heuristics for finding efficient transaction orders, and perform an extensive experimental comparison to gauge the performance of these heuristics.},
	keywords = {contention-conscious transaction ordering, Costs, data flow graphs, Dataflow, Delay, Digital signal processing, digital signal processing chips, Embedded system, graph-theoretic analysis, Instruments, Internet telephony, interprocessor communication, iterative dataflow graphs, iterative methods, Message passing, multiprocessor, multiprocessor DSP systems, NP-complete problem, Processor scheduling, scheduling, Signal processing, synchronization, Throughput},
	isbn = {1053-587X},
	doi = {10.1109/TSP.2005.861074},
	author = {Khandelia,M. and Bambha,N. K and Bhattacharyya, Shuvra S.}
}
@article {12814,
	title = {High-confidence medical device software and systems},
	journal = {Computer},
	volume = {39},
	year = {2006},
	month = {2006/04//},
	pages = {33 - 38},
	abstract = {Given the shortage of caregivers and the increase in an aging US population, the future of US healthcare quality does not look promising and definitely is unlikely to be cheaper. Advances in health information systems and healthcare technology offer a tremendous opportunity for improving the quality of care while reducing costs. The development and production of medical device software and systems is a crucial issue, both for the US economy and for ensuring safe advances in healthcare delivery. As devices become increasingly smaller in physical terms but larger in software terms, the design, testing, and eventual Food and Drug Administration (FDA) device approval is becoming much more expensive for medical device manufacturers both in terms of time and cost. Furthermore, the number of devices that have recently been recalled due to software and hardware problems is increasing at an alarming rate. As medical devices are becoming increasingly networked, ensuring even the same level of health safety seems a challenge.},
	keywords = {Aging, biomedical equipment, Clinical software engineering, Costs, FDA device, Food and Drug Administration device, health and safety, health care, health information system, health safety, healthcare delivery, Healthcare technology, Information systems, medical computing, medical device manufacturing, medical device software development, medical device systems development, medical information systems, Medical services, Medical software, Medical tests, networked medical devices, Production systems, Software design, Software safety, Software systems, Software testing, US healthcare quality},
	isbn = {0018-9162},
	doi = {10.1109/MC.2006.127},
	author = {Lee,I. and Pappas,G. J and Cleaveland, Rance and Hatcliff,J. and Krogh,B. H and Lee,P. and Rubin,H. and Sha,L.}
}
@conference {12830,
	title = {A Software Architectural Approach to Security by Design},
	booktitle = {Computer Software and Applications Conference, 2006. COMPSAC {\textquoteright}06. 30th Annual International},
	volume = {2},
	year = {2006},
	month = {2006/09/17/21},
	pages = {83 - 86},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper shows how an architecture description notation that has support for timed events can be used to provide a meta-language for specifying exact communication semantics. The advantages of such an approach is that a designer is made fully aware of the ramifications of her design choices so that an attacker can no longer take advantage of hidden assumptions},
	keywords = {architecture description notation, Clocks, communication semantics, Computer architecture, computer crime, computer security, Connectors, Costs, Degradation, Delay, Educational institutions, security design, security of data, Software architecture, software engineering},
	isbn = {0-7695-2655-1},
	doi = {10.1109/COMPSAC.2006.102},
	author = {Ray,A. and Cleaveland, Rance}
}
@conference {13367,
	title = {Exploiting Correlated Attributes in Acquisitional Query Processing},
	booktitle = {21st International Conference on Data Engineering, 2005. ICDE 2005. Proceedings},
	year = {2005},
	month = {2005/04/05/08},
	pages = {143 - 154},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency, or computational resources. When executing queries that contain several predicates over such expensive attributes, we observe that it can be beneficial to use correlations to automatically introduce low-cost attributes whose observation will allow the query processor to better estimate the selectivity of these expensive predicates. In particular, we show how to build conditional plans that branch into one or more sub-plans, each with a different ordering for the expensive query predicates, based on the runtime observation of low-cost attributes. We frame the problem of constructing the optimal conditional plan for a given user query and set of candidate low-cost attributes as an optimization problem. We describe an exponential time algorithm for finding such optimal plans, and describe a polynomial-time heuristic for identifying conditional plans that perform well in practice. We also show how to compactly model conditional probability distributions needed to identify correlations and build these plans. We evaluate our algorithms against several real-world sensor-network data sets, showing several-times performance increases for a variety of queries versus traditional optimization techniques.},
	keywords = {acquisitional query processing, Computer networks, Costs, data acquisition, Delay, Distributed computing, distributed information system, Distributed information systems, distributed processing, exponential time algorithm, optimization techniques, polynomial-time heuristic, Polynomials, probability, Query processing, real-time systems, real-world sensor-network, Runtime, Sensor phenomena and characterization, Sensor systems},
	isbn = {0-7695-2285-8},
	doi = {10.1109/ICDE.2005.63},
	author = {Deshpande, Amol and Guestrin,C. and Wei Hong and Madden,S.}
}
@conference {16462,
	title = {Exploiting multiple paths to express scientific queries},
	booktitle = {16th International Conference on Scientific and Statistical Database Management, 2004. Proceedings},
	year = {2004},
	month = {2004/06/21/23},
	pages = {357 - 360},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The purpose of this demonstration is to present the main features of the BioNavigation system. Scientific data collection needed in various stages of scientific discovery is typically performed manually. For each scientific object of interest (e.g., a gene, a sequence), scientists query a succession of Web resources following links between retrieved entries. Each of the steps provides part of the intended characterization of the scientific object. This process is sometimes partially supported by hard-coded scripts or complex queries that will be evaluated by a mediation-based data integration system or against a data warehouse. These approaches fail in guiding the scientists during the collection process. In contrast, the BioNavigation approach presented in the paper provides the scientists with information on the available alternative resources, their provenance, and the costs of data collection. The BioNavigation system enhances a mediation-based integration system and provides scientists with support for the following: to ask queries at a high conceptual level; to visualize the multiple alternative resources that may be exploited to execute their data collection queries; to choose the final execution path to evaluate their queries.},
	keywords = {access protocols, biology computing, BioNavigation system, complex queries, Costs, Data analysis, data handling, Data visualization, data warehouse, Data warehouses, Databases, diseases, distributed databases, hard-coded scripts, information resources, Information retrieval, mediation-based data integration system, multiple paths, query evaluation, Query processing, scientific data collection, scientific discovery, scientific information, scientific information systems, scientific object of interest, scientific queries, sequences, Web resources},
	isbn = {0-7695-2146-0},
	doi = {10.1109/SSDM.2004.1311231},
	author = {Lacroix,Z. and Moths,T. and Parekh,K. and Raschid, Louiqa and Vidal,M. -E}
}
@conference {19501,
	title = {On-chip stochastic communication [SoC applications]},
	booktitle = {Design, Automation and Test in Europe Conference and Exhibition, 2003},
	year = {2003},
	month = {2003///},
	pages = {790 - 795},
	abstract = {As CMOS technology scales down into the deep-submicron (DSM) domain, the costs of design and verification for systems-on-chip (SoCs) are rapidly increasing due to the inefficiency of traditional CAD tools. Relaxing the requirement of 100\% correctness for devices and interconnects drastically reduces the costs of design but, at the same time, requires that SoCs be designed with some system-level fault-tolerance. In this paper, we introduce a new communication paradigm for SoCs, namely stochastic communication. The newly proposed scheme not only separates communication from computation, but also provides the required built-in fault-tolerance to DSM failures, is scalable and cheap to implement. For a generic tile-based architecture, we show how a ubiquitous multimedia application (an MP3 encoder) can be implemented using stochastic communication in an efficient and robust manner. More precisely, up to 70\% data upsets, 80\% packet drops because of buffer overflow, and severe levels of synchronization failures can be tolerated while maintaining a low latency.},
	keywords = {buffer overflow, CMOS technology, CMOS technology scaling, Costs, data upsets, Design automation, Digital audio players, Fault tolerance, Fault tolerant systems, generic tile-based architecture, integrated circuit design, integrated circuit interconnections, interconnect correctness requirements, Logic Design, logic simulation, MP3 encoder, Multiprocessor interconnection networks, on-chip fault-tolerance, on-chip stochastic communication, packet drops, Pervasive computing, Robustness, SoC design, SoC verification, Stochastic processes, Synchronisation, synchronization failures, system latency, system-level fault-tolerance, system-on-chip, systems-on-chip, video coding},
	author = {Tudor Dumitras and Marculescu, R.}
}
@conference {16466,
	title = {Optimized seamless integration of biomolecular data},
	booktitle = {Proceedings of the IEEE 2nd International Symposium on Bioinformatics and Bioengineering Conference, 2001},
	year = {2001},
	month = {2001/11/04/6},
	pages = {23 - 32},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Today, scientific data is inevitably digitized, stored in a variety of heterogeneous formats, and is accessible over the Internet. Scientists need to access an integrated view of multiple remote or local heterogeneous data sources. They then integrate the results of complex queries and apply further analysis and visualization to support the task of scientific discovery. Building a digital library for scientific discovery requires accessing and manipulating data extracted from flat files or databases, documents retrieved from the Web, as well as data that is locally materialized in warehouses or is generated by software. We consider several tasks to provide optimized and seamless integration of biomolecular data. Challenges to be addressed include capturing and representing source capabilities; developing a methodology to acquire and represent metadata about source contents and access costs; and decision support to select sources and capabilities using cost based and semantic knowledge, and generating low cost query evaluation plans},
	keywords = {analysis, Bioinformatics, biology computing, cost based knowledge, Costs, Data analysis, data mining, data visualisation, Data visualization, Data warehouses, decision support, digital library, Educational institutions, information resources, Internet, low cost query evaluation plans, Mediation, meta data, metadata, molecular biophysics, multiple local heterogeneous data sources, multiple remote heterogeneous data sources, optimized seamless biomolecular data integration, scientific discovery, scientific information systems, semantic knowledge, software libraries, visual databases, Visualization},
	isbn = {0-7695-1423-5},
	doi = {10.1109/BIBE.2001.974408},
	author = {Eckman,B. A and Lacroix,Z. and Raschid, Louiqa}
}
@article {16305,
	title = {Assessing software review meetings: results of a comparative analysis of two experimental studies},
	journal = {IEEE Transactions on Software Engineering},
	volume = {23},
	year = {1997},
	month = {1997/03//},
	pages = {129 - 145},
	abstract = {Software review is a fundamental tool for software quality assurance. Nevertheless, there are significant controversies as to the most efficient and effective review method. One of the most important questions currently being debated is the utility of meetings. Although almost all industrial review methods are centered around the inspection meeting, recent findings call their value into question. In prior research the authors separately and independently conducted controlled experimental studies to explore this issue. The paper presents new research to understand the broader implications of these two studies. To do this, they designed and carried out a process of {\textquotedblleft}reconciliation{\textquotedblright} in which they established a common framework for the comparison of the two experimental studies, reanalyzed the experimental data with respect to this common framework, and compared the results. Through this process they found many striking similarities between the results of the two studies, strengthening their individual conclusions. It also revealed interesting differences between the two experiments, suggesting important avenues for future research},
	keywords = {Aggregates, Collaborative work, Computer Society, Costs, Helium, Inspection, inspection meeting, Job shop scheduling, Programming, reconciliation, Software development management, Software quality, software quality assurance, software review meeting assessment, Software reviews},
	isbn = {0098-5589},
	doi = {10.1109/32.585501},
	author = {Porter, Adam and Johnson,P. M}
}
@article {16297,
	title = {An experiment to assess the cost-benefits of code inspections in large scale software development},
	journal = {IEEE Transactions on Software Engineering},
	volume = {23},
	year = {1997},
	month = {1997/06//},
	pages = {329 - 346},
	abstract = {We conducted a long term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to a commercial software product they were creating. Because the laboratory for this experiment was a live development effort, we took special care to minimize cost and risk to the project, while maximizing our ability to gather useful data. The article has several goals: (1) to describe the experiment{\textquoteright}s design and show how we used simulation techniques to optimize it; (2) to present our results and discuss their implications for both software practitioners and researchers; and (3) to discuss several new questions raised by our findings. For each inspection, we randomly assigned three independent variables: (1) the number of reviewers on each inspection team (1, 2, or 4); (2) the number of teams inspecting the code unit (1 or 2); and (3) the requirement that defects be repaired between the first and second team{\textquoteright}s inspections. The reviewers for each inspection were randomly selected without replacement from a pool of 11 experienced software developers. The dependent variables for each inspection included inspection interval (elapsed time), total effort, and the defect detection rate. Our results showed that these treatments did not significantly influence the defect detection effectiveness, but that certain combinations of changes dramatically increased the inspection interval},
	keywords = {Analysis of variance, code inspection cost benefits, code unit, commercial software product, Computer Society, cost-benefit analysis, Costs, defect detection effectiveness, defect detection rate, Design optimization, experienced software developers, experiment design, independent variables, Inspection, inspection interval, inspection team, Laboratories, large scale software development, Large-scale systems, live development effort, long term experiment, professional aspects, professional developers, Programming, reviewers, simulation techniques, software cost estimation, software inspection methods, software practitioners, Software quality, Switches},
	isbn = {0098-5589},
	doi = {10.1109/32.601071},
	author = {Porter, Adam and Siy,H. P and Toman,C. A and Votta,L. G.}
}
@conference {14579,
	title = {A SIMD solution to the sequence comparison problem on the MGAP},
	booktitle = {International Conference on Application Specific Array Processors, 1994. Proceedings},
	year = {1994},
	month = {1994/08/22/24},
	pages = {336 - 345},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Molecular biologists frequently compare an unknown biosequence with a set of other known biosequences to find the sequence which is maximally similar, with the hope that what is true of one sequence, either physically or functionally, could be true of its analogue. Even though efficient dynamic programming algorithms exist for the problem, when the size of the database is large, the time required is quite long, even for moderate length sequences. In this paper, we present an efficient pipelined SIMD solution to the sequence alignment problem on the Micro-Grain Array Processor (MGAP), a fine-grained massively parallel array of processors with nearest-neighbor connections. The algorithm compares K sequences of length O(M) with the actual sequence of length N, in O(M+N+K) time with O(MN) processors, which is AT-optimal. The implementation on the MGAP computes at the rate of about 0.1 million comparisons per second for sequences of length 128},
	keywords = {AT-optimal algorithm, Biological information theory, biology computing, biosequence comparison problem, computational complexity, Computer science, Costs, database size, Databases, DNA computing, dynamic programming, dynamic programming algorithms, fine-grained massively parallel processor array, Genetics, Heuristic algorithms, maximally similar sequence, MGAP parallel computer, Micro-Grain Array Processor, Military computing, molecular biology, molecular biophysics, Nearest neighbor searches, nearest-neighbor connections, Parallel algorithms, pipeline processing, pipelined SIMD solution, sequence alignment problem, sequences},
	isbn = {0-8186-6517-3},
	doi = {10.1109/ASAP.1994.331791},
	author = {Borah,M. and Bajwa,R. S and Hannenhalli, Sridhar and Irwin,M. J}
}
@article {16768,
	title = {A pipeline N-way join algorithm based on the 2-way semijoin program},
	journal = {IEEE Transactions on Knowledge and Data Engineering},
	volume = {3},
	year = {1991},
	month = {1991/12//},
	pages = {486 - 495},
	abstract = {The semijoin has been used as an effective operator in reducing data transmission and processing over a network that allows forward size reduction of relations and intermediate results generated during the processing of a distributed query. The authors propose a relational operator, two-way semijoin, which enhanced the semijoin with backward size reduction capability for more cost-effective query processing. A pipeline N-way join algorithm for joining the reduced relations residing on N sites is introduced. The main advantage of this algorithm is that it eliminates the need for transferring and storing intermediate results among the sites. A set of experiments showing that the proposed algorithm outperforms all known conventional join algorithms that generate intermediate results is included},
	keywords = {2-way semijoin program, backward size reduction, Bandwidth, Computer networks, Costs, Data communication, data transmission, Database systems, database theory, Delay, distributed databases, distributed query, forward size reduction, intermediate results, Local area networks, network, Parallel algorithms, pipeline N-way join algorithm, pipeline processing, Pipelines, programming theory, Query processing, Relational databases, relational operator, SITES, Workstations},
	isbn = {1041-4347},
	doi = {10.1109/69.109109},
	author = {Roussopoulos, Nick and Kang,H.}
}
@article {16330,
	title = {Empirically guided software development using metric-based classification trees},
	journal = {IEEE Software},
	volume = {7},
	year = {1990},
	month = {1990/03//},
	pages = {46 - 54},
	abstract = {The identification of high-risk components early in the life cycle is addressed. A solution that casts this as a classification problem is examined. The proposed approach derives models of problematic components, based on their measurable attributes and those of their development processes. The models provide a basis for forecasting which components are likely to share the same high-risk properties, such as being error-prone or having a high development cost. Developers can use these classification techniques to localize the troublesome 20\% of the system. The method for generating the models, called automatic generation of metric-based classification trees, uses metrics from previous releases or projects to identify components that are historically high-risk.},
	keywords = {Application software, Area measurement, automatic generation, classification problem, Classification tree analysis, Costs, empirically guided software development, Error correction, life cycle, measurable attributes, metric-based classification trees, Predictive models, Programming, software engineering, Software measurement, software metrics, Software systems},
	isbn = {0740-7459},
	doi = {10.1109/52.50773},
	author = {Porter, Adam and Selby,R. W}
}
@conference {17051,
	title = {Database Program Conversion: A Framework For Research},
	booktitle = {Fifth International Conference on Very Large Data Bases, 1979},
	year = {1979},
	month = {1979/10/03/5},
	pages = {299 - 312},
	publisher = {IEEE},
	organization = {IEEE},
	keywords = {Application software, Costs, Data conversion, Data structures, Databases, Delay, Prototypes, Technology planning, US Government, Writing},
	doi = {10.1109/VLDB.1979.718145},
	author = {Taylor,R. W and Fry,J. P and Shneiderman, Ben and Smith,D. C.P and Su,S. Y.W}
}
