Likelihood-based encoding models founded on point processes have received significant attention in the literature because of their ability to reveal the information encoded by spiking neural populations. We propose an approximation to the likelihood of a point-process model of neurons that holds under assumptions about the continuous time process that are physiologically reasonable for neural s...

[1] This paper presents an advancement of the recently developed particle-resolved aerosol model PartMC-MOSAIC (Particle Monte Carlo-Model for Simulating Aerosol Interactions and Chemistry) to investigate the impacts of mixing state on cloud droplet formation and to provide a tool for the quantification of errors in cloud properties introduced by simplifying mixing state assumptions. We coupled...

We study a bin packing problem in which a bin can contain at most k items of total size at most 1, where k ≥ 2 is a given parameter. Items are presented one by one in an online fashion. We analyze the best absolute competitive ratio of the problem and prove tight bounds of 2 for any k ≥ 4. Additionally, we present bounds for relatively small values of k with respect to the asymptotic competitiv...

The objectives of this research were to describe the feed sorting, feeding behavior, and feed intake of cows consuming a close-up ration and to determine if these behaviors are affected by competition for access to the feed bunk. Thirty-six dry Holstein cows, consuming a close-up total mixed ration diet, were assigned to 1 of 2 treatments: 1) noncompetitive (1 cow/feed bin) or 2) competitive (2...

We show how to determine the ratio of the transverse velocity of a source to the velocity of emitted particles, using split–bin correlation functions. The technique is to measure S2 and S φ 2 , On leave until 12 October 1993 at: Theory Division, CERN, CH–1211 Geneva 23, Switzerland; Internet: [email protected]. Internet: [email protected]. Internet: [email protected]. ...

The article proposes a heuristic approximation approach to the bin packing problem under multiple objectives. In addition to the traditional objective of minimizing the number of bins, the heterogeneousness of the elements in each bin is minimized, leading to a biobjective formulation of the problem with a tradeoff between the number of bins and their heterogeneousness. An extension of the Best...

Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items, into a minimum size rectangular bin, without overlapping. The restriction is that the items cannot be rotated. The current paper is comparing a greedy algor...

Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items, into a minimum size rectangular bin, without overlapping. The restriction is that the items cannot be rotated. The current paper is comparing a greedy algor...

We study the online bin packing problem, in which a list of items with integral size between 1 to B arrives one at a time. Each item must be assigned in a bin of capacity B upon its arrival without any information on the next items, and the goal is to minimize the number of used bins. We present an asymptotic competitive scheme, i.e., for any > 0, the asymptotic competitive ratio is at most ρ∗ ...

Psocids are an emerging problem in grain storage, handling, and processing facilities in the United States. We used data from two steel bins each containing 32.6 metric tonnes of wheat, Triticum aestivum L., to develop sampling plans for Liposcelis entomophila (Enderlein), Liposcelis decolor (Pearman) (both Psocoptera: Liposcelididae), and a mixture of the two species. Taylor's coefficients a (...