Related papers: POPCORN: A comparison of binary population synthes…
Probabilistic inference procedures are usually coded painstakingly from scratch, for each target model and each inference algorithm. We reduce this effort by generating inference procedures from models automatically. We make this code…
Personalized decision making targets the behavior of a specific individual, while population-based decision making concerns a sub-population resembling that individual. This paper clarifies the distinction between the two and explains why…
We consider the compound capacity of polar codes under successive cancellation decoding for a collection of binary-input memoryless output-symmetric channels. By deriving a sequence of upper and lower bounds, we show that in general the…
We report on the impact of a probabilistic prescription for compact remnant masses and kicks on massive binary population synthesis. We find that this prescription populates the putative mass gap between neutron stars and black holes with…
Mathematically, ternary coding is more efficient than binary coding. It is little used in computation because technology for binary processing is already established and the implementation of ternary coding is more complicated, but remains…
Binary code analysis and comprehension is critical to applications in reverse engineering and computer security tasks where source code is not available. Unfortunately, unlike source code, binary code lacks semantics and is more difficult…
A binarization of a bounded variable $x$ is a linear formulation with variables $x$ and additional binary variables $y_1,\dots, y_k$, so that integrality of $x$ is implied by the integrality of $y_1,\dots, y_k$. A binary extended…
Program synthesis is the task of automatically generating a program consistent with a given specification. A natural way to specify programs is to provide examples of desired input-output behavior, and many current program synthesis…
Bayesian modeling helps applied researchers articulate assumptions about their data and develop models tailored for specific applications. Thanks to good methods for approximate posterior inference, researchers can now easily build, use,…
We extend the models presented in Mordasini et al. (2009) to the formation of planets orbiting stars of different masses. We discuss the properties of the resulting synthetic planet population in terms of mass, orbit, and metallicity…
Given two binary codes of length n, using Plotkin construction we obtain a code of length 2n. The construction works for linear and nonlinear codes. For the linear case, it is straightforward to see that the dimension of the final code is…
Binary rewriting is a rapidly-maturing technique for modifying software for instrumentation, customization, optimization, and hardening without access to source code. Unfortunately, the practical applications of binary rewriting tools are…
Numerical-relativity simulations offer a unique approach to investigating the dynamics of binary neutron star mergers and provide the most accurate predictions of waveforms in the late inspiral phase. However, the numerical predictions are…
We consider list versions of sparse approximation problems, where unlike the existing results in sparse approximation that consider situations with unique solutions, we are interested in multiple solutions. We introduce these problems and…
We present the results of a survey of N-body simulations aimed at exploring the evolution of compact binaries in multiple-population globular clusters.We show that as a consequence of the initial differences in the structural properties of…
Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the successive-cancellation decoder, which decodes in a bit-…
Numerical simulations have now shown that Population III (Pop III) stars can form in binaries and small clusters and that these stars can be in close proximity to each other. If so, they could be subject to binary interactions such as mass…
We now know that a large number of stars are born in multiple systems. Additionally, more than 70% of massive stars are found in close binary systems, meaning that they will interact over the course of their lifetime. This has strong…
The properties of precessing, coalescing binary black holes are presently inferred through comparison with two approximate models of compact binary coalescence. In this work we show these two models often disagree substantially when…
A lower bound on minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of generalized cosets of the codes generated by bottom rows of the polarizing matrix. Moreover, a construction of…