Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
See detailLes Italiens de Belgique : une communauté sans leaders ?
Martiniello, Marco ULg

in Les Italiens de Belgique, Actes de la 4ème semaine d’information sur l’évolution de la société italienne. Italia Oggi (1994)

Detailed reference viewed: 28 (4 ULg)
See detailItaly : Racism in Paradise ?
Martiniello, Marco ULg

in Monk, R.-C. (Ed.) Taking Sides : Clashing Views on Controversial Issues in Race and Ethnicity (1994)

Detailed reference viewed: 12 (0 ULg)
See detailItaly : the Late Discovery of Immigration
Martiniello, Marco ULg

in Tränhardt, D. (Ed.) Europe : a New Immigration Continent (1992)

Detailed reference viewed: 11 (0 ULg)
Peer Reviewed
See detailItaly : two Perspectives. Racism in Paradise ?
Martiniello, Marco ULg; Kazim, P.

in Race & Class (1991), 32(3), 79-89

Detailed reference viewed: 21 (1 ULg)
Full Text
Peer Reviewed
See detailItem familiarity and controlled associative retrieval in Alzheimer's disease: An fMRI study
Genon, Sarah ULg; Collette, Fabienne ULg; Feyers, Dorothée ULg et al

in Cortex : A Journal Devoted to the Study of the Nervous System & Behavior (2013), 49

Detailed reference viewed: 76 (12 ULg)
Full Text
Peer Reviewed
See detailItem familiarity and controlled associative retrieval in Alzheimer’s disease: an fMRI study.
Genon, Sarah ULg; Collette, Fabienne ULg; Feyers, Dorothée ULg et al

in Proceedings of the Amsterdam Memory Slam 2012 (2012, August 30)

Alzheimer’s disease (AD) is characterised by altered recollection function, with impaired controlled retrieval of associations. In contrast, familiarity-based memory for individual items may sometimes be ... [more ▼]

Alzheimer’s disease (AD) is characterised by altered recollection function, with impaired controlled retrieval of associations. In contrast, familiarity-based memory for individual items may sometimes be preserved in early stages of the disease. This is the first study that directly examines whole brain regional activity engaged during one core aspect of the recollection function: associative controlled episodic retrieval (CER), contrasted to item familiarity in AD patients. Cerebral activity related to associative CER and item familiarity in AD patients and healthy controls (HC) was measured with functional magnetic resonance imaging during a word-pair recognition task to which the process dissociation procedure was applied. Some patients had null CER estimates (AD-), whereas others did show some CER abilities (AD+) although significantly less than HC. In contrast, familiarity estimates were equivalent in the three groups. In AD+ like in controls, associative CER activated the inferior precuneus/posterior cingulate cortex (PCC). However, during associative CER, functional connection between this region and the hippocampus, the inferior parietal and the dorsolateral prefrontal cortex was significantly higher in HC than in AD+. In the three groups, item familiarity was related to activation along the intraparietal sulcus (IPS). In conclusion, whereas the preserved automatic detection of an old item (without retrieval of accurate word association) is related to a parietal activation centred on the IPS, the inferior precuneus/PCC supports associative CER ability in AD patients as in HC. However, AD patients have deficient functional connectivity during associative CER suggesting that residual recollection function in these patients might be impoverished by lack of some recollection-related aspects such as autonoetic quality, episodic details and verification. [less ▲]

Detailed reference viewed: 37 (5 ULg)
Full Text
Peer Reviewed
See detailItem familiarity and controlled associative retrieval in Alzheimer’s disease: An fMRI study.
Genon, Sarah ULg; Collette, Fabienne ULg; Feyers, Dorothée ULg et al

in Frontiers in Human Neuroscience (2012)

Alzheimer’s disease (AD) is characterised by altered recollection function, with impaired controlled retrieval of associations. In contrast, familiarity-based memory for individual items may sometimes be ... [more ▼]

