@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 {15856,
	title = {Replication and automation of expert judgments: Information engineering in legal e-discovery},
	booktitle = {IEEE International Conference on Systems, Man and Cybernetics, 2009. SMC 2009},
	year = {2009},
	month = {2009/10/11/14},
	pages = {102 - 107},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The retrieval of digital evidence responsive to discovery requests in civil litigation, known in the United States as {\~A}{\^A}{\textquestiondown}e-discovery,{\~A}{\^A}{\textquestiondown} presents several important and understudied conditions and challenges. Among the most important of these are (i) that the definition of responsiveness that governs the search effort can be learned and made explicit through effective interaction with the responding party, (ii) that the governing definition of responsiveness is generally complex, deriving both from considerations of subject-matter relevance and from considerations of litigation strategy, and (iii) that the result of the search effort is a set (rather than a ranked list) of documents, and sometimes a quite large set, that is turned over to the requesting party and that the responding party certifies to be an accurate and complete response to the request. This paper describes the design of an {\~A}{\^A}{\textquestiondown}interactive task{\~A}{\^A}{\textquestiondown} for the text retrieval conference{\textquoteright}s legal track that had the evaluation of the effectiveness of e-discovery applications at the {\~A}{\^A}{\textquestiondown}responsive review{\~A}{\^A}{\textquestiondown} task as its goal. Notable features of the 2008 interactive task were high-fidelity human-system task modeling, authority control for the definition of {\~A}{\^A}{\textquestiondown}responsiveness,{\~A}{\^A}{\textquestiondown} and relatively deep sampling for estimation of type 1 and type 2 errors (expressed as {\~A}{\^A}{\textquestiondown}precision{\~A}{\^A}{\textquestiondown} and {\~A}{\^A}{\textquestiondown}recall{\~A}{\^A}{\textquestiondown}). The paper presents a critical assessment of the strengths and weaknesses of the evaluation design from the perspectives of reliability, reusability, and cost-benefit tradeoffs.},
	keywords = {authorisation, authority control, Automation, civil litigation, CYBERNETICS, Delay, digital evidence retrieval, discovery request, Educational institutions, expert judgment automation, Human computer interaction, Human-machine cooperation and systems, human-system task modeling, information engineering, Information retrieval, interactive task, Law, law administration, legal e-discovery, Legal factors, PROBES, Production, Protocols, search effort, Search methods, text analysis, text retrieval conference legal track, United States, USA Councils, User modeling},
	isbn = {978-1-4244-2793-2},
	doi = {10.1109/ICSMC.2009.5346118},
	author = {Hedin,B. and Oard, Douglas}
}
@conference {12086,
	title = {Achieving packet-level quality of service through scheduling in multirate WLANs},
	booktitle = {Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th},
	volume = {4},
	year = {2004},
	month = {2004/09/26/29},
	pages = {2730- 2734 Vol. 4 - 2730- 2734 Vol. 4},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Wireless packet scheduling has been a popular paradigm to achieve packet-level QoS in terms of fairness and throughput in the presence of channel errors. However, the current design does not anticipate the multi-rate capability offered by the IEEE 802.11a/b/g physical layer, thus suffering significant performance degradation in 802.11 WLANs. In this paper, we propose multirate wireless fair scheduling (WMFS). In MWFS, each flow is granted a temporal fair share of the channel, in contrast to the throughput fair share adopted by existing algorithms. Therefore, each flow receives services in proportion to its perceived transmission rate, and high-rate flows are able to opportunistically exploit their good channel conditions and receive more services. MWFS also renovates the compensation model in order to allow for error-prone flows to catch up, thus ensuring fairness for all flows over error-prone channels. We demonstrate the effectiveness of MWFS through both simulations and analysis. Especially, WMFS achieves system throughput 159\% of state-of-the-art scheduling algorithms in simulated scenarios.},
	keywords = {Analytical models, channel conditions, channel errors, channel temporal fair share, compensation, Computer science, Delay, error-prone flow compensation, IEEE 802.11a/b/g physical layer, multirate wireless fair scheduling, multirate WLAN, packet radio networks, packet-level quality of service, Physical layer, Processor scheduling, QoS, quality of service, radio access networks, Scheduling algorithm, Throughput, throughput fairness, USA Councils, Wireless LAN, wireless packet scheduling, WMFS},
	isbn = {0-7803-8521-7},
	doi = {10.1109/VETECF.2004.1400554},
	author = {Yuan Yuan and Daqing Gu and Arbaugh, William A. and Jinyun Zhang}
}
@article {17209,
	title = {Human-centered computing, online communities, and virtual environments},
	journal = {IEEE Computer Graphics and Applications},
	volume = {19},
	year = {1999},
	month = {1999/12//Nov},
	pages = {70 - 74},
	abstract = {This report summarizes results of the first EC/NSF joint Advanced Research Workshop, which identified key research challenges and opportunities in information technology. The group agreed that the first joint research workshop should concentrate on the themes of human-centered computing and VEs. Human-centered computing is perceived as an area of strategic importance because of the move towards greater decentralization and decomposition in the location and provision of computation. The area of VEs is one where increased collaboration should speed progress in solving some of the more intractable problems in building effective applications},
	keywords = {Books, Collaboration, Collaborative work, Conferences, EC/NSF joint Advanced Research Workshop, Feeds, Human computer interaction, human-centered computing, Internet, Joining materials, Laboratories, Online communities, Research initiatives, USA Councils, User interfaces, Virtual environment, virtual environments, Virtual reality},
	isbn = {0272-1716},
	doi = {10.1109/38.799742},
	author = {Brown,J. R and van Dam,A. and Earnshaw,R. and Encarnacao,J. and Guedj,R. and Preece,J. and Shneiderman, Ben and Vince,J.}
}
