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
Peer Reviewed
See detailBrain-derived estrogens rapidly control sexual behavior in Japanese quail
Cornil, Charlotte ULiege

Conference (2012, August 25)

Detailed reference viewed: 10 (1 ULiège)
Full Text
Peer Reviewed
See detailBrain-derived neurotrophic factor (BDNF) in normal healthy and hemodialyzed populations
CAVALIER, Etienne ULiege; Carlisi, A.S.; WATAR, Florence ULiege et al

in Journal of Frailty & Aging (2016), 5(Supplement 1), 116

Detailed reference viewed: 19 (10 ULiège)
Full Text
Peer Reviewed
See detailBrain-derived neurotrophic factor (BDNF) in normal healthy and hemodialyzed populations.
CAVALIER, Etienne ULiege; CARLISI, Ignazia ULiege; KOVACS, Stéphanie ULiege et al

in Osteoporosis International (2016, April), 27(Supplement 1), 512

Detailed reference viewed: 35 (11 ULiège)
Full Text
Peer Reviewed
See detailBrain-heart interactions reveal consciousness in non-communicating patients
Raimondo, Federico; Rohaut, Benjamin; Demertzi, Athina ULiege et al

in Annals of Neurology (in press)

Objective: We here aimed at characterizing heart–brain interactions in patients with disorders of consciousness. We tested how this information impacts data-driven classification between unresponsive and ... [more ▼]

Objective: We here aimed at characterizing heart–brain interactions in patients with disorders of consciousness. We tested how this information impacts data-driven classification between unresponsive and minimally conscious patients. Methods: A cohort of 127 patients in vegetative state/unresponsive wakefulness syndrome (VS/UWS; n570) and minimally conscious state (MCS; n557) were presented with the local–global auditory oddball paradigm, which dis- tinguishes 2 levels of processing: short-term deviation of local auditory regularities and global long-term rule viola- tions. In addition to previously validated markers of consciousness extracted from electroencephalograms (EEG), we computed autonomic cardiac markers, such as heart rate (HR) and HR variability (HRV), and cardiac cycle phase shifts triggered by the processing of the auditory stimuli. Results: HR and HRV were similar in patients across groups. The cardiac cycle was not sensitive to the processing of local regularities in either the VS/UWS or MCS patients. In contrast, global regularities induced a phase shift of the cardiac cycle exclusively in the MCS group. The interval between the auditory stimulation and the following R peak was significantly shortened in MCS when the auditory rule was violated. When the information for the cardiac cycle modulations and other consciousness-related EEG markers were combined, single patient classification performance was enhanced compared to classification with solely EEG markers. Interpretation: Our work shows a link between residual cognitive processing and the modulation of autonomic somatic markers. These results open a new window to evaluate patients with disorders of consciousness via the embodied paradigm, according to which body–brain functions contribute to a holistic approach to conscious processing. [less ▲]

Detailed reference viewed: 22 (3 ULiège)
Full Text
Peer Reviewed
See detailA Brain-Machine Interface Operating with a Real-Time Spiking Neural Network Control Algorithm
Dethier, Julie ULiege; Nuyujukian, Paul; Eliasmith, Chris et al

in Advances in Neural Information Processing Systems (NIPS) 24 (2011, December)

Motor prostheses aim to restore function to disabled patients. Despite compelling proof of concept systems, barriers to clinical translation remain. One challenge is to develop a low-power, fully ... [more ▼]

Motor prostheses aim to restore function to disabled patients. Despite compelling proof of concept systems, barriers to clinical translation remain. One challenge is to develop a low-power, fully-implantable system that dissipates only minimal power so as not to damage tissue. To this end, we implemented a Kalman-filter based decoder via a spiking neural network (SNN) and tested it in brain-machine interface (BMI) experiments with a rhesus monkey. The Kalman filter was trained to predict the arm’s velocity and mapped on to the SNN using the Neural Engineer- ing Framework (NEF). A 2,000-neuron embedded Matlab SNN implementation runs in real-time and its closed-loop performance is quite comparable to that of the standard Kalman filter. The success of this closed-loop decoder holds promise for hardware SNN implementations of statistical signal processing algorithms on neu- romorphic chips, which may offer power savings necessary to overcome a major obstacle to the successful clinical translation of neural motor prostheses. [less ▲]