Alzheimer’s disease (AD) is characterised by altered recollection function, with impaired controlled retrieval of associations. In contrast, familiarity-based memory for individual items may sometimes be preserved in the early stages of the disease. This is the first study that directly examines whole brain regional activity during one core aspect of the recollection function: associative controlled episodic retrieval (CER), contrasted to item familiarity in AD patients. Cerebral activity related to associative CER and item familiarity in AD patients and healthy controls (HC) was measured with functional magnetic resonance imaging during a word-pair recognition task to which the process dissociation procedure was applied. Some patients had null CER estimates (AD–), whereas others did show some CER abilities (AD+), although significantly less than HC. In contrast, familiarity estimates were equivalent in the three groups. In AD+, as in controls, associative CER activated the inferior precuneus/posterior cingulate cortex (PCC). However, during associative CER, functional connection between this region and the hippocampus, the inferior parietal and dorsolateral prefrontal cortex (DLPFC) was significantly higher in HC than in AD+. In all three groups, item familiarity was related to activation along the intraparietal sulcus (IPS). In conclusion, whereas the preserved automatic detection of an old item (without retrieval of accurate word association) is related to parietal activation centred on the IPS, the inferior precuneus/PCC supports associative CER ability in AD patients, as in HC. However, AD patients have deficient functional connectivity during associative CER, suggesting that the residual recollection function in these patients might be impoverished by the lack of some recollection-related aspects such as autonoetic quality, episodic details and verification. [less ▲]

Detailed reference viewed: 32 (2 ULg)
Full Text
See detailAn item ixture model to detect differential item functioning
Frederickx, Sofie; Tuerlinckx, Francis; De Boeck, Paul et al

Conference (2009, July)

Detailed reference viewed: 11 (0 ULg)
Full Text
Peer Reviewed
See detailItem purification does not always improve DIF detection: a counter-example with Angoff’s Delta plot
Magis, David ULg; Facon, Bruno

in Educational & Psychological Measurement (2013), 73

Item purification is an iterative process that is often advocated as improving the identification of items affected by differential item functioning (DIF). With test-score based DIF detection methods ... [more ▼]

Item purification is an iterative process that is often advocated as improving the identification of items affected by differential item functioning (DIF). With test-score based DIF detection methods, item purification iteratively removes the items currently flagged as DIF from the test scores in order to get purified sets of items, unaffected by DIF. The purpose of this paper is to highlight that item purification is not always useful and that a single run of the DIF method may return equally suitable results. Angoff’s Delta plot is considered as a counter-example DIF method, with a recent improvement to the derivation of the classification threshold. Several possible item purification processes may be defined with this method, and all of them are compared through a simulation study and a real data set analysis. It appears that none of these purification processes clearly improves the Delta plot performance. A tentative explanation is drawn from the conceptual difference between the modified Delta plot and the other traditional DIF methods. [less ▲]

Detailed reference viewed: 15 (2 ULg)
Full Text
See detailItem response models
Raîche, Gilles; Magis, David ULg

Scientific conference (2006, September)

Detailed reference viewed: 2 (0 ULg)
Full Text
Peer Reviewed
See detailIterating transducers in the large
Boigelot, Bernard ULg; Legay, A.; Wolper, Pierre ULg

in Lecture Notes in Computer Science (2003), 2725

Checking infinite-state systems is frequently done by encoding infinite sets of states as regular languages. Computing such a regular representation of, say, the reachable set of states of a system ... [more ▼]

Checking infinite-state systems is frequently done by encoding infinite sets of states as regular languages. Computing such a regular representation of, say, the reachable set of states of a system requires acceleration techniques that can finitely compute the effect of an unbounded number of transitions. Among the acceleration techniques that have been proposed, one finds both specific and generic techniques. Specific techniques exploit the particular type of system being analyzed, e.g. a system manipulating queues or integers, whereas generic techniques only assume that the transition relation is represented by a finite-state transducer, which has to be iterated. In this paper, we investigate the possibility of using generic techniques in cases where only specific techniques have been exploited so far. Finding that existing generic techniques are often not applicable in cases easily handled by specific techniques, we have developed a new approach to iterating transducers. This new approach builds on earlier work, but exploits a number of new conceptual and algorithmic ideas, often induced with the help of experiments, that give it a broad scope, as well as good performance. [less ▲]

Detailed reference viewed: 28 (7 ULg)
Peer Reviewed
See detailAn iterative approach for the solution of multiple-scattering problems at high-frequencies using finite elements
Geuzaine, Christophe ULg

in Proceedings of the conference The Mathematics of Finite Elements and Applications (MAFELAP 2009) (2009)

