Recent research with college-aged skilled readers by Adelman and colleagues revealed that contextual diversity (i.e., the number of contexts in which a word appears) is a more critical determinant of visual word recognition than mere repeated exposure (i.e., word frequency) (Psychological Science, 2006, Vol. 17, pp. 814-823). Given that contextual diversity has been claimed to be a relevant fac...

Early Identification of Children with High Risk of Reading Failure Seymour Feshbach Howard Adelman University of California, Los Angeles University of California, Riverside Two alternative models for identifying kindergarten age children with a high risk of becoming reading failures are compared. One model places primary emphasis on psychometric test procedures assessing linguistic and perceptu...

There are many large-size and difficult computational problems in mathematics and computer science. For many of these problems, traditional computers cannot handle the mass of data in acceptable timeframes, which we call an NP problem. DNA computing is a means of solving a class of intractable computational problems in which the computing time grows exponentially with problem size. This paper p...

We present an overview of a model for the co-evolution of knowledge and event memory. The model, termed SARKAE (Storing and Retrieving Knowledge and Events), describes the development of knowledge and event memories as an interactive process: knowledge is formed through the accrual of individual events, and the storage of an individual episode is dependent on prior knowledge. We reference two e...

The use of new and selective inhibitors of matrix metalloproteinases (MMPs) may have significant therapeutic potential in stroke patients, report US researchers. The role of MMPs, and MMP-9 in particular, has been suggested in the pathogenesis of neurological disorders, but efforts to inhibit MMP activity have been largely unsuccessful in human clinical trials, says study author Stuart A Lipton...

A fundamental problem in computational biology is the construction of physical maps of chromosomes from the hybridization experiments between unique probes and clones of chromosome fragments. Double and partial digest problems are two intractable problems used to construct physical maps of DNA molecules in bioinformatics. Several approaches, including exponential algorithms and heuristic algori...

This paper considers the pricing and hedging of collateralized debt obligations (CDOs). CDOs are complex derivatives on a pool of credits which we choose to analyse in the top down model proposed in Filipović et al. [4]. We reflect on the implied forward rates and bring them in connection with the top-down framework in Lipton and Shelton [8] and Schönbucher [11]. Moreover, we derive variance-mi...

In [Adl94] Adleman used biological manipulations with DNA strings to solve some instances of the Directed Hamiltonian Path Problem. Lipton [Lip94] showed how to extend this idea to solve any NP problem. We prove that exactly the problems in PNP = p2 can be solved in polynomial time using Lipton’s model. Various modifications of Lipton’s model, based on other DNA manipulations, are investigated ...

The expansion of technology and the Internet in 21st century, along with increase access power introduction digital social media sectors, has led to a shift understanding advertising. Parallel these advancements, it been explored how quickly people are adopting smart mobile devices that have evolved advancement computer technology, advertisements advertisement designs can be created using devic...