Detailed reference viewed: 370 (44 ULiège)
See detailA Brain-Machine Interface Operating with a Real-Time Spiking Neural Network Control Algorithm
Dethier, Julie ULiege; Nuyujukian, Paul; Elassaad, Shauki A. et al

Poster (2011, November 29)

Motor prostheses aim to restore function to disabled patients. Despite compelling proof of concept systems, barriers to clinical translation remain. One challenge is to develop a low-power, fully ... [more ▼]

Motor prostheses aim to restore function to disabled patients. Despite compelling proof of concept systems, barriers to clinical translation remain. One challenge is to develop a low-power, fully-implantable system that dissipates only minimal power so as not to damage tissue. To this end, we implemented a Kalman-filter based decoder via a spiking neural network (SNN) and tested it in brain-machine interface (BMI) experiments with a rhesus monkey. The Kalman filter was trained to predict the arm’s velocity and mapped on to the SNN using the Neural Engineering Framework (NEF). A 2,000-neuron embedded Matlab SNN implementation runs in real-time and its closed-loop performance is quite comparable to that of the standard Kalman filter. The success of this closed-loop decoder holds promise for hardware SNN implementations of statistical signal processing algorithms on neuromorphic chips, which may offer power savings necessary to overcome a major obstacle to the successful clinical translation of neural motor prostheses. [less ▲]

Detailed reference viewed: 31 (12 ULiège)
Full Text
See detailA Brain-Machine Interface with an Innovative Spiking Neural Network Decoder
Dethier, Julie ULiege; Nuyujukian, Paul; Elassaad, Shauki A. et al

Poster (2011, December 02)

Motor prostheses aim to restore functions lost to neurological disease and injury by translating neural signals into control signals for prosthetic limbs. Despite compelling proof of concept systems ... [more ▼]

Motor prostheses aim to restore functions lost to neurological disease and injury by translating neural signals into control signals for prosthetic limbs. Despite compelling proof of concept systems, barriers to clinical translation—mainly strict power dissipation constraints—still remain. The proposed solution is to use the ultra-low-power neuromorphic approach to potentially meet these constraints. [less ▲]

Detailed reference viewed: 68 (24 ULiège)
Full Text
Peer Reviewed
See detailBRAIN-TRAINS: Integrating the LCA methodology in and interdisciplinary project
Merchan Arribas, Angel ULiege; Belboom, Sandra ULiege; Léonard, Angélique ULiege

in Proceedings of the 5th international conference on Life Cycle approaches (2016, November 09)

BRAIN-TRAINS is a project supported by the Belgian Federal Government that deals with the possible development of rail freight intermodality in Belgium, approaching this transport issue from an ... [more ▼]

BRAIN-TRAINS is a project supported by the Belgian Federal Government that deals with the possible development of rail freight intermodality in Belgium, approaching this transport issue from an interdisciplinary perspective. Life Cycle Assessment (LCA) methodology is used to analyse the sustainability impact of rail freight intermodality. The rail freight system has been divided in three sub-systems: rail transport operation, rail infrastructure and rail transport equipment (locomotives and wagons). First, a SWOT analysis of the intermodal rail freight transport has been performed to identify internal characteristics and possible external trends of the intermodal rail freight transport. The most important elements identified in the SWOT analysis have been selected through a Delphi-technique with the collaboration of a panel of expert. Thirdly, the selected elements have been translated into clear and measurable parameters, defining for every parameter an input value to quantify the scenarios. The parameters are measured in “tonne-kilometre”. Finally, three divergent Belgian scenarios with a time horizon set in 2030 have been built for further analysis. These scenarios are directly linked to the third strategic goal of the European Commission’s White Paper on transport (2011), which aims to shift the 30% of road freight over 300 km to other modes such as rail transport by 2030. As a result, a best, worst and medium case scenarios have been developed, depending on whether the 30% shift has been successfully accomplished, the status quo has been maintained or the goal has not been completely reached by 2030, respectively. The direct transport emissions and energy consumption during the rail transport activity have been determined using the LCA methodology. These LCA results have been used to improve the accuracy of existing commercial databases as Ecoinvent for the Belgian situation. [less ▲]

