Age, executive functions, and visuospatial functioning in healthy older adults.

Visuospatial test performance declines with age, whereas verbal test performance remains fairly constant. This pattern has been attributed to an age-related decline in either right-hemisphere functioning or executive functions (EFs), which may be associated with prefrontal cortical decline. Timed and untimed EF tests, and visuospatial tests requiring substantial integrative skill (I-VS) or little or no integrative skill (non-I-VS) were administered to young-old (aged 74 yrs and younger) and old-old (aged 75 yrs and older) healthy volunteers. Groups differed on I-VS tests and on many EF tests but not on non-I-VS tests. I-VS tests correlated highly with tests of EFs, but non-I-VS tests did not. These results are interpreted as supporting the proposal that an age-related decline in EF underlies the decline in visuospatial test performance observed with advancing age. Other issues regarding the relationship between age and EF are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Generalized juntas and NP-hard sets

We show that many NP-hard sets have heuristic polynomial-time algorithms with high probability weight of correctness with respect to generalizations of Procaccia and Rosenschein’s junta distributions.     

Food vacuole proteome of the malarial parasite Plasmodium falciparum

The Plasmodium falciparum food vacuole (FV) is a lysosome-like organelle where erythrocyte hemoglobin digestion occurs. It is a favorite target in the development of antimalarials. We have used a tandem mass spectrometry approach to investigate the proteome of an FV-enriched fraction and identified 116 proteins. The electron microscopy analysis and the Western blot data showed that the major component of the fraction was the FV and, as expected, the majority of previously known FV markers were recovered. Of particular interest, several proteins involved in vesicle-mediated trafficking were identified, which are likely to play a key role in FV biogenesis and/or FV protein trafficking. Recovery of parasite surface proteins lends support to the cytostomal pathway of hemoglobin ingestion as a FV trafficking route. We have identified 32 proteins described as hypothetical in the databases. This insight into FV protein content provides new clues towards understanding the biological function of this organelle in P. falciparum.     

Generalized modal satisfiability

It is well known that modal satisfiability is PSPACE-complete (Ladner (1977) [21]). However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators, since a propositional operator is simply a Boolean function. We completely classify the complexity of modal satisfiability for every finite set of propositional operators, i.e., in contrast to previous work, we classify an infinite number of problems. We show that, depending on the set of propositional operators, modal satisfiability is PSPACE-complete, coNP-complete, or in P. We obtain this trichotomy not only for modal formulas, but also for their more succinct representation using modal circuits. We consider both the uni-modal and the multi-modal cases, and study the dual problem of validity as well.     

Discovering a junction tree behind a Markov network by a greedy algorithm

In our paper (Annals of Operations Research, 193:71–90, 2012) we introduced a special kind of k?1-width junction tree, called k-th order cherry tree in order to approximate a joint probability distribution. The approximation is the best if the Kullback–Leibler divergence between the true joint probability distribution and the approximating one is minimal. Finding the best approximating k?1-width junction tree probability distribution is NP-complete if 2<k<d?1, where d is the dimension of the joint probability distribution (see Karger and Srebro in 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, Malvestuto in Kybernetika 48:825–844, 2012). In Broad Research in Artificial Intelligence and Neuroscience (BRAIN), special issue on complexity in sciences and artificial intelligence, pp. 40–45, 2010 we also proved that the best approximating k?1-width junction tree probability distribution can be embedded into a k-th order cherry tree probability distribution. We introduce here a greedy algorithm resulting very good approximations in reasonable computing time. We prove then that if the Markov network which encodes the conditional independences of the multivariate probability distribution fulfills some requirements then our greedy algorithm is able to find the true probability distribution. Our algorithm uses just the k-th order marginal probability distributions as input. We compare the results of the greedy algorithm proposed in this paper with the greedy algorithm proposed by Malvestuto (IEEE Trans. Syst. Man Cybern. 21:1287–1294, 1991).