Design of Grid Structures on the Basis of Transition Systems with the Substantiation of the Correctness of Their Operation

A method for designing a grid system on the basis of transition systems and their synchronous products is considered. The obtained global transition system is translated into a Petri net (PN). With the help of the PN, design decisions are checked for correctness, in particular, for the absence of deadlocks, dead transitions, etc.     

Lexicographic Equivalence in Mixed Combinatorial Optimization of Linear-Fractional Functions on Arrangements

The paper substantiates the method of constructing the lexicographic equivalence to solve mixed combinatorial optimization problems on arrangements with linear-fractional objective function and linear additional constraints. The method involves directed search of equivalence classes obtained by splitting polyhedral set using equivalence relation. The authors propose exact methods as well as an approximate one. The approximate method allows getting the objective function value that differs from the optimum by no more than a predetermined value.     

Ontological and Algebra-Algorithmic Tools for Automated Design of Parallel Programs for Cloud Platforms

An approach to the automated development of programs is proposed on the basis of ontological facilities and algebra-algorithmic tools for program design and synthesis. The approach is illustrated by examples of developing a parallel weather forecasting program and also a software application destined to run the developed program on a cloud computing platform.     

Concept of a multitask grid system with a flexible allocation of idle computational resources of supercomputers

A new concept of a multitask distributed heterogeneous computing system is proposed. The basic principles of such system are that it uses only idle supercomputer resources and does it as a common user; thus, it does not conflict with the administration policy in any way. The efficiency of the proposed concept is demonstrated by the example of the real grid system that currently uses supercomputer resources to boost the performance of the SAT@home and OPTIMA@home volunteer distributed computing projects.     

Using Conical Regularization in Calculating Lagrangian Estimates in Quadratic Optimization Problems

For nonconvex quadratic optimization problems, the authors consider calculation of global extreme value estimates on the basis of Lagrangian relaxation of the original problems. On the boundary of the feasible region of the estimate problem, functions of the problem are discontinuous, ill-conditioned, which imposes certain requirements on the computational algorithms. The paper presents a new approach taking into account these features, based on the use of conical regularizations of convex optimization problems. It makes it possible to construct an equivalent unconditional optimization problem whose objective function is defined on the entire space of problem variables and satisfies the Lipschitz condition.     

A discrete-time approach to impulse-based adaptive input shaping for motion control without residual vibration

Modifying a command or actuation signal by convolving it with a sequence of impulses is a useful technique for eliminating structural vibration in rest-to-rest motion of mechanical systems. This paper describes an adaptive discrete-time version of this approach where amplitude and timing of impulses are tuned during operation to match the system under control. Solutions giving zero residual vibration are formulated in terms of a quadratic cost function and constructed by iterative operations on measured sets of input–output data. The versatility of the approach is demonstrated by simulated test cases involving (1) amplitude optimization of impulses with fixed timings, (2) timing optimization of impulses with fixed amplitudes and (3) combined timing and amplitude optimization. The approach is model-free and directly applicable to multi-mode systems. Moreover, fast adaptation within a single rest-to-rest maneuver can be achieved.     

Algorithms to estimate the reachability sets of the pulse controlled systems with ellipsoidal phase constraints

Methods to construct the ellipsoidal estimates of the reachability sets of a nonlinear dynamic system with scalar pulse control and uncertainty in the initial data were proposed. The considered pulse system was rearranged in the ordinary differential inclusion already without any pulse components by means of a special discontinuous time substitution. The results of the theory of ellipsoidal estimation and the theory of evolutionary equations of the multivalued states of dynamic systems under uncertainty and ellipsoidal phase constraints were used to estimate the reachability sets of the resulting nonlinear differential inclusion.     

HiggsBounds 2.0.0: Confronting neutral and charged Higgs sector predictions with exclusion bounds from LEP and the Tevatron

