共查询到20条相似文献，搜索用时 46 毫秒
1.
HiggsBounds is a computer code that tests theoretical predictions of models with arbitrary Higgs sectors against the exclusion bounds obtained from the Higgs searches at LEP and the Tevatron. The included experimental information comprises exclusion bounds at 95% C.L. on topological cross sections. In order to determine which search topology has the highest exclusion power, the program also includes, for each topology, information from the experiments on the expected exclusion bound, which would have been observed in case of a pure background distribution. Using the predictions of the desired model provided by the user as input, HiggsBounds determines the most sensitive channel and tests whether the considered parameter point is excluded at the 95% C.L. HiggsBounds is available as a Fortran 77 and Fortran 90 code. The code can be invoked as a command line version, a subroutine version and an online version. Examples of exclusion bounds obtained with HiggsBounds are discussed for the Standard Model, for a model with a fourth generation of quarks and leptons and for the Minimal Supersymmetric Standard Model with and without CP-violation. The experimental information on the exclusion bounds currently implemented in HiggsBounds will be updated as new results from the Higgs searches become available.
Program summary
Program title: HiggsBoundsCatalogue identifier: AEFF_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFF_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 55 733No. of bytes in distributed program, including test data, etc.: 1 986 213Distribution format: tar.gzProgramming language: Fortran 77, Fortran 90 (two code versions are offered).Computer: HiggsBounds can be built with any compatible Fortran 77 or Fortran 90 compiler. The program has been tested on x86 CPUs running under Linux (Ubuntu 8.04) and with the following compilers: The Portland Group Inc. Fortran compilers (pgf77, pgf90), the GNU project Fortran compilers (g77, gfortran).Operating system: LinuxRAM: minimum of about 6000 kbytes (dependent on the code version)Classification: 11.1External routines: HiggsBounds requires no external routines/libraries. Some sample programs in the distribution require the programs FeynHiggs 2.6.x or CPsuperH2 to be installed (see “Subprograms used”).Subprograms used:Cat Id Title Reference ADKT_v2_0 FeynHiggsv2.6.5 CPC 180(2009)1426 ADSR_v2_0 CPsuperH2.0 CPC 180(2009)312 - Full-size table
2.
A new atsp2K module is presented for evaluating the electron density function of any multiconfiguration Hartree-Fock or configuration interaction wave function in the non-relativistic or relativistic Breit-Pauli approximation. It is first stressed that the density function is not a priori spherically symmetric in the general open shell case. Ways of building it as a spherical symmetric function are discussed, from which the radial electron density function emerges. This function is written in second quantized coupled tensorial form for exploring the atomic spherical symmetry. The calculation of its expectation value is performed using the angular momentum theory in orbital, spin, and quasispin spaces, adopting a generalized graphical technique. The natural orbitals are evaluated from the diagonalization of the density matrix.
Program summary
Program title: DENSITYCatalogue identifier: AEFR_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFR_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC license, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 6603No. of bytes in distributed program, including test data, etc.: 169 881Distribution format: tar.gzProgramming language: FORTRAN 90Computer: HP XC Cluster Platform 4000Operating system: HP XC System Software 3.2.1, which is a Linux distribution compatible with Red Hat Enterprise Advanced ServerWord size: 32 bitsClassification: 2.1, 2.9, 4.1Subprograms used:Cat Id Title Reference ADLY_v2_0 ATSP2K CPC 176 (2007) 559 - Full-size table
3.
We present a general purpose parallel molecular dynamics simulation code. The code can handle NVE, NVT, and NPT ensemble molecular dynamics, Langevin dynamics, and dissipative particle dynamics. Long-range interactions are handled by using the smooth particle mesh Ewald method. The implicit solvent model using solvent-accessible surface area was also implemented. Benchmark results using molecular dynamics, Langevin dynamics, and dissipative particle dynamics are given.
Program summary
Title of program:MM_PARCatalogue identifier:ADXP_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXP_v1_0Program obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandComputer for which the program is designed and others on which it has been tested:any UNIX machine. The code has been tested on Linux cluster and IBM p690Operating systems or monitors under which the program has been tested:Linux, AIXProgramming language used:CMemory required to execute with typical data:∼60 MB for a system of atoms Has the code been vectorized or parallelized? parallelized with MPI using atom decomposition and domain decompositionNo. of lines in distributed program, including test data, etc.:171 427No. of bytes in distributed program, including test data, etc.:4 558 773Distribution format:tar.gzExternal routines/libraries used:FFTW free software (http://www.fftw.org)Nature of physical problem:Structural, thermodynamic, and dynamical properties of fluids and solids from microscopic scales to mesoscopic scales.Method of solution:Molecular dynamics simulation in NVE, NVT, and NPT ensemble, Langevin dynamics simulation, dissipative particle dynamics simulation.Typical running time:Table below shows the typical run times for the four test programs.Benchmark results. The values in the parenthesis are the number of processors used System Method Timing for 100 steps in seconds 256 TIP3P MD 23.8 (1) 64 DMPC + 1645 TIP3P MD 890 (1) 528 (2) 326 (4) 209 (8) 8 Aβ16-22 LD 1.02 (1) 23760 Groot-Warren particles DPD 22.16 (1) - Full-size table
4.
T. Hahn 《Computer Physics Communications》2005,168(2):78-95
The Cuba library provides new implementations of four general-purpose multidimensional integration algorithms: Vegas, Suave, Divonne, and Cuhre. Suave is a new algorithm, Divonne is a known algorithm to which important details have been added, and Vegas and Cuhre are new implementations of existing algorithms with only few improvements over the original versions. All four algorithms can integrate vector integrands and have very similar Fortran, C/C++, and Mathematica interfaces.
Program summary
Title of program:CubaCatalogue identifier: ADVHProgram summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVHProgram obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandComputer for which the program is designed and others on which is has been tested:Designed for: all platforms with an ISO C99 C compilerTested on: x86 (Linux/gcc), Alpha (Tru64 Unix/gcc)Operating systems or monitors under which the program has been tested: Linux, Tru64 UnixProgramming language used: CMemory required to execute with typical data: 1M wordsNo. of bits in a word: 8No. of processors used: 1Has the code been vectorized or parallelized?: Not yetNo. of lines in distributed program, including test data, etc.: 9380No. of bytes in distributed program, including test data, etc.: 131 293Distribution format: tar.gzNature of the physical problem: Multidimensional numerical integrations, e.g., of phase spaces.Method of solution: The Cuba library contains the four algorithms Vegas, Suave, Divonne, and Cuhre with the following characteristics:Routine Basic integration method Algorithm type Variance reduction Vegas Sobol quasi-random sample Monte Carlo importance sampling Suave Sobol quasi-random sample Monte Carlo globally adaptive subdivision Divonne Korobov quasi-random sample Monte Carlo stratified sampling, or Sobol quasi-random sample Monte Carlo aided by methods from or cubature rules deterministic numerical optimization Cuhre cubature rules deterministic globally adaptive subdivision - Full-size table
5.
This paper reports the results of a near-global validation of the SRTM DEM dataset, using a unique database of completely independent height measurements derived from satellite altimeter echoes, primarily gathered by ERS-1. These heights are obtained using a rule-based expert system which identifies each echo as 1 of 11 different characteristic shapes, and selects the optimal retracking algorithm to obtain best range to surface. The results of this comparison, which includes over 54 million altimeter derived heights, show generally very good agreement with the SRTM data, with global statistics for mean difference of 3 m and a standard deviation of 16 m. Quantitative validation results are given for each continent and are summarised here.
Mean difference (m) Standard deviation of differences (m) Africa 1.86 15.62 Australia 1.09 11.49 Eurasia 2.54 16.09 North America 3.15 15.18 South America 12.22 18.51 Global 3.60 16.16 - Full-size table
6.
A computer algebra program for finding polynomial conserved densities of implicit difference-difference equations is presented. The algorithm is based on scaling properties and implemented in computer algebra system REDUCE. The package is applicable to systems of any number of nonlinear difference-difference equations of polynomial type.
Program summary
Title of program: TXCDCatalogue identifier: ADTSProgram summary URL:http://cpc.cs.qub.ac.uk/summaries/ADTSProgram obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandComputers: PC/AT compatible machineOperating systems: Windows 2000Programming language used: REDUCE 3.6, RLISPMemory required to execute with typical data: Depends on the problem, minimum about 2 M bytes.No. of bits in a word: 32No. of bytes in distributed program, including test data, etc.: 10 005No. of lines in distributed program, including test data, etc.: 1739Distribution format: tar gzip fileNature of physical problem: The existence of conserved densities for difference-difference equations is of interest for their classification and for understanding the stability of their solutions.Restriction on the complexity of the problem: The program can handle difference-difference equations which can be transformed to polynomial ones, and determine the homogeneous conservation laws.Typical running time: It depends on the equation and the rank of the conserved density. It increases exponentially with the rank of the conserved density. The running times on the PC Pentium with operating systems Windows 2000 (Xeon, 1.7 GHz) are shown in the table below. Timings are given in milliseconds.Performance on Windows Example Rank 0 1 2 3 4 5 6 7 8 9 1(i) 15 15 15 31 150 718 5483 28176 127914 493092 1(ii) 15 15 16 63 170 2264 11171 103938 299001 1386468 1(iii) 15 15 15 46 250 5686 29210 203190 924372 1(iv) 15 15 15 31 47 156 1031 8905 40485 194595 2 15 15 45 187 2358 36673 433794 3(i) 15 63 1780 66518 1390030 ∗∗ 3(ii) 15 47 829 37640 786594 ∗∗ The cases ∗∗ were rejected by memory error. - Full-size table
7.
Neil D. Christensen 《Computer Physics Communications》2009,180(9):1614-1641
In this paper we present FeynRules, a new Mathematica package that facilitates the implementation of new particle physics models. After the user implements the basic model information (e.g., particle content, parameters and Lagrangian), FeynRules derives the Feynman rules and stores them in a generic form suitable for translation to any Feynman diagram calculation program. The model can then be translated to the format specific to a particular Feynman diagram calculator via FeynRules translation interfaces. Such interfaces have been written for CalcHEP/CompHEP, FeynArts/FormCalc, MadGraph/MadEvent and Sherpa, making it possible to write a new model once and have it work in all of these programs. In this paper, we describe how to implement a new model, generate the Feynman rules, use a generic translation interface, and write a new translation interface. We also discuss the details of the FeynRules code.
Program summary
Program title: FeynRulesCatalogue identifier: AEDI_v1_0Program summary URL::http://cpc.cs.qub.ac.uk/summaries/AEDI_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 15 980No. of bytes in distributed program, including test data, etc.: 137 383Distribution format: tar.gzProgramming language: MathematicaComputer: Platforms on which Mathematica is availableOperating system: Operating systems on which Mathematica is availableClassification: 11.1, 11.2, 11.6Nature of problem: Automatic derivation of Feynman rules from a Lagrangian. Implementation of new models into Monte Carlo event generators and FeynArts.Solution method: FeynRules works in two steps:1. derivation of the Feynman rules directly form the Lagrangian using canonical commutation relations among fields and creation operators. 2. implementation of the new physics model into FeynArts as well as various Monte Carlo programs via interfaces. - Full-size table
8.
9.
S. Nath 《Computer Physics Communications》2009,180(11):2392-2393
10.
11.
Andrzej Daniluk 《Computer Physics Communications》2010,181(3):707-708
Scientific computing is the field of study concerned with constructing mathematical models, numerical solution techniques and with using computers to analyse and solve scientific and engineering problems. Model-Driven Development (MDD) has been proposed as a means to support the software development process through the use of a model-centric approach. This paper surveys the core MDD technology that was used to develop an application that allows computation of the RHEED intensities dynamically for a disordered surface.
New version program summary
Program title: RHEED1DProcessCatalogue identifier: ADUY_v4_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADUY_v4_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 31 971No. of bytes in distributed program, including test data, etc.: 3 039 820Distribution format: tar.gzProgramming language: Embarcadero C++ BuilderComputer: Intel Core Duo-based PCOperating system: Windows XP, Vista, 7RAM: more than 1 GBClassification: 4.3, 7.2, 6.2, 8, 14Catalogue identifier of previous version: ADUY_v3_0Journal reference of previous version: Comput. Phys. Comm. 180 (2009) 2394Does the new version supersede the previous version?: NoNature of problem: An application that implements numerical simulations should be constructed according to the CSFAR rules: clear and well-documented, simple, fast, accurate, and robust. A clearly written, externally and internally documented program is much easier to understand and modify. A simple program is much less prone to error and is more easily modified than one that is complicated. Simplicity and clarity also help make the program flexible. Making the program fast has economic benefits. It also allows flexibility because some of the features that make a program efficient can be traded off for greater accuracy. Making the program fast also has the benefit of allowing longer calculations with better resolution. The compromise between speed and accuracy has always posted one of the most troublesome challenges for the programmer. Almost all advances in numerical analysis have come about trying to reach these twin goals. Change in the basic algorithms will give greater improvements in accuracy and speed than using special numerical tricks or changing programming language. A robust program works correctly over a broad spectrum of input data.Solution method: The computational model of the program is based on the use of a dynamical diffraction theory in which the electrons are taken to be diffracted by a potential, which is periodic in the dimension perpendicular to the surface. In the case of a disordered surface we can use the proportional model of the scattering potential, in which the potential of a partially filled layer is taken to be the product of the coverage of this layer and the potential of a fully filled layer:12.
Andrzej Daniluk 《Computer Physics Communications》2011,182(6):1389-1390
A computational model is a computer program, which attempts to simulate an abstract model of a particular system. Computational models use enormous calculations and often require supercomputer speed. As personal computers are becoming more and more powerful, more laboratory experiments can be converted into computer models that can be interactively examined by scientists and students without the risk and cost of the actual experiments. The future of programming is concurrent programming. The threaded programming model provides application programmers with a useful abstraction of concurrent execution of multiple tasks. The objective of this release is to address the design of architecture for scientific application, which may execute as multiple threads execution, as well as implementations of the related shared data structures.
New version program summary
Program title: GrowthCPCatalogue identifier: ADVL_v4_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVL_v4_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 32 269No. of bytes in distributed program, including test data, etc.: 8 234 229Distribution format: tar.gzProgramming language: Free Object PascalComputer: multi-core x64-based PCOperating system: Windows XP, Vista, 7Has the code been vectorised or parallelized?: NoRAM: More than 1 GB. The program requires a 32-bit or 64-bit processor to run the generated code. Memory is addressed using 32-bit (on 32-bit processors) or 64-bit (on 64-bit processors with 64-bit addressing) pointers. The amount of addressed memory is limited only by the available amount of virtual memory.Supplementary material: The figures mentioned in the “Summary of revisions” section can be obtained here.Classification: 4.3, 7.2, 6.2, 8, 14External routines: Lazarus [1]Catalogue identifier of previous version: ADVL_v3_0Journal reference of previous version: Comput. Phys. Comm. 181 (2010) 709Does the new version supersede the previous version?: YesNature of problem: Reflection high-energy electron diffraction (RHEED) is an important in-situ analysis technique, which is capable of giving quantitative information about the growth process of thin layers and its control. It can be used to calibrate growth rate, analyze surface morphology, calibrate surface temperature, monitor the arrangement of the surface atoms, and provide information about growth kinetics. Such control allows the development of structures where the electrons can be confined in space, giving quantum wells or even quantum dots. In order to determine the atomic positions of atoms in the first few layers, the RHEED intensity must be measured as a function of the scattering angles and then compared with dynamic calculations. The objective of this release is to address the design of architecture for application that simulates the rocking curves RHEED intensities during hetero-epitaxial growth process of thin films.Solution method: The GrowthCP is a complex numerical model that uses multiple threads for simulation of epitaxial growth of thin layers. This model consists of two transactional parts. The first part is a mathematical model being based on the Runge–Kutta method with adaptive step-size control. The second part represents first-principles of the one-dimensional RHEED computational model. This model is based on solving a one-dimensional Schrödinger equation. Several problems can arise when applications contain a mixture of data access code, numerical code, and presentation code. Such applications are difficult to maintain, because interdependencies between all the components cause strong ripple effects whenever a change is made anywhere. Adding new data views often requires reimplementing a numerical code, which then requires maintenance in multiple places. In order to solve problems of this type, the computational and threading layers of the project have been implemented in the form of one design pattern as a part of Model-View-Controller architecture.Reasons for new version: Responding to the users? feedback the Growth09 project has been upgraded to a standard that allows the carrying out of sample computations of the RHEED intensities for a disordered surface for a wide range of single- and epitaxial hetero-structures. The design pattern on which the project is based has also been improved. It is shown that this model can be effectively used for multithreaded growth simulations of thin epitaxial layers and corresponding RHEED intensities for a wide range of single- and hetero-structures. Responding to the users? feedback the present release has been implemented using a well-documented free compiler [1] not requiring the special configuration and installation additional libraries.Summary of revisions:1.
The logical structure of the Growth09 program has been modified according to the scheme showed in Fig. 1.1 The class diagram in Fig. 11 is a static view of the main platform-specific elements of the GrowthCP architecture. Fig. 21 provides a dynamic view by showing the creation and destruction simplistic sequence diagram for the process. 2.
The program requires the user to provide the appropriate parameters in the form of a knowledge base for the crystal structures under investigation. These parameters are loaded from the parameters.ini files at run-time. Instructions to prepare the .ini files can be found in the new distribution. 3.
The program enables carrying out different growth models and one-dimensional dynamical RHEED calculations for the fcc lattice with basis of three-atoms, fcc lattice with basis of two-atoms, fcc lattice with single atom basis, Zinc-Blende, Sodium Chloride, and Wurtzite crystalline structures and hetero-structures, but yet the Fourier component of the scattering potential in the TRHEEDCalculations.crystPotUgXXX() procedure can be modified and implemented according to users? specific application requirements. The Fourier component of the scattering potential of the whole crystalline hetero-structures can be determined as a sum of contributions coming from all thin slices of individual atomic layers. To carry out one-dimensional calculations of the scattering potentials, the program uses properly constructed self-consistent procedures. 4.
Each component of the system shown in Figs. 11 and 21 is fully extendable and can easily be adapted to new changeable requirements. Two essential logical elements of the system, i.e. TGrowthTransaction and TRHEEDCalculations classes, were designed and implemented in this way for them to pass the information to themselves without the need to use the data-exchange files given. In consequence each of them can be independently modified and/or extended. Implementing other types of differential equations and the different algorithm for solving them in the TGrowthTransaction class does not require another implementation of the TRHEEDCalculations class. Similarly, implementing other forms of scattering potential and different algorithm for RHEED calculation stays without the influence on the TGrowthTransaction class construction.
[1]
http://sourceforge.net/projects/lazarus/files/.
13.
Title of program: GF VALUES Catalogue number: ACRZ Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland (see application form in this issue) Computer: IBM S360/75; Installation: University of Waterloo, Waterloo, Ontario, Canada Operating system: Hasp II Programming language used: FORTRAN IV High speed core required: 134 K bytes Number of bits in a byte: 8 Overlay structure: None Number of magnetic tapes required: None Other peripherals required: Card reader, printer; disk (optional) Number of cards in the combined program and test deck: 903 Card punching code: EBCDIC 029CPC Library subprograms used (to supply data)
| Cat. numbers | Titles | Refs. in C.P.C. |
| ACRF | MCHF 72 | 4 (1972) 107, 7 (1974) 236 |
| AAKP | REDUCED TENSOR MATRIX ELEMENTS 2 | 9 (1975) 370 |
| Cat. numbers | Titles | Refs. in C.P.C. |
| ACQB | P SHELL CFP | 1 (1969) 15 |
| ACRN | A NEW D SHELL CFP | 6 (1973) 88 |
| AAGD | NJSYM | 1 (1970) 241, 2 (1971) 173 |
| AAGD0001 | ADAPT NJSYM FOR WEIGHTS | 2 (1971) 180 |
| AAGD0002 | ADAPT TO INTEGER ARITHMETIC | 5 (1973) 161 |
| Motion4D (included in the package) |
| Gnu Scientific Library (GSL) (http://www.gnu.org/software/gsl/) |
| Qt (http://qt.nokia.com/downloads) |
| OpenGL (http://www.opengl.org/) |
•
By choosing the new geodesic type “lightlike_sachs”, the parallel transport of the Sachs basis and the integration of the Jacobi equation can be visualized. •
The 2D representation via Qwt was replaced by an OpenGL 2D implementation to speed up the visualization. •
Viewing parameters can now be stored in a configuration file (.cfg). •
Several new objects can be used in 3D and 2D representation. •
Several predefined local tetrads can be choosen. •
There are some minor modifications: new mouse control (rotate on sphere); line smoothing; current last point in coordinates is shown; mutual-coordinate representation extended; current cursor position in 2D; colors for 2D view.
16.
Alexis Diaz-Torres 《Computer Physics Communications》2011,182(4):1100-1104
A self-contained Fortran-90 program based on a three-dimensional classical dynamical reaction model with stochastic breakup is presented, which is a useful tool for quantifying complete and incomplete fusion, and breakup in reactions induced by weakly-bound two-body projectiles near the Coulomb barrier. The code calculates (i) integrated complete and incomplete fusion cross sections and their angular momentum distribution, (ii) the excitation energy distribution of the primary incomplete-fusion products, (iii) the asymptotic angular distribution of the incomplete-fusion products and the surviving breakup fragments, and (iv) breakup observables, such as angle, kinetic energy and relative energy distributions.
Program summary
Program title: PLATYPUSCatalogue identifier: AEIG_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEIG_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 332 342No. of bytes in distributed program, including test data, etc.: 344 124Distribution format: tar.gzProgramming language: Fortran-90Computer: Any Unix/Linux workstation or PC with a Fortran-90 compilerOperating system: Linux or UnixRAM: 10 MBClassification: 16.9, 17.7, 17.8, 17.11Nature of problem: The program calculates a wide range of observables in reactions induced by weakly-bound two-body nuclei near the Coulomb barrier. These include integrated complete and incomplete fusion cross sections and their spin distribution, as well as breakup observables (e.g. the angle, kinetic energy, and relative energy distributions of the fragments).Solution method: All the observables are calculated using a three-dimensional classical dynamical model combined with the Monte Carlo sampling of probability-density distributions. See Refs. [1,2] for further details.Restrictions: The program is suited for a weakly-bound two-body projectile colliding with a stable target. The initial orientation of the segment joining the two breakup fragments is considered to be isotropic.Additional comments: Several source routines from Numerical Recipies, and the Mersenne Twister random number generator package are included to enable independent compilation.Running time: About 75 minutes for input provided, using a PC with 1.5 GHz processor.References:[1]
A. Diaz-Torres, et al., Phys. Rev. Lett. 98 (2007) 152701. [2]
A. Diaz-Torres, J. Phys. G: Nucl. Part. Phys. 37 (2010) 075109.
17.
Min Gao 《Computer Physics Communications》2009,180(7):1196-1205
We present a computer algebra program for verifying soliton solutions of ultradiscrete equations in which both dependent and independent variables take discrete values. The package is applicable to equations and solutions that include the max function. The program is implemented using Maple software.
Program summary
Program title: UltdeCatalogue identifier: AEDB_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDB_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 3171No. of bytes in distributed program, including test data, etc.: 13 633Distribution format: tar.gzProgramming language: Maple 10Computer: PC/AT compatible machineOperating system: Windows 2000, Windows XPRAM: Depends on the problem; minimum about 1 GBWord size: 32 bitsClassification: 5Nature of problem: The existence of multi-soliton solutions strongly suggest the integrability of nonlinear evolution equations. However enormous calculation is required to verify multi-soliton solutions of ultradiscrete equations. The use of computer algebra can be helpful in such calculations.Solution method: Simplification by using the properties of max-plus algebra.Restrictions: The program can only handle single ultradiscrete equations.Running time: Depends on the complexity of the equation and solution. For the examples included in the distribution the run times are as follows. (Core 2 Duo 3 GHz, Windows XP)- •
- Example 1: 2725 sec.
- •
- Example 2: 33 sec.
- •
- Example 3: 1 sec.
18.
Deterministic method based on ray tracing technique is known as a powerful alternative to the Monte Carlo approach for virtual X-ray imaging. The algorithm speed is a critical issue in the perspective of simulating hundreds of images, notably to simulate tomographic acquisition or even more, to simulate X-ray radiographic video recordings. We present an algorithm for voxel-based deterministic simulation of X-ray imaging using voxel-driven forward and backward perspective projection operations and minimum bounding rectangles (MBRs). The algorithm is fast, easy to implement, and creates high-quality simulated radiographs. As a result, simulated radiographs can typically be obtained in split seconds with a simple personal computer.
Program summary
Program title: X-rayCatalogue identifier: AEAD_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAD_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 416 257No. of bytes in distributed program, including test data, etc.: 6 018 263Distribution format: tar.gzProgramming language: C (Visual C++)Computer: Any PC. Tested on DELL Precision 380 based on a Pentium D 3.20 GHz processor with 3.50 GB of RAMOperating system: Windows XPClassification: 14, 21.1Nature of problem: Radiographic simulation of voxelized objects based on ray tracing technique.Solution method: The core of the simulation is a fast routine for the calculation of ray-box intersections and minimum bounding rectangles, together with voxel-driven forward and backward perspective projection operations.Restrictions: Memory constraints. There are three programs in all.- •
- A. Program for test 3.1(1): Object and detector have axis-aligned orientation;
- •
- B. Program for test 3.1(2): Object in arbitrary orientation;
- •
- C. Program for test 3.2: Simulation of X-ray video recordings.
- 1.
- Program A Memory required to execute with typical data: 207 Megabytes, depending on the size of the input file. Typical running time: 2.30 s. (Tested in release mode, the same below.)
- 2.
- Program B (the main program) Memory required to execute with typical data: 114 Megabytes, depending on the size of the input file. Typical running time: 1.60 s.
- 3.
- Program C Memory required to execute with typical data: 215 Megabytes, depending on the size of the input file. Typical computation time: 27.26 s for cast-5, 101.87 s for cast-6.
19.
Title of program: MEDUSA 1 Catalogue number: ABUG Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland (see application form in this issue) Computer: ICL 4–70; Installation: UKAEA Culham Laboratory Operating system: ICL Multijob Programming languages used: STANDARD FORTRAN High speed store required: 45000 words. No. of bits in a word: 32 Overlay structure: None No. of magnetic tapes required: None Other peripherals used: Line printer No. of cards in combined program and test deck: 6316 Card punching code: EBCDIC
| CPC Library subprograms used: | ||
| Catalogue number: | Title: | Ref. in CPC: |
| ABUF | OLYMPUS | 7 (1974) 245 |
| 设为首页 | 免责声明 | 关于勤云 | 加入收藏 |
|
Copyright©北京勤云科技发展有限公司 京ICP备09084417号 |