Dysprosium doped copper oxide (Cu1-xDyxO) nanoparticles enabled bifunctional electrode for overall water splitting

The production of hydrogen, a favourable alternative to an unsustainable fossil fuel remains as a significant hurdle with the pertaining challenge in the design of proficient, highly productive and sustainable electrocatalyst for both oxygen evolution reaction (OER) and hydrogen evolution reaction (HER). Herein, the dysprosium (Dy) doped copper oxide (Cu_1-xDy_xO) nanoparticles were synthesized via solution combustion technique and utilized as a non-noble metal based bi-functional electrocatalyst for overall water splitting. Due to the improved surface to volume ratio and conductivity, the optimized Cu_1-xDy_xO (x = 0.01, 0.02) electrocatalysts exhibited impressive HER and OER performance respectively in 1 M KOH delivering a current density of 10 mAcm^?2 at a potential of ?0.18 V vs RHE for HER and 1.53 V vs RHE for OER. Moreover, the Dy doped CuO electrocatalyst used as a bi-functional catalyst for overall water splitting achieved a potential of 1.56 V at a current density 10 mAcm^?2 and relatively high current density of 66 mAcm^?2 at a peak potential of 2 V. A long term stability of 24 h was achieved for a cell voltage of 2.2 V at a constant current density of 30 mAcm^?2 with only 10% of the initial current loss. This showcases the accumulative opportunity of dysprosium as a dopant in CuO nanoparticles for fabricating a highly effective and low-cost bi-functional electrocatalyst for overall water splitting.     

Transglycosylation Activity of Engineered Bifidobacterium Lacto-N-Biosidase Mutants at Donor Subsites for Lacto-N-Tetraose Synthesis

The health benefits of human milk oligosaccharides (HMOs) make them attractive targets as supplements for infant formula milks. However, HMO synthesis is still challenging and only two HMOs have been marketed. Engineering glycoside hydrolases into transglycosylases may provide biocatalytic routes to the synthesis of complex oligosaccharides. Lacto-N-biosidase from Bifidobacterium bifidum (LnbB) is a GH20 enzyme present in the gut microbiota of breast-fed infants that hydrolyzes lacto-N-tetraose (LNT), the core structure of the most abundant type I HMOs. Here we report a mutational study in the donor subsites of the substrate binding cleft with the aim of reducing hydrolytic activity and conferring transglycosylation activity for the synthesis of LNT from p-nitrophenyl β-lacto-N-bioside and lactose. As compared with the wt enzyme with negligible transglycosylation activity, mutants with residual hydrolase activity within 0.05% to 1.6% of the wild-type enzyme result in transglycosylating enzymes with LNT yields in the range of 10–30%. Mutations of Trp394, located in subsite -1 next to the catalytic residues, have a large impact on the transglycosylation/hydrolysis ratio, with W394F being the best mutant as a biocatalyst producing LNT at 32% yield. It is the first reported transglycosylating LnbB enzyme variant, amenable to further engineering for practical enzymatic synthesis of LNT.     

Reoptimization framework and policy analysis for maritime inventory routing under uncertainty

We study a maritime inventory routing problem, in which shipments between production and consumption nodes are carried out by a fleet of vessels. The vessels have specific capacities and can be chartered under different agreements. The inventory levels of all consumption nodes and some production nodes should be maintained within specified bounds; for the remaining production nodes, orders should be picked up within pre-defined time windows. We propose a discrete-time mixed-integer programming model. In the face of new information and uncertainty, this optimization model has to be re-solved, as the horizon is rolled forward. We discuss how to account for different sources of uncertainty. We present a rolling-horizon reoptimization framework that allows us to study different policies that impact the quality of the implemented solution, so we can identify the optimal set of policies.     

Scalability and performance of an agent‐based network management middleware

Rapid growth of computer network sizes and uses necessitate analysis of network application middleware in terms of its scalability as well as performance. In this paper we analyze a distributed network management middleware based on agents that can be dispatched to locations where they can execute close to the managed nodes. The described middleware operates between the network protocol layer and the application layer and uses standard TCP protocol and SNMP probes to interface the network. By aggregating requests from many users into a single agent, our system allows multiple managers to probe problem areas with minimal management traffic overhead. We discuss and quantify the benefits of the described middleware by implementing real‐time network managers using our system. The main result of this paper is a comparison of scalability and efficiency of our agent‐based management middleware and traditional SNMP‐based data collection. To this end, we measured traffic in both real and simulated networks. In the latter case, we designed, used and described here a method of separating simulated application flow into separate subflows to simplify design of simulations. Copyright © 2004 John Wiley & Sons, Ltd.     

The role of perspective in the accessibility of goals during reading.

An implicit assumption of several causal reasoning models is that readers adopt the goals of a narrative's protagonist during text comprehension. In apparent violation of this assumption, readers participating in Experiment 1 of the present study drew inferences relevant to a protagonist's goal even when that goal was already satisfied from the perspective of the protagonist. In Experiments 2 and 3, participants were explicitly asked to view the text situation from the point of view of the protagonist. In this case, the goals of the reader and the protagonist should be the same. In these experiments, participants focused on the goals of the protagonist only when those goals had not been satisfied from the perspective of the protagonist. These results are discussed in terms of reader- and character-based perspectives and in terms of text characteristics that cue perspective taking. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Perceived stress management skill mediates the relationship between optimism and positive mood following radical prostatectomy.

This study evaluated relations among optimism, perceived stress management skills (PSMS), and positive mood in 46 men who had surgical treatment for localized prostate cancer. The authors found that optimism, PSMS, and positive mood scores were positively correlated. Positive mood was unrelated to demographic and disease-related control variables. In a hierarchical regression model controlling for PSMS, the relationship between optimism and positive mood became nonsignificant, whereas PSMS remained a correlate of positive mood. Results suggest that the relationship between optimism and positive mood may be mediated by belief in being able to use stress management techniques effectively. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Learning Automata from Ordered Examples

Connectionist learning models have had considerable empirical success, but it is hard to characterize exactly what they learn. The learning of finite-state languages (FSL) from example strings is a domain which has been extensively studied and might provide an opportunity to help understand connectionist learning. A major problem is that traditional FSL learning assumes the storage of all examples and thus violates connectionist principles. This paper presents a provably correct algorithm for inferring any minimum-state deterministic finite-state automata (FSA) from a complete ordered sample using limited total storage and without storing example strings. The algorithm is an iterative strategy that uses at each stage a current encoding of the data considered so far, and one single sample string. One of the crucial advantages of our algorithm is that the total amount of space used in the course of learning for encoding any finite prefix of the sample is polynomial in the size of the inferred minimum state deterministic FSA. The algorithm is also relatively efficient in time and has been implemented. More importantly, there is a connectionist version of the algorithm that preserves these properties. The connectionist version requires much more structure than the usual models and has been implemented using the Rochester Connectionist Simulator. We also show that no machine with finite working storage can iteratively identify the FSL from arbitrary presentations.