3,176 results
Search Results
202. Dixon Factorization for a Number Theory or Cryptography Class.
- Author
-
Costello, Pat
- Subjects
- *
FACTORIZATION , *PRIME numbers , *ALGORITHMS , *CRYSTAL structure , *NUMERICAL analysis - Abstract
In 1981 Dixon introduced a clever idea for factoring large numbers. This idea has become the basis for many current factoring techniques. In this paper, we show how to implement the idea on the computer in the classroom. Additionally, pseudocode is given for finding examples suitable for demonstrating Dixon factorization. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
203. Projection-based two-phase minimum and maximum length scale control in topology optimization.
- Author
-
Carstensen, Josephine V. and Guest, James K.
- Subjects
- *
TWO-phase flow , *MATHEMATICAL optimization , *NUMERICAL analysis , *MANUFACTURING processes , *ALGORITHMS - Abstract
Length scale control in topology optimization is an important area of research with direct implications on numerical stability and solution manufacturability. Projection-based algorithms for continuum topology optimization have received considerable attention in recent years due to their ability to control minimum length scale in a flexible and computationally efficient manner. In this paper, we propose a new projection-based algorithm that embeds minimum length scale control on two material phases (e.g., solid and void) as well as optional maximum length scale on one material phase (e.g., solid or void) into the projection methodology used for material distribution approaches to topology optimization. The proposed algorithms are demonstrated on benchmark problems and are shown to satisfy the length scale constraints imposed. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
204. A topology-preserving polygon rasterization algorithm.
- Author
-
Zhou, Chen, Li, Dingmou, Xiao, Ningchuan, Chen, Zhenjie, Li, Xiang, and Li, Manchun
- Subjects
- *
POLYGONS , *ALGORITHMS , *PIXELS , *NUMERICAL analysis , *LAND use - Abstract
Conventional algorithms for polygon rasterization are typically designed to maintain non-topological characteristics. Consequently, topological relationships, such as the adjacency between polygons, may also be lost or altered, creating topological errors. This paper proposes a topology-preserving polygon rasterization algorithm to avoid topological errors. Four types of topological error may occur during polygon rasterization. The algorithm starts from an initial polygon rasterization and uses a set of preserving strategies to increase topological accuracy. The count of the four types of error measures the topological errors of the conversion. Topological accuracy is summarized as 1 minus the ratio of actual topological errors to the total number of possible error cases. When applied to a land-use dataset with a data volume of 128 MB, 127,836 polygons, and extending 1352 km2, the algorithm achieves a topological accuracy of more than 99% when raster cell size is 30 m or smaller (100% for 5 and 10 m). The effects of cell size, polygon shape, and number of iterations on topological accuracy are also examined. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
205. A continuum-atomistic multi-scale technique for nonlinear behavior of nano-materials.
- Author
-
Khoei, A.R., Sameti, A. Rezaei, and Kazerooni, Y. Nikravesh
- Subjects
- *
KINEMATICS , *FINITE element method , *ALGORITHMS , *NUMERICAL analysis , *MATHEMATICAL analysis - Abstract
Highlights • A hierarchical RVE-based continuum-atomistic multi-scale procedure is developed. • The inter-scale kinematic and energetic consistency principals are exploited. • The kinematic compatibility is applied by the atomistic periodic boundary conditions. • The energetic consistency is satisfied by the Hill-Mandel periodic boundary conditions. • Coarse-scale is modeled using the stress tensor and tangent modulus computed from atomistic RVE. Abstract In this paper, a hierarchical RVE-based continuum-atomistic multi-scale procedure is developed to model the nonlinear behavior of nano-materials. The atomistic RVE is accomplished in consonance with the underlying atomistic structure, and the inter-scale consistency principals, i.e. kinematic and energetic consistency principals, are exploited. To ensure the kinematic compatibility between the fine- and coarse-scales, the implementation of periodic boundary conditions is elucidated for the fully atomistic method. The material properties of coarse-scale are modeled with the nonlinear finite element method, in which the stress tensor and tangent modulus are computed using the Hill-Mandel principal through the atomistic RVE. In order to clearly represent the mechanical behavior of the fine-scale, the stress-strain curves of the atomistic RVE undergoing distinct type of deformation modes are delineated. These results are then assessed to obtain the proper fine-scale parameters for the multi-scale analysis. Finally, several numerical examples are solved to illustrate the capability of the proposed computational algorithm. Graphical abstract Schematically representation of the hierarchical atomistic-continuum multi-scale procedure. Image, graphical abstract [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
206. Extendable multirate real-time simulation of active distribution networks based on field programmable gate arrays.
- Author
-
Wang, Zhiying, Wang, Chengshan, Li, Peng, Fu, Xiaopeng, and Wu, Jianzhong
- Subjects
- *
ENERGY consumption , *ENERGY management , *ENERGY harvesting , *ALGORITHMS , *NUMERICAL analysis - Abstract
Graphical abstract Highlights • The real-time simulation framework for active distribution networks was built. • A multirate simulation method was proposed with high-accuracy and stability. • The detailed hardware design of the real-time simulator was presented. Abstract Real-time simulation of large-scale active distribution networks exhibiting a wide range of time-scales puts forward higher requirements for simulation accuracy and efficiency. This paper presents an extendable method and design for the real-time simulation of active distribution networks utilising high-performance hardware field programmable gate arrays. In the aspect of numerical algorithm, a high-accuracy and stable multirate simulation algorithm is proposed. The entire active distribution network is decoupled into different subsystems by their inherent time-scales and distinct time steps are used to solve the subsystems. Then root-matching method is adopted to form the exponential difference equations that represent the behaviours of the electric distribution network being modelled, which eliminates the truncation errors and thus provides a highly accurate time-domain solution. To handle the interface between the subsystems, a multirate interfacing method is proposed. The hardware design of the multirate interfaces is presented as well. With the multirate algorithm, a fully functional extendable real-time simulator based on field programmable gate arrays is designed and implemented. Two modified IEEE 33-node systems with photovoltaics and energy storage are simulated on the 4-field-programmable-gate-arrays-based real-time simulator. Simulation results are compared with the commercial simulation tool PSCAD/EMTDC to validate the correctness and effectiveness of the proposed method and design. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
207. TREND-CYCLE ESTIMATION USING FUZZY TRANSFORM OF HIGHER DEGREE.
- Author
-
HOLČAPEK, M. and NGUYEN, L.
- Subjects
- *
FUZZY algorithms , *FUZZY logic , *TIME series analysis , *NUMERICAL analysis , *ALGORITHMS - Abstract
Ill this paper, we provide theoretical justification for the application of higher degree fuzzy transform in time series analysis. Under the assumption that a time series can be additively decomposed into a trendcycle, a seasonal component and a random noise, we demonstrate that the higher degree fuzzy transform technique can be used for the estimation of the trend-cycle, which is one of the basic tasks in time series analysis. We prove that high frequencies appearing in the seasonal component can be arbitrarily suppressed and that random noise, as a stationary process, can be successfully decreased using the fuzzy transform of higher degree with a reasonable adjustment of parameters of a generalized uniform fuzzy partition. [ABSTRACT FROM AUTHOR]
- Published
- 2018
208. Social Touch Gesture Recognition Using Convolutional Neural Network.
- Author
-
Albawi, Saad, Bayat, Oguz, Al-Azawi, Saad, and Ucan, Osman N.
- Subjects
- *
ARTIFICIAL neural networks , *ALGORITHMS , *DATABASES , *NUMERICAL analysis , *MATHEMATICAL analysis - Abstract
Recently, social touch gesture recognition has been considered an important topic for touch modality, which can lead to highly efficient and realistic human-robot interaction. In this paper, a deep convolutional neural network is selected to implement a social touch recognition system for raw input samples (sensor data) only. The touch gesture recognition is performed using a dataset previously measured with numerous subjects that perform varying social gestures. This dataset is dubbed as the corpus of social touch, where touch was performed on a mannequin arm. A leave-one-subject-out cross-validation method is used to evaluate system performance. The proposed method can recognize gestures in nearly real time after acquiring a minimum number of frames (the average range of frame length was from 0.2% to 4.19% from the original frame lengths) with a classification accuracy of 63.7%. The achieved classification accuracy is competitive in terms of the performance of existing algorithms. Furthermore, the proposed system outperforms other classification algorithms in terms of classification ratio and touch recognition time without data preprocessing for the same dataset. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
209. Localization Algorithm Based on Iterative Centroid Estimation for Wireless Sensor Networks.
- Author
-
Jiang, Rui, Wang, Xin, and Zhang, Li
- Subjects
- *
ALGORITHMS , *WIRELESS sensor networks , *NUMERICAL analysis , *MATHEMATICAL analysis , *COMPUTER simulation - Abstract
According to the application of range-free localization technology for wireless sensor networks (WSNs), an improved localization algorithm based on iterative centroid estimation is proposed in this paper. With this methodology, the centroid coordinate of the space enclosed by connected anchor nodes and the received signal strength indication (RSSI) between the unknown node and the centroid are calculated. Then, the centroid is used as a virtual anchor node. It is proven that there is at least one connected anchor node whose distance from the unknown node must be farther than the virtual anchor node. Hence, in order to reduce the space enclosed by connected anchor nodes and improve the location precision, the anchor node with the weakest RSSI is replaced by this virtual anchor node. By applying this procedure repeatedly, the localization algorithm can achieve a good accuracy. Observing from the simulation results, the proposed algorithm has strong robustness and can achieve an ideal performance of localization precision and coverage. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
210. A faster algorithm for the calculation of the fast spectral correlation.
- Author
-
Borghesani, P. and Antoni, J.
- Subjects
- *
CYCLIC fatigue , *ALGORITHMS , *SPECTRUM analysis , *NUMERICAL analysis , *SUPERPOSITION principle (Physics) , *UNCERTAINTY - Abstract
One of the main aims of second order cyclostationary (CS2) analysis is the estimation of the full spectral correlation, allowing the identification of different CS2 components in a signal and their characterisation in terms of both spectral frequency f and cyclic frequency α . Unfortunately, traditional estimators of the full spectral correlation (e.g. averaged cyclic periodogram) are highly computationally expensive and hence their application has been quite limited. On the other hand, fast envelope-based CS2 indicators (e.g. cyclic modulation spectrum, CMS) are bound by a cyclic-spectral form of the uncertainty principle, which limits the extent of the cyclic frequency axis α max at approximately the value chosen for the spectral frequency axis resolution Δ f . A recent work has however introduced a ground-breaking approach resulting in a fast algorithm for the calculation of the spectral correlation. This approach is based on the calculation of a series of CMS-like quantities, each scanning a different cyclic-frequency band, given a certain spectral frequency resolution. The superposition of all these quantities allows covering a larger α -band breaking the constraint between maximum cyclic frequency α max and spectral frequency axis resolution Δ f , at a limited computational cost. In this paper a new algorithm for the calculation of the same fast spectral correlation is introduced, resulting in a further computational efficiency gain, and a simplification of the computational procedure. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
211. Efficient Adaptive Qualitative Methods for 3D Inverse Scattering Problems.
- Author
-
Koung Hee Leem, Jun Liu, and Pelekanos, George
- Subjects
- *
ALGORITHMS , *NUMERICAL analysis , *FINITE element method , *INVERSE scattering transform , *ITERATIVE methods (Mathematics) - Abstract
In this paper we extend our recently developed 2D adaptive factorization method for efficiently solving 3D inverse acoustic and electromagnetic scattering problems. Different from the previously used Simpson rule, we propose to use Gaussian quadrature rule, which provides improved reconstruction quality. Several numerical examples are presented to illustrate the effectiveness of our proposed adaptive method. To achieve better efficiency and robustness, we have based our implementation on the existing adaptive quadrature codes. [ABSTRACT FROM AUTHOR]
- Published
- 2018
212. The average cost of Markov chains subject to total variation distance uncertainty.
- Author
-
Malikopoulos, A.A., Charalambous, C.D., and Tzortzis, I.
- Subjects
- *
MARKOV processes , *STOCHASTIC processes , *MATHEMATICAL models , *ALGORITHMS , *NUMERICAL analysis - Abstract
Abstract This paper addresses the problem of controlling a Markov chain so as to minimize the long-run expected average cost per unit time when the invariant distribution is unknown but we know it belongs to a given uncertain set. The mathematical model used to describe this set is the total variation distance uncertainty. We show that the equilibrium control policy, which yields higher probability to the states with low cost and lower probability to the states with the high cost, is an optimal control policy that minimizes the average cost. Recognition of such a policy may be of value in practical situations with constraints consistent to those studied here when the invariant distribution is uncertain and deriving online an optimal control policy is required. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
213. A NEW ALGORITHM OF PROPER GENERALIZED DECOMPOSITION FOR PARAMETRIC SYMMETRIC ELLIPTIC PROBLEMS.
- Author
-
AZAÏEZ, M., BELGACEM, F. BEN, CASADO-DÍAZ, J., REBOLLO, T. CHACÓN, and MURAT, F.
- Subjects
- *
ALGORITHMS , *ELLIPTIC differential equations , *GALERKIN methods , *NUMERICAL analysis , *MATHEMATICAL models - Abstract
We introduce a new algorithm of proper generalized decomposition (PGD) for parametric symmetric elliptic partial differential equations. For any given dimension, we prove the existence of an optimal subspace of at most that dimension which realizes the best approximation---in the mean parametric norm associated to the elliptic operator---of the error between the exact solution and the Galerkin solution calculated on the subspace. This is analogous to the best approximation property of the proper orthogonal decomposition (POD) subspaces, except that in our case the norm is parameter-dependent. We apply a deflation technique to build a series of approximating solutions on finite-dimensional optimal subspaces, directly in the online step, and we prove that the partial sums converge to the continuous solution in the mean parametric elliptic norm. We show that the standard PGD for the considered parametric problem is strongly related to the deflation algorithm introduced in this paper. This opens the possibility of computing the PGD expansion by directly solving the optimization problems that yield the optimal subspaces. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
214. Plant-wide oscillation detection using multivariate empirical mode decomposition.
- Author
-
Aftab, Muhammad Faisal, Hovd, Morten, and Sivalingam, Selvanathan
- Subjects
- *
ALGORITHMS , *COMPUTER simulation , *MATHEMATICAL models , *MATHEMATICAL optimization , *NUMERICAL analysis - Abstract
Plant-wide oscillation detection is an important task in the maintenance of large-scale industrial control systems, owing to the fact that in an interactive multi-loop environment oscillation generated in one loop may propagate to the different parts of the plant. In such a scenario, it is required that different loops oscillating due to a common cause and hence similar frequency may be grouped together. In this paper an adaptive method for plant-wide oscillation detection based on multivariate empirical mode decomposition (MEMD) along with a grouping algorithm is proposed. The method can identify multiple oscillation groups among different variables as well as variables with random noise only. The proposed method is also applicable to both non-linear and non-stationary time series where the techniques based on the conventional Fourier analysis are prone to errors. Within each group that oscillate due to a common cause, the method can also indicate the location of the probable root cause of oscillations. The efficacy of the proposed method is established with the help of both simulation and industrial case studies. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
215. Convex clustering with metric learning.
- Author
-
Sui, Xiaopeng Lucia, Xu, Li, Qian, Xiaoning, and Liu, Tie
- Subjects
- *
CONVEX functions , *MACHINE learning , *DOCUMENT clustering , *NUMERICAL analysis , *ALGORITHMS - Abstract
The convex clustering formulation of Chi and Lange (2015) is revisited. While this formulation can be precisely and efficiently solved, it uses the standard Euclidean metric to measure the distance between the data points and their corresponding cluster centers and hence its performance deteriorates significantly in the presence of outlier features. To address this issue, this paper considers a formulation that combines convex clustering with metric learning. It is shown that: (1) for any given positive definite Mahalanobis distance metric, the problem of convex clustering can be precisely and efficiently solved using the Alternating Direction Method of Multipliers; (2) the problem of learning a positive definite Mahalanobis distance metric admits a closed-form solution; (3) an algorithm that alternates between convex clustering and metric learning can provide a significant performance boost over not only the original convex clustering formulation but also the recently proposed robust convex clustering formulation of Wang et al. (2017). [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
216. An Iterative Method for Tensor Inpainting Based on Higher-Order Singular Value Decomposition.
- Author
-
Yeganli, S. F., Yu, R., and Demirel, H.
- Subjects
- *
MATHEMATICAL decomposition , *ITERATIVE methods (Mathematics) , *NUMERICAL analysis , *TENSOR algebra , *ALGORITHMS - Abstract
We consider the problem of tensor (i.e., multidimensional array) inpainting in this paper. By using higher-order singular value decomposition, we propose an iterative algorithm that performs soft thresholding on entries of the core tensor and then reconstructs via the directional orthogonal matrices. An inpainted tensor is obtained at the end of the iteration. Simulations conducted over color images, video frames, and MR images validate that the proposed algorithm is competitive with state-of-the-art completion algorithms. The evaluation is made in terms of quality metrics and visual comparison. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
217. A real-time interpolation strategy for transition tool path with C2 and G2 continuity.
- Author
-
Wang, Hui, Wu, Jianhua, Liu, Chao, and Xiong, Zhenhua
- Subjects
- *
INTERPOLATION , *ALGORITHMS , *MATHEMATICAL optimization , *APPROXIMATION theory , *NUMERICAL analysis - Abstract
A typical interpolation strategy for line segments consists of a transition scheme, a Look-ahead ACC/DEC scheduling, and an interpolation algorithm. In these three parts, the main computation occurs in the first and second part. Some research work has been carried out to decrease the computation in the previous literatures, but these methods occupy a lot of computing resources for the optimization process during the calculation of transition curve parameters and feed rates. Consequently, the computational efficiency of interpolation strategy is greatly reduced. To deal with the issue, a real-time interpolation strategy is proposed in this paper. In the transition scheme, a Bézier curve is utilized to smooth the line segments. Based on the relationship among the approximation error, the approximation radius, and the transition curve, the curve can be directly generated when the approximation error is given. In the ACC/DEC scheduling, a 3-segment feed rate profile with jerk continuity is constructed. Meanwhile, a Look-ahead planning based on Backward Scanning and Forward Revision (BSFR) algorithm is utilized to eliminate redundant computation. Compared with Zhao’s and Shi’s strategy, the proposed strategy has the merits of C2 and G2 continuity for the tool path, jerk continuity for the tool movement, and distinguished real-time performance for interpolation. The experiments of 3D pentagram and 2D butterfly are carried out with different strategies and their results demonstrate that the interpolation efficiency can be greatly improved with the proposed strategy. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
218. On the sign consistency of the Lasso for the high-dimensional Cox model.
- Author
-
Lv, Shaogao, You, Mengying, Lin, Huazhen, Lian, Heng, and Huang, Jian
- Subjects
- *
PROPORTIONAL hazards models , *BIG data , *ESTIMATION theory , *ALGORITHMS , *NUMERICAL analysis - Abstract
In this paper we study the ℓ 1 -penalized partial likelihood estimator for the sparse high-dimensional Cox proportional hazards model. In particular, we investigate how the ℓ 1 -penalized partial likelihood estimation recovers the sparsity pattern and the conditions under which the sign support consistency is guaranteed. We establish sign recovery consistency and ℓ ∞ -error bounds for the Lasso partial likelihood estimator under suitable and interpretable conditions, including mutual incoherence conditions. More importantly, we show that the conditions of the incoherence and bounds on the minimal non-zero coefficients are necessary, which provides significant and instructional implications for understanding the Lasso for the Cox model. Numerical studies are presented to illustrate the theoretical results. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
219. Joint User Pairing and Power Allocation Design for Heavy Loaded Full-Duplex Small Cell Systems.
- Author
-
Chen, Lu, Zhong, Caijun, Lin, Hai, and Zhang, Zhaoyang
- Subjects
- *
WIRELESS communications , *ALGORITHMS , *NUMERICAL analysis , *TELECOMMUNICATION systems , *ALGEBRA - Abstract
This paper considers a heavy loaded full-duplex (FD) small cell consisting of one FD base station and multiple half-duplex users where the number of subchannels is less than the number of uplink and downlink users. With the objective of maximizing the total sum-rate, a joint power allocation, and user pairing problem is formulated. To solve this problem, a novel decomposition method is proposed, which decouples the power allocation and user pairing problem into two subproblems. It is proven that the optimal solution of subproblems is the optimal solution of the original problem. Then, optimal algorithms are developed for the two subproblems. Numerical results show that the proposed algorithm achieves better performance compared with the baselines of the greedy algorithm and random pairing algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
220. Solving high-dimensional partial differential equations using deep learning.
- Author
-
Jiequn Han, Jentzen, Arnulf, and E., Weinan
- Subjects
- *
PARTIAL differential equations , *DEEP learning , *ALGORITHMS , *ARTIFICIAL neural networks , *NUMERICAL analysis - Abstract
Developing algorithms for solving high-dimensional partial differential equations (PDEs) has been an exceedingly difficult task for a long time, due to the notoriously difficult problem known as the "curse of dimensionality." This paper introduces a deep learning-based approach that can handle general highdimensional parabolic PDEs. To this end, the PDEs are reformulated using backward stochastic differential equations and the gradient of the unknown solution is approximated by neural networks, very much in the spirit of deep reinforcement learning with the gradient acting as the policy function. Numerical results on examples including the nonlinear Black-Scholes equation, the Hamilton-Jacobi-Bellman equation, and the Allen-Cahn equation suggest that the proposed algorithm is quite effective in high dimensions, in terms of both accuracy and cost. This opens up possibilities in economics, finance, operational research, and physics, by considering all participating agents, assets, resources, or particles together at the same time, instead of making ad hoc assumptions on their interrelationships. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
221. Approximate sparse spectral clustering based on local information maintenance for hyperspectral image classification.
- Author
-
Yan, Qing, Ding, Yun, Zhang, Jing-Jing, Xun, Li-Na, and Zheng, Chun-Hou
- Subjects
- *
HYPERSPECTRAL imaging systems , *COMPUTATIONAL complexity , *CLUSTER analysis (Statistics) , *APPROXIMATION theory , *APPLIED mathematics - Abstract
Sparse spectral clustering (SSC) has become one of the most popular clustering approaches in recent years. However, its high computational complexity prevents its application to large-scale datasets such as hyperspectral images (HSIs). In this paper, we propose two efficient approximate sparse spectral clustering methods for HSIs clustering in which clustering performance is improved by utilizing local information among the data. Firstly, we construct a smaller representative dataset on which sparse spectral clustering is performed. Then the labels of ground object are extending to whole dataset based on the local information according to two extending strategies. The first one is that the local interpolation is utilized to improve the extension of the clustering result. The other one is that the label extension is turned to a problem of subspace embedding, and is fulfilled by locally linear embedding (LLE). Several experiments on HSIs demonstrated that the proposed algorithms are effective for HSIs clustering. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
222. A nonmonotone smoothing Newton algorithm for solving general box constrained variational inequalities.
- Author
-
Zhao, Na and Ni, Tie
- Subjects
- *
CONSTRAINED optimization , *MATHEMATICAL inequalities , *NUMERICAL analysis , *PROBLEM solving , *ALGORITHMS , *MATHEMATICAL optimization - Abstract
In this paper, based on a new smoothing function, the general box constrained variational inequalities are solved by a smoothing Newton algorithm with a nonmonotone line search. The proposed algorithm is proved to be globally and locally superlinearly convergent under suitable assumptions. The preliminary numerical results are reported. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
223. Optimal control of bioprocess systems using hybrid numerical optimization algorithms.
- Author
-
Wu, Xiang, Zhang, Kanjian, and Cheng, Ming
- Subjects
- *
OPTIMAL control theory , *BIOTECHNOLOGICAL process control , *NUMERICAL analysis , *MATHEMATICAL optimization , *ALGORITHMS - Abstract
In the paper, we consider the bioprocess system optimal control problem. Generally speaking, it is very difficult to solve this problem analytically. To obtain the numerical solution, the problem is transformed into a parameter optimization problem with some variable bounds, which can be efficiently solved using any conventional optimization algorithms, e.g. the improved Broyden-Fletcher-Goldfarb-Shanno algorithm. However, in spite of the improved Broyden-Fletcher-Goldfarb-Shanno algorithm is very efficient for local search, the solution obtained is usually a local extremum for non-convex optimal control problems. In order to escape from the local extremum, we develop a novel stochastic search method. By performing a large amount of numerical experiments, we find that the novel stochastic search method is excellent in exploration, while bad in exploitation. In order to improve the exploitation, we propose a hybrid numerical optimization algorithm to solve the problem based on the novel stochastic search method and the improved Broyden-Fletcher-Goldfarb-Shanno algorithm. Convergence results indicate that any global optimal solution of the approximate problem is also a global optimal solution of the original problem. Finally, two bioprocess system optimal control problems illustrate that the hybrid numerical optimization algorithm proposed by us is low time-consuming and obtains a better cost function value than the existing approaches. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
224. An improved risk-benefit collaborative grey target decision model and its application in the decision making of load adjustment schemes.
- Author
-
Li, Rongbo, Jiang, Zhiqiang, Ji, Changming, Li, Anqiang, and Yu, Shan
- Subjects
- *
ELECTRIC power consumption , *NEURAL circuitry , *ALGORITHMS , *FUZZY control systems , *NUMERICAL analysis - Abstract
Power generation plan formulated based on the forecasted runoff is an important basis for the actual operation of hydropower station. However, due to the forecast error, the load adjustment is necessary in the actual operation, and how to find out the most satisfactory load adjustment scheme from the scheme set is an important topic. So, in order to comprehensively reflect the risk and benefit state of hydropower station operation, a risk-benefit collaborative evaluating indicator system of load adjustment scheme is established firstly in this paper, and aim at the strong subjectivity of present evaluation methods, an improved grey target decision model based on moment estimation method is proposed, and the combinatorial weight integration technology and the Mahalanobis distance are coupled in this model. Taking the cascade hydropower stations of Yalong River in China as an instance, six schemes are evaluated by the proposed model, and the results are compared and analyzed with another six evaluation models. Results show that the proposed model can effectively coordinate different weighting methods and overcome the shortcomings of traditional grey target decision model about the insufficient consideration on the importance and correlation of evaluating indicators, and it has a good value of popularization and application. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
225. An Unsymmetric FDTD Subgridding Algorithm With Unconditional Stability.
- Author
-
Yan, Jin and Jiao, Dan
- Subjects
- *
FINITE difference time domain method , *SYMMETRY (Physics) , *ELECTRON tube grids , *ALGORITHMS , *NUMERICAL analysis - Abstract
To preserve accuracy in a grid with arbitrary subgrids, a finite-difference time-domain (FDTD) subgridding scheme, in general, would result in an unsymmetric numerical system. Such a numerical system can have complex-valued eigenvalues, which will render a traditional explicit time marching of FDTD absolutely unstable. In this paper, we develop an accurate FDTD subgridding algorithm suitable for arbitrary subgridding settings with arbitrary contrast ratios between the normal grid and the subgrid. Although the resulting system matrix is also unsymmetric, we develop a time-marching method to overcome the stability problem without sacrificing the matrix-free merit of the original FDTD. This method is general, which is also applicable to other subgridding algorithms whose underlying numerical systems are unsymmetric. The proposed FDTD subgridding algorithm is then further made unconditionally stable, thus permitting the use of a time step independent of space step. Extensive numerical experiments involving both 2- and 3-D subgrids with various contrast ratios have demonstrated the accuracy, stability, and efficiency of the proposed subgridding algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
226. APPROXIMATION ALGORITHMS FOR EULER GENUS AND RELATED PROBLEMS.
- Author
-
CHEKURI, CHANDRA and SIDIROPOULOS, ANASTASIOS
- Subjects
- *
MATHEMATICAL analysis , *GRAPHIC methods , *ALGORITHMS , *NUMERICAL analysis , *MATHEMATICAL models - Abstract
The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by Thomassen [J. Algorithms, 10 (1989), pp. 568{576; J. Combin. Theory, Ser. B, 57 (1993), pp. 196{206], and it is known to be fixed-parameter tractable. However, the approximability of the Euler genus is wide open. While the existence of an O(1)-approximation is not ruled out, only an O( p n)-approximation [J. Chen, S. P. Kanchi, and A. Kanevsky, Inform. Process. Lett., 61 (1997), pp. 317{322] is known even in bounded-degree graphs. In this paper we give a polynomial-time algorithm which, given a boundeddegree graph of Euler genus g, computes a drawing in a surface of Euler genus gO(1) · logO(1) n. Combined with the upper bound from [J. Chen, S. P. Kanchi, and A. Kanevsky, Inform. Process. Lett., 61 (1997), pp. 317{322], our result also implies a O(n1/2-α)-approximation for some constant α > 0. Using our algorithm for approximating the Euler genus as a subroutine, we obtain, in a uniform fashion, algorithms with approximation ratios of the form OPTO(1) · logO(1) n for several related problems on bounded-degree graphs. These include the problems of orientable genus, crossing number, and planar edge and vertex deletion. Our algorithm and proof of correctness for the crossing number problem are simpler compared to the long and difficult proof in the recent breakthrough by Chuzhoy [Proceedings of the ACM Symposium on Theory of Computing, 2011, pp. 303{312], while essentially obtaining a qualitatively similar result. For planar edge and vertex deletion problems our results are the first to obtain a bound of the form poly(OPT; log n). We also highlight some further applications of our results in the design of algorithms for graphs with small genus. Many such algorithms require that a drawing of the graph is given as part of the input. Our results imply that in several interesting cases, we can implement such algorithms even when the drawing is unknown. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
227. ITERATIONS FOR APPROXIMATING LIMIT REPRESENTATIONS OF GENERALIZED INVERSES.
- Author
-
Shaini, Bilall I. and Stanimirović, Predrag S.
- Subjects
- *
DIFFERENTIAL equations , *STOCHASTIC convergence , *MATHEMATICAL analysis , *ALGORITHMS , *NUMERICAL analysis - Abstract
Our underlying motivation is the iterative method for the implementation of the limit representation of the Moore-Penrose inverse lim αI0 (αI + A*A)-1 A* from [Žukovski, Lipcer, On recurent computation of normal solutions of linear algebraic equations, Ž. Vicisl. Mat. i Mat. Fiz. 12 (1972), 843-857] and [Žukovski, Lipcer, On computation pseudoinverse matrices, Ž. Vicisl. Mat. i Mat. Fiz. 15 (1975), 489-492]. The iterative process for the implementation of the general limit formula lim αI0 (αI + R*S)-1R* was defined in [P.S. Stanimirović, Limit representations of gen- eralized inverses and related methods, Appl. Math. Comput. 103 (1999), 51-68]. In this paper we develop an improvement of this iterative process. The iterative method defined in such a way is able to produce the result in a predefined number of iterative steps. Convergence properties of defined iterations are further investigated. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
228. Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information.
- Author
-
Kacewicz, Bolesław
- Subjects
- *
INITIAL value problems , *EXPONENTS , *ALGORITHMS , *ASYMPTOTIC expansions , *NUMERICAL analysis , *LINEAR dependence (Mathematics) - Abstract
Abstract It is known that, for systems of initial-value problems, algorithms using adaptive information perform much better in the worst case setting than the algorithms using nonadaptive information. In the latter case, lower and upper complexity bounds significantly depend on the number of equations. However, in contrast with adaptive information, existing lower and upper complexity bounds for nonadaptive information are not asymptotically tight. In this paper, we close the gap in the complexity exponents, showing asymptotically matching bounds for nonadaptive standard information, as well as for a more general class of nonadaptive linear information. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
229. Mechanism design for one-facility location game with obnoxious effects on a line.
- Author
-
Mei, Lili, Ye, Deshi, and Zhang, Guochuan
- Subjects
- *
UTILITY functions , *MATHEMATICAL models , *MATHEMATICAL analysis , *NUMERICAL analysis , *ALGORITHMS - Abstract
In this paper, we introduce obnoxious effects into obnoxious facility location games on a line, where each agent i has a private location x i on a closed interval [ 0 , 1 ] and one facility will be built on a location y in the interval according to the bids of all the agents. In addition, there are two thresholds d 1 and d 2 in the utility function of each agent, where 0 ≤ d 1 ≤ d 2 ≤ 1 . Denote d ( y , x i ) = | y − x i | to be the distance between agent i and the facility on the location y . The utility function of agent i is 0 if d ( y , x i ) is at most d 1 ; 1 if d ( y , x i ) is at least d 2 ; otherwise a linear increasing function between 0 and 1. Each agent attempts to get the largest utility while the social welfare is to maximize the sum of all the agents' utilities. The classic obnoxious facility game [4,11] is a special case of our problem when d 1 = 0 and d 2 = 1 . In this work, we first study the hardness of approximate mechanism design on this generalized problem, which states that our problem cannot admit any deterministic strategy-proof mechanism with bounded approximation ratio if d 1 ≥ 1 2 . Then we limit the thresholds to some ranges, both deterministic and randomized strategy-proof mechanisms are studied, and the approximation ratios vary with the specific values of d 1 and d 2 . [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
230. Reinforcement learning for solution updating in Artificial Bee Colony.
- Author
-
Fairee, Suthida, Prom-On, Santitham, and Sirinaovakul, Booncharoen
- Subjects
- *
BEES algorithm , *REINFORCEMENT learning , *SOFTWARE upgrades , *STOCHASTIC convergence , *NUMERICAL analysis - Abstract
In the Artificial Bee Colony (ABC) algorithm, the employed bee and the onlooker bee phase involve updating the candidate solutions by changing a value in one dimension, dubbed one-dimension update process. For some problems which the number of dimensions is very high, the one-dimension update process can cause the solution quality and convergence speed drop. This paper proposes a new algorithm, using reinforcement learning for solution updating in ABC algorithm, called R-ABC. After updating a solution by an employed bee, the new solution results in positive or negative reinforcement applied to the solution dimensions in the onlooker bee phase. Positive reinforcement is given when the candidate solution from the employed bee phase provides a better fitness value. The more often a dimension provides a better fitness value when changed, the higher the value of update becomes in the onlooker bee phase. Conversely, negative reinforcement is given when the candidate solution does not provide a better fitness value. The performance of the proposed algorithm is assessed on eight basic numerical benchmark functions in four categories with 100, 500, 700, and 900 dimensions, seven CEC2005’s shifted functions with 100, 500, 700, and 900 dimensions, and six CEC2014’s hybrid functions with 100 dimensions. The results show that the proposed algorithm provides solutions which are significantly better than all other algorithms for all tested dimensions on basic benchmark functions. The number of solutions provided by the R-ABC algorithm which are significantly better than those of other algorithms increases when the number of dimensions increases on the CEC2005’s shifted functions. The R-ABC algorithm is at least comparable to the state-of-the-art ABC variants on the CEC2014’s hybrid functions. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
231. A comprehensive study on the seakeeping performance of high speed hybrid ships by 2.5D theoretical calculation and different scaled model experiments.
- Author
-
Jiao, Jialong, Sun, Shuzheng, Li, Jide, Adenya, Christiaan Adika, Ren, Huilong, Chen, Chaohe, and Wang, Dongjiao
- Subjects
- *
SEAKEEPING , *VERTICAL motion , *VISCOUS flow , *ALGORITHMS , *NUMERICAL analysis - Abstract
In this paper, seakeeping performance of vessels is comparatively investigated by means of improved 2.5D theoretical calculation, small-scale model towing tank test and large-scale free running model sea trial. This study also provides a scheme of ship vertical motion stabilization technique by using Semi-Submerged Bow (SSB) appendages. Firstly, an improved strip theory based 2.5D theoretical seakeeping algorithm, which considers the viscous flow effects attributed to bow appendages, is developed to estimate ship vertical motion responses in regular waves. Short-term predictions are also made on the basis of spectral analysis theory to predict ship motion responses in irregular waves. Then corresponding small-scale models are made and tested in a laboratory towing tank for both regular and irregular wave conditions to confirm the numerical results. The tank testing results between different ship schemes are also compared to experimentally investigate the effects of SSB and fin on hull vertical motion stabilization. Furthermore, large-scale model sea trials are conducted in coastal waves for a final validation of the ship seakeeping performance in short-crested sea waves. Finally, comparisons of the results by different testing approaches are systematically made and analyzed. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
232. An oscillation-free flow solver based on flux reconstruction.
- Author
-
Aguerre, Horacio J., Pairetti, Cesar I., Venier, Cesar M., Márquez Damián, Santiago, and Nigro, Norberto M.
- Subjects
- *
ALGORITHMS , *OSCILLATIONS , *INTERPOLATION , *FINITE element method , *NUMERICAL analysis - Abstract
In this paper, a segregated algorithm is proposed to suppress high-frequency oscillations in the velocity field for incompressible flows. In this context, a new velocity formula based on a reconstruction of face fluxes is defined eliminating high-frequency errors. In analogy to the Rhie–Chow interpolation, this approach is equivalent to including a flux-based pressure gradient with a velocity diffusion in the momentum equation. In order to guarantee second-order accuracy of the numerical solver, a set of conditions are defined for the reconstruction operator. To arrive at the final formulation, an outlook over the state of the art regarding velocity reconstruction procedures is presented comparing them through an error analysis. A new operator is then obtained by means of a flux difference minimization satisfying the required spatial accuracy. The accuracy of the new algorithm is analyzed by performing mesh convergence studies for unsteady Navier–Stokes problems with analytical solutions. The stabilization properties of the solver are then tested in a problem where spurious numerical oscillations arise for the velocity field. The results show a remarkable performance of the proposed technique eliminating high-frequency errors without losing accuracy. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
233. High-order numerical approximation formulas for Riemann-Liouville (Riesz) tempered fractional derivatives: construction and application (I).
- Author
-
Zhang, Yuxin, Li, Qian, and Ding, Hengfei
- Subjects
- *
RIEMANN surfaces , *FRACTIONAL calculus , *ALGORITHMS , *MATRICES (Mathematics) , *NUMERICAL analysis - Abstract
In this paper, we develop a new numerical algorithm for solving the Riesz tempered space fractional diffusion equation. The stability and convergence of the numerical scheme are discussed via the technique of matrix analysis. Finally, numerical experiments are performed to confirm the effectiveness of our numerical algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
234. Robust and automatic motion-capture data recovery using soft skeleton constraints and model averaging.
- Author
-
Tits, Mickaël, Tilmanne, Joëlle, and Dutoit, Thierry
- Subjects
- *
DATA recovery , *ELECTRONIC data processing , *SKELETON , *SPORTS sciences , *HUMAN-computer interaction - Abstract
Motion capture allows accurate recording of human motion, with applications in many fields, including entertainment, medicine, sports science and human computer interaction. A common difficulty with this technology is the occurrence of missing data, due to occlusions, or recording conditions. Various models have been proposed to estimate missing data. Some are based on interpolation, low-rank properties or inter-correlations. Others involve dataset matching or skeleton constraints. While the latter have the advantage of promoting a realistic motion estimation, they require prior knowledge of skeleton constraints, or the availability of a prerecorded dataset. In this article, we propose a probabilistic averaging method of several recovery models (referred to as Probabilistic Model Averaging (PMA) in this paper), based on the likelihoods of the distances between body points. This method has the advantage of being automatic, while allowing an efficient gap data recovery. To support and validate the proposed method, we use a set of four individual recovery models, based on linear/nonlinear regression in local coordinate systems. Finally, we propose two heuristic algorithms to enforce skeleton constraints in the reconstructed motion, which can be used on any individual recovery model. For validation purposes, random gaps were introduced into motion-capture sequences, and the effects of factors such as the number of simultaneous gaps, gap length and sequence duration were analyzed. Results show that the proposed probabilistic averaging method yields better recovery than (i) each of the four individual models and (ii) two recent state-of-the-art models, regardless of gap length, sequence duration and number of simultaneous gaps. Moreover, both of our heuristic skeleton-constraint algorithms significantly improve the recovery for 7 out of 8 tested motion-capture sequences (p < 0.05), for 10 simultaneous gaps of 5 seconds. The code is available for free download at: . [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
235. A generalization of the rectangle condition.
- Author
-
Kwon, Bo-hyun
- Subjects
- *
RECTANGLES , *MATHEMATICAL decomposition , *NUMERICAL analysis , *MATHEMATICAL analysis , *ALGORITHMS - Abstract
In this paper, we define the connecting rectangle condition to check whether or not a Heegaard splitting is strongly irreducible which is a variation of the rectangle condition by Casson and Gordon. We define a general version of the rectangle condition. Moreover, with a similar condition defined on an n -bridge decomposition, we can check whether or not the Hempel distance of an n -bridge decomposition is greater than or equal to two. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
236. Stability orthogonal regression for system identification.
- Author
-
Tang, Xiaoquan and Zhang, Long
- Subjects
- *
ALGORITHMS , *MATHEMATICAL models , *NUMERICAL analysis , *APPROXIMATION theory , *MONTE Carlo method - Abstract
Variable selection methods have been widely used for system identification. However, there is still a major challenge in producing parsimonious models with optimal model structures as popular variable selection methods often produce suboptimal model with redundant model terms. In the paper, stability orthogonal regression (SOR) is proposed to build a more compact model with fewer or no redundant model terms. The main idea of SOR is that multiple intermediate models are produced by orthogonal forward regression (OFR) using sub-sampling technique and then the final model is a combination of these intermediate model terms but does not include infrequently selected terms. The effectiveness of the proposed methods is analyzed in theory and also demonstrated using two numerical examples in comparison with some popular algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
237. Local Bifurcations and Chaos in the Fractional Rössler System.
- Author
-
Čermák, Jan and Nechvátal, Luděk
- Subjects
- *
HOPF bifurcations , *CHAOS theory , *FRACTIONAL calculus , *NUMERICAL analysis , *ALGORITHMS - Abstract
The paper discusses the fractional Rössler system and the dependence of its dynamics on some entry parameters. An explicit algorithm for a priori determination of fractional Hopf bifurcations is derived and scenarios documenting a route of the system from stability to chaos are performed with respect to a varying system’s fractional order as well as to a varying system’s coefficient. Contrary to the existing results, the searched values of the fractional Hopf bifurcations follow directly from a revealed analytical dependence between these two systems’ entries. Their various critical values are established and confirmed by numerical experiments demonstrating not only the loss of stability of an equilibrium point, but also other phenomena of transition to chaotic behavior. In addition, we suggest an active control method for synchronization of two chaotic fractional-order Rössler systems. Our theoretical analysis enables to synchronize them for any value of a free parameter under which the master system displays a chaotic behavior. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
238. Structure-preserving numerical methods for the fractional Schrödinger equation.
- Author
-
Wang, Pengde and Huang, Chengming
- Subjects
- *
SCHRODINGER equation , *PARTIAL differential equations , *ALGORITHMS , *NUMERICAL analysis , *MATHEMATICAL analysis - Abstract
This paper considers the long-time integration of the nonlinear fractional Schrödinger equation involving the fractional Laplacian from the point of view of symplectic geometry. By virtue of a variational principle with the fractional Laplacian, the equation is first reformulated as a Hamiltonian system with a symplectic structure. Then, by introducing a pair of intermediate variables with a fractional operator, the equation is reformulated in another form for which more conservation laws are found. When reducing to the case of integer order, they correspond to multi-symplectic conservation law and local energy conservation law for the classic Schrödinger equation. After that, structure-preserving algorithms with the Fourier pseudospectral approximation to the spatial fractional operator are constructed. It is proved that the semi-discrete and fully discrete systems satisfy the corresponding symplectic or other conservation laws in the discrete sense. Numerical tests are performed to validate the efficiency of the methods by showing their remarkable conservation properties in the long-time simulation. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
239. An Accelerated Preventive Agent Based Scheme for Postdisturbance Voltage Control and Loss Reduction.
- Author
-
Nassaj, Amin and Shahrtash, S. Mohammad
- Subjects
- *
ELECTRIC potential , *MULTIAGENT systems , *SENSITIVITY analysis , *ALGORITHMS , *NUMERICAL analysis - Abstract
In this paper, a novel agent based dynamic Volt/Var control approach is introduced, by which the voltage security (i.e., voltage profile and mid- and long-term stability) can be improved and also power loss is reduced under postdisturbance condition and in a wide-area manner. The proposed scheme employs organized multiagent system to preserve voltage magnitude of all busbars within permissible range and reduction of power losses after any disturbance through appropriate coordination of reactive power sources. To accelerate exploitation of on-load tap changers (OLTCs) as well as suppressing the possibility of encountering voltage instability which may be initiated by them, a preventive scheme based on sensitivity analysis is proposed which determines efficient number of multitap changes of OLTCs. To evaluate the effectiveness of the introduced algorithm, different scenarios have been performed in Nordic 32 test system, where the numerical results in all cases demonstrate the effectiveness and reliability of the proposed scheme. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
240. An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems.
- Author
-
Zhang, Jian-Jun, Zhang, Jian-Li, and Ye, Wan-Zhou
- Subjects
- *
LAGRANGE equations , *LINEAR complementarity problem , *ALGORITHMS , *SCIENTIFIC computing , *NUMERICAL analysis - Abstract
A large number of free boundary problems can be formulated as linear-complementarity problems. In this paper, we propose an inexact alternating direction method of multipliers for solving linear complementarity problem arising from free boundary problems by using the special structure of these problems. The convergence of our proposed method is proved. Numerical results show that the proposed method is feasible and effective, and it is significantly faster than modified alternating direction implicit algorithm and many other methods, especially when dimension of the problem being solved is large. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
241. A meta-argumentation approach for the efficient computation of stable and preferred extensions in dynamic bipolar argumentation frameworks.
- Author
-
Alfano, Gianvincenzo, Greco, Sergio, Parisi, Francesco, Bistarelli, Stefano, Giacomin, Massimiliano, and Pazienza, Andrea
- Subjects
- *
SEMANTICS , *ATRIAL fibrillation , *META-analysis , *ALGORITHMS , *NUMERICAL analysis - Abstract
Bipolar argumentation frameworks (BAFs) extend Dung's argumentation frameworks to explicitly represent the notion of support between arguments, in addition to that of attack. BAFs can be profitably used to model disputes between two or more agents, with the aim of deciding the sets of arguments that should be accepted to support a point of view in a discussion. However, since new arguments, attacks, and supports are often introduced to take into account new available knowledge, BAFs as well as the set of accepted arguments (under a given semantics) change over the time. In this paper we first tackle the problem of efficiently recomputing sets of accepted arguments of dynamic BAFs (under the preferred and stable semantics). Focusing on a deductive interpretation of the support relation, we introduce an incremental approach that, given an initial BAF, an initial extension for it, and an update, computes an extension of the updated BAF. This is achieved by introducing a meta-argumentation transformation according to which an initial BAF, as well as its extension and an update, are transformed into a plain argumentation framework (AF) with a suitable initial extension and update. Thanks to the use of the meta-argumentation intermediate level, our approach is able to incorporate existing AF-solvers and an incremental technique for plain AFs in order to compute an extension of the updated BAF. Moreover, our approach can be seamlessly applied to a more general form of BAFs, namely Extended Bipolar Argumentation Frameworks (EAFs), where defeasible supports and defeats are modelled by means of second-order attacks (i.e., attacks toward elements of the support or attack relation). We experimentally validated our approach on both BAFs and EAFs. The experiments showed that, on average, our technique is almost 100 times faster than computing extensions of updated BAFs or EAFs from scratch. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
242. Point Set Denoising Using Bootstrap-Based Radial Basis Function.
- Author
-
Liew, Khang Jie, Ramli, Ahmad, and Abd. Majid, Ahmad
- Subjects
- *
SIGNAL denoising , *STATISTICAL bootstrapping , *RADIAL basis functions , *THREE-dimensional imaging , *SCANNING systems , *APPROXIMATION theory - Abstract
This paper examines the application of a bootstrap test error estimation of radial basis functions, specifically thin-plate spline fitting, in surface smoothing. The presence of noisy data is a common issue of the point set model that is generated from 3D scanning devices, and hence, point set denoising is one of the main concerns in point set modelling. Bootstrap test error estimation, which is applied when searching for the smoothing parameters of radial basis functions, is revisited. The main contribution of this paper is a smoothing algorithm that relies on a bootstrap-based radial basis function. The proposed method incorporates a k-nearest neighbour search and then projects the point set to the approximated thin-plate spline surface. Therefore, the denoising process is achieved, and the features are well preserved. A comparison of the proposed method with other smoothing methods is also carried out in this study. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
243. AN O(1/k) CONVERGENCE RATE FOR THE VARIABLE STEPSIZE BREGMAN OPERATOR SPLITTING ALGORITHM.
- Author
-
HAGER, WILLIAM W., YASHTINI, MARYAM, and HONGCHAO ZHANG
- Subjects
- *
ALGORITHMS , *MATRICES (Mathematics) , *FINITE element method , *NUMERICAL analysis , *MATHEMATICAL physics - Abstract
An earlier paper proved the convergence of a variable stepsize Bregman operator splitting algorithm (BOSVS) for minimizing ø(Bu) + H(u), where H and ø are convex functions, and ø is possibly nonsmooth. The algorithm was shown to be relatively efficient when applied to partially parallel magnetic resonance image reconstruction problems. In this paper, the convergence rate of BOSVS is analyzed. When H(u) = ‖Au - f ‖2, where A is a matrix, it is shown that for an ergodic approximation uk obtained by averaging k BOSVS iterates, the error in the objective value ø(Buk)+H(uk) is O(1/k). When the optimization problem has a unique solution u*, we obtain the estimate ‖uk-u*‖ = O(1/ √ k). The theoretical analysis is compared to observed convergence rates for partially parallel magnetic resonance image reconstruction problems where A is a large dense ill-conditioned matrix. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
244. CONVERGENCE ANALYSIS OF THE GENERALIZED EMPIRICAL INTERPOLATION METHOD.
- Author
-
MADAY, Y., MULA, O., and TURINICI, G.
- Subjects
- *
INTERPOLATION , *APPROXIMATION theory , *FUNCTIONAL analysis , *NUMERICAL analysis , *ALGORITHMS - Abstract
Let F be a compact set of a Banach space X. This paper analyzes the "generalized empirical interpolation method," which, given a function f ∊ F, builds an interpolant Jn[f] in an n dimensional subspace Xn ⊂ X with the knowledge of n outputs (σi(f))ni=1, where σi ∊ X' and X' is the dual space of X. The space Xn is built with a greedy algorithm that is adapted to F in the sense that it is generated by elements of F itself. The algorithm also selects the linear functionals (σi)ni=1 from a dictionary Σ ⊂ X'. In this paper, we study the interpolation error maxf∊F ‖f - Jn[f]‖X by comparing it with the best possible performance on an n dimensional space, i.e., the Kolmogorov n-width of F in X, dn(F,X). For polynomial or exponential decay rates of dn(F,X), we prove that the interpolation error has the same behavior modulo the norm of the interpolation operator. Sharper results are obtained in the case where X is a Hilbert space. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
245. From stacking sequences to ply layouts: An algorithm to design manufacturable composite structures.
- Author
-
Zein, S., Madhavan, V., Dumas, D., Ravier, L., and Yague, I.
- Subjects
- *
COMPOSITE structures , *STACKING machines , *ALGORITHMS , *NUMERICAL analysis , *CONSTRAINTS (Physics) - Abstract
The problem of computing the ply lay-outs of a composite structure from the definition of the stacking sequences of the zones is studied in this paper. These stacking sequences result from the design of the composite structure and they are considered to be admissible with respect to standard composite design and manufacturing rules. This paper shows that the definition of blended stacking sequences does not necessarily lead to a possible solution for the ply layouts. Therefore, the design process of a composite structure must include a further step after computing the stacking sequences which is to compute the ply layouts. The paper presents an algorithm to compute a ply layout solution for a given set of stacking sequences. Using a backtracking approach, it efficiently checks all the possible ply layout combinations to find a solution. Some numerical experiments are presented to study the mapping between stacking sequences and ply layouts and the existence of a ply layout solution. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
246. Coordinated Parameter Identification Technique for the Inertial Parameters of Non-Cooperative Target.
- Author
-
Ning, Xin, Zhang, Teng, Wu, Yaofa, Zhang, Pihui, Zhang, Jiawei, Li, Shuai, Yue, Xiaokui, and Yuan, Jianping
- Subjects
- *
SPACE , *PARAMETER identification , *INERTIA (Mechanics) , *ALGORITHMS , *NUMERICAL analysis - Abstract
Space operations will be the main space missions in the future. This paper focuses on the precise operations for non-cooperative target, and researches of coordinated parameter identification (CPI) which allows the motion of multi-joints. The contents of this paper are organized: (1) Summarize the inertial parameters identification techniques which have been conducted now, and the technique based on momentum conservation is selected for reliability and realizability; (2) Elaborate the basic principles and primary algorithm of coordinated parameter identification, and analyze some special problems in calculation (3) Numerical simulation of coordinated identification technique by an case study on non-cooperative target of spacecraft mounting dual-arm with six joints is done. The results show that the coordinated parameter identification technique could get all the inertial parameters of the target in 3D by one-time identification, and does not need special configuration or driven joints, moreover the results are highly precise and save much more time than traditional ones. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
247. An efficient algorithm to generate random sphere packs in arbitrary domains.
- Author
-
Lozano, Elias, Roehl, Deane, Celes, Waldemar, and Gattass, Marcelo
- Subjects
- *
PARTICLE size distribution , *ALGORITHMS , *APPROXIMATION theory , *SIMULATION methods & models , *STATISTICAL physics , *NUMERICAL analysis - Abstract
Particle-based methods based on material models using spheres can provide good approximations for many physical phenomena at both the micro and macroscales. The point of departure for the simulations, in general, is a dense arrangement of spherical particles (sphere pack) inside a given container. For generic domains, the generation of a sphere pack may be complex and time-consuming, especially if the pack must comply with a prescribed sphere size distribution and the stability requirements of the simulation. The primary goal of this paper is to present an efficient algorithm that is capable of producing packs with millions of spheres following a statistical sphere size distribution inside complex arbitrary domains. This algorithm uses a new strategy to ensure that the sphere size distribution is preserved even when large particles are rejected in the growing process. The paper also presents numerical results that enable an evaluation of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
248. On stream selection for interference alignment in heterogeneous networks.
- Author
-
Aycan Beyazıt, Esra, Özbek, Berna, and Le Ruyet, Didier
- Subjects
- *
ALGORITHMS , *CELL analysis , *NUMERICAL analysis , *FEMTOCELLS , *RANDOM noise theory - Abstract
This paper proposes a stream selection algorithm to deal with the interference and increase the sum capacity in the context of heterogeneous networks where cells of different types coexist. Due to the different transmit powers between the macro and small cells, interference levels are also different. Since the small cells are densely deployed, fully connected interference network between small cells is considered in this paper. The proposed algorithm performs the selection of a stream sequence among a predetermined set of sequences. Those selected sequences are the ones that mostly contribute to the sum rate when performing the exhaustive search. As a consequence, since the search space is reduced, the complexity is significantly decreased. These stream sequences form a regular structure where the first stream is associated to a pico user. Another distinguishing property of the proposed approach is that the stream sequences include at least one stream for each user. When selecting the streams, the channel matrices of the unselected streams are projected orthogonally to the virtual transmit and virtual receive channels of the selected stream in order to align the interference in the null space of these virtual channels. The performance evaluations are carried out by considering different scenarios with different numbers and locations of pico cells. It is shown that the proposed method can significantly reduce the computational complexity while achieving a very close performance to the exhaustive search. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
249. Inertial/celestial-based fuzzy adaptive unscented Kalman filter with Covariance Intersection algorithm for satellite attitude determination.
- Author
-
Wang, Xiaochu, You, Zheng, and Zhao, Kaichun
- Subjects
- *
KALMAN filtering , *AEROSPACE engineering , *NUMERICAL analysis , *MATHEMATICAL analysis , *ALGORITHMS - Abstract
This paper deals with the attitude determination algorithm for the satellite with an attitude measurement unit that is comprised of one gyroscope and two star trackers installed perpendicularly. Since the data updating rate of star trackers is typically lower than that of the gyro and filter, appropriate compensation is made for star sensors, but this results in more difficulties of determining the performed noise level. A fuzzy adaptive tuning method is used to help tuning, and with modified Rodrigues parameters and rotation vector to represent attitude error, a fuzzy adaptive unscented Kalman filter with minimal skew sampling method is realized, which works as a sub-system and estimates sub-optimal attitude states and gyro bias. Two such sub-systems are federated into the framework of Covariance Intersection algorithm to achieve data fusion for an optimal attitude and gyro bias estimation in system level. Simulation is performed to verify the attitude determination algorithm presented in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
250. Formulation, existence, and computation of boundedly rational dynamic user equilibrium with fixed or endogenous user tolerance.
- Author
-
Han, Ke, Szeto, W.Y., and Friesz, Terry L.
- Subjects
- *
EXISTENCE theorems , *MATHEMATICAL bounds , *EQUILIBRIUM , *DYNAMIC models , *ALGORITHMS , *NUMERICAL analysis - Abstract
This paper analyzes dynamic user equilibrium (DUE) that incorporates the notion of boundedly rational (BR) user behavior in the selection of departure times and routes. Intrinsically, the boundedly rational dynamic user equilibrium (BR-DUE) model we present assumes that travelers do not always seek the least costly route-and-departure-time choice. Rather, their perception of travel cost is affected by an indifference band describing travelers’ tolerance of the difference between their experienced travel costs and the minimum travel cost. An extension of the BR-DUE problem is the so-called variable tolerance dynamic user equilibrium (VT-BR-DUE) wherein endogenously determined tolerances may depend not only on paths, but also on the established path departure rates. This paper presents a unified approach for modeling both BR-DUE and VT-BR-DUE, which makes significant contributions to the model formulation, analysis of existence, solution characterization, and numerical computation of such problems. The VT-BR-DUE problem, together with the BR-DUE problem as a special case, is formulated as a variational inequality. We provide a very general existence result for VT-BR-DUE and BR-DUE that relies on assumptions weaker than those required for normal DUE models. Moreover, a characterization of the solution set is provided based on rigorous topological analysis. Finally, three computational algorithms with convergence results are proposed based on the VI and DVI formulations. Numerical studies are conducted to assess the proposed algorithms in terms of solution quality, convergence, and computational efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.