We analyze existence and uniqueness of solutions for perturbations of a Jensen functional inequality in several variables.Applications in connection with asymptotic behaviors of isomorphisms,derivations and n-Jordan d...We analyze existence and uniqueness of solutions for perturbations of a Jensen functional inequality in several variables.Applications in connection with asymptotic behaviors of isomorphisms,derivations and n-Jordan derivations on Banach algebras are also provided.The results of this paper correct and improve the main results of[12,16,22,23]and improve the corresponding results in[2,9,27],but under weaker assumptions.展开更多
In this paper we study the isomorphisms of two ＊-bisimple type A ω2-semigroups such that D^＊ = ^~D） and obtain a criterion for isomorphisms of two such semigroups.
In this article, we prove the Hyers-Ulam-Rassias stability of the following Cauchy-Jensen functional inequality：‖f （x） ＋ f （y） ＋ 2f （z） ＋ 2f （w）‖ ≤‖ 2f x ＋ y2 ＋ z ＋ w ‖（0.1）This is applied to inv...In this article, we prove the Hyers-Ulam-Rassias stability of the following Cauchy-Jensen functional inequality：‖f （x） ＋ f （y） ＋ 2f （z） ＋ 2f （w）‖ ≤‖ 2f x ＋ y2 ＋ z ＋ w ‖（0.1）This is applied to investigate isomorphisms between C＊-algebras, Lie C＊-algebras and JC＊-algebras, and derivations on C＊-algebras, Lie C＊-algebras and JC＊-algebras, associated with the Cauchy-Jensen functional equation 2f （x ＋ y/2 ＋ z ＋ w） = f（x） ＋ f（y） ＋ 2f（z） ＋ 2f（w）.展开更多
Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annea...Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.展开更多
Basing on the papers from [1] to [4], this paper gives some further research,mainly solves the following problems:(1) It proved that several theorems of subgroup which have been raised to the hypergroup are still true...Basing on the papers from [1] to [4], this paper gives some further research,mainly solves the following problems:(1) It proved that several theorems of subgroup which have been raised to the hypergroup are still true.(2) It proved that the isomorphous relationship of the bottomgroups which guid to the hypergroup can still keep such relationship.(3) It proved that the basic isomorphous Theorem and the homogenous Theorem of the bottomgroup which raise to the hypergroup are still true.(4) It point out that when the isomorphous bottomgroups have been raised to the hypergroup,the conditions which form the isomorphism should be lessened.展开更多
Most of the phosphorite deposits in the world contain isomorphism rare earths （RE） which are considerably difficult to be leached into solution in the wet phos- phoric acid process. In this work, a systematic study ...Most of the phosphorite deposits in the world contain isomorphism rare earths （RE） which are considerably difficult to be leached into solution in the wet phos- phoric acid process. In this work, a systematic study of leaching RE using sulfuric acid, phosphoric acid, mixed acid and two-step leaching of phosphoric acid and sulfuric acid was performed. The aims are to illuminate the main factors that inhibit RE leaching and to provide insights into the further enrichment of RE in the wet phosphoric acid solution. The results indicate that H2SO4 is not an effective acid for leaching isomorphism RE from phosphorite ore. The low RE leaching efficiency attributes to the RE cocrystallized and encapsulated by phosphogypsum （PG） as well as the precipitation of RE by RE sulfates or phosphates. High concentration of H3PO4 can enhance the dissolution and diffusion of RE ions. Hence, the optimized leaching mode of improving RE leaching efficiency is to adequately dissolve phosphorite ores in high concentration of H3PO4 solution and then add H2SO4 to crystallize PG. The effect of corystallization or encapsulation of PG on RE can be decreased due to the crystallizing mode of PG in the bulk solution instead of on the interface of solid reactants. RE leaching efficiency can be high up to 65% by the optimized leaching mode.展开更多
This study undertakes a systematic examination of characteristics of the spatio-temporal evolution of industrial economies in Central Asia from the perspectives of industrial scale,structural rationality,industrial co...This study undertakes a systematic examination of characteristics of the spatio-temporal evolution of industrial economies in Central Asia from the perspectives of industrial scale,structural rationality,industrial competitiveness,and industrial isomorphism.The results show that industrial structures in Central Asian countries are becoming increasingly advanced,with certain differences among them in the characteristics of this evolution.Kazakhstan has long had a tertiary-secondary-primary industrial pattern,and productive services have played an increasingly prominent role in the development of its tertiary industry.The transformation of the industrial structure in Uzbekistan,from a secondary-tertiary-primary pattern at its independence from the Soviet Union to a tertiary-secondary-primary pattern,is apparent.Tajikistan's industrial structure has also changed significantly in recent times.Its secondary industries shrunk while tertiary industries developed rapidly.In Kyrgyzstan,the ratios of secondary and tertiary industries to total industrial output have fluctuated significantly while considerable progress has been made in the service sector.The industrial structure of Turkmenistan is significantly lower than the other countries,and Turkmenistan is the only country in the Central Asian region which still shows a tertiary-secondary-primary industrial pattern.The feasibility and competitiveness of the industrial structures of these five Central Asian countries have different characteristics.Kazakhstan has structural advantages but lags in competitiveness,Uzbekistan is driven by both structural and competitive advantages,Tajikistan enjoys structural advantages while Kyrgyzstan lags behind in competitiveness,and Turkmenistan has a competitiveness-driven economy.Furthermore,values of the similar coefficient index of the three industrial structures in these countries were mostly above 0.95,the coefficients of the secondary industrial subdivisions in some countries were below 0.85,and those of tertiary industrial subdivisions among most countries were above 0.89,indicating considerable similarities in industrial structure among them.These findings are important in the context of establishing an effective industrial development strategy for the Silk Road Economic Belt,improving international cooperation,and upgrading industrial structures to achieve economic prosperity.展开更多
Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains(KCs).The detection can be performed accurately by using the similarity of KCs.However,there are very few works on isomorp...Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains(KCs).The detection can be performed accurately by using the similarity of KCs.However,there are very few works on isomorphism detection based on the properties of similar vertices.In this paper,an ameliorated multi-order adjacent vertex assignment sequence(AMAVS)method is proposed to seek out similar vertices and identify the isomorphism of the planar KCs.First,the specific definition of AMAVS is described.Through the calculation of the AMAVS,the adjacent vertex value sequence reflecting the uniqueness of the topology features is established.Based on the value sequence,all possible similar vertices,corresponding relations,and isomorphism discrimination can be realized.By checking the topological graph of KCs with a different number of links,the effectiveness and efficiency of the proposed method are verified.Finally,the method is employed to implement the similar vertices and isomorphism detection of all the 9-link 2-D0F(degree of freedom)planar KCs.展开更多
If T is an isomorphism of （c0） into C（Ω） （where Ω is a sequentially compact and paracompact space, or a compact metric space in particular）, which satisfies the condition ｜｜T｜｜·｜｜T^-1｜｜ ≤ 1 ＋ε ...If T is an isomorphism of （c0） into C（Ω） （where Ω is a sequentially compact and paracompact space, or a compact metric space in particular）, which satisfies the condition ｜｜T｜｜·｜｜T^-1｜｜ ≤ 1 ＋ε for some ε ∈ （0,1/5）, then T/｜｜T｜｜ is close to an isometry with an error less than 9ε. The proof of this article is simple without using the dual space or adjoint operator.展开更多
A novel framework for parallel subgraph isomorphism on GPUs is proposed, named GPUSI, which consists of GPU region exploration and GPU subgraph matching. The GPUSI iteratively enumerates subgraph instances and solves ...A novel framework for parallel subgraph isomorphism on GPUs is proposed, named GPUSI, which consists of GPU region exploration and GPU subgraph matching. The GPUSI iteratively enumerates subgraph instances and solves the subgraph isomorphism in a divide-and-conquer fashion. The framework completely relies on the graph traversal, and avoids the explicit join operation. Moreover, in order to improve its performance, a task-queue based method and the virtual-CSR graph structure are used to balance the workload among warps, and warp-centric programming model is used to balance the workload among threads in a warp. The prototype of GPUSI is implemented, and comprehensive experiments of various graph isomorphism operations are carried on diverse large graphs. The experiments clearly demonstrate that GPUSI has good scalability and can achieve speed-up of 1.4–2.6 compared to the state-of-the-art solutions.展开更多
The adjacent matrix method for identifying isomorphism to planar kinematic chain with multiple joints and higher pairs is presented. The topological invariants of the planar kinematic chain can be calculated and compa...The adjacent matrix method for identifying isomorphism to planar kinematic chain with multiple joints and higher pairs is presented. The topological invariants of the planar kinematic chain can be calculated and compared by adjacent matrix. The quantity of calculation can be reduced effectively using the several divisions of bars and the reconfiguration of the adjacent matrix. As two structural characteristics of adjacent matrix, the number of division and division code are presented. It can be identified that two kinematic chains are isomorphic or not by comparing the structural characteristics of their adjacent matrixes using a method called matching row-to-row. This method may be applied to the planar linkage chain too. So, the methods of identifying isomorphism are unified in the planar kinematic chain that has or hasn＇t higher pairs with or without multiple joints. And it has some characters such as visual, simple and convenient for processing by computer, and so on.展开更多
Let R_1 and R_2 be two rings with unit I. We give some characterizations of ring homomorphisms and ring isomorphisms between R_1 and R_2 in term of complete preservers of fixed points of multipliers, under some mild a...Let R_1 and R_2 be two rings with unit I. We give some characterizations of ring homomorphisms and ring isomorphisms between R_1 and R_2 in term of complete preservers of fixed points of multipliers, under some mild assumption on R_1. Applications to several kinds of operator algebras such as Banach algebras, nest algebras, matrix algebras and standard operator algebras are presented.展开更多
文摘We analyze existence and uniqueness of solutions for perturbations of a Jensen functional inequality in several variables.Applications in connection with asymptotic behaviors of isomorphisms,derivations and n-Jordan derivations on Banach algebras are also provided.The results of this paper correct and improve the main results of[12,16,22,23]and improve the corresponding results in[2,9,27],but under weaker assumptions.
基金Supported by the National Natural Science Foundation of China(Grant No.10901134)the Science Foundation of the Department of Education of Yunnan Province(Grant No.2011Y478)
文摘In this paper we study the isomorphisms of two ＊-bisimple type A ω2-semigroups such that D^＊ = ^~D） and obtain a criterion for isomorphisms of two such semigroups.
基金supported by the Daejin University grants in 2010
文摘In this article, we prove the Hyers-Ulam-Rassias stability of the following Cauchy-Jensen functional inequality：‖f （x） ＋ f （y） ＋ 2f （z） ＋ 2f （w）‖ ≤‖ 2f x ＋ y2 ＋ z ＋ w ‖（0.1）This is applied to investigate isomorphisms between C＊-algebras, Lie C＊-algebras and JC＊-algebras, and derivations on C＊-algebras, Lie C＊-algebras and JC＊-algebras, associated with the Cauchy-Jensen functional equation 2f （x ＋ y/2 ＋ z ＋ w） = f（x） ＋ f（y） ＋ 2f（z） ＋ 2f（w）.
基金the National Natural Science Foundation of China (60373089, 60674106, and 60533010)the National High Technology Research and Development "863" Program (2006AA01Z104)
文摘Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.
文摘Basing on the papers from [1] to [4], this paper gives some further research,mainly solves the following problems:(1) It proved that several theorems of subgroup which have been raised to the hypergroup are still true.(2) It proved that the isomorphous relationship of the bottomgroups which guid to the hypergroup can still keep such relationship.(3) It proved that the basic isomorphous Theorem and the homogenous Theorem of the bottomgroup which raise to the hypergroup are still true.(4) It point out that when the isomorphous bottomgroups have been raised to the hypergroup,the conditions which form the isomorphism should be lessened.
基金financially supported by the National Natural Science Foundation of China (Nos. 51364005, 51564003 and 51574094)
文摘Most of the phosphorite deposits in the world contain isomorphism rare earths （RE） which are considerably difficult to be leached into solution in the wet phos- phoric acid process. In this work, a systematic study of leaching RE using sulfuric acid, phosphoric acid, mixed acid and two-step leaching of phosphoric acid and sulfuric acid was performed. The aims are to illuminate the main factors that inhibit RE leaching and to provide insights into the further enrichment of RE in the wet phosphoric acid solution. The results indicate that H2SO4 is not an effective acid for leaching isomorphism RE from phosphorite ore. The low RE leaching efficiency attributes to the RE cocrystallized and encapsulated by phosphogypsum （PG） as well as the precipitation of RE by RE sulfates or phosphates. High concentration of H3PO4 can enhance the dissolution and diffusion of RE ions. Hence, the optimized leaching mode of improving RE leaching efficiency is to adequately dissolve phosphorite ores in high concentration of H3PO4 solution and then add H2SO4 to crystallize PG. The effect of corystallization or encapsulation of PG on RE can be decreased due to the crystallizing mode of PG in the bulk solution instead of on the interface of solid reactants. RE leaching efficiency can be high up to 65% by the optimized leaching mode.
基金The Strategic Priority Research Program of the CAS,No.XDA20040400National Natural Science Foundation of China,No.41801114。
文摘This study undertakes a systematic examination of characteristics of the spatio-temporal evolution of industrial economies in Central Asia from the perspectives of industrial scale,structural rationality,industrial competitiveness,and industrial isomorphism.The results show that industrial structures in Central Asian countries are becoming increasingly advanced,with certain differences among them in the characteristics of this evolution.Kazakhstan has long had a tertiary-secondary-primary industrial pattern,and productive services have played an increasingly prominent role in the development of its tertiary industry.The transformation of the industrial structure in Uzbekistan,from a secondary-tertiary-primary pattern at its independence from the Soviet Union to a tertiary-secondary-primary pattern,is apparent.Tajikistan's industrial structure has also changed significantly in recent times.Its secondary industries shrunk while tertiary industries developed rapidly.In Kyrgyzstan,the ratios of secondary and tertiary industries to total industrial output have fluctuated significantly while considerable progress has been made in the service sector.The industrial structure of Turkmenistan is significantly lower than the other countries,and Turkmenistan is the only country in the Central Asian region which still shows a tertiary-secondary-primary industrial pattern.The feasibility and competitiveness of the industrial structures of these five Central Asian countries have different characteristics.Kazakhstan has structural advantages but lags in competitiveness,Uzbekistan is driven by both structural and competitive advantages,Tajikistan enjoys structural advantages while Kyrgyzstan lags behind in competitiveness,and Turkmenistan has a competitiveness-driven economy.Furthermore,values of the similar coefficient index of the three industrial structures in these countries were mostly above 0.95,the coefficients of the secondary industrial subdivisions in some countries were below 0.85,and those of tertiary industrial subdivisions among most countries were above 0.89,indicating considerable similarities in industrial structure among them.These findings are important in the context of establishing an effective industrial development strategy for the Silk Road Economic Belt,improving international cooperation,and upgrading industrial structures to achieve economic prosperity.
基金Supported by National Natural Science Foundation of China(Grant Nos.51675488,51975534)Zhejiang Provincial Natural Science Foundation of China(Grant No.LY19E050021)。
文摘Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains(KCs).The detection can be performed accurately by using the similarity of KCs.However,there are very few works on isomorphism detection based on the properties of similar vertices.In this paper,an ameliorated multi-order adjacent vertex assignment sequence(AMAVS)method is proposed to seek out similar vertices and identify the isomorphism of the planar KCs.First,the specific definition of AMAVS is described.Through the calculation of the AMAVS,the adjacent vertex value sequence reflecting the uniqueness of the topology features is established.Based on the value sequence,all possible similar vertices,corresponding relations,and isomorphism discrimination can be realized.By checking the topological graph of KCs with a different number of links,the effectiveness and efficiency of the proposed method are verified.Finally,the method is employed to implement the similar vertices and isomorphism detection of all the 9-link 2-D0F(degree of freedom)planar KCs.
基金National Natural Science Foundation of China(10571090)the Research Fund for the Doctoral Program of Higher Education(20060055010)
文摘If T is an isomorphism of （c0） into C（Ω） （where Ω is a sequentially compact and paracompact space, or a compact metric space in particular）, which satisfies the condition ｜｜T｜｜·｜｜T^-1｜｜ ≤ 1 ＋ε for some ε ∈ （0,1/5）, then T/｜｜T｜｜ is close to an isometry with an error less than 9ε. The proof of this article is simple without using the dual space or adjoint operator.
基金Projects(61272142,61103082,61003075,61170261,61103193)supported by the National Natural Science Foundation of ChinaProject supported by Funds for New Century Excellent Talents in University of ChinaProjects(2012AA01A301,2012AA010901)supported by the National High Technology Research and Development Program of China
文摘A novel framework for parallel subgraph isomorphism on GPUs is proposed, named GPUSI, which consists of GPU region exploration and GPU subgraph matching. The GPUSI iteratively enumerates subgraph instances and solves the subgraph isomorphism in a divide-and-conquer fashion. The framework completely relies on the graph traversal, and avoids the explicit join operation. Moreover, in order to improve its performance, a task-queue based method and the virtual-CSR graph structure are used to balance the workload among warps, and warp-centric programming model is used to balance the workload among threads in a warp. The prototype of GPUSI is implemented, and comprehensive experiments of various graph isomorphism operations are carried on diverse large graphs. The experiments clearly demonstrate that GPUSI has good scalability and can achieve speed-up of 1.4–2.6 compared to the state-of-the-art solutions.
文摘The adjacent matrix method for identifying isomorphism to planar kinematic chain with multiple joints and higher pairs is presented. The topological invariants of the planar kinematic chain can be calculated and compared by adjacent matrix. The quantity of calculation can be reduced effectively using the several divisions of bars and the reconfiguration of the adjacent matrix. As two structural characteristics of adjacent matrix, the number of division and division code are presented. It can be identified that two kinematic chains are isomorphic or not by comparing the structural characteristics of their adjacent matrixes using a method called matching row-to-row. This method may be applied to the planar linkage chain too. So, the methods of identifying isomorphism are unified in the planar kinematic chain that has or hasn＇t higher pairs with or without multiple joints. And it has some characters such as visual, simple and convenient for processing by computer, and so on.
基金Supported by the National Natural Science Foundation of China(Grant No.11671294)
文摘Let R_1 and R_2 be two rings with unit I. We give some characterizations of ring homomorphisms and ring isomorphisms between R_1 and R_2 in term of complete preservers of fixed points of multipliers, under some mild assumption on R_1. Applications to several kinds of operator algebras such as Banach algebras, nest algebras, matrix algebras and standard operator algebras are presented.
