Dense kernel matrices $Theta in mathbb{R}^{N imes N}$ obtained from point evaluations of a covariance function $G$ at locations ${ x_{i} }_{1 leq i leq N} subset mathbb{R}^{d}$ arise in statistics, machine learning, and numerical analysis. For covariance functions that are Green's functions of elliptic boundary value problems and homogeneously-distributed sampling points, we show how to identify a subset $S subset { 1 , dots , N }^2$, with $# S = O ( N log (N) log^{d} ( N /epsilon ) )$, such that the zero fill-in incomplete Cholesky factorisation of the sparse matrix $Theta_{ij} 1_{( i, j ) in S}$ is an $epsilon$-approximation of $Theta$. This factorisation can provably be obtained in complexity $O ( N log( N ) log^{d}( N /epsilon) )$ in space and $O ( N log^{2}( N ) log^{2d}( N /epsilon) )$ in time, improving upon the state of the art for general elliptic operators; we further present numerical evidence that $d$ can be taken to be the intrinsic dimension of the data set rather than that of the ambient space. The algorithm only needs to know the spatial configuration of the $x_{i}$ and does not require an analytic representation of $G$. Furthermore, this factorization straightforwardly provides an approximate sparse PCA with optimal rate of convergence in the operator norm. Hence, by using only subsampling and the incomplete Cholesky factorization, we obtain, at nearly linear complexity, the compression, inversion and approximate PCA of a large class of covariance matrices. By inverting the order of the Cholesky factorization we also obtain a solver for elliptic PDE with complexity $O ( N log^{d}( N /epsilon) )$ in space and $O ( N log^{2d}( N /epsilon) )$ in time, improving upon the state of the art for general elliptic operators.

We analyze the computational complexity of motion planning through local "input/output" gadgets with separate entrances and exits, and a subset of allowed traversals from entrances to exits, each of which changes the state of the gadget and thereby the allowed traversals. We study such gadgets in the 0-, 1-, and 2-player settings, in particular extending past motion-planning-through-gadgets work to 0-player games for the first time, by considering "branchless" connections between gadgets that route every gadget's exit to a unique gadget's entrance. Our complexity results include containment in L, NL, P, NP, and PSPACE; as well as hardness for NL, P, NP, and PSPACE. We apply these results to show PSPACE-completeness for certain mechanics in Factorio, [the Sequence], and a restricted version of Trainyard, improving prior results. This work strengthens prior results on switching graphs and reachability switching games.

A system and method for transmitting compressed video. A transmitter receives uncompressed video data from a video source, and compresses it using one or more reference frames. A receiver receives the compressed video data and decodes it, using the same reference frames, to form display data. The reference frames are stored in compressed form in both the transmitter and the receiver. Each frame of display data becomes a reference frame for the decoding of a subsequent frame.

I'm getting so very tired of safety/accident researchers claiming that root cause analysis is an invalid, blame-focused practice that ignores systems and complexity. Most root cause investigators that I know are pretty well oriented towards process, organization, and system issues as the fundamental sources underlying problems and accidents... and even some of our simplest analysis […]

My previous post about root causes in complex systems, in retrospect, looks a little bit like a rant. That doesn't bother me too much, really... but I wish I had included the following info: it is one way to go about resolving the mess that complex systems can make of your root cause analysis. Basically, when […]

Less than half of global CEOs believe their enterprises are adequately prepared to handle a highly volatile, increasingly complex business environment, according to a major new survey by IBM of more than 1,500 Chief Executive Officers from 60 countries and 33 industries worldwide, including 22 respondents from New Zealand – the largest number of respondents in eight years of research.

Pierre Lairez
J. Amer. Math. Soc. 33 (2019), 487-526.
Abstract, references and article information

