A 2-dimension linguistic lattice implication algebra(2DL-LIA)can build a bridge between logical algebra and 2-dimension fuzzy linguistic information.In this paper,the notion of a Boolean element is proposed in a 2DL-L...A 2-dimension linguistic lattice implication algebra(2DL-LIA)can build a bridge between logical algebra and 2-dimension fuzzy linguistic information.In this paper,the notion of a Boolean element is proposed in a 2DL-LIA and some properties of Boolean elements are discussed.Then derivations on 2DL-LIAs are introduced and the related properties of derivations are investigated.Moreover,it proves that the derivations on 2DL-LIAs can be constructed by Boolean elements.展开更多
Dear Editor,This letter deals with the set stabilization of stochastic Boolean control networks(SBCNs)by the pinning control strategy,which is to realize the full control for systems by imposing control inputs on a fr...Dear Editor,This letter deals with the set stabilization of stochastic Boolean control networks(SBCNs)by the pinning control strategy,which is to realize the full control for systems by imposing control inputs on a fraction of agents.展开更多
Given a compact and regular Hausdorff measure space (X, μ), with μ a Radon measure, it is known that the generalised space M(X) of all the positive Radon measures on X is isomorphic to the space of essentially bound...Given a compact and regular Hausdorff measure space (X, μ), with μ a Radon measure, it is known that the generalised space M(X) of all the positive Radon measures on X is isomorphic to the space of essentially bounded functions L<sup>∞</sup>(X, μ) on X. We confirm that the commutative von Neumann algebras M⊂B(H), with H=L<sup>2</sup>(X, μ), are unitary equivariant to the maximal ideals of the commutative algebra C(X). Subsequenly, we use the measure groupoid to formulate the algebraic and topological structures of the commutative algebra C(X) following its action on M(X) and define its representation and ergodic dynamical system on the commutative von Neumann algebras of M of B(H) .展开更多
Set stabilization is one of the essential problems in engineering systems, and self-triggered control(STC) can save the storage space for interactive information, and can be successfully applied in networked control s...Set stabilization is one of the essential problems in engineering systems, and self-triggered control(STC) can save the storage space for interactive information, and can be successfully applied in networked control systems with limited communication resources. In this study, the set stabilization problem and STC design of Boolean control networks are investigated via the semi-tensor product technique. On the one hand, the largest control invariant subset is calculated in terms of the strongly connected components of the state transition graph, by which a graph-theoretical condition for set stabilization is derived. On the other hand, a characteristic function is exploited to determine the triggering mechanism and feasible controls. Based on this, the minimum-time and minimum-triggering open-loop, state-feedback and output-feedback STCs for set stabilization are designed,respectively. As classic applications of self-triggered set stabilization, self-triggered synchronization, self-triggered output tracking and self-triggered output regulation are discussed as well. Additionally, several practical examples are given to illustrate the effectiveness of theoretical results.展开更多
The superiority of hypothetical quantum computers is not due to faster calculations but due to different scheme of calculations running on special hardware. At the same time, one should realize that quantum computers ...The superiority of hypothetical quantum computers is not due to faster calculations but due to different scheme of calculations running on special hardware. At the same time, one should realize that quantum computers would only provide dramatic speedups for a few specific problems, for example, factoring integers and breaking cryptographic codes in the conventional quantum computing approach. The core of quantum computing follows the way a state of a quantum system is defined when basic things interact with each other. In the conventional approach, it is implemented through the tensor product of qubits. In the suggested geometric algebra formalism simultaneous availability of all the results for non-measured observables is based on the definition of states as points on a three-dimensional sphere, which is very different from the usual Hilbert space scheme.展开更多
In this paper,we define a new class of control functions through aggregate special functions.These class of control functions help us to stabilize and approximate a tri-additiveψ-functional inequality to get a better...In this paper,we define a new class of control functions through aggregate special functions.These class of control functions help us to stabilize and approximate a tri-additiveψ-functional inequality to get a better estimation for permuting tri-homomorphisms and permuting tri-derivations in unital C*-algebras and Banach algebras by the vector-valued alternative fixed point theorem.展开更多
Single input single output system was studied. With proportion, differential, integral results of deviation between given input and output as controller input, the logic rules in control process was analyzed, these lo...Single input single output system was studied. With proportion, differential, integral results of deviation between given input and output as controller input, the logic rules in control process was analyzed, these logic rule with Pan-Boolean algebra was described, therefore a PID Pan-Boolean algebra control algorithm was obtained. The simulation results indicates that the new control algorithm is more effective compared to the traditional PID algorithm, having advantages such as more than 3 adjustable parameters of controllers, better result, and so on.展开更多
To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation o...To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to construct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is determined for the number of Boolean functions with maximum algebraic immunity.展开更多
In this paper, we review some of their related properties of derivations on MValgebras and give some characterizations of additive derivations. Then we prove that the fixed point set of Boolean additive derivations an...In this paper, we review some of their related properties of derivations on MValgebras and give some characterizations of additive derivations. Then we prove that the fixed point set of Boolean additive derivations and that of their adjoint derivations are isomorphic.In particular, we prove that every MV-algebra is isomorphic to the direct product of the fixed point set of Boolean additive derivations and that of their adjoint derivations. Finally we show that every Boolean algebra is isomorphic to the algebra of all Boolean additive(implicative)derivations. These results also give the negative answers to two open problems, which were proposed in [Fuzzy Sets and Systems, 303(2016), 97-113] and [Information Sciences, 178(2008),307-316].展开更多
Dear Editor, The time-dependent algebraic Riccati equation(TDARE) problem is applied to many optimal control industrial applications. It is susceptible to interference from measurement noises in the virtual environmen...Dear Editor, The time-dependent algebraic Riccati equation(TDARE) problem is applied to many optimal control industrial applications. It is susceptible to interference from measurement noises in the virtual environment, which current methods cannot effectively address. A normbased adaptive coefficient zeroing neural network(NACZNN) model to solve the TDARE problem is proposed.展开更多
We introduce and investigate the properties of a generalization of the derivation of dendriform algebras. We specify all possible parameter values for the generalized derivations, which depend on parameters. We provid...We introduce and investigate the properties of a generalization of the derivation of dendriform algebras. We specify all possible parameter values for the generalized derivations, which depend on parameters. We provide all generalized derivations for complex low-dimensional dendriform algebras.展开更多
As an inorganic chemical,magnesium iodide has a significant crystalline structure.It is a complex and multifunctional substance that has the potential to be used in a wide range of medical advancements.Molecular graph...As an inorganic chemical,magnesium iodide has a significant crystalline structure.It is a complex and multifunctional substance that has the potential to be used in a wide range of medical advancements.Molecular graph theory,on the other hand,provides a sufficient and cost-effective method of investigating chemical structures and networks.M-polynomial is a relatively new method for studying chemical networks and structures in molecular graph theory.It displays numerical descriptors in algebraic form and highlights molecular features in the form of a polynomial function.We present a polynomials display of magnesium iodide structure and calculate several M-polynomials in this paper,particularly the M-polynomials of the augmented Zagreb index,inverse sum index,hyper Zagreb index and for the symmetric division index.展开更多
The aim of this paper is to outline the conditions of a conformal hyperquaternion algebra H<sup>⊗2m</sup> in which a higher order plane curve can be described by generalizing the well-known cases of conics...The aim of this paper is to outline the conditions of a conformal hyperquaternion algebra H<sup>⊗2m</sup> in which a higher order plane curve can be described by generalizing the well-known cases of conics and cubic curves in 2D. In other words, the determination of the order of a plane curve through n points and its conformal hyperquaternion algebra H<sup>⊗2m</sup> is the object of this work.展开更多
The ideas of ambiguous bipolar skepticism under algebra and closed skepticism ambiguous bipolar ideals and related features have been developed.The fuzzy measure ideal is described in terms of bipolar ambiguous measur...The ideas of ambiguous bipolar skepticism under algebra and closed skepticism ambiguous bipolar ideals and related features have been developed.The fuzzy measure ideal is described in terms of bipolar ambiguous measure algebra and bipolar skepticism,and the linkages between bipolar fuzzy measure algebra are determined.A bipolar misty ideal’s skepticism is examined.InBCW andBCL-measure algebra,homogeneous ideas and dubious pictures of fuzzy bipolar measure ideas are examined.Also,we gave the relationship between these concepts.Finally,it is given the perfect terms for an occult bipolar doubt to be a measure of ideal fuzzy bipolar closed doubt.展开更多
A lot of combinatorial objects have a natural bialgebra structure. In this paper, we prove that the vector space spanned by labeled simple graphs is a bialgebra with the conjunction product and the unshuffle coproduct...A lot of combinatorial objects have a natural bialgebra structure. In this paper, we prove that the vector space spanned by labeled simple graphs is a bialgebra with the conjunction product and the unshuffle coproduct. In fact, it is a Hopf algebra since it is graded connected. The main conclusions are that the vector space spanned by labeled simple graphs arising from the unshuffle coproduct is a Hopf algebra and that there is a Hopf homomorphism from permutations to label simple graphs.展开更多
How to accelerate the convergence speed and avoid computing the inversion of a Jacobian matrix is important in the solution of nonlinear algebraic equations(NAEs).This paper develops an approach with a splitting-linea...How to accelerate the convergence speed and avoid computing the inversion of a Jacobian matrix is important in the solution of nonlinear algebraic equations(NAEs).This paper develops an approach with a splitting-linearizing technique based on the nonlinear term to reduce the effect of the nonlinear terms.We decompose the nonlinear terms in the NAEs through a splitting parameter and then linearize the NAEs around the values at the previous step to a linear system.Through the maximal orthogonal projection concept,to minimize a merit function within a selected interval of splitting parameters,the optimal parameters can be quickly determined.In each step,a linear system is solved by the Gaussian elimination method,and the whole iteration procedure is convergent very fast.Several numerical tests show the high performance of the optimal split-linearization iterative method(OSLIM).展开更多
A qualia role-based entity-dependency graph(EDG)is proposed to represent and extract quantity relations for solving algebra story problems stated in Chinese.Traditional neural solvers use end-to-end models to translat...A qualia role-based entity-dependency graph(EDG)is proposed to represent and extract quantity relations for solving algebra story problems stated in Chinese.Traditional neural solvers use end-to-end models to translate problem texts into math expressions,which lack quantity relation acquisition in sophisticated scenarios.To address the problem,the proposed method leverages EDG to represent quantity relations hidden in qualia roles of math objects.Algorithms were designed for EDG generation and quantity relation extraction for solving algebra story problems.Experimental result shows that the proposedmethod achieved an average accuracy of 82.2%on quantity relation extraction compared to 74.5%of baseline method.Another prompt learning result shows a 5%increase obtained in problem solving by injecting the extracted quantity relations into the baseline neural solvers.展开更多
Solving Algebraic Problems with Geometry Diagrams(APGDs)poses a significant challenge in artificial intelligence due to the complex and diverse geometric relations among geometric objects.Problems typically involve bo...Solving Algebraic Problems with Geometry Diagrams(APGDs)poses a significant challenge in artificial intelligence due to the complex and diverse geometric relations among geometric objects.Problems typically involve both textual descriptions and geometry diagrams,requiring a joint understanding of these modalities.Although considerable progress has been made in solving math word problems,research on solving APGDs still cannot discover implicit geometry knowledge for solving APGDs,which limits their ability to effectively solve problems.In this study,a systematic and modular three-phase scheme is proposed to design an algorithm for solving APGDs that involve textual and diagrammatic information.The three-phase scheme begins with the application of the statetransformer paradigm,modeling the problem-solving process and effectively representing the intermediate states and transformations during the process.Next,a generalized APGD-solving approach is introduced to effectively extract geometric knowledge from the problem’s textual descriptions and diagrams.Finally,a specific algorithm is designed focusing on diagram understanding,which utilizes the vectorized syntax-semantics model to extract basic geometric relations from the diagram.A method for generating derived relations,which are essential for solving APGDs,is also introduced.Experiments on real-world datasets,including geometry calculation problems and shaded area problems,demonstrate that the proposed diagram understanding method significantly improves problem-solving accuracy compared to methods relying solely on simple diagram parsing.展开更多
The simple modules for electrical Lie algebra of type D5 were investigated.The sufficient and necessary criteria of the simple Z-graded highest weight modules were established by means of determining the singular vect...The simple modules for electrical Lie algebra of type D5 were investigated.The sufficient and necessary criteria of the simple Z-graded highest weight modules were established by means of determining the singular vectors of the Verma modules.The simple highest weight module is isomorphic to either that for the symplectic Lie algebra sp4 or Verma module.展开更多
SKINNY-64-64 is a lightweight block cipher with a 64-bit block length and key length,and it is mainly used on the Internet of Things(IoT).Currently,faults can be injected into cryptographic devices by attackers in a v...SKINNY-64-64 is a lightweight block cipher with a 64-bit block length and key length,and it is mainly used on the Internet of Things(IoT).Currently,faults can be injected into cryptographic devices by attackers in a variety of ways,but it is still difficult to achieve a precisely located fault attacks at a low cost,whereas a Hardware Trojan(HT)can realize this.Temperature,as a physical quantity incidental to the operation of a cryptographic device,is easily overlooked.In this paper,a temperature-triggered HT(THT)is designed,which,when activated,causes a specific bit of the intermediate state of the SKINNY-64-64 to be flipped.Further,in this paper,a THT-based algebraic fault analysis(THT-AFA)method is proposed.To demonstrate the effectiveness of the method,experiments on algebraic fault analysis(AFA)and THT-AFA have been carried out on SKINNY-64-64.In the THT-AFA for SKINNY-64-64,it is only required to activate the THT 3 times to obtain the master key with a 100%success rate,and the average time for the attack is 64.57 s.However,when performing AFA on this cipher,we provide a relation-ship between the number of different faults and the residual entropy of the key.In comparison,our proposed THT-AFA method has better performance in terms of attack efficiency.To the best of our knowledge,this is the first HT attack on SKINNY-64-64.展开更多
基金Supported by the National Natural Science Foundation of China(11501523,61673320)。
文摘A 2-dimension linguistic lattice implication algebra(2DL-LIA)can build a bridge between logical algebra and 2-dimension fuzzy linguistic information.In this paper,the notion of a Boolean element is proposed in a 2DL-LIA and some properties of Boolean elements are discussed.Then derivations on 2DL-LIAs are introduced and the related properties of derivations are investigated.Moreover,it proves that the derivations on 2DL-LIAs can be constructed by Boolean elements.
基金supported by the National Key Research and Development Project of China(2020YFA0714301)the National Natural Science Foundation of China(61833005)。
文摘Dear Editor,This letter deals with the set stabilization of stochastic Boolean control networks(SBCNs)by the pinning control strategy,which is to realize the full control for systems by imposing control inputs on a fraction of agents.
文摘Given a compact and regular Hausdorff measure space (X, μ), with μ a Radon measure, it is known that the generalised space M(X) of all the positive Radon measures on X is isomorphic to the space of essentially bounded functions L<sup>∞</sup>(X, μ) on X. We confirm that the commutative von Neumann algebras M⊂B(H), with H=L<sup>2</sup>(X, μ), are unitary equivariant to the maximal ideals of the commutative algebra C(X). Subsequenly, we use the measure groupoid to formulate the algebraic and topological structures of the commutative algebra C(X) following its action on M(X) and define its representation and ergodic dynamical system on the commutative von Neumann algebras of M of B(H) .
基金supported by the National Natural Science Foundation of China (62273201,62173209,72134004,62303170)the Research Fund for the Taishan Scholar Project of Shandong Province of China (TSTP20221103)。
文摘Set stabilization is one of the essential problems in engineering systems, and self-triggered control(STC) can save the storage space for interactive information, and can be successfully applied in networked control systems with limited communication resources. In this study, the set stabilization problem and STC design of Boolean control networks are investigated via the semi-tensor product technique. On the one hand, the largest control invariant subset is calculated in terms of the strongly connected components of the state transition graph, by which a graph-theoretical condition for set stabilization is derived. On the other hand, a characteristic function is exploited to determine the triggering mechanism and feasible controls. Based on this, the minimum-time and minimum-triggering open-loop, state-feedback and output-feedback STCs for set stabilization are designed,respectively. As classic applications of self-triggered set stabilization, self-triggered synchronization, self-triggered output tracking and self-triggered output regulation are discussed as well. Additionally, several practical examples are given to illustrate the effectiveness of theoretical results.
文摘The superiority of hypothetical quantum computers is not due to faster calculations but due to different scheme of calculations running on special hardware. At the same time, one should realize that quantum computers would only provide dramatic speedups for a few specific problems, for example, factoring integers and breaking cryptographic codes in the conventional quantum computing approach. The core of quantum computing follows the way a state of a quantum system is defined when basic things interact with each other. In the conventional approach, it is implemented through the tensor product of qubits. In the suggested geometric algebra formalism simultaneous availability of all the results for non-measured observables is based on the definition of states as points on a three-dimensional sphere, which is very different from the usual Hilbert space scheme.
基金partially supported by the Natural Sciences and Engineering Research Council of Canada(2019-03907)。
文摘In this paper,we define a new class of control functions through aggregate special functions.These class of control functions help us to stabilize and approximate a tri-additiveψ-functional inequality to get a better estimation for permuting tri-homomorphisms and permuting tri-derivations in unital C*-algebras and Banach algebras by the vector-valued alternative fixed point theorem.
基金Project (J51801) supported by Shanghai Education Commission Key DisciplineProject(08ZY79)supported by Shanghai Education Commission Research FundProject(DZ207004)supported by Shanghai Second Polytechnic University Fund
文摘Single input single output system was studied. With proportion, differential, integral results of deviation between given input and output as controller input, the logic rules in control process was analyzed, these logic rule with Pan-Boolean algebra was described, therefore a PID Pan-Boolean algebra control algorithm was obtained. The simulation results indicates that the new control algorithm is more effective compared to the traditional PID algorithm, having advantages such as more than 3 adjustable parameters of controllers, better result, and so on.
基金This work was supported by the National Natural Science Foundation of China under Grants No. 61103191, No. 61070215 the Funds of Key Lab of Fujian Province University Network Security and Cryptology under Crant No. 2011003 and the Open Research Fund of State Key Laboratory of Inforrmtion Security.
文摘To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to construct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is determined for the number of Boolean functions with maximum algebraic immunity.
基金Supported by a grant of National Natural Science Foundation of China(12001243,61976244,12171294,11961016)the Natural Science Basic Research Plan in Shaanxi Province of China(2020JQ-762,2021JQ-580)。
文摘In this paper, we review some of their related properties of derivations on MValgebras and give some characterizations of additive derivations. Then we prove that the fixed point set of Boolean additive derivations and that of their adjoint derivations are isomorphic.In particular, we prove that every MV-algebra is isomorphic to the direct product of the fixed point set of Boolean additive derivations and that of their adjoint derivations. Finally we show that every Boolean algebra is isomorphic to the algebra of all Boolean additive(implicative)derivations. These results also give the negative answers to two open problems, which were proposed in [Fuzzy Sets and Systems, 303(2016), 97-113] and [Information Sciences, 178(2008),307-316].
基金supported in part by the Natural Science Foundation of Guangdong Province,China(2021A 1515011847)Postgraduate Education Innovation Project of Guangdong Ocean University(202214,202250,202251,202159,202160)+1 种基金the Special Project in Key Fields of Universities in Department of Education of Guangdong Province(2019KZDZX1036)the Key Laboratory of Digital Signal and Image Processing of Guangdong Province(2019GDDSIPL-01)。
文摘Dear Editor, The time-dependent algebraic Riccati equation(TDARE) problem is applied to many optimal control industrial applications. It is susceptible to interference from measurement noises in the virtual environment, which current methods cannot effectively address. A normbased adaptive coefficient zeroing neural network(NACZNN) model to solve the TDARE problem is proposed.
文摘We introduce and investigate the properties of a generalization of the derivation of dendriform algebras. We specify all possible parameter values for the generalized derivations, which depend on parameters. We provide all generalized derivations for complex low-dimensional dendriform algebras.
文摘As an inorganic chemical,magnesium iodide has a significant crystalline structure.It is a complex and multifunctional substance that has the potential to be used in a wide range of medical advancements.Molecular graph theory,on the other hand,provides a sufficient and cost-effective method of investigating chemical structures and networks.M-polynomial is a relatively new method for studying chemical networks and structures in molecular graph theory.It displays numerical descriptors in algebraic form and highlights molecular features in the form of a polynomial function.We present a polynomials display of magnesium iodide structure and calculate several M-polynomials in this paper,particularly the M-polynomials of the augmented Zagreb index,inverse sum index,hyper Zagreb index and for the symmetric division index.
文摘The aim of this paper is to outline the conditions of a conformal hyperquaternion algebra H<sup>⊗2m</sup> in which a higher order plane curve can be described by generalizing the well-known cases of conics and cubic curves in 2D. In other words, the determination of the order of a plane curve through n points and its conformal hyperquaternion algebra H<sup>⊗2m</sup> is the object of this work.
文摘The ideas of ambiguous bipolar skepticism under algebra and closed skepticism ambiguous bipolar ideals and related features have been developed.The fuzzy measure ideal is described in terms of bipolar ambiguous measure algebra and bipolar skepticism,and the linkages between bipolar fuzzy measure algebra are determined.A bipolar misty ideal’s skepticism is examined.InBCW andBCL-measure algebra,homogeneous ideas and dubious pictures of fuzzy bipolar measure ideas are examined.Also,we gave the relationship between these concepts.Finally,it is given the perfect terms for an occult bipolar doubt to be a measure of ideal fuzzy bipolar closed doubt.
文摘A lot of combinatorial objects have a natural bialgebra structure. In this paper, we prove that the vector space spanned by labeled simple graphs is a bialgebra with the conjunction product and the unshuffle coproduct. In fact, it is a Hopf algebra since it is graded connected. The main conclusions are that the vector space spanned by labeled simple graphs arising from the unshuffle coproduct is a Hopf algebra and that there is a Hopf homomorphism from permutations to label simple graphs.
基金support provided by the Ministry of Science and Technology,Taiwan,ROC under Contract No.MOST 110-2221-E-019-044.
文摘How to accelerate the convergence speed and avoid computing the inversion of a Jacobian matrix is important in the solution of nonlinear algebraic equations(NAEs).This paper develops an approach with a splitting-linearizing technique based on the nonlinear term to reduce the effect of the nonlinear terms.We decompose the nonlinear terms in the NAEs through a splitting parameter and then linearize the NAEs around the values at the previous step to a linear system.Through the maximal orthogonal projection concept,to minimize a merit function within a selected interval of splitting parameters,the optimal parameters can be quickly determined.In each step,a linear system is solved by the Gaussian elimination method,and the whole iteration procedure is convergent very fast.Several numerical tests show the high performance of the optimal split-linearization iterative method(OSLIM).
基金supported by the National Natural Science Foundation of China (Nos.62177024,62007014)the Humanities and Social Sciences Youth Fund of the Ministry of Education (No.20YJC880024)+1 种基金China Post Doctoral Science Foundation (No.2019M652678)the Fundamental Research Funds for the Central Universities (No.CCNU20ZT019).
文摘A qualia role-based entity-dependency graph(EDG)is proposed to represent and extract quantity relations for solving algebra story problems stated in Chinese.Traditional neural solvers use end-to-end models to translate problem texts into math expressions,which lack quantity relation acquisition in sophisticated scenarios.To address the problem,the proposed method leverages EDG to represent quantity relations hidden in qualia roles of math objects.Algorithms were designed for EDG generation and quantity relation extraction for solving algebra story problems.Experimental result shows that the proposedmethod achieved an average accuracy of 82.2%on quantity relation extraction compared to 74.5%of baseline method.Another prompt learning result shows a 5%increase obtained in problem solving by injecting the extracted quantity relations into the baseline neural solvers.
基金supported by the National Natural Science Foundation of China(No.61977029)the Fundamental Research Funds for the Central Universities,CCNU(No.3110120001).
文摘Solving Algebraic Problems with Geometry Diagrams(APGDs)poses a significant challenge in artificial intelligence due to the complex and diverse geometric relations among geometric objects.Problems typically involve both textual descriptions and geometry diagrams,requiring a joint understanding of these modalities.Although considerable progress has been made in solving math word problems,research on solving APGDs still cannot discover implicit geometry knowledge for solving APGDs,which limits their ability to effectively solve problems.In this study,a systematic and modular three-phase scheme is proposed to design an algorithm for solving APGDs that involve textual and diagrammatic information.The three-phase scheme begins with the application of the statetransformer paradigm,modeling the problem-solving process and effectively representing the intermediate states and transformations during the process.Next,a generalized APGD-solving approach is introduced to effectively extract geometric knowledge from the problem’s textual descriptions and diagrams.Finally,a specific algorithm is designed focusing on diagram understanding,which utilizes the vectorized syntax-semantics model to extract basic geometric relations from the diagram.A method for generating derived relations,which are essential for solving APGDs,is also introduced.Experiments on real-world datasets,including geometry calculation problems and shaded area problems,demonstrate that the proposed diagram understanding method significantly improves problem-solving accuracy compared to methods relying solely on simple diagram parsing.
基金Fundamental Research Funds for the Central Universities,China(No.2232021G13)。
文摘The simple modules for electrical Lie algebra of type D5 were investigated.The sufficient and necessary criteria of the simple Z-graded highest weight modules were established by means of determining the singular vectors of the Verma modules.The simple highest weight module is isomorphic to either that for the symplectic Lie algebra sp4 or Verma module.
基金supported in part by the Natural Science Foundation of Heilongjiang Province of China(Grant No.LH2022F053)in part by the Scientific and technological development project of the central government guiding local(Grant No.SBZY2021E076)+2 种基金in part by the PostdoctoralResearch Fund Project of Heilongjiang Province of China(Grant No.LBH-Q21195)in part by the Fundamental Research Funds of Heilongjiang Provincial Universities of China(Grant No.145209146)in part by the National Natural Science Foundation of China(NSFC)(Grant No.61501275).
文摘SKINNY-64-64 is a lightweight block cipher with a 64-bit block length and key length,and it is mainly used on the Internet of Things(IoT).Currently,faults can be injected into cryptographic devices by attackers in a variety of ways,but it is still difficult to achieve a precisely located fault attacks at a low cost,whereas a Hardware Trojan(HT)can realize this.Temperature,as a physical quantity incidental to the operation of a cryptographic device,is easily overlooked.In this paper,a temperature-triggered HT(THT)is designed,which,when activated,causes a specific bit of the intermediate state of the SKINNY-64-64 to be flipped.Further,in this paper,a THT-based algebraic fault analysis(THT-AFA)method is proposed.To demonstrate the effectiveness of the method,experiments on algebraic fault analysis(AFA)and THT-AFA have been carried out on SKINNY-64-64.In the THT-AFA for SKINNY-64-64,it is only required to activate the THT 3 times to obtain the master key with a 100%success rate,and the average time for the attack is 64.57 s.However,when performing AFA on this cipher,we provide a relation-ship between the number of different faults and the residual entropy of the key.In comparison,our proposed THT-AFA method has better performance in terms of attack efficiency.To the best of our knowledge,this is the first HT attack on SKINNY-64-64.