Detailed reference viewed: 10 (0 ULg)
Full Text
Peer Reviewed
See detailIterative ecological radiation and convergence during the evolutionary history of damselfishes (Pomacentridae)
Frederich, Bruno ULg; Sorenson, Laurie; Santini, Francesco et al

in American naturalist (2013), 181(1), 94-113

Coral reef fishes represent one of the most spectacularly diverse assemblages of vertebrates on the planet, but our understand- ing of their mode of diversification remains limited. Here we test whether ... [more ▼]

Coral reef fishes represent one of the most spectacularly diverse assemblages of vertebrates on the planet, but our understand- ing of their mode of diversification remains limited. Here we test whether the diversity of the damselfishes (Pomacentridae), one of the most species-rich families of reef-associated fishes, was produced by a single or multiple adaptive radiation(s) during their evolutionary history. Tests of the tempo of lineage diversification using a time-calibrated phylogeny including 208 species revealed that crown pomacentrid diversification has not slowed through time as expected under a scenario of a single adaptive radiation resulting from an early burst of diversification. Evolutionary modeling of trophic traits similarly rejected the hypothesis of early among-lineage partitioning of ecologically important phenotypic diversity. Instead, damselfishes are shown to have experienced iterative convergent radiations wherein subclades radiate across similar trophic strategies (i.e., pelagic feeders, benthic feeders, intermediate) and morphologies. Regionalization of coral reefs, competition, and functional constraints may have fueled iterative ecological radiation and convergent evolution of damselfishes. Through the Pomacentridae, we illustrate that radiations may be strongly structured by the nature of the constraints on diversification. [less ▲]

Detailed reference viewed: 61 (19 ULg)
Full Text
Peer Reviewed
See detailAn Iterative Finite Element Perturbation Method for Computing Electrostatic Field Distortions
Boutaayamou, Mohamed ULg; V Sabariego, Ruth ULg; Dular, Patrick ULg

in Proceedings of 16th Conference on the Computation of Electromagnetic Fields (COMPUMAG2007) (2007, June)

A finite element (FE) perturbation method for computing electrostatic field distortions due to moving conductors is presented. First, an unperturbed problem (in the absence of conductors) is solved with ... [more ▼]

A finite element (FE) perturbation method for computing electrostatic field distortions due to moving conductors is presented. First, an unperturbed problem (in the absence of conductors) is solved with the conventional FE method in the complete domain. Then, a perturbed problem is computed in a reduced region using the solution of the unperturbed problem as a source field. When the source is close to the perturbing regions, an iterative computation may be required. The developed procedure allows for solving sub-problems in reduced domains with independent problem-adapted meshes. [less ▲]

Detailed reference viewed: 16 (8 ULg)
Full Text
Peer Reviewed
See detailAn iterative finite element perturbation method for computing electrostatic field distortions
Boutaayamou, Mohamed ULg; V Sabariego, Ruth ULg; Dular, Patrick ULg

in IEEE Transactions on Magnetics (2008), 44(6), 746-749

A finite element perturbation method is developed for computing electrostatic field distortions and the ensuing charges and forces on moving conductive regions subjected to fixed potentials. It is based ... [more ▼]

A finite element perturbation method is developed for computing electrostatic field distortions and the ensuing charges and forces on moving conductive regions subjected to fixed potentials. It is based on the subsequent solution of an unperturbed problem in a complete domain, where conductive regions have been extracted, and of perturbation problems in subdomains restricted to the surroundings of the added conductive regions. The solution of the unperturbed problem serves as source (with a very reduced support) for the perturbation subproblems. For every new position of the conductors, the solution of the unperturbed problem does not vary and is thus reused; only the perturbation subproblems have to be solved. Further, this approach allows for the use of independent and well-adapted meshes. An iterative procedure is required if the conductive regions are close to the sources. [less ▲]

Detailed reference viewed: 78 (36 ULg)
Peer Reviewed
See detailIterative finite element solution of multiple-scattering problems at high frequencies
Geuzaine, Christophe ULg; Dular, Patrick ULg; Gaignaire, R. et al

