Enterprise modeling and Data Warehousing in Telecom Italia

We present a methodology for Data Warehouse design and its application within the Telecom Italia information system. The methodology is based on a conceptual representation of the Enterprise, which is exploited both in the integration phase of the Warehouse information sources and during the knowledge discovery activity on the information stored in the Warehouse. The application of the methodology in the Telecom Italia framework has been supported by prototype software tools both for conceptual modeling and for data integration and reconciliation.     

Revised and extended Utilities for the Ratip package

During the last years, the Ratip package has been found useful for calculating the excitation and decay properties of free atoms. Based on the (relativistic) multiconfiguration Dirac-Fock method, this program is used to obtain accurate predictions of atomic properties and to analyze many recent experiments. The daily work with this package made an extension of its Utilities [S. Fritzsche, Comput. Phys. Comm. 141 (2001) 163] desirable in order to facilitate the data handling and interpretation of complex spectra. For this purpose, we make available an enlarged version of the Utilities which mainly supports the comparison with experiment as well as large Auger computations. Altogether 13 additional tasks have been appended to the program together with a new menu structure to improve the interactive control of the program.

Program summary

Title of program: RATIPCatalogue identifier: ADPD_v2_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADPD_v2_0Program obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandLicensing provisions: noneReference in CPC to previous version: S. Fritzsche, Comput. Phys. Comm. 141 (2001) 163Catalogue identifier of previous version: ADPDAuthors of previous version: S. Fritzsche, Department of Physics, University of Kassel, Heinrich-Plett-Strasse 40, D-34132 Kassel, GermanyDoes the new version supersede the original program?: yesComputer for which the new version is designed and others on which it has been tested: IBM RS 6000, PC Pentium II-IVInstallations: University of Kassel (Germany), University of Oulu (Finland)Operating systems: IBM AIX, Linux, UnixProgram language used in the new version: ANSI standard Fortran 90/95Memory required to execute with typical data: 300 kBNo. of bits in a word: All real variables are parameterized by a selected kind parameter and, thus, can be adapted to any required precision if supported by the compiler. Currently, the kind parameter is set to double precision (two 32-bit words) as used also for other components of the Ratip package [S. Fritzsche, C.F. Fischer, C.Z. Dong, Comput. Phys. Comm. 124 (2000) 341; G. Gaigalas, S. Fritzsche, Comput. Phys. Comm. 134 (2001) 86; S. Fritzsche, Comput. Phys. Comm. 141 (2001) 163; S. Fritzsche, J. Elec. Spec. Rel. Phen. 114-116 (2001) 1155]No. of lines in distributed program, including test data, etc.:231 813No. of bytes in distributed program, including test data, etc.: 3 977 387Distribution format: tar.gzip fileNature of the physical problem: In order to describe atomic excitation and decay properties also quantitatively, large-scale computations are often needed. In the framework of the Ratip package, the Utilities support a variety of (small) tasks. For example, these tasks facilitate the file and data handling in large-scale applications or in the interpretation of complex spectra.Method of solution: The revised Utilities now support a total of 29 subtasks which are mainly concerned with the manipulation of output data as obtained from other components of the Ratip package. Each of these tasks are realized by one or several subprocedures which have access to the corresponding modules of the main components. While the main menu defines seven groups of subtasks for data manipulations and computations, a particular task is selected from one of these group menus. This allows to enlarge the program later if technical support for further tasks will become necessary. For each selected task, an interactive dialog about the required input and output data as well as a few additional information are printed during the execution of the program.Reasons for the new version: The requirement for enlarging the previous version of the Utilities [S. Fritzsche, Comput. Phys. Comm. 141 (2001) 163] arose from the recent application of the Ratip package for large-scale radiative and Auger computations. A number of new subtasks now refer to the handling of Auger amplitudes and their proper combination in order to facilitate the interpretation of complex spectra. A few further tasks, such as the direct access to the one-electron matrix elements for some given set of orbital functions, have been found useful also in the analysis of data.Summary of revisions: extraction and handling of atomic data within the framework of Ratip. With the revised version, we now ‘add’ another 13 tasks which refer to the manipulation of data files, the generation and interpretation of Auger spectra, the computation of various one- and two-electron matrix elements as well as the evaluation of momentum densities and grid parameters. Owing to the rather large number of subtasks, the main menu has been divided into seven groups from which the individual tasks can be selected very similarly as before.Typical running time: The program responds promptly for most of the tasks. The responding time for some tasks, such as the generation of a relativistic momentum density, strongly depends on the size of the corresponding data files and the number of grid points.Unusual features of the program: A total of 29 different tasks are supported by the program. Starting from the main menu, the user is guided interactively through the program by a dialog and a few additional explanations. For each task, a short summary about its function is displayed before the program prompts for all the required input data.     

