An irreversible inhibitor of complex II in the mitochondria, 3-nitropropionic acid (3-NP), induces bilateral striatal lesions with many neuropathological features of Huntington’s disease (HD) in rats. It is widely used as a model of HD. Chronic systemic treatment of 3-NP for 4 days in rats (10, 15 and 20 mg/kg) caused a significant dose-dependent reduction in succinate dehydrogenase activity, w...

In this paper, Ag/ZnO/HZSM-5ternary nanocomposites with different Ag loadings were prepared by the photo precipitation method. The prepared photocatalysts were characterized by XRD, BET, SEM and TEM. The photocatalytic activity of ZnO/HZSM-5 for 4-nitrophenol (4-NP) degradation was increased by silver doping. Effects of various parameters such as the initial concentration of 4-NP, pH and Ag loa...

It is known that there exists a PCP characterization of NP where the veriier makes 3 queries and has a one-sided error that is bounded away from 1; and also that 2 queries do not suuce for such a characterization. Thus PCPs with 3 queries possess non-trivial veriication power and motivate the task of determining the lowest error that can be achieved with a 3-query PCP. Recently, H astad 10] has...

Excitotoxicity is implicated in the pathogenesis of several neurologic diseases, such as chronic neurodegenerative diseases and stroke. Recently, it was reported that excitotoxicity has a relationship to apoptotic neuronal death, and that the mitochondrial toxin, 3-nitropropionic acid (3-NP), could induce apoptosis in the striatum. Although striatal lesions produced by 3-NP could develop throug...

We show it is NP-hard to pack the maximum number of segments in a convex 3-dimensional polytope. We show this packing problem is also NP-hard for general polygonal regions in the plane. This problem relates two streams of research, Kakeya set problems and packing problems.

It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a one-sided error that is bounded away from 1; and also that 2 queries do not suffice for such a characterization. Thus PCPs with 3 queries possess non-trivial verification power and motivate the task of determining the lowest error that can be achieved with a 3-query PCP. Recently, Håstad [11]...

The computational complexity class #P captures the difficulty of counting the satisfying assignments to a boolean formula. In this work, we use basic tools from quantum computation to give a proof that the SO(3) Witten-Reshetikhin-Turaev (WRT) invariant of 3-manifolds is #P-hard to calculate. We then apply this result to a question about the combinatorics of Heegaard splittings, motivated by an...

2 A Brief Introduction to Theory of Computation 3 2.1 Some Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Modelling Computation Turing Machines . . . . . . . . . . . . 3 2.3 NP Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.4 Sample NP Problems . . . . . . . . . . . . . . . . . . . . . . . . 7 2.5 Optimizations for NP Problems . . . . . . . . . . . . ...

PURPOSE Because the nongenotoxic inhibitor of the p53/MDM2 interactions Nutlin-3 has shown promising in vitro therapeutic activity against a variety of p53(wild-type) cancer cells, in this study we evaluated an innovative strategy able to specifically target Nutlin-3 toward CD20(+) malignant cells. EXPERIMENTAL DESIGN The cytotoxic effects of Nutlin-3 encapsulated into poly(lactide-co-glycoli...