Zobrazeno 1 - 10
of 1 223
pro vyhledávání: '"Anitha, K."'
In this paper, the concepts of set-valued anti-homomorphism and strong set-valued anti-homomorphism of $\Gamma$-semigroup are introduced. The notions of generalized lower and upper approximation operators, constructed by means of set-valued mapping,
Externí odkaz:
http://arxiv.org/abs/2212.10041
Autor:
Nithya, R., Anitha, K.
Rough graph is the graphical structure of information system with imprecise knowledge. Tong He designed the properties of rough graph in 2006[6] and following that He and Shi introduced the notion of edge rough graph[7]. He et al developed the concep
Externí odkaz:
http://arxiv.org/abs/2208.12047
Autor:
Devi, R. Aruna, Anitha, K.
Rough membership function defines the measurement of relationship between conditional and decision attribute from an Information system. In this paper we propose a new method to construct rough graph through rough membership function $\omega_{G}^F(f)
Externí odkaz:
http://arxiv.org/abs/2205.10127
Publikováno v:
Journal of Pharmacy and Bioallied Sciences, Vol 16, Iss 6, Pp 1487-1489 (2024)
The purest and unrestricted source of stem cells is the enamel of the teeth. Dental stem cells (DSCs), which are simple to get, quick to use, and reasonably priced, have the potential to be used in a variety of promising therapeutic applications. Due
Externí odkaz:
https://doaj.org/article/d3c0ed2ee99c41c4ace8f5b49a82fb53
Autor:
Sherif, Z. Nawas, Anitha, K.
Publikováno v:
In Journal of Environmental Chemical Engineering October 2024 12(5)
Autor:
Premalatha, M., Anitha, K., Revathi, B., Balachandran, V., Narayana, B., Jayashree, A., Thirughanasambantham, N.
Publikováno v:
In Journal of Molecular Structure 15 November 2024 1316
Publikováno v:
In Expert Systems With Applications 1 November 2024 253
Autor:
Samuthra, G., Prabavathi, N., Senthilkumar, C., Karuppasamy, P., Senthil Pandian, Muthu, Ramasamy, P., Anitha, K.
Publikováno v:
In Optical Materials May 2024 151
In this paper, we prove the lower bound for the number of balancing non-Wieferich primes in arithmetic progressions. More precisely, for any given integer $r\geq2$ there are $\gg\log x$ balancing non-Wieferich primes $p\leq x$ such that $p\equiv\pm1
Externí odkaz:
http://arxiv.org/abs/2101.05274
We prove the lower bound for the number of Lucas non-Wieferich primes in arithmetic progressions. More precisely, for any given integer $k\geq 2$ there are $\gg \log x$ Lucas non-Wieferich primes $p\leq x$ such that $p\equiv\pm1\pmod{k}$, assuming th
Externí odkaz:
http://arxiv.org/abs/2101.04901