TiReX: Replica-exchange molecular dynamics using Tinker

We present a driver program for performing replica-exchange molecular dynamics simulations with the Tinker package. Parallelization is based on the Message Passing Interface, with every replica assigned to a separate process. The algorithm is not communication intensive, which makes the program suitable for running even on loosely coupled cluster systems. Particular attention is paid to the practical aspects of analyzing the program output.

Program summary

Program title: TiReXCatalogue identifier: AEEK_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEEK_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.: 43 385No. of bytes in distributed program, including test data, etc.: 502 262Distribution format: tar.gzProgramming language: Fortran 90/95Computer: Most UNIX machinesOperating system: LinuxHas the code been vectorized or parallelized?: parallelized with MPIClassification: 16.13External routines: TINKER version 4.2 or 5.0, built as a libraryNature of problem: Replica-exchange molecular dynamics.Solution method: Each replica is assigned to a separate process; temperatures are swapped between replicas at regular time intervals.Running time: The sample run may take up to a few minutes.     

Concise: Compressed ‘n’ Composable Integer Set

Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. However, bitmaps usually use a large storage space, thus requiring compression. Consequently, there is a space-time tradeoff among compression schemes. The Word Aligned Hybrid (WAH) bitmap compression trades some space to allow for bitwise operations without first decompressing bitmaps. WAH has been recognized as the most efficient scheme in terms of computation time. In this paper we present Concise (Compressed ‘n’ Composable Integer Set), a new scheme that enjoys significantly better performances than WAH. In particular, when compared to WAH our algorithm is able to reduce the required memory up to 50%, while having comparable computation time. Further, we show that Concise can be efficiently used to represent sets of integral numbers in lieu of well-known data structures such as arrays, lists, hashtables, and self-balancing binary search trees. Extensive experiments over synthetic data show the effectiveness of our proposal.     

-XSummer- Transcendental functions and symbolic summation in Form

Harmonic sums and their generalizations are extremely useful in the evaluation of higher-order perturbative corrections in quantum field theory. Of particular interest have been the so-called nested sums, where the harmonic sums and their generalizations appear as building blocks, originating for example, from the expansion of generalized hypergeometric functions around integer values of the parameters. In this paper we discuss the implementation of several algorithms to solve these sums by algebraic means, using the computer algebra system Form.

Program summary

Title of program:XSummerCatalogue identifier:ADXQ_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXQ_v1_0Program obtainable from:CPC Program Library, Queen's University of Belfast, N. IrelandLicense:GNU Public License and Form LicenseComputers:allOperating system:allProgram language:FormMemory required to execute:Depending on the complexity of the problem, recommended at least 64 MB RAMNo. of lines in distributed program, including test data, etc.:9854No. of bytes in distributed program, including test data, etc.:126 551Distribution format:tar.gzOther programs called:noneExternal files needed:noneNature of the physical problem:Systematic expansion of higher transcendental functions in a small parameter. The expansions arise in the calculation of loop integrals in perturbative quantum field theory.Method of solution:Algebraic manipulations of nested sums.Restrictions on complexity of the problem:Usually limited only by the available disk space.Typical running time:Dependent on the complexity of the problem.     

