LEADER 01119nam--2200373---450- 001 990003214880203316 005 20090407101117.0 010 $a978-88-430-4816-8 035 $a000321488 035 $aUSA01000321488 035 $a(ALEPH)000321488USA01 035 $a000321488 100 $a20090407d2009----km-y0itay50------ba 101 $aita 102 $aIT 105 $a||||||||001yy 200 1 $aEconomia dei mercati emergenti$fEmilio Colombo, Marco Lossani 210 $aRoma$cCarocci$d2009 215 $a344 p.$d24 cm 225 2 $aUniversitŕ$iEconomia$v795 410 0$12001$aUniversitŕ$iEconomia$v795 606 0 $aMercati finanziari$xPaesi in via di sviluppo$2BNCF 676 $a332.091724 700 1$aCOLOMBO,$bEmilio$010034 701 1$aLOSSANI,$bMarco$0597641 801 0$aIT$bsalbc$gISBD 912 $a990003214880203316 951 $a332.091 COL 2$b215419 G.$c332.091$d00205994 959 $aBK 969 $aECO 979 $aIANNONE$b90$c20090407$lUSA01$h1003 979 $aIANNONE$b90$c20090407$lUSA01$h1011 996 $aEconomia dei mercati emergenti$91012343 997 $aUNISA LEADER 07190oam 2200745 a 450 001 9910141261103321 005 20210108050751.0 010 $a1-280-78471-7 010 $a9786613695109 010 $a1-118-29970-1 010 $a1-118-29971-X 010 $a1-118-29973-6 035 $a(CKB)2670000000208348 035 $a(EBL)947209 035 $a(OCoLC)775591921 035 $a(SSID)ssj0000678678 035 $a(PQKBManifestationID)11387204 035 $a(PQKBTitleCode)TC0000678678 035 $a(PQKBWorkID)10728047 035 $a(PQKB)10039665 035 $a(DLC) 2012005270 035 $a(MiAaPQ)EBC947209 035 $a(EXLCZ)992670000000208348 100 $a20120206d2012 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aPhosphorus(III) ligands in homogeneous catalysis$b[electronic resource] $edesign and synthesis /$fedited by Paul Kamer & Piet W.N.M. van Leeuwen 210 $aChichester, West Sussex, United Kingdom $cJohn Wiley & Sons, Ltd.$d2012 215 $a1 online resource (567 p.) 300 $aDescription based upon print version of record. 311 $a0-470-66627-7 320 $aIncludes bibliographical references and index. 327 $aPhosphorus( III ) Ligands in Homogeneous Catalysis: Design and Synthesis; Contents; List of Contributors; Preface; 1 Phosphorus Ligand Effects in Homogeneous Catalysis and Rational Catalyst Design; 1.1 Introduction; 1.2 Properties of phosphorus ligands; 1.2.1 Electronic ligand parameters; 1.2.2 Steric ligand parameters; 1.2.3 Bite angle effects; 1.2.4 Molecular electrostatic potential (MESP) approach; 1.3 Asymmetric ligands; 1.4 Rational ligand design in nickel-catalysed hydrocyanation; 1.4.1 Introduction; 1.4.2 Mechanistic insights; 1.4.3 Rational design; 1.5 Conclusions; References 327 $a2 Chiral Phosphines and Diphosphines2.1 Introduction; 2.1.1 Early developments; 2.2 Chiral chelating diphosphines with a linking scaffold; 2.2.1 Building chiral backbones from naturally available materials; 2.2.2 Design and synthesis of chiral backbones; 2.2.3 Synthesis from optical resolution of phosphine precursors or intermediates; 2.3 Chiral atropisomeric biaryl diphosphines; 2.3.1 Synthesis of BINAP and its derivatives; 2.3.2 Synthesis of atropisomeric biaryl ligands; 2.3.3 General strategies of synthesizing of atropisomeric biaryl ligands; 2.4 Chiral phosphacyclic diphosphines 327 $a2.4.1 Fundamental discovery and syntheses of BPE and DuPhos2.4.2 Design and synthesis of bisphosphetanes; 2.4.3 Design and synthesis of bisphospholanes; 2.4.4 Design and synthesis of bisphospholes; 2.4.5 Design and synthesis of bisphosphinanes; 2.4.6 Design and synthesis of bisphosphepines; 2.4.7 Summary of synthetic strategies of phosphacycles; 2.5 P-stereogenic diphosphine ligands; 2.6 Experimental procedures for the syntheses of selected diphosphine ligands; 2.6.1 Synthesis procedure for DIOP* ligand; 2.6.2 Synthesis procedure of SDP ligands; 2.6.3 Synthesis procedure of (R,R)-BICP 327 $a2.6.4 Synthesis procedure of SEGPHOS2.6.5 Synthesis procedure of Ph-BPE; 2.6.6 Synthesis procedure of TangPhos; 2.6.7 Synthesis procedure of Binaphane; 2.7 Concluding remarks; References; 3 Design and Synthesis of Phosphite Ligands for Homogeneous Catalysis; 3.1 Introduction; 3.2 Synthesis of phosphites; 3.2.1 Monophosphites; 3.2.2 Diphosphite ligands; 3.2.3 Triphosphites; 3.3 Highlights of catalytic applications of phosphite ligands; 3.3.1 Hydrogenation reactions; 3.3.2 Functionalization of alkenes: hydroformylation and hydrocyanation 327 $a3.3.3 Addition of nucleophiles to carbonyl compounds and derivatives3.3.4 Allylic substitution reactions; 3.3.5 Miscellaneous reactions; 3.4 General synthetic procedures; 3.4.1 Symmetrically substituted phosphites; 3.4.2 Nonsymmetrically substituted phosphites; 3.4.3 Phosphites bearing dioxaphospho-cyclic units; References; 4 Phosphoramidite Ligands; 4.1 Introduction; 4.1.1 History; 4.2 Synthesis of phosphoramidites; 4.3 Reactivity of the phosphoramidites; 4.4 Types of phosphoramidite ligands; 4.4.1 Acyclic monodentate phosphoramidites; 4.4.2 Cyclic monodentate phosphoramidites based on diols 327 $a4.4.3 Cyclic phosphoramidites based on amino alcohols 330 $a"Over the last 60 years the increasing knowledge of transition metal chemistry has resulted in an enormous advance of homogeneous catalysis as an essential tool in both academic and industrial fields. Remarkably, phosphorus(III) donor ligands have played an important role in several of the acknowledged catalytic reactions. The positive effects of phosphine ligands in transition metal homogeneous catalysis have contributed largely to the evolution of the field into an indispensable tool in organic synthesis and the industrial production of chemicals.This book aims to address the design and synthesis of a comprehensive compilation of P(III) ligands for homogeneous catalysis. It not only focuses on the well-known traditional ligands that have been explored by catalysis researchers, but also includes promising ligand types that have traditionally been ignored mainly because of their challenging synthesis.Topics covered include ligand effects in homogeneous catalysis and rational catalyst design, P-stereogenic ligands, calixarenes, supramolecular approaches, solid phase synthesis, biological approaches, and solubility and separation.Ligand families covered in this book include phosphine, diphosphine, phosphite, diphosphite, phosphoramidite, phosphonite, phosphinite, phosphole, phosphinine, phosphinidenene, phosphaalkenes, phosphaalkynes, P-chiral ligands, and cage ligands.Each ligand class is accompanied by detailed and reliable synthetic procedures. Often the rate limiting step in the application of ligands in catalysis is the synthesis of the ligands themselves, which can often be very challenging and time consuming. This book will provide helpful advice as to the accessibility of ligands as well as their synthesis, thereby allowing researchers to make a more informed choice.Phosphorus(III) Ligands in Homogeneous Catalysis: Design and Synthesis is an essential overview of this important class of catalysts for academic and industrial researchers working in catalyst development, organometallic and synthetic chemistry"--$cProvided by publisher. 606 $aPhosphorus compounds 606 $aLigands 606 $aCatalysis 606 $aTECHNOLOGY & ENGINEERING / Material Science$2bisacsh 608 $aElectronic books. 615 0$aPhosphorus compounds. 615 0$aLigands. 615 0$aCatalysis. 615 7$aTECHNOLOGY & ENGINEERING / Material Science 676 $a541.2242 676 $a546.712595 676 $a546/.712595 686 $aTEC021000$2bisacsh 700 $aKamer$b Paul$0908850 701 $aLeeuwen$b P. W. N. M. van$g(Piet W. N. M.)$043994 801 0$bDLC 801 1$bDLC 801 2$bDLC 801 2$bDLC 906 $aBOOK 912 $a9910141261103321 996 $aPhosphorus(III) ligands in homogeneous catalysis$92032703 997 $aUNINA LEADER 05123nam 22007935 450 001 996466164303316 005 20230406065605.0 010 $a3-540-38873-7 024 7 $a10.1007/11840930 035 $a(CKB)1000000000283743 035 $a(SSID)ssj0000316359 035 $a(PQKBManifestationID)11248148 035 $a(PQKBTitleCode)TC0000316359 035 $a(PQKBWorkID)10275881 035 $a(PQKB)10541941 035 $a(DE-He213)978-3-540-38873-9 035 $a(MiAaPQ)EBC3068169 035 $a(PPN)123137918 035 $a(EXLCZ)991000000000283743 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aArtificial Neural Networks - ICANN 2006$b[electronic resource] $e16th International Conference, Athens, Greece, September 10-14, 2006, Proceedings, Part II /$fedited by Stefanos Kollias, Andreas Stafylopatis, Wlodzislaw Duch, Erkki Oja 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XXXIV, 1028 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4132 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-38871-0 320 $aIncludes bibliographical references and index. 327 $aNeural Networks, Semantic Web Technologies and Multimedia Analysis (Special Session) -- Bridging the Semantic Gap in Multimedia Machine Learning Approaches (Special Session) -- Signal and Time Series Processing (I) -- Signal and Time Series Processing (II) -- Data Analysis (I) -- Data Analysis (II) -- Pattern Recognition -- Visual Attention Algorithms and Architectures for Perceptional Understanding and Video Coding (Special Session) -- Vision and Image Processing (I) -- Vision and Image Processing (II) -- Computational Finance and Economics (Special Session) -- Neural Computing in Energy Engineering (Special Session) -- Applications to Biomedicine and Bioinformatics -- Applications to Security and Market Analysis -- Real World Applications (I) -- Real World Applications (II). 330 $aThis book includes the proceedings of the International Conference on Artificial Neural Networks (ICANN 2006) held on September 10-14, 2006 in Athens, Greece, with tutorials being presented on September 10, the main conference taking place during September 11-13 and accompanying workshops on perception, cognition and interaction held on September 14, 2006. The ICANN conference is organized annually by the European Neural Network Society in cooperation with the International Neural Network Society, the Japanese Neural Network Society and the IEEE Computational Intelligence Society. It is the premier European event covering all topics concerned with neural networks and related areas. The ICANN series of conferences was initiated in 1991 and soon became the major European gathering for experts in these fields. In 2006 the ICANN Conference was organized by the Intelligent Systems Laboratory and the Image, Video and Multimedia Systems Laboratory of the National Technical University of Athens in Athens, Greece. From 475 papers submitted to the conference, the International Program Committee selected, following a thorough peer-review process, 208 papers for publication and presentation to 21 regular and 10 special sessions. The quality of the papers received was in general very high; as a consequence, it was not possible to accept and include in the conference program many papers of good quality. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4132 606 $aComputer science 606 $aArtificial intelligence 606 $aPattern recognition systems 606 $aApplication software 606 $aDatabase management 606 $aNeurosciences 606 $aTheory of Computation 606 $aArtificial Intelligence 606 $aAutomated Pattern Recognition 606 $aComputer and Information Systems Applications 606 $aDatabase Management 606 $aNeuroscience 615 0$aComputer science. 615 0$aArtificial intelligence. 615 0$aPattern recognition systems. 615 0$aApplication software. 615 0$aDatabase management. 615 0$aNeurosciences. 615 14$aTheory of Computation. 615 24$aArtificial Intelligence. 615 24$aAutomated Pattern Recognition. 615 24$aComputer and Information Systems Applications. 615 24$aDatabase Management. 615 24$aNeuroscience. 676 $a004.0151 702 $aKollias$b Stefanos$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aStafylopatis$b Andreas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDuch$b Wlodzislaw$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aOja$b Erkki$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466164303316 996 $aArtificial Neural Networks – ICANN 2006$9772561 997 $aUNISA LEADER 07302nam 2201861 a 450 001 9910789748903321 005 20220308025052.0 010 $a1-283-25611-8 010 $a9786613256119 010 $a1-4008-4110-0 024 7 $a10.1515/9781400841103 035 $a(CKB)2670000000114042 035 $a(EBL)768550 035 $a(OCoLC)749265038 035 $a(SSID)ssj0000545200 035 $a(PQKBManifestationID)11362484 035 $a(PQKBTitleCode)TC0000545200 035 $a(PQKBWorkID)10554795 035 $a(PQKB)10026176 035 $a(DE-B1597)447249 035 $a(OCoLC)1054881878 035 $a(OCoLC)979579454 035 $a(DE-B1597)9781400841103 035 $a(Au-PeEL)EBL768550 035 $a(CaPaEBR)ebr10496632 035 $a(CaONFJC)MIL325611 035 $a(MiAaPQ)EBC768550 035 $a(EXLCZ)992670000000114042 100 $a20060724d2006 uy 0 101 0 $aeng 135 $aurnnu---|u||u 181 $ctxt 182 $cc 183 $acr 200 14$aThe traveling salesman problem$b[electronic resource] $ea computational study /$fDavid L. Applegate ... [et al.] 205 $aCourse Book 210 $aPrinceton $cPrinceton University Press$dc2006 215 $a1 online resource (606 p.) 225 1 $aPrinceton series in applied mathematics 300 $a"A Princeton University Press e-book."--Cover. 311 0 $a0-691-12993-2 320 $aIncludes bibliographical references (p. [541]-581) and index. 327 $tFront matter --$tContents --$tPreface --$tChapter 1. The Problem --$tChapter 2. Applications --$tChapter 3. Dantzig, Fulkerson, and Johnson --$tChapter 4. History of TSP Computation --$tChapter 5. LP Bounds and Cutting Planes --$tChapter 6. Subtour Cuts and PQ-Trees --$tChapter 7. Cuts from Blossoms and Blocks --$tChapter 8. Combs from Consecutive Ones --$tChapter 9. Combs from Dominoes --$tChapter 10. Cut Metamorphoses --$tChapter 11. Local Cuts --$tChapter 12. Managing the Linear Programming Problems --$tChapter 13. The Linear Programming Solver Chapter 14. Branching --$tChapter 14. Branching --$tChapter 15. Tour Finding --$tChapter 16. Computation --$tChapter 17. The Road Goes On --$tBibliography --$tIndex 330 $aThis book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us. 410 0$aPrinceton series in applied mathematics. 606 $aTraveling salesman problem 610 $aAT&T Labs. 610 $aAccuracy and precision. 610 $aAddition. 610 $aAlgorithm. 610 $aAnalysis of algorithms. 610 $aApplied mathematics. 610 $aApproximation algorithm. 610 $aApproximation. 610 $aBasic solution (linear programming). 610 $aBest, worst and average case. 610 $aBifurcation theory. 610 $aBig O notation. 610 $aCPLEX. 610 $aCPU time. 610 $aCalculation. 610 $aChaos theory. 610 $aColumn generation. 610 $aCombinatorial optimization. 610 $aComputation. 610 $aComputational resource. 610 $aComputer. 610 $aConnected component (graph theory). 610 $aConnectivity (graph theory). 610 $aConvex hull. 610 $aCutting-plane method. 610 $aDelaunay triangulation. 610 $aDeterminism. 610 $aDisjoint sets. 610 $aDynamic programming. 610 $aEar decomposition. 610 $aEngineering. 610 $aEnumeration. 610 $aEquation. 610 $aEstimation. 610 $aEuclidean distance. 610 $aEuclidean space. 610 $aFamily of sets. 610 $aFor loop. 610 $aGenetic algorithm. 610 $aGeorge Dantzig. 610 $aGeorgia Institute of Technology. 610 $aGreedy algorithm. 610 $aHamiltonian path. 610 $aHospitality. 610 $aHypergraph. 610 $aImplementation. 610 $aInstance (computer science). 610 $aInstitute. 610 $aInteger. 610 $aIteration. 610 $aLinear inequality. 610 $aLinear programming. 610 $aMathematical optimization. 610 $aMathematics. 610 $aModel of computation. 610 $aNeuroscience. 610 $aNotation. 610 $aOperations research. 610 $aOptimization problem. 610 $aOrder by. 610 $aPairwise. 610 $aParameter (computer programming). 610 $aParity (mathematics). 610 $aPercentage. 610 $aPolyhedron. 610 $aPolytope. 610 $aPricing. 610 $aPrinceton University. 610 $aProcessing (programming language). 610 $aProject. 610 $aQuantity. 610 $aReduced cost. 610 $aRequirement. 610 $aResult. 610 $aRice University. 610 $aRutgers University. 610 $aScientific notation. 610 $aSearch algorithm. 610 $aSearch tree. 610 $aSelf-similarity. 610 $aSimplex algorithm. 610 $aSolution set. 610 $aSolver. 610 $aSource code. 610 $aSpecial case. 610 $aStochastic. 610 $aSubroutine. 610 $aSubsequence. 610 $aSubset. 610 $aSummation. 610 $aTest set. 610 $aTheorem. 610 $aTheory. 610 $aTime complexity. 610 $aTrade-off. 610 $aTravelling salesman problem. 610 $aTree (data structure). 610 $aUpper and lower bounds. 610 $aVariable (computer science). 610 $aVariable (mathematics). 615 0$aTraveling salesman problem. 676 $a511.6 700 $aApplegate$b David L$01495294 702 $aBixby$b Robert E.$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aChvátal$b Va?ek$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910789748903321 996 $aThe traveling salesman problem$93719343 997 $aUNINA