A Jump Inversion Theorem for the Degree Spectra

In the present article, we continue the study of the propertiesof the spectra of structures as sets of degrees initiated in[11]. Here, we consider the relationships between the spectraand the jump spectra. Our first result is that every jump spectrumis also a spectrum. The main result sounds like a Jump inversiontheorem. Namely, we show that if a spectrum is contained inthe set of the jumps of the degrees in some spectrum then thereexists a spectrum such that and is equal to the set of thejumps of the degrees in .     

A comprehensive quality model for service-oriented systems

In a service-oriented system, a quality (or Quality of Service) model is used (i) by service requesters to specify the expected quality levels of service delivery; (ii) by service providers to advertise quality levels that their services achieve; and (iii) by service composers when selecting among alternative services those that are to participate in a service composition. Expressive quality models are needed to let requesters specify quality expectations, providers advertise service qualities, and composers finely compare alternative services. Having observed many similarities between various quality models proposed in the literature, we review these and integrate them into a single quality model, called QVDP. We highlight the need for integration of priority and dependency information within any quality model for services and propose precise submodels for doing so. Our intention is for the proposed model to serve as a reference point for further developments in quality models for service-oriented systems. To this aim, we extend the part of the UML metamodel specialized for Quality of Service with QVDP concepts unavailable in UML.

Optimal allocation–consumption problem for a portfolio with an illiquid asset

During financial crises investors manage portfolios with low liquidity, where the paper-value of an asset differs from the price proposed by the buyer. We consider an optimization problem for a portfolio with an illiquid, a risky and a risk-free asset. We work in the Merton's optimal consumption framework with continuous time. The liquid part of the investment is described by a standard Black–Scholes market. The illiquid asset is sold at a random moment with prescribed distribution and generates additional liquid wealth dependent on its paper-value. The investor has a hyperbolic absolute risk aversion also denoted as HARA-type utility function, in particular, the logarithmic utility function as a limit case. We study two different distributions of the liquidation time of the illiquid asset – a classical exponential distribution and a more practically relevant Weibull distribution. Under certain conditions we show the smoothness of the viscosity solution and obtain closed formulae relevant for numerics.     

Generating heavy particles with energy and momentum conservation

We propose a novel algorithm, called REGGAE, for the generation of momenta of a given sample of particle masses, evenly distributed in Lorentz-invariant phase space and obeying energy and momentum conservation. In comparison to other existing algorithms, REGGAE is designed for the use in multiparticle production in hadronic and nuclear collisions where many hadrons are produced and a large part of the available energy is stored in the form of their masses. The algorithm uses a loop simulating multiple collisions which lead to production of configurations with reasonably large weights.

Program summary

Program title: REGGAE (REscattering-after-Genbod GenerAtor of Events)Catalogue identifier: AEJR_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJR_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.: 1523No. of bytes in distributed program, including test data, etc.: 9608Distribution format: tar.gzProgramming language: C++Computer: PC Pentium 4, though no particular tuning for this machine was performed.Operating system: Originally designed on Linux PC with g++, but it has been compiled and ran successfully on OS X with g++ and MS Windows with Microsoft Visual C++ 2008 Express Edition, as well.RAM: This depends on the number of particles which are generated. For 10 particles like in the attached example it requires about 120 kB.Classification: 11.2Nature of problem: The task is to generate momenta of a sample of particles with given masses which obey energy and momentum conservation. Generated samples should be evenly distributed in the available Lorentz-invariant phase space.Solution method: In general, the algorithm works in two steps. First, all momenta are generated with the GENBOD algorithm. There, particle production is modeled as a sequence of two-body decays of heavy resonances. After all momenta are generated this way, they are reshuffled. Each particle undergoes a collision with some other partner such that in the pair center of mass system the new directions of momenta are distributed isotropically. After each particle collides only a few times, the momenta are distributed evenly across the whole available phase space. Starting with GENBOD is not essential for the procedure but it improves the performance.Running time: This depends on the number of particles and number of events one wants to generate. On a LINUX PC with 2 GHz processor, generation of 1000 events with 10 particles each takes about 3 s.     

