The Program System Processor is a program system under development, which gives conversational design aids to the specification of the desired information processing systems, generates the programs and job streams and...
详细信息
The Program System Processor is a program system under development, which gives conversational design aids to the specification of the desired information processing systems, generates the programs and job streams and guides the operation of the generated program systems. Based on the Systematics problem definition language it uses data relation normalization and step-wise processing mode suggested by this method.
The din in the packed arena had hardly subsided to a mild roar, when suddenly the fans exploded once again. "What a move!" screamed one nearby spectator. "How did he ever find a way through that defense...
详细信息
The din in the packed arena had hardly subsided to a mild roar, when suddenly the fans exploded once again. "What a move!" screamed one nearby spectator. "How did he ever find a way through that defense?" wondered another, overcome with admiration.
The article focuses on the impact of stochastic process algebra (SPA) on the field of performance modelling which is based on the Performance Evaluation Process Algebra (PEPA). The SPA is used by the stochastic modell...
详细信息
The article focuses on the impact of stochastic process algebra (SPA) on the field of performance modelling which is based on the Performance Evaluation Process Algebra (PEPA). The SPA is used by the stochastic modeller because the parsimonious set of operators provides programming-like simplicity to model specification and the models can be derived from other formal specifications in an automatic or semi-automatic way.
The major characteristics of array and vector processors are described. It is indicated how these features affect the formulation of efficient parallel algorithms. This leads to considerations involving information fl...
详细信息
The major characteristics of array and vector processors are described. It is indicated how these features affect the formulation of efficient parallel algorithms. This leads to considerations involving information flow during a parallel algorithm and its affects on bandwidth requirements.
The example of defining a law for operation of a stacking conveyor demonstrates the possibility of a language for algorithm graphs. This language is sufficiently universal and can be used for describing a law for oper...
详细信息
The example of defining a law for operation of a stacking conveyor demonstrates the possibility of a language for algorithm graphs. This language is sufficiently universal and can be used for describing a law for operation of a wide class of manipulators and other similar devices, and it is sufficiently graphic. The algorithm graphs allow accurately, with all necessary details but at the same time concisely, describing any microprogram for operating manipulators and revealing its logical imperfection with both heuristic and formal methods of the theory of graphs. The algorithm graphs obtained can be used as the basis for developing a computer program in any both high- and low-level algorithm language.
The effective extraction of information from multidimensional data sets derived from phenotyping experiments is a growing challenge in biology. Data visualization tools are important resources that can aid in explorat...
详细信息
The effective extraction of information from multidimensional data sets derived from phenotyping experiments is a growing challenge in biology. Data visualization tools are important resources that can aid in exploratory data analysis of complex data sets. Phenotyping experiments of model organisms produce data sets in which a large number of phenotypic measures are collected for each individual in a group. A critical initial step in the analysis of such multidimensional data sets is the exploratory analysis of data distribution and correlation. To facilitate the rapid visualization and exploratory analysis of multidimensional complex trait data, we have developed a user-friendly, web-based software tool called Phenostat. Phenostat is composed of a dynamic graphical environment that allows the user to inspect the distribution of multiple variables in a data set simultaneously. Individuals can be selected by directly clicking on the graphs and thus displaying their identity, highlighting corresponding values in all graphs, allowing their inclusion or exclusion from the analysis. Statistical analysis is provided by R package functions. Phenostat is particularly suited for rapid distribution and correlation analysis of subsets of data. An analysis of behavioral and physiologic data stemming from a large mouse phenotyping experiment using Phenostat reveals previously unsuspected correlations. Phenostat is freely available to academic institutions and nonprofit organizations and can be used from our website at http://***/phenostat/.
Provides a brief history of computer music, using selections from "Music from Mathematics" (1962) and "The Voice of the computer" (1970), two seminal computer music recordings from Decca, for illus...
详细信息
Provides a brief history of computer music, using selections from "Music from Mathematics" (1962) and "The Voice of the computer" (1970), two seminal computer music recordings from Decca, for illustration. Focuses on the work of Max Mathews, John Chowning, and F. Richard Moore.
An optimization approach is presented for generating linkage mechanisms consisting of frame members with arbitrarily inclined hinges. A second-order cone programming (SOCP) problem is solved to obtain the locations an...
详细信息
An optimization approach is presented for generating linkage mechanisms consisting of frame members with arbitrarily inclined hinges. A second-order cone programming (SOCP) problem is solved to obtain the locations and directions of hinges of an infinitesimal mechanism. It is shown that the primal and dual SOCP problems correspond to the plastic limit analysis problems based on the lower-bound and upper-bound theorems, respectively, with quadratic yield functions. Constraints on displacement components are added to the dual problem, if a desirable deformation is not obtained. A finite mechanism is generated by carrying out geometrically nonlinear analysis and, if necessary, adding hinges and removing members. Effectiveness of the proposed method is demonstrated through examples of two- and three-dimensional mechanisms.
The problem of evaluating the dynamic performance of software systems using various modeling techniques is discussed. Possible new areas of research in this area are indicated.
The problem of evaluating the dynamic performance of software systems using various modeling techniques is discussed. Possible new areas of research in this area are indicated.
暂无评论