Fuzzy (weak) implicative hyper K-ideals are introduced, and relations among fuzzy weak implicative hyper K-ideals, fuzzy implicative hyper K-ideals and fuzzy hyper K-ideals are discussed.

Based on Maxwellian quaternionic electromagnetic theory, the octonionic hyper-strong field, hyper-weak field and the quantum interplays can be presented by analogy with octonionic electromagnetic, gravitational, strong and weak interactions. In the hyper-weak field, the study deduces some conclusions of field source particles and intermediate particles which are consistent with Dirac equation, ...

This study applies the hyperstructure theory to BF-algebra, which is an algebraic structure. In fact, we define hyper-BF-algebras and hyper-BF ideals investigate several of their related characteristics. BF-algebra ideal characteristics are taken into account, supported examples built. Here, also develop new concepts known as hyper-B-algebra, hyper-BG-algebra, hyper-BH algebra generalizations o...

We introduce the notion of hyper-self-duality for Bose-Mesner algebras as a strengthening of formal self-duality. LetM denote a Bose-Mesner algebra on a finite nonempty set X . Fix p ∈ X , and letM∗ and T denote respectively the dual Bose-Mesner algebra and the Terwilliger algebra ofMwith respect to p. By a hyper-duality ofM, we mean an automorphism ψ of T such that ψ(M) =M∗, ψ(M∗) =M; ψ2(A) = ...

Nonresonant hyper-Raman and hyper-Rayleigh spectra excited at 1064 nm are reported for neat benzene and pyridine. The theory of Herzberg-Teller vibronic coupling in nonresonant and preresonant hyper-Raman scattering is developed. Nonresonant hyper-Raman scattering is shown to be vibronically induced by modes that efficiently couple strongly allowed onephoton and two-photon transitions. A weak a...

A graph G is said to be hyper-connected if the removal of every minimum cut creates exactly two connected components, one of which is an isolated vertex. In this paper, we first generalize the concept of hyper-connected graphs to that of semi-hyper-connected graphs: a graph G is called semi-hyper-connected if the removal of every minimum cut of G creates exactly two components. Then we characte...

Hyper-heuristics are methodologies used to search the space of heuristics for solving computationally di cult problems. We describe an object-oriented domain analysis for hyper-heuristics that orthogonally decomposes the domain into generative policy components. The framework facilitates the recursive instantiation of hyper-heuristics over hyper-heuristics, allowing further exploration of the p...

We compare deterministic finite automata (DFAs) and biautomata under the following two aspects: structural similarities between minimal and hyper-minimal automata, and computational complexity of the minimization and hyper-minimization problem. Concerning classical minimality, the known results such as isomorphism between minimal DFAs, and NL-completeness of the DFA minimization problem carry o...

This paper investigates a tabu assisted genetic algorithm based hyper-heuristic (hyper-TGA) for personnel scheduling problems. We recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics in order to find good quality solutions to given problems. The addition of a tabu method, the focus of this ...