Geant4 hadron elastic diffuse model

Differential elastic hadron-nucleus cross-sections are discussed in the framework of the optical approach. The model predictions implemented in the Geant4 toolkit are compared with the experimental data for protons and pions. The contribution of Coulomb scattering is discussed for charged hadrons.     

One universal extra dimension in Pythia

The Universal Extra Dimensions model has been implemented in the Pythia generator from version 6.4.18 onwards, in its minimal formulation with one TeV⁻¹-sized extra dimension. The additional possibility of gravity-mediated decays, through a variable number of eV⁻¹-sized extra dimensions into which only gravity extends, is also available. The implementation covers the lowest lying Kaluza-Klein (KK) excitations of Standard Model particles, except for the excitations of the Higgs fields, with the mass spectrum calculated at one loop. 2→2 tree-level production cross sections and unpolarized KK number conserving 2-body decays are included. Mixing between iso-doublet and -singlet KK excitations is neglected thus far, and is expected to be negligible for all but the top sector.

New version summary

Program title: PYTHIA Version number: 6.420Catalogue identifier: ACTU_v2_1Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ACTU_v2_1.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.: 79 362No. of bytes in distributed program, including test data, etc.: 590 900Distribution format: tar.gzProgramming language: Fortran 77Computer: CERN lxplus and any other machine with a Fortran 77 compilerOperating system: Linux Red HatRAM: about 800 K wordsWord size: 32 bitsClassification: 11.2Catalogue identifier of previous version: ACTU_v2_0Journal reference of previous version: Comput. Phys. Comm. 135 (2001) 238Does the new version supersede the previous version?: YesNature of problem: At high energy collisions between elementary particles, physics beyond the Standard Model is searched for. Many models are being investigated, namely extra-dimensional models.Solution method: The Universal Extra Dimension model is implemented in the PYTHIA event generator.Reasons for new version: The Universal Extra Dimensions model has been implemented in the PYTHIA generator from version 6.4.18 onwards, in its minimal formulation with one TeV⁻¹-sized extra dimension. The additional possibility of gravity-mediated decays, through a variable number of eV⁻¹-sized extra dimensions into which only gravity extends, is also available. The implementation covers the lowest lying Kaluza-Klein (KK) excitations of Standard Model particles, except for the excitations of the Higgs fields, with the mass spectrum calculated at one loop. 2→2 tree-level production cross sections and unpolarized KK number conserving 2-body decays are included. Mixing between iso-doublet and -singlet KK excitations is neglected thus far, and is expected to be negligible for all but the top sector.Running time: 10-1000 events per second, depending on the process studied.     

Bandwidth on AT-free graphs

We study the classical Bandwidth problem from the viewpoint of parametrised algorithms. Given a graph G=(V,E) and a positive integer k, the Bandwidth problem asks whether there exists a bijective function β:{1,…,∣V∣}→V such that for every edge uv∈E, ∣β⁻¹(u)−β⁻¹(v)∣≤k. It is known that under standard complexity assumptions, no algorithm for Bandwidth with running time of the form f(k)n^O(1) exists, even when the input is restricted to trees. We initiate the search for classes of graphs where such algorithms do exist. We present an algorithm with running time n⋅2^O(klogk) for Bandwidth on AT-free graphs, a well-studied graph class that contains interval, permutation, and cocomparability graphs. Our result is the first non-trivial algorithm that shows fixed-parameter tractability of Bandwidth on a graph class on which the problem remains NP-complete.     

Citius altius fortius: Lessons learned from the Theorem Prover Waldmeister

