01130nam--2200373---450-99000293399020331620070528123815.01-85617-390-9000293399USA01000293399(ALEPH)000293399USA0100029339920070528d20032006km-y0itay50------baengUS||||||||001yyPractical handbook of Photovoltaics : fundamentals and applicationsedited by Tom Markvart and Louis CastañerNew YorkElseviercopyr. 2003 (stampa 2006)XIV, 984 p.23 cm20012001001-------2001Dispositivi fotoelettrici621.381542MARKVART,TomCASTAÑER,LuisITsalbcISBD990002933990203316621.381542 PRA20116 TEC.621.38154200160004BKTECFIORELLA9020070528USA011238Practical handbook of Photovoltaics : fundamentals and applications1030062UNISA02762nam 2200637 a 450 991046575170332120200520144314.01-283-41169-597866134116931-57233-770-2(CKB)2560000000079365(EBL)834996(OCoLC)772845097(SSID)ssj0000636487(PQKBManifestationID)11354202(PQKBTitleCode)TC0000636487(PQKBWorkID)10661523(PQKB)10827331(MiAaPQ)EBC834996(OCoLC)835518961(MdBmJHUP)muse18493(Au-PeEL)EBL834996(CaPaEBR)ebr10527300(CaONFJC)MIL341169(EXLCZ)99256000000007936520120214d2011 uy 0engurcn|||||||||txtccrThe hippies and American values[electronic resource] /Timothy Miller2nd ed.Knoxville University of Tennessee Press20111 online resource (193 p.)Description based upon print version of record.1-57233-817-2 Includes bibliographical references and index.Contents; Acknowledgments; Introduction to the Second Edition; Chapter 1: The Ethics of Dope; Chapter 2: The Ethics of Sex; Chapter 3: The Ethics of Rock; Chapter 4: The Ethics of Community; Chapter 5: Forward on All Fronts: The Ethics of Cultural Opposition; Chapter 6: Legacy; Notes; Bibliography; Index"Turn on, tune in, drop out," Timothy Leary advised young people in the 1960's. And many did, creating a counterculture built on drugs, rock music, sexual liberation, and communal living. The hippies preached free love, promoted flower power, and cautioned against trusting anyone over thirty. Eschewing money, materialism, and politics, they repudiated the mainstream values of the times. Along the way, these counter culturists created a lasting legacy and inspired long-lasting social changes. The Hippies and American Values uses an innovative approach to exploring the tenetsHippiesUnited StatesHistorySubcultureUnited StatesHistoryUnited StatesMoral conditionsUnited StatesSocial conditions1960-1980Electronic books.HippiesHistory.SubcultureHistory.305.5/68Miller Timothy1944-790544MiAaPQMiAaPQMiAaPQBOOK9910465751703321The hippies and American values2442354UNINA05481nam 2200685Ia 450 991013949140332120170809153001.01-282-16499-697866121649960-470-61109-X0-470-39367-X(CKB)2550000000005906(EBL)477695(OCoLC)520990431(SSID)ssj0000335966(PQKBManifestationID)11241254(PQKBTitleCode)TC0000335966(PQKBWorkID)10277663(PQKB)10758379(MiAaPQ)EBC477695(EXLCZ)99255000000000590620070614d2008 uy 0engur|n|---|||||txtccrCombinatorial optimization and theoretical computer science[electronic resource] interfaces and perspectives : 30th anniversary of the LAMSADE /edited by Vangelis Th. PaschosLondon ISTE ;Hoboken, NJ Wiley20081 online resource (518 p.)ISTE ;v.24Description based upon print version of record.1-84821-021-3 Includes bibliographical references and index.Combinatorial Optimization and Theoretical Computer Science; Contents; Preface; Chapter 1. The Complexity of Single Machine Scheduling Problems under Scenario-based Uncertainty; 1.1. Introduction; 1.2. Problem MinMax(1|prec|fmax, θ ); 1.2.1. Uncertainty on due dates; 1.2.2. Uncertainty on processing times and due dates; 1.3. Problem MinMax(1|| Σ wj Cj, Wj ); 1.4. Problem MinMax(1|| Σ Uj, θ ); 1.4.1. Uncertainty on due dates; 1.4.2. Uncertainty on processing times; 1.5. Bibliography; Chapter 2. Approximation of Multi-criteria Min and Max TSP(1, 2); 2.1. Introduction2.1.1. The traveling salesman problem2.1.2. Multi-criteria optimization; 2.1.3. Organization of the chapter; 2.2. Overview; 2.3. The bicriteria TSP(1, 2); 2.3.1. Simple examples of the non-approximability; 2.3.2. A local search heuristic for the bicriteria TSP(1, 2); 2.3.3. A nearest neighbor heuristic for the bicriteria TSP(1, 2); 2.3.4. On the bicriteria Max TSP(1, 2); 2.4. k-criteria TSP(1, 2); 2.4.1. Non-approximability related to the number of generated solutions; 2.4.2. A nearest neighbor heuristic for the k-criteria TSP(1, 2); 2.5. Conclusion; 2.6. BibliographyChapter 3. Online Models for Set-covering: The Flaw of Greediness3.1. Introduction; 3.2. Description of the main results and related work; 3.3. The price of ignorance; 3.4. Competitiveness of TAKE-ALL and TAKE-AT-RANDOM; 3.4.1. TAKE-ALL algorithm; 3.4.2. TAKE-AT-RANDOM algorithm; 3.5. The nasty flaw of greediness; 3.6. The power of look-ahead; 3.7. The maximum budget saving problem; 3.8. Discussion; 3.9. Bibliography; Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets; 4.1. Introduction; 4.2. Time Petri nets and timed automata4.2.1. Timed transition systems and equivalence relations4.2.2. Time Petri nets; 4.2.3. Timed automata; 4.2.4. Expressiveness and equivalence problems; 4.3. Comparison of semantics I, A and PA; 4.3.1. A first comparison between the different semantics of TPNs; 4.3.2. A second comparison for standard bounded TPN; 4.4. Strict ordering results; 4.5. Equivalence with respect to timed language acceptance; 4.5.1. Encoding atomic constraints; 4.5.2. Resetting clocks; 4.5.3. The complete construction; 4.5.4. Δ (A) and A accept the same timed language; 4.5.5. Consequences of the previous results4.6. Bisimulation of TA by TPNs4.6.1. Regions of a timed automaton; 4.6.2. From bisimulation to uniform bisimulation; 4.6.3. A characterization of bisimilarity; 4.6.4. Proof of necessity; 4.6.5. First construction; 4.6.6. Second construction; 4.6.7. Complexity results; 4.7. Conclusion; 4.8. Bibliography; Chapter 5. A "Maximum Node Clustering" Problem; 5.1. Introduction; 5.2. Approximation algorithm for the general problem; 5.3. The tree case; 5.3.1. Dynamic programming; 5.3.2. A fully polynomial time approximation scheme; 5.4. Exponential algorithms for special cases; 5.5. BibliographyChapter 6. The Patrolling Problem: Theoretical and Experimental ResultsThis volume is dedicated to the theme "Combinatorial Optimization - Theoretical Computer Science: Interfaces and Perspectives" and has two main objectives: the first is to show that bringing together operational research and theoretical computer science can yield useful results for a range of applications, while the second is to demonstrate the quality and range of research conducted by the LAMSADE in these areas.ISTECombinatorial optimizationComputer programsComputer scienceMathematicsElectronic books.Combinatorial optimizationComputer programs.Computer scienceMathematics.519.6/4519.64SK 890rvkST 130rvkPaschos Vangelis Th944252Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (France)MiAaPQMiAaPQMiAaPQBOOK9910139491403321Combinatorial optimization and theoretical computer science2131625UNINA