close encounters scil

The poet is only rarely admitted to Cynthia's presence, he cannot even try to persuade his beloved through the closed doors.45 The meaning of in triviis requiescere has been interpreted as referring either to former love encounters with Cynthia on crossroads, or, more convincingly, to Propertius' vigils by the doorstep of his beloved.46 Turning to sicca luna, most modern commentators, as was the case with Aen. 2, 255, insist on dissociating Propertius' choice of epithet from the term used by agricultural writers, arguing that the poet was simply referring to a clear, dry night.47 On the rarer occasions, when the association of Propertius' sicca luna with the term for the new moon is recognized, the poet's meaning is reconstructed through popular beliefs. Thus, Shackleton Bailey tried to explain the expression sicca… luna in Prop 2, 17, 15 through the belief that the dew that falls during the night, and especially its quantity, depends on the moon and its phase:

TA01 Tuesday, 8:00am – 9:30am ■ TA01 M – Marriott Ballroom 3 Business Intelligence for eBusiness Sponsor: eBusiness Sponsored Session Chair: Catherine Yang, UC Davis, [email protected] 1 – Analysis of Business Process Models in Enterprise Web Services Mabel T. Kung, Professor, Mihaylo College of Business and Economics, California State University at Fullerton, Fullerton, CA, 92834, United States of America, [email protected], Ronald Armstrong This paper reports a series of process-based models for the development of e- Business using enterprise software applications. Our framework focuses on the guidelines for traditional users to identify the structural conflicts in integrating web services. 2 – Multi-agent Based Knowledge Discovery in a Distributed Environment – a Concurrent Logic Approach Zhangxi Lin, Associate Professor, Texas Tech University, CAABI Research Center, Lubbock, TX, 79416, United States of America, [email protected] This paper proposes a new approach to knowledge discovery in a distributed eBusiness system using multi-agent techniques. Guided by the needs from local knowledge base reasoning, each agent can autonomously initiate the sessions with others to acquire the mostly wanted information in order to reach its data analytic objectives. The case-based reasoning and multi-value logic methods are employed. The approach has the potential to be applied to anti money laundering. 3 – Web User Behavioral Profiling for User Identification Catherine Yang, UC Davis, [email protected] In this paper, we propose a simple, yet powerful approach to profile users Web browsing behavior for the purpose of user identification. The importance of being able to identify users can be significant given a wide variety of applications in electronic commerce, such as product recommendation, personalized advertising, etc. We create user profiles capturing the strength of users behavioral patterns, which can be used as behavior signatures to help in identifying users. ■ TA03 Dantzig Memorial I Cluster: Dantzig Memorial Invited Session Chair: Richard Cottle, Department of Management Science and Engineering, Stanford University, Stanford, CA, 94305-4026, United States of America, [email protected] 1 – George Dantzig Crosses the Potomac River, Twice! Saul Gass, Professor Emeritus, University of Maryland, 8809 Maxwell Drive, Potomac, MD, 20854, United States of America, [email protected] We recount how General George started his career in 1941 working for the U.S. Air Force’s Combat Analysis Division, Pentagon, during World War II, and his return in 1946 as Chief Mathematician of the Air Force’s Project SCOOP, the birth place of linear programming and the simplex method. George had been drawn into battle by his Pentagon colleagues who challenged him to figure out how the Air Force could mechanize its planning process in a world of desk calculators and IBM accounting equipment. 2 – 57 Years of Close Encounters with George Harold W. Kuhn, Department of Mathematics, Fine Hall, Washington Road, Princeton, NJ, 08544, United States of America, [email protected] A personal account of eleven encounters with George Dantzig over 57 years. These range from a meeting in his office at Project SCOOP in the summer of 1948 to preparing a citation for his Linear Programming and Extensions as one of the Princeton University Press’s Notable Centenary Titles in 2005. 3 – GBD and Uncertainty John Birge, Professor, Chicago Graduate School of Business, University of Chicago, Chicago, 60637, United States of America, [email protected] While George Dantzig’s pioneering work and subsequent contributions to linear programming under uncertainty are widely known, his first contributions to stochastic optimization preceded but foreshadowed his development of programming in a linear structure. This talk will explore those early connections. INFORMS WASHINGTON D.C. — 2008 240 ■ TA04 M – Delaware B Panel Discussion: Should the Electoral College Stay, Be Reformed, or Be Abolished? Cluster: Public Policy: Operations Research in the Public Sector: Change We Can Believe In! Invited Session Moderator: Alex Belenky 1 – Should the Electoral College Stay, Be Reformed, or Be Abolished? Panelists: Arnie Barnett, Ed Kaplan, Nathan Ritchey, Vincy Fon, Paul Edelman, Jonathan Hodge, Nicholas Miller Since its creation in 1787, the Electoral College has remained the most mysterious mechanism for electing a President of a country. There is no consensus among mathematicians, systems scientists, and political scientists studying the Electoral College on whether it can satisfactorily serve the U.S. in the 21st century, especially after two close elections in 2000 and in 2004. Discussions of the Electoral College in the media are mostly those on opinions about this unique election mechanism and are not based either on its established quantitative features or on its true merits and obvious deficiencies, leaving them unknown or unclear to an overwhelming majority of the electorate. This session aims at demonstrating how OR can help the media communicate to the voters in a simple manner what is really known about key Electoral College quantitative features, as well as at spotlighting unsolved systems problems associated with analyzing this controversial election mechanism. ■ TA05 M – Virginia B Nonlinear Programming: Algorithms and Applications Sponsor: Optimization/ Nonlinear Optimization Sponsored Session Chair: Hande Benson, Assistant Professor, Drexel University, 3141 Chestnut Street, Philadelphia, PA, 19104, United States of America, [email protected] 1 – Infeasibility Detection in Nonlinear Programming Frank Curtis, Postdoctoral Researcher, New York University, 251 Mercer Street, New York, NY, 10012, United States of America, [email protected], Jorge Nocedal, Richard Byrd Optimization algorithms, which are primarily designed to solve feasible problem instances, can behave inefficiently when applied to infeasible problems. Meaningful termination points are those minimizing a feasibility measure, but convergence to such points can be exceedingly slow. In this talk we present a SQP penalty method that provides fast convergence guarantees for both feasible and infeasible problems by transitioning continuously between the goals of optimality and feasibility. 2 – On Local 1.5-Q-superlinear Convergence of the Primal-dual Exterior-point Method Igor Griva, George Mason University, 4400 University Dr, Fairfax, VA, United States of America, [email protected], Roman Polyak We introduce a primal-dual exterior-point method (EPM) for optimization problems with both inequality and equality constraints. Every iteration the algorithms solves a primal-dual linear system of equations. We show that under the standard second-order optimality condition the EPM method generates a sequence, which converges to the primal-dual solution with an asymptotic 1.5- Q-superlinear rate. 3 – On the Local Quadratic Convergence of the Primal-dual Augmented Lagrangian Method Roman Polyak, Professor, George Mason University, 4400 University Drive, Fairfax, VA, United States of America, [email protected] We introduce the Primal-Dual Augmented Lagrangian (PDAL) method for optimization problems with equality constraints. Each step of the PDAL requires solving the primal-dual linear system of equations. We show that under the standard second-order optimality condition the PDAL method generates a sequence, which converges to the primal-dual solution with asymptotic quadratic rate. 4 – Bilevel Programming for Biofuel Production Problems Xiangrong Liu, Student, Drexel University, 3141 Chestnut Street, Philadelphia, PA, 19104, United States of America, [email protected] This paper presents a discrete bilevel optimization model for decision-making in biofuel production. In the upper level problem, the government finds the optimal tax credits to provide farms enough incentives to produce biofuel while the farms allocate their lands to different usages in the lower level problem. We propose to use techniques from nonsmooth nonlinear optimization. Computational results are provided on a numerical example from literature.

In this retelling of Lewis Carroll’s classic tale, Alice’s fall down the rabbit hole turns into a terrifying descent through the centre of the earth, accelerating her to terminal velocity, hopelessly snarling her long hair into a tangled mess, and nearly setting it alight. Things go from bad to worse as she sets out through Wonderland’s familiar, yet strangely-altered places, where she encounters characters whose personalities have also radically changed. There is no timid mouse in the pool of tears she creates when weeping over the absolute mess of her hair-but rather a French sewer rat. Climbing out of the pool she encounters the last of the Dodos, the lonely, love-sick, sole survivor of his species, ended up in Wonderland by diving down another hole, narrowly managing to evade starving, voracious Dutch sailor. Travelling from place to place seeking a haircut (and at times, a shave), Alice also encounters the Queen of Hearts, who resembles an overweight Spanish beauty and who performs for Alice an energetic flamenco, leaving her Majesty too exhausted to play croquet. Instead of a Hatter, Alice meets a Hairdresser, and at one point has a close encounter of the worst kind with the Wasp from Looking-glass Land-who takes her for a tasty-looking larva. In the end, Alice’s hair takes centre stage in a surprising and hilarious climax.