428,198 research outputs found
David M. Strong, Greenville
No full textStrong requests supplies of beef, flour and whiskey for Wyandot Indians.Document signed by Strong
James Bond: international man of gastronomy
No full textThis article is concerned with the representation of food and drink in Ian Fleming’s James Bond novels. In particular, it examines how the author uses Bond’s culinary knowledge and habits of consumption as an important constituent of his hero’s character. Similarly, the food choices of other characters, notably villains, are shown to be linked, by Fleming, to core aspects of their identity − principally their ethnicity. Bond’s impulse to observe and classify, very much in evidence in the novels’ food sequences, is examined in terms of the texts’ construction of Bond as a skilled identifier of signs
Philip Strong letter to Reuben Wood, January 27, 1852
No full textLegal correspondence written by Philip Strong to Governor Reuben Wood regarding a warrant to arrest Peyton Polly, dated January 27, 1852.
Reuben Wood was governor of Ohio from 1850 through 1853, and was closely involved with the Peyton Polly case and attempts to secure the Polly family's release. Peyton Polly and his family were freedmen living in Lawrence County, Ohio, when they were kidnapped on June 6, 1850, and sold back into slavery in Kentucky and Virginia
GRAF FUZZY M-STRONG
No full textGraf fuzzy M-strong adalah graf fuzzy kuat (strong) yang diperkenalkan oleh Mordeson dan Peng. Pada operasi graf fuzzy, dipelajari bahwa jika terdapat dua graf fuzzy M-strong G1 dan G2 maka join adalah juga M-strong. Jika cartesian product dan komposisi adalah M-strong maka G1 atau G2 adalah M-strong. Misalkan GC adalah komplemen dari suatu graf fuzzy, dibuktikan bahwa jika G adalah graf fuzzy M-strong. Selanjutnya dipelajari juga mengenai subgraf fuzzy parsial M-strong, dan diperoleh bahwa join dari dua subgraf fuzzy parsial M-strong tersebut adalah M-strong. Diperoleh juga bahwa subgraf fuzzy full spanning dari graf fuzzy M-strong adalah M-strong
Maurice Strong promoting IDRC
No full textFormer IDRC governor Maurice Strong talks about IDRC, its global reputation for excellence and its role in promoting sustainable developmen
Strong stability of Nash equilibria in load balancing games
No full textWe study strong stability of Nash equilibria in the load balancing games of m (m >= 2) identical servers, in which every job chooses one of the m servers and each job wishes to minimize its cost, given by the
workload of the server it chooses.
A Nash equilibrium (NE) is a strategy profile that is resilient to unilateral deviations. Finding an NE in such a game is simple. However, an NE assignment is not stable against coordinated deviations of several jobs, while a strong Nash equilibrium (SNE) is. We study how well an
NE approximates an SNE.
Given any job assignment in a load balancing game, the improvement ratio (IR) of a deviation of a job is defined as the ratio between the pre-and post-deviation costs. An NE is said to be a ρ-approximate SNE (ρ >= 1) if there is no coalition of jobs such that each job of the coalition
will have an IR more than ρ from coordinated deviations of the coalition.
While it is already known that NEs are the same as SNEs in the 2-server load balancing game, we prove that, in the m-server load balancing game for any given m >= 3, any NE is a (5=4)-approximate SNE, which together with the lower bound already established in the literature implies that the approximation bound is tight. This closes the final gap in the literature on the study of approximation of general NEs to SNEs in the load balancing games. To establish our upper bound, we apply with novelty a powerful graph-theoretic tool
- …
