In the present paper, we introduce a self-adaptive algorithm for solving the split common fixed point problem of demicontractive operators in real Hilbert spaces. Weak convergence result is discussed under suitable as...
详细信息
This is the third special issue of Journal of Computational Science, following the series of Workshops entitled Agent-Based Simulations, adaptive algorithms, and Solvers (ABS-AAS) in the frame of the series of Interna...
详细信息
This is the third special issue of Journal of Computational Science, following the series of Workshops entitled Agent-Based Simulations, adaptive algorithms, and Solvers (ABS-AAS) in the frame of the series of International Conferences on Computational Science (ICCS). In this special issue, we present papers from three different aspects of computational science. The first group of papers concerns soft computing performed using agents, which make individual decisions and performing actions based on their observations of the computing environment. The second group of papers concerns hard simulations performed using finite element method. We focus here either on adaptive finite element method (hp-FEM) or modern isogeometric analysis (IGA-FEM) techniques. Finally, we emphasize the third group of papers, concerning adaptive solvers, for both Soft and hard simulations, utilizing additional knowledge about the topological structure of the mesh, or some memetic algorithms, allowing for local adjustments of the muli-objective optimization techniques. The series of ABS-AAS workshops is organized by five co-chairmens, including Maciej Paszyfiski, Robert Schaefer and Krzysztof Cetnarowicz from AGH University, Krakow, Poland, David Pardo from the University of the Basque Country, Bilbao, Spain and Victor Calo from King Abdullah University of Science and Technology. (C) 2016 Elsevier B.V. All rights reserved.
Efficiently synchronizing data with external sources, such as social media feeds, while minimizing well-timed requests is a challenge in various domains. This research investigates prediction algorithms for determinin...
详细信息
ISBN:
(纸本)9798400704093
Efficiently synchronizing data with external sources, such as social media feeds, while minimizing well-timed requests is a challenge in various domains. This research investigates prediction algorithms for determining appropriate update intervals for Facebook and Twitter feeds, considering metrics such as the delay (time between a post's publication and retrieval) and requests per post. Due to variations in update intervals, different algorithms yield diverse results. Selecting the most suitable algorithm for each feed is a time-consuming but crucial task for achieving optimal resource usage. We propose three strategies for algorithm selection: baseline (using a single algorithm per feed), optimum (calculating the best algorithm for each feed), and classification (identifying algorithms through classification). Real-world data from Facebook and Twitter are used to evaluate the strategies, comprehensively assessing their strengths and weaknesses. Findings demonstrate that the strategy optimum identifies the best algorithms, while the strategy classification selects fairly good algorithms at significantly reduced computational effort.
作者：
Baran, IDemaine, EDMIT
Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA
We consider a general model for representing and manipulating parametric curves, in which a curve is specified by a black box mapping a parameter value between 0 and 1 to a point in Euclidean d-space. In this model, w...
详细信息
We consider a general model for representing and manipulating parametric curves, in which a curve is specified by a black box mapping a parameter value between 0 and 1 to a point in Euclidean d-space. In this model, we consider the nearest-point-on-curve and farthest-point-on-curve problems: given a curve C and a point p, find a point on C nearest to p or farthest from p. In the general black-box model, no algorithm can solve these problems. Assuming a known bound on the speed of the curve (a Lipschitz condition), the answer can be estimated up to an additive error of epsilon using O(1/epsilon) samples, and this bound is tight in the worst case. However, many instances can be solved with substantially fewer samples, and we give algorithms that adapt to the inherent difficulty of the particular instance, up to a logarithmic factor. More precisely, if OPT(C, p, epsilon) is the minimum number of samples of C that every correct algorithm must perform to achieve tolerance epsilon, then our algorithm performs O(OPT(C, p, epsilon) log(epsilon(-1)/OPT(C, p, epsilon))) samples. Furthermore, any algorithm requires Omega(k log(epsilon(-1)/k)) samples for some instance C' with OPT(C', p, epsilon)=k;except that, for the nearest-point-on-curve problem when the distance between C and p is less than epsilon, OPT is 1 but the upper and lower bounds on the number of samples are both Theta(1/epsilon). When bounds on relative error are desired, we give algorithms that perform O(***(2+(1+epsilon(-1)).m(-1)/OPT)) samples (where m is the exact minimum or maximum distance from p to C) and prove that Omega(***(1/epsilon samples are necessary on some problem instances.
Several different algorithms to measure physical parameters (especially, current-voltage characteristics) under fixed and variable temperature are presented here. Specifically, these algorithms are intended to achieve...
详细信息
ISBN:
(纸本)9781538657102
Several different algorithms to measure physical parameters (especially, current-voltage characteristics) under fixed and variable temperature are presented here. Specifically, these algorithms are intended to achieve the uniform density of experimental data over the used bias voltage interval independent on the measured characteristic representation. Model and experimental data, obtained by using these algorithms are shown. The method of outliers detection during a current-voltage characteristic measurement are shown as well. Application of the adaptive algorithms during scientific experiment allows achieving better results by variation of investigating according to the input data.
The wave concept iterative procedure is very efficient numerical method for the electromagnetic modeling in high frequency domain. But, the numerical complexity of the iterative method in modeling complexes structures...
详细信息
ISBN:
(纸本)9781479999071
The wave concept iterative procedure is very efficient numerical method for the electromagnetic modeling in high frequency domain. But, the numerical complexity of the iterative method in modeling complexes structures and a large number of iterations to converge to the optimal result is a very interesting problem to study. For this reason, In this paper we will implement a different adaptive algorithms to assess the most efficient algorithm to reduce the numerical complexity of the iterative method, and improve the accuracy of adaptive iterative method and the computing time to converge to an optimal result.
This paper presents two new, closely related adaptive algorithms for LS system identification. The starting point for the derivation of the algorithms is the inverse Cholesky factor of the data correlation matrix, obt...
详细信息
ISBN:
(纸本)0780324323
This paper presents two new, closely related adaptive algorithms for LS system identification. The starting point for the derivation of the algorithms is the inverse Cholesky factor of the data correlation matrix, obtained via a QR decomposition (QRD). Both are of O(p) computational complexity with p being the order of the system. The first algorithm is a fixed order QRD scheme with enhanced parallelism. The second is a lattice type algorithm based on Givens rotations, with lower complexity compared to previously derived ones.
In this paper, the performance of LMS and RLS adaptive algorithms for optimum combining applied to the reverse link of W-CDMA is studied in terms of SINR and computational load. Results are shown for different antenna...
详细信息
ISBN:
(纸本)0780374673
In this paper, the performance of LMS and RLS adaptive algorithms for optimum combining applied to the reverse link of W-CDMA is studied in terms of SINR and computational load. Results are shown for different antenna arrays configurations in the base station site (number and separation between antenna elements, individual radiation patterns) and system scenarios (number and azimuthal distribution of users). Special emphasis is made on the antenna structure, and on the algorithms complexity, practical implementation and performance.
This papers describes a new, fast and economical methodology to test linear analog circuits based on adaptive algorithms. To the authors knowledge, this is the first time such technique is used to test analog circuits...
详细信息
ISBN:
(纸本)0897919645
This papers describes a new, fast and economical methodology to test linear analog circuits based on adaptive algorithms. To the authors knowledge, this is the first time such technique is used to test analog circuits, allowing complete fault coverage. The paper presents experimental results showing easy detection of soft, large-deviation and hard faults, with low cost instrumentation. Components variations from 5% to 1% have been detected, as the comparison parameter (output error power) varied from 300% to 20%.
暂无评论