| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910460889603321 |
|
|
Autore |
Kamrava Mehran |
|
|
Titolo |
Qatar : Small State, Big Politics / / Mehran Kamrava |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Ithaca, NY : , : Cornell University Press, , [2015] |
|
©2015 |
|
|
|
|
|
|
|
|
|
ISBN |
|
0-8014-5430-1 |
0-8014-5431-X |
|
|
|
|
|
|
|
|
Edizione |
[With a New Preface] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (240 p.) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Politics and government |
Diplomatic relations |
Electronic books. |
Qatar |
Qatar Foreign relations |
Qatar Politics and government |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Originally published: 2013. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references (pages 203-217) and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Front matter -- Contents -- Preface to the Paperback Edition -- Acknowledgments -- Introduction -- 1. Setting the Stage -- 2. The Subtle Powers of a Small State -- 3. Foreign Policy and Power Projection -- 4. The Stability of Royal Autocracy -- 5. State Capacity and High Modernism -- 6. Qatar's Moment in History -- Notes -- Bibliography -- Index |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
The Persian Gulf state of Qatar has fewer than 2 million inhabitants, virtually no potable water, and has been an independent nation only since 1971. Yet its enormous oil and gas wealth has permitted the ruling al Thani family to exert a disproportionately large influence on regional and even international politics. Qatar is, as Mehran Kamrava explains in this knowledgeable and incisive account of the emirate, a "tiny giant": although severely lacking in most measures of state power, it is highly influential in diplomatic, cultural, and economic spheres. Kamrava presents Qatar as an experimental country, building a new society while exerting what he calls "subtle power." It is both the |
|
|
|
|
|
|
|
|
|
|
|
|
|
headquarters of the global media network Al Jazeera and the site of the U.S. Central Command's Forward Headquarters and the Combined Air Operations Center. Qatar has been a major player during the European financial crisis, it has become a showplace for renowned architects, several U.S. universities have established campuses there, and it will host the FIFA World Cup in 2022. Qatar's effective use of its subtle power, Kamrava argues, challenges how we understand the role of small states in the global system. Given the Gulf state's outsized influence on regional and international affairs, this book is a critical and timely account of contemporary Qatari politics and society. |
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910464665603321 |
|
|
Autore |
Yu Jea |
|
|
Titolo |
Simple profits from swing trading, revised and updated : the underground trader swing trading system explained / / Jea Yu |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Hoboken : , : Wiley, , [2014] |
|
©2014 |
|
|
|
|
|
|
|
|
|
ISBN |
|
1-118-77091-9 |
1-299-98891-1 |
1-118-77084-6 |
|
|
|
|
|
|
|
|
Edizione |
[2nd ed.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (96 p.) |
|
|
|
|
|
|
Collana |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Investment analysis |
Stocks |
Investment advisors |
Electronic books. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di contenuto |
|
section one. The underground trader trading system exclusive quick start guide -- section two. Swing trading and The underground trader system. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
There are so many trading systems out there today, each one claiming to have the secret that will bring windfall returns. Some may fare well in |
|
|
|
|
|
|
|
|
|
|
|
|
|
rising markets, but all too often leave the trader struggling to keep their head--and capital--up when the market starts to fall. Doesn't sound too reliable, does it? The Underground Trader Swing Trading system is unlike any other. Having been meticulously forged by hand from hours of active market participation and analysis from over a decade, it is an all-encompassing system that performs strong when the market is rising and perhaps even |
|
|
|
|
|
|
3. |
Record Nr. |
UNISA996465917103316 |
|
|
Titolo |
Automata, Languages and Programming [[electronic resource] ] : 35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008 Proceedings, Part I / / edited by Luca Aceto, Ivan Damgaard, Leslie Ann Goldberg, Magnus M. Halldorsson, Anna Ingolfsdottir, Igor Walukiewicz |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2008.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XXIII, 896 p.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5125 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Software engineering |
Computer programming |
Computer science |
Computer science—Mathematics |
Discrete mathematics |
Numerical analysis |
Artificial intelligence—Data processing |
Software Engineering |
Programming Techniques |
Theory of Computation |
Discrete Mathematics in Computer Science |
Numerical Analysis |
Data Science |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
|
|
|
|
|
|
Note generali |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Invited Lectures -- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects -- Internet Ad Auctions: Insights and Directions -- Track A: Algorithms, Automata, Complexity, and Games -- The Complexity of Boolean Formula Minimization -- Optimal Cryptographic Hardness of Learning Monotone Functions -- On Berge Multiplication for Monotone Boolean Dualization -- Diagonal Circuit Identity Testing and Lower Bounds -- Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity -- Constructing Efficient Dictionaries in Close to Sorting Time -- On List Update with Locality of Reference -- A New Combinatorial Approach for Sparse Graph Problems -- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) -- Networks Become Navigable as Nodes Move and Forget -- Fast Distributed Computation of Cuts Via Random Circulations -- Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time -- Function Evaluation Via Linear Programming in the Priced Information Model -- Improved Approximation Algorithms for Budgeted Allocations -- The Travelling Salesman Problem in Bounded Degree Graphs -- Treewidth Computation and Extremal Combinatorics -- Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines -- Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 -- A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation -- Optimal Monotone Encodings -- Polynomial-Time Construction of Linear Network Coding -- Complexity of Decoding Positive-Rate Reed-Solomon Codes -- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) -- The Randomized Coloring Procedure with Symmetry-Breaking -- The Local Nature of List Colorings for Graphs of High Girth -- Approximating List-Coloring on a Fixed Surface -- Asymptotically Optimal Hitting Sets Against Polynomials -- The Smoothed Complexity of Edit Distance -- Randomized Self-assembly for Approximate Shapes -- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) -- Competitive Weighted Matching in Transversal Matroids -- Scheduling for Speed Bounded Processors -- Faster Algorithms for Incremental Topological Ordering -- Dynamic Normal Forms and Dynamic Characteristic Polynomial -- Algorithms for ?-Approximations of Terrains -- An Approximation Algorithm for Binary Searching in Trees -- Algorithms for 2-Route Cut Problems -- The Two-Edge Connectivity Survivable Network Problem in Planar Graphs -- Efficiently Testing Sparse GF(2) Polynomials -- Testing Properties of Sets of Points in Metric Spaces -- An Expansion Tester for Bounded Degree Graphs -- Property Testing on k-Vertex-Connectivity of Graphs -- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) -- On Problems without Polynomial Kernels (Extended Abstract) -- Faster Algebraic Algorithms for Path and Packing Problems -- Understanding the Complexity of Induced Subgraph Isomorphisms -- Spanners in Sparse Graphs -- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error -- All-Pairs Shortest Paths with a Sublinear Additive Error -- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations -- The Complexity of the Counting Constraint Satisfaction Problem -- On the Hardness of Losing Weight -- Product Theorems Via Semidefinite Programming -- Sound 3-Query PCPPs Are Long -- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations -- Recursive Stochastic Games with |
|
|
|
|
|
|
|
|
|
|
|
Positive Rewards -- Complementation, Disambiguation, and Determinization of Büchi Automata Unified -- Tree Projections: Hypergraph Games and Minimality -- Explicit Non-adaptive Combinatorial Group Testing Schemes -- Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination -- Impossibility of a Quantum Speed-Up with a Faulty Oracle -- Superpolynomial Speedups Based on Almost Any Quantum Circuit -- The Speed of Convergence in Congestion Games under Best-Response Dynamics -- Uniform Budgets and the Envy-Free Pricing Problem -- Bayesian Combinatorial Auctions -- Truthful Unification Framework for Packing Integer Programs with Choices -- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing -- Finding Optimal Flows Efficiently -- Optimal Quantum Adversary Lower Bounds for Ordered Search -- Quantum SAT for a Qutrit-Cinquit Pair Is QMA 1-Complete -- Superpolynomial Speedups Based on Almost Any Quantum Circuit. |
|
|
|
|
|
|
Sommario/riassunto |
|
The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from a total of 407 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games, on logic, semantics, and theory of programming, and on security and cryptography foundations. LNCS 5125 contains 70 contributions of track A selected from 269 submissions as well as 2 invited lectures. The papers are organized in topical sections on complexity: boolean functions and circuits, data structures, random walks and random structures, design and analysis of algorithms, scheduling, codes and coding, coloring, randomness in computation, online and dynamic algorithms, approximation algorithms, property testing, parameterized algorithms and complexity, graph algorithms, computational complexity, games and automata, group testing, streaming, and quantum, algorithmic game theory, and quantum computing. |
|
|
|
|
|
|
|
| |