MEANCOMP: A Pascal program for computing mean reaction times with outlier selection
نویسندگان
چکیده
منابع مشابه
A Pascal Based Approach towards Statistical Computing
Most statistical programming languages (like S, R or XploRe) are dynamically typed and employ an interpreter for program execution. However, the interactivity supported by that approach is usually not required for libraries which are not modified by the user. We discuss the related performance problems and suggest the usage of a strongly typed language that includes the data manipulation facili...
متن کاملReaction paths based on mean first-passage times
Finding representative reaction pathways is important for understanding the mechanism of molecular processes. We propose a new approach for constructing reaction paths based on mean first-passage times. This approach incorporates information about all possible reaction events as well as the effect of temperature. As an application of this method, we study representative pathways of excitation m...
متن کاملMAP: A Pascal Macro Preprocessor for Large Program Development
The programming language Pascal waH originally designed for tcaching introductory programming, currently, however, production systems use it as the primary implementation language. This paper describes extensions of Pascal intended to aid the large program developer. The extensions are implemented in a macro preprocessor MAP, which supports constant expression evaluation, source file inclusion,...
متن کاملMEAN-ABSOLUTE DEVIATION PORTFOLIO SELECTION MODEL WITH FUZZY RETURNS
In this paper, we consider portfolio selection problem in which security returns are regarded as fuzzy variables rather than random variables. We first introduce a concept of absolute deviation for fuzzy variables and prove some useful properties, which imply that absolute deviation may be used to measure risk well. Then we propose two mean-absolute deviation models by defining risk as abs...
متن کاملA Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavior Research Methods, Instruments, & Computers
سال: 1986
ISSN: 0743-3808,1532-5970
DOI: 10.3758/bf03200996