This paper proposes a new finite precision iterative decoder for low-density parity-check (LDPC) codes. The proposed decoder, named Sign-Preserving Min-Sum (SP-MS), significantly improves the decoding performance compared to classical Offset (OMS) when messages are quantized on <tex-math n...

The aim of the present study was to find the effects of pre and post vitrification taxol treatment on bovineimmature cumulus oocyte complexes (COCs). Bovine ovaries were collected from the local slaughterhousein a container with 30-37°C physiologic saline and supplemented with antibiotics. The grade A aspiratedCOCs were assigned to 6 experimental groups; The 1st group was control (n=100) in whi...

the aim of this study was to examine the effect of 12 weeks of concurrent training on rbp4 andinsulin resistance levels in obese middle-age men. for this purpose, 20 obese middle-age men voluntarily participated in this study and were assigned to concurrent training group (n=10, mean age 51.2 ± 2.25 yr and bmi 31.44 ± 0.81 kg/m²) and control group (n=10, mean age 50.3 ± 2.11 yr and bmi 30.32 ± ...

postconditioning is a simple and safe strategy for cardioprotection and infarct size limitation. our previous study showed that oxytocin (ot) exerts postconditioning effect on ischemic/reperfused isolated rat heart. the aim of this study was to investigate the involvement of ot receptor, mitochondrial atp-sensitive potassium channel (mkatp), nitric oxide (no) and cyclooxygenase (cox) pathways i...

We study the minimization of a quadratic objective function in a distributed fashion. It is known that the min-sum algorithm can be applied to solve the minimization problem if the algorithm converges. We propose a min-summin message-passing algorithm which includes the min-sum algorithm as a special case. As the name suggests, the new algorithm involves two minimizations in each iteration as c...

We study the following min-min random graph process G = (G0, G1, . . .): the initial state G0 is an empty graph on n vertices (n even). Further, GM+1 is obtained from GM by choosing a pair {v, w} of distinct vertices of minimum degree uniformly at random among all such pairs in GM and adding the edge {v, w}. The process may produce multiple edges. We show that GM is asymptotically almost surely...

We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover all the vertices of a given graph. We prove the NP-hardness of some cases. We derive approximation results for Min Split-coloring and Min Cocoloring in line graphs, comparability graphs and general graphs. This provide...