Estimating the age of renal tumors

We present a Bayesian method for estimating the age of a renal tumor given its size. We use a model of tumor growth based on published data from observations of untreated tumors. We find, for example, that the median age of a 5 cm tumor is 20 years, with interquartile range 16-23 and 90% confidence interval 11-30 years.Comment: 3 pages, 3 figure

Heat-shrink plastic tubing seals joints in glass tubing

Small units of standard glass apparatus held together by short lengths of transparent heat-shrinkable polyolefin tubing. The tubing is shrunk over glass O-ring type connectors having O-rings but no lubricant

Against Amnesia: Re-Imagining Central Banking

The purpose of the present paper is to identify and challenge contemporary adherence to the core of the prevailing monetary policy consensus. This consensus consists of what we call the holy trinity of the inflation targeting paradigm: price stability as the primary goal of the central bank; central bank independence as the institutional arrangement; and the short-term interest rate as the operational target. Drawing on the literature on the history and political economy of central banking, we argue that the inability to think beyond this holy trinity stems from a severe case of collective institutional amnesia and comes at a heavy cost. We highlight that monetary policy can be deployed towards social purposes other than controlling inflation, in institutional configurations other than isolation from the rest of the government and with instruments other than interest rate manipulation. One central message is that whereas central banks are commonly portrayed as commanding only one instrument, in reality they have a battery of instruments at their disposal. We should think of central banking not as a hammer – a tool to hit inflation where it rears its ugly head – but as a Swiss army knife – a multi-purpose tool with many instruments. Doing so will help overcome the collective amnesia that stands in the way of an enlightened debate about how the power of central banking can – and perhaps should – be harnessed in the pursuit of collective social goals.1 Introduction 2 The Holy Trinity 3 Historical Specificity 3.1 Pre-War 3.2 Post-War, Pre-Inflation 3.3 Holy Trinity 3.4 Shoring up the Holy Trinity: The Tinbergen Rule 4 Beyond the Tinbergen Rule: A Swiss Army Knife Theory of Central Banking 4.1 Lender of Last Resort 4.2 Financial Market-Shaping I: Monetary Policy Implementation 4.3 Financial Market-Shaping II: Monetary Policy Transmission 5 Conclusion Reference

Monolithic microwave integrated circuits: Interconnections and packaging considerations

Monolithic microwave integrated circuits (MMIC's) above 18 GHz were developed because of important potential system benefits in cost reliability, reproducibility, and control of circuit parameters. The importance of interconnection and packaging techniques that do not compromise these MMIC virtues is emphasized. Currently available microwave transmission media are evaluated to determine their suitability for MMIC interconnections. An antipodal finline type of microstrip waveguide transition's performance is presented. Packaging requirements for MMIC's are discussed for thermal, mechanical, and electrical parameters for optimum desired performance

An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains

It is known that the First-Fit algorithm for partitioning a poset P into chains uses relatively few chains when P does not have two incomparable chains each of size k. In particular, if P has width w then Bosek, Krawczyk, and Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010) proved an upper bound of ckw^{2} on the number of chains used by First-Fit for some constant c, while Joret and Milans (Order, 28(3):455--464, 2011) gave one of ck^{2}w. In this paper we prove an upper bound of the form ckw. This is best possible up to the value of c.Comment: v3: referees' comments incorporate

Autonomy Infused Teleoperation with Application to BCI Manipulation

Robot teleoperation systems face a common set of challenges including latency, low-dimensional user commands, and asymmetric control inputs. User control with Brain-Computer Interfaces (BCIs) exacerbates these problems through especially noisy and erratic low-dimensional motion commands due to the difficulty in decoding neural activity. We introduce a general framework to address these challenges through a combination of computer vision, user intent inference, and arbitration between the human input and autonomous control schemes. Adjustable levels of assistance allow the system to balance the operator's capabilities and feelings of comfort and control while compensating for a task's difficulty. We present experimental results demonstrating significant performance improvement using the shared-control assistance framework on adapted rehabilitation benchmarks with two subjects implanted with intracortical brain-computer interfaces controlling a seven degree-of-freedom robotic manipulator as a prosthetic. Our results further indicate that shared assistance mitigates perceived user difficulty and even enables successful performance on previously infeasible tasks. We showcase the extensibility of our architecture with applications to quality-of-life tasks such as opening a door, pouring liquids from containers, and manipulation with novel objects in densely cluttered environments

On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT

Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F. The Hitting Set problem parameterized by the size of the solution is a well-known W[2]-complete problem in parameterized complexity theory. In this paper we investigate the complexity of Hitting Set under various structural parameterizations of the input. Our starting point is the folklore result that Hitting Set is polynomial-time solvable if there is a tree T on vertex set U such that the sets in F induce connected subtrees of T. We consider the case that there is a treelike graph with vertex set U such that the sets in F induce connected subgraphs; the parameter of the problem is a measure of how treelike the graph is. Our main positive result is an algorithm that, given a graph G with cyclomatic number k, a collection P of simple paths in G, and an integer t, determines in time 2^{5k} (|G| +|P|)^O(1) whether there is a vertex set of size t that hits all paths in P. It is based on a connection to the 2-SAT problem in multiple valued logic. For other parameterizations we derive W[1]-hardness and para-NP-completeness results.Comment: Presented at the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015. (The statement of Lemma 4 was corrected in this update.

Parameterized Directed kk-Chinese Postman Problem and kk Arc-Disjoint Cycles Problem on Euler Digraphs

In the Directed $k$-Chinese Postman Problem ($k$-DCPP), we are given a connected weighted digraph $G$ and asked to find $k$ non-empty closed directed walks covering all arcs of $G$ such that the total weight of the walks is minimum. Gutin, Muciaccia and Yeo (Theor. Comput. Sci. 513 (2013) 124--128) asked for the parameterized complexity of $k$-DCPP when $k$ is the parameter. We prove that the $k$-DCPP is fixed-parameter tractable. We also consider a related problem of finding $k$ arc-disjoint directed cycles in an Euler digraph, parameterized by $k$. Slivkins (ESA 2003) showed that this problem is W[1]-hard for general digraphs. Generalizing another result by Slivkins, we prove that the problem is fixed-parameter tractable for Euler digraphs. The corresponding problem on vertex-disjoint cycles in Euler digraphs remains W[1]-hard even for Euler digraphs