Detailed reference viewed: 46 (12 ULiège)
Peer Reviewed
See detailBRAIN-TRAINS: Scenario development to explore intermodal rail transport expansion in, from and towards Belgium
Troch, Frank; Vanelslander, Thierry; Sys, Christa et al

Conference (2016, July)

Detailed reference viewed: 45 (21 ULiège)
Full Text
Peer Reviewed
See detailBrains creating stories of selves: the neural basis of autobiographical reasoning.
D'Argembeau, Arnaud ULiege; Cassol, Helena; Phillips, Christophe ULiege et al

in Social Cognitive and Affective Neuroscience (2014), 9

Personal identity critically depends on the creation of stories about the self and one's life. The present study investigates the neural substrates of autobiographical reasoning, a process central to the ... [more ▼]

Personal identity critically depends on the creation of stories about the self and one's life. The present study investigates the neural substrates of autobiographical reasoning, a process central to the construction of such narratives. During fMRI scanning, participants approached a set of personally significant memories in two different ways: on some trials, they remembered the concrete content of the events (autobiographical remembering), whereas on other trials they reflected on the broader meaning and implications of their memories (autobiographical reasoning). Relative to remembering, autobiographical reasoning recruited a left-lateralized network involved in conceptual processing (including the dorsal medial prefrontal cortex (MPFC), inferior frontal gyrus, middle temporal gyrus, and angular gyrus). The ventral MPFC-an area that may function to generate personal/affective meaning-was not consistently engaged during autobiographical reasoning across participants but, interestingly, the activity of this region was modulated by individual differences in interest and willingness to engage in self-reflection. These findings support the notion that autobiographical reasoning and the construction of personal narratives go beyond mere remembering in that they require deriving meaning and value from past experiences. [less ▲]

Detailed reference viewed: 86 (13 ULiège)
Full Text
Peer Reviewed
See detailBrainstem specific warping improves locus coeruleus functional imaging in humans
Balteau, Evelyne ULiege; Schmidt, Christina ULiege; Maquet, Pierre ULiege et al

in Proceedings of the International Society for Magnetic Resonance in Medicine ... Scientific Meeting and Exhibition. International Society For Magnetic Resonance in Medicine. Scientific Meeting and Exhibition (2010)

Detailed reference viewed: 28 (2 ULiège)
Full Text
See detailA branch and bound framework applied to naval structure optimization problems
Bay, Maud ULiege

Master of advanced studies dissertation (2005)

Naval structure optimization consists of defining the optimum scantling of the constitutive elements of a structure with given general dimensions and form of the hull. Amathematical formulation leads to ... [more ▼]

Naval structure optimization consists of defining the optimum scantling of the constitutive elements of a structure with given general dimensions and form of the hull. Amathematical formulation leads to non linear problem with mixed (discrete continuos) variables and implicit constraints that are evaluated with a "black-box" software. The evaluation of the constraints is vry expensive in computation time. A non-linear branch and bound framework is presented to solve this problem. The method is first tested on a small example to set up the parameters of the algorithm and then is applied to a real size structures. It performs very well to provide good solutions in a reasonable time. [less ▲]

Detailed reference viewed: 150 (20 ULiège)
Peer Reviewed
See detailA branch and price approach for an airport vehicle routing problem
Schyns, Michael ULiege

Conference (2013, July)

This project has been initiated by a main European freight airport. The goal is to optimize the aircraft refueling process which relies on a given set of trucks. The underlying process can be defined as a ... [more ▼]

This project has been initiated by a main European freight airport. The goal is to optimize the aircraft refueling process which relies on a given set of trucks. The underlying process can be defined as a vehicle routing problem with capacity and time windows. We resort to a branch and price approach for which we first analyze the impact of different parameters on the performance of the algorithm. Due to the stochastic nature of the demand and time windows in this context, we are also working on a priori (split delivery) and a posteriori (efficient re-optimization) measures. [less ▲]

Detailed reference viewed: 85 (5 ULiège)
Full Text
See detailA branch-and-price algorithm for 2-period vehicle routing problems
Crama, Yves ULiege; Rezaei Sadrabadi, Mahmood ULiege; Van Woensel, Tom

