Most current hyper-CASE systems place emphasis on how hypermedia functionality can be used in implementing CASE systems, with the hypermedia as a means of supporting the management of software life cycle documents in a non-integrated CASE environment. In this paper, we argue that hypermedia should be integrated with CASE in a seamless manner and must be able to support integrated CASE systems. ...

A selection hyper-heuristic is a high level search methodology which operates over a fixed set of low level heuristics. During the iterative search process, a heuristic is selected and applied to a candidate solution in hand, producing a new solution which is then accepted or rejected at each step. Selection hyper-heuristics have been increasingly, and successfully, applied to single-objective ...

structure of the Be 9  . Therefore, the theoretical study of this simple and complex structure is very interesting and challenging .Also we can give a prediction to the existence and realism of many interesting features such as super symmetric states (Dalitz and Gal, 1976) (hyper nuclear states of new symmetry), the drastic change of the electromagnetic transition states. It is well known that...

Hyper-systolic algorithms repesent a new class of parallel computing structures. Because of their regular communication and compute patterns they are well suited for implementation on most parallel architectures, in particular, high performance SIMD machines can beneet considerably. After a short explanation of the concept of hyper-systolic algorithms, their application to N-body computations a...

We report the experimental realization and the characterization of polarization and momentum hyper-entangled two photon states, generated by a new parametric source of correlated photon pairs. By adoption of these states a successful " all versus nothing " test of quantum mechanics was performed. The two photon hyper-entangled states are expected to find at an increasing rate a widespread appli...

In R/qtl version 1.04, the functions summary.scantwo and plot.scantwo have been changed quite substantially. Also, the permutations with scantwo have been changed to match the new format for summary.scantwo. In this document, I describe the revisions and how to use the new functions. We'll look at the hyper data as an example. First we need to load the package and the data. > library(qtl) > dat...

Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best known algorithms for computing the hyperbolicity number of a graph (the smaller, the more tree-like) have running time O(n), where n is the number of graph ...

Bent functions have maximal minimum distance to the set of affine functions. In other words, they achieve the maximal minimum distance to all the coordinate functions of affine monomials. In this paper we introduce a new class of bent functions which we call hyper-bent functions. Functions within this class achieve the maximal minimum distance to all the coordinate functions of all bijective mo...

.............................................................................................. I Acknowledgements ............................................................................ II ركشو ءادهآ .............................................................................................. IV List of Figures .................................................................................