Browsing College of Arts and Sciences by Title

OpenBU

Browsing College of Arts and Sciences by Title

Sort by: Order: Results:

  • Grossberg, Stephen (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1999-10)
    An outstanding problem in psychiatry concerns how to link discoveries about the pharmacological, neurophysiological, and neuroanatomical substrates of mental disorders to the abnormal behaviors that they control. A related ...
  • Wells, J.B. (Boston University Computer Science Department, 1995-12-10)
    Mitchell defined and axiomatized a subtyping relationship (also known as containment, coercibility, or subsumption) over the types of System F (with "→" and "∀"). This subtyping relationship is quite simple and does not ...
  • Harfoush, Khaled; Bestavros, Azer; Byers, John (Boston University Computer Science Department, 2000-07-03)
    Current Internet transport protocols make end-to-end measurements and maintain per-connection state to regulate the use of shared network resources. When a number of such connections share a common endpoint, that endpoint ...
  • Yilmaz, Selma; Matta, Ibrahim (Boston University Computer Science Department, 2002)
    The objective of unicast routing is to find a path from a source to a destination. Conventional routing has been used mainly to provide connectivity. It lacks the ability to provide any kind of service guarantees and smart ...
  • Gaudiano, Paolo (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1992-07)
    A computational model of visual processing in the vertebrate retina provides a unified explanation of a range of data previously treated by disparate models. Three results are reported here: the model proposes a functional ...
  • Carpenter, Gail A.; Ravindran, Arun (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 2008-06)
    Sensors working at different times, locations, and scales, and experts with different goals, languages, and situations, may produce apparently inconsistent image labels that are reconciled by their implicit underlying ...
  • Weller, Robert (University of Washington Press, 2013-01-24)
  • Bera, Debajyoti; Fenner, Stephen; Green, Frederic; Homer, Steve (Boston University Computer Science Department, 2008-02-15)
    We define and construct efficient depth universal and almost size universal quantum circuits. Such circuits can be viewed as general purpose simulators for central classes of quantum circuits and can be used to capture the ...
  • Gaudiano, Paolo; Zalama, Eduardo; Coronado, Juan Lopez (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1994-06)
    We have recently introduced a neural network mobile robot controller (NETMORC). The controller is based on earlier neural network models of biological sensory-motor control. We have shown that NETMORC is able to guide a ...
  • Zalama, Eduardo; Guadiano, Paolo; López-Coronado, Juan (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1993-10)
    This article introduces an unsupervised neural architecture for the control of a mobile robot. The system allows incremental learning of the plant during robot operation, with robust performance despite unexpected changes ...
  • Sullivan, James C.; Reitzel, Adam M.; Finnerty, John R. (Nucleic Acids Research, 2008-1)
    The starlet sea anemone, Nematostella vectensis, is a basal metazoan organism that has recently emerged as an important model system in developmental biology and evolutionary genomics. StellaBase, the Nematostella Genomics ...
  • Lapets, Andrei; Kfoury, Assaf (CS Department, Boston University, 2010-05-14)
    User-friendly interfaces can play an important role in bringing the benefits of a machine-readable representation of formal arguments to a wider audience. The "aartifact" system is an easy-to-use lightweight verifier for ...
  • Lapets, Andrei (CS Department, Boston University, 2010-05-14)
    Machine verification of formal arguments can only increase our confidence in the correctness of those arguments, but the costs of employing machine verification still outweigh the benefits for some common kinds of formal ...
  • West, Richard; Gloudon, Jason (Boston University Computer Science Department, 2003-06-01)
    Extensible systems allow services to be configured and deployed for the specific needs of individual applications. This paper describes a safe and efficient method for user-level extensibility that requires only minimal ...
  • Reynolds, Mark (CS Department, Boston University, 2010-07-23)
    The goal of this work was to apply lightweight formal methods to the study of the security of the JavaScript language. Previous work has shown that lightweight formal methods present a new approach to the study of security ...
  • Zatko, Sarah Lieberman; Van Alstyne, Marshall (Boston University Computer Science Department, 2009-05-11)
    We propose an economic mechanism to reduce the incidence of malware that delivers spam. Earlier research proposed attention markets as a solution for unwanted messages, and showed they could provide more net benefit than ...
  • Bestavros, Azer (Boston University Computer Science Department, 1995-02-21)
    Speculative service implies that a client's request for a document is serviced by sending, in addition to the document requested, a number of other documents (or pointers thereto) that the server speculates will be requested ...
  • Heddaya, Abdelsalam; Park, Kihong; Sinha, Himanshu (Boston University Computer Science Department, 1993-06-04)
    Parallel computing on a network of workstations can saturate the communication network, leading to excessive message delays and consequently poor application performance. We examine empirically the consequences of integrating ...
  • Byers, John; Nasser, Gabriel (Boston University Computer Science Department, 2000-10-17)
    We consider challenges associated with application domains in which a large number of distributed, networked sensors must perform a sensing task repeatedly over time. For the tasks we consider, there are three significant ...
  • Bradley, Adam D.; Bestavros, Azer; Kfoury, Assaf J. (Boston University Computer Science Department, 2002-09-08)
    Formal tools like finite-state model checkers have proven useful in verifying the correctness of systems of bounded size and for hardening single system components against arbitrary inputs. However, conventional applications ...

Search OpenBU


Advanced Search

Browse

Deposit Materials