Bone Morphogenetic Protein 4 Targeting Glioma Stem-Like Cells for Malignant Glioma Treatment: Latest Advances and Implications for Clinical **Application**

**application**. Expand abstract.

**application**. We have previously reviewed BMP4 signaling in central nervous system development and glioma tumorigenesis and its’ potential as a treatment target in human gliomas. Recent advances in understanding both adult and pediatric malignant gliomas highlight critical roles of BMP4 signaling pathways in the regulation of tumor biology, and indicate its’ potential as a therapeutic molecule. Furthermore, significant progress has been made on synthesizing BMP4 biocompatible delivery materials, which can bind to and markedly extend BMP4 half-life. Here, we review current research associated with BMP4 in brain tumors, especially in pediatric malignant gliomas. We also summarize BMP4 delivery strategies, with a focus on biocompatible BMP4 binding peptide amphiphile nanostructures as promising novel delivery platforms for treatment of these devastating tumors.

5/10 relevant

Preprints.org

Successive minima and asymptotic slopes in Arakelov Geometry

**applications**to the study of successive minima of hermitian vector spaces. We obtain an absolute transference theorem with a linear upper bound, answering a question raised by Gaudron. We also give new comparisons between successive slopes and absolute minima, extending results of Gaudron and R\'emond.

5/10 relevant

arXiv

Fast Convergence for Langevin Diffusion with Matrix Manifold Structure

**applications**: existence of invariances (symmetries) in the function f, as a result of which the distribution p will have manifolds of points with equal probability. Expand abstract.

**applications**listed above will entail working with functions f that are nonconvex -- for which sampling from p may in general require an exponential number of queries. In this paper, we study one aspect of nonconvexity relevant for modern machine learning applications: existence of invariances (symmetries) in the function f, as a result of which the distribution p will have manifolds of points with equal probability. We give a recipe for proving mixing time bounds of Langevin dynamics in order to sample from manifolds of local optima of the function f in settings where the distribution is well-concentrated around them. We specialize our arguments to classic matrix factorization-like Bayesian inference problems where we get noisy measurements A(XX^T), X \in R^{d \times k} of a low-rank matrix, i.e. f(X) = \|A(XX^T) - b\|^2_2, X \in R^{d \times k}, and \beta the inverse of the variance of the noise. Such functions f are invariant under orthogonal transformations, and include problems like matrix factorization, sensing, completion. Beyond sampling, Langevin dynamics is a popular toy model for studying stochastic gradient descent. Along these lines, we believe that our work is an important first step towards understanding how SGD behaves when there is a high degree of symmetry in the space of parameters the produce the same output.

4/10 relevant

arXiv

Dilation theory: a guided tour

**applications**of dilation theory in operator theory and in function theory. Then, in the second part, I will give a rapid account of a plethora of variants of dilation theory and their

**applications**. In particular, I will discuss dilation theory of completely positive maps and semigroups, as well as the operator algebraic approach to dilation theory. In the last part, I will present relatively new dilation problems in the noncommutative setting which are related to the study of matrix convex sets and operator systems, and are motivated by

**applications**in control theory. These problems include dilating tuples of noncommuting operators to tuples of commuting normal operators with a specified joint spectrum. I will also describe the recently studied problem of determining the optimal constant $c = c_{\theta,\theta'}$, such that every pair of unitaries $U,V$ satisfying $VU = e^{i\theta} UV$ can be dilated to a pair of $cU', cV'$, where $U',V'$ are unitaries that satisfy the commutation relation $V'U' = e^{i\theta'} U'V'$. The solution of this problem gives rise to a new and surprising

**application**of dilation theory to the continuity of the spectrum of the almost Mathieu operator from mathematical physics.

4/10 relevant

arXiv

Dynamic Role-Based Access Control for Decentralized **Applications**

**applications**(dApps). Expand abstract.

**application**. Although there has been significant work in the field of cloud access control mechanisms, however, with the advent of Distributed Ledger Technology (DLT), on-chain access control management frameworks hardly exist. Existing access control management mechanisms are tightly coupled with the business logic, resulting in governance issues, non-coherent with existing Identity Management Solutions, low security, and compromised usability. We propose a novel framework to implement dynamic role-based access control for decentralized

**applications**(dApps). The framework allows for managing access control on a dApp, which is completely decoupled from the business

**application**and integrates seamlessly with any dApps. The smart contract architecture allows for the independent management of business logic and execution of access control policies. It also facilitates secure, low cost, and a high degree of flexibility of access control management. The proposed framework promotes decentralized governance of access control policies and efficient smart contract upgrades. We also provide quantitative and qualitative metrics for the efficacy and efficiency of the framework. Any Turing complete smart contract programming language is an excellent fit to implement the framework. We expect this framework to benefit enterprise and non-enterprise dApps and provide greater access control flexibility and effective integration with traditional and state of the art identity management solutions.

