In the article, an adaptive fixed-time reinforcement learning (RL) optimized control policy is given for nonlinear systems. Radial basis function neural networks (RBFNNs) are exploited to fit uncertain nonlinearities ...
详细信息
Let V be a set of n vertices, M a set of m labels, and let R be an m × n matrix of independent Bernoulli random variables with probability of success p;columns of R are incidence vectors of label sets assigned to...
详细信息
ISBN:
(纸本)9783959772143
Let V be a set of n vertices, M a set of m labels, and let R be an m × n matrix of independent Bernoulli random variables with probability of success p;columns of R are incidence vectors of label sets assigned to vertices. A random instance G(V, E, RT R) of the weighted random intersection graph model is constructed by drawing an edge with weight equal to the number of common labels (namely [RT R]v,u) between any two vertices u, v for which this weight is strictly larger than 0. In this paper we study the average case analysis of Weighted Max Cut, assuming the input is a weighted random intersection graph, i.e. given G(V, E, RT R) we wish to find a partition of V into two sets so that the total weight of the edges having exactly one endpoint in each set is maximized. In particular, we initially prove that the weight of a maximum cut of G(V, E, RT R) is concentrated around its expected value, and then show that, when the number of labels is much smaller than the number of vertices (in particular, m = nα, α Θ(1)n), we show that with high probability, a majority type randomized algorithm outputs a cut with weight that is larger than the weight of a random cut by a multiplicative constant strictly larger than 1. Then, we formally prove a connection between the computational problem of finding a (weighted) maximum cut in G(V, E, RT R) and the problem of finding a 2-coloring that achieves minimum discrepancy for a set system Σ with incidence matrix R (i.e. minimum imbalance over all sets in Σ). We exploit this connection by proposing a (weak) bipartization algorithm for the case m = n, p = Θ(1)n that, when it terminates, its output can be used to find a 2-coloring with minimum discrepancy in a set system with incidence matrix R. In fact, with high probability, the latter 2-coloring corresponds to a bipartition with maximum cut-weight in G(V, E, RT R). Finally, we prove that our (weak) bipartization algorithm terminates in polynomial time, with high probability, at least w
The “Dopamiini” wheelchair, which integrates four control systems and a personalized AI chatbot to help older people overcome their obstacles and loneliness, was developed in this paper. This prototype was construct...
详细信息
ISBN:
(数字)9798350355499
ISBN:
(纸本)9798350355505
The “Dopamiini” wheelchair, which integrates four control systems and a personalized AI chatbot to help older people overcome their obstacles and loneliness, was developed in this paper. This prototype was constructed using the GPT-3 API for chatbot functionality and the Python library pyttsx3 for offline text-to-speech conversion. When it comes to obstacle recognition, our proposed wheelchair shows an error of no more than ± 0.4 cm up to a distance of 400 cm. It takes an average of 5.6 seconds to reach the maximum speed. In order to monitor and regulate its performance in real time, this is equipped with a dashboard and a GPS navigation system. To make the prototype portable and effective, its weight is close to 2.7 kg.
In this paper, the concepts and techniques for global graph clustering are examined, or the process of locating related clusters of vertices within a graph. We introduce the construction of a graph clustering techniqu...
详细信息
A systematic method for designing reconfigurable compact multiple-input multiple-output (MIMO) antennas is described. This method is based on the analysis of a general loaded N - port structure in beamspace domain and...
详细信息
The generation and spread of rumors are phenomenon that cannot be eradicated in human society. However, the wanton spread of rumors will harm the development of society, especially in the current era of information. T...
详细信息
Compared to traditional biometric systems, in-air signatures are considered more robust and secure than classical pen paper. A few datasets capturing in-air signatures have been introduced, utilizing various devices s...
详细信息
The paper investigated the problem of using IoT data transmission technologies in the absence or underdeveloped network infrastructure. As a result of a study of the technologies used in the IoT for data transmission,...
详细信息
The design of deep neural networks (DNNs), which in essence concerns the choice of specific values for their hyperparameters, is a very involved process that provides very big challenges to researchers and designers. ...
详细信息
An inverse design approach to find Bound States in the Continuum (BIC), at a specified wavelength, in all-Dielectric metasurfaces is proposed using Deep Reinforcement Learning (Deep-RL) algorithm. The method is time e...
详细信息
ISBN:
(数字)9798350366365
ISBN:
(纸本)9798350366372
An inverse design approach to find Bound States in the Continuum (BIC), at a specified wavelength, in all-Dielectric metasurfaces is proposed using Deep Reinforcement Learning (Deep-RL) algorithm. The method is time efficient, and a muti-objective optimization is presented. To demonstrate, a Si split ring is designed in the Fiber-optic communication band that shows a symmetryprotected BIC at a wavelength around 1580 nm.
暂无评论