‎Let $G$ be a group with identity $e.$ Let $R$ be a $G$-graded‎ ‎commutative ring and $M$ a graded $R$-module‎. ‎In this paper‎, ‎we‎ ‎introduce several results concerning graded classical prime‎ ‎submodules‎. ‎For example‎, ‎we give a characterization of graded‎ ‎classical prime submodules‎. ‎Also‎, ‎the relations between graded‎ ‎classical prime and graded prime submodules of $M$ are studied‎.‎

The focus of the project was to generate a titanic prime number by using high performance computing resources. What makes prime numbers significant is their use in modern computers for the encryption of data. The generation of primes are particularly computing intensive the larger the prime. This makes titanic primes (thousand digit prime numbers) a perfect candidate for distribution through gr...

In this paper, we introduce the notions of intuitionistic fuzzy prime (resp. strongly prime and semiprime) bi-ideals of a semigroup. By using these ideas we characterize those semigroups for which each intuitionistic fuzzy bi-ideal is semiprime and strongly prime. Key words: Intuitionistic fuzzy set; intuitionistic fuzzy bi-ideal; intuitionistic fuzzy prime (resp. strongly prime and semiprime) ...

In this paper, DQ-modeling approach for Transient State analysis in the time domain of the threephase self-excited induction generator (SEIG) with squirrel cage rotor is presented along with its operating performance evaluations. The three-phase SEIG is driven by a variable-speed prime mover (VSPM) such as a wind turbine for the clean alternative renewable energy in rural areas. Here the prime ...

Implicit set manipulation techniques based on binary decision diagrams (BDD) have made possible the verification of finite state machines with state graphs too large to be built. More recently, it has been shown that these techniques could be used with success to compute the sets of prime and essential prime implicants of Boolean functions for which these sets are much too large to be explicitl...

Last-Level Cache (LLC) attacks typically exploit timing side channels in hardware, and thus rely heavily on timers for their operation. Many proposed defenses against such side-channel attacks capitalize on this reliance. This paper presents PRIME+ABORT, a new cache attack which bypasses these defenses by not depending on timers for its function. Instead of a timing side channel, PRIME+ABORT le...

Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for determining whether or not a given regular language L is an intercode. If the answer is yes, our algorithm yields also the smallest index k such that L is a k-intercode. Furthermore, we examine the prime intercode decom...

The events that prime pluripotent cells for differentiation are not well understood. Inhibitor of DNA binding/differentiation (Id) proteins, which are inhibitors of basic helix-loop-helix (bHLH) transcription factor activity, contribute to pluripotency by blocking sequential transitions toward differentiation. Using yeast-two-hybrid screens, we have identified Id-regulated transcription factors...

The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...