In the last years, the development of automated theorem provers has been advancing in a so to speak Olympic spirit, following the motto “faster, higher, stronger”; and the Waldmeister system has been a part of that endeavour. We will survey the concepts underlying this prover, which implements Knuth-Bendix completion in its unfailing variant. The system architecture is based on a strict separation of active and passive facts, and is realized via specifically tailored representations for each of the central data structures: indexing for the active facts, set-based compression for the passive facts, successor sets for the conjectures. In order to cope with large search spaces, specialized redundancy criteria are employed, and the empirically gained control knowledge is integrated to ease the use of the system. We conclude with a discussion of strengths and weaknesses, and a view of future prospects.     

Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints

We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the Range and Roots constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.     

Supervised ranking in the weka environment

Software for solving the supervised ranking problem is presented. Four variants of the Ordinal Stochastic Dominance Learner (OSDL) are given, together with the space and time complexity of their implementations. It is shown that the described software, which includes two further algorithms for supervised ranking, fits seamlessly into the weka environment.     

An integrated tool for loop calculations: aITALC

aITALC, a new tool for automating loop calculations in high energy physics, is described. The package creates Fortran code for two-fermion scattering processes automatically, starting from the generation and analysis of the Feynman graphs. We describe the modules of the tool, the intercommunication between them and illustrate its use with three examples.

Program summary

Title of the program:aITALC version 1.2.1 (9 August 2005)Catalogue identifier:ADWOProgram summary URL:http://cpc.cs.qub.ac.uk/summaries/ADWOProgram obtainable from:CPC Program Library, Queen's University of Belfast, N. IrelandComputer:PC i386Operating system:GNU/Linux, tested on different distributions SuSE 8.2 to 9.3, Red Hat 7.2, Debian 3.0, Ubuntu 5.04. Also on SolarisProgramming language used:GNU Make, Diana, Form, Fortran77Additional programs/libraries used:Diana 2.35 (Qgraf 2.0), Form 3.1, LoopTools 2.1 (FF)Memory required to execute with typical data:Up to about 10 MBNo. of processors used:1No. of lines in distributed program, including test data, etc.:40 926No. of bytes in distributed program, including test data, etc.:371 424Distribution format:tar gzip fileHigh-speed storage required:from 1.5 to 30 MB, depending on modules present and unfolding of examplesNature of the physical problem:Calculation of differential cross sections for e⁺e⁻ annihilation in one-loop approximation.Method of solution:Generation and perturbative analysis of Feynman diagrams with later evaluation of matrix elements and form factors.Restriction of the complexity of the problem:The limit of application is, for the moment, the 2→2 particle reactions in the electro-weak standard model.Typical running time:Few minutes, being highly depending on the complexity of the process and the Fortran compiler.     

Proofs of randomized algorithms in Coq

Randomized algorithms are widely used for finding efficiently approximated solutions to complex problems, for instance primality testing and for obtaining good average behavior. Proving properties of such algorithms requires subtle reasoning both on algorithmic and probabilistic aspects of programs. Thus, providing tools for the mechanization of reasoning is an important issue. This paper presents a new method for proving properties of randomized algorithms in a proof assistant based on higher-order logic. It is based on the monadic interpretation of randomized programs as probabilistic distributions (Giry, Ramsey and Pfeffer). It does not require the definition of an operational semantics for the language nor the development of a complex formalization of measure theory. Instead it uses functional and algebraic properties of unit interval. Using this model, we show the validity of general rules for estimating the probability for a randomized algorithm to satisfy specified properties. This approach addresses only discrete distributions and gives rules for analyzing general recursive functions.We apply this theory to the formal proof of a program implementing a Bernoulli distribution from a coin flip and to the (partial) termination of several programs. All the theories and results presented in this paper have been fully formalized and proved in the Coq proof assistant.     

Relativistic central-field Green's functions for the Ratip package

