{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":39,"n_cols":5,"rows_kept":39,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[4,2,4,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[16,2,16,3],[22,2,22,3],[22,4,22,5],[23,2,23,3],[23,4,23,5],[24,2,24,3],[24,4,24,5],[25,2,25,3],[27,2,27,3],[29,2,29,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[36,2,36,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910809224403321"]
[null,null,"Titolo",null,"Surveys on discrete and computational geometry : twenty years later : AMS-IMS-SIAM Joint Summer Research Conference, June 18-22, 2006, Snowbird, Utah / / Jacob E. Goodman, János Pach, Richard Pollack, editors"]
[null,null,"Pubbl/distr/stampa",null,"Providence, Rhode Island : , : American Mathematical Society, , [2008]"]
[{"$nulls":4},"©2008"]
[null,null,"ISBN",null,"0-8218-8132-9"]
[{"$nulls":4},"0-8218-4239-0"]
[null,null,"Descrizione fisica",null,"1 online resource (568 p.)"]
[null,null,"Collana",null,"Contemporary mathematics, , 0271-4132 ; ; 453"]
[null,null,"Disciplina",null,"516/.13"]
[null,null,"Soggetti",null,"Combinatorial geometry"]
[{"$nulls":4},"Geometry - Data processing"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"\"\"Contents\"\"; \"\"Preface\"\"; \"\"Musings on discrete geometry and \"\"20 years of Discrete & Computational Geometry\"\"\"\"; \"\"State of the union (of geometric objects)\"\"; \"\"Metric graph theory and geometry: a survey\"\"; \"\"Extremal problems for convex lattice polytopes: a survey\"\"; \"\"On simple arrangements of lines and pseudo-lines in P2 and R2 with the maximum number of triangles\"\"; \"\"The computational complexity of convex bodies\"\"; \"\"Algorithmic semi-algebraic geometry and topology â€? recent progress and open problems\"\"; \"\"1. Introduction\"\"; \"\"2. Semi-algebraic Geometry: Background\"\""]
[{"$nulls":4},"\"\"3. Recent Algorithmic Results\"\"\"\"4. Algorithmic Preliminaries\"\"; \"\"5. Topological Preliminaries\"\"; \"\"6. Algorithms for Computing the First Few Betti Numbers\"\"; \"\"7. The Quadratic Case\"\"; \"\"8. Betti Numbers of Arrangements\"\"; \"\"9. Open Problems\"\"; \"\"Acknowledgment\"\"; \"\"References\"\"; \"\"Expansive motions\"\"; \"\"All polygons flip finitely â€? right?\"\"; \"\"Persistent homologyâ€?a survey\"\"; \"\"Recent progress on line transversals to families of translated ovals\"\"; \"\"An improved, simple construction of many halving edges\"\"; \"\"Unfolding orthogonal polyhedra\"\""]
[{"$nulls":4},"\"\"The discharging method in combinatorial geometry and the Pach-Sharir conjecture\"\"\"\"Pseudo-triangulationsâ€?a survey\"\"; \"\"1. Introduction\"\"; \"\"2. Basic Properties of Pseudo-Triangulations\"\"; \"\"3. The "]
[{"$nulls":4},"Set of all Pseudo-Triangulations\"\"; \"\"4. 3D Liftings and Locally Convex Functions\"\"; \"\"5. Self-Stresses, Reciprocal Diagrams, and the Maxwell-Cremona Correspondence\"\"; \"\"6. Pseudo-Triangulations and Rigidity\"\"; \"\"7. Planar Rigid Graphs are Pseudo-Triangulations\"\"; \"\"8. Polytopes of Pseudo-Triangulations\"\"; \"\"9. Applications of Pseudo-Triangulations\"\"; \"\"References\"\""]
[{"$nulls":4},"\"\"Line problems in nonlinear computational geometry\"\"\"\"On empty hexagons\"\"; \"\"k-sets and k-facets\"\"; \"\"1. Introduction\"\"; \"\"2. Preliminaries\"\"; \"\"3. Random Sampling\"\"; \"\"4. Special Point Sets\"\"; \"\"5. Lower Bounds\"\"; \"\"6. Upper Bounds for Halving Facets in All Dimensions\"\"; \"\"7. Crossings in Dimension 2.\"\"; \"\"8. Improvements in Three And Four Dimensions\"\"; \"\"9. Convex Quadrilaterals\"\"; \"\"10. Connections to the Combinatorial Theory of Convex Polytopes\"\"; \"\"References\"\"; \"\"An ErdÅ?s-Szekeres type problem for interior points\"\""]
[{"$nulls":4},"\"\"The kissing number, blocking number and covering number of a convex body\"\"\"\"Open problems\"\""]
[null,"2.","Record Nr.",null,"UNINA9910163213703321"]
[null,null,"Autore",null,"Davis Major Danny M"]
[null,null,"Titolo",null,"Airborne Deep Operational Maneuver"]
[null,null,"Pubbl/distr/stampa",null,"Chicago : , : Tannenberg Publishing, , 2014"]
[{"$nulls":4},"©2014"]
[null,null,"ISBN",null,"9781782896722"]
[{"$nulls":4},"1782896724"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (46 pages)"]
[null,null,"Disciplina",null,"356.16609729999999"]
[null,null,"Soggetti",null,"Airborne operations (Military science)"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Intro -- TABLE OF CONTENTS -- ABSTRACT -- SECTION I: INTRODUCTION -- SECTION II: DEFINITION OF TERMS -- SECTION III: NORMANDY AS A CASE-STUDY FOR THE USE OF AIRBORNE FORCES TO CONDUCT OPERATIONAL MANEUVER -- SECTION IV -- CURRENT FEASIBILITY OF THE USE OF AIRBORNE FORCES TO CONDUCT OPERATIONAL MANEUVER -- SECTION V: THE THEORY OF AIRBORNE OPERATIONAL MANEUVER -- SECTION VI: A SYNTHESIS OF MODERN EMPLOYMENT OPTIONS FOR AIRBORNE FORCES IN THE CONDUCT OF OPERATIONAL MANEUVER -- SECTION VII: IMPLICATIONS FOR THE FUTURE USES OF AIRBORNE FORCES FOR OPERATIONAL MANEUVER -- BIBLIOGRAPHY -- Books -- Periodicals. Papers, and Speeches -- Military/Government Publications."]
[null,null,null,"Sommario/riassunto","The purpose of this paper is to answer two questions. The first question is: Is it feasible to use airborne forces to penetrate enemy airspace and to conduct a vertical envelopment to effect deep operational maneuver? If it is feasible, what are the employment options available for the use of such an airborne force in the conduct of a modern military campaign? To examine these questions, the paper begins with some definitions to provide a common frame of reference. The use of airborne forces in World War II is next examined to determine if the use of airborne forces to effect deep operational maneuver is historically feasible. Next, the contemporary threat is discussed as it is relevant to the employment of airborne forces in a modern context. Next, the feasibility of the use of airborne forces with some limitations to conduct deep operational maneuver is established "]
[{"$nulls":4},"in the context of the maneuver, firepower, and protection aspects of the combat power model. Next, the theory of deep operations and the use of airborne forces to conduct these kinds of deep maneuvers is examined in the theories of Clausewitz, Jomini, Tukhachevskiy, Triandafillov, and Simpkin. Next, six employment options for the use of airborne forces to conduct deep operations in a modern context are deduced. They are: (1) an airborne force can be used to create a second front within a theater of operations; (2) an airborne force can be used to operationally contain an enemy force targeted for destruction within a theater of operations; (3) an airborne force can be used to seize a \"bridgehead\"...; (4) an airborne force can conduct coups de main against high value targets within a theater of operations; (5) an airborne force can conduct light operations in a theater of operations to disrupt and disorganize the enemy's rear facilities and networks and have a cumulative operational impact; and (6) an airborne force can conduct expeditionary operations to achieve political, strategic, and operational aims"]