Achieving efficient adsorption and separation of C_(2)H_(2)/CO_(2)mixtures is a goal that people have always pursued to improve the situation of high energy consumption brought by traditional separation technologies i...Achieving efficient adsorption and separation of C_(2)H_(2)/CO_(2)mixtures is a goal that people have always pursued to improve the situation of high energy consumption brought by traditional separation technologies in industry today.High-nuclearity metal cluster-based MOFs with different functionalities are promising for this separation,but it is a complicated and difficult task to precisely control their structures.The strategy of pore-space partition(PSP)is a powerful way to construct this type MOFs,which has the characteristic of isostructural relationship,and can be resulted in a similar performance for them.Therefore,it is an interesting work to explore the effect of MOFs property by adjusting the size of PSP dividers.Herein,three tetranuclear Cu(Ⅱ)cluster-based MOFs(FJU-112/113/114)with dual functionalities has been successfully obtained by PSP strategy with various lengths of divider units.With the highest microporosity and unique functional site,FJU-114 realized a good improvement in the adsorption and separation performance of C_(2)H_(2)/CO_(2).The gas adsorption and lab-scale C_(2)H_(2)/CO_(2)breakthrough experiments demonstrated that FJU-114 exhibits the highest adsorption uptake of 77 cm^(3)/g for C_(2)H_(2),and shows the best separation factor of 4.2 among three MOFs.The GCMC simulation reveals that a stronger adsorption binding site of C_(2)H_(2)in FJU-114a located in the cage II near the unchanged tetranuclear copper node,combined with its high microporosity to achieve the effect of dual functionalities for the improvement performance of C_(2)H_(2)adsorption and separation.展开更多
The space partitioning algorithm based on the rounding and addressing operations has been proved to be an efficient space partitioning algorithm with the potential for real-time calculation.An improvement on this kind...The space partitioning algorithm based on the rounding and addressing operations has been proved to be an efficient space partitioning algorithm with the potential for real-time calculation.An improvement on this kind of space partitioning algorithms for solving complex 3D models is presented.Numerical examples show that the efficiency of the improved algorithm is better than that of the original method.When the size of most target elements is smaller than the size of spatial grids,the efficiency of the improved method can be more than four times of that of the original method.An adaptive method of space partitioning based on the improved algorithm is developed by taking the surface element density or the curvature as the threshold for deep partitioning and conducting the deep partitioning using the octree method.A computer program implementation for applying the method in some typical applications is discussed,and the performance in terms of the efficiency,reliability,and resource use is evaluated.Application testing shows that the results of the adaptive spacing partitioning are more convenient for the follow-up use than that of the basic uniform space partitioning.Furthermore,when it is used to calculate the electromagnetic scattering of complex targets by the ray tracing(RT)method,the adaptive space partitioning algorithm can reduce the calculation time of the RT process by more than 40%compared with the uniform space segmentation algorithm.展开更多
This paper proposes a multi-UAV cooperative exploration approach based on task-density space partition.In the research of multi-UAV cooperative exploration,it is a prevalent cooperative scheme to control robots to wor...This paper proposes a multi-UAV cooperative exploration approach based on task-density space partition.In the research of multi-UAV cooperative exploration,it is a prevalent cooperative scheme to control robots to work independently in partitioned spaces.Nonetheless,only considering the position of robots during space partition cannot effectively ensure the overall cooperative efficiency.According to research on task density of current time points and positions of robots during exploration,robots with fewer task points are assigned to work in spaces with more tasks in the rolling horizon optimization planning mode,which can reduce the redundancy of multi-robot cooperative work.Comparative research suggests that the overall exploration efficiency is improved.展开更多
The state space explosion problem is still the key obstacle for applying model checking to systems of industrial size. Abstraction-based methods have been particularly successful in this regard. This paper presents an...The state space explosion problem is still the key obstacle for applying model checking to systems of industrial size. Abstraction-based methods have been particularly successful in this regard. This paper presents an approach based on refinement of search space partition and abstraction which combines these two techniques for reducing the complexity of model checking. The refinement depends on the representation of each portion of search space. Especially, search space can be refined stepwise to get a better reduction. As reported in the case study, the integration of search space partition and abstraction improves the efficiency of verification with respect to the requirement of memory and obtains significant advantage over the use of each of them in isolation.展开更多
Acetylene (C_(2)H_(2)) and ethylene (C_(2)H_(4)) both are important chemical raw materials and energy fuel gasses.But the effective removement of trace C_(2)H_(2)from C_(2)H_(4)and the purification of C_(2)H_(2)from c...Acetylene (C_(2)H_(2)) and ethylene (C_(2)H_(4)) both are important chemical raw materials and energy fuel gasses.But the effective removement of trace C_(2)H_(2)from C_(2)H_(4)and the purification of C_(2)H_(2)from carbon dioxide(CO_(2)) are particularly challenging in the petrochemical industry.As a class of porous physical adsorbent,metal-organic frameworks (MOFs) have exhibited great success in separation and purification of light hydrocarbon gas.Herein,we rationally designed four novel MOFs by the strategy of pore space partition(PSP) via introducing triangular tri(pyridin-4-yl)-amine (TPA) into the 1D hexagonal channels of acs-type parent skeleton.By modulating the functional groups of linear dicarboxylate linkers for the parent skeleton,a series of isoreticular PSP-MOFs (SNNU-278-281) were successfully obtained.The synergistic effects of suitable pore size and Lewis basic functional groups make these MOFs ideal C_(2)H_(2)adsorbents.The gas adsorption experimental results show that all MOFs have excellent C_(2)H_(2)uptakes.Specially,SNNU-278demonstrates a high C_(2)H_(2)uptake of 149.7 cm3/g at 273 K and 1 atm.Meanwhile,SNNU-278-281 MOFs also show extremely great C_(2)H_(2)separation from CO_(2)and C_(2)H_(4).The optimized SNNU-281 with highdensity hydroxy groups exhibits extraordinary C_(2)H_(2)/CO_(2)and C_(2)H_(2)/C_(2)H_(4)dynamic breakthrough interval times up to 31 min/g and 17 min/g under 298 K and 1 bar.展开更多
To obtain materials capable of efficiently separating acetylene(C_(2)H_(2))from carbon dioxide(CO_(2))and eth-ylene(C_(2)H_(4)),In this work,based on the pore space partition strategy,a pacs-metal-organic framework(MO...To obtain materials capable of efficiently separating acetylene(C_(2)H_(2))from carbon dioxide(CO_(2))and eth-ylene(C_(2)H_(4)),In this work,based on the pore space partition strategy,a pacs-metal-organic framework(MOF):(NH_(2)Me_(2))_(2)[Fe_(3)(μ_(3)-O)(bdc)_(3)][In(FA)_(3)Cl_(3)](Fe‑FAIn‑bdc)was synthesized successfully by using the metal-formate com-plex[In(FA)_(3)Cl_(3)]^(3-)as the pore partition units,where bdc^(2-)=terephthalate,FA-=formate.Owing to the pore partition effect of this metal-organic building block,fruitful confined spaces are formed in the network of Fe‑FAIn‑bdc,endowing this MOF with superior separation performance of acetylene and carbon dioxide.According to the adsorp-tion test,this MOF exhibited a high adsorption capacity for C_(2)H_(2)(50.79 cm^(3)·g^(-1))at 298 K and 100 kPa,which was much higher than that for CO_(2)(29.99 cm^(3)·g^(-1))and C_(2)H_(4)(30.94 cm^(3)·g^(-1))under the same conditions.Ideal adsorbed solution theory(IAST)calculations demonstrate that the adsorption selectivity of Fe‑FAIn‑bdc for the mixture of C_(2)H_(2)/CO_(2)and C_(2)H_(2)/C_(2)H_(4)in a volume ratio of 50∶50 was 3.08 and 3.65,respectively,which was higher than some reported MOFs such as NUM-11 and SNNU-18.CCDC:_(2)453954.展开更多
To realize real-time monitoring and short-term forecasting and forewarning of coalmine ventilation systems(CVS), in this paper, we first established a joint surface and underground CVS safety management system consist...To realize real-time monitoring and short-term forecasting and forewarning of coalmine ventilation systems(CVS), in this paper, we first established a joint surface and underground CVS safety management system consisting of main ventilation fan, safety-partition linked passageways, and air-required locations. We then applied chaos theory to identify the air quantity and gas concentration of underground partition boundaries, and adopted a fixed data quantity, multi-step progressive, weighted first-order local-domain method to setup a chaos prediction model and a CVS safety forecasting and forewarning system formed by the normal change level, orange forewarning level, and red alarm level. We next conduct the on-field application of the system in a coalmine in Jining, Shandong, China. The results showed that (1) in the statistical scale of 5 min, the changes in both air quantity and gas concentration along CVS partition airflow boundaries were characteristic of chaos and could be used for short-term chaos prediction, and the latter was more chaotic than the former;(2) the setup chaos prediction model had a higher prediction precision and the established safety prediction system could not only predict the variation in CVS stability but also reflect the rationality of underground mining intensity. Thus, this CVS safety forecasting and forewarning system is of better application value.展开更多
In this article, I consider the right triangle as the simplex in the Euclidean plane, and extend this definition to higher dimensions. The n-dimensional simplex has one hypotenuse and (n−1)legs (catheti). The (n−1)leg...In this article, I consider the right triangle as the simplex in the Euclidean plane, and extend this definition to higher dimensions. The n-dimensional simplex has one hypotenuse and (n−1)legs (catheti). The (n−1)legs define an orthogonal path of edges in the solid with perpendicular adjacent edges along the path. The length of the hypotenuse and the volume of the solid can be calculated without the Cayley-Menger determinant, by direct extension of the corresponding right triangle formulas. I give a proof of the existence of these shapes, describe the distribution of right angles in them, give an algebraic proof of the Coxeter trisection of a right tetrahedron into three smaller right tetrahedra, and generalize this construction to n-dimensional spaces. Finally, I investigate the connection between the Coxeter partition and the Hadwiger conjecture on the partition of the simplex into orthoschemes, which I call Pythagorean simplexes.展开更多
A fast algorithm for ray tracing is presented, with which the specular reflection term of global illumination model is improved. A hybrid technique combining hierarchical bounding volumes and constant size box partiti...A fast algorithm for ray tracing is presented, with which the specular reflection term of global illumination model is improved. A hybrid technique combining hierarchical bounding volumes and constant size box partitioning is presented and a fast box traversal algorithm is used. By this technique multiple ray intersections with objects that are in more than one box can be avoided. As a result, the speed of ray tracing is considerably increased.展开更多
This paper presents a multi-ANN approximation approach to approximate complex non-linear function. Comparing with single-ANN methods the proposed approach improves and increases the approximation and generalization ab...This paper presents a multi-ANN approximation approach to approximate complex non-linear function. Comparing with single-ANN methods the proposed approach improves and increases the approximation and generalization ability, and adaptability greatly in learning processes of networks. The simulation results have been shown that the method can be applied to the modeling and identification of complex dynamic control systems.展开更多
With the development of computer graphics,the three-dimensional(3D)visualization brings new technological revolution to the traditional cartography.Therefore,the topographic 3D-map emerges to adapt to this technologic...With the development of computer graphics,the three-dimensional(3D)visualization brings new technological revolution to the traditional cartography.Therefore,the topographic 3D-map emerges to adapt to this technological revolution,and the applications of topographic 3D-map are spread rapidly to other relevant fields due to its incomparable advantage.The researches on digital map and the construction of map database offer strong technical support and abundant data source for this new technology,so the research and development of topographic 3D-map will receive greater concern.The basic data of the topographic 3D-map are rooted mainly in digital map and its basic model is derived from digital elevation model(DEM)and 3D-models of other DEM-based geographic features.In view of the potential enormous data and the complexity of geographic features,the dynamic representation of geographic information becomes the focus of the research of topographic 3D-map and also the prerequisite condition of 3D query and analysis.In addition to the equipment of hardware that are restraining,to a certain extent,the 3D representation,the data organization structure of geographic information will be the core problem of research on 3D-map.Level of detail(LOD),space partitioning,dynamic object loading(DOL)and object culling are core technologies of the dynamic 3D representation.The object-selection,attribute-query and model-editing are important functions and interaction tools for users with 3D-maps provided by topographic 3D-map system,all of which are based on the data structure of the 3D-model.This paper discusses the basic theories,concepts and cardinal principles of topographic 3D-map,expounds the basic way to organize the scene hierarchy of topographic 3D-map based on the node mechanism and studies the dynamic representation technologies of topographic 3D-map based on LOD,space partitioning,DOL and object culling.Moreover,such interactive operation functions are explored,in this paper,as spatial query,scene editing and management of topographic 3D-map.Finally,this paper describes briefly the applications of topographic 3D-map in its related fields.展开更多
Regularized Boolean operations have been widely used in 3D modeling systems. However, evaluating Boolean operations may be quite numerically unstable and time consuming, especially for iterated set operations. A novel...Regularized Boolean operations have been widely used in 3D modeling systems. However, evaluating Boolean operations may be quite numerically unstable and time consuming, especially for iterated set operations. A novel and unified technique is proposed in this paper for computing single and iterated set operations efficiently, robustly and exactly. An adaptive octree is combined with a nested constructive solid geometry （CSG） tree by this technique. The intersection handling is restricted to the cells in the octree where intersection actually occurs. Within those cells, a CSG tree template is instanced by the surfaces and the tree is converted to planebased binary space partitioning （BSP） for set evaluation; Moreover, the surface classification is restricted to the ceils in the octree where the surfaces only come from a model and are within the bounding-boxes of other polyhedrons. These two ways bring about the efficiency and scalability of the operations, in terms of runtime and memory. As all surfaces in such a cell have the same classification relation, they are classified as a whole. Robustness and exactness are achieved by integrating plane-based geometry representation with adaptive geometry predicate technique in intersection handling, and by applying divide-and-conquer arithmetic on surface classification. Experimental results demonstrate that the proposed approach can guarantee the robustness of Boolean computations and runs faster than other existing approaches.展开更多
Due to the issue of long-horizon,a substantial number of visits to the state space is required during the exploration phase of reinforcement learning(RL)to gather valuable information.Addi-tionally,due to the challeng...Due to the issue of long-horizon,a substantial number of visits to the state space is required during the exploration phase of reinforcement learning(RL)to gather valuable information.Addi-tionally,due to the challenge posed by sparse rewards,the planning phase of reinforcement learning consumes a considerable amount of time on repetitive and unproductive tasks before adequately ac-cessing sparse reward signals.To address these challenges,this work proposes a space partitioning and reverse merging(SPaRM)framework based on reward-free exploration(RFE).The framework consists of two parts:the space partitioning module and the reverse merging module.The former module partitions the entire state space into a specific number of subspaces to expedite the explora-tion phase.This work establishes its theoretical sample complexity lower bound.The latter module starts planning in reverse from near the target and gradually extends to the starting state,as opposed to the conventional practice of starting at the beginning.This facilitates the early involvement of sparse rewards at the target in the policy update process.This work designs two experimental envi-ronments:a complex maze and a set of randomly generated maps.Compared with two state-of-the-art(SOTA)algorithms,experimental results validate the effectiveness and superior performance of the proposed algorithm.展开更多
In the optimal maintenance modeling, all possible maintenance activities and their corresponding probabilities play a key role in modeling. For a system with multiple non-identical units, its maintenance requirements ...In the optimal maintenance modeling, all possible maintenance activities and their corresponding probabilities play a key role in modeling. For a system with multiple non-identical units, its maintenance requirements are very complicated, and it is time-consuming, even omission may occur when enumerating them with various combinations of units and even with different maintenance actions for them. Deterioration state space partition (DSSP) method is an efficient approach to analyze all possible maintenance requirements at each maintenance decision point and deduce their corresponding probabilities for maintenance modeling of multi-unit systems. In this paper, an extended DSSP method is developed for systems with multiple non-identical units considering opportunistic, preventive and corrective maintenance activities for each unit. In this method, different maintenance types are distinguished in each maintenance requirement. A new representation of the possible maintenance requirements and their corresponding probabilities is derived according to the partition results based on the joint probability density function of the maintained system deterioration state. Furthermore, focusing on a two-unit system with a non-periodical inspected condition-based opportunistic preventive-maintenance strategy;a long-term average cost model is established using the proposed method to determine its optimal maintenance parameters jointly, in which “hard failure” and non-negligible maintenance time are considered. Numerical experiments indicate that the extended DSSP method is valid for opportunistic maintenance modeling of multi-unit systems.展开更多
As a class of effective methods for incomplete multi-view clustering,graph-based algorithms have recently drawn wide attention.However,most of them could use further improvement regarding the following aspects.First,i...As a class of effective methods for incomplete multi-view clustering,graph-based algorithms have recently drawn wide attention.However,most of them could use further improvement regarding the following aspects.First,in some graph-based models,all views are forced to share a common similarity graph regardless of the severe consistency degeneration due to incomplete views.Next,similarity graph construction and cluster analysis are sometimes performed separately.Finally,the contribution difference of individual views is not always carefully considered.To address these issues simultaneously,this paper proposes an incomplete multi-view clustering algorithm based on auto-weighted fusion in partition space.In our algorithm,the information of cluster structure is introduced into the process of similarity learning to construct a desirable similarity graph,information fusion is performed in partition space to alleviate the negative impact brought about by consistency degradation,and all views are adaptively weighted to reflect their different contributions to clustering tasks.Finally,all the subtasks are collaboratively optimized in a united framework to reach an overall optimal result.Experimental results show that the proposed method compares favorably with the state-of-the-art methods.展开更多
We present a study to show the possibility of using two well-known space partitioning and indexing techniques, kd trees and quad trees, in declustering applications to increase input/output （I/O） paraUelization and ...We present a study to show the possibility of using two well-known space partitioning and indexing techniques, kd trees and quad trees, in declustering applications to increase input/output （I/O） paraUelization and reduce spatial data processing times. This parallelization enables time-consuming computational geometry algorithms to be applied efficiently to big spatial data rendering and querying. The key challenge is how to balance the spatial processing load across a large number of worker nodes, given significant performance heterogeneity in nodes and processing skews in the workload.展开更多
An orthoscheme or Pythagorean simplex is a solid in n-dimensional Euclidean space whose faces are right triangles.In 1956,Hadwiger asked whether an ndimensional general(not necessarily Pythagorean)simplex can always b...An orthoscheme or Pythagorean simplex is a solid in n-dimensional Euclidean space whose faces are right triangles.In 1956,Hadwiger asked whether an ndimensional general(not necessarily Pythagorean)simplex can always be decomposed into a finite number of Pythagorean simplexes.Tschirpke proved in 1994 that this division is always possible in 5D space.Coxeter proved that a 3D Pythagorean simplex can be split into three smaller ones.In a 2024 paper,I generalized Coxeter’s trisection to prove that the dissection of an n-dimensional Pythagorean simplex into n pieces of the same type is possible if each leg of the original solid is equal to the unit distance.In the present paper,I extend this proof to an n-dimensional Pythagorean simplex with legs of arbitrary measure.This means the proof of the Hadwiger conjecture in the special case of a Pythagorean simplex.展开更多
Many isolation approaches, such as zoning search, have been proposed to preserve the diversity in the decision space of multimodal multi-objective optimization(MMO). However, these approaches allocate the same computi...Many isolation approaches, such as zoning search, have been proposed to preserve the diversity in the decision space of multimodal multi-objective optimization(MMO). However, these approaches allocate the same computing resources for subspaces with different difficulties and evolution states. In order to solve this issue, this paper proposes a dynamic resource allocation strategy(DRAS)with reinforcement learning for multimodal multi-objective optimization problems(MMOPs). In DRAS, relative contribution and improvement are utilized to define the aptitude of subspaces, which can capture the potentials of subspaces accurately. Moreover, the reinforcement learning method is used to dynamically allocate computing resources for each subspace. In addition, the proposed DRAS is applied to zoning searches. Experimental results demonstrate that DRAS can effectively assist zoning search in finding more and better distributed equivalent Pareto optimal solutions in the decision space.展开更多
The availability of a good viewpoint space partition is crucial in three dimensional （3-D） object recognition on the approach of aspect graph. There are two important events, depicted by the aspect graph approach, e...The availability of a good viewpoint space partition is crucial in three dimensional （3-D） object recognition on the approach of aspect graph. There are two important events, depicted by the aspect graph approach, edge-：edge-edge （EEE） events and edge-vertex （EV） events. This paper presents an algorithm to compute EEE events by characteristic analysis based on conicoid theory, in contrast to current algorithms that focus too much on EV events and often overlook the importance of EEE events. Also, the paper provides a standard flowchart for the viewpoint space partitioning based on aspect graph theory that makes it suitable for perspective models. The partitioning result best demonstrates the algorithm＇s efficiency with more valuable viewpoints found with the help of EEE events, which can definitely help to achieve high recognition rate for 3-D object recognition.展开更多
基金financially supported by the National Natural Science Foundation of China(Nos.21975044,21971038,21922810 and 22271046)the Fujian Provincial Department of Science and Technology(Nos.2023J01355,2023J011106 and 2022R1022001).
文摘Achieving efficient adsorption and separation of C_(2)H_(2)/CO_(2)mixtures is a goal that people have always pursued to improve the situation of high energy consumption brought by traditional separation technologies in industry today.High-nuclearity metal cluster-based MOFs with different functionalities are promising for this separation,but it is a complicated and difficult task to precisely control their structures.The strategy of pore-space partition(PSP)is a powerful way to construct this type MOFs,which has the characteristic of isostructural relationship,and can be resulted in a similar performance for them.Therefore,it is an interesting work to explore the effect of MOFs property by adjusting the size of PSP dividers.Herein,three tetranuclear Cu(Ⅱ)cluster-based MOFs(FJU-112/113/114)with dual functionalities has been successfully obtained by PSP strategy with various lengths of divider units.With the highest microporosity and unique functional site,FJU-114 realized a good improvement in the adsorption and separation performance of C_(2)H_(2)/CO_(2).The gas adsorption and lab-scale C_(2)H_(2)/CO_(2)breakthrough experiments demonstrated that FJU-114 exhibits the highest adsorption uptake of 77 cm^(3)/g for C_(2)H_(2),and shows the best separation factor of 4.2 among three MOFs.The GCMC simulation reveals that a stronger adsorption binding site of C_(2)H_(2)in FJU-114a located in the cage II near the unchanged tetranuclear copper node,combined with its high microporosity to achieve the effect of dual functionalities for the improvement performance of C_(2)H_(2)adsorption and separation.
基金This work was supported by the National Natural Science Foundation of China(61601015,91538204).
文摘The space partitioning algorithm based on the rounding and addressing operations has been proved to be an efficient space partitioning algorithm with the potential for real-time calculation.An improvement on this kind of space partitioning algorithms for solving complex 3D models is presented.Numerical examples show that the efficiency of the improved algorithm is better than that of the original method.When the size of most target elements is smaller than the size of spatial grids,the efficiency of the improved method can be more than four times of that of the original method.An adaptive method of space partitioning based on the improved algorithm is developed by taking the surface element density or the curvature as the threshold for deep partitioning and conducting the deep partitioning using the octree method.A computer program implementation for applying the method in some typical applications is discussed,and the performance in terms of the efficiency,reliability,and resource use is evaluated.Application testing shows that the results of the adaptive spacing partitioning are more convenient for the follow-up use than that of the basic uniform space partitioning.Furthermore,when it is used to calculate the electromagnetic scattering of complex targets by the ray tracing(RT)method,the adaptive space partitioning algorithm can reduce the calculation time of the RT process by more than 40%compared with the uniform space segmentation algorithm.
文摘This paper proposes a multi-UAV cooperative exploration approach based on task-density space partition.In the research of multi-UAV cooperative exploration,it is a prevalent cooperative scheme to control robots to work independently in partitioned spaces.Nonetheless,only considering the position of robots during space partition cannot effectively ensure the overall cooperative efficiency.According to research on task density of current time points and positions of robots during exploration,robots with fewer task points are assigned to work in spaces with more tasks in the rolling horizon optimization planning mode,which can reduce the redundancy of multi-robot cooperative work.Comparative research suggests that the overall exploration efficiency is improved.
基金Supported by the National Natural Science Foundation of China (Grant Nos. 60573012 and 60421001) the National Grand FundamentalResearch 973 Program of China (Grant No. 2002cb312200)
文摘The state space explosion problem is still the key obstacle for applying model checking to systems of industrial size. Abstraction-based methods have been particularly successful in this regard. This paper presents an approach based on refinement of search space partition and abstraction which combines these two techniques for reducing the complexity of model checking. The refinement depends on the representation of each portion of search space. Especially, search space can be refined stepwise to get a better reduction. As reported in the case study, the integration of search space partition and abstraction improves the efficiency of verification with respect to the requirement of memory and obtains significant advantage over the use of each of them in isolation.
基金financially supported by the National Natural Science Foundation of China (No. 22071140)the Natural Science Foundation of Shaanxi Province (No. 2021JLM-20)the Fundamental Research Funds for the Central Universities (No. GK202101002)。
文摘Acetylene (C_(2)H_(2)) and ethylene (C_(2)H_(4)) both are important chemical raw materials and energy fuel gasses.But the effective removement of trace C_(2)H_(2)from C_(2)H_(4)and the purification of C_(2)H_(2)from carbon dioxide(CO_(2)) are particularly challenging in the petrochemical industry.As a class of porous physical adsorbent,metal-organic frameworks (MOFs) have exhibited great success in separation and purification of light hydrocarbon gas.Herein,we rationally designed four novel MOFs by the strategy of pore space partition(PSP) via introducing triangular tri(pyridin-4-yl)-amine (TPA) into the 1D hexagonal channels of acs-type parent skeleton.By modulating the functional groups of linear dicarboxylate linkers for the parent skeleton,a series of isoreticular PSP-MOFs (SNNU-278-281) were successfully obtained.The synergistic effects of suitable pore size and Lewis basic functional groups make these MOFs ideal C_(2)H_(2)adsorbents.The gas adsorption experimental results show that all MOFs have excellent C_(2)H_(2)uptakes.Specially,SNNU-278demonstrates a high C_(2)H_(2)uptake of 149.7 cm3/g at 273 K and 1 atm.Meanwhile,SNNU-278-281 MOFs also show extremely great C_(2)H_(2)separation from CO_(2)and C_(2)H_(4).The optimized SNNU-281 with highdensity hydroxy groups exhibits extraordinary C_(2)H_(2)/CO_(2)and C_(2)H_(2)/C_(2)H_(4)dynamic breakthrough interval times up to 31 min/g and 17 min/g under 298 K and 1 bar.
文摘To obtain materials capable of efficiently separating acetylene(C_(2)H_(2))from carbon dioxide(CO_(2))and eth-ylene(C_(2)H_(4)),In this work,based on the pore space partition strategy,a pacs-metal-organic framework(MOF):(NH_(2)Me_(2))_(2)[Fe_(3)(μ_(3)-O)(bdc)_(3)][In(FA)_(3)Cl_(3)](Fe‑FAIn‑bdc)was synthesized successfully by using the metal-formate com-plex[In(FA)_(3)Cl_(3)]^(3-)as the pore partition units,where bdc^(2-)=terephthalate,FA-=formate.Owing to the pore partition effect of this metal-organic building block,fruitful confined spaces are formed in the network of Fe‑FAIn‑bdc,endowing this MOF with superior separation performance of acetylene and carbon dioxide.According to the adsorp-tion test,this MOF exhibited a high adsorption capacity for C_(2)H_(2)(50.79 cm^(3)·g^(-1))at 298 K and 100 kPa,which was much higher than that for CO_(2)(29.99 cm^(3)·g^(-1))and C_(2)H_(4)(30.94 cm^(3)·g^(-1))under the same conditions.Ideal adsorbed solution theory(IAST)calculations demonstrate that the adsorption selectivity of Fe‑FAIn‑bdc for the mixture of C_(2)H_(2)/CO_(2)and C_(2)H_(2)/C_(2)H_(4)in a volume ratio of 50∶50 was 3.08 and 3.65,respectively,which was higher than some reported MOFs such as NUM-11 and SNNU-18.CCDC:_(2)453954.
基金supported by the National Natural Science Foundation of China(Nos.51304128 and 51674158)the Natural Science Foundation of Shandong Province(No.ZR2013EEQ015)
文摘To realize real-time monitoring and short-term forecasting and forewarning of coalmine ventilation systems(CVS), in this paper, we first established a joint surface and underground CVS safety management system consisting of main ventilation fan, safety-partition linked passageways, and air-required locations. We then applied chaos theory to identify the air quantity and gas concentration of underground partition boundaries, and adopted a fixed data quantity, multi-step progressive, weighted first-order local-domain method to setup a chaos prediction model and a CVS safety forecasting and forewarning system formed by the normal change level, orange forewarning level, and red alarm level. We next conduct the on-field application of the system in a coalmine in Jining, Shandong, China. The results showed that (1) in the statistical scale of 5 min, the changes in both air quantity and gas concentration along CVS partition airflow boundaries were characteristic of chaos and could be used for short-term chaos prediction, and the latter was more chaotic than the former;(2) the setup chaos prediction model had a higher prediction precision and the established safety prediction system could not only predict the variation in CVS stability but also reflect the rationality of underground mining intensity. Thus, this CVS safety forecasting and forewarning system is of better application value.
文摘In this article, I consider the right triangle as the simplex in the Euclidean plane, and extend this definition to higher dimensions. The n-dimensional simplex has one hypotenuse and (n−1)legs (catheti). The (n−1)legs define an orthogonal path of edges in the solid with perpendicular adjacent edges along the path. The length of the hypotenuse and the volume of the solid can be calculated without the Cayley-Menger determinant, by direct extension of the corresponding right triangle formulas. I give a proof of the existence of these shapes, describe the distribution of right angles in them, give an algebraic proof of the Coxeter trisection of a right tetrahedron into three smaller right tetrahedra, and generalize this construction to n-dimensional spaces. Finally, I investigate the connection between the Coxeter partition and the Hadwiger conjecture on the partition of the simplex into orthoschemes, which I call Pythagorean simplexes.
文摘A fast algorithm for ray tracing is presented, with which the specular reflection term of global illumination model is improved. A hybrid technique combining hierarchical bounding volumes and constant size box partitioning is presented and a fast box traversal algorithm is used. By this technique multiple ray intersections with objects that are in more than one box can be avoided. As a result, the speed of ray tracing is considerably increased.
文摘This paper presents a multi-ANN approximation approach to approximate complex non-linear function. Comparing with single-ANN methods the proposed approach improves and increases the approximation and generalization ability, and adaptability greatly in learning processes of networks. The simulation results have been shown that the method can be applied to the modeling and identification of complex dynamic control systems.
文摘With the development of computer graphics,the three-dimensional(3D)visualization brings new technological revolution to the traditional cartography.Therefore,the topographic 3D-map emerges to adapt to this technological revolution,and the applications of topographic 3D-map are spread rapidly to other relevant fields due to its incomparable advantage.The researches on digital map and the construction of map database offer strong technical support and abundant data source for this new technology,so the research and development of topographic 3D-map will receive greater concern.The basic data of the topographic 3D-map are rooted mainly in digital map and its basic model is derived from digital elevation model(DEM)and 3D-models of other DEM-based geographic features.In view of the potential enormous data and the complexity of geographic features,the dynamic representation of geographic information becomes the focus of the research of topographic 3D-map and also the prerequisite condition of 3D query and analysis.In addition to the equipment of hardware that are restraining,to a certain extent,the 3D representation,the data organization structure of geographic information will be the core problem of research on 3D-map.Level of detail(LOD),space partitioning,dynamic object loading(DOL)and object culling are core technologies of the dynamic 3D representation.The object-selection,attribute-query and model-editing are important functions and interaction tools for users with 3D-maps provided by topographic 3D-map system,all of which are based on the data structure of the 3D-model.This paper discusses the basic theories,concepts and cardinal principles of topographic 3D-map,expounds the basic way to organize the scene hierarchy of topographic 3D-map based on the node mechanism and studies the dynamic representation technologies of topographic 3D-map based on LOD,space partitioning,DOL and object culling.Moreover,such interactive operation functions are explored,in this paper,as spatial query,scene editing and management of topographic 3D-map.Finally,this paper describes briefly the applications of topographic 3D-map in its related fields.
基金supported by the Natural Science Foundation of China under Grant No.61202154 and No.61133009the National Basic Research Project of China under Grant No.2011CB302203+2 种基金Shanghai Pujiang Program under Grant No.13PJ1404500the Science and Technology Commission of Shanghai Municipality Program under Grant No.13511505000the Open Project Program of the State Key Lab of CAD&CG of Zhejiang University under Grant No.A1401
文摘Regularized Boolean operations have been widely used in 3D modeling systems. However, evaluating Boolean operations may be quite numerically unstable and time consuming, especially for iterated set operations. A novel and unified technique is proposed in this paper for computing single and iterated set operations efficiently, robustly and exactly. An adaptive octree is combined with a nested constructive solid geometry （CSG） tree by this technique. The intersection handling is restricted to the cells in the octree where intersection actually occurs. Within those cells, a CSG tree template is instanced by the surfaces and the tree is converted to planebased binary space partitioning （BSP） for set evaluation; Moreover, the surface classification is restricted to the ceils in the octree where the surfaces only come from a model and are within the bounding-boxes of other polyhedrons. These two ways bring about the efficiency and scalability of the operations, in terms of runtime and memory. As all surfaces in such a cell have the same classification relation, they are classified as a whole. Robustness and exactness are achieved by integrating plane-based geometry representation with adaptive geometry predicate technique in intersection handling, and by applying divide-and-conquer arithmetic on surface classification. Experimental results demonstrate that the proposed approach can guarantee the robustness of Boolean computations and runs faster than other existing approaches.
基金Supported by the International Partnership Program of Chinese Academy of Sciences(No.184131KYSB20200033).
文摘Due to the issue of long-horizon,a substantial number of visits to the state space is required during the exploration phase of reinforcement learning(RL)to gather valuable information.Addi-tionally,due to the challenge posed by sparse rewards,the planning phase of reinforcement learning consumes a considerable amount of time on repetitive and unproductive tasks before adequately ac-cessing sparse reward signals.To address these challenges,this work proposes a space partitioning and reverse merging(SPaRM)framework based on reward-free exploration(RFE).The framework consists of two parts:the space partitioning module and the reverse merging module.The former module partitions the entire state space into a specific number of subspaces to expedite the explora-tion phase.This work establishes its theoretical sample complexity lower bound.The latter module starts planning in reverse from near the target and gradually extends to the starting state,as opposed to the conventional practice of starting at the beginning.This facilitates the early involvement of sparse rewards at the target in the policy update process.This work designs two experimental envi-ronments:a complex maze and a set of randomly generated maps.Compared with two state-of-the-art(SOTA)algorithms,experimental results validate the effectiveness and superior performance of the proposed algorithm.
文摘In the optimal maintenance modeling, all possible maintenance activities and their corresponding probabilities play a key role in modeling. For a system with multiple non-identical units, its maintenance requirements are very complicated, and it is time-consuming, even omission may occur when enumerating them with various combinations of units and even with different maintenance actions for them. Deterioration state space partition (DSSP) method is an efficient approach to analyze all possible maintenance requirements at each maintenance decision point and deduce their corresponding probabilities for maintenance modeling of multi-unit systems. In this paper, an extended DSSP method is developed for systems with multiple non-identical units considering opportunistic, preventive and corrective maintenance activities for each unit. In this method, different maintenance types are distinguished in each maintenance requirement. A new representation of the possible maintenance requirements and their corresponding probabilities is derived according to the partition results based on the joint probability density function of the maintained system deterioration state. Furthermore, focusing on a two-unit system with a non-periodical inspected condition-based opportunistic preventive-maintenance strategy;a long-term average cost model is established using the proposed method to determine its optimal maintenance parameters jointly, in which “hard failure” and non-negligible maintenance time are considered. Numerical experiments indicate that the extended DSSP method is valid for opportunistic maintenance modeling of multi-unit systems.
基金Acknowledgment This work was supported by the National Natural Science Foundation of China(No.61976247)the Basic Ability Promotion Project of Guangxi Middle-Aged and Young University Teacher。
文摘As a class of effective methods for incomplete multi-view clustering,graph-based algorithms have recently drawn wide attention.However,most of them could use further improvement regarding the following aspects.First,in some graph-based models,all views are forced to share a common similarity graph regardless of the severe consistency degeneration due to incomplete views.Next,similarity graph construction and cluster analysis are sometimes performed separately.Finally,the contribution difference of individual views is not always carefully considered.To address these issues simultaneously,this paper proposes an incomplete multi-view clustering algorithm based on auto-weighted fusion in partition space.In our algorithm,the information of cluster structure is introduced into the process of similarity learning to construct a desirable similarity graph,information fusion is performed in partition space to alleviate the negative impact brought about by consistency degradation,and all views are adaptively weighted to reflect their different contributions to clustering tasks.Finally,all the subtasks are collaboratively optimized in a united framework to reach an overall optimal result.Experimental results show that the proposed method compares favorably with the state-of-the-art methods.
文摘We present a study to show the possibility of using two well-known space partitioning and indexing techniques, kd trees and quad trees, in declustering applications to increase input/output （I/O） paraUelization and reduce spatial data processing times. This parallelization enables time-consuming computational geometry algorithms to be applied efficiently to big spatial data rendering and querying. The key challenge is how to balance the spatial processing load across a large number of worker nodes, given significant performance heterogeneity in nodes and processing skews in the workload.
文摘An orthoscheme or Pythagorean simplex is a solid in n-dimensional Euclidean space whose faces are right triangles.In 1956,Hadwiger asked whether an ndimensional general(not necessarily Pythagorean)simplex can always be decomposed into a finite number of Pythagorean simplexes.Tschirpke proved in 1994 that this division is always possible in 5D space.Coxeter proved that a 3D Pythagorean simplex can be split into three smaller ones.In a 2024 paper,I generalized Coxeter’s trisection to prove that the dissection of an n-dimensional Pythagorean simplex into n pieces of the same type is possible if each leg of the original solid is equal to the unit distance.In the present paper,I extend this proof to an n-dimensional Pythagorean simplex with legs of arbitrary measure.This means the proof of the Hadwiger conjecture in the special case of a Pythagorean simplex.
文摘Many isolation approaches, such as zoning search, have been proposed to preserve the diversity in the decision space of multimodal multi-objective optimization(MMO). However, these approaches allocate the same computing resources for subspaces with different difficulties and evolution states. In order to solve this issue, this paper proposes a dynamic resource allocation strategy(DRAS)with reinforcement learning for multimodal multi-objective optimization problems(MMOPs). In DRAS, relative contribution and improvement are utilized to define the aptitude of subspaces, which can capture the potentials of subspaces accurately. Moreover, the reinforcement learning method is used to dynamically allocate computing resources for each subspace. In addition, the proposed DRAS is applied to zoning searches. Experimental results demonstrate that DRAS can effectively assist zoning search in finding more and better distributed equivalent Pareto optimal solutions in the decision space.
基金supported by the National Natural Science Foundation of China (22071246 and 22272178)CAS youth interdisciplinary team (JCTD-2022-12)+1 种基金CAS-Iranian Vice presidency for science and technology joint research project (121835KYSB20200034)China Postdoctoral Science Foundation (2023M733499)。
基金Supported by the National Natural Science Foundation of China (No.60502013)by the National High-Tech Research and Development(863) Program of China(No.2006AA01Z115)
文摘The availability of a good viewpoint space partition is crucial in three dimensional （3-D） object recognition on the approach of aspect graph. There are two important events, depicted by the aspect graph approach, edge-：edge-edge （EEE） events and edge-vertex （EV） events. This paper presents an algorithm to compute EEE events by characteristic analysis based on conicoid theory, in contrast to current algorithms that focus too much on EV events and often overlook the importance of EEE events. Also, the paper provides a standard flowchart for the viewpoint space partitioning based on aspect graph theory that makes it suitable for perspective models. The partitioning result best demonstrates the algorithm＇s efficiency with more valuable viewpoints found with the help of EEE events, which can definitely help to achieve high recognition rate for 3-D object recognition.
