Online Advertising: Overwhelmed or Overjoyed?

Online advertising flooded into my computer and phone during the holiday-selling season: banner ads, email advertising including spam, Facebook ads, sponsored tweets, rich-media ads, pop-ups and pop-unders, and my personal favorite: pre-video ads that slow me down when I’m checking out the sports highlights from the previous night

An Updated Variation on Consumer Shopping – And I Like it

As young boy, one of my most enduring memories of the Christmas season was a train trip to downtown Chicago and Marshall Field’s department store

Will Millennials Fill the Expected Flood of Open Sales Positions?

The aging of the sales workforce is expected to create a glut of open sales positions in the next five years

Political Ads Might Not Change Your Vote- But They May Get You to the Polls

Florida voters were overwhelmed with political ads on their TVs, computers, mobile devices and phones in advance of the recent Florida primary. The television ads pushed traditional product commercials out of prime-time programming and dominated the commercial breaks. Fortunately, the commercials disappeared as quickly as they started...at least until they start up again for the general election

Plato's republic and Swiss democracy

Thesis (M.A.)--Boston University, 1943. This item was digitized by the Internet Archive

Illumination by floodlights

We consider three problems about the illumination of planar regions with floodlights of prescribed angles. Problem 1 is the decision problem: given a wedge W of angle φ ≤ π, n points p1 . . . . . pn in the plane and n angles α1 . . . . . αn such that ∑ni=1 αi ≤ θ, decide whether W can be illuminated by floodlights of angles α1 , . . . , αn placed in some order at the points p1 , . . . , pn and then rotated appropriately. We show that this problem is the exponential time and a specialized version of it (when φ = θ) is in NP. The second problem arises when the n points are in the complementary wedge of W and θ ≥ φ. Boss et al. have shown that a solution exists and gave an O(n log n) algorithm to place the floodlights. Here we give a matching lower bound. Problem 3 involves the illumination of the whole plane. The algorithm of Bose et al. uses an O(n log n) tripartitioning algorithm to reduce problem 3 to problem 2. We give a linear time tripartitioning algorithm of independent interest. © 1998 Elsevier Science B.V

Tail probabilities and almost sure bounds for martingales

This thesis contains a study of martingales. Some well-known results of probability theory are extended to the martingale context. Many of the extensions are best-possible in a sense to be made precise in the relevant part of the text. One result provides a characteristic difference between martingales and sums of independent random variables. Extensions to martingales of certain limit theorems for maxima of suras of independent random variables are given; these results are in a form stronger than those they extend. Finally, a test which discriminates between martingales and independent sums is given