Mechanisms for editing false events out of memory reports have fundamental implications for theories of false memory and for best practice in applied domains in which false reports must be minimized (e.g., forensic psychological interviews, sworn testimony). A mechanism posited in fuzzy-trace theory, recollection rejection, is considered. A process analysis of false-memory editing is presented,...

A study was performed to determine the relative advantage of computer-controlled couch movement versus manual repositioning to correct patient setup error measured using an electronic portal imaging device (EPID). Twenty-eight on-line setup adjustment trials of anterior-posterior (AP) pelvic projections were evaluated, with 13 setups corrected by automated couch movement determined by direct fe...

An accurate means of determining and correcting for daily patient setup errors is important to the cancer outcome in radiotherapy. While many tools have been developed to detect setup errors, difficulty may arise in accurately adjusting the patient to account for the rotational error components. A novel, automated method to correct for rotational patient setup errors in helical tomotherapy is p...

objective: microleakage in the gingival floor of class ii composite restorations can compromise the marginal adaptation of the filling material to the cavity edges. the aim of this study was to evaluate the effect of light conducting cylindrical inserts in decreasing the microleakage of the gingival floor in cavities 1mm below the cej. materials and methods: eighty maxillary first molars were r...

Everyone needs to kick back and relax now and then, but too much bonding time with the couch and TV remote control can lead to serious health problems. This is of concern, because according to the Centers for Disease Control and Prevention (CDC) [2], less than 50 percent of adults in the United States don't meet the recommended physical activity guidelines [3]. And, even though busting a move o...

insert ← 1 some preprocessing to use algorithm for (i ← 1; i ≤ n; i ← i + 1) rearrange columns to put matrix in usable form for (j ← 1; j ≤ m; j ← j + 1) sorts columns by source node if (N [i, j] = 1) N ← swapcol(N, j, insert) insert ← insert + 1 top ← 1 now sorts by destination node for arcs with same source insert ← 1 while (top ≤ n) for (i ← 1; i ≤ n; i ← i + 1) for (j ← 1; j ≤ m; j ← j + 1)...