About: Computer science is a research topic. Over the lifetime, 3 publications have been published within this topic receiving 2 citations. The topic is also known as: computing science & CS.
Papers published on a yearly basis
29 Sep 2022
TL;DR: The R Book is the first comprehensive reference manual for the R language, including practical guidance and full coverage of the graphics facilities, and introduces the advantages of the R environment, detailing its applications in a wide range of disciplines.
Abstract: The high-level language of R is recognized as one of the most powerful and flexible statistical software environments, and is rapidly becoming the standard setting for quantitative analysis, statistics and graphics. R provides free access to unrivalled coverage and cutting-edge applications, enabling the user to apply numerous statistical methods ranging from simple regression to time series or multivariate analysis. Building on the success of the authors bestselling Statistics: An Introduction using R, The R Book is packed with worked examples, providing an all inclusive guide to R, ideal for novice and more accomplished users alike. The book assumes no background in statistics or computing and introduces the advantages of the R environment, detailing its applications in a wide range of disciplines. Provides the first comprehensive reference manual for the R language, including practical guidance and full coverage of the graphics facilities. Introduces all the statistical models covered by R, beginning with simple classical tests such as chi-square and t-test. Proceeds to examine more advance methods, from regression and analysis of variance, through to generalized linear models, generalized mixed models, time series, spatial statistics, multivariate statistics and much more. The R Book is aimed at undergraduates, postgraduates and professionals in science, engineering and medicine. It is also ideal for students and professionals in statistics, economics, geography and the social sciences.
02 Mar 2022
TL;DR: This book provides the reader with a review of correlation and covariance among variables, followed by multiple regression and path analysis techniques to better understand the building blocks of structural equation modelling.
Abstract: This book provides the reader with a review of correlation and covariance among variables, followed by multiple regression and path analysis techniques to better understand the building blocks of structural equation modelling. The concepts behind measurement models are introduced to illustrate how measurement error impacts statistical analyses, and structural models are presented that indicate how latent variable relationships can be established. Examples are included throughout to make the concepts clear to the reader. The structural equation modelling examples are presented using either EQS5.0 or LISREL8-SIMPLIS programming language, both of which have an easy-to-use set of commands to specify measurement and strucural models. No complicated programming is required, nor does the reader need an advanced understanding of statistics of matrix algebra. A goal in writing this volume was to focus conceptually on the steps one takes in analyzing theoretical models. These steps encompass: specifying a model based upon theory or prior research; determining whether the model can be identified to have unique estimates for variables in the model; selecting an appropriate estimation method based on the distributional assumptions of variables; testing the model and interpreting fit indices; and finally respecifying a model based on suggested modification indices, which involves adding or dropping paths in the model to obtain a better model fit. The resources and references provided in this book should equip faculty, students and researchers to enhance their working knowledge of structural equation modelling. Not intended as an in-depth presentation of statistics or factor analysis, this text focuses on the basic ideas and principles behind structural equation modelling. Assuming that the reader has a basic understanding of correlation, the authors have built upon this understanding to present these basic ideas and principles.
TL;DR: In this article, a generative adversarial network (GAN) is proposed to estimate generative models via an adversarial process, in which two models are simultaneously trained: a generator G and a discriminator D that estimates the probability that a sample came from the training data rather than G.
Abstract: We propose a new framework for estimating generative models via an adversarial process, in which we simultaneously train two models: a generative model G that captures the data distribution, and a discriminative model D that estimates the probability that a sample came from the training data rather than G. The training procedure for G is to maximize the probability of D making a mistake. This framework corresponds to a minimax two-player game. In the space of arbitrary functions G and D, a unique solution exists, with G recovering the training data distribution and D equal to 1/2 everywhere. In the case where G and D are defined by multilayer perceptrons, the entire system can be trained with backpropagation. There is no need for any Markov chains or unrolled approximate inference networks during either training or generation of samples. Experiments demonstrate the potential of the framework through qualitative and quantitative evaluation of the generated samples.
01 Oct 2000
TL;DR: This document describes the Stream Control Transmission Protocol (SCTP), which is designed to transport PSTN signaling messages over IP networks, but is capable of broader applications.
Abstract: This document describes the Stream Control Transmission Protocol (SCTP). SCTP is designed to transport PSTN signaling messages over IP networks, but is capable of broader applications.
TL;DR: Several of the fundamental algorithms used in LAMMPS are described along with the design strategies which have made it flexible for both users and developers, and some capabilities recently added to the code which were enabled by this flexibility are highlighted.
Abstract: Since the classical molecular dynamics simulator LAMMPS was released as an open source code in 2004, it has become a widely-used tool for particle-based modeling of materials at length scales ranging from atomic to mesoscale to continuum. Reasons for its popularity are that it provides a wide variety of particle interaction models for different materials, that it runs on any platform from a single CPU core to the largest supercomputers with accelerators, and that it gives users control over simulation details, either via the input script or by adding code for new interatomic potentials, constraints, diagnostics, or other features needed for their models. As a result, hundreds of people have contributed new capabilities to LAMMPS and it has grown from fifty thousand lines of code in 2004 to a million lines today. In this paper several of the fundamental algorithms used in LAMMPS are described along with the design strategies which have made it flexible for both users and developers. We also highlight some capabilities recently added to the code which were enabled by this flexibility, including dynamic load balancing, on-the-fly visualization, magnetic spin dynamics models, and quantum-accuracy machine learning interatomic potentials. Program Summary Program Title: Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) CPC Library link to program files: https://doi.org/10.17632/cxbxs9btsv.1 Developer's repository link: https://github.com/lammps/lammps Licensing provisions: GPLv2 Programming language: C++, Python, C, Fortran Supplementary material: https://www.lammps.org Nature of problem: Many science applications in physics, chemistry, materials science, and related fields require parallel, scalable, and efficient generation of long, stable classical particle dynamics trajectories. Within this common problem definition, there lies a great diversity of use cases, distinguished by different particle interaction models, external constraints, as well as timescales and lengthscales ranging from atomic to mesoscale to macroscopic. Solution method: The LAMMPS code uses parallel spatial decomposition, distributed neighbor lists, and parallel FFTs for long-range Coulombic interactions . The time integration algorithm is based on the Stormer-Verlet symplectic integrator , which provides better stability than higher-order non-symplectic methods. In addition, LAMMPS supports a wide range of interatomic potentials, constraints, diagnostics, software interfaces, and pre- and post-processing features. Additional comments including restrictions and unusual features: This paper serves as the definitive reference for the LAMMPS code. References  S. Plimpton, Fast parallel algorithms for short-range molecular dynamics. J. Comp. Phys. 117 (1995) 1–19.  L. Verlet, Computer experiments on classical fluids: I. Thermodynamical properties of Lennard–Jones molecules, Phys. Rev. 159 (1967) 98–103.
Trending Questions (10)