Results 311 to 320 of about 600,182 (368)
Some of the next articles are maybe not open access.
2010 IEEE International Conference on Granular Computing, 2010
We introduced rough sets into lattices. The concepts of upper and lower approximations of a subset in a lattice are given. We discussed the properties of θ??(A)and θ_(A) when A is a sublattice, an ideal, a prime ideal and a convex sublattice of L.
Zuhua Liao, Lian Wu, Miaohan Hu
openaire +1 more source
We introduced rough sets into lattices. The concepts of upper and lower approximations of a subset in a lattice are given. We discussed the properties of θ??(A)and θ_(A) when A is a sublattice, an ideal, a prime ideal and a convex sublattice of L.
Zuhua Liao, Lian Wu, Miaohan Hu
openaire +1 more source
Optimization of surface roughness and dimensional accuracy in LPBF additive manufacturing
, 2021Longchao Cao +5 more
semanticscholar +1 more source
The International Journal of Advanced Manufacturing Technology, 2021
Weicheng Guo +3 more
semanticscholar +1 more source
Weicheng Guo +3 more
semanticscholar +1 more source
Neural Computing and Applications, 2011
Theory of rough sets is an important tool in data mining. In this paper, we are initiating the study of roughness in hemirings with respect to the Pawlak approximation space and also with respect to the generalized approximation space. Lower and upper rough subhemirings and ideals are studied.
Muhammad Irfan Ali +2 more
openaire +1 more source
Theory of rough sets is an important tool in data mining. In this paper, we are initiating the study of roughness in hemirings with respect to the Pawlak approximation space and also with respect to the generalized approximation space. Lower and upper rough subhemirings and ideals are studied.
Muhammad Irfan Ali +2 more
openaire +1 more source
Information Sciences, 2004
Let \(I\) be an ideal of a ring \(R\). Let \(P(R)\) denote the power set of \(R\). Define \(\underline{Apr}_I\colon P(R)\to P(R)\) and \(\overline{Apr}_I\colon P(R)\to P(R)\) as follows: \(\forall X\in P(R)\), \(\underline{Apr}_I(X)=\{x\in R\mid x+I\subseteq X\}\) and \(\overline{Apr}_I(X)=\{x\in R\mid(x+I)\cap X\neq\emptyset\}\). Then \(\underline{Apr}
openaire +2 more sources
Let \(I\) be an ideal of a ring \(R\). Let \(P(R)\) denote the power set of \(R\). Define \(\underline{Apr}_I\colon P(R)\to P(R)\) and \(\overline{Apr}_I\colon P(R)\to P(R)\) as follows: \(\forall X\in P(R)\), \(\underline{Apr}_I(X)=\{x\in R\mid x+I\subseteq X\}\) and \(\overline{Apr}_I(X)=\{x\in R\mid(x+I)\cap X\neq\emptyset\}\). Then \(\underline{Apr}
openaire +2 more sources
Influence of surface roughness on contact angle hysteresis and spreading work
Colloid and Polymer Science, 2020Junchao Wang +4 more
semanticscholar +1 more source
Journal of Thermal Analysis and Calorimetry, 2020
Abderrahim Wakif +4 more
semanticscholar +1 more source
Abderrahim Wakif +4 more
semanticscholar +1 more source
Scientific American, 2018
The article offers information on formation of rare diamonds. It mentions that when a meteorite containing graphite slams into the earth, the collision's heat and pressure can transform this form of carbon into a rare and extremely hard type of diamond. It presents the views of Yogendra Gupta, from Washington State University, on formation of hexagonal
openaire +2 more sources
The article offers information on formation of rare diamonds. It mentions that when a meteorite containing graphite slams into the earth, the collision's heat and pressure can transform this form of carbon into a rare and extremely hard type of diamond. It presents the views of Yogendra Gupta, from Washington State University, on formation of hexagonal
openaire +2 more sources
ACM SIGGRAPH 2005 Electronic Art and Animation Catalog, 2005
Paul Taylor, Jennifer Miller
openaire +1 more source
Paul Taylor, Jennifer Miller
openaire +1 more source
Fundamenta Informaticae, 1985
In the paper we define the notions of the best lower and the best upper approximations of grammar, which are based on the concept of rough set introduced by Pawlak in [4]. Furthermore we give the properties of languages generated by the best lower and the best upper approximations of grammar.
openaire +2 more sources
In the paper we define the notions of the best lower and the best upper approximations of grammar, which are based on the concept of rough set introduced by Pawlak in [4]. Furthermore we give the properties of languages generated by the best lower and the best upper approximations of grammar.
openaire +2 more sources