Related papers: Pick Up Sticks
The sticking of a soft polystyrene colloidal particle to a planar glass plate was studied by a microrheological technique using an optical tweezer to trap the particle and a piezoelectric-stage to position the plate and to sinusoidally…
For a class of stationary regularly varying and weakly dependent time series, we prove the so-called complete convergence result for the corresponding space-time point processes. As an application of our main theorem, we give a simple proof…
We present new criteria on the existence of fixed points that combine some monotonicity assumptions with the classical fixed point index theory. As an illustrative application, we use our theoretical results to prove the existence of…
Stacking is a general approach for combining multiple models toward greater predictive accuracy. It has found various application across different domains, ensuing from its meta-learning nature. Our understanding, nevertheless, on how and…
Theoretical computer science discusses foundational issues about computations. It asks and answers questions such as "What is a computation?", "What is computable?", "What is efficiently computable?","What is information?", "What is…
Order picking is the problem of collecting a set of products in a warehouse in a minimum amount of time. It is currently a major bottleneck in supply-chain because of its cost in time and labor force. This article presents two exact and…
It has long been known that scientific output proceeds on an exponential increase, or more properly, a logistic growth curve. The interplay between effort and discovery is clear, and the nature of the functional form has been thought to be…
In a companion paper, we discuss students' ability to take advantage of what they learn from a solved problem and transfer their learning to solve a quiz problem that has different surface features but the same underlying physics…
Numerous soft materials jam into an amorphous solid at high packing fraction. This non-equilibrium phase transition is best understood in the context of a model system in which particles repel elastically when they overlap. Recently,…
We present several application of simple topological arguments in problems of Kolmogorov complexity. Basically we use the standard fact from topology that the disk is simply connected. It proves to be enough to construct strings with some…
We show that Pinney's equation [2] with a constant coefficient can be reduced to its linear part by a simple change of variables. Also, Pinney's original solution is simplified slightly.
We survey key techniques and results from approximation theory in the context of uniform approximations to real functions such as e^{-x}, 1/x, and x^k. We then present a selection of results demonstrating how such approximations can be used…
We give a combinatorial proof via a sign-reversing involution for a new identity that generalizes both the Hockey Stick Identity and the Big Hockey Stick and Pucks Identity.
We prove that if our calculating capability is that of a universal Turing machine with a finite tape, then Church's thesis is true. This way we accomplish Post (1936) program.
Until now, Computer Scientists have concerned themselves with identifying efficient algorithms for solving the general case of some problem -- that is finding one which performs well when the size of the input tends to infinity. In this…
This study describes a vision, how technology can help improving the efficiency in research. We propose a new clean-slate design, where more emphasis is given on the correctness and up-to-dateness of the scientific results, it is more open…
The problem of accretion of small particles by a sphere embedded in a mean flow is studied in the case where the particles undergo inelastic collisions with the solid object. The collision efficiency, which gives the flux of particles…
We prove some general theorems for preserving Dependent Choice when taking symmetric extensions, some of which are unwritten folklore results. We apply these to various constructions to obtain various simple consistency proofs.
By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.
Inference is the process of using facts we know to learn about facts we do not know. A theory of inference gives assumptions necessary to get from the former to the latter, along with a definition for and summary of the resulting…