9/10 relevant

arXiv

Work-efficient Batch-incremental Minimum Spanning Trees with
**Applications** to the Sliding Window Model

**applications**that become efficiently solvable in parallel in the sliding-window model, such as graph connectivity, approximate MSTs, testing bipartiteness, $k$-certificates, cycle-freeness, and maintaining sparsifiers.

5/10 relevant

arXiv

Functional specialization of human salivary glands and origins of proteins intrinsic to human saliva

**applications**. Expand abstract.

**applications**. Furthermore, our study represents the first comparative transcriptomic analysis of human adult and fetal exocrine organs, providing evidence that functional specialization occurs late in salivary gland development, and is driven mainly by the transcription of genes encoding secreted saliva proteins. Moreover, we found that dosage of abundant saliva proteins secreted by the salivary glands is primarily regulated at the transcriptional level, and that secreted proteins can be synthesized by distinct subsets of serous acinar cells, revealing hitherto unrecognized heterogeneity in the acinar cell lineage. Our results reveal the functional underpinnings of these secretory organs, paving the way for future investigations into saliva biology and pathology.

4/10 relevant

bioRxiv

Towards Easy Deposit: Lowering the Barriers of Green Open Access with Data Integration and Automation

**application**that is able to harvest newly publications, outreach for manuscript on behalf of the library, and facilitate self-archiving to IR. Expand abstract.

**application**that supports green open access with long-term sustainability and improved user experience of article deposit. Introduction: The lack of library resources and unfriendly repository user interface are two significant barriers that hinder green open access. Tasked to implement the open access mandate, librarians at an American research university developed a comprehensive system called Easy Deposit 2 to automate the support workflow of green open access. Implementation: Easy Deposit 2 is a web

**application**that is able to harvest newly publications, outreach for manuscript on behalf of the library, and facilitate self-archiving to IR. It is developed and maintained by the library and integrated with the IR. Results and Discussion: The article deposit rate is about 25% with Easy Deposit 2, which increases significantly comparing to the previous period. It also serves as a local database for faculty publications with open access status. The lesson learned is that library cannot rely on a single commercial provider for publication data due to mismatched priorities. Conclusion: Recent IT developments provides new opportunities of innovation like Easy Deposit 2 in supporting open access. Academic librarians are vital in promoting "openness" in scholarly communication such as transparency and diversity in the sharing of publication data.

4/10 relevant

Preprints.org

Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent

**applications**in combinatorial optimization, robust learning, and quantum complexity. The current approximate solvers for positive semidefinite programming can handle only pure packing instances, and technical hurdles prevent their generalization to a wider class of positive instances. For a given multiplicative accuracy of $\epsilon$, our algorithm takes $O(\log^3(nd\rho) \cdot \epsilon^{-3})$ parallelizable iterations, where $n$, $d$ are dimensions of the problem and $\rho$ is a width parameter of the instance, generalizing or improving all previous parallel algorithms in the positive linear and semidefinite programming literature. When specialized to pure packing SDPs, our algorithm's iteration complexity is $O(\log^2 (nd) \cdot \epsilon^{-2})$, a slight improvement and derandomization of the state-of-the-art (Allen-Zhu et. al. '16, Peng et. al. '16, Wang et. al. '15). For a wide variety of structured instances commonly found in applications, the iterations of our algorithm run in nearly-linear time. In doing so, we give matrix analytic techniques for overcoming obstacles that have stymied prior approaches to this open problem, as stated in past works (Peng et. al. '16, Mahoney et. al. '16). Crucial to our analysis are a simplification of existing algorithms for mixed positive linear programs, achieved by removing an asymmetry caused by modifying covering constraints, and a suite of matrix inequalities whose proofs are based on analyzing the Schur complements of matrices in a higher dimension. We hope that both our algorithm and techniques open the door to improved solvers for positive semidefinite programming, as well as its

**applications**.

6/10 relevant

arXiv

Eigenvalues of non-hermitian matrices: a dynamical and an iterative
approach. **Application** to a truncated Swanson model

**applications**to physics, and to pseudo-hermitian quantum mechanics in particular. We first consider a {\em dynamical} approach, based on a pair of ordinary differential equations defined in terms of the matrix $A$ and of its adjoint $A^\dagger$. Then we consider an extension of the so-called power method, for which we prove a fixed point theorem for $A\neq A^\dagger$ useful in the determination of the eigenvalues of $A$ and $A^\dagger$. The two strategies are applied to some explicit problems. In particular, we compute the eigenvalues and the eigenvectors of the matrix arising from a recently proposed quantum mechanical system, the {\em truncated Swanson model}, and we check some asymptotic features of the Hessenberg matrix.

8/10 relevant

arXiv