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.
Advances in the mathematical sciences : research from the 2015 Association for Women in Mathematics Symposium / / edited by Gail Letzter, Kristin Lauter, Erin Chambers, Nancy Flournoy, Julia Elisenda Grigsby, Carla Martin, Kathleen Ryan, Konstantina Trivisa
| Advances in the mathematical sciences : research from the 2015 Association for Women in Mathematics Symposium / / edited by Gail Letzter, Kristin Lauter, Erin Chambers, Nancy Flournoy, Julia Elisenda Grigsby, Carla Martin, Kathleen Ryan, Konstantina Trivisa |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVII, 436 p. 141 illus., 97 illus. in color.) |
| Disciplina | 510 |
| Collana | Association for Women in Mathematics Series |
| Soggetto topico |
Applied mathematics
Engineering mathematics Topology Biomathematics Differential equations, Partial Mathematics—Study and teaching Statistics Applications of Mathematics Mathematical and Computational Biology Partial Differential Equations Mathematics Education Statistics, general |
| ISBN | 3-319-34139-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Floer field philosophy (K. Wehrheim) -- An elementary fact about unlinked braid closures (E. Grigsby & S. M. Wehrli) -- Symmetric unions without cosmetic crossing changes (A. H. Moore) -- The total Thurston–Bennequin number of complete bipartite Legendrian graphs (D. O'Donnol and E. Pavelescu) -- Coverings of open books (T. Ito and K. Kawamuro) -- Understanding locomotor rhythm in the lamprey central pattern generator (N. Massarelli, A. Yau, K. Hoffman, T. Kiemel and E. Tytell) -- Applications of knot theory: using knot theory to unravel biochemistry mysteries (C. R. Price) -- Metapopulation and non-proportional vaccination models overview (M. Cruz-Aponte) -- Controlling a cockroach infestation (H. Albert, A. Buchmann, L. Ohm, A. Radunskaya, and E. Swanson) -- The impact of violence interruption on the diffusion of violence: a mathematical modeling approach (S. A. Wiley, M. Z. Levy, and C. C. Branas) -- Cramér's theorem is atypical (N. Gentert, S. Kim, and K. Ramanan) -- Counting and partition function analysis for subordinate killed Brownian motion (S. Bryant) -- A statistical change point analysis approach for modeling the ratio of next generation sequencing reads (J. Chen and H. Li) -- A center-level approach to estimating the effect of center characteristics on center outcomes (J. Le-Rademacher) -- False discovery rate based on extreme values in high dimension (J. Park, D. Park, and J. W. Davis) -- Asymptotic and oscillatory behavior of dynamic equations on time scales (R. Higgins) -- Using applications to motivate the learning of differential equations (K. M. Bliss & J. M. Libertini) -- What is a good question? (B. Servatius) -- Information measures of frequency distributions with an application to labeled graphs (C. Joslyn & E. Purvine) -- Integrating and sampling cuts in bounded treewidth graphs (I. Bezáková, E. W. Chambers, and K. Fox) -- Considerations on the implementation and use of Anderson acceleration on distributed memory and GPU-based parallel computers (J. Loffeld & C. S. Woodward). |
| Record Nr. | UNINA-9910254077403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings / / edited by Kam W. Ng, Prabhakar Raghavan, N.V. Balasubramanian, Francis Y.L. Chin
| Algorithms and Computation [[electronic resource] ] : 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings / / edited by Kam W. Ng, Prabhakar Raghavan, N.V. Balasubramanian, Francis Y.L. Chin |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XIII, 546 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Combinatorics Probabilities Statistics Information storage and retrieval Theory of Computation Computation by Abstract Devices Probability Theory and Stochastic Processes Statistics, general Information Storage and Retrieval |
| ISBN | 3-540-48233-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Reaching a goal with directional uncertainty -- Constructing degree-3 spanners with other sparseness properties -- Remembering conflicts in history yields dynamic algorithms -- Coloring random graphs in polynomial expected time -- Graphical degree sequence problems with connectivity requirements -- How to treat delete requests in semi-online problems -- Finding the shortest watchman route in a simple polygon -- Constructing shortest watchman routes by divide-and-conquer -- A graph coloring result and its consequences for some guarding problems -- The maximum k-dependent and f-dependent set problem -- Finding shortest non-crossing rectilinear paths in plane regions -- Treewidth of circle graphs -- A framework for constructing heap-like structures in-place -- Double-ended binomial queues -- A simple balanced search tree with O(1) worst-case update time -- Mapping dynamic data and algorithm structures into product networks -- Permutation routing on reconfigurable meshes -- Adaptive and oblivious algorithms for d-cube permutation routing -- On quadratic lattice approximations -- A 2/3-approximation of the matroid matching problem -- Using fractal geometry for solving divide-and-conquer recurrences -- Simple combinatorial Gray codes constructed by reversing sublists -- Time space tradeoffs (getting closer to the barrier?) -- Separating exponentially ambiguous NFA from polynomially ambiguous NFA -- Threshold computation and cryptographic security -- On the Power of reading and writing simultaneously in parallel computations -- Relativizing complexity classes with Random Oracles -- An introduction to perpetual gossiping -- A probabilistic selection network with butterfly networks -- Optimal group gossiping in hypercubes under wormhole routing model -- Optimal linear broadcast routing with capacity limitations -- Multicommodity flows: A survey of recent research -- Parallel construction of canonical ordering and convex drawing of triconnected planar graphs -- Number theory helps line detection in digital images an extended abstract -- Optimally computing the shortest weakly visible subedge of a simple polygon preliminary version -- Multicommodity flows in even, planar networks -- Linear time algorithms for disjoint Two-Face Paths Problems in planar graphs -- Robot mapping: Foot-prints vs tokens -- Recent developments on the approximability of combinatorial problems -- On the relationship among cryptographic physical assumptions -- Separating complexity classes related to bounded alternating ?-branching programs -- The complexity of the optimal variable ordering problems of shared binary decision diagrams -- On Horn envelopes and hypergraph transversals -- Page migration algorithms using work functions -- Memory paging for connectivity and path problems in graphs -- Randomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists -- Randomized on-line algorithms for the page replication problem -- New algorithms for minimizing the longest wire length during circuit compaction -- Parallel algorithms for single-layer channel routing -- Consecutive interval query and dynamic programming on intervals -- An improved algorithm for the traveler's problem -- Vehicle scheduling on a tree with release and handling times -- Scheduling algorithms for a chain-like task system -- Weighted independent perfect domination on cocomparability graphs -- Plane sweep algorithms for the polygonal approximation problems with applications -- Optimal rectilinear steiner tree for extremal point sets -- Faster approximation algorithms for the rectilinear steiner tree problem. |
| Record Nr. | UNISA-996465774803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computations [[electronic resource] ] : 6th International Symposium, ISAAC '95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings. / / edited by John Staples, Peter Eades, Naoki Katoh, Alistair Moffat
| Algorithms and Computations [[electronic resource] ] : 6th International Symposium, ISAAC '95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings. / / edited by John Staples, Peter Eades, Naoki Katoh, Alistair Moffat |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XVIII, 450 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Combinatorics Probabilities Statistics Theory of Computation Algorithm Analysis and Problem Complexity Computation by Abstract Devices Probability Theory and Stochastic Processes Statistics, general |
| ISBN | 3-540-47766-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithmic problems arising from Genome informatics -- An approximation algorithm for alphabet indexing problem -- A fast and space-economical algorithm for length-limited coding -- Computing in linear time a chord from which a simple polygon is weakly internally visible -- Competitive searching in polygons—Beyond generalised streets -- Finding a shortest pair of paths on the plane with obstacles and crossing areas -- Logspace verifiers, NC, and NP -- Structure in average case complexity -- Some geometric lower bounds -- The I/O-complexity of Ordered Binary-Decision Diagram manipulation -- Two arc disjoint paths in Eulerian digraphs -- Finding dense subgraphs -- Finding smallest supertrees -- Weighted domination on cocomparability graphs -- The parallel complexity of approximating the High Degree Subgraph problem -- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs -- Greedy approximations of independent sets in low degree graphs -- Practical logic -- An approximation algorithm for MAX 3-SAT -- Learning of restricted RNLC graph languages -- Optimal information delivery -- On the complexity of testing for catastrophic faults -- Scheduling parallel tasks with individual deadlines -- Orders of Gauss periods in finite fields -- A hard problem that is almost always easy -- Computing the Tutte polynomial of a graph of moderate size -- More efficient parallel flow algorithms -- Linear-time in-place selection in less than 3n comparisons -- Heap construction: Optimal in both worst and average cases? -- Fast approximate dictionary matching -- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract) -- Searching for a monotone function by independent threshold queries -- A fast and simple algorithm for identifying 2-monotonic positive Boolean functions -- Deciding bisimulation and trace equivalences for systems with many identical processes -- Should Amdahl's Law be repealed? -- Embeddings of hyper-rings in hypercubes -- A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets -- Algorithms for finding f-colorings of partial k-trees -- Spanning closed trail and hamiltonian cycle in grid graphs -- A linear time algorithm for finding maximal planar subgraphs -- Illumination with orthogonal floodlights -- No quadrangulation is extremely odd -- Finding the medial axis of a simple polygon in linear time -- The first subquadratic algorithm for complete linkage clustering -- Matching nuts and bolts faster -- Linear matching-time algorithm for the directed graph isomorphism problem -- A resource assignment problem on graphs -- NC algorithms for partitioning sparse graphs into induced forests with an application. |
| Record Nr. | UNISA-996465749103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro
| Algorithms and Data Structures [[electronic resource] ] : 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (X, 502 p.) |
| Disciplina | 005.7/3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computers Combinatorics Probabilities Statistics Information storage and retrieval Algorithm Analysis and Problem Complexity Computation by Abstract Devices Probability Theory and Stochastic Processes Statistics, general Information Storage and Retrieval |
| ISBN | 3-540-47566-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A case study in comparison based complexity: Finding the nearest value(s) -- On the zone of a surface in a hyperplane arrangement -- Ray-shooting and isotopy classes of lines in 3-dimensional space -- Finding level-ancestors in dynamic trees -- Treewidth of circular-arc graphs+ -- Fully dynamic delaunay triangulation in logarithmic expected time per operation -- On computing the voronoi diagram for restricted planar figures -- The MINSUMCUT problem -- Efficient algorithms for the minimum range cut problems -- Memory access in models of parallel computation: From folklore to synergy and beyond -- Farthest neighbors, maximum spanning trees and related problems in higher dimensions -- Shallow interdistance selection and interdistance enumeration -- Sharing memory in asynchronous message passing systems -- A linear-time scheme for version reconstruction -- The interval skip list: A data structure for finding all intervals that overlap a point -- Geometric knapsack problems -- A fast derandomization scheme and its applications -- Unstructured path problems and the making of semirings -- Neighborhood graphs and geometric embedding -- Finding optimal bipartitions of points and polygons -- Immobilizing a polytope -- What can we learn about suffix trees from independent tries? -- Competitive algorithms for the weighted list update problem -- An optimal algorithm for the rectilinear link center of a rectilinear polygon -- Geometric searching and link distance -- Representing and enumerating edge connectivity cuts in RNC -- Planar graph augmentation problems -- Parametric search and locating supply centers in trees -- On bends and lengths of rectilinear paths: A graph-theoretic approach -- Computing minimum length paths of a given homotopy class -- Approximation algorithms for selecting network centers -- Facility dispersion problems: Heuristics and special cases -- Optimum guard covers and m-watchmen routes for restricted polygons -- Applications of a new space partitioning technique -- Offline algorithms for dynamic minimum spanning tree problems -- An empirical analysis of algorithms for constructing a minimum spanning tree -- A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible -- Dynamically maintaining the visibility graph -- An optimal algorithm for computing visibility in the plane -- Fully persistent data structures for disjoint set union problems -- Algorithms for generating all spanning trees of undirected, directed and weighted graphs -- Sorting multisets and vectors in-place -- Probabilistic leader election on rings of known size. |
| Record Nr. | UNISA-996465671203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro
| Algorithms and Data Structures [[electronic resource] ] : Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (VI, 244 p.) |
| Disciplina | 005.73 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Algorithms Computers Combinatorics Probabilities Statistics Data Structures Algorithm Analysis and Problem Complexity Computation by Abstract Devices Probability Theory and Stochastic Processes Statistics, general |
| ISBN | 3-540-48237-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Efficient text searching of regular expressions -- Efficient spatial point location -- Constructing the Voronoi diagram of a set of line segments in parallel -- Analysis of kdt-trees: Kd-trees improved by local reorganisations -- Optimal algorithms for List Indexing and Subset Rank -- The Delaunay triangulation closely approximates the complete Euclidean graph -- Computing the furthest site voronoi diagram for a set of discs -- Fully persistent arrays -- String searching algorithms revisited -- Optimal channel placement for multi-terminal nets -- Computing the minimum visible vertex distance between two polygons -- Computing the kernel of a point set in a polygon -- Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs -- Linear time algorithms for computing reachability regions from polygonal figures -- Computing the center of area of a polygon -- Weighted orthogonal linear L ?-approximation and applications -- Discs and other related data structures -- Digital data structures and order statistics -- On the performance of orthogonal range queries in multiattribute and doubly chained trees -- Probabilistic analysis of algorithms and data structures -- Stabbing parallel segments with a convex polygon -- Selecting the Kth largest-area convex polygon -- Finding All Shortest Path Edge Sequences on a convex polyhedron -- Linear algorithms for parity path and two path problems on circular-arc graph -- NC algorithms for circular-arc graphs -- Parallel algorithms for the subgraph homeomorphism problem -- Galleries, light matchings and visibility graphs -- Weighted visibility graphs of bars and related flow problems -- Parallel algorithms for cographs recognition and applications -- Dynamic data structures for series parallel digraphs -- Motion planning in the CL-environment -- Self-adjusting k-ary search trees -- Improving partial rebuilding by using simple balance criteria -- An efficient all-parses systolic algorithm for general context-free parsing -- A polynomial time algorithm for the local testability problem of deterministic finite automata -- Skip lists: A probabilistic alternative to balanced trees -- A fast algorithm for melding splay trees -- An efficient algorithm for finding all maximal square blocks in a matrix -- Complexity issues in tree-based version control -- Structured NC -- Heapsort—Adapted for presorted files -- The distribution of keys in a binary heap -- Optimal hypercube algorithms for labeled images -- On the complexity of single row routing problems -- A new search time update time tradeoff for the implicit dictionary -- Sorting with minimum data movement (preliminary draft) -- Augmentation problems on hierarchically defined graphs -- On linear time minor tests and depth first search -- Combinatorial and computational results for line arrangements in space. |
| Record Nr. | UNISA-996465726803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Predictive Modeling / / by Max Kuhn, Kjell Johnson
| Applied Predictive Modeling / / by Max Kuhn, Kjell Johnson |
| Autore | Kuhn Max |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIII, 600 p. 203 illus., 153 illus. in color.) |
| Disciplina | 519.5 |
| Soggetto topico |
Statistics
Statistics for Life Sciences, Medicine, Health Sciences Statistics and Computing/Statistics Programs Statistics, general |
| ISBN | 1-4614-6849-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | General Strategies -- Regression Models -- Classification Models -- Other Considerations -- Appendix -- References -- Indices. |
| Record Nr. | UNINA-9910437861803321 |
Kuhn Max
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Applied Statistics for Business and Management using Microsoft Excel / / by Linda Herkenhoff, John Fogli
| Applied Statistics for Business and Management using Microsoft Excel / / by Linda Herkenhoff, John Fogli |
| Autore | Herkenhoff Linda |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 417 p. 620 illus., 569 illus. in color.) |
| Disciplina | 330.015195 |
| Soggetto topico |
Statistics
Statistics and Computing/Statistics Programs Statistics for Business, Management, Economics, Finance, Insurance Statistics, general |
| ISBN | 1-4614-8423-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Acknowledgments -- Contents -- Chapter 1: Data and Statistics -- Key Concepts -- Discussion -- Common Pitfalls -- Final Thoughts and Activities -- Practice Problems -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 2: Introduction to Excel and Basic Charts -- Key Concepts -- Discussion -- Basic Concepts -- Start Up -- Adding Data Analysis Toolpak -- Excel Elements -- Entering Formulas -- Cell References -- Sorting Data -- Filtering Data -- Getting Excel Help -- Statistical Tools -- Predefined or Built-In Formulas -- Formatting Data -- Chart Wizard -- Formatting of Graphs -- Bar and Column Charts -- Pie Charts -- Line Charts and Area Charts -- Line Graph Example -- Area Chart Example -- Other Charts -- Bubble Chart -- Radar Chart -- PivotTables (Aka Crosstabs) -- Excel -- Common Pitfalls -- Final Thoughts and Activities -- Practice Problems -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 3: Summarizing Data: Descriptive Statistics and Histograms -- Key Concepts -- Discussion -- Symbols -- The Histogram -- Excel -- Descriptive Statistics -- Descriptive Output Results -- Changing the Width of the Column Output -- Using Excel Functions -- Histograms -- Example Problem -- Setting Up the Bin Ranges -- Creating the Histogram Chart -- Histogram Clean Up -- Closing Gaps Between Bars -- Change Labels on x-axis -- Removing More from the Chart and Labeling the Last Column -- Remove Legend -- Axes Labels -- Moving Axes Labels -- Changing the Bar Color -- Changing Chart Title -- Changing Chart Background Fill -- Rotating the y-axis Label from Vertical to Horizontal -- Common Pitfalls -- Final Thoughts and Activities -- Practice Problems -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 4: Normal Distributions.
Key Concepts -- Discussion -- Excel -- Outline placeholder -- 1. Percentile Calculation Problems (NORM.DIST) -- (a) Calculating the area to the left of a value -- What % of the Time Did You Deliver to Less Than () 90 Stores During Last December and January? In Other Words How Much Data Is... -- (b) Calculating the area between 2 values -- What % of the Time Did You Deliver Fire Logs to Between 90 and 120 Stores During Last December and January? -- (c) Calculating the area to the right of a value -- What % of Time Did You Deliver to 130 or More Stores ( \geq ) During Last December and January? In Other Words How Much Da... -- (d) Graphing a normal distribution (Area Graph) -- Step 1 -- Step 2 -- Step 3 -- 2. Converting Percentiles to Measured Units (NORM.INV) -- Calculate the Number of Stores Corresponding with the 99th Percentile -- 3. Converting Measured Units to z-Scores (STANDARDIZE) -- Convert the Measured Value of 135 Stores to a z-Score -- 4. Calculate Rank and Percentile (Rank and Percentile) -- Outline placeholder -- Output -- 5. Non-normal Distributions -- Calculate What Percentage of Rents Fall Between 409 and 573 -- Step 1: Convert the Measured Values to Standard Units -- Step 2: Use Chebyshev Approximation=1-(1/(k)2) where k is the boundary value in standard units -- Common Pitfalls -- Final Thoughts and Activities -- Practice Problems -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 5: Survey Design -- Key Concepts -- Discussion -- Basic Concepts -- Survey Design -- Scale -- Types of Questions -- Single Response/Select -- Multiple Response/Select -- Structured Questions -- Ranking and Rating -- Non-structured (Open-Ended) Questions -- Data -- Labels -- Demographic Data -- Response Rates -- Editing: Data Quality -- Coding -- Errors in Survey Question Creation -- Loaded Questions. Leading Questions -- Double-Barreled Questions -- Errors in Survey Data Collection -- Random Sampling Error -- Systematic Error -- Response Bias -- Checklist -- Excel -- Final Thoughts and Activities -- Practice Problems and Case Studies -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 6: Sampling -- Key Concepts -- Discussion -- Types of Problems -- Mean versus proportion problems require slightly different treatment -- Finite versus infinite population size is another important factor in determining the appropriate sample size -- Rules of thumb -- Excel -- Problem Type: Infinite Mean -- Practice Problem for Infinite Mean -- Problem Type: Infinite Proportion -- Practice Problem for Infinite Proportion -- Finite Population Correction Factor (fpc) -- Final Thoughts and Activities -- Practice Problems -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 7: Inference -- Key Concepts -- Discussion -- Inferring Proportions -- Example Problem -- Excel -- Inferring Averages -- Example Problem -- Excel -- Confidence Intervals with Proportion Inference -- Example Problem -- Excel -- Final Thoughts and Activities -- Practice Problems and Case Studies -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 8: Probability -- Key Concepts -- Discussion -- Example 1 -- Example 2 -- Excel -- Finding Probabilities Using Normal Distributions -- What Is the Probability That a Dealership Will Sell 90 Cars or Less (x90) per Week? -- What Is the Probability That a Car Dealership Will Sell at least 130 (x130) Cars per Week? -- What Is the Probability That a Car Dealership Will Sell Between 90 and 120 Cars per Week? -- Calculating Combinations and Permutations -- Permutation -- Combination -- Finding Probabilities Using the Binomial Distribution. Royal Bank Retention Problem -- Common Excel Pitfalls -- Final Thoughts and Activities -- Practice Problems -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 9: Correlation -- Key Concepts -- Discussion -- Nonlinear data caution -- Average data caution -- Excel -- Correlation: One r Value or Correlation Matrix -- Method 1: Two or More Data Sets (Matrix) -- Method 2: Only 2 Data Sets -- Common Excel Pitfalls -- Final Thoughts and Activities -- Practice Problems -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 10: Simple Linear Regression -- Key Concepts -- Discussion -- Residuals and Tests for Linearity -- Standardized Residuals and Outliers -- Excel -- Scatterplot: Compute the Regression Line and the Coefficient of Determination -- Regression Function: Compute the Regression Model -- Compute Residual Plots Using the Regression Function -- Using Excel´s Regression Tool to Test for Normality of the Distribution of Residuals -- Method 1: Normal Probability Plot -- Method 2: Normal Distribution of Residuals -- Using Excel´s Regression Tool to Test for Constant Variance of Residuals -- Summary of Regression Analysis Process -- Common Excel Pitfalls -- Final Thoughts and Activities -- Practice Problems -- Discussion Boards -- Group Activities -- Parting Thought -- Problem Solutions -- Chapter 11: Significance Tests Part 1 -- Key Concepts -- Discussion -- Basic Concepts -- Choosing the Appropriate Significance Test -- One-Tailed Tests -- Two-Tailed Tests -- Significance Tests -- F-test -- Basic Descriptions of F-Test Applications -- Example 1: One-Way Repeated Measures Using ANOVA -- Example 2: Regression Problems -- Example 3: F-Test for Equality of Two Variances -- Example 4: Between Group ANOVA -- Excel -- Example 1: One-Way Repeated Measures Using ANOVA. Example 2: Regression -- Example 3: Two Sample for Variances -- One-Tailed F-Test for Two Sample for Variances -- Two-Tailed F-Test for Equality of Two Variances -- Example 4: Between Group ANOVA -- One-Tail F-Test Between Group ANOVA -- Two-Tail F-Test Between Group ANOVA -- t-Test -- Basic Descriptions of t-Test Applications -- Example 1: Regression Problems -- Example 2: t-Test for Equality of Means -- Example 3: t-TEST Paired Samples -- Excel -- Example 1: Regression Problems -- Example 2: t-Test for Equality of Means -- One-Tailed Test -- Two-Tailed Test -- Example 3: Before-After Models -- One-Tailed Test -- Two-Tailed Test -- T.TEST -- Common Excel Pitfalls -- Final Thoughts and Activities -- Practice Problems and Case Studies -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 12: Significance Tests Part 2 -- Key Concepts -- Discussion -- Significance Tests -- X2 Test -- Example 1: Goodness-of-Fit Test -- Example 2: Independence of Two Variables -- Excel -- Example 1: Goodness of Fit -- Example 2: Testing Independence -- z-Test -- Excel -- Example 1: Z-Test One Sample Mean Versus a Standard -- One-Tailed Results -- Two-Tailed Results -- Example 2: Testing the Means of Two Populations -- Z.TEST Tool for Comparing a Mean or Proportion with a Standard -- Example Problem -- Common Excel Pitfalls -- Final Thoughts and Activities -- Practice Problems and Case Studies -- Discussion Boards -- Group Activity -- Parting Thought -- Problem Solutions -- Chapter 13: Multiple Regression -- Key Concepts -- Discussion -- Excel -- Step 1: Fit the Model with Selected Independent Variables -- Step 2: Does Multicollinearity Exist? Run a Correlation Matrix -- Step 3: Run Regression Model -- Step 4: Are the Assumptions of Regression Satisfied? -- Step 5: Test Overall Model Significance (F-Test). Step 6: Check p-Values for Independent Variables Meet Significance Criteria (t-Test). |
| Record Nr. | UNINA-9910437878003321 |
|
Herkenhoff Linda
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Assessing and Improving Prediction and Classification : Theory and Algorithms in C++ / / by Timothy Masters
| Assessing and Improving Prediction and Classification : Theory and Algorithms in C++ / / by Timothy Masters |
| Autore | Masters Timothy |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Berkeley, CA : , : Apress : , : Imprint : Apress, , 2018 |
| Descrizione fisica | 1 online resource (XX, 517 p. 26 illus., 8 illus. in color.) |
| Disciplina | 005.133 |
| Soggetto topico |
Big data
Artificial intelligence Mathematical statistics Statistics Big Data Artificial Intelligence Probability and Statistics in Computer Science Statistics, general |
| ISBN |
9781484233368
1484233360 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Assessment of Numeric Predictions -- 2. Assessment of Class Predictions -- 3. Resampling for Assessing Parameter Estimates -- 4. Resampling for Assessing Prediction and Classification -- 5. Miscellaneous Resampling Techniques -- 6. Combining Numeric Predictions -- 7. Combining Classification Models -- 8. Gaiting Methods -- 9. Information and Entropy -- References. |
| Record Nr. | UNINA-9910300755503321 |
|
Masters Timothy
|
||
| Berkeley, CA : , : Apress : , : Imprint : Apress, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Average-Case Analysis of Numerical Problems [[electronic resource] /] / by Klaus Ritter
| Average-Case Analysis of Numerical Problems [[electronic resource] /] / by Klaus Ritter |
| Autore | Ritter Klaus |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XI, 252 p.) |
| Disciplina | 519.4 |
| Collana | Lecture Notes in Mathematics |
| Soggetto topico |
Numerical analysis
Statistics Numerical Analysis Statistics, general |
| ISBN | 3-540-45592-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Linear problems: Definitions and a classical example -- Second-order results for linear problems -- Integration and approximation of univariate functions -- Linear problems for univariate functions with noisy data -- Integration and approximation of multivariate functions -- Nonlinear methods for linear problems -- Nonlinear problems. |
| Record Nr. | UNISA-996466508003316 |
|
Ritter Klaus
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Business Analysis Using Regression [[electronic resource] ] : A Casebook / / by Robert A. Stine, Dean P. Foster, Richard P. Waterman
| Business Analysis Using Regression [[electronic resource] ] : A Casebook / / by Robert A. Stine, Dean P. Foster, Richard P. Waterman |
| Autore | Stine Robert A |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (348p. 183 illus.) |
| Disciplina | 300/.1/519536 |
| Soggetto topico |
Statistics
Statistics, general |
| ISBN | 1-4612-0683-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Class 1. Fitting Equations to Data -- Efficiency of Cleaning Crews -- Liquor Sales and Display Space -- Managing Benefits Costs -- Predicting Cellular Phone use -- Class 2. Assumptions in Regression Modeling -- The Ideal Regression Model -- Predicting Cellular Phone use, Revisited -- Efficiency of Cleaning Crews, Revisited -- Housing Prices and Crime Rates -- Direct Mail Advertising and Sales -- Housing Construction -- Class 3. Prediction and Confidence Intervals in Regression -- Housing Construction, Revisited -- Liquor Sales and Display Space, Revisited -- Class 4. Multiple Regression -- Automobile Design -- Class 5. Collinearity -- Stock Prices and Market Indices -- Improving Parcel Handling -- Class 6. Modeling Categorical Factors with two Levels -- Employee Performance Study -- Class 7. Modeling Categorical Factors with two or More Levels -- Wage Discrimination, Revisited -- Timing Production Runs -- Class 8. Summary Regression Case -- Executive Compensation -- Using Stepwise Regression for Prediction -- Class 9. Comparing Many Mean Values -- Selecting the Best Vendor -- Headache Pain Relief -- Analysis of Variance and Tests for Linearity -- Class 10. Analysis of Variance with Two Factors -- Package Design Experiment -- Evaluating Employee time Schedules -- Class 11. Modeling a Categorical Response -- The Challenger Disaster -- Marketing Orange Juice -- Class 12. Modeling Time Series -- Predicting Cellular Phone use, Revisited -- Trends in Computer Sales -- Assignments -- Appendix: Use with Minitab. |
| Record Nr. | UNINA-9910479887303321 |
|
Stine Robert A
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Soggetto topico
-
Statistics, general
(95)
- Statistics (56)
- Statistics (38)
- Probabilities (22)
- Probability Theory and Stochastic Processes (22)