Magnetic nanocarriers with tunable pH dependence for controlled loading and release of cationic and anionic payloads

Superparamagnetic nanocarriers with tunable pH dependence of the surface charge are designed by a simple co-precipitation method. By exploiting electrostatic interactions, cationic or anionic payloads can be adsorbed and desorbed depending on the pH. On three different resulting nanocarrier systems, experiments of loading and release of gold nanoparticles as well as effective siRNA loading and in vitro delivery on human cells are performed.     

Application of thermomechanical treatment on medium-carbon microalloyed steels continuously cooled from forging temperature

In the high-production-drop-forging of parts for automobile and truck engines the classical quench and tempering (QT) of low-alloyed steels is nowadays - in a lot of plants in Europe - substituted by direct continuous cooling (CC) of microalloyed steels without the necessity of additional heat treatment and expensive straightening as well as stress relieving cycles. Nevertheless, there are some limitations on strength and toughness achievable by this technique. On two commercial medium-carbon (0.3%C) steels microalloyed with vanadium or vanadium and titanium, modified deformation parameters were applied. The mechanical properties, determined by the tensile test, can be improved by decreasing the deformation temperature. Nevertheless, the values of yield strength (resp. 0.2%-proof stress) as well as reduction of area remain inferior to those after QT of the same steels.     

Anodic Oxidation of Carbon Fibres in Diammonium Hydrogen Phosphate Solution

Anodic surface treatment of high tensile-carbon fibres under galvanostatic conditions has been performed in diammonium hydrogen phosphate solution, containing an addition of ammonium rhodanide.

The oxidized fibres have been characterized by monofilament tensile strength, XPS measurements and surface energetic analysis. Additionally, the acid-base interactions have been evaluated by wetting with aqueous solutions of different pH values.

An addition of ammonium rhodanide to the diammonium hydrogen phosphate anodization bath affects the oxidation of carbon fibres in terms of decreasing both the amounts of the surface oxides as well as that of degradation by-products. At the optimal treatment conditions (I = 100 mA) no changes in the tensile strength or BET-surface area of the fibre have been observed. The rise in ILSS values of amine cured epoxy composites is not dependent on O_ls/C_ls ratio or surface free energy of the reinforcing fibres, but on the acidic as well as nitrogen functional groups on their surface.     

The C-Terminal Domain of LRRK2 with the G2019S Substitution Increases Mutant A53T α-Synuclein Toxicity in Dopaminergic Neurons In Vivo

Alpha-synuclein (α-syn) and leucine-rich repeat kinase 2 (LRRK2) play crucial roles in Parkinson’s disease (PD). They may functionally interact to induce the degeneration of dopaminergic (DA) neurons via mechanisms that are not yet fully understood. We previously showed that the C-terminal portion of LRRK2 (ΔLRRK2) with the G2019S mutation (ΔLRRK2^G2019S) was sufficient to induce neurodegeneration of DA neurons in vivo, suggesting that mutated LRRK2 induces neurotoxicity through mechanisms that are (i) independent of the N-terminal domains and (ii) “cell-autonomous”. Here, we explored whether ΔLRRK2^G2019S could modify α-syn toxicity through these two mechanisms. We used a co-transduction approach in rats with AAV vectors encoding ΔLRRK2^G2019S or its “dead” kinase form, ΔLRRK2^DK, and human α-syn with the A53T mutation (AAV-α-syn^A53T). Behavioral and histological evaluations were performed at 6- and 15-weeks post-injection. Results showed that neither form of ΔLRRK2 alone induced the degeneration of neurons at these post-injection time points. By contrast, injection of AAV-α-syn^A53T alone resulted in motor signs and degeneration of DA neurons. Co-injection of AAV-α-syn^A53T with AAV-ΔLRRK2^G2019S induced DA neuron degeneration that was significantly higher than that induced by AAV-α-syn^A53T alone or with AAV-ΔLRRK2^DK. Thus, mutated α-syn neurotoxicity can be enhanced by the C-terminal domain of LRRK2^G2019 alone^, through cell-autonomous mechanisms.     

Parameterized complexity of candidate control in elections and related digraph problems

There are different ways for an external agent to influence the outcome of an election. We concentrate on “control” by adding or deleting candidates. Our main focus is to investigate the parameterized complexity of various control problems for different voting systems. To this end, we introduce natural digraph problems that may be of independent interest. They help in determining the parameterized complexity of control for different voting systems including Llull, Copeland, and plurality voting. Devising several parameterized reductions, we provide an overview of the parameterized complexity of the digraph and control problems with respect to natural parameters such as adding/deleting only a bounded number of candidates or having only few voters.     

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion

For directed and undirected graphs, we study how to make a distinguished vertex the unique minimum-(in)degree vertex through deletion of a minimum number of vertices. The corresponding NP-hard optimization problems are motivated by applications concerning control in elections and social network analysis. Continuing previous work for the directed case, we show that the problem is W[2]-hard when parameterized by the graph’s feedback arc set number, whereas it becomes fixed-parameter tractable when combining the parameters “feedback vertex set number” and “number of vertices to delete”. For the so far unstudied undirected case, we show that the problem is NP-hard and W[1]-hard when parameterized by the “number of vertices to delete”. On the positive side, we show fixed-parameter tractability for several parameterizations measuring tree-likeness. In particular, we provide a dynamic programming algorithm for graphs of bounded treewidth and a vertex-linear problem kernel with respect to the parameter “feedback edge set number”. On the contrary, we show a non-existence result concerning polynomial-size problem kernels for the combined parameter “vertex cover number and number of vertices to delete”, implying corresponding non-existence results when replacing vertex cover number by treewidth or feedback vertex set number.