作者：
Cash, GGEnvironmental Effects Branch
Health & Environmental Review Division Office of Pollution Prevention & Toxics U.S. Environmental Protection Agency SW USA
A fast computer algorithm is described which brings computation of the permanents of sparse matrices, specifically, chemical adjacency matrices, within the reach of a desktop computer. Examples and results are present...
详细信息
A fast computer algorithm is described which brings computation of the permanents of sparse matrices, specifically, chemical adjacency matrices, within the reach of a desktop computer. Examples and results are presented, along with a discussion of the relationship of the permanent to the Kekule structure count. Also presented is a C-language implementation which was deliberately written for ease of translation into other high-level languages.
It does not appear to be widely recognized that a computer can be a useful aid in the design of experiments as well as in the analysis of the data. The computer can be particularly useful in the administration of an e...
详细信息
It does not appear to be widely recognized that a computer can be a useful aid in the design of experiments as well as in the analysis of the data. The computer can be particularly useful in the administration of an experimental program and in developing experimental plans for those situations in which the classic designs (e.g., factorial and response surface) are not applicable. Such situations include irregularly-shaped experimental regions, mixture experiments and formulation studies, the need to construct unusual fractions of factorial designs, and experimental plans to estimate the parameters in nonlinear models. Several examples are presented to illustrate the practical problems encountered and how computer algorithms can be helpful in developing useful experimental designs.
In this study, a quadrupedal pronking gait robot modeling was carried out with Spring Loaded Inverted Pendulum model in stance phase. This is achieved by solving a natural problem in which the main goal is to enable t...
详细信息
In this study, a quadrupedal pronking gait robot modeling was carried out with Spring Loaded Inverted Pendulum model in stance phase. This is achieved by solving a natural problem in which the main goal is to enable the robot to walk and run in a stable condition regardless of the environmental conditions. In order to solve this problem, dynamic model and control of a quadrupedal robot were realized for a pronking gait. The stance and flight phase dynamic structures were solved in a sequential closed loop to obtain the equation of motion for pronking gait. Spring Loaded Inverted Pendulum model was used as a dynamic model to simplify the simulation, dynamic locomotion and experimental works of the system, and also to simplify the pronking gait concept. The quadrupedal robot with pronking gait was controlled by proportional-derivative control algorithm. As a result, all computer simulations have shown that the proposed control actions and methods are more effective and make the system control quite easy and successful. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.
In 1936, when he was just twenty-four years old, Alan Turing wrote a remarkable paper in which he outlined the theory of computation, laying out the ideas that underlie all modern computers. This groundbreaking and po...
详细信息
ISBN:
(纸本)9780262034548
In 1936, when he was just twenty-four years old, Alan Turing wrote a remarkable paper in which he outlined the theory of computation, laying out the ideas that underlie all modern computers. This groundbreaking and powerful theory now forms the basis of computer science. In Turing's Vision, Chris Bernhardt explains the theory, Turing's most important contribution, for the general reader. Bernhardt argues that the strength of Turing's theory is its simplicity, and that, explained in a straightforward manner, it is eminently understandable by the nonspecialist. As Marvin Minsky writes, "The sheer simplicity of the theory's foundation and extraordinary short path from this foundation to its logical and surprising conclusions give the theory a mathematical beauty that alone guarantees it a permanent place in computer theory." Bernhardt begins with the foundation and systematically builds to the surprising conclusions. He also views Turing's theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing's later work, and the birth of the modern computer. In the paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," Turing thinks carefully about how humans perform computation, breaking it down into a sequence of steps, and then constructs theoretical machines capable of performing each step. Turing wanted to show that there were problems that were beyond any computer's ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing's ideas, Bernhardt examines three well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing's problem concerning computable numbers.
Information about the topics discussed at the 80th public meeting of the computer Conservation Society on December 8, 2005 at London Science Museum in England is presented. The meeting focused on the history of French...
详细信息
Information about the topics discussed at the 80th public meeting of the computer Conservation Society on December 8, 2005 at London Science Museum in England is presented. The meeting focused on the history of French computing devices. It tackled calculating machines and punched cards like Pascal, the Arithmometer of Thomas de Colmar and tables of logarithms of de Prony's. It gave insights on the story of the French software industry which developed various mathematical tools. It also honored the Association for an Academy of Data Processing and Telematics for being responsible in preserving the computing heritage in France. The meeting featured the members of the computer Conservation Society, Philippe Denoyelle and Hans Paufal, as speakers.
The typical engineering design process can be decomposed into several phases: creative exploration of ideas, testing soundness of proposed concepts, refining concepts to realizable solutions, optimizing viable solutio...
详细信息
ISBN:
(纸本)0769524737
The typical engineering design process can be decomposed into several phases: creative exploration of ideas, testing soundness of proposed concepts, refining concepts to realizable solutions, optimizing viable solutions with respect to performance/cost. Powerful computer algorithms have been developed for many of these tasks. Often these modules are rigid allowing for little intervention by the designer, and the management of the interactions of these tasks mostly relies on human intelligence. Better user interfaces are required to integrate more fully human ingenuity and the assistance of the computer into the overall design process. The most powerful CAD systems should combine the power of programming, graphical visualization, and interactive adjustment of crucial design parameters.
This article provides important mathematical descriptions and computer algorithms in relation to the responding optimally with unknown sources of evidence (ROUSE) model of Huber, Shiffrin Lyle, and Ruys (2001), which ...
详细信息
This article provides important mathematical descriptions and computer algorithms in relation to the responding optimally with unknown sources of evidence (ROUSE) model of Huber, Shiffrin Lyle, and Ruys (2001), which has been applied to short-term prindng phenomena. In the first section, techniques for obtaining parameter confidence intervals and parameter correlations are described, which are generally applicable to any mathematical model. In the second section, a technique for producing analytic ROUSE predictions is described. Huber et al. (2001) averaged many stochastic trials to obtain stable behavior. By appropriately weighting all possible combinations of feature states, an alternative analytic version is developed, yielding asymptotic model behavior with fewer computations. The third section ties together these separate techniques, obtaining parameter confidence and correlations for the analytic version of the ROUSE model. In doing so, previously unreported behaviors of the model are revealed. In particular, complications due to local minima are discussed, in terms of both variance-covariance analyses and bootstrap sampling analyses.
A need exists for a set of computer programs that can be used by students to solve elementary digital signal processing problems using a personal computer. This project involved the design and implementation of ten al...
详细信息
A need exists for a set of computer programs that can be used by students to solve elementary digital signal processing problems using a personal computer. This project involved the design and implementation of ten algorithms that solve such problems and an additional algorithm that creates plots of the various input and output sequences. The two primary goals of the programs were: 1) user friendliness and, 2) portability. With these goals in mind, the source code was written using Fortran-77 and compiled by a commercially available Fortran compiler specifically designed for personal computers. The plotting program uses a Fortran-compatible graphics package that is also com- mercially available. The programs, once compiled, can be distributed to users without the requirement to purchase either a Fortran compiler or a graphics package; however, access to a Fortran compiler enhances the utility of the programs.
暂无评论