Nicotine patch and paroxetine for smoking cessation.

Smokers (N?=?224) were randomized to 1 of 3 groups: (a) transdermal system (TNS) + placebo; (b) TNS + paroxetine (20 mg); (c) TNS + paroxetine (40 mg). Assignment to treatment was double-blind. Nicotine patch (TNS) treatment was provided for 8 weeks; paroxetine or placebo was provided for 9 weeks. Abstinence rates at Weeks 4, 10, and 26 were as follows: (a) TNS + placebo: 45%, 36%, and 25%; (b) TNS + paroxetine (20 mg): 48%, 33%, and 21 %; (c) TNS + paroxetine (40 mg): 57%, 39%, and 27%. The differences were not statistically significant. The combined treatment was more effective in reducing both craving and depression symptoms associated with smoking cessation. A subgroup analysis comparing compliant participants was also conducted. Abstinence rates at Weeks 4, 10, and 26 were as follows: (a) TNS + placebo: 46%, 35%, and 24%; (b) TNS + paroxetine (20 mg): 64%, 43%, and 33%; (c) TNS + paroxetine (40 mg): 74%, 51%, and 38%. The differences between paroxetine groups and placebo at Week 4 were statistically significant. Although paroxetine may add value to the current standard of care in excess of potential risk, more conclusive evidence is needed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Automatic Task-Based Code Generation for High Performance Domain Specific Embedded Language

Providing high level tools for parallel programming while sustaining a high level of performance has been a challenge that techniques like Domain Specific Embedded Languages try to solve. In previous works, we investigated the design of such a DSEL—NT\(^2\)—providing a Matlab -like syntax for parallel numerical computations inside a C++ library. In this paper, we show how NT\(^2\!\) has been redesigned for shared memory systems in an extensible and portable way. The new NT\(^2\!\) design relies on a tiered Parallel Skeleton system built using asynchronous task management and automatic compile-time taskification of user level code. We describe how this system can operate various shared memory runtimes and evaluate the design by using two benchmarks implementing linear algebra algorithms.     

Optimal filtering for polynomial system states with polynomial multiplicative noise

In this paper, the optimal filtering problem for polynomial system states with polynomial multiplicative noise over linear observations is treated proceeding from the general expression for the stochastic Ito differential of the optimal estimate and the error variance. As a result, the Ito differentials for the optimal estimate and error variance corresponding to the stated filtering problem are first derived. The procedure for obtaining a closed system of the filtering equations for any polynomial state with polynomial multiplicative noise over linear observations is then established, which yields the explicit closed form of the filtering equations in the particular cases of a linear state equation with linear multiplicative noise and a bilinear state equation with bilinear multiplicative noise. In the example, performance of the designed optimal filter is verified for a quadratic state with a quadratic multiplicative noise over linear observations against the optimal filter for a quadratic state with a state‐independent noise and a conventional extended Kalman–Bucy filter. Copyright © 2006 John Wiley & Sons, Ltd.     

Macsyma: A personal history

The Macsyma system arose out of research on mathematical software in the AI group at MIT in the 1960s. Algorithm development in symbolic integration and simplification arose out of the interest of people, such as the author, who were also mathematics students. The later development of algorithms for the GCD of sparse polynomials, for example, arose out of the needs of our user community. During various times in the 1970s the computer on which Macsyma ran was one of the most popular nodes on the ARPANET. We discuss the attempts in the late 70s and the 80s to develop Macsyma systems that ran on popular computer architectures. Finally, we discuss the impact of the fundamental ideas in Macsyma on the author’s current research on large scale engineering and socio-technical systems.     

A theory of mode of action of azolylalkylquinolines as DNA binding agents using automated flexible ligand docking

Azolylalkylquinolines (AAQs) are a family of quinolines with varying degrees of cytotoxic activity (comparable or moderately superior to adriamycin in some cases) developed in the past decade in our group where their exact mode of action is still unclear. In this study the most probable DNA binding mode of AAQs was investigated employing a novel flexible ligand docking approach by using AutoDock 3.0. Forty-nine AAQs with known experimental inhibitory activity were docked onto d(CGCAAATTTGCG)(2), d(CGATCG)(2) and d(CGCG)(2) oligonucleotides retrieved from the Protein Data Bank (PDB IDs: 102D, 1D12 and 1D32, respectively) as the representatives of the three plausible models of interactions between chemotherapeutic agents and DNA (groove binding, groove binding plus intercalation and bisintercalation, respectively). Good correlation (r(2)=0.64) between calculated binding energies and experimental inhibitory activities was obtained using groove binding plus intercalation model for phenyl-azolylalkylquinoline (PAAQ) series. Our findings show that the most probable mode of action of PAAQs as DNA binding agents is via intercalation of quinolinic moiety between CG base pairs with linker chain and azole moiety binding to the minor groove.     

Design of simulator training: a comparative study of Swedish dynamic decision-making training facilities

Cognition, Technology & Work - Simulator training is becoming increasingly important for training of time-critical and dynamic situations. Hence, how simulator training in such domains is...     

Distributed Job Scheduling in Rings

We give a distributed approximation algorithm for job scheduling in a ring architecture. In contrast to many other parallel scheduling models, the model we consider captures the influence of the underlying communications network by specifying that task migration from one processor to another takes time proportional to the distance between those two processors in the network. As a result, our algorithm must balance computational load and communication time. The algorithm is simple, requires no global control, and yields schedules of length at most 4.22 times optimal. We also give a lower bound on the performance of any distributed algorithm and the results of simulation experiments which suggest better performance than does our worst-case analysis.     

Age differences in item manipulation span: The case of letter-number sequencing.

The authors report 2 experiments in which they examined age differences in working memory tasks involving complex item manipulation (i.e., letter-number sequencing). In Experiment 1, age differences on tasks involving item manipulation were not greater than age differences on tasks requiring recall of items in the order in which they appeared, suggesting that older adults do not have difficulty with item manipulation per se. In Experiment 2, slower presentation rates increased age differences in item manipulation spans, although age differences at the fastest rate may be attributed to differences in strategy use. In both experiments, age differences were largest when participants were most likely to be remembering familiar sequences, suggesting that older adults may have difficulties dampening the representations of such sequences once they are activated. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Performance of hashed cache data migration schemes on multicomputers

Many researchers approach the problem of programming distributed memory machines by assuming a global shared name space. Thus the user views the distributed memory of the machine as though it were shared. A major issue that arises at this point is how to manage the memory. When a processor accesses data stored on another processor's memory, data must be moved between the two processors. Once these data are retrieved from another processor's memory, several interesting issues are raised. Where should these data be stored locally? What transformations must be performed to the code to guarantee that the nonlocal accesses reference the correct memory location? What optimizations can be performed to reduce the time spent in accessing the nonlocal data? In this paper we examine various data migration mechanisms that allow an explicit and controlled mapping of data to memory. We describe, experimentally evaluate, and model a set of schemes for storing and retrieving off-processor array elements. The schemes are all based on using hash tables for efficient access of nonlocal data. The three different techniques evaluated are the basic hashed cache, partial enumeration, and full enumeration, the details of which are described in the paper. In all three schemes, nonlocal data are stored in hash tables—the difference is in the amount of memory used by the schemes and the retrieval mechanisms for nonlocal data.