From perturbation theory, Green's functions are known for providing a simple and convenient access to the (complete) spectrum of atoms and ions. Having these functions available, they may help carry out perturbation expansions to any order beyond the first one. For most realistic potentials, however, the Green's functions need to be calculated numerically since an analytic form is known only for free electrons or for their motion in a pure Coulomb field. Therefore, in order to facilitate the use of Green's functions also for atoms and ions other than the hydrogen-like ions, here we provide an extension to the Ratip program which supports the computation of relativistic (one-electron) Green's functions in an—arbitrarily given—central-field potential V(r). Different computational modes have been implemented to define these effective potentials and to generate the radial Green's functions for all bound-state energies E<0. In addition, care has been taken to provide a user-friendly component of the Ratip package by utilizing features of the Fortran 90/95 standard such as data structures, allocatable arrays, or a module-oriented design.

Program summary

Title of program:XgreensCatalogue number: ADWMProgram summary URL:http://cpc.cs.qub.ac.uk/summaries/ADWMProgram obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandLicensing provisions:NoneComputer for which the new version has been tested: PC Pentium II, III, IV, AthlonInstallations: University of Kassel (Germany)Operating systems: SuSE Linux 8.2, SuSE Linux 9.0Program language used in the new version: ANSI standard Fortran 90/95Memory required to execute with typical data: On a standard grid (400 nodes), one central-field Green's function requires about 50 kBytes in RAM while approximately 3 MBytes are needed if saved as two-dimensional array on some external disc spaceNo. of bits in a word: Real variables of double- and quad-precision are usedPeripheral used: Disk for input/outputCPU time required to execute test data: 2 min on a 450 MHz Pentium III processorNo. of lines in distributed program, including test data etc.: 82 042No. of bytes in distributed program, including test data etc.: 814 096Distribution format: tar.gzNature of the physical problem: In atomic perturbation theory, Green's functions may help carry out the summation over the complete spectrum of atom and ions, including the (summation over the) bound states as well as an integration over the continuum [R.A. Swainson, G.W.F. Drake, J. Phys. A 24 (1991) 95]. Analytically, however, these functions are known only for free electrons (V(r)≡0) and for electrons in a pure Coulomb field (V(r)=−Z/r). For all other choices of the potential, in contrast, the Green's functions must be determined numerically.Method of solution: Relativistic Green's functions are generated for an arbitrary central-field potential V(r)=−Z(r)/r by using a piecewise linear approximation of the effective nuclear charge function Z(r) on some grid : Zi(r)=Z0i+Z1ir. Then, following McGuire's algorithm [E.J. McGuire, Phys. Rev. A 23 (1981) 186], the radial Green's functions are constructed from the (two) linear-independent solutions of the homogeneous equation [P. Morse, H. Feshbach, Methods of Theoretical Physics, McGraw-Hill, New York 1953 (Part 1, p. 825)]. In the computation of these radial functions, the Kummer and Tricomi functions [J. Spanier, B. Keith, An Atlas of Functions, Springer, New York, 1987] are used extensively.Restrictions onto the complexity of the problem: The main restrictions of the program concern the shape of the effective nuclear charge Z(r)=−rV(r), i.e. the choice of the potential, and the allowed energies. Apart from obeying the proper boundary conditions for a point-like nucleus, namely, Z(r→0)=Znuc>0 and Z(r→∞)=Znuc−Nelectrons?0, the first derivative of the charge function Z(r) must be smaller than the (absolute value of the) energy of the Green's function, .Unusual features of the program:Xgreens has been designed as a part of the Ratip package [S. Fritzsche, J. Elec. Spec. Rel. Phen. 114-116 (2001) 1155] for the calculation of relativistic atomic transition and ionization properties. In a short dialog at the beginning of the execution, the user can specify the choice of the potential as well as the energies and the symmetries of the radial Green's functions to be calculated. Apart from central-field Green's functions, of course, the Coulomb Green's function [P. Koval, S. Fritzsche, Comput. Phys. Comm. 152 (2003) 191] can also be computed by selecting a constant nuclear charge Z(r)=Zeff. In order to test the generated Green's functions, moreover, we compare the two lowest bound-state orbitals which are calculated from the Green's functions with those as generated separately for the given potential. Like the other components of the Ratip package, Xgreens makes careful use of the Fortran 90/95 standard.