Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper presents a graph-based direct approach for distribution systems with PV nodes. The contribution of this paper mainly includes two points: First, without building the bus-injection to branch-current (BIBC) matrix and the branch-current to bus-voltage (BCBV) matrix, we based on graph theory develop an uniformed formulation between bus current injections and bus voltages for both radial and...
A Getz-Masden dynamic system 2 (GMDS2) is investigated in this paper. For the purpose of solving time-varying complex matrix inverse, we propose a TZ-type (i.e., Taylor-Zhang type) discrete Getz-Masden dynamic system 2; i.e., the proposed TZ-type discrete Getz-Masden dynamic system 2 is discretized by Taylor-Zhang discretization formula. The results of numerical experiments not only show the efficacy...
We show that high dimensional expanders imply derandomized direct product tests, with a number of subsets that is linear in the size of the universe.Direct product tests belong to a family of tests called agreement tests that are important components in PCP constructions and include, for example, low degree tests such as line vs. line and plane vs. plane.For a generic hypergraph, we introduce the...
This paper focuses on solving the ship course tracking problem by using Zhang dynamics (ZD) method and a new Zhang finite difference (ZFD) formula. Via ZD method, which is a powerful class of dynamics to solve online time-varying problems, the so called ZD controller of ship course tracking is designed. Then, a 1-node-ahead differentiation formula within ZFD framework termed as 4-node g-square finite...
In this paper the multidimensional pseudo-integrals are introduced. As a consequence of the obtained Fubini's type theorem for the pseudo-integral the generalized Minkowski type inequality for pseudo-integral is proposed.
Dempster's rule of combination is a core part in evidence theory. However, it may generate an unreasonable result when fusing conflicting evidences. For the sake of dealing with such a problem, a novel discounting method is proposed. Minimum singular value of BPA (basic probability assignment) matrix consisting of two BPAs corresponding to two evidences can measure the dissimilarity between these...
Self — organizing natural systems are inspirational to swarm robotics. The applications include social insect systems and social behaviours. The multi — agent tree formation is one of the communication topologies of swarm robotic system. The agents are linked in a tree to communicate with each other through the hierarchy. The focus of this work is to form tree using Transfer Learning (TL) of Reinforcement...
In this paper, we present a least-mean-square (LMS) adaptive filter tailored for bilinear forms. The bilinear term is defined with respect to the impulse responses of a spatiotemporal model, which resembles a multiple-input/single-output (MISO) system. A convergence analysis is also provided, outlining the main features of this algorithm. Simulation results support the theoretical findings.
In this paper, we propose sparsity-aware data-selective adaptive filtering algorithms with adjustable penalties. Prior work incorporates a penalty function into the cost function used in the optimization that originates the algorithms to improve their performance by exploiting sparsity. However, the strength of the penalty function is controlled by a scalar that is often a fixed parameter. In contrast...
In this paper, a new reaching law for discrete time systems is proposed and applied to obtain a sliding mode control strategy. The new strategy ensures a finite time convergence of the system representative point to the sliding surface and confines the state to a vicinity of this surface. The proposed strategy ensures switching in each time instant in the sliding phase, which means it is in line with...
Slot machines are the most popular facility in casinos worldwide. With the advancement of computer technology, the operating reel spinning of the current slot machine is presented by computer software emulation instead of rotating mechanical iron reels. The reel strip table of a slot machine has many special pictures embedded for different attractive themes. Each slot machine achieves a hit rate based...
This paper presents a hierarchical structure to solve the discrete time consensus problem for a group of agents. All the agents are divided into a couple of groups, and a new notation, called group information is proposed, which indicates all the agents' states inside one group. For each agent, it receives the information not only from the agent neighbors in the same group, but also the group information...
In this paper, a generalized convex network optimization problem with local domains and constraints is formulated and solved by using distributed multi-agent dynamics. Within the framework of the present network optimization, it is assumed that the local system states and constraints are available to an individual agent and each agent may only share information with its neighbors. A distributed PI-based...
In this paper, a GZ-type complex neuronet (generated by combining gradient dynamic system and Zhang dynamic system) is illustrated and discretized into an Euler-discretized (i.e., discretized by Euler forward rule) GZ-type complex neuronet for computing real-time varying complex matrix inverse. Simulation results not only show the efficacy of the proposed Euler-discretized GZ-type neuronet but also...
We present some results concerning the representation of unconditionally convergent multipliers, including a reformulation of a conjecture of Balazs and Stoeva.
The goal of Nonnegative Matrix Factorization (NMF) is to represent a large nonnegative matrix in an approximate way as a product of two significantly smaller nonnega- tive matrices. In comparison to other algorithms to calculate the NMF, Newton-type methods can be parallelized very well because Newton iterations can be performed in parallel without exchanging data between processes. However, these...
To intercept stationary targets at desired impact angle, the three-dimensional terminal guidance problem has been investigated in this paper. Different from the traditional method of decoupling the engagement dynamics into two mutually orthogonal two-dimensional planes, the guidance law design is studied using three-dimensional coupled engagement dynamics. Because of the short terminal guidance time,...
The finite-time tracking control for reusable launch vehicle with matched disturbance is investigated. An adaptive-multivariable controller is proposed where the bounds of the perturbations are not known. A proof of the finite-time convergence of the closed-loop system is derived using the Lyapunov technique. The feature of the proposed control scheme is that it does not require any information on...
A modified PRP conjugate gradient method is proposed in this paper based on the modified secant equation. The main properties of the new method are described as follows: (i) the parameter βk has not only gradient value information but also function value information; (ii) βk ≥ 0, ∀ k; (iii) the search direction generated by the presented method possesses both the sufficient descent and trust region...
We propose a new Iteratively Reweighted Least Squares (IRLS) algorithm for the problem of recovering a matrix X ∈ ℝd1 × d2 of rank r ≪ min(d1, d2) from incomplete linear observations, solving a sequence of quadratic problems. The easily implementable algorithm, which we call Harmonic Mean Iteratively Reweighted Least Squares (HM-IRLS), is superior compared to state-of-the-art algorithms for the low-rank...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.