E-print/Working paper (2015)

We consider a Vehicle Routing Problem (VRP) with deterministic orders in two periods from a set of stores. Orders in period 1 (2) can be postponed (advanced) to the other period but any diversion from the ... [more ▼]

We consider a Vehicle Routing Problem (VRP) with deterministic orders in two periods from a set of stores. Orders in period 1 (2) can be postponed (advanced) to the other period but any diversion from the initial orders incurs a penalty. From the perspective of a Logistics Service Provider (LSP), such diversions could be beneficial if savings in the routing costs outweigh the penalties. So could they be from a store's view, as the store can set a high enough penalty to compensate the diversion from its own optimal orders. In this paper, we introduce a new model where we seek a better solution for the LSP, compared to solving two independent VRPs with fixed orders, by allowing orders to be fully postponed or advanced. We apply a branch-and-price algorithm to solve this model to optimality. Many cutting-edge techniques are implemented to have an efficient branch-and-price algorithm, and two ideas to possibly improve the upper bound are tested. We draw algorithmic and managerial insights based on our test instances. [less ▲]

Detailed reference viewed: 152 (8 ULiège)
Peer Reviewed
See detailBranch-and-Price Based Matheuristics for a Vehicle Routing Problem with Time Windows and Variable Service Start Time
Küçükaydın, Hande; Arda, Yasemin ULiege; Crama, Yves ULiege et al

Conference (2015, July 15)

We investigate a vehicle routing problem with time windows (VRPTW), where the drivers are paid per time unit worked and the starting times of their shifts are to be determined by the decision maker. In ... [more ▼]

We investigate a vehicle routing problem with time windows (VRPTW), where the drivers are paid per time unit worked and the starting times of their shifts are to be determined by the decision maker. In order to solve the problem to optimality, a branch-and-price (BP) algorithm is implemented recognizing the pertinent pricing subproblem as an elementary shortest path problem with resource constraints (ESPPRC) which can handle an infinite number of labels and employs effective dominance rules. We present the past, present, and future implementations of the BP procedure based on bounded bi-directional search, decremental state space relaxation, and ng-route relaxation. We further discuss the design of BP-based matheuristics which make use of metaheuristics in pricing subproblem resolution, upper bound improvement, and column generation. [less ▲]

Detailed reference viewed: 79 (4 ULiège)
See detailBranch-and-price: principles and its application to a 2-period vehicle routing problem
Rezaei Sadrabadi, Mahmood ULiege

Scientific conference (2013, April 05)

We review branch-and-price as an efficient algorithm to solve integer programming problems with huge number of variables. In particular, we discuss column generation algorithm as the main engine in branch ... [more ▼]

We review branch-and-price as an efficient algorithm to solve integer programming problems with huge number of variables. In particular, we discuss column generation algorithm as the main engine in branch-and-price. Implementation of branch-and-price to solve the most basic version of the well-known vehicle routing problem (VRP) is investigated, and some common tricks are introduced. Then, a new extension of VRP is introduced and exploitation of branch-and-price to solve it is discussed. We consider a 2-period vehicle routing problem where each vertex of the network has a positive demand for period 1, 2, or both. Each demand on period 1 can be postponed to period 2 in order to decrease sum of the routing costs on two periods, but it is penalized in the objective function. Similarly, each demand on period 2 can be advanced to period 1, and yet penalized, with the hope of reducing routing costs. We have used many of the classic tricks to implement branch-and-price for solving our 2-period VRP. We have also used new tricks to (1) possibly improve the upper bound during the course of column generation in each node and (2) decrease the computations time to solve pricing problem in column generation. [less ▲]

Detailed reference viewed: 47 (1 ULiège)
See detailBranch-and-price: principles and its application to a 2-period vehicle routing problem
Rezaei Sadrabadi, Mahmood ULiege

Scientific conference (2013, April 05)

We review branch-and-price as an efficient algorithm to solve integer programming problems with huge number of variables. In particular, we discuss column generation algorithm as the main engine in branch ... [more ▼]