HFOLD - A program package for calculating two-body MSSM Higgs decays at full one-loop level

HFOLD (Higgs Full One Loop Decays) is a Fortran program package for calculating all MSSM Higgs two-body decay widths and the corresponding branching ratios at full one-loop level. The package is done in the SUSY Parameter Analysis convention and supports the SUSY Les Houches Accord input and output format.

Program summary

Program title: HFOLDCatalogue identifier: AEJG_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJG_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.: 340 621No. of bytes in distributed program, including test data, etc.: 1 760 051Distribution format: tar.gzProgramming language: Fortran 77Computer: Workstation, PCOperating system: LinuxRAM: 524 288 000 BytesClassification: 11.1External routines: LoopTools 2.2 (http://www.feynarts.de/looptools/), SLHALib 2.2 (http://www.feynarts.de/slha/). The LoopTools code is included in the distribution package.Nature of problem: A future high-energy e⁺e⁻ linear collider will be the best environment for the precise measurements of masses, cross sections, branching ratios, etc. Experimental accuracies are expected at the per-cent down to the per-mile level. These must be matched from the theoretical side. Therefore higher order calculations are mandatory.Solution method: This program package calculates all MSSM Higgs two-body decay widths and the corresponding branching ratios at full one-loop level. The renormalization is done in the DR scheme following the SUSY Parameter Analysis convention. The program supports the SUSY Les Houches Accord input and output format.Running time: The example provided takes only a few seconds to run.     

On constant-round concurrent non-malleable proof systems

Security under man-in-the-middle attacks is extremely important when protocols are executed on asynchronous networks, as the Internet. Focusing on interactive proof systems, one would like also to achieve unconditional soundness, so that proving a false statement is not possible even for a computationally unbounded adversarial prover. Motivated by such requirements, in this paper we address the problem of designing constant-round protocols in the plain model that enjoy simultaneously non-malleability (i.e., security against man-in-the-middle attacks) and unconditional soundness (i.e., they are proof systems).We first give a construction of a constant-round one-many (i.e., one honest prover, many honest verifiers) concurrent non-malleable zero-knowledge proof (in contrast to argument) system for every NP language in the plain model. We then give a construction of a constant-round concurrent non-malleable witness-indistinguishable proof system for every NP language. Compared with previous results, our constructions are the first constant-round proof systems that in the plain model guarantee simultaneously security against some non-trivial concurrent man-in-the-middle attacks and against unbounded malicious provers.     

Dynamic demultiplexing in network calculus—Theory and application

During the last two decades, starting with the seminal work by Cruz, network calculus has evolved as a new theory for the performance analysis of networked systems. In contrast to classical queueing theory, it deals with performance bounds instead of average values and thus has been the theoretical basis of quality of service proposals such as the IETF’s Integrated and Differentiated Services architectures. Besides these it has, however, recently seen many other application scenarios as, for example, wireless sensor networks, switched Ethernets, avionic networks, Systems-on-Chip, or even to speed-up simulations, to name a few.In this article, we extend network calculus by adding a new versatile modeling element: a demultiplexer. Conventionally, demultiplexing has been either neglected or assumed to be static, i.e., fixed at the setup time of a network. This is restrictive for many potential applications of network calculus. For example, a load balancing based on current link loads in a network could not be modeled with conventional network calculus means. Our demultiplexing element is based on stochastic scaling. Stochastic scaling allows one to put probabilistic bounds on how a flow is split inside the network. Fundamental results on network calculus with stochastic scaling are therefore derived in this work. We illustrate the benefits of the demultiplexer in a sample application of uncertain load balancing.     

Experiments on the reliability of stochastic spiking neural P systems

In the area of membrane computing, time-freeness has been defined as the ability for a timed membrane system to produce always the same result, independently of the execution times associated to the rules. In this paper, we use a similar idea in the framework of spiking neural P systems, a model inspired by the structure and the functioning of neural cells. In particular, we introduce stochastic spiking neural P systems where the time of firing for an enabled spiking rule is probabilistically chosen and we investigate when, and how, these probabilities can influence the ability of the systems to simulate, in a reliable way, universal machines, such as register machines.