Protein phosphatase 2A (PP2A) is a large enzyme family responsible for most cellular Ser/Thr dephosphorylation events. PP2A substrate specificity, localization, and regulation by second messengers rely on more than a dozen regulatory subunits (including B/R2, B'/R5, and B″/R3), which form the PP2A heterotrimeric holoenzyme by associating with a dimer comprising scaffolding (A) and catalytic (C) subunits. Because of partial redundancy and high endogenous expression of PP2A holoenzymes, traditional approaches of overexpressing, knocking down, or knocking out PP2A regulatory subunits have yielded only limited insights into their biological roles and substrates. To this end, here we sought to reduce the complexity of cellular PP2A holoenzymes. We used tetracycline-inducible expression of pairs of scaffolding and regulatory subunits with complementary charge-reversal substitutions in their interaction interfaces. For each of the three regulatory subunit families, we engineered A/B charge–swap variants that could bind to one another, but not to endogenous A and B subunits. Because endogenous Aα was targeted by a co-induced shRNA, endogenous B subunits were rapidly degraded, resulting in expression of predominantly a single PP2A heterotrimer composed of the A/B charge–swap pair and the endogenous catalytic subunit. Using B'δ/PPP2R5D, we show that PP2A complexity reduction, but not PP2A overexpression, reveals a role of this holoenzyme in suppression of extracellular signal–regulated kinase signaling and protein kinase A substrate dephosphorylation. When combined with global phosphoproteomics, the PP2A/B'δ reduction approach identified consensus dephosphorylation motifs in its substrates and suggested that residues surrounding the phosphorylation site play roles in PP2A substrate specificity.

Protein phosphatase 2A (PP2A) is a large enzyme family responsible for most cellular Ser/Thr dephosphorylation events. PP2A substrate specificity, localization, and regulation by second messengers rely on more than a dozen regulatory subunits (including B/R2, B'/R5, and B″/R3), which form the PP2A heterotrimeric holoenzyme by associating with a dimer comprising scaffolding (A) and catalytic (C) subunits. Because of partial redundancy and high endogenous expression of PP2A holoenzymes, traditional approaches of overexpressing, knocking down, or knocking out PP2A regulatory subunits have yielded only limited insights into their biological roles and substrates. To this end, here we sought to reduce the complexity of cellular PP2A holoenzymes. We used tetracycline-inducible expression of pairs of scaffolding and regulatory subunits with complementary charge-reversal substitutions in their interaction interfaces. For each of the three regulatory subunit families, we engineered A/B charge–swap variants that could bind to one another, but not to endogenous A and B subunits. Because endogenous Aα was targeted by a co-induced shRNA, endogenous B subunits were rapidly degraded, resulting in expression of predominantly a single PP2A heterotrimer composed of the A/B charge–swap pair and the endogenous catalytic subunit. Using B'δ/PPP2R5D, we show that PP2A complexity reduction, but not PP2A overexpression, reveals a role of this holoenzyme in suppression of extracellular signal–regulated kinase signaling and protein kinase A substrate dephosphorylation. When combined with global phosphoproteomics, the PP2A/B'δ reduction approach identified consensus dephosphorylation motifs in its substrates and suggested that residues surrounding the phosphorylation site play roles in PP2A substrate specificity.

Jean-Francois Chassagneux and Camilo A. Garcia Trillos
Math. Comp. 89 (2020), 1895-1932.
Abstract, references and article information

Boris Adamczewski, Julien Cassaigne and Marion Le Gonidec
Trans. Amer. Math. Soc. 373 (2020), 3085-3115.
Abstract, references and article information

Protein phosphatase 2A (PP2A) is a large enzyme family responsible for most cellular Ser/Thr dephosphorylation events. PP2A substrate specificity, localization, and regulation by second messengers rely on more than a dozen regulatory subunits (including B/R2, B'/R5, and B″/R3), which form the PP2A heterotrimeric holoenzyme by associating with a dimer comprising scaffolding (A) and catalytic (C) subunits. Because of partial redundancy and high endogenous expression of PP2A holoenzymes, traditional approaches of overexpressing, knocking down, or knocking out PP2A regulatory subunits have yielded only limited insights into their biological roles and substrates. To this end, here we sought to reduce the complexity of cellular PP2A holoenzymes. We used tetracycline-inducible expression of pairs of scaffolding and regulatory subunits with complementary charge-reversal substitutions in their interaction interfaces. For each of the three regulatory subunit families, we engineered A/B charge–swap variants that could bind to one another, but not to endogenous A and B subunits. Because endogenous Aα was targeted by a co-induced shRNA, endogenous B subunits were rapidly degraded, resulting in expression of predominantly a single PP2A heterotrimer composed of the A/B charge–swap pair and the endogenous catalytic subunit. Using B'δ/PPP2R5D, we show that PP2A complexity reduction, but not PP2A overexpression, reveals a role of this holoenzyme in suppression of extracellular signal–regulated kinase signaling and protein kinase A substrate dephosphorylation. When combined with global phosphoproteomics, the PP2A/B'δ reduction approach identified consensus dephosphorylation motifs in its substrates and suggested that residues surrounding the phosphorylation site play roles in PP2A substrate specificity.

Mitt Romney wants to round up 12 million illegal immigrants and deport them. John Edwards wants to put an end to lobbyists. All the Democratic and Republican presidential candidates rail against the ways of Washington.

This paper considers online convex optimization over a complicated constraint set, which typically consists of multiple functional constraints and a set constraint. The conventional online projection algorithm (Zinkevich, 2003) can be difficult to implement due to the potentially high computation complexity of the projection operation. In this paper, we relax the functional constraints by allowing them to be violated at each round but still requiring them to be satisfied in the long term. This type of relaxed online convex optimization (with long term constraints) was first considered in Mahdavi et al. (2012). That prior work proposes an algorithm to achieve $O(sqrt{T})$ regret and $O(T^{3/4})$ constraint violations for general problems and another algorithm to achieve an $O(T^{2/3})$ bound for both regret and constraint violations when the constraint set can be described by a finite number of linear constraints. A recent extension in Jenatton et al. (2016) can achieve $O(T^{max{ heta,1- heta}})$ regret and $O(T^{1- heta/2})$ constraint violations where $ hetain (0,1)$. The current paper proposes a new simple algorithm that yields improved performance in comparison to prior works. The new algorithm achieves an $O(sqrt{T})$ regret bound with $O(1)$ constraint violations.

Dual first-order methods are essential techniques for large-scale constrained convex optimization. However, when recovering the primal solutions, we need $T(epsilon^{-2})$ iterations to achieve an $epsilon$-optimal primal solution when we apply an algorithm to the non-strongly convex dual problem with $T(epsilon^{-1})$ iterations to achieve an $epsilon$-optimal dual solution, where $T(x)$ can be $x$ or $sqrt{x}$. In this paper, we prove that the iteration complexity of the primal solutions and dual solutions have the same $Oleft(frac{1}{sqrt{epsilon}} ight)$ order of magnitude for the accelerated randomized dual coordinate ascent. When the dual function further satisfies the quadratic functional growth condition, by restarting the algorithm at any period, we establish the linear iteration complexity for both the primal solutions and dual solutions even if the condition number is unknown. When applied to the regularized empirical risk minimization problem, we prove the iteration complexity of $Oleft(nlog n+sqrt{frac{n}{epsilon}} ight)$ in both primal space and dual space, where $n$ is the number of samples. Our result takes out the $left(log frac{1}{epsilon} ight)$ factor compared with the methods based on smoothing/regularization or Catalyst reduction. As far as we know, this is the first time that the optimal $Oleft(sqrt{frac{n}{epsilon}} ight)$ iteration complexity in the primal space is established for the dual coordinate ascent based stochastic algorithms. We also establish the accelerated linear complexity for some problems with nonsmooth loss, e.g., the least absolute deviation and SVM.

Qian Qin, James P. Hobert.

Source: The Annals of Statistics, Volume 47, Number 4, 2320--2347.

Abstract:
The use of MCMC algorithms in high dimensional Bayesian problems has become routine. This has spurred so-called convergence complexity analysis, the goal of which is to ascertain how the convergence rate of a Monte Carlo Markov chain scales with sample size, $n$, and/or number of covariates, $p$. This article provides a thorough convergence complexity analysis of Albert and Chib’s [ J. Amer. Statist. Assoc. 88 (1993) 669–679] data augmentation algorithm for the Bayesian probit regression model. The main tools used in this analysis are drift and minorization conditions. The usual pitfalls associated with this type of analysis are avoided by utilizing centered drift functions, which are minimized in high posterior probability regions, and by using a new technique to suppress high-dimensionality in the construction of minorization conditions. The main result is that the geometric convergence rate of the underlying Markov chain is bounded below 1 both as $n ightarrowinfty$ (with $p$ fixed), and as $p ightarrowinfty$ (with $n$ fixed). Furthermore, the first computable bounds on the total variation distance to stationarity are byproducts of the asymptotic analysis.

This paper studies the relationship between bank geographic complexity and risk. We use a unique dataset of 96 bank holding companies around the world to measure the geographic dispersion of their affiliates. We study how this dispersion interacts with economic and regulatory conditions to affect the riskiness of the bank.

Children with medical complexity are high users of acute health care, but little is known about their service use across the continuum of care services and in the context of overall health care expenditures.

Although accounting for <1% of the child population, children with medical complexity use almost one-third of all pediatric health care expenditures and make multiple transitions across providers and health care settings. (Read the full article)

Few reports have explored the measurement validity of the relative value unit (RVU) system, particularly in pediatrics. The RVU system, although broadly applied in health care settings, was developed for the adult population and thus may possess unique inadequacies in pediatrics.

We found deficiencies in the ability of the RVU system to capture features of case mix complexity and differences related to age. Additional investigation may be warranted to determine the validity of RVU as a measurement tool in pediatrics. (Read the full article)

Quality measures developed by the Pediatric Quality Measures Program are required to assess disparities in performance according to special health care need status. Methods are needed to identify children according to level of medical complexity in administrative data.

The Pediatric Medical Complexity Algorithm is a new, publicly available algorithm that identifies the small proportion of children with complex chronic disease in Medicaid claims and hospital discharge data with good sensitivity and good to excellent specificity. (Read the full article)

Children with medical complexity require a disproportionate amount of health services due to a multitude of chronic severe illness, and their impact on the health care system appears to be increasing.

This study provides one of the first comparisons of health care utilization patterns for children with medical complexity between medical centers in a population-based cohort. (Read the full article)

BACKGROUND AND OBJECTIVES:

Children with medical complexity (CMC) comprise only 6% of the pediatric population, account for ~40% of pediatric health care spending, and provide an important opportunity for cost saving. Savings in this group can have an important impact on pediatric health care costs. The objective of this study was to assess the impact of a multicenter care management program on spending and use in CMC.

NEW CASTLE (May 30, 2018) – As a way to better support the needs of children with medical complexity and their families, the Division of Medicaid and Medical Assistance this week released Delaware’s Plan for Managing the Health Care Needs of Children with Medical Complexity and announced that stakeholders will continue work to develop longer-term […]

ABSTRACT

Pneumocystis, a major opportunistic pathogen in patients with a broad range of immunodeficiencies, contains abundant surface proteins encoded by a multicopy gene family, termed the major surface glycoprotein (Msg) gene superfamily. This superfamily has been identified in all Pneumocystis species characterized to date, highlighting its important role in Pneumocystis biology. In this report, through a comprehensive and in-depth characterization of 459 msg genes from 7 Pneumocystis species, we demonstrate, for the first time, the phylogeny and evolution of conserved domains in Msg proteins and provide a detailed description of the classification, unique characteristics, and phylogenetic relatedness of five Msg families. We further describe, for the first time, the relative expression levels of individual msg families in two rodent Pneumocystis species, the substantial variability of the msg repertoires in P. carinii from laboratory and wild rats, and the distinct features of the expression site for the classic msg genes in Pneumocystis from 8 mammalian host species. Our analysis suggests multiple functions for this superfamily rather than just conferring antigenic variation to allow immune evasion as previously believed. This study provides a rich source of information that lays the foundation for the continued experimental exploration of the functions of the Msg superfamily in Pneumocystis biology.

IMPORTANCE Pneumocystis continues to be a major cause of disease in humans with immunodeficiency, especially those with HIV/AIDS and organ transplants, and is being seen with increasing frequency worldwide in patients treated with immunodepleting monoclonal antibodies. Annual health care associated with Pneumocystis pneumonia costs ~$475 million dollars in the United States alone. In addition to causing overt disease in immunodeficient individuals, Pneumocystis can cause subclinical infection or colonization in healthy individuals, which may play an important role in species preservation and disease transmission. Our work sheds new light on the diversity and complexity of the msg superfamily and strongly suggests that the versatility of this superfamily reflects multiple functions, including antigenic variation to allow immune evasion and optimal adaptation to host environmental conditions to promote efficient infection and transmission. These findings are essential to consider in developing new diagnostic and therapeutic strategies.

Turkey is the jurisdiction with the world's most complex tax and accounting requirements, according to a new report by TMF Group.

The main hallmarks of the global financial crisis were too-big-to-fail institutions taking on too much risk with other people’s money: excess leverage and default pressure resulting from contagion and counterparty risk. This paper looks at whether the Basel III reforms address these issues effectively and proposes improvements to the current reform proposals.

As a young student with journalistic ambitions, the broadcaster and former Radio 4 Today programme presenter James Naughtie spent the summer of 1970 in America.

Here's a selection of Business Standard Opinion pieces for the day

Berlin, Germany : Springer, [2019]

Online Resource

Online Resource

Online Resource

Dewey Library - QA614.7.K37 2020

Online Resource

Hayden Library - P118.R44 2019

IEEE / Institute of Electrical and Electronics Engineers Incorporated

Naylor, Michael P., author

Interview with Stephen W. Waldo, MD, author of Association of Coronary Anatomical Complexity With Clinical Outcomes After Percutaneous or Surgical Revascularization in the Veterans Affairs Clinical Assessment Reporting and Tracking Program

Rotch Library - HT165.5.O2 2019

Rotch Library - HT371.R83 2019

Online Resource