期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Application of composite nonlinear feedback control approach to linear and nonlinear systems 被引量:2
1
作者 H Ebrahimi MOLLABASHI A H MAZINAN H HAMIDI 《Journal of Central South University》 SCIE EI CAS CSCD 2019年第1期98-105,共8页
The objective of this research is to realize a composite nonlinear feedback control approach for a class of linear and nonlinear systems with parallel-distributed compensation along with sliding mode control technique... The objective of this research is to realize a composite nonlinear feedback control approach for a class of linear and nonlinear systems with parallel-distributed compensation along with sliding mode control technique.The proposed composite nonlinear feedback control approach consists of two parts.In a word,the first part provides the stability of the closed-loop system and the fast convergence response,as long as the second one improves transient response.In this research,the genetic algorithm in line with the fuzzy logic is designed to calculate constant controller coefficients and optimize the control effort.The effectiveness of the proposed design is demonstrated by servo position control system and inverted pendulum system with DC motor simulation results. 展开更多
关键词 composite nonlinear feedback parallel-distributed compensation sliding mode controller OPTIMIZATION
在线阅读 下载PDF
Research on Different Heuristics for Minimax Algorithm Insight from Connect-4 Game 被引量:2
2
作者 Xiyu Kang Yiqi Wang Yanrui Hu 《Journal of Intelligent Learning Systems and Applications》 2019年第2期15-31,共17页
Minimax algorithm and machine learning technologies have been studied for decades to reach an ideal optimization in game areas such as chess and backgammon. In these fields, several generations try to optimize the cod... Minimax algorithm and machine learning technologies have been studied for decades to reach an ideal optimization in game areas such as chess and backgammon. In these fields, several generations try to optimize the code for pruning and effectiveness of evaluation function. Thus, there are well-armed algorithms to deal with various sophisticated situations in gaming occasion. However, as a traditional zero-sum game, Connect-4 receives less attention compared with the other members of its zero-sum family using traditional minimax algorithm. In recent years, new generation of heuristics is created to address this problem based on research conclusions, expertise and gaming experiences. However, this paper mainly introduced a self-developed heuristics supported by well-demonstrated result from researches and our own experiences which fighting against the available version of Connect-4 system online. While most previous works focused on winning algorithms and knowledge based approaches, we complement these works with analysis of heuristics. We have conducted three experiments on the relationship among functionality, depth of searching and number of features and doing contrastive test with sample online. Different from the sample based on summarized experience and generalized features, our heuristics have a basic concentration on detailed connection between pieces on board. By analysing the winning percentages when our version fights against the online sample with different searching depths, we find that our heuristics with minimax algorithm is perfect on the early stages of the zero-sum game playing. Because some nodes in the game tree have no influence on the final decision of minimax algorithm, we use alpha-beta pruning to decrease the number of meaningless node which greatly increases the minimax efficiency. During the contrastive experiment with the online sample, this paper also verifies basic characters of the minimax algorithm including depths and quantity of features. According to the experiment, these two characters can both effect the decision for each step and none of them can be absolutely in charge. Besides, we also explore some potential future issues in Connect-4 game optimization such as precise adjustment on heuristic values and inefficiency pruning on the search tree. 展开更多
关键词 HEURISTICS MINIMAX Algorithm ZERO-SUM GAME Connect-4 GAME
暂未订购
E-voting system using cloud-based hybrid blockchain technology
3
作者 Beulah Jayakumari S Lilly Sheeba +4 位作者 Maya Eapen Jani Anbarasi Vinayakumar Ravi A.Suganya Malathy Jawahar 《Journal of Safety Science and Resilience》 EI CSCD 2024年第1期102-109,共8页
With the invention of Internet-enabled devices,cloud and blockchain-based technologies,an online voting system can smoothly carry out election processes.During pandemic situations,citizens tend to develop panic about ... With the invention of Internet-enabled devices,cloud and blockchain-based technologies,an online voting system can smoothly carry out election processes.During pandemic situations,citizens tend to develop panic about mass gatherings,which may influence the decrease in the number of votes.This urges a reliable,flexible,transparent,secure,and cost-effective voting system.The proposed online voting system using cloud-based hybrid blockchain technology eradicates the flaws that persist in the existing voting system,and it is carried out in three phases:the registration phase,vote casting phase and vote counting phase.A timestamp-based authentication protocol with digital signature validates voters and candidates during the registration and vote casting phases.Using smart contracts,third-party interventions are eliminated,and the transactions are secured in the blockchain network.Finally,to provide accurate voting results,the practical Byzantine fault tolerance(PBFT)consensus mechanism is adopted to ensure that the vote has not been modified or corrupted.Hence,the overall performance of the proposed system is significantly better than that of the existing system.Further performance was analyzed based on authentication delay,vote alteration,response time,and latency. 展开更多
关键词 E-VOTING CLOUD Blockchain Smart contract Consensus mechanism
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部