26,798 research outputs found
Recommended from our members
Letter from W. P. Lehmann to Emmett L. Bennett Jr., May 04, 1960
No full textLehmann congratulates (begrudgingly) Bennett's new position at the University of Wisconsin and requests for pages from an unidentified work.Classic
Letter, 1874 May 23, Lafayette, Ind., to G. Slocum Bennett, Wilkes Barre, Pa.
No full textHandwritten letter (copy)
From: George Winter, Lafayette, May 23, 1874
To: G. Slocum Bennett, Wilkes Barre, Pennsylvania
ALS, 3 p. (2 sheets)G.W. has sent Bennett the two paintings he commissioned. John Purdue, who originally purchased them, allowed them to be sent to Bennett, and he will take copies instead. This will allow G.W. to leave immediately for California to be present at his brother's deathbed. G.W. will finish Purdue's copies while there. Bennett can also purchase the portraits of Brouillette and Kick-ke-se-qua for $100, by writing to Gordon Ball. Requests Bennett telegraph him payment for these two works, as G.W. hopes to leave for California on May 28
Benefits of a population: five mechanisms that advantage population-based algorithms
No full textThis paper identifies five distinct mechanisms by which a population-based algorithm might have an advantage over a solo-search algorithm in classical optimization. These mechanisms are illustrated through a number of toy problems. Simulations are presented comparing different search algorithms on these problems. The plausibility of these mechanisms occurring in classical optimization problems is discussed. The first mechanism we consider relies on putting together building blocks from different solutions. This is extended to include problems containing critical variables. The second mechanism is the result of focusing of the search caused by crossover. Also discussed in this context is strong focusing produced by averaging many solutions. The next mechanism to be examined is the ability of a population to act as a low-pass filter of the landscape, ignoring local distractions. The fourth mechanism is a population's ability to search different parts of the fitness landscape, thus hedging against bad luck in the initial position or the decisions it makes. The final mechanism is the opportunity of learning useful parameter values to balance exploration against exploitation
Bennett, G P, SX5981
No full textThis record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/371362Surname: BENNETT
Given Name(s) or Initials: G P
Military Service Number or Last Known Location: SX5981
Missing, Wounded and Prisoner of War Enquiry Card Index Number: 44829181857
Item: [2016.0049.03689] "Bennett, G P, SX5981
Letter, 1874 Apr. 6, Lafayette, Ind., to G. Slocum Bennett, Wilkes Barre, Penn.
No full textHandwritten letter (copy), Incomplete
From: George Winter, Lafayette, April 6, 1874
To: G. Slocum Bennett, Wilkes Barre, Pennsylvania
AL, 5 p. (2 sheets, 1 folded)Acknowledging Bennett's letter of April 3, and providing details of the Slocum-related paintings he saw in G.W.'s studio. The two landscapes, each 25x30, he has sold to John Purdue for 100. G.W. presumes Purdue will present these to the university. Full-length (20x24) portraits of Brouillette and Kick-ke-se-qua would cost 350. If Bennett is interested in placing a commission, G.W. would appreciate being informed as soon as possible. The letter also includes another list of paintings similar to that given in
the body of the letter, but with some slightly different prices
Improved Hardness of BDD and SVP Under Gap-(S)ETH
No full textWe show improved fine-grained hardness of two key lattice problems in the _p norm: Bounded Distance Decoding to within an α factor of the minimum distance (BDD_{p, α}) and the (decisional) γ-approximate Shortest Vector Problem (GapSVP_{p,γ}), assuming variants of the Gap (Strong) Exponential Time Hypothesis (Gap-(S)ETH). Specifically, we show:
1) For all p ∈ [1, ∞), there is no 2^{o(n)}-time algorithm for BDD_{p, α} for any constant α > α_kn, where α_kn = 2^{-c_kn} < 0.98491 and c_kn is the ₂ kissing-number constant, unless non-uniform Gap-ETH is false.
2) For all p ∈ [1, ∞), there is no 2^{o(n)}-time algorithm for BDD_{p, α} for any constant α > α^‡_p, where α^‡_p is explicit and satisfies α^‡_p = 1 for 1 ≤ p ≤ 2, α^‡_p 2, and α^‡_p → 1/2 as p → ∞, unless randomized Gap-ETH is false.
3) For all p ∈ [1, ∞) ⧵ 2 ℤ and all C > 1, there is no 2^{n/C}-time algorithm for BDD_{p, α} for any constant α > α^†_{p, C}, where α^†_{p, C} is explicit and satisfies α^†_{p, C} → 1 as C → ∞ for any fixed p ∈ [1, ∞), unless non-uniform Gap-SETH is false.
4) For all p > p₀ ≈ 2.1397, p ∉ 2ℤ, and all C > C_p, there is no 2^{n/C}-time algorithm for GapSVP_{p, γ} for some constant γ > 1, where C_p > 1 is explicit and satisfies C_p → 1 as p → ∞, unless randomized Gap-SETH is false.
Our results for BDD_{p, α} improve and extend work by Aggarwal and Stephens-Davidowitz (STOC, 2018) and Bennett and Peikert (CCC, 2020). Specifically, the quantities α_kn and α^‡_p (respectively, α^†_{p,C}) significantly improve upon the corresponding quantity α_p^* (respectively, α_{p,C}^*) of Bennett and Peikert for small p (but arise from somewhat stronger assumptions). In particular, Item 1 improves the smallest value of α for which BDD_{p, α} is known to be exponentially hard in the Euclidean norm (p = 2) to an explicit constant α < 1 for the first time under a general-purpose complexity assumption. Items 1 and 3 crucially use the recent breakthrough result of Vlăduţ (Moscow Journal of Combinatorics and Number Theory, 2019), which showed an explicit exponential lower bound on the lattice kissing number. Finally, Item 4 answers a natural question left open by Aggarwal, Bennett, Golovnev, and Stephens-Davidowitz (SODA, 2021), which showed an analogous result for the Closest Vector Problem
P. Bennett, S. -S. Frere, S. Stow, Excavations at Canterbury Castle. Maidstone, éd. du Canterbury Archeological Trust, 1982, 236 et 180 p.
No full textMesqui Jean. P. Bennett, S. -S. Frere, S. Stow, Excavations at Canterbury Castle. Maidstone, éd. du Canterbury Archeological Trust, 1982, 236 et 180 p.. In: Bulletin Monumental, tome 142, n°2, année 1984. p. 214
Bennett, H P (Henry Patrick), WX9340
No full textThis record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/371397Surname: BENNETT
Given Name(s) or Initials: H P (HENRY PATRICK)
Military Service Number or Last Known Location: WX9340
Missing, Wounded and Prisoner of War Enquiry Card Index Number: 33201181892
Item: [2016.0049.03724] "Bennett, H P (Henry Patrick), WX9340
Learning the large-scale structure of the max-sat landscape using populations
No full textA new algorithm for solving MAX-SAT problems is introduced which clusters good solutions, and restarts the search from the closest feasible solution to the centroid of each cluster. This is shown to be highly efficient for finding good solutions of large MAX-SAT problems. We argue that this success is due to the population learning the large-scale structure of the fitness landscape. Systematic studies of the landscape are presented to support this hypothesis. In addition, a number of other strategies are tested to rule out other possible explanations of the success. Preliminary results are shown indicating that extensions of the proposed algorithm can give similar improvements on other hard optimisation problems
Dorothy Bennett
No full textDorothy a Sydney housewife married to Alfred John Bennett , they had two children a daughter and son. She came to the Northern Territory as a medical secretary with a team lead by Sydney surgeon Dr Stuart Scougall, studying orthopaedic problems in Central Australia and Arnhem Land. In her spare time Dorothy sought samples of Aboriginal art for the New South Wales Art Gallery. In 1959, Qantas asked Dorothy and Dr Scougall to gather a small Aboriginal art collection to tour Japan. Request from the ceremonial leader of the Riratjingu people to come back and help the artist sell their work. Dorothy the art hunter would take a rifle, extra fuel and plenty of water when she ventured on collecting and buying paintings expeditions, travelling over rough bush tracks and through deep rivers for up to eight months each year then returning to exhibit the works in cities. Dorothy collected not for her own profit the emphasis of her work was always on helping artists to exhibit and sell their work themselves, locally and overseas.
Dorothy worked with gallery operator Shirley Collins organising exhibitions in the 1970s and 1980s. In 1972 she became consultant to the Aboriginal Arts Board. She became a field officer and adviser for Aboriginal Arts and Crafts Company in 1973. Since 1986 Dorothy has worked independently among artists, recording their mythologies and collecting their works. She is an authorised consultant and was a member of the North Australia Research Unit attached to the Australian National University and is a federally appointed NT art valuer.Medical SecretaryArt Consultan
- …
