Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Engines of Order : A Mechanology of Algorithmic Techniques
| Engines of Order : A Mechanology of Algorithmic Techniques |
| Autore | Rieder Bernhard |
| Pubbl/distr/stampa | Amsterdam, : Amsterdam University Press, 2020 |
| Descrizione fisica | 1 online resource (353 p.) |
| Collana | Recursions |
| Soggetto topico |
Algorithms & data structures
Information architecture Media studies |
| Soggetto non controllato |
algorithms & data structures
information architecture media studies |
| ISBN |
1-04-077749-X
1-003-69478-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Engines of Order |
| Record Nr. | UNINA-9910557184803321 |
Rieder Bernhard
|
||
| Amsterdam, : Amsterdam University Press, 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
From Opinion Mining to Financial Argument Mining
| From Opinion Mining to Financial Argument Mining |
| Autore | Chen Chung-Chi |
| Pubbl/distr/stampa | Springer Nature, 2021 |
| Descrizione fisica | 1 online resource (102 pages) |
| Altri autori (Persone) |
HuangHen-Hsen
ChenHsin-Hsi |
| Collana | SpringerBriefs in Computer Science |
| Soggetto topico |
Natural language & machine translation
Data mining Algorithms & data structures Artificial intelligence Information technology: general issues |
| Soggetto non controllato |
Natural Language Processing (NLP)
Data Mining and Knowledge Discovery Data Structures and Information Theory Artificial Intelligence Computer Applications Data Science Computer and Information Systems Applications Open Access financial opinion mining text mining in finance financial technology application FinTech argument mining in finance opinion quality evaluation numeral understanding Natural language & machine translation Data mining Expert systems / knowledge-based systems Algorithms & data structures Information theory Information technology: general issues |
| ISBN | 981-16-2881-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996464443103316 |
|
Chen Chung-Chi
|
||
| Springer Nature, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
From Opinion Mining to Financial Argument Mining
| From Opinion Mining to Financial Argument Mining |
| Autore | Chen Chung-Chi |
| Pubbl/distr/stampa | Springer Nature, 2021 |
| Descrizione fisica | 1 online resource (102 pages) |
| Altri autori (Persone) |
HuangHen-Hsen
ChenHsin-Hsi |
| Collana | SpringerBriefs in Computer Science |
| Soggetto topico |
Natural language & machine translation
Data mining Algorithms & data structures Artificial intelligence Information technology: general issues |
| Soggetto non controllato |
Natural Language Processing (NLP)
Data Mining and Knowledge Discovery Data Structures and Information Theory Artificial Intelligence Computer Applications Data Science Computer and Information Systems Applications Open Access financial opinion mining text mining in finance financial technology application FinTech argument mining in finance opinion quality evaluation numeral understanding Natural language & machine translation Data mining Expert systems / knowledge-based systems Algorithms & data structures Information theory Information technology: general issues |
| ISBN | 981-16-2881-5 |
| Classificazione | COM004000COM018000COM021030COM031000COM073000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910482868303321 |
|
Chen Chung-Chi
|
||
| Springer Nature, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Matching minors in bipartite graphs
| Matching minors in bipartite graphs |
| Autore | Wiederrecht Sebastian |
| Pubbl/distr/stampa | Berlin, : Universitätsverlag der Technischen Universität Berlin, 2022 |
| Descrizione fisica | 1 electronic resource (476 p.) |
| Collana | Foundations of computing |
| Soggetto topico | Algorithms & data structures |
| Soggetto non controllato | matching minor; structural graph theory; bipartite; perfect matching |
| ISBN | 3-7983-3253-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910582201003321 |
|
Wiederrecht Sebastian
|
||
| Berlin, : Universitätsverlag der Technischen Universität Berlin, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Special Topics in Information Technology
| Special Topics in Information Technology |
| Autore | Geraci Angelo |
| Pubbl/distr/stampa | Springer Nature, 2021 |
| Descrizione fisica | 1 online resource (150 pages) |
| Collana | SpringerBriefs in Applied Sciences and Technology |
| Soggetto topico |
Communications engineering / telecommunications
Automatic control engineering Algorithms & data structures |
| Soggetto non controllato |
Communications Engineering, Networks
Control and Systems Theory Data Structures and Information Theory Information Technology PhD Springer Award Politecnico DEIB Polimi PhD School artificial intelligence computer system architectures Telecommunications Open access Communications engineering / telecommunications Automatic control engineering Algorithms & data structures Information theory |
| ISBN | 3-030-62476-5 |
| Classificazione | COM031000TEC004000TEC041000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Contents -- Part ITelecommunications -- 1 Machine-Learning Defined Networking: Towards Intelligent Networks -- 1.1 Introduction -- 1.2 Network Traffic Prediction -- 1.3 Network Traffic Pattern Identification -- 1.4 Reinforcement Learning for Adaptive Network Resource Allocation -- 1.5 Implementation of Machine Learning in Real SDN/NFV Testbeds -- 1.6 Concluding Remarks -- References -- 2 Traffic Management in Networks with Programmable Data Planes -- 2.1 Software-Defined Networks (SDN) -- 2.2 Control Plane Programmability -- 2.2.1 Traffic Engineering Framework -- 2.2.2 ONOS Intent Monitor and Reroute Service -- 2.3 Data Plane Programmability -- 2.3.1 Network Failures -- 2.3.2 Network Congestion -- 2.4 Conclusions -- References -- Part IIElectronics -- 3 Frequency Synthesizers Based on Fast-Locking Bang-Bang PLL for Cellular Applications -- 3.1 Introduction -- 3.2 Digital PLL: Output Phase Noise and Locking Transient -- 3.3 Multi-loop Architecture for Fast Locking Transient -- 3.4 Measurement results -- 3.5 Conclusions -- References -- 4 Inductorless Frequency Synthesizers for Low-Cost Wireless -- 4.1 Introduction -- 4.2 Fractional-N MDLLs -- 4.3 Jitter-Power Tradeoff Analysis -- 4.4 DTC Range-Reduction Technique -- 4.5 Implemented Architecture -- 4.6 Measurement Results -- 4.7 Conclusion -- References -- 5 Characterization and Modeling of Spin-Transfer Torque (STT) Magnetic Memory for Computing Applications -- 5.1 Introduction -- 5.2 Spin-Transfer Torque Magnetic Memory (STT-MRAM) -- 5.3 Understanding Dielectric Breakdown-Limited Cycling Endurance -- 5.4 Modeling Stochastic Switching in STT-MRAM -- 5.5 Stochastic STT Switching for Security and Computing -- 5.6 Conclusions -- References -- 6 One Step in-Memory Solution of Inverse Algebraic Problems -- 6.1 Introduction -- 6.2 In Memory Computing.
6.3 In-Memory Matrix-Vector-Multiplication Accelerator -- 6.4 One Step in-Memory Solution of Inverse Algebraic Problems -- 6.4.1 In-Memory Solution of Linear Systems in One-Step -- 6.4.2 In-Memory Eigenvectors Calculation in One-Step -- 6.4.3 In-Memory Regression and Classification in One-Step -- 6.5 Conclusions -- References -- 7 Development of a 3'' LaBr3 SiPM-Based Detection Module for High Resolution Gamma Ray Spectroscopy and Imaging -- 7.1 Introduction -- 7.2 Development -- References -- Part IIIComputer Science and Engineering -- 8 Velocity on the Web -- 8.1 Introduction -- 8.2 Background -- 8.3 Problem Statement -- 8.4 Major Results -- 8.5 Conclusion -- References -- 9 Preplay Communication in Multi-Player Sequential Games: An Overview of Recent Results -- 9.1 Introduction -- 9.1.1 Motivating Example -- 9.1.2 Sequential Games with Imperfect Information -- 9.1.3 Preplay Communication -- 9.2 Adversarial Team Games -- 9.3 Correlated Equilibria in Sequential Games -- 9.4 Bayesian Persuasion with Sequential Games -- 9.5 Discussion and Future Research -- References -- Part IVSystems and Control -- 10 Leadership Games: Multiple Followers, Multiple Leaders, and Perfection -- 10.1 Introduction -- 10.2 The Stackelberg Paradigm -- 10.3 Stackelberg Games with Multiple Followers -- 10.3.1 Norma-Form Stackelberg Games -- 10.3.2 Stackelberg Polymatrix Games -- 10.3.3 Stackelberg Congestion Games -- 10.4 Stackelberg Games with Multiple Leaders -- 10.5 Trembling-Hand Perfection in Stackelberg Games -- References -- 11 Advancing Joint Design and Operation of Water Resources Systems Under Uncertainty -- 11.1 Introduction -- 11.1.1 Research Challenges -- 11.2 Reinforcement Learning for Designing Water Reservoirs -- 11.2.1 pFQI Algorithm -- 11.2.2 Comparison with Traditional Least Cost Dam Design -- 11.3 A Novel Robust Assessment Framework. 11.3.1 Methodological Approach -- 11.3.2 Assessing Robustness of Alternatives for Changing Demands and Hydrology -- 11.4 Conclusions -- References -- 12 Optimization-Based Control of Microgrids for Ancillary Services Provision and Islanded Operation -- 12.1 Introduction -- 12.2 Microgrids Aggregators Providing Ancillary Services -- 12.2.1 Offline Economic Dispatch and Power Reserve Procurement -- 12.2.2 Online External Provision of Ancillary Services -- 12.2.3 Real-Time Self-balancing of Internal Power Uncertainties -- 12.3 Hierarchical Model Predictive Control Architectures for Islanded Microgrids -- 12.4 Conclusions -- References -- 13 Allowing a Real Collaboration Between Humans and Robots -- 13.1 Introduction -- 13.2 Recognizing the Human Actions -- 13.3 Predicting the Human Actions -- 13.4 Assistive Scheduling -- 13.5 Results -- 13.6 Conclusions -- References. |
| Record Nr. | UNINA-9910473458303321 |
|
Geraci Angelo
|
||
| Springer Nature, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Sublinear Computation Paradigm [[electronic resource] ] : Algorithmic Revolution in the Big Data Era
| Sublinear Computation Paradigm [[electronic resource] ] : Algorithmic Revolution in the Big Data Era |
| Autore | Katoh Naoki |
| Pubbl/distr/stampa | Singapore, : Springer Singapore Pte. Limited, 2021 |
| Descrizione fisica | 1 online resource (403 p.) |
| Altri autori (Persone) |
HigashikawaYuya
ItoHiro NagaoAtsuki ShibuyaTetsuo SljokaAdnan TanakaKazuyuki UnoYushi |
| Soggetto topico |
Algorithms & data structures
Numerical analysis |
| Soggetto non controllato |
Sublinear Algorithms
polynomial time algorithms Constant-Time Algorithms Sublinear Computation Paradigm open access |
| ISBN | 981-16-4095-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Contents -- Part I Introduction -- 1 What Is the Sublinear Computation Paradigm? -- 1.1 We Are in the Era of Big Data -- 1.2 Theory of Computational Complexity and Polynomial-Time Algorithms -- 1.3 Polynomial-Time Algorithms and Sublinear-Time Algorithms -- 1.3.1 A Brief History of Polynomial-Time Algorithms -- 1.3.2 Emergence of Sublinear-Time Algorithms -- 1.3.3 Property Testing and Parameter Testing -- 1.4 Ways to Decrease Computational Resources -- 1.4.1 Streaming Algorithms -- 1.4.2 Compression -- 1.4.3 Succinct Data Structures
1.5 Need for the Sublinear Computation Paradigm -- 1.5.1 Sublinear and Polynomial Computation Are Both Important -- 1.5.2 Research Project ABD -- 1.5.3 The Organization of This Book -- References -- Part II Sublinear Algorithms -- 2 Property Testing on Graphs and Games -- 2.1 Introduction -- 2.2 Basic Terms and Definitions for Property Testing -- 2.2.1 Graphs and the Three Models for Property Testing -- 2.2.2 Properties, Distances, and Testers -- 2.3 Important Known Results in Property Testing on Graphs -- 2.3.1 Results for the Dense-Graph Model -- 2.3.2 Results for the Bounded-Degree Model 2.3.3 Results for the General-Graph Model -- 2.4 Characterization of Testability on Bounded-Degree Digraphs -- 2.4.1 Bounded-Degree Model of Digraphs -- 2.4.2 Monotone Properties and Hereditary Properties -- 2.4.3 Characterizations -- 2.4.4 An Idea to Extend the Characterizations Beyond Monotone and Hereditary -- 2.5 Testable EXPTIME-Complete Games -- 2.5.1 Definitions -- 2.5.2 Testers for Generalized Chess, Shogi, and Xiangqi -- 2.6 Summary -- References -- 3 Constant-Time Algorithms for Continuous Optimization Problems -- 3.1 Introduction -- 3.2 Graph Limit Theory 3.3 Quadratic Function Minimization -- 3.3.1 Proof of Theorem 3.1 -- 3.4 Tensor Decomposition -- 3.4.1 Preliminaries -- 3.4.2 Proof of Theorem 3.2 -- 3.4.3 Proof of Lemma 3.4 -- 3.4.4 Proof of Lemma 3.5 -- References -- 4 Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs -- 4.1 Packing and Covering Semidefinite Programs -- 4.2 Applications -- 4.2.1 SDP relaxation for Robust MaxCut -- 4.2.2 Mahalanobis Distance Learning -- 4.2.3 Related Work -- 4.3 General Framework for Packing-Covering SDPs -- 4.4 Scalar Algorithms 4.4.1 Scalar MWU Algorithm for (Packing-I)-(Covering-I) -- 4.4.2 Scalar Logarithmic Potential Algorithm For (Packing-I)-(Covering-I) -- 4.5 Matrix Algorithms -- 4.5.1 Matrix MWU Algorithm For (Covering-II)-(Packing-II) -- 4.5.2 Matrix Logarithmic Potential Algorithm For (Packing-I)-(Covering-I) -- 4.5.3 Matrix Logarithmic Potential Algorithm For (Packing-II)-(Covering-II) -- References -- 5 Almost Linear Time Algorithms for Some Problems on Dynamic Flow Networks -- 5.1 Introduction -- 5.2 Preliminaries -- 5.3 Objective Functions -- 5.3.1 Objective Functions for the 1-Sink Problem 5.3.2 Objective Functions for k-Sink |
| Record Nr. | UNISA-996464552103316 |
|
Katoh Naoki
|
||
| Singapore, : Springer Singapore Pte. Limited, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
