We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping...We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping is continuous and f-pseudomonotone with nonempty compact convex values on dom（f）, where f ： Rn --RU{＋∞} is a proper func- tion. The algorithm presented in this paper generalize and improve some known algorithms in literatures. Preliminary computational experience is also reported.展开更多
In this paper a novel class of neural networks called generalized congruence neural networks (GCNN) is proposed. All neurons in the neural networks are activated in the form of congruence. The architectures, learnin...In this paper a novel class of neural networks called generalized congruence neural networks (GCNN) is proposed. All neurons in the neural networks are activated in the form of congruence. The architectures, learning rules and two algorithms are presented. Simulation results indicate that such network has satisfactory generalization properties near the sample points. Since this kind of neural nets can be easily operated and implemented, it is appropriate to make further research concerning the theory and applications of GCNN.展开更多
This paper develops a generalized scalar auxiliary variable(SAV)method for the time-dependent Ginzburg-Landau equations.The backward Euler method is used for discretizing the temporal derivative of the time-dependent ...This paper develops a generalized scalar auxiliary variable(SAV)method for the time-dependent Ginzburg-Landau equations.The backward Euler method is used for discretizing the temporal derivative of the time-dependent Ginzburg-Landau equations.In this method,the system is decoupled and linearized to avoid solving the non-linear equation at each step.The theoretical analysis proves that the generalized SAV method can preserve the maximum bound principle and energy stability,and this is confirmed by the numerical result,and also shows that the numerical algorithm is stable.展开更多
By applying the auxiliary variational principle technique, the existence of solutions for a new class of generalized mixed implicit quasi-variational-like inequalities and the convergence criteria of a new iterative a...By applying the auxiliary variational principle technique, the existence of solutions for a new class of generalized mixed implicit quasi-variational-like inequalities and the convergence criteria of a new iterative algorithm to compute approximate solutions are proved in Hilbert spaces. The obtained result is a improvement over and generalization of the main theorem proposed by Ding.展开更多
A new class of bilcvel generalized mixed equilibrium problems involving setvalued mappings is introduced and studied in a real Banach space. By using the auxiliary principle technique, new iterative algorithms for sol...A new class of bilcvel generalized mixed equilibrium problems involving setvalued mappings is introduced and studied in a real Banach space. By using the auxiliary principle technique, new iterative algorithms for solving the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems involving set-valued mappings are suggested and analyzed. Existence of solutions and strong convergence of the iterative sequences generated by the algorithms are proved under quite mild conditions. The behavior of the solution set of the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems is also discussed. These results are new and generalize some recent results in this field.展开更多
Discovering cyclic generalized association rules from transaction datbases can reveal the relationship of differ-ent levels of the taxonomies and display cyclic variations over time.Information about such variations i...Discovering cyclic generalized association rules from transaction datbases can reveal the relationship of differ-ent levels of the taxonomies and display cyclic variations over time.Information about such variations is great use of better identifying trends in associations and forecast-ing.Because cyclic rules are quite sensitive to a littlenoise,this paper uses the noise-ratio as the criterion of i-dentifing cydclic itemsets for dealing with the problem and utilizes the cycle-pruning technique to reduce the comput-ing time of the data mining process by exploiting the real-tionship between the cycle and generalized frequent item-sets.The paper gives the algorithm of mining cyclic gen-eralized itemsets(CGI).Experiment shows that the CGI algorithm can efficiently yield results.展开更多
Due to the intermittency and instability of Wind-Solar energy and easy compensation of hydropower, this study proposes a Wind-Solar-Hydro power optimal scheduling model. This model is aimed at maximizing the total sys...Due to the intermittency and instability of Wind-Solar energy and easy compensation of hydropower, this study proposes a Wind-Solar-Hydro power optimal scheduling model. This model is aimed at maximizing the total system power generation and the minimum ten-day joint output. To effectively optimize the multi-objective model, a new algorithm named non-dominated sorting culture differential evolution algorithm(NSCDE) is proposed. The feasibility of NSCDE was verified through several well-known benchmark problems. It was then applied to the Jinping Wind-Solar-Hydro complementary power generation system. The results demonstrate that NSCDE can provide decision makers a series of optimized scheduling schemes.展开更多
A novel interoperability test sequences optimization scheme is proposed in which the genetic algorithm （GA） is used to obtain the minimal-length interoperability test sequences. During our work, the basic interopera...A novel interoperability test sequences optimization scheme is proposed in which the genetic algorithm （GA） is used to obtain the minimal-length interoperability test sequences. During our work, the basic interoperability test sequences are generated based on the minimal-complete-coverage criterion, which removes the redundancy from conformance test sequences. Then interoperability sequences minimization problem can be considered as an instance of the set covering problem, and the GA is applied to remove redundancy in interoperability transitions. The results show that compared to conventional algorithm, the proposed algorithm is more practical to avoid the state space explosion problem, for it can reduce the length of the test sequences and maintain the same transition coverage.展开更多
A novel multi-chip module(MCM) interconnect test generation scheme based on ant algorithm(AA) with mutation operator was presented.By combing the characteristics of MCM interconnect test generation,the pheromone updat...A novel multi-chip module(MCM) interconnect test generation scheme based on ant algorithm(AA) with mutation operator was presented.By combing the characteristics of MCM interconnect test generation,the pheromone updating rule and state transition rule of AA is designed.Using mutation operator,this scheme overcomes ordinary AA’s defects of slow convergence speed,easy to get stagnate,and low ability of full search.The international standard MCM benchmark circuit provided by the MCNC group was used to verify the approach.The results of simulation experiments,which compare to the results of standard ant algorithm,genetic algorithm(GA) and other deterministic interconnecting algorithms,show that the proposed scheme can achieve high fault coverage,compact test set and short CPU time,that it is a newer optimized method deserving research.展开更多
To minimize the reactive power of the converter of the control winding in the novel dual stator-winding induction generator based on the PWM converter, design features of the induction generator with a rectified load ...To minimize the reactive power of the converter of the control winding in the novel dual stator-winding induction generator based on the PWM converter, design features of the induction generator with a rectified load are proposed. The optimization method of excited capacitors to minimize the reactive power of the control winding at a variable speed is given. The calculation capacity of the machine with a diode bridge rectifier load is proposed. To achieve global searching, the integrated method with the improved real-coded genetic algorithm and the twodimensional finite element method （FEM） is introduced. Design results of the sample show that reactive power can be reduced by the method, and the converter capacity can be decreased to 1/3 of output rated power at the speed ratio of 1 ： 3, thus reducing the volume and the mass of the inverter.展开更多
基金supported by the Scientific Research Foundation of Sichuan Normal University(20151602)National Natural Science Foundation of China(10671135,61179033)and the Key Project of Chinese Ministry of Education(212147)
文摘We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping is continuous and f-pseudomonotone with nonempty compact convex values on dom（f）, where f ： Rn --RU{＋∞} is a proper func- tion. The algorithm presented in this paper generalize and improve some known algorithms in literatures. Preliminary computational experience is also reported.
文摘In this paper a novel class of neural networks called generalized congruence neural networks (GCNN) is proposed. All neurons in the neural networks are activated in the form of congruence. The architectures, learning rules and two algorithms are presented. Simulation results indicate that such network has satisfactory generalization properties near the sample points. Since this kind of neural nets can be easily operated and implemented, it is appropriate to make further research concerning the theory and applications of GCNN.
基金supported by the National Natural Science Foundation of China(12126318,12126302).
文摘This paper develops a generalized scalar auxiliary variable(SAV)method for the time-dependent Ginzburg-Landau equations.The backward Euler method is used for discretizing the temporal derivative of the time-dependent Ginzburg-Landau equations.In this method,the system is decoupled and linearized to avoid solving the non-linear equation at each step.The theoretical analysis proves that the generalized SAV method can preserve the maximum bound principle and energy stability,and this is confirmed by the numerical result,and also shows that the numerical algorithm is stable.
文摘By applying the auxiliary variational principle technique, the existence of solutions for a new class of generalized mixed implicit quasi-variational-like inequalities and the convergence criteria of a new iterative algorithm to compute approximate solutions are proved in Hilbert spaces. The obtained result is a improvement over and generalization of the main theorem proposed by Ding.
基金supported by the Scientific Research Fun of Sichuan Normal University (11ZDL01)the Sichuan Province Leading Academic Discipline Project (SZD0406)
文摘A new class of bilcvel generalized mixed equilibrium problems involving setvalued mappings is introduced and studied in a real Banach space. By using the auxiliary principle technique, new iterative algorithms for solving the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems involving set-valued mappings are suggested and analyzed. Existence of solutions and strong convergence of the iterative sequences generated by the algorithms are proved under quite mild conditions. The behavior of the solution set of the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems is also discussed. These results are new and generalize some recent results in this field.
文摘Discovering cyclic generalized association rules from transaction datbases can reveal the relationship of differ-ent levels of the taxonomies and display cyclic variations over time.Information about such variations is great use of better identifying trends in associations and forecast-ing.Because cyclic rules are quite sensitive to a littlenoise,this paper uses the noise-ratio as the criterion of i-dentifing cydclic itemsets for dealing with the problem and utilizes the cycle-pruning technique to reduce the comput-ing time of the data mining process by exploiting the real-tionship between the cycle and generalized frequent item-sets.The paper gives the algorithm of mining cyclic gen-eralized itemsets(CGI).Experiment shows that the CGI algorithm can efficiently yield results.
基金supported by the National Key R&D Program of China (2016YFC0402209)the Major Research Plan of the National Natural Science Foundation of China (No. 91647114)
文摘Due to the intermittency and instability of Wind-Solar energy and easy compensation of hydropower, this study proposes a Wind-Solar-Hydro power optimal scheduling model. This model is aimed at maximizing the total system power generation and the minimum ten-day joint output. To effectively optimize the multi-objective model, a new algorithm named non-dominated sorting culture differential evolution algorithm(NSCDE) is proposed. The feasibility of NSCDE was verified through several well-known benchmark problems. It was then applied to the Jinping Wind-Solar-Hydro complementary power generation system. The results demonstrate that NSCDE can provide decision makers a series of optimized scheduling schemes.
文摘A novel interoperability test sequences optimization scheme is proposed in which the genetic algorithm （GA） is used to obtain the minimal-length interoperability test sequences. During our work, the basic interoperability test sequences are generated based on the minimal-complete-coverage criterion, which removes the redundancy from conformance test sequences. Then interoperability sequences minimization problem can be considered as an instance of the set covering problem, and the GA is applied to remove redundancy in interoperability transitions. The results show that compared to conventional algorithm, the proposed algorithm is more practical to avoid the state space explosion problem, for it can reduce the length of the test sequences and maintain the same transition coverage.
文摘A novel multi-chip module(MCM) interconnect test generation scheme based on ant algorithm(AA) with mutation operator was presented.By combing the characteristics of MCM interconnect test generation,the pheromone updating rule and state transition rule of AA is designed.Using mutation operator,this scheme overcomes ordinary AA’s defects of slow convergence speed,easy to get stagnate,and low ability of full search.The international standard MCM benchmark circuit provided by the MCNC group was used to verify the approach.The results of simulation experiments,which compare to the results of standard ant algorithm,genetic algorithm(GA) and other deterministic interconnecting algorithms,show that the proposed scheme can achieve high fault coverage,compact test set and short CPU time,that it is a newer optimized method deserving research.
文摘To minimize the reactive power of the converter of the control winding in the novel dual stator-winding induction generator based on the PWM converter, design features of the induction generator with a rectified load are proposed. The optimization method of excited capacitors to minimize the reactive power of the control winding at a variable speed is given. The calculation capacity of the machine with a diode bridge rectifier load is proposed. To achieve global searching, the integrated method with the improved real-coded genetic algorithm and the twodimensional finite element method （FEM） is introduced. Design results of the sample show that reactive power can be reduced by the method, and the converter capacity can be decreased to 1/3 of output rated power at the speed ratio of 1 ： 3, thus reducing the volume and the mass of the inverter.
