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.
From net neutrality to ICT neutrality / / Patrick Maillé and Bruno Tuffin
| From net neutrality to ICT neutrality / / Patrick Maillé and Bruno Tuffin |
| Autore | Maillé Patrick |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (194 pages) |
| Disciplina | 215 |
| Soggetto topico |
Computer science
Network neutrality |
| ISBN | 3-031-06271-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Acknowledgments -- Contents -- About the Authors -- Acronyms -- 1 Introduction: A Bit of History -- 1.1 The Advent of the Digital Economy and the Need for Regulation -- 1.2 The Internet: Worries About the Lack of Neutrality -- 1.3 New Services: New Difficulties and Potential Hindrance to Society -- 1.4 Toward ICT Neutrality? -- 1.5 Goal and Organization of This Book -- 2 Definitions -- 2.1 Several Definitions of Neutrality -- 2.2 Analysis and Comparison -- 2.3 Specialized Services -- 2.3.1 Perimeter of Specialized Services -- 2.3.2 Need for Specialized Services -- 2.3.3 Implications of Introducing a Special Class of Service -- 2.4 Zero-Rating and Sponsored Data -- 2.5 Public Consultations -- 2.6 Worldwide Implementations -- 2.6.1 North America -- 2.6.1.1 USA -- 2.6.1.2 Canada -- 2.6.1.3 Mexico -- 2.6.2 Europe -- 2.6.2.1 European Union -- 2.6.2.2 France -- 2.6.2.3 Germany -- 2.6.2.4 United Kingdom -- 2.6.2.5 The Netherlands -- 2.6.2.6 Norway -- 2.6.2.7 Slovenia -- 2.6.2.8 Russia -- 2.6.3 Asia -- 2.6.3.1 China -- 2.6.3.2 Japan -- 2.6.3.3 South Korea -- 2.6.3.4 India -- 2.6.4 Oceania -- 2.6.4.1 Australia -- 2.6.4.2 New Zealand -- 2.6.5 South America -- 2.6.5.1 Chile -- 2.6.5.2 Brazil -- 2.6.6 Africa -- 2.7 A Situation Still Evolving -- 2.8 A Trade-Off with Users Deciding Differentiation? -- 2.9 Conclusions -- 3 Pros and Cons: The Arguments in the Debate -- 3.1 The ``Freedom'' Arguments: Whose Freedom? -- 3.1.1 [Pro-NN] Net Neutrality Is Needed to Guarantee Free Speech -- 3.1.2 [Anti-NN] Net Neutrality Hinders Operators' Freedom of Enterprise -- 3.2 The ``Investment'' Arguments -- 3.2.1 [Anti-NN] Returns on Investments Are Needed -- 3.2.2 [Pro-NN] More Customers, More Investments -- 3.3 The ``Competition and Innovation'' Arguments -- 3.3.1 [Pro-NN] Non-neutrality Biases the Competition Among Services.
3.3.2 [Anti-NN] ISPs Favoring Some Content Providers Stimulates ISP Competition (Through Content) -- 3.3.3 [Pro-NN] Neutrality Is Needed to Allow Innovating Newcomers -- 3.4 The ``Security and Privacy'' Arguments -- 3.4.1 [Anti-NN] Encryption Already Prevents Discrimination -- 3.4.2 [Pro-NN] Neutrality Helps Protect Privacy -- 3.5 The ``Welfare'' Arguments -- 3.5.1 [Pro-NN] Non-neutrality Would Lead to a Fragmented Internet, Which Is Bad For Users -- 3.5.2 [Anti-NN] Content Providers Should Contribute to the Infrastructure Costs to Reduce Users' Share -- 3.5.3 [Anti-NN] A Free Market Finds the Most Efficient Outcome -- 3.6 Conclusions -- 4 Mathematical Analysis -- 4.1 Introduction to Mathematical Modeling and Game Theory -- 4.1.1 Elements of Non-cooperative Game Theory -- 4.1.2 Output Analysis -- 4.1.3 Principle of Mechanism Design -- 4.2 A Basic Model -- 4.3 Model with Two Content Providers -- 4.3.1 Pricing Game Between CPs (α=2) -- 4.3.2 Fully Neutral Case (α=2) -- 4.3.3 Weakly Neutral Case (α=2) -- 4.3.4 Non-neutral Case (α=2) -- 4.3.5 Comparison -- 4.4 Other Conclusions from the Literature -- 4.5 Additional Notes -- 5 Non-neutrality Pushed by Content Providers -- 5.1 Non-neutrality as a Barrier to Entry Protecting Incumbents -- 5.1.1 Modeling the Impact of a New Entrant CP -- 5.1.2 Actors' Revenues and Decision Time Scales -- 5.1.2.1 CP Revenues -- 5.1.2.2 ISP Revenue -- 5.1.2.3 Order of Decisions -- 5.1.3 Analyzing the Game for Fixed Side Payments -- 5.1.3.1 User Decisions -- 5.1.3.2 ISP Subscription Price pA -- 5.1.3.3 Should the New CP Enter the Market? -- 5.1.3.4 Illustration Example: Impact of the Side Payment -- 5.1.4 Can the ISP and the Incumbent CP Agree on Side Payments? -- 5.1.4.1 Side Payments Maximizing the ISP Revenue Are Not Sustainable -- 5.1.4.2 Can Side Payments Benefit Both the Incumbent CP and the ISP?. 5.1.4.3 How Can the ISP and Incumbent CP Agree on a Side Payment Level? -- 5.1.4.4 What About Users? Should the Regulator Intervene? -- 5.1.5 Refining the Model -- 5.2 Sponsored Data and Zero Rating -- 5.2.1 Modeling Sponsored-Data Practices in a Competitive ISP Context -- 5.2.1.1 Users' Decisions and Preferences -- 5.2.1.2 The CP Side: Advertising and Sponsoring -- 5.2.1.3 ISP Price Competition -- 5.2.1.4 Order of Decisions -- 5.2.2 How Does the CP Decide to Sponsor and Add Advertisement? -- 5.2.2.1 The Pricing Game Played by ISPs -- 5.2.3 A Practice Finally Mostly Benefiting ISPs? -- 5.3 When Big CPs Designate the ``Good'' ISPs: Incentivizing Non-neutrality Without Paying -- 5.3.1 ISP Competition: The Importance of Looking Good -- 5.3.2 A Two-ISP, Two-CP model with Heterogeneous Users -- 5.3.2.1 Modelling Consumer (Heterogeneous) Usage of Different CPs -- 5.3.2.2 ISPs Deciding How to Allocate Their Capacity Affects CP Quality -- 5.3.2.3 Introducing Some Asymmetry Among CPs: Required Throughput -- 5.3.2.4 Users Care About the Quality of the Services They Use! -- 5.3.2.5 A (Simple) Game on Differentiation -- 5.3.3 User Equilibria: How ISP Decisions Affect User Subscription Choices -- 5.3.4 The Game Among ISPs and Its Consequences -- 5.3.4.1 At the Equilibrium, Both ISPs Differentiate the Same Way -- 5.3.4.2 Equilibrium vs Neutral Capacity Allocation: Neutrality Hindering Innovation? -- 5.3.4.3 Equilibrium vs Neutral Capacity Allocation: No Impact for ISPs -- 5.3.4.4 Equilibrium vs Neutral Capacity Allocation: What About Users? -- 5.3.5 A Model Yielding Unexpected Conclusions -- 5.4 Conclusions -- 6 A More General View of Neutrality -- 6.1 Is It Relevant to Generalize Network Neutrality? -- 6.2 Content Delivery Networks: Intermediaries Flying Under the Radar? -- 6.2.1 Introduction to CDN Role and Impact. 6.2.2 Model Illustrating the Impact of CDNs on Competition Between CPs -- 6.2.3 Model Illustrating the Impact of CDNs on Competition Between ISPs -- 6.3 Issues Related to Vertical Integration -- 6.3.1 Vertical Integration and the Internet Ecosystem -- 6.3.2 Illustration of Vertical Integration on Our Basic Model -- 6.3.3 Other Illustrations and Results from Models -- 6.4 Device Neutrality -- 6.5 Neutrality of Structuring Platforms -- 6.6 Also Toward Data Neutrality? -- 7 Search Neutrality -- 7.1 Is It in Search Engines' Interest to Be Neutral? -- 7.1.1 Modeling the Long-Term vs. Short-Term Gains Trade-Off -- 7.1.1.1 Modeling Requests as Random Pairs of Vectors -- 7.1.1.2 Click-Through-Rate: Impact of Position and Relevance -- 7.1.1.3 Frequency of Requests and SE Objective Function -- 7.1.1.4 How Would a Neutral SE Work? -- 7.1.2 The Revenue-Maximizing Ranking Policy: An (Almost) Explicit Trade-Off Between Relevance and Gains -- 7.1.3 Neutral vs. Non-neutral Search Engine: What Are the Differences? -- 7.1.3.1 A Simple Example with 10 Actors -- 7.1.3.2 Ad Revenues Are Good for Result Quality! -- 7.1.3.3 Should Users Care Whether Their SE Is Neutral? -- 7.1.3.4 Quantifying How Non-neutrality Distorts Competition Among CPs -- 7.1.3.5 Impact of Search (Non-)Neutrality on Innovation -- 7.2 Detecting Bias and Trying to Build a ``Neutral'' Search Engine -- 7.2.1 A Look At Related Contributions -- 7.2.2 An Estimation of Page Relevance: Average Page Visibility -- 7.2.3 Quantifying How ``Consensual'' a Search Engine Is:The SE Score -- 7.2.4 Pointing Out Possible Bias: Statistical Tests -- 7.2.5 Aggregating Results from SEs to Create Meta-SEs -- 7.2.5.1 The Consensus Ranking -- 7.2.5.2 The Majority Judgment Ranking -- 7.2.5.3 Robustness to Bias: Consensus Ranking vs Majority Judgment -- 7.2.6 A Few Observations from a Campaign on 1000 Search Terms. 7.2.6.1 The ``Chrome'' Search Term -- 7.3 Conclusion -- 8 Algorithmic Transparency -- 8.1 Algorithmic Transparency and Structuring Platforms: Why Introduce Scrutiny? -- 8.2 Worries About the Transparency of Artificial Intelligence Algorithms -- 8.3 How to Proceed? -- 8.4 Fake News, Manipulation of Opinions, Hatred, and Fact Checking -- 8.5 Conclusion on Transparency and Neutrality -- 9 Tools to Monitor Neutrality -- 9.1 Why Are Specific Tools Needed? -- 9.2 Tools for the Monitoring of ISPs -- 9.2.1 Potential Infringements -- 9.2.2 Available Tools -- 9.2.3 The Limits of the Existing Tools -- 9.3 Monitoring Other Actors -- 9.3.1 Monitoring CDNs -- 9.3.2 Monitoring Search Engines -- 9.4 Tools and Algorithmic Transparency -- 9.5 Fact-Checking Tools -- 10 Conclusions -- References. |
| Record Nr. | UNINA-9910629278203321 |
Maillé Patrick
|
||
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
From net neutrality to ICT neutrality / / Patrick Maillé and Bruno Tuffin
| From net neutrality to ICT neutrality / / Patrick Maillé and Bruno Tuffin |
| Autore | Maillé Patrick |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (194 pages) |
| Disciplina | 215 |
| Soggetto topico |
Computer science
Network neutrality |
| ISBN | 3-031-06271-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Acknowledgments -- Contents -- About the Authors -- Acronyms -- 1 Introduction: A Bit of History -- 1.1 The Advent of the Digital Economy and the Need for Regulation -- 1.2 The Internet: Worries About the Lack of Neutrality -- 1.3 New Services: New Difficulties and Potential Hindrance to Society -- 1.4 Toward ICT Neutrality? -- 1.5 Goal and Organization of This Book -- 2 Definitions -- 2.1 Several Definitions of Neutrality -- 2.2 Analysis and Comparison -- 2.3 Specialized Services -- 2.3.1 Perimeter of Specialized Services -- 2.3.2 Need for Specialized Services -- 2.3.3 Implications of Introducing a Special Class of Service -- 2.4 Zero-Rating and Sponsored Data -- 2.5 Public Consultations -- 2.6 Worldwide Implementations -- 2.6.1 North America -- 2.6.1.1 USA -- 2.6.1.2 Canada -- 2.6.1.3 Mexico -- 2.6.2 Europe -- 2.6.2.1 European Union -- 2.6.2.2 France -- 2.6.2.3 Germany -- 2.6.2.4 United Kingdom -- 2.6.2.5 The Netherlands -- 2.6.2.6 Norway -- 2.6.2.7 Slovenia -- 2.6.2.8 Russia -- 2.6.3 Asia -- 2.6.3.1 China -- 2.6.3.2 Japan -- 2.6.3.3 South Korea -- 2.6.3.4 India -- 2.6.4 Oceania -- 2.6.4.1 Australia -- 2.6.4.2 New Zealand -- 2.6.5 South America -- 2.6.5.1 Chile -- 2.6.5.2 Brazil -- 2.6.6 Africa -- 2.7 A Situation Still Evolving -- 2.8 A Trade-Off with Users Deciding Differentiation? -- 2.9 Conclusions -- 3 Pros and Cons: The Arguments in the Debate -- 3.1 The ``Freedom'' Arguments: Whose Freedom? -- 3.1.1 [Pro-NN] Net Neutrality Is Needed to Guarantee Free Speech -- 3.1.2 [Anti-NN] Net Neutrality Hinders Operators' Freedom of Enterprise -- 3.2 The ``Investment'' Arguments -- 3.2.1 [Anti-NN] Returns on Investments Are Needed -- 3.2.2 [Pro-NN] More Customers, More Investments -- 3.3 The ``Competition and Innovation'' Arguments -- 3.3.1 [Pro-NN] Non-neutrality Biases the Competition Among Services.
3.3.2 [Anti-NN] ISPs Favoring Some Content Providers Stimulates ISP Competition (Through Content) -- 3.3.3 [Pro-NN] Neutrality Is Needed to Allow Innovating Newcomers -- 3.4 The ``Security and Privacy'' Arguments -- 3.4.1 [Anti-NN] Encryption Already Prevents Discrimination -- 3.4.2 [Pro-NN] Neutrality Helps Protect Privacy -- 3.5 The ``Welfare'' Arguments -- 3.5.1 [Pro-NN] Non-neutrality Would Lead to a Fragmented Internet, Which Is Bad For Users -- 3.5.2 [Anti-NN] Content Providers Should Contribute to the Infrastructure Costs to Reduce Users' Share -- 3.5.3 [Anti-NN] A Free Market Finds the Most Efficient Outcome -- 3.6 Conclusions -- 4 Mathematical Analysis -- 4.1 Introduction to Mathematical Modeling and Game Theory -- 4.1.1 Elements of Non-cooperative Game Theory -- 4.1.2 Output Analysis -- 4.1.3 Principle of Mechanism Design -- 4.2 A Basic Model -- 4.3 Model with Two Content Providers -- 4.3.1 Pricing Game Between CPs (α=2) -- 4.3.2 Fully Neutral Case (α=2) -- 4.3.3 Weakly Neutral Case (α=2) -- 4.3.4 Non-neutral Case (α=2) -- 4.3.5 Comparison -- 4.4 Other Conclusions from the Literature -- 4.5 Additional Notes -- 5 Non-neutrality Pushed by Content Providers -- 5.1 Non-neutrality as a Barrier to Entry Protecting Incumbents -- 5.1.1 Modeling the Impact of a New Entrant CP -- 5.1.2 Actors' Revenues and Decision Time Scales -- 5.1.2.1 CP Revenues -- 5.1.2.2 ISP Revenue -- 5.1.2.3 Order of Decisions -- 5.1.3 Analyzing the Game for Fixed Side Payments -- 5.1.3.1 User Decisions -- 5.1.3.2 ISP Subscription Price pA -- 5.1.3.3 Should the New CP Enter the Market? -- 5.1.3.4 Illustration Example: Impact of the Side Payment -- 5.1.4 Can the ISP and the Incumbent CP Agree on Side Payments? -- 5.1.4.1 Side Payments Maximizing the ISP Revenue Are Not Sustainable -- 5.1.4.2 Can Side Payments Benefit Both the Incumbent CP and the ISP?. 5.1.4.3 How Can the ISP and Incumbent CP Agree on a Side Payment Level? -- 5.1.4.4 What About Users? Should the Regulator Intervene? -- 5.1.5 Refining the Model -- 5.2 Sponsored Data and Zero Rating -- 5.2.1 Modeling Sponsored-Data Practices in a Competitive ISP Context -- 5.2.1.1 Users' Decisions and Preferences -- 5.2.1.2 The CP Side: Advertising and Sponsoring -- 5.2.1.3 ISP Price Competition -- 5.2.1.4 Order of Decisions -- 5.2.2 How Does the CP Decide to Sponsor and Add Advertisement? -- 5.2.2.1 The Pricing Game Played by ISPs -- 5.2.3 A Practice Finally Mostly Benefiting ISPs? -- 5.3 When Big CPs Designate the ``Good'' ISPs: Incentivizing Non-neutrality Without Paying -- 5.3.1 ISP Competition: The Importance of Looking Good -- 5.3.2 A Two-ISP, Two-CP model with Heterogeneous Users -- 5.3.2.1 Modelling Consumer (Heterogeneous) Usage of Different CPs -- 5.3.2.2 ISPs Deciding How to Allocate Their Capacity Affects CP Quality -- 5.3.2.3 Introducing Some Asymmetry Among CPs: Required Throughput -- 5.3.2.4 Users Care About the Quality of the Services They Use! -- 5.3.2.5 A (Simple) Game on Differentiation -- 5.3.3 User Equilibria: How ISP Decisions Affect User Subscription Choices -- 5.3.4 The Game Among ISPs and Its Consequences -- 5.3.4.1 At the Equilibrium, Both ISPs Differentiate the Same Way -- 5.3.4.2 Equilibrium vs Neutral Capacity Allocation: Neutrality Hindering Innovation? -- 5.3.4.3 Equilibrium vs Neutral Capacity Allocation: No Impact for ISPs -- 5.3.4.4 Equilibrium vs Neutral Capacity Allocation: What About Users? -- 5.3.5 A Model Yielding Unexpected Conclusions -- 5.4 Conclusions -- 6 A More General View of Neutrality -- 6.1 Is It Relevant to Generalize Network Neutrality? -- 6.2 Content Delivery Networks: Intermediaries Flying Under the Radar? -- 6.2.1 Introduction to CDN Role and Impact. 6.2.2 Model Illustrating the Impact of CDNs on Competition Between CPs -- 6.2.3 Model Illustrating the Impact of CDNs on Competition Between ISPs -- 6.3 Issues Related to Vertical Integration -- 6.3.1 Vertical Integration and the Internet Ecosystem -- 6.3.2 Illustration of Vertical Integration on Our Basic Model -- 6.3.3 Other Illustrations and Results from Models -- 6.4 Device Neutrality -- 6.5 Neutrality of Structuring Platforms -- 6.6 Also Toward Data Neutrality? -- 7 Search Neutrality -- 7.1 Is It in Search Engines' Interest to Be Neutral? -- 7.1.1 Modeling the Long-Term vs. Short-Term Gains Trade-Off -- 7.1.1.1 Modeling Requests as Random Pairs of Vectors -- 7.1.1.2 Click-Through-Rate: Impact of Position and Relevance -- 7.1.1.3 Frequency of Requests and SE Objective Function -- 7.1.1.4 How Would a Neutral SE Work? -- 7.1.2 The Revenue-Maximizing Ranking Policy: An (Almost) Explicit Trade-Off Between Relevance and Gains -- 7.1.3 Neutral vs. Non-neutral Search Engine: What Are the Differences? -- 7.1.3.1 A Simple Example with 10 Actors -- 7.1.3.2 Ad Revenues Are Good for Result Quality! -- 7.1.3.3 Should Users Care Whether Their SE Is Neutral? -- 7.1.3.4 Quantifying How Non-neutrality Distorts Competition Among CPs -- 7.1.3.5 Impact of Search (Non-)Neutrality on Innovation -- 7.2 Detecting Bias and Trying to Build a ``Neutral'' Search Engine -- 7.2.1 A Look At Related Contributions -- 7.2.2 An Estimation of Page Relevance: Average Page Visibility -- 7.2.3 Quantifying How ``Consensual'' a Search Engine Is:The SE Score -- 7.2.4 Pointing Out Possible Bias: Statistical Tests -- 7.2.5 Aggregating Results from SEs to Create Meta-SEs -- 7.2.5.1 The Consensus Ranking -- 7.2.5.2 The Majority Judgment Ranking -- 7.2.5.3 Robustness to Bias: Consensus Ranking vs Majority Judgment -- 7.2.6 A Few Observations from a Campaign on 1000 Search Terms. 7.2.6.1 The ``Chrome'' Search Term -- 7.3 Conclusion -- 8 Algorithmic Transparency -- 8.1 Algorithmic Transparency and Structuring Platforms: Why Introduce Scrutiny? -- 8.2 Worries About the Transparency of Artificial Intelligence Algorithms -- 8.3 How to Proceed? -- 8.4 Fake News, Manipulation of Opinions, Hatred, and Fact Checking -- 8.5 Conclusion on Transparency and Neutrality -- 9 Tools to Monitor Neutrality -- 9.1 Why Are Specific Tools Needed? -- 9.2 Tools for the Monitoring of ISPs -- 9.2.1 Potential Infringements -- 9.2.2 Available Tools -- 9.2.3 The Limits of the Existing Tools -- 9.3 Monitoring Other Actors -- 9.3.1 Monitoring CDNs -- 9.3.2 Monitoring Search Engines -- 9.4 Tools and Algorithmic Transparency -- 9.5 Fact-Checking Tools -- 10 Conclusions -- References. |
| Record Nr. | UNISA-996499857903316 |
|
Maillé Patrick
|
||
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Monte Carlo and Quasi-Monte Carlo Methods [[electronic resource] ] : MCQMC 2018, Rennes, France, July 1–6 / / edited by Bruno Tuffin, Pierre L'Ecuyer
| Monte Carlo and Quasi-Monte Carlo Methods [[electronic resource] ] : MCQMC 2018, Rennes, France, July 1–6 / / edited by Bruno Tuffin, Pierre L'Ecuyer |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XI, 539 p. 92 illus., 65 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Computer mathematics
Statistics Computer simulation Applied mathematics Engineering mathematics Numerical analysis Computational Science and Engineering Statistical Theory and Methods Simulation and Modeling Applications of Mathematics Numerical Analysis |
| ISBN | 3-030-43465-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I Invited Talks, H. Dong and M. K. Nakayama, A Tutorial on Quantile Estimation via Monte Carlo -- L. Herrmann and C. Schwab, Multilevel Quasi-Monte Carlo Uncertainty Quantification for Advection-Diffusion-Reaction -- B. L. Nelson, Selecting the Best Simulated System: Thinking Differently About an Old Problem -- F. Pillichshammer, Discrepancy of Digital Sequences: New Results on a Classical QMC Topic -- Part II Regular Talks, L. Bian, T. Cui, G. Sofronov and J. Keith, Network Structure Change Point Detection by Posterior Predictive Discrepancy -- M. Billaud-Friess, A. Macherey, A. Nouy and C. Prieur, Stochastic Methods for Solving High-Dimensional Partial Differential Equations -- N. Binder and A. Keller, Massively Parallel Construction of Radix Tree Forests for the Efficient Sampling of Discrete or Piecewise Constant Probability Distributions -- Y. Ding, F. J. Hickernell, and L. A. J. Rugama, An Adaptive Algorithm Employing Continuous Linear Functionals -- A. Ebert, P. Kritzer and D. Nuyens, Constructing QMC Finite Element Methods for Elliptic PDEs with Random Coefficients by a Reduced CBC Construction -- R. El Haddad, J. El Maalouf, C. Lecot and P. L’Ecuyer, Sudoku Latin, Square Sampling for Markov Chain Simulation -- T. Hartung, K. Jansen, H. Leovey, and J. Volmer, Avoiding the Sign Problem in Lattice Field Theory -- R. Hofer, On Hybrid Point Sets Stemming from Halton-Type Hammersley Point Sets and Polynomial Lattice Point Sets -- M. Huber, Robust Estimation of the Mean with Bounded Relative Standard Deviation -- H. Hult, P. Nyquist and C. Ringqvist, Infinite Swapping Algorithm for Training Restricted Boltzmann Machines -- I. Iscoe and A. Kreinin, Sensitivity Ranks by Monte Carlo -- R. Kritzinger and F. Pillichshammer, Lower Bounds on the Lp Discrepancy of Digital NUT Sequences -- H. Leovey and W. Romisch, Randomized QMC Methods for Mixed-Integer Two-Stage Stochastic Programs with Application to Electricity Optimization -- A. F. Lopez-Lopera, F. Bachoc, N. Durrande, J. Rohmer, D. Idier and O. Roustant, Approximating Gaussian Process Emulators with Linear Inequality Constraints and Noisy Observations via MC and MCMC -- E. Løvbak, G. Samaey and S. Vandewalle, A Multilevel Monte Carlo Asymptotic-Preserving Particle Method for Kinetic Equations in the Diffusion Limit -- D. Mandel and G. Okten, Randomized Global Sensitivity Analysis and Model Robustness -- A. Petersson, Rapid Covariance-Based Sampling of Linear SPDE Approximations in the Multilevel Monte Carlo Method -- A. Stein and A. Barth, A Multilevel Monte Carlo Algorithm for Parabolic Advection-Diffusion Problems with Discontinuous Coefficients -- T. A. Stepanyuk, Estimates For Logarithmic and Riesz Energies Of Spherical t-Designs -- Y. Suzuki and D. Nuyens, Rank-1 Lattices and Higher-Order Exponential Splitting for the Time-Dependent Schr¨odinger Equation -- C. von Hallern and A. Roßler, An Analysis of the Milstein Scheme for SPDEs without a Commutative Noise Condition -- Fei Xie, M. B. Giles, and Zhijian He, QMC Sampling from Empirical Datasets. |
| Record Nr. | UNISA-996418271103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Monte Carlo and Quasi-Monte Carlo Methods : MCQMC 2018, Rennes, France, July 1–6 / / edited by Bruno Tuffin, Pierre L'Ecuyer
| Monte Carlo and Quasi-Monte Carlo Methods : MCQMC 2018, Rennes, France, July 1–6 / / edited by Bruno Tuffin, Pierre L'Ecuyer |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XI, 539 p. 92 illus., 65 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Computer mathematics
Statistics Computer simulation Applied mathematics Engineering mathematics Numerical analysis Computational Science and Engineering Statistical Theory and Methods Simulation and Modeling Applications of Mathematics Numerical Analysis |
| ISBN | 3-030-43465-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I Invited Talks, H. Dong and M. K. Nakayama, A Tutorial on Quantile Estimation via Monte Carlo -- L. Herrmann and C. Schwab, Multilevel Quasi-Monte Carlo Uncertainty Quantification for Advection-Diffusion-Reaction -- B. L. Nelson, Selecting the Best Simulated System: Thinking Differently About an Old Problem -- F. Pillichshammer, Discrepancy of Digital Sequences: New Results on a Classical QMC Topic -- Part II Regular Talks, L. Bian, T. Cui, G. Sofronov and J. Keith, Network Structure Change Point Detection by Posterior Predictive Discrepancy -- M. Billaud-Friess, A. Macherey, A. Nouy and C. Prieur, Stochastic Methods for Solving High-Dimensional Partial Differential Equations -- N. Binder and A. Keller, Massively Parallel Construction of Radix Tree Forests for the Efficient Sampling of Discrete or Piecewise Constant Probability Distributions -- Y. Ding, F. J. Hickernell, and L. A. J. Rugama, An Adaptive Algorithm Employing Continuous Linear Functionals -- A. Ebert, P. Kritzer and D. Nuyens, Constructing QMC Finite Element Methods for Elliptic PDEs with Random Coefficients by a Reduced CBC Construction -- R. El Haddad, J. El Maalouf, C. Lecot and P. L’Ecuyer, Sudoku Latin, Square Sampling for Markov Chain Simulation -- T. Hartung, K. Jansen, H. Leovey, and J. Volmer, Avoiding the Sign Problem in Lattice Field Theory -- R. Hofer, On Hybrid Point Sets Stemming from Halton-Type Hammersley Point Sets and Polynomial Lattice Point Sets -- M. Huber, Robust Estimation of the Mean with Bounded Relative Standard Deviation -- H. Hult, P. Nyquist and C. Ringqvist, Infinite Swapping Algorithm for Training Restricted Boltzmann Machines -- I. Iscoe and A. Kreinin, Sensitivity Ranks by Monte Carlo -- R. Kritzinger and F. Pillichshammer, Lower Bounds on the Lp Discrepancy of Digital NUT Sequences -- H. Leovey and W. Romisch, Randomized QMC Methods for Mixed-Integer Two-Stage Stochastic Programs with Application to Electricity Optimization -- A. F. Lopez-Lopera, F. Bachoc, N. Durrande, J. Rohmer, D. Idier and O. Roustant, Approximating Gaussian Process Emulators with Linear Inequality Constraints and Noisy Observations via MC and MCMC -- E. Løvbak, G. Samaey and S. Vandewalle, A Multilevel Monte Carlo Asymptotic-Preserving Particle Method for Kinetic Equations in the Diffusion Limit -- D. Mandel and G. Okten, Randomized Global Sensitivity Analysis and Model Robustness -- A. Petersson, Rapid Covariance-Based Sampling of Linear SPDE Approximations in the Multilevel Monte Carlo Method -- A. Stein and A. Barth, A Multilevel Monte Carlo Algorithm for Parabolic Advection-Diffusion Problems with Discontinuous Coefficients -- T. A. Stepanyuk, Estimates For Logarithmic and Riesz Energies Of Spherical t-Designs -- Y. Suzuki and D. Nuyens, Rank-1 Lattices and Higher-Order Exponential Splitting for the Time-Dependent Schr¨odinger Equation -- C. von Hallern and A. Roßler, An Analysis of the Milstein Scheme for SPDEs without a Commutative Noise Condition -- Fei Xie, M. B. Giles, and Zhijian He, QMC Sampling from Empirical Datasets. |
| Record Nr. | UNINA-9910484771703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Network Control and Optimization [[electronic resource] ] : First EuroFGI International Conference, NET-COOP 2007, Avignon, France, June 5-7, 2007, Proceedings / / edited by Tijani Chahed, Bruno Tuffin
| Network Control and Optimization [[electronic resource] ] : First EuroFGI International Conference, NET-COOP 2007, Avignon, France, June 5-7, 2007, Proceedings / / edited by Tijani Chahed, Bruno Tuffin |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIII, 310 p.) |
| Disciplina | 004.6 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Computer communication systems
Algorithms Computer programming Software engineering Application software Special purpose computers Computer Communication Networks Algorithm Analysis and Problem Complexity Programming Techniques Software Engineering Information Systems Applications (incl. Internet) Special Purpose and Application-Based Systems |
| ISBN | 3-540-72709-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Network Congestion Control and Optimization -- A Jamming Game in Wireless Networks with Transmission Cost -- A Network Formation Game Approach to Study BitTorrent Tit-for-Tat -- Fixed-Rate Equilibrium in Wireless Collision Channels -- A Survey of Uniqueness Results for Selfish Routing -- Beyond CHOKe: Stateless Fair Queueing -- How Expensive Is Link Utilization? -- Two Different Models of FAST TCP and Their Stable and Efficient Modification -- Revisiting Adaptive RED: Beyond AIMD Algorithms -- The Practical Performance of Subgradient Computational Techniques for Mesh Network Utility Optimization -- Channel Dependent Interference and Decentralized Colouring -- Optimal Call Admission Control for an IEEE 802.16 Wireless Metropolitan Area Network -- A Survey of Throughput Versus Complexity Tradeoffs in Wireless Networks -- Finite Horizon Control Problems Under Partial Information -- A Tandem Queueing Network with Feedback Admission Control -- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging -- Some Examples of Stochastic Approximation in Communications -- Optimisation-Based Overload Control -- Lyapunov Convergence for Lagrangian Models of Network Control -- NCRS: A Network RAM-Based Computational Resource Sharing Grid -- Tracing an Optical Buffer’s Performance: An Effective Approach -- A New Necessary Condition for Shortest Path Routing -- Optimal Congestion Control with Multipath Routing Using TCP-FAST and a Variant of RIP -- Grid Brokering for Batch Allocation Using Indexes -- Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions -- Pricing for QoS Provisioning Across Multiple Internet Service Provider Domains -- Robust Wardrop Equilibrium -- Hierarchical Game and Bi-level Optimization for Controlling Network Usage Via Pricing -- Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach -- Cost Minimisation in Multi-interface Networks -- Minimum Transmission Energy Trajectories for a Linear Pursuit Problem -- A Hybrid Energy Saving Mechanism for VoIP Traffic with Silence Suppression. |
| Record Nr. | UNISA-996465634503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Network Control and Optimization : First EuroFGI International Conference, NET-COOP 2007, Avignon, France, June 5-7, 2007, Proceedings / / edited by Tijani Chahed, Bruno Tuffin
| Network Control and Optimization : First EuroFGI International Conference, NET-COOP 2007, Avignon, France, June 5-7, 2007, Proceedings / / edited by Tijani Chahed, Bruno Tuffin |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIII, 310 p.) |
| Disciplina | 004.6 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Computer communication systems
Algorithms Computer programming Software engineering Application software Special purpose computers Computer Communication Networks Algorithm Analysis and Problem Complexity Programming Techniques Software Engineering Information Systems Applications (incl. Internet) Special Purpose and Application-Based Systems |
| ISBN | 3-540-72709-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Network Congestion Control and Optimization -- A Jamming Game in Wireless Networks with Transmission Cost -- A Network Formation Game Approach to Study BitTorrent Tit-for-Tat -- Fixed-Rate Equilibrium in Wireless Collision Channels -- A Survey of Uniqueness Results for Selfish Routing -- Beyond CHOKe: Stateless Fair Queueing -- How Expensive Is Link Utilization? -- Two Different Models of FAST TCP and Their Stable and Efficient Modification -- Revisiting Adaptive RED: Beyond AIMD Algorithms -- The Practical Performance of Subgradient Computational Techniques for Mesh Network Utility Optimization -- Channel Dependent Interference and Decentralized Colouring -- Optimal Call Admission Control for an IEEE 802.16 Wireless Metropolitan Area Network -- A Survey of Throughput Versus Complexity Tradeoffs in Wireless Networks -- Finite Horizon Control Problems Under Partial Information -- A Tandem Queueing Network with Feedback Admission Control -- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging -- Some Examples of Stochastic Approximation in Communications -- Optimisation-Based Overload Control -- Lyapunov Convergence for Lagrangian Models of Network Control -- NCRS: A Network RAM-Based Computational Resource Sharing Grid -- Tracing an Optical Buffer’s Performance: An Effective Approach -- A New Necessary Condition for Shortest Path Routing -- Optimal Congestion Control with Multipath Routing Using TCP-FAST and a Variant of RIP -- Grid Brokering for Batch Allocation Using Indexes -- Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions -- Pricing for QoS Provisioning Across Multiple Internet Service Provider Domains -- Robust Wardrop Equilibrium -- Hierarchical Game and Bi-level Optimization for Controlling Network Usage Via Pricing -- Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach -- Cost Minimisation in Multi-interface Networks -- Minimum Transmission Energy Trajectories for a Linear Pursuit Problem -- A Hybrid Energy Saving Mechanism for VoIP Traffic with Silence Suppression. |
| Record Nr. | UNINA-9910483221503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Network Economics for Next Generation Networks [[electronic resource] ] : 6th International Workshop on Internet Charging and QoS Technologies, ICQT 2009, Aachen, Germany, May 11-15, 2009, Proceedings / / edited by Peter Reichl, Burkhard Stiller, Bruno Tuffin
| Network Economics for Next Generation Networks [[electronic resource] ] : 6th International Workshop on Internet Charging and QoS Technologies, ICQT 2009, Aachen, Germany, May 11-15, 2009, Proceedings / / edited by Peter Reichl, Burkhard Stiller, Bruno Tuffin |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (IX, 109 p.) |
| Disciplina | 004 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Computer programming
Electrical engineering Computer communication systems Application software Information storage and retrieval Programming Techniques Communications Engineering, Networks Computer Communication Networks Information Systems Applications (incl. Internet) Information Storage and Retrieval Computer Appl. in Administrative Data Processing |
| Soggetto genere / forma |
Aachen (2009)
Kongress. |
| ISBN | 3-642-01796-7 |
| Classificazione |
DAT 614f
SS 4800 WIR 917f |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynote -- QoS Is Still an Issue, Congestion Pricing Is not the Solution -- Session 1: Competition Models -- Optimization of Transmission Power in Competitive Wireless Networks -- On Competition for Market Share in a Dynamic ISP Market with Customer Loyalty: A Game-Theoretic Analysis -- A Pricing Model for a Mobile Network Operator Sharing Limited Resource with a Mobile Virtual Network Operator -- Session 2: Pricing Mechanisms -- Design and Evaluation of a Combinatorial Double Auction for Resource Allocations in Grids -- A User-Influenced Pricing Mechanism for Internet Access -- Price Setting in Two-Sided Markets for Internet Connectivity -- Session 3: Economics of Inter-domain Traffic -- Online Charging for IMS-Based Inter-domain Composite Services -- A New Bilateral Arrangement between Interconnected Providers -- Improvement of BitTorrent Performance and Inter-domain Traffic by Inserting ISP-Owned Peers. |
| Record Nr. | UNISA-996466258903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Performability Has its Price [[electronic resource] ] : 5th International Workshop on Internet Charging and QoS Technologies, ICQT 2006, St. Malo, France, June 27, 2006, Proceedings / / edited by Burkhard Stiller, Peter Reichl, Bruno Tuffin
| Performability Has its Price [[electronic resource] ] : 5th International Workshop on Internet Charging and QoS Technologies, ICQT 2006, St. Malo, France, June 27, 2006, Proceedings / / edited by Burkhard Stiller, Peter Reichl, Bruno Tuffin |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (X, 103 p.) |
| Disciplina | 004.67/8 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Computer communication systems
Application software Information storage and retrieval E-commerce Electrical engineering Computer Communication Networks Information Systems Applications (incl. Internet) Information Storage and Retrieval Computer Applications e-Commerce/e-business Communications Engineering, Networks |
| ISBN | 3-540-35457-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynote -- Cooperation and QoS in Fast Packet Networks: The View from the Edge -- Session 1: Economy-Driven Modeling -- How Many Parallel TCP Sessions to Open: A Pricing Perspective -- Performance Modeling on the Interaction of ISPs -- Session 2: Auctions -- A Random Walk Model for Studying Allocation Patterns in Auction-Based Resource Allocation -- A Simulation-Based Approach to Bidding Strategies for Network Resources in Competitive Wireless Networks -- Session 3: Peer-to-Peer -- Charging in Peer-to-Peer Systems Based on a Token Accounting System -- A Market-Managed Topology Formation Algorithm for Peer-to-Peer File Sharing Networks -- Session 4: Secure Billing -- Adapting a Captive Portal to Enable SMS-Based Micropayment for Wireless Internet Access -- Secure Billing for Ubiquitous Service Delivery. |
| Record Nr. | UNISA-996465758303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Performability has its price : 5th International Workshop on Internet Charging and QoS Technologies, ICQT 2006, St. Malo, France, June 27, 2006 : proceedings / / Burkhard Stiller, Peter Reichl, Bruno Tuffin (eds.)
| Performability has its price : 5th International Workshop on Internet Charging and QoS Technologies, ICQT 2006, St. Malo, France, June 27, 2006 : proceedings / / Burkhard Stiller, Peter Reichl, Bruno Tuffin (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer-Verlag, c2006 |
| Descrizione fisica | 1 online resource (X, 103 p.) |
| Disciplina | 004.67/8 |
| Altri autori (Persone) |
StillerBurkhard <1965->
ReichlPeter TuffinBruno |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 5, Computer communication networks and telecommunications |
| Soggetto topico |
Internet
Computer networks - Reliability Computer networks - Quality control |
| ISBN | 3-540-35457-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynote -- Cooperation and QoS in Fast Packet Networks: The View from the Edge -- Session 1: Economy-Driven Modeling -- How Many Parallel TCP Sessions to Open: A Pricing Perspective -- Performance Modeling on the Interaction of ISPs -- Session 2: Auctions -- A Random Walk Model for Studying Allocation Patterns in Auction-Based Resource Allocation -- A Simulation-Based Approach to Bidding Strategies for Network Resources in Competitive Wireless Networks -- Session 3: Peer-to-Peer -- Charging in Peer-to-Peer Systems Based on a Token Accounting System -- A Market-Managed Topology Formation Algorithm for Peer-to-Peer File Sharing Networks -- Session 4: Secure Billing -- Adapting a Captive Portal to Enable SMS-Based Micropayment for Wireless Internet Access -- Secure Billing for Ubiquitous Service Delivery. |
| Altri titoli varianti |
International Workshop on Internet Charging and QoS Technologies
ICQT 2006 |
| Record Nr. | UNINA-9910484197903321 |
| Berlin ; ; New York, : Springer-Verlag, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Rare event simulation using Monte Carlo methods [[electronic resource] /] / edited by Gerardo Rubino and Bruno Tuffin
| Rare event simulation using Monte Carlo methods [[electronic resource] /] / edited by Gerardo Rubino and Bruno Tuffin |
| Pubbl/distr/stampa | Chichester, U.K., : Wiley, 2009 |
| Descrizione fisica | 1 online resource (280 p.) |
| Disciplina | 519.2 |
| Altri autori (Persone) |
RubinoGerardo <1955->
TuffinBruno |
| Soggetto topico |
Limit theorems (Probability theory)
Monte Carlo method System analysis - Data processing Digital computer simulation |
| ISBN |
1-282-12364-5
9786612123641 0-470-74540-1 0-470-74541-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Rare Event Simulation using Monte Carlo Methods; Contents; Contributors; Preface; 1 Introduction to Rare Event Simulation; PART I THEORY; 2 Importance Sampling in Rare Event Simulation; 3 Splitting Techniques; 4 Robustness Properties and Con.dence Interval Reliability Issues; PART II APPLICATIONS; 5 Rare Event Simulation for Queues; 6 Markovian Models for Dependability Analysis; 7 Rare Event Analysis by Monte Carlo Techniques in Static Models; 8 Rare Event Simulation and Counting Problems; 9 Rare Event Estimation for a Large-Scale Stochastic Hybrid System with Air Traffic Application
10 Particle Transport Applications11 Rare Event Simulation Methodologies in Systems Biology; Index |
| Record Nr. | UNINA-9910146133403321 |
| Chichester, U.K., : Wiley, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
