While many metaheuristic optimization algorithms strive to address optimization challenges,they often grapple with the delicate balance between exploration and exploitation,leading to issues such as premature converge...
详细信息
While many metaheuristic optimization algorithms strive to address optimization challenges,they often grapple with the delicate balance between exploration and exploitation,leading to issues such as premature convergence,sensitivity to parameter settings,and difficulty in maintaining population *** response to these challenges,this study introduces the Chase,Pounce,and Escape(CPE)algorithm,drawing inspiration from predator-prey *** traditional optimization approaches,the CPE algorithm divides the population into two groups,each independently exploring the search space to efficiently navigate complex problem domains and avoid local *** incorporating a unique search mechanism that integrates both the average of the best solution and the current solution,the CPE algorithm demonstrates superior convergence ***,the inclusion of a pouncing process facilitates rapid movement towards optimal *** comprehensive evaluations across various optimization scenarios,including standard test functions,Congress on Evolutionary Computation(CEC)-2017 benchmarks,and real-world engineering challenges,the effectiveness of the CPE algorithm is *** consistently highlight the algorithm’s performance,surpassing that of other well-known optimization techniques,and achieving remarkable outcomes in terms of mean,best,and standard deviation values across different problem domains,underscoring its robustness and versatility.
The following question arises naturally in the study of graph streaming algorithms: Is there any graph problem which is "not too hard", in that it can be solved efficiently with total communication (nearly) ...
详细信息
ISBN:
(纸本)9783959773317
The following question arises naturally in the study of graph streaming algorithms: Is there any graph problem which is "not too hard", in that it can be solved efficiently with total communication (nearly) linear in the number n of vertices, and for which, nonetheless, any streaming algorithm with Oe(n) space (i.e., a semi-streaming algorithm) needs a polynomial nΩ(1) number of passes? Assadi, Chen, and Khanna [STOC 2019] were the first to prove that this is indeed the case. However, the lower bounds that they obtained are for rather non-standard graph problems. Our first main contribution is to present the first polynomial-pass lower bounds for natural "not too hard" graph problems studied previously in the streaming model: k-cores and degeneracy. We devise a novel communication protocol for both problems with near-linear communication, thus showing that k-cores and degeneracy are natural examples of "not too hard" problems. Indeed, previous work have developed single-pass semi-streaming algorithms for approximating these problems. In contrast, we prove that any semi-streaming algorithm for exactly solving these problems requires (almost) Ω(n1/3) passes. The lower bound follows by a reduction from a generalization of the hidden pointer chasing (HPC) problem of Assadi, Chen, and Khanna, which is also the basis of their earlier semi-streaming lower bounds. Our second main contribution is improved round-communication lower bounds for the underlying communication problems at the basis of these reductions: We improve the previous lower bound of Assadi, Chen, and Khanna for HPC to achieve optimal bounds for this problem. We further observe that all current reductions from HPC can also work with a generalized version of this problem that we call MultiHPC, and prove an even stronger and optimal lower bound for this generalization. These two results collectively allow us to improve the resulting pass lower bounds for semi-streaming algorithms by a polynomial factor, namely
The persistent challenges faced by sun-tracking systems include inefficient power production, wastage of energy, ineffective control, and high costs. Most of the existing systems are either static or dual-axis trackin...
详细信息
Communication technology has advanced dramatically amid the 21st century,increasing the security risk in safeguarding sensitive *** remote password authentication(RPA)scheme is the simplest cryptosystem that serves as...
详细信息
Communication technology has advanced dramatically amid the 21st century,increasing the security risk in safeguarding sensitive *** remote password authentication(RPA)scheme is the simplest cryptosystem that serves as the first line of defence against unauthorised entity *** the literature contains numerous RPA schemes,to the best of the authors’knowledge,only few schemes based on the integer factorisation problem(IFP)and the discrete logarithm problem(DLP)that provided a provision for session key agreement to ensure proper mutual ***,none of the previous schemes provided formal security proof using the random oracle ***,this study proposed an improved RPA scheme with session key establishment between user and *** design of the proposed RPA scheme is based on the widely established Dolev-Yao adversary ***,as the main contribution,a novel formal security analysis based on formal definitions of IFP and DLP under the random oracle model was *** proposed scheme’s performance was compared to that of other similar competitive schemes in terms of the transmission/computational cost and time *** findings revealed that the proposed scheme required higher memory storage costs in smart ***,the proposed scheme is more efficient regarding the transmission cost of login and response messages and the total time complexity compared to other scheme of similar security ***,the proposed scheme outperformed the other RPA schemes based on IFP and ***,the potential application of converting the RPA scheme to a user identification(UI)scheme is considered for future *** RPA and UI schemes are similar,the proposed approach can be expanded to develop a provably secure and efficientUI scheme based on IFP and DLP.
Diffusion models are emerging as a robust solution for achieving high-fidelity data denoising, often surpassing classical deep learning methods in quality under various conditions. Nonetheless, their slow training and...
详细信息
For attracting closed sets that are not compact we consider different formulations of input-to-state stability properties and related Lyapunov criteria. In the compact case, there exists a well-established hierarchy o...
详细信息
For attracting closed sets that are not compact we consider different formulations of input-to-state stability properties and related Lyapunov criteria. In the compact case, there exists a well-established hierarchy of such properties and some formulations have been quickly discarded as equivalent to input-to-state stability. In this paper we show for the noncompact case, several new phenomena appear. In particular, input-to-state stability (ISS) does not imply integral input-to-state stability, and ISS is not equivalent to integral-input-to-integral-state stability. The criteria are formulated in terms of measurement functions, which allows a uniform presentation of a number of related results.
Introduction: Vehicle crashes can be hazardous to public safety and may cause infrastructure damage. Risky driving significantly raises the possibility of the occurrence of a vehicle crash. As per statistics by the Wo...
详细信息
Introduction: Vehicle crashes can be hazardous to public safety and may cause infrastructure damage. Risky driving significantly raises the possibility of the occurrence of a vehicle crash. As per statistics by the World Health Organization (WHO), approximately 1.35 million people are involved in road traffic crashes resulting in loss of life or physical disability. WHO attributes events like over-speeding, drunken driving, distracted driving, dilapidated road infrastructure and unsafe practices such as non-use of helmets and seatbelts to road traffic accidents. As these driving events negatively affect driving quality and enhance the risk of a vehicle crash, they are termed as negative driving attributes. Methods: A multi-level hierarchical fuzzy rules-based computational model has been designed to capture risky driving by a driver as a driving risk index. Data from the onboard telematics device and vehicle controller area network is used for capturing the required information in a naturalistic way during actual driving conditions. Fuzzy rules-based aggregation and inference mechanisms have been designed to alert about the possibility of a crash due to the onset of risky driving. Results: On-board telematics data of 3213 sub-trips of 19 drivers has been utilized to learn long term risky driving attributes. Furthermore, the current trip assessment of these drivers demonstrates the efficacy of the proposed model in correctly modeling the driving risk index of all of them, including 7 drivers who were involved in a crash after the monitored trip. Conclusion: In this work, risky driving behavior has been associated not just with rash driving but also other contextual data like driver’s long-term risk aptitude and environmental context such as type of roads, traffic volume and weather conditions. Trip-wise risky driving behavior of six out of seven drivers, who had met with a crash during that trip, was correctly predicted during evaluation. Similarly, for the other 12
The modeling of an efficient classifier is a fundamental issue in automatic training involving a large volume of representative ***,automatic classification is a major task that entails the use of training methods cap...
详细信息
The modeling of an efficient classifier is a fundamental issue in automatic training involving a large volume of representative ***,automatic classification is a major task that entails the use of training methods capable of assigning classes to data objects by using the input activities presented to learn *** recognition of new elements is possible based on predefined *** detection systems suffer from numerous vulnerabilities during analysis and classification of data *** overcome this problem,new analysis methods should be derived so as to implement a relevant system to monitor circulated *** main objective of this study is to model and validate a heterogeneous traffic classifier capable of categorizing collected events within *** new model is based on a proposed machine learning algorithm that comprises an input layer,a hidden layer,and an output layer.A reliable training algorithm is proposed to optimize the weights,and a recognition algorithm is used to validate the *** is applied to the collected traffic prior to the analysis *** work aims to describe the mathematical validation of a new machine learning classifier for heterogeneous traffic and anomaly detection.
Artificial intelligence (AI) in healthcare, especially in medical imaging, faces challenges due to data scarcity and privacy concerns. Addressing these, we introduce Med-DDPM, a diffusion model designed for 3D semanti...
详细信息
In this paper,a two-step control method is proposed,leveraging the generalized Halanay inequality and existing finite-time stability theorems,to achieve finite-time synchronization for a class of neural networks with ...
In this paper,a two-step control method is proposed,leveraging the generalized Halanay inequality and existing finite-time stability theorems,to achieve finite-time synchronization for a class of neural networks with bounded time-varying *** the first step,the system state is attenuated from V （t0） to γV （t0） using the generalized Halanay inequality,where0<γ 1 is a free *** the second step,by applying existing finite-time stability theorems,the system state further decays from γV （t0） to *** on the above ideas,two novel finite-time stability lemmas for the error system are presented,and the convergence rate as well as the settling time is ***,the value of γ that results in the shortest settling time for the error system is also *** the help of the derived lemmas,several sufficient algebraic criteria are established to achieve finite-time synchronization between the considered delayed neural *** results of this paper not only improve the existing two-step control method but also overcome the limitations of certain one-step finite-time control ***,the validity and practical applicability of the obtained theoretical results are demonstrated through two numerical examples and an image protection experiment.
暂无评论