Binding and thermodynamic properties of a carbohydrate binding module (CBM) and a glycoside hydrolase family 44 xyloglucanase/endoglucanase catalytic domain (CD) from Ruminococcus f lavefaciens, both when separate and when linked to each other, have been quantified when binding various β-1,4-linked glucans and xylans. The three constructs bind cellotetraose, cellopentaose, and cellohexaose with...

BACKGROUND AND AIMS Cognitive bias modification (CBM) interventions, presumably targeting automatic processes, are considered particularly promising for addictions. We conducted a meta-analysis examining randomized controlled trials (RCTs) of CBM for substance addiction outcomes. METHODS Studies were identified through systematic searches in bibliographical databases. We included RCTs of CBM ...

Preventive maintenance is widely used in wind turbine equipment to ensure their safe and reliable operation, this mainly includes time-based (TBM) condition-based (CBM). Most farms only use TBM as the main strategy engineering practice. Although can meet certain reliability requirements, it cannot fully utilize characteristics of CBM. For this, a state model based on stochastic differential equ...

OBJECTIVE This study was designed to determine whether diffusion-weighted imaging (DWI) with sensitivity encoding (SENSE) could detect bone marrow involvement in patients with cranial bone marrow (CBM) metastases. DWI results obtained were compared with T1-weighted imaging (T1WI) findings. MATERIALS AND METHODS DWI with sensitivity encoding (SENSE; b value = 1,000) was performed consecutively...

This is a proposal of the content of a licentiate thesis in Innovation and Design at Mälardalen University, Sweden. The contents of the licentiate thesis are concerning Condition Based Maintenance (CBM) in technical systems. The need to make more effective maintenance actions have been shown in various national and international scientific papers. It has also been shown that the traditional mai...

We study the TAPF (combined target-assignment and pathfinding) problem for teams of agents in known terrain, which generalizes both the anonymous and non-anonymous multiagent path-finding problems. Each of the teams is given the same number of targets as there are agents in the team. Each agent has to move to exactly one target given to its team such that all targets are visited. The TAPF probl...