We review branch-and-price as an efficient algorithm to solve integer programming problems with huge number of variables. In particular, we discuss column generation algorithm as the main engine in branch-and-price. Implementation of branch-and-price to solve the most basic version of the well-known vehicle routing problem (VRP) is investigated, and some common tricks are introduced. Then, a new extension of VRP is introduced and exploitation of branch-and-price to solve it is discussed. We consider a 2-period vehicle routing problem where each vertex of the network has a positive demand for period 1, 2, or both. Each demand on period 1 can be postponed to period 2 in order to decrease sum of the routing costs on two periods, but it is penalized in the objective function. Similarly, each demand on period 2 can be advanced to period 1, and yet penalized, with the hope of reducing routing costs. We have used many of the classic tricks to implement branch-and-price for solving our 2-period VRP. We have also used new tricks to (1) possibly improve the upper bound during the course of column generation in each node and (2) decrease the computations time to solve pricing problem in column generation. [less ▲]

Detailed reference viewed: 18 (1 ULiège)
See detailBranch-and-price: principles and its application to a 2-period vehicle routing problem
Rezaei Sadrabadi, Mahmood ULiege

Scientific conference (2013, March 07)

We review branch-and-price as an efficient algorithm to solve integer programming problems with huge number of variables. In particular, we discuss column generation algorithm as the main engine in branch ... [more ▼]

We review branch-and-price as an efficient algorithm to solve integer programming problems with huge number of variables. In particular, we discuss column generation algorithm as the main engine in branch-and-price. Implementation of branch-and-price to solve the most basic version of the well-known vehicle routing problem (VRP) is investigated, and some common tricks are introduced. Then, a new extension of VRP is introduced and exploitation of branch-and-price to solve it is discussed. We consider a 2-period vehicle routing problem where each vertex of the network has a positive demand for period 1, 2, or both. Each demand on period 1 can be postponed to period 2 in order to decrease sum of the routing costs on two periods, but it is penalized in the objective function. Similarly, each demand on period 2 can be advanced to period 1, and yet penalized, with the hope of reducing routing costs. We have used many of the classic tricks to implement branch-and-price for solving our 2-period VRP. We have also used new tricks to (1) possibly improve the upper bound during the course of column generation in each node and (2) decrease the computations time to solve pricing problem in column generation. [less ▲]

Detailed reference viewed: 20 (1 ULiège)
See detailUne branche particulière des services : les garages et les sociétés de transport de la région liégeoise
Merenne-Schoumaker, Bernadette ULiege

in Sporck, J. A. (Ed.) Liège aujourd'hui et demain (1986)

Presentation of the situation of garages and transportation companies in the Liege area

Detailed reference viewed: 12 (0 ULiège)
Full Text
Peer Reviewed
See detailBranched and linear A2–D–A1–D–A2 isoindigo-based solution-processable small molecules for organic field-effect transistors and solar cells
Tomassetti, Mirco ULiege; Ouhib, Farid ULiege; Cardinaletti, Ilaria et al

in RSC Advances (2015), 5(104), 85460-85469

To establish a correlation between the molecular structure, physicochemical properties, thin film morphology, charge carrier mobility and photovoltaic performance of isoindigo-based electron donor type ... [more ▼]

To establish a correlation between the molecular structure, physicochemical properties, thin film morphology, charge carrier mobility and photovoltaic performance of isoindigo-based electron donor type molecular semiconductors, a series of branched and linear A2–D–A1–D–A2 small molecules (A = acceptor, D = donor) are synthesized. The extended π-conjugated molecular chromophores have an electron-accepting isoindigo core, a bridging oligothiophene electron donor part and terminal octyl cyanoacrylate acceptor moieties. Their photophysical, thermal and electrochemical properties are analysed and the materials are applied in organic field-effect transistors and bulk heterojunction organic solar cells. Compared to an analogous benzothiadiazole-based small molecule, the isoindigo core deepens the HOMO energy level, enabling higher open-circuit voltages in organic solar cells. The linear isoindigo-based small molecule shows an enhanced hole mobility compared to the branched derivatives. The best power conversion efficiency of the investigated set is also obtained for the solar cell based on the linear (CA-3T-IID-3T-CA-l) donor molecule in combination with PC71BM. [less ▲]

Detailed reference viewed: 22 (6 ULiège)