Specification of Dendritogenesis Site in Drosophila aCC Motoneuron by Membrane Enrichment of Pak1 through Dscam1

SummaryPrecise positioning of dendritic branches is a critical step in the establishment of neuronal circuitry. However, there is limited knowledge on how environmental cues translate into dendrite initiation or branching at a specific position. Here, through a combination of mutation, RNAi, and imaging experiments, we found that a Dscam-Dock-Pak1 hierarchical interaction defines the stereotypical dendrite growth site in the Drosophila aCC motoneuron. This interaction localizes the Cdc42 effector Pak1 to the plasma membrane at the dendrite initiation site before the activation of Cdc42. Ectopic expression of membrane-anchored Pak1 overrides this spatial specification of dendritogenesis, confirming its function in guiding Cdc42 signaling. We further discovered that Dscam1 localization in aCC occurs through an inter-neuronal contact that involves Dscam1 in the partner MP1 neuron. These findings elucidate a mechanism by which Dscam1 controls neuronal morphogenesis through spatial regulation of Cdc42 signaling and, subsequently, cytoskeletal remodeling

Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game

We study the variant of the stable marriage problem in which the preferences of the agents are allowed to include indifferences. We present a mechanism for producing Pareto-stable matchings in stable marriage markets with indifferences that is group strategyproof for one side of the market. Our key technique involves modeling the stable marriage market as a generalized assignment game. We also show that our mechanism can be implemented efficiently. These results can be extended to the college admissions problem with indifferences

Multiple diffusion pathways in LixNi0.77Co0.14Al0.09O2 (NCA) Li-ion battery cathodes

Experimental evidence for the presence of two computationally theorised diffusion pathways, namely the oxygen dumbbell hop (ODH) and tetrahedral site hop (TSH), has been given for the first time by muon spin relaxation (µSR) on sub-stoichiometric LixNi0.77Co0.14Al0.09O2. µSR has proven to be a powerful tool that is able to discriminate between diffusion pathways that occur on different timescales on a local level, where bulk electrochemical techniques cannot. Whereas the estimated values of DLi at lithium concentrations of 0.87 and 0.71 were found to be on the order of 10-11 by electrochemical impedance spectroscopy, contributions to diffusion from ODH and TSH were determined to be on the order of 10-11 and 10-10 cm2 s-1, and a factor of four decrease in Ea for both samples, in excellent agreement with theoretical calculations on related compounds. Rietveld refinement of both X-ray and neutron diffraction data was also used to interrogate the local structure of the materials where no contribution from Li+/Ni2+ cation mixing was observed

Synthesis and Characterization of Stoichiometric Spinel-LiMn₂O₄

In this study, spinel LiMn2O4 powder was synthesized from LiOH.H2O and MnOx by conventional and mechanical alloying (MA) methods, followed by heat treatment at 800 °C in O2 for four hours with cooling to room temperature in the furnace at 60 °C/h. It is found that both samples do not show phase transition in low temperature, and this occurred for different reasons. In the MA sample, the presence of Fe as contamination increased the Mn valence and hindered the occurrence of phase transition. The conventional sample does not show phase transition at low temperature due to stoichiometric content, without any contamination. In general, the absence of phase transition occurred due to synthesis condition employed in this study.</span

Synthesis and Characterization of Stoichiometric Spinel-LiMn2O4

In this study, spinel LiMn2O4 powder was synthesized from LiOH.H2O and MnOx by conventional and mechanical alloying (MA) methods, followed by heat treatment at 800 °C in O2 for four hours with cooling to room temperature in the furnace at 60 °C/h. It is found that both samples do not show phase transition in low temperature, and this occurred for different reasons. In the MA sample, the presence of Fe as contamination increased the Mn valence and hindered the occurrence of phase transition. The conventional sample does not show phase transition at low temperature due to stoichiometric content, without any contamination. In general, the absence of phase transition occurred due to synthesis condition employed in this study

Controllable Laser Ion Acceleration

In this paper a future laser ion accelerator is discussed to make the laser-based ion accelerator compact and controllable. Especially a collimation device is focused in this paper. The future laser ion accelerator should have an ion source, ion collimators, ion beam bunchers, and ion post acceleration devices [Laser Therapy 22, 103(2013)]: the ion particle energy and the ion energy spectrum are controlled to meet requirements for a future compact laser ion accelerator for ion cancer therapy or for other purposes. The energy efficiency from the laser to ions is improved by using a solid target with a fine sub-wavelength structure or a near-critical density gas plasma. The ion beam collimation is performed by holes behind the solid target or a multi-layered solid target. The control of the ion energy spectrum and the ion particle energy, and the ion beam bunching would be successfully realized by a multistage laser-target interaction

Many-to-one matchings with lower quotas : algorithms and complexity

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (AUP,E) with weights on the edges in E, and with lower and upper quotas on the vertices in P. We seek a maximum weight many-toone matching satisfying two sets of constraints: vertices in A are incident to at most one matching edge, while vertices in P are either unmatched or they are incident to a number of matching edges between their lower and upper quota. This problem, which we call maximum weight many-toone matching with lower and upper quotas (wmlq), has applications to the assignment of students to projects within university courses, where there are constraints on the minimum and maximum numbers of students that must be assigned to each project. In this paper, we provide a comprehensive analysis of the complexity of wmlq from the viewpoints of classic polynomial time algorithms, fixed-parameter tractability, as well as approximability. We draw the line between NP-hard and polynomially tractable instances in terms of degree and quota constraints and provide efficient algorithms to solve the tractable ones. We further show that the problem can be solved in polynomial time for instances with bounded treewidth; however, the corresponding runtime is exponential in the treewidth with the maximum upper quota umax as basis, and we prove that this dependence is necessary unless FPT = W[1]. Finally, we also present an approximation algorithm for the general case with performance guarantee umax+1, which is asymptotically best possible unless P = NP