HiggsBounds 2.0.0 is a computer code which tests both neutral and charged Higgs sectors of arbitrary models against the current exclusion bounds from the Higgs searches at LEP and the Tevatron. As input, it requires a selection of model predictions, such as Higgs masses, branching ratios, effective couplings and total decay widths. HiggsBounds 2.0.0 then uses the expected and observed topological cross section limits from the Higgs searches to determine whether a given parameter scenario of a model is excluded at the 95% C.L. by those searches. Version 2.0.0 represents a significant extension of the code since its first release (1.0.0). It includes now 28/53 LEP/Tevatron Higgs search analyses, compared to the 11/22 in the first release, of which many of the ones from the Tevatron are replaced by updates. As a major extension, the code allows now the predictions for (singly) charged Higgs bosons to be confronted with LEP and Tevatron searches. Furthermore, the newly included analyses contain LEP searches for neutral Higgs bosons (H) decaying invisibly or into (non-flavour tagged) hadrons as well as decay-mode independent searches for neutral Higgs bosons, LEP searches via the production modes τ⁺τ⁻H and , and Tevatron searches via . Also, all Tevatron results presented at the ICHEP?10 are included in version 2.0.0. As physics applications of HiggsBounds 2.0.0 we study the allowed Higgs mass range for model scenarios with invisible Higgs decays and we obtain exclusion results for the scalar sector of the Randall–Sundrum model using up-to-date LEP and Tevatron direct search results.

Program summary

Program title: HiggsBoundsCatalogue identifier: AEFF_v2_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFF_v2_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: GNU General Public Licence version 3No. of lines in distributed program, including test data, etc.: 74 005No. of bytes in distributed program, including test data, etc.: 1 730 996Distribution format: tar.gzProgramming language: Fortran 77, Fortran 90 (two code versions are offered).Classification: 11.1.Catalogue identifier of previous version: AEFF_v1_0Journal reference of previous version: Comput. Phys. Comm. 181 (2010) 138External routines: HiggsBounds requires no external routines/libraries. Some sample programs in the distribution require the programs FeynHiggs 2.7.1 or CPsuperH2.2 to be installed.Does the new version supersede the previous version?: YesNature of problem: Determine whether a parameter point of a given model is excluded or allowed by LEP and Tevatron neutral and charged Higgs boson search results.Solution method: The most sensitive channel from LEP and Tevatron searches is determined and subsequently applied to test this parameter point. The test requires as input, model predictions for the Higgs boson masses, branching ratios and ratios of production cross sections with respect to reference values.Reasons for new version: This version extends the functionality of the previous version.Summary of revisions: List of included Higgs searches has been expanded, e.g. inclusion of (singly) charged Higgs boson searches. The input required from the user has been extended accordingly.Restrictions: Assumes that the narrow width approximation is applicable in the model under consideration and that the model does not predict a significant change to the signature of the background processes or the kinematical distributions of the signal cross sections.Running time: About 0.01 seconds (or less) for one parameter point using one processor of an Intel Core 2 Quad Q6600 CPU at 2.40 GHz for sample model scenarios with three Higgs bosons. It depends on the complexity of the Higgs sector (e.g. the number of Higgs bosons and the number of open decay channels) and on the code version.     

Using ICESat's Geoscience Laser Altimeter System (GLAS) to assess large-scale forest disturbance caused by hurricane Katrina

In 2005, hurricane Katrina resulted in a large disturbance to U.S. forests. Recent estimates of damage from hurricane Katrina have relied primarily on optical remote sensing and field data. This paper is the first large-scale study to use satellite-based lidar data to quantify changes in forest structure from that event. GLAS data for the years prior to and following hurricane Katrina were compared to wind speed, forest cover, and damage data to assess the adequacy of sensor sampling, and to estimate changes in Mean Canopy Height (MCH) over all areas that experienced tropical force winds and greater. Statistically significant decreases in MCH post-Katrina were found to increase with wind intensity: Tropical Storm ?MCH = − 0.5 m, Category 1 ?MCH = − 2 m, and Category 2 ?MCH = − 4 m. A strong relationship was also found between changes in non-photosynthetic vegetation (?NPV), a metric previously shown to be related to storm damage, and post-storm MCH. The season of data acquisition was shown to influence calculations of MCH and MCH loss, but did not preclude the detection of major large-scale patterns of damage. Results from this study show promise for using space-borne lidar for large-scale assessments of forest disturbance, and highlight the need for future data on vegetation structure from space.