This paper presents some methods of representing canonical commutation relations in terms of hyper nite-dimensional matrices, which are constructed by nonstandard analysis. The rst method uses representations of a nonstandard extension of nite Heisenberg group, called hyper nite Heisenberg group. The second is based on hyper nite-dimensional representations of so(3). Then, the cases of in nite ...

In this paper we introduce a Monte Carlo based hyper-heuristic. The Monte Carlo hyper-heuristic manages a set of low level heuristics (in this case just simple 2-opt swaps but they could be any other heuristics). Each of the low level heuristics is responsible for creating a unique neighbour that may be impossible to create by the other low level heuristics. On each iteration, the Monte Carlo h...

Let G be a simple connected graph. The first and second Zagreb indices have been introduced as  vV(G) (v)2 M1(G) degG and M2(G)  uvE(G)degG(u)degG(v) , respectively, where degG v(degG u) is the degree of vertex v (u) . In this paper, we define a new distance-based named HyperZagreb as e uv E(G) . (v))2 HM(G)     (degG(u)  degG In this paper, the HyperZagreb index of the Cartesian p...

We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...

Hyper-heuristics can be identified as methodologies that search the space generated by a finite set of low level heuristics for solving search problems. An iterative hyper-heuristic framework can be thought of as requiring a single candidate solution and multiple perturbation low level heuristics. An initially generated complete solution goes through two successive processes (heuristic selectio...

In [1], the author empirically compared EDF (Earliest Deadline First) and RM (Rate Monotonic) scheduling algorithms and made a few EDF preemption behavior observations based on data obtained from the first 1,000 time units of scheduling activities. However, based on test settings given in [1], the first 1,000 time units occupies only a small percentage of the entire task set’s hyper-period. We ...

in this paper we characterize hyper mv -algebras in which 0 or1 are scalar elements . we prove that any nite hyper mv -algebra that 0is a scaler element in it, is an mv -algebra. finally we characterize hypermv -algebras of order 2 and order 3.