In this paper the effect of ion-exchange simplified as water handling on basic zeolitewas studied.It was foond that the interaction between chemisorbed water and Na+-O2- couplewould increase the total number of basic ...In this paper the effect of ion-exchange simplified as water handling on basic zeolitewas studied.It was foond that the interaction between chemisorbed water and Na+-O2- couplewould increase the total number of basic sites, while weaken the intensity of each basic sites.Theprocess can be explained by the adsorb model of organic acid on NaX presented before.展开更多
The aim is to study the set of subsets of grids of the Waterloo language from the point of view of abstract algebra and graph theory. The study was conducted using the library for working with transition graphs of non...The aim is to study the set of subsets of grids of the Waterloo language from the point of view of abstract algebra and graph theory. The study was conducted using the library for working with transition graphs of nondeterministic finite automata NFALib implemented by one of the authors in C#, as well as statistical methods for analyzing algorithms. The results are regularities obtained when considering semilattices on a set of subsets of grids of the Waterloo language. It follows from the results obtained that the minimum covering automaton equivalent to the Waterloo automaton can be obtained by adding one additional to the minimum covering set of grids. .展开更多
文摘In this paper the effect of ion-exchange simplified as water handling on basic zeolitewas studied.It was foond that the interaction between chemisorbed water and Na+-O2- couplewould increase the total number of basic sites, while weaken the intensity of each basic sites.Theprocess can be explained by the adsorb model of organic acid on NaX presented before.
文摘The aim is to study the set of subsets of grids of the Waterloo language from the point of view of abstract algebra and graph theory. The study was conducted using the library for working with transition graphs of nondeterministic finite automata NFALib implemented by one of the authors in C#, as well as statistical methods for analyzing algorithms. The results are regularities obtained when considering semilattices on a set of subsets of grids of the Waterloo language. It follows from the results obtained that the minimum covering automaton equivalent to the Waterloo automaton can be obtained by adding one additional to the minimum covering set of grids. .