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.
11th Chaotic Modeling and Simulation International Conference / / edited by Christos H. Skiadas, Ihor Lubashevsky
| 11th Chaotic Modeling and Simulation International Conference / / edited by Christos H. Skiadas, Ihor Lubashevsky |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (314 pages) |
| Disciplina |
003.857
003.857015118 |
| Collana | Springer Proceedings in Complexity |
| Soggetto topico |
Statistical physics
Dynamical systems Computer simulation Computational complexity Technology Game theory Complex Systems Simulation and Modeling Complexity Applied Science, multidisciplinary Game Theory, Economics, Social and Behav. Sciences |
| ISBN | 3-030-15297-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910337880903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
12th Chaotic Modeling and Simulation International Conference [[electronic resource] /] / edited by Christos H. Skiadas, Yiannis Dimotikalis
| 12th Chaotic Modeling and Simulation International Conference [[electronic resource] /] / edited by Christos H. Skiadas, Yiannis Dimotikalis |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XI, 306 p. 118 illus., 61 illus. in color.) |
| Disciplina | 003.857 |
| Collana | Springer Proceedings in Complexity |
| Soggetto topico |
Statistical physics
Dynamical systems Computer simulation Computational complexity Technology Game theory Complex Systems Simulation and Modeling Complexity Applied Science, multidisciplinary Game Theory, Economics, Social and Behav. Sciences |
| ISBN | 3-030-39515-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Active Nanoobjects, Neutrino and Higgs Boson in a Fractal Models of the Universe.-Coupled Fractal Structures with Elements of Cylindrical Type -- Brain dynamics explained by means of spectral-structural neuronal networks -- Effect of long-range spreading on two-species reaction-diffusion system -- Special Sensitive System via Furstenberg family and its applications -- Mosaic patterns in reaction-diffusion systems -- Modulating the Light-Driven conductivity in Biosystem -- Approaches to Estimating the Dynamics of Interacting Populations with Impulse Effects and Uncertainty -- Tricritical directed percolation with long-range spreading -- Anisotropic MHD Turbulence Near Two Spatial Dimensions: General Field Theoretic Renormalization Group Analysis -- Intermittency of Chaos Functions and the Belousov-Zhabotinsky Reaction -- Reaction-Diffusion Systems and Propagation of Limit Cycles with Chaotic Dynamics -- Decision-making in a context of uncertainty -- Microwave oven plasma reactor moding and its detection -- Unexpected Properties of Open Quantum Graphs and Microwave Networks -- Dynamics of a Cournot duopoly game with differentiated goods between public and private firms -- Influence of the Heart Rate on Dynamics of Cardiorespiratory System -- Threshold Method for Control of Chaotic Oscillations -- Some Implications of Invariant Model of Boltzmann Statistical Mechanics to the Gap between Physics and Mathematics -- Deterministic Irreversibility Mechanism and Basic Element of Matter -- Global Indeterminacy and Invariant Manifolds near Homoclinic Orbit to a Real Saddle in a Resource Optimal System -- The method of singular integral equations in the theory of microstrip antennas based on chiral metamaterials -- Microstrip and fractal antennas based on chiral metamaterials in MIMO systems. . |
| Record Nr. | UNISA-996418179803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
12th Chaotic Modeling and Simulation International Conference / / edited by Christos H. Skiadas, Yiannis Dimotikalis
| 12th Chaotic Modeling and Simulation International Conference / / edited by Christos H. Skiadas, Yiannis Dimotikalis |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XI, 306 p. 118 illus., 61 illus. in color.) |
| Disciplina | 003.857 |
| Collana | Springer Proceedings in Complexity |
| Soggetto topico |
Statistical physics
Dynamics Computer simulation Computational complexity Technology Game theory Complex Systems Simulation and Modeling Complexity Applied Science, multidisciplinary Game Theory, Economics, Social and Behav. Sciences |
| ISBN | 3-030-39515-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Active Nanoobjects, Neutrino and Higgs Boson in a Fractal Models of the Universe.-Coupled Fractal Structures with Elements of Cylindrical Type -- Brain dynamics explained by means of spectral-structural neuronal networks -- Effect of long-range spreading on two-species reaction-diffusion system -- Special Sensitive System via Furstenberg family and its applications -- Mosaic patterns in reaction-diffusion systems -- Modulating the Light-Driven conductivity in Biosystem -- Approaches to Estimating the Dynamics of Interacting Populations with Impulse Effects and Uncertainty -- Tricritical directed percolation with long-range spreading -- Anisotropic MHD Turbulence Near Two Spatial Dimensions: General Field Theoretic Renormalization Group Analysis -- Intermittency of Chaos Functions and the Belousov-Zhabotinsky Reaction -- Reaction-Diffusion Systems and Propagation of Limit Cycles with Chaotic Dynamics -- Decision-making in a context of uncertainty -- Microwave oven plasma reactor moding and its detection -- Unexpected Properties of Open Quantum Graphs and Microwave Networks -- Dynamics of a Cournot duopoly game with differentiated goods between public and private firms -- Influence of the Heart Rate on Dynamics of Cardiorespiratory System -- Threshold Method for Control of Chaotic Oscillations -- Some Implications of Invariant Model of Boltzmann Statistical Mechanics to the Gap between Physics and Mathematics -- Deterministic Irreversibility Mechanism and Basic Element of Matter -- Global Indeterminacy and Invariant Manifolds near Homoclinic Orbit to a Real Saddle in a Resource Optimal System -- The method of singular integral equations in the theory of microstrip antennas based on chiral metamaterials -- Microstrip and fractal antennas based on chiral metamaterials in MIMO systems. . |
| Record Nr. | UNINA-9910380738703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
17th IEEE Annual Conference on Computational Complexity (CCC 2002)
| 17th IEEE Annual Conference on Computational Complexity (CCC 2002) |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society Press, 2002 |
| Descrizione fisica | 1 online resource (xii, 205 pages) : illustrations |
| Disciplina | 511.3 |
| Soggetto topico | Computational complexity |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Committees -- Ron Book Prize for Best Student Paper -- 2002 Best Paper Award -- Resolution Lower Bounds for the Weak Pigeonhole Principle -- Hard examples for bounded depth frege -- Resolution lower bounds for the weak pigeon hole principle -- Hard examples for bounded depth Frege -- Improved cryptographic hash functions with worst-case/average-case connection -- Algorithmic derandomization via complexity theory -- Pseudo-random generators for all hardnesses -- Randomness conductors and constant-degree lossless expanders -- Expanders from symmetric codes -- The complexity of approximating the entropy -- Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems -- On communication over an entanglement-assisted quantum channel -- Hardness amplification within NP -- 3-MANIFOLD KNOT GENUS is NP-complete -- On the power of unique 2-prover 1-round games -- Learnability beyond AC/sup 0/ -- Resolution lower bounds for perfect matching principles -- Resolution width-size trade-offs for the Pigeon-Hole Principle -- The inapproximability of lattice and coding problems with preprocessing -- Sampling short lattice vectors and the closest lattice vector problem -- The history of complexity -- The correlation between parity and quadratic polynomials mod 3 -- Functions that have read-twice constant width branching programs are not necessarily testable -- On the complexity of integer multiplication in branching programs with multiple tests and in read-once branching programs with limited nondeterminism -- Information theory methods in communication complexity -- Extracting quantum entanglement (general entanglement purification protocols) -- Algebras of minimal rank over perfect fields -- Rapid mixing -- Pseudorandomness and average-case complexity via uniform reductions -- Pseudo-random generators and structure of complete degrees -- Decoding concatenated codes using soft information -- Arthur and Merlin in a quantum world -- Streaming computation of combinatorial objects -- Lower bounds for linear locally decodable codes and private information retrieval -- Better lower bounds for locally decodable codes -- Universal arguments and their applications -- Author index. |
| Record Nr. | UNINA-9910872712803321 |
| [Place of publication not identified], : IEEE Computer Society Press, 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
1834-2019 - IEEE Standard for Technology Supervision Code for Wind Turbine Rotor Systems / / Institute of Electrical and Electronics Engineers
| 1834-2019 - IEEE Standard for Technology Supervision Code for Wind Turbine Rotor Systems / / Institute of Electrical and Electronics Engineers |
| Pubbl/distr/stampa | New York, New York : , : IEEE, , 2020 |
| Descrizione fisica | 1 online resource (22 pages) |
| Disciplina | 629.8 |
| Soggetto topico |
Supervisory control systems
Computational complexity |
| ISBN | 1-5044-6256-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910389519403321 |
| New York, New York : , : IEEE, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
1834-2019 - IEEE Standard for Technology Supervision Code for Wind Turbine Rotor Systems / / Institute of Electrical and Electronics Engineers
| 1834-2019 - IEEE Standard for Technology Supervision Code for Wind Turbine Rotor Systems / / Institute of Electrical and Electronics Engineers |
| Pubbl/distr/stampa | New York, New York : , : IEEE, , 2020 |
| Descrizione fisica | 1 online resource (22 pages) |
| Disciplina | 629.8 |
| Soggetto topico |
Supervisory control systems
Computational complexity |
| ISBN | 1-5044-6256-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996574960603316 |
| New York, New York : , : IEEE, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The 2007 International Conference on Computational Science and its Applications : proceedings : ICCSA 2007 : Kuala Lumpur, Malaysia, August 26-29, 2007 : selected papers
| The 2007 International Conference on Computational Science and its Applications : proceedings : ICCSA 2007 : Kuala Lumpur, Malaysia, August 26-29, 2007 : selected papers |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society, 2007 |
| Disciplina | 004 |
| Soggetto topico |
Computer science
Computational complexity Engineering & Applied Sciences Computer Science |
| ISBN | 1-5090-8549-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996211347003316 |
| [Place of publication not identified], : IEEE Computer Society, 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The 2007 International Conference on Computational Science and its Applications : proceedings : ICCSA 2007 : Kuala Lumpur, Malaysia, August 26-29, 2007 : selected papers
| The 2007 International Conference on Computational Science and its Applications : proceedings : ICCSA 2007 : Kuala Lumpur, Malaysia, August 26-29, 2007 : selected papers |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society, 2007 |
| Disciplina | 004 |
| Soggetto topico |
Computer science
Computational complexity Engineering & Applied Sciences Computer Science |
| ISBN |
9781509085491
1509085491 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910142975503321 |
| [Place of publication not identified], : IEEE Computer Society, 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
2011 IEEE 26th Annual Conference on Computational Complexity
| 2011 IEEE 26th Annual Conference on Computational Complexity |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE, 2011 |
| Descrizione fisica | 1 online resource (309 pages) : illustrations |
| Disciplina | 511.3 |
| Soggetto topico | Computational complexity |
| ISBN | 0-7695-4411-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Program Committee -- Steering Committee -- Reviewers -- Best Paper Awards -- Wednesday, 8 June 2011 -- Improved Direct Product Theorems for Randomized Query Complexity -- Making Branching Programs Oblivious Requires Superlogarithmic Overhead -- Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups -- Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs -- Non-negatively Weighted #CSP: An Effective Complexity Dichotomy -- Symmetric LDPC Codes are not Necessarily Locally Testable -- Towards Lower Bounds on Locally Testable Codes via Density Arguments -- Linear-Algebraic List Decoding of Folded Reed-Solomon Codes -- Noisy Interpolation of Sparse Polynomials, and Applications -- Paris-Harrington Tautologies -- Relativized Separations of Worst-Case and Average-Case Complexities for NP -- Thursday, 9 June 2011 Non-uniform ACC Circuit Lower Bounds -- Improved Constructions of Three Source Extractors -- A New Approach to Affine Extractors and Dispersers -- Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors -- Near-Optimal and Explicit Bell Inequality Violations -- Symmetry-Assisted Adversaries for Quantum State Generation -- Approximation Algorithms for QMA-Complete Problems -- Sevag Gharibian and Julia Kempe -- On Arthur Merlin Games in Communication Complexity -- On the Minimal Fourier Degree of Symmetric Boolean Functions -- Property Testing Lower Bounds via Communication Complexity -- Friday, 10 June 2011 Pseudorandomness for Permutation and Regular Branching Programs -- Pseudorandom Generators for Combinatorial Checkerboards -- Bounded-Depth Circuits Cannot Sample Good Codes -- k-Independent Gaussians Fool Polynomial Threshold Functions -- Explicit Dimension Reduction and Its Applications -- Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae -- Tensor Rank: Some Lower and Upper Bounds -- On the Sum of Square Roots of Polynomials and Related Problems -- Linear Systems over Finite Abelian Groups -- Author Index. |
| Record Nr. | UNISA-996208797503316 |
| [Place of publication not identified], : IEEE, 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
2011 IEEE 26th Annual Conference on Computational Complexity
| 2011 IEEE 26th Annual Conference on Computational Complexity |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE, 2011 |
| Descrizione fisica | 1 online resource (309 pages) : illustrations |
| Disciplina | 511.3 |
| Soggetto topico | Computational complexity |
| ISBN |
9780769544113
0769544118 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Program Committee -- Steering Committee -- Reviewers -- Best Paper Awards -- Wednesday, 8 June 2011 -- Improved Direct Product Theorems for Randomized Query Complexity -- Making Branching Programs Oblivious Requires Superlogarithmic Overhead -- Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups -- Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs -- Non-negatively Weighted #CSP: An Effective Complexity Dichotomy -- Symmetric LDPC Codes are not Necessarily Locally Testable -- Towards Lower Bounds on Locally Testable Codes via Density Arguments -- Linear-Algebraic List Decoding of Folded Reed-Solomon Codes -- Noisy Interpolation of Sparse Polynomials, and Applications -- Paris-Harrington Tautologies -- Relativized Separations of Worst-Case and Average-Case Complexities for NP -- Thursday, 9 June 2011 Non-uniform ACC Circuit Lower Bounds -- Improved Constructions of Three Source Extractors -- A New Approach to Affine Extractors and Dispersers -- Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors -- Near-Optimal and Explicit Bell Inequality Violations -- Symmetry-Assisted Adversaries for Quantum State Generation -- Approximation Algorithms for QMA-Complete Problems -- Sevag Gharibian and Julia Kempe -- On Arthur Merlin Games in Communication Complexity -- On the Minimal Fourier Degree of Symmetric Boolean Functions -- Property Testing Lower Bounds via Communication Complexity -- Friday, 10 June 2011 Pseudorandomness for Permutation and Regular Branching Programs -- Pseudorandom Generators for Combinatorial Checkerboards -- Bounded-Depth Circuits Cannot Sample Good Codes -- k-Independent Gaussians Fool Polynomial Threshold Functions -- Explicit Dimension Reduction and Its Applications -- Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae -- Tensor Rank: Some Lower and Upper Bounds -- On the Sum of Square Roots of Polynomials and Related Problems -- Linear Systems over Finite Abelian Groups -- Author Index. |
| Record Nr. | UNINA-9910141130303321 |
| [Place of publication not identified], : IEEE, 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
