Behavior modificationBehavior modification is an early approach that used respondent and operant conditioning to change behavior. Based on methodological behaviorism, overt behavior was modified with consequences, including positive and negative reinforcement contingencies to increase desirable behavior, or administering positive and negative punishment and/or extinction to reduce problematic behavior. It also used Flooding desensitization to combat phobias.
Association for Behavioral and Cognitive TherapiesThe Association for Behavioral and Cognitive Therapies (ABCT) was founded in 1966. Its headquarters are in New York City and its membership includes researchers, psychologists, psychiatrists, physicians, social workers, marriage and family therapists, nurses, and other mental-health practitioners and students. These members support, use, and/or disseminate behavioral and cognitive approaches. Notable past presidents of the association include Joseph Wolpe, Steven C. Hayes, Michelle Craske, Jonathan Abramowitz, Marsha M.
Trip distributionTrip distribution (or destination choice or zonal interchange analysis) is the second component (after trip generation, but before mode choice and route assignment) in the traditional four-step transportation forecasting model. This step matches tripmakers’ origins and destinations to develop a “trip table”, a matrix that displays the number of trips going from each origin to each destination. Historically, this component has been the least developed component of the transportation planning model.
Computational hardness assumptionIn computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where efficiently typically means "in polynomial time"). It is not known how to prove (unconditional) hardness for essentially any useful problem. Instead, computer scientists rely on reductions to formally relate the hardness of a new or complicated problem to a computational hardness assumption about a problem that is better-understood.
Path (graph theory)In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts.
Bohr modelIn atomic physics, the Bohr model or Rutherford–Bohr model of the atom, presented by Niels Bohr and Ernest Rutherford in 1913, consists of a small, dense nucleus surrounded by orbiting electrons. It is analogous to the structure of the Solar System, but with attraction provided by electrostatic force rather than gravity, and with the electron energies quantized (assuming only discrete values).
Rutherford modelThe Rutherford model was devised by the New Zealand-born physicist Ernest Rutherford to describe an atom. Rutherford directed the Geiger–Marsden experiment in 1909, which suggested, upon Rutherford's 1911 analysis, that J. J. Thomson's plum pudding model of the atom was incorrect. Rutherford's new model for the atom, based on the experimental results, contained new features of a relatively high central charge concentrated into a very small volume in comparison to the rest of the atom and with this central volume containing most of the atom's mass.
