Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Wright State University (227)
- Singapore Management University (112)
- Edith Cowan University (44)
- University of Nebraska - Lincoln (41)
- California Polytechnic State University, San Luis Obispo (37)
-
- Dartmouth College (29)
- Purdue University (26)
- University of Massachusetts Amherst (25)
- Missouri University of Science and Technology (24)
- Washington University in St. Louis (21)
- Taylor University (20)
- Brigham Young University (19)
- Syracuse University (18)
- City University of New York (CUNY) (13)
- Technological University Dublin (11)
- Old Dominion University (9)
- Smith College (9)
- University of Nebraska at Omaha (9)
- University of Dayton (6)
- University of New Hampshire (6)
- Kennesaw State University (5)
- San Jose State University (5)
- Air Force Institute of Technology (4)
- Claremont Colleges (4)
- Portland State University (4)
- University of Nevada, Las Vegas (4)
- Western Kentucky University (4)
- Carleton College (3)
- Gettysburg College (3)
- Marquette University (3)
- Keyword
-
- [aism] (18)
- Security (11)
- Mobile computing (7)
- Semantic Web (7)
- Wireless (7)
-
- Network (6)
- Algorithms (5)
- Classification (5)
- Ontology (5)
- Clustering (4)
- Information security (4)
- Machine learning (4)
- Wireless sensor networks (4)
- [RSTDPub] (4)
- Access control (3)
- Animation (3)
- Authentication (3)
- Computer and Information Science Education (3)
- Data mining (3)
- Grid computing (3)
- Information retrieval (3)
- Information technology (3)
- Internet (3)
- Metadata (3)
- Middleware (3)
- NaradaBrokering (3)
- Navigation (3)
- Neural networks (3)
- Optimisation (3)
- Power Transmission Control (3)
- Publication
-
- Computer Science & Engineering Syllabi (165)
- Research Collection School Of Computing and Information Systems (109)
- Research outputs pre 2011 (44)
- Kno.e.sis Publications (37)
- Computer Science Technical Reports (33)
-
- Computer Science and Software Engineering (33)
- Department of Computer Science Technical Reports (26)
- Faculty Publications (26)
- Computer Science and Engineering Faculty Publications (25)
- Computer Science Department Faculty Publication Series (24)
- All Computer Science and Engineering Research (21)
- ACMS Conference Proceedings 2005 (20)
- CSE Conference and Workshop Papers (20)
- Electrical Engineering and Computer Science - All Scholarship (18)
- Computer Science Faculty Publications (17)
- Computer Science Faculty Research & Creative Works (13)
- CSE Technical Reports (12)
- Computer Science: Faculty Publications (9)
- Dartmouth Scholarship (9)
- School of Computing: Faculty Publications (9)
- Conference papers (8)
- Electrical and Computer Engineering Faculty Research & Creative Works (7)
- Center for Coastal and Ocean Mapping (6)
- Faculty and Research Publications (5)
- Collaborative Agent Design (CAD) Research Center (4)
- Business and Information Technology Faculty Research & Creative Works (3)
- Computer Science Faculty Proceedings & Presentations (3)
- Computer Science Faculty Publications and Presentations (3)
- Faculty Work (3)
- Masters Theses & Specialist Projects (3)
Articles 1 - 30 of 783
Full-Text Articles in Physical Sciences and Mathematics
Probabilistic Road Map Sampling Strategies For Multi-Robot Motion Planning, Christopher M. Clark
Probabilistic Road Map Sampling Strategies For Multi-Robot Motion Planning, Christopher M. Clark
Computer Science and Software Engineering
This paper presents a Probabilistic Road Map (PRM) motion planning algorithm to be queried within Dynamic Robot Networks—a multi-robot coordination platform for robots operating with limited sensing and inter-robot communication. First, the Dynamic Robot Networks (DRN) coordination platform is introduced that facilitates centralized robot coordination across ad hoc networks, allowing safe navigation in dynamic, unknown environments. As robots move about their environment, they dynamically form communication networks. Within these networks, robots can share local sensing information and coordinate the actions of all robots in the network. Second, a fast single-query Probabilistic Road Map (PRM) to be called within the DRN …
Foreign Migration To The Cleveland-Akron-Lorain Metropolitan Area From 1995 To 2000, Mark Salling, Ellen Cyran
Foreign Migration To The Cleveland-Akron-Lorain Metropolitan Area From 1995 To 2000, Mark Salling, Ellen Cyran
All Maxine Goodman Levin School of Urban Affairs Publications
This report is one of a series on migration to and from the region using the five percent Public Use Microdata Sample (PUMS) of the 2000 Census of Population and Housing and provides a description of foreign migrants moving to the Cleveland-Akron-Lorain (CAL) Consolidated Metropolitan Area (CMSA) from 1995 to 2000.* The report identifies the countries of origin of migrants and compares the demographic, socioeconomic, and housing characteristics of the foreign migrants to the CAL with other groups, including foreign migrants to Ohio and the nation, and, at times, to domestic migrants to and from the CAL.
New Graph Model For Channel Assignment In Ad Hoc Wireless Networks, Maggie Xiaoyan Cheng, S. C. Huang, X. Huang, Weili Wu
New Graph Model For Channel Assignment In Ad Hoc Wireless Networks, Maggie Xiaoyan Cheng, S. C. Huang, X. Huang, Weili Wu
Computer Science Faculty Research & Creative Works
The channel assignment problem in ad hoc wireless networks is investigated. The problem is to assign channels to hosts in such a way that interference among hosts is eliminated and the total number of channels is minimised. Interference is caused by direct collisions from hosts that can hear each other or indirect collisions from hosts that cannot hear each other, but simultaneously transmit to the same destination. A new class of disk graphs (FDD: interFerence Double Disk graphs) is proposed that include both kinds of interference edges. Channel assignment in wireless networks is a vertex colouring problem in FDD graphs. …
A Framework For Management Of Semistructured Probabilistic Data, Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith
A Framework For Management Of Semistructured Probabilistic Data, Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith
Computer Science and Software Engineering
This paper describes the theoretical framework and implementation of a database management system for storing and manipulating diverse probability distributions of discrete random variables with finite domains, and associated information. A formal Semistructured Probabilistic Object (SPO) data model and a Semistructured Probabilistic Query Algebra (SP-algebra) are proposed. The SP-algebra supports standard database queries as well as some specific to probabilities, such as conditionalization and marginalization. Thus, the Semistructured Probabilistic Database may be used as a backend to any application that involves the management of large quantities of probabilistic information, such as building stochastic models. The implementation uses XML encoding of …
Openws-Transaction: Enabling Reliable Web Service Transactions, Ivan Vasquez, John A. Miller, Kunal Verma, Amit P. Sheth
Openws-Transaction: Enabling Reliable Web Service Transactions, Ivan Vasquez, John A. Miller, Kunal Verma, Amit P. Sheth
Kno.e.sis Publications
OpenWS-Transaction is an open source middleware that enables Web services to participate in a distributed transaction as prescribed by the WS-Coordination and WS-Transaction set of specifications. Central to the framework are the Coordinator and Participant entities, which can be integrated into existing services by introducing minimal changes to application code. OpenWS-Transaction allows transaction members to recover their original state in case of operational failure by leveraging techniques in logical logging and recovery at the application level. Depending on transaction style, system recovery may involve restoring key application variables and replaying uncommitted database activity. Transactions are assumed to be defined in …
Triangle Grouping And Structure Recovery For 3d Building Modelling And Visualization, Joe Hegarty, James Carswell
Triangle Grouping And Structure Recovery For 3d Building Modelling And Visualization, Joe Hegarty, James Carswell
Conference papers
Location based and spatial technologies research for the web has endless application for mobile/position content delivery (m-commerce or pcommerce). By exploiting the inherent location-based intelligence of the underling spatial component, relevant examples can include geometrically accurate and photo realistic virtual representations for: property assessments; land/marine information systems; routing information; on-line shopping; cultural heritage/tourist information/sites; etc. A major challenge for this technology is its reliance on professional developers when creating the virtual worlds used for web-based navigation of these services. This paper describes SAMATS, a Semi-Automated Modeling And Texturing System, which has the capability of producing geometrically accurate and photorealistic VR …
Investigation Of Egocentric And Exocentric Distance Perception In Virtual Environments: Application To Enhance Transfer Of Training In Multi-Model Ves, Cali Fidopiastis
Investigation Of Egocentric And Exocentric Distance Perception In Virtual Environments: Application To Enhance Transfer Of Training In Multi-Model Ves, Cali Fidopiastis
Link Foundation Modeling, Simulation and Training Fellowship Reports
In this report we summarize the results for three experiments completed during the Link Fellowship period. The aim of the first and second experiments were to test the efficacy of a novel assessment procedure for determining visual acuity and quantifying depth errors of observers wearing an optical see-t1u·ough prototype head-mounted display. If successful, the assessments could provide an optimization procedure capable of discerning limitations attributed to separate components of the VE system or to the system as a whole. The second experiment explored the feasibility of utilizing mixed reality (a mix of real and virtual items) environments for the study …
Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah
Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah
Faculty Publications
For packet video, information loss and bandwidth limitation are two factors that affect video playback quality. Traditional rate allocation approaches have focused on optimizing video quality under bandwidth constraint alone. However, in the best-effort Internet, packets carrying video data are susceptible to losses, which need to be reconstructed at the receiver side. In this paper, we propose loss aware rate allocations in both group-of-block (GOB) level and macroblock level, given that certain packets are lost during transmissions and reconstructed using simple interpolation methods at the receiver side. Experimental results show that our proposed algorithms can produce videos of higher quality …
Enterprise Systems Manager, Edward Aractingi
Enterprise Systems Manager, Edward Aractingi
IT Research
Presentation on the need of remote systems administration.
A Steerable, Untethered, 250x60 Micron Mems Mobile Micro-Robot, Bruce R. Donald, Christopher G. Levey, Craig D. Mcgray, Igor Paprotny, Daniela Rus
A Steerable, Untethered, 250x60 Micron Mems Mobile Micro-Robot, Bruce R. Donald, Christopher G. Levey, Craig D. Mcgray, Igor Paprotny, Daniela Rus
Computer Science Technical Reports
We present a steerable, electrostatic, untethered, MEMS micro-robot, with dimensions of 60 µm by 250 µm by 10 µm. This micro-robot is 1 to 2 orders of magnitude smaller in size than previous micro-robotic systems. The device consists of a curved, cantilevered steering arm, mounted on an untethered scratch drive actuator. These two components are fabricated monolithically from the same sheet of conductive polysilicon, and receive a common power and control signal through a capacitive coupling with an underlying electrical grid. All locations on the grid receive the same power and control signal, so that the devices can be operated …
How Hard Is It To Cheat In The Gale-Shapley Stable Matching Algorithm, Chien-Chung Huang
How Hard Is It To Cheat In The Gale-Shapley Stable Matching Algorithm, Chien-Chung Huang
Computer Science Technical Reports
We study strategy issues surrounding the stable marriage problem. Under the Gale-Shapley algorithm (with men proposing), a classical theorem says that it is impossible for every liar to get a better partner. We try to challenge this theorem. First, observing a loophole in the statement of the theorem, we devise a coalition strategy in which a non-empty subset of the liars gets a better partner and no man is worse off than before. This strategy is restricted in that not everyone has the incentive to cheat. We attack the classical theorem further by means of randomization. However, this theorem shows …
Crawdad: A Community Resource For Archiving Wireless Data At Dartmouth, David Kotz, Tristan Henderson
Crawdad: A Community Resource For Archiving Wireless Data At Dartmouth, David Kotz, Tristan Henderson
Dartmouth Scholarship
Wireless network researchers are seriously starved for data about how real users, applications, and devices use real networks under real network conditions. CRAWDAD (Community Resource for Archiving Wireless Data at Dartmouth) is a new National Science Foundation-funded project to build a wireless-network data archive for the research community. It will host wireless data and provide tools and documents to make collecting and using the data easy. This resource should help researchers identify and evaluate real and interesting problems in mobile and pervasive computing. To learn more about CRAWDAD and discuss its direction, about 30 interested people gathered at a workshop …
Scaling Byzantine Fault-Tolerant Replication To Wide Area Networks, Yair Amir, Claudiu Danilov, Danny Dolev, Jonathan Kirsch, John Lane, Josh Olsen, David Zage
Scaling Byzantine Fault-Tolerant Replication To Wide Area Networks, Yair Amir, Claudiu Danilov, Danny Dolev, Jonathan Kirsch, John Lane, Josh Olsen, David Zage
Department of Computer Science Technical Reports
No abstract provided.
The Sbc-Tree: An Index For Run-Length Compressed Sequences, Mohamed Y. Eltabakh, Wing-Kai Hon, Rahul Shah, Walid G. Aref, Jeffrey S. Vitter
The Sbc-Tree: An Index For Run-Length Compressed Sequences, Mohamed Y. Eltabakh, Wing-Kai Hon, Rahul Shah, Walid G. Aref, Jeffrey S. Vitter
Department of Computer Science Technical Reports
No abstract provided.
An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra
An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra
Research Collection School Of Computing and Information Systems
In this paper we investigate the expected lifetime and information capacity, defined as the maximum amount of data (bits) transferred before the first sensor node death due to energy depletion, of a data-gathering wireless sensor network. We develop a fluid-flow based computational framework that extends the existing approach, which requires precise knowledge of the layout/deployment of the network, i.e., exact sensor positions. Our method, on the other hand, views a specific network deployment as a particular instance (sample path) from an underlying distribution of sensor node layouts and sensor data rates. To compute the expected information capacity under this distribution-based …
Integration Of Probabilistic Graphic Models For Decision Support, Jiang C., Poh K., Tze-Yun Leong
Integration Of Probabilistic Graphic Models For Decision Support, Jiang C., Poh K., Tze-Yun Leong
Research Collection School Of Computing and Information Systems
It is a frequently encountered problem that new knowledge arrived when making decisions in a dynamic world. Usually, domain experts cannot afford enough time and knowledge to effectively assess and combine both qualitative and quantitative information in these models. Existing approaches can solve only one of two tasks instead of both. We propose a four-step algorithm to integrate multiple probabilistic graphic models, which can effectively update existing models with newly acquired models. In this algorithm, the qualitative part of model integration is performed first, followed by the quantitative combination. We illustrate our method with an example of combining three models. …
Tailored Watermarking Schemes For Authentication Of Electronic Clinical Atlases, Feng Bao, Robert H. Deng, Beng-Chin Ooi, Yanjiang Yang
Tailored Watermarking Schemes For Authentication Of Electronic Clinical Atlases, Feng Bao, Robert H. Deng, Beng-Chin Ooi, Yanjiang Yang
Research Collection School Of Computing and Information Systems
It is accepted that digital watermarking is quite relevant in medical imaging. However, due to the special nature of clinical practice, it is often required that watermarking not introduce irreversible distortions to medical images. The electronic clinical atlas has such a need of "lossless" watermarking. We present two tailored reversible watermarking schemes for the clinical atlas by exploiting its inherent characteristics. We have implemented the schemes and our experimental results look very promising.
A Scalable Correlation Aware Aggregation Strategy For Wireless Sensor Networks, Yujie Zhu, Ramanuja Vedantham, Seung Jong Park, Raghupathy Sivakumar
A Scalable Correlation Aware Aggregation Strategy For Wireless Sensor Networks, Yujie Zhu, Ramanuja Vedantham, Seung Jong Park, Raghupathy Sivakumar
Computer Science Faculty Research & Creative Works
Sensors-to-sink data in wireless sensor networks (WSNs) are typically correlated with each other. Exploiting such correlation when performing data aggregation can result in considerable improvements in the bandwidth and energy performance of WSNs. In order to exploit such correlation, we present a scalable and distributed correlation-aware aggregation structure that addresses the practical challenges in the context of aggregation in WSNs. Through simulations and analysis, we evaluate the performance of the proposed approach with centralized and distributed correlation aware and unaware structures.
Demonstrating Dynamic Configuration And Execution Of Web Processes, Karthik Gomadam, Kunal Verma, Amit P. Sheth, John A. Miller
Demonstrating Dynamic Configuration And Execution Of Web Processes, Karthik Gomadam, Kunal Verma, Amit P. Sheth, John A. Miller
Kno.e.sis Publications
Web processes are next generation workflows on the web, created using Web services. In this paper we demonstrate the METEOR-S Configuration and Execution Environment (MCEE) system. It will illustrate the capabilities of the system to a) Discover partners b) Optimize partner selection using constraint analysis, c) Perform interaction protocol and data mediation. A graphical execution monitor to monitor the various phases of execution will be used to demonstrate various aspects of the system.
Discovering Informative Connection Subgraphs In Multi-Relational Graphs, Cartic Ramakrishnan, William Milnor, Matthew Perry, Amit P. Sheth
Discovering Informative Connection Subgraphs In Multi-Relational Graphs, Cartic Ramakrishnan, William Milnor, Matthew Perry, Amit P. Sheth
Kno.e.sis Publications
Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper we introduce heuristics that guide a subgraph discovery algorithm away from banal paths towards more "informative" ones. Given an RDF graph a user might pose a question of the form: "What are the most relevant ways in which entity X is related to entity Y?" the response to which is a subgraph connecting X to Y. We use our heuristics to …
Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman
Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman
All Computer Science and Engineering Research
We present a novel architecture and execution model for an infrastructure supporting fault-tolerant, long-running distributed applications spanning multiple administrative domains. Components for both transaction processing and persistent state are replicated across multiple servers, en-suring that applications continue to function correctly de-spite arbitrary (Byzantine) failure of a bounded number of servers. We give a formal model of application execution, based on atomic execution steps, linearizability and a sep-aration between data objects and transactions that act on them. The architecture is designed for robust interoperability across domains, in an open and shared Internet computing infrastructure. A notable feature supporting cross-domain applications is …
Studying The Performance Of A Firewall In Network Courses, José M. Garrido
Studying The Performance Of A Firewall In Network Courses, José M. Garrido
Faculty and Research Publications
This paper presents a simple simulation model of a firewall to derive several performance metrics and briefly argues on the importance and value of modeling and simulation in courses that study various aspects of perimeter defense in network security.
The simulation model mentioned previously is part of an effort by faculty of our department to develop a multi-disciplinary repository of computational models that includes object-oriented discrete-event simulation models. One of the goals of this repository is to build resources that help educate students of computer science, software engineering, and information technology, in modeling and information security.
This and other network …
Using An Easy-To-Use And Free Tool In Teaching And Researching Networks And Security Issues, Victor A. Clincy
Using An Easy-To-Use And Free Tool In Teaching And Researching Networks And Security Issues, Victor A. Clincy
Faculty and Research Publications
ITGuru is a powerful simulation environment developed by OpNET Corporation. ITGuru is unique because of its ability to model the entire networking domain, including its routers, switches, protocols, servers, and the individual applications they support. ITGuru improves network researchers' and instructors' ability to identify and solve problems throughout the network. The OpNET Corporation provides a FREE academic copy of their simulation environment to universities for both teaching and research.
J2me Programming, Chong-Wei Xu
J2me Programming, Chong-Wei Xu
Faculty and Research Publications
Handheld devices, such as programmable cell phones and personal digital assistants (PDAs), have already become more numerous than PCs. Students need to be prepared today to work on the most widely available computing platforms of tomorrow. With their small size and mobility, these handheld devices present both new opportunities and unique software engineering challenges. J2ME stands for Java 2 Micro Edition that is one of the three Java Editions (J2SE, J2EE, and J2ME) specially designed for handheld devices. J2ME plus handheld devices are the platforms for wireless Internet and mobile business in the future.
Distributed Computing And Computer Security Education, Stefan Robila
Distributed Computing And Computer Security Education, Stefan Robila
Department of Computer Science Faculty Scholarship and Creative Works
This paper presents our experience in using cluster computing when teaching Computer and Data Security. The background knowledge together with the topics that fit the best applications of distributed computing and the hardware and software needs are discussed. Several project activities are presented with some analyzed in detail. The first requires the students to develop a computer cluster out of a regular public lab and use it for building security attacks such as password and encryption key cracking. The second deals with prime number generation using a client /server architecture (implemented in Java) and an Oracle database complemented by the …
New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao
New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
A new class of Binary Maximum Distance Separable (MDS) array codes which are based on circular permutation matrices are introduced in this paper. These array codes are used for tolerating multiple (greater than or equal to 4) disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. The size of the information part is m \times n, where n is the number of information disks and (m+1) is a prime integer; the size of the parity-check part is m \times r, the minimum distance is r+1, and the number of parity-check disks is r. In practical applications, m can be …
Giving Users The Steering Wheel For Guiding Resource-Adaptive Systems, Joao Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan
Giving Users The Steering Wheel For Guiding Resource-Adaptive Systems, Joao Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan
Research Collection School Of Computing and Information Systems
Addressing resource variation plays an increasingly important role in engineering today's software systems. Research in resource-adaptive applications takes an important step towards addressing this problem. However, existing solutions stop short of addressing the fact that different user tasks often have specific goals of quality of service, and that such goals often entail multiple aspects of quality of service. This paper presents a framework for engineering software systems capable of adapting to resource variations in ways that are specific to the quality goals of each user task. For that, users are empowered to specify their task-specific preferences with respect to multiple …
Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng
Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
The contribution of this paper has two folds. In the first fold, we propose a generic construction of sequential aggregate signatures from families of certificated trapdoor one-way permutations. We show that our construction is provably secure in the random oracle model assuming that the underlying homomorphic permutations are trapdoor one-way. Compared to Lysyanskaya et al’s generic construction that is constructed from a trapdoor one-way permutation family working over the same domain [16], our scheme works over independent trapdoor one-way permutation domains. The flexible choice of the underlying permutation domains benefits our scheme to its applications in the real world where …
A Framework To Learn Bayesian Network From Changing, Multiple-Source Biomedical Data, Li G., Tze-Yun Leong
A Framework To Learn Bayesian Network From Changing, Multiple-Source Biomedical Data, Li G., Tze-Yun Leong
Research Collection School Of Computing and Information Systems
Structure learning in Bayesian network is a big issue. Many efforts have tried to solve this problem and quite a few algorithms have been proposed. However, when we attempt to apply the existing methods to microarray data, there are three main challenges: 1) there are many variables in the data set, 2) the sample size is small, and 3) microarray data are changing from experiment to experiment and new data are available quickly. To address these three problems, we assume that the major functions of a kind of cells do not change too much in different experiments, and propose a …
The Stochastic Dance Of Early Hiv Infection, Stephen J. Merrill
The Stochastic Dance Of Early Hiv Infection, Stephen J. Merrill
Mathematics, Statistics and Computer Science Faculty Research and Publications
The stochastic nature of early HIV infection is described in a series of models, each of which captures aspects of the dance of HIV during the early stages of infection. It is to this highly variable target that the immune response must respond. The adaptability of the various components of the immune response is an important aspect of the system's operation, as the nature of the pathogens that the response will be required to respond to and the order in which those responses must be made cannot be known beforehand. As HIV infection has direct influence over cells responsible for …