BACKGROUND The Seniors Health Research Transfer Network (SHRTN) Collaborative is a network of networks that work together to improve the health and health care of Ontario seniors. The collaborative facilitates knowledge exchange through a library service, knowledge brokers (KBs), local implementation teams, collaborative technology, and, most importantly, Communities of Practice (CoPs) whose me...

CoPS nanoparticles encapsulated with S, P, N tri-doped carbon material (SPNC) were proposed as bifunctional electrocatalyst of oxygen evolution reaction (OER) and reduction (ORR) derived from zeolitic imidazolate framework-67. Density functional theory calculations consistently revealed that P element in CoPS@SPNC improves the electrical conductivity reduces OH? hydrogenation energy barrier on ...

During the end-of-life (EOL) product recovery process, there are a series of combinatorial optimization problems (COPs) that should be efficiently solved. These COPs generally result from reverse logistics (RL) and remanufacturing, such as facility location vehicle routing in RL, scheduling, planning, line balancing remanufacturing. Each RL remanufacturing has been reviewed; however, no review ...

Combinatorial optimization problems (COPs) are a class of NP-hard with great practical significance. Traditional approaches for COPs suffer from high computational time and reliance on expert knowledge, machine learning (ML) methods, as powerful tools have been used to overcome these problems. In this review, the in energy areas series modern ML approaches, i.e., interdisciplinary COPs, areas, ...

The ‘Cheating Robot’ version of Cops and Robbers is played on a finite, simple, connected graph. players move in the same time period. However, before moving, robot observes to which vertices cops are moving it fast enough complete its also know that will use this information. More required capture than robber. Indeed, minimum degree lower bound number robot. Only tree one cop guaranteed robot,...

The cop throttling number $th_c(G)$ of a graph $G$ for the game Cops and Robbers is minimum $k + capt_k(G)$, where $k$ cops $capt_k(G)$ rounds needed to capture robber on over all possible games in which both players play optimally. In this paper, we construct family graphs having $th_c(G)= \Omega(n^{2/3})$, establish sublinear upper bound number, show that chordal $O(\sqrt{n})$. We also introd...