This paper proves that the restriction of a Specht module for a(degenerate or non-degenerate)cyclotomic Hecke algebra, or KLR(Khovanov-Lauda-Rouquier) algebra, of type A has a Specht filtration.
A comparison of two modular linear permanent-magnet vernier(LPMV)machines is presented.A modular LPMV machine with a partitioned primary,which can significantly improve the modulation effect,is proposed.Benefitting fr...A comparison of two modular linear permanent-magnet vernier(LPMV)machines is presented.A modular LPMV machine with a partitioned primary,which can significantly improve the modulation effect,is proposed.Benefitting from the partition design,the space conflict between the permanent magnet(PM)and the armature magnetic field is relieved.First,the topologies of modular LPMV machines with and without a partitioned primary are presented.Then,the effect of the partitioned primary on the modular LPMV machine is analyzed using flux modulation theory.Moreover,analytical expressions for the trapezoidal permeance are derived.In addition,the harmonic components,back electromotive forces,and thrust forces of the machines with and without the partitioned primary are comparatively analyzed.The results reveal that the thrust force density of the LPMV machine with a partitioned primary is increased by 32.3%.Finally,experiments are performed on a prototype machine for validation.展开更多
The ability to solve various constraints is a principal factor of automatic constraint solvers. Most object-oriented languages treat a character string as a primitive data type which is manipulated by string library f...The ability to solve various constraints is a principal factor of automatic constraint solvers. Most object-oriented languages treat a character string as a primitive data type which is manipulated by string library functions. Most constraint solvers have limitations on their input constraints, such as strong restrictions on the expressiveness of constraints or lack of the ability to solve hybrid constraints. These limitations hinder applying automated constraint solvers on program analysis techniques for programs containing strings and string manipulation functions. We propose an approach to automatically solve program constraints involving strings and string manipulation functions. Based on the character array model, we design a constraint language which contains primitive operations to precisely describe the constraints of commonly used string manipulation functions. The translated string constraints together with numeric constraints are then solved by a two- phase test generation procedure: firstly, a partial solution is obtained to satisfy the arithmetic constraints of the position variables, and the solution is utilized to simplify the string constraints into pure character array constraints; secondly, the pure array constraints are solved by an off-the-shelf array-specific theory based constraint solver. We integrate the approach into an automated testing tool to support the generation of string test cases, and then perform experiments. The results of the experiments prove that the integration of the proposed approach promotes the testing coverage of the existing testing tool, and the integrated tool has an advantage of handling specific string manipulation functions compared with an existing string solver.展开更多
文摘This paper proves that the restriction of a Specht module for a(degenerate or non-degenerate)cyclotomic Hecke algebra, or KLR(Khovanov-Lauda-Rouquier) algebra, of type A has a Specht filtration.
基金Supported in part by the National Natural Science Foundation of China under Grant 51977099in part by the National Natural Science Foundation of Jiangsu Higher Education Institutions under Grant 22KJB470010.
文摘A comparison of two modular linear permanent-magnet vernier(LPMV)machines is presented.A modular LPMV machine with a partitioned primary,which can significantly improve the modulation effect,is proposed.Benefitting from the partition design,the space conflict between the permanent magnet(PM)and the armature magnetic field is relieved.First,the topologies of modular LPMV machines with and without a partitioned primary are presented.Then,the effect of the partitioned primary on the modular LPMV machine is analyzed using flux modulation theory.Moreover,analytical expressions for the trapezoidal permeance are derived.In addition,the harmonic components,back electromotive forces,and thrust forces of the machines with and without the partitioned primary are comparatively analyzed.The results reveal that the thrust force density of the LPMV machine with a partitioned primary is increased by 32.3%.Finally,experiments are performed on a prototype machine for validation.
基金This work was partially supported by the National Natural Science Foundation of China under Grant Nos. 61202080, 61702044, and 61502029.
文摘The ability to solve various constraints is a principal factor of automatic constraint solvers. Most object-oriented languages treat a character string as a primitive data type which is manipulated by string library functions. Most constraint solvers have limitations on their input constraints, such as strong restrictions on the expressiveness of constraints or lack of the ability to solve hybrid constraints. These limitations hinder applying automated constraint solvers on program analysis techniques for programs containing strings and string manipulation functions. We propose an approach to automatically solve program constraints involving strings and string manipulation functions. Based on the character array model, we design a constraint language which contains primitive operations to precisely describe the constraints of commonly used string manipulation functions. The translated string constraints together with numeric constraints are then solved by a two- phase test generation procedure: firstly, a partial solution is obtained to satisfy the arithmetic constraints of the position variables, and the solution is utilized to simplify the string constraints into pure character array constraints; secondly, the pure array constraints are solved by an off-the-shelf array-specific theory based constraint solver. We integrate the approach into an automated testing tool to support the generation of string test cases, and then perform experiments. The results of the experiments prove that the integration of the proposed approach promotes the testing coverage of the existing testing tool, and the integrated tool has an advantage of handling specific string manipulation functions compared with an existing string solver.