in Proceedings of the 8th International Symposium on Electric and Magnetic Fields (EMF'2009) (2009)

Detailed reference viewed: 59 (10 ULg)
Full Text
Peer Reviewed
See detailAn iterative maximum a posteriori estimation of proficiency level to detect multiple local likelihood maxima
Magis, David ULg; Raîche, Gilles

in Applied Psychological Measurement (2010), 34

In this article the authors focus on the issue of the nonuniqueness of the maximum likelihood (ML) estimator of proficiency level in item response theory (with special attention to logistic models). The ... [more ▼]

In this article the authors focus on the issue of the nonuniqueness of the maximum likelihood (ML) estimator of proficiency level in item response theory (with special attention to logistic models). The usual maximum a posteriori (MAP) method offers a good alternative within that framework; however, this article highlights some drawbacks of its use. The authors then propose an iteratively based MAP estimator (IMAP), which can be useful in detecting multiple local likelihood maxima. The efficiency of the IMAP estimator is studied and is compared to the ML and MAP methods by means of a simulation study. [less ▲]

Detailed reference viewed: 20 (1 ULg)
Full Text
Peer Reviewed
See detailIterative multi-task sequence labeling for predicting structural properties of proteins
Maes, Francis ULg; Becker, Julien ULg; Wehenkel, Louis ULg

in ESANN 2011 (2011)

Developing computational tools for predicting protein structural information given their amino acid sequence is of primary importance in protein science. Problems, such as the prediction of secondary ... [more ▼]

Developing computational tools for predicting protein structural information given their amino acid sequence is of primary importance in protein science. Problems, such as the prediction of secondary structures, of solvent accessibility, or of disordered regions, can be expressed as sequence labeling problems and could be solved independently by existing machine learning based sequence labeling approaches. But, since these problems are closely related, we propose to rather approach them jointly in a multi-task approach. To this end, we introduce a new generic framework for iterative multi-task sequence labeling. We apply this - conceptually simple but quite effective - strategy to jointly solve a set of five protein annotation tasks. Our empirical results with two protein datasets show that the proposed strategy significantly outperforms the single-task approaches. [less ▲]

Detailed reference viewed: 32 (2 ULg)
Full Text
Peer Reviewed
See detailIterative pruning PCA improves resolution of highly structured populations.
Intarapanich, Apichart; Shaw, Philip J.; Assawamakin, Anunchai et al

in BMC bioinformatics (2009), 10

BACKGROUND: Non-random patterns of genetic variation exist among individuals in a population owing to a variety of evolutionary factors. Therefore, populations are structured into genetically distinct ... [more ▼]

BACKGROUND: Non-random patterns of genetic variation exist among individuals in a population owing to a variety of evolutionary factors. Therefore, populations are structured into genetically distinct subpopulations. As genotypic datasets become ever larger, it is increasingly difficult to correctly estimate the number of subpopulations and assign individuals to them. The computationally efficient non-parametric, chiefly Principal Components Analysis (PCA)-based methods are thus becoming increasingly relied upon for population structure analysis. Current PCA-based methods can accurately detect structure; however, the accuracy in resolving subpopulations and assigning individuals to them is wanting. When subpopulations are closely related to one another, they overlap in PCA space and appear as a conglomerate. This problem is exacerbated when some subpopulations in the dataset are genetically far removed from others. We propose a novel PCA-based framework which addresses this shortcoming. RESULTS: A novel population structure analysis algorithm called iterative pruning PCA (ipPCA) was developed which assigns individuals to subpopulations and infers the total number of subpopulations present. Genotypic data from simulated and real population datasets with different degrees of structure were analyzed. For datasets with simple structures, the subpopulation assignments of individuals made by ipPCA were largely consistent with the STRUCTURE, BAPS and AWclust algorithms. On the other hand, highly structured populations containing many closely related subpopulations could be accurately resolved only by ipPCA, and not by other methods. CONCLUSION: The algorithm is computationally efficient and not constrained by the dataset complexity. This systematic subpopulation assignment approach removes the need for prior population labels, which could be advantageous when cryptic stratification is encountered in datasets containing individuals otherwise assumed to belong to a homogenous population. [less ▲]

Detailed reference viewed: 13 (1 ULg)
Peer Reviewed
See detailIterative solution of high-frequency multiple-scattering problems using finite elements
Geuzaine, Christophe ULg; Vion, Alexandre ULg; V Sabariego, Ruth ULg

in Proceedings of the IVth European Conference on Computational Mechanics (ECCM 2010) (2010)

Detailed reference viewed: 37 (16 ULg)