Search

The simulation of rubber-like materials is usually based on hyperelasticity. If strain-rate dependency has to be considered viscous dampers also have to be taken into account in the rheological model. A disadvantage of such a description is time-consuming parameter identification associated with the damping constants. In this paper, a tabulated formulation is presented which allows the fast generation of input data based on uniaxial static and dynamic tensile tests at different strain rates. Unloading, i.e. forming a hysteresis loop, can also be modeled easily based on a damage formulation. We show the theoretical background and algorithmic setup of our model that has been implemented in the explicit finite element program LS-DYNA [1-3]. Apart from purely numerical examples, the validation of a soft and a hard rubber under loading and subsequent unloading at different strain rates is shown. [ABSTRACT FROM AUTHOR]

Due to the fact that many classical numerical methods have not yet mature quantum counterparts, quantum circuit design is very important in quantum image processing. In this paper, using the novel enhanced quantum representation (NEQR) model, an image encryption algorithm based on Feistel structure is carried out in quantum computer by giving the encryption quantum circuits. First, the modified Feistel structure for image encryption is proposed. It is a 128-bit block cipher and requires 16-bit subkeys to encrypt the image, and it is a mixture of Feistel and substitution–permutation network; then, the detailed quantum circuits design of the encryption algorithm are given. Through numerical simulation and analysis, it is verified that the proposed quantum image encryption algorithm is effective and can resist statistical attacks effectively. [ABSTRACT FROM AUTHOR]

Tempered fractional Laplacian is the generator of the tempered isotropic Lévy process. This paper provides the finite difference discretization for the two-dimensional tempered fractional Laplacian by using the weighted trapezoidal rule and the bilinear interpolation. Then it is used to solve the tempered fractional Poisson equation with homogeneous Dirichlet boundary condition and the error estimate is also derived. Numerical experiments verify the predicted convergence rates and effectiveness of the schemes. [ABSTRACT FROM AUTHOR]

In practical engineering, the layout optimization technique driven by the thermal performance is faced with a severe computational burden when directly integrating the numerical analysis tool of temperature simulation into the optimization loop. To alleviate this difficulty, this paper presents a novel deep learning surrogate-assisted heat source layout optimization method. First, two sampling strategies, namely the random sampling strategy and the evolving sampling strategy, are proposed to produce diversified training data. Then, regarding mapping between the layout and the corresponding temperature field as an image-to-image regression task, the feature pyramid network (FPN), a kind of deep neural network, is trained to learn the inherent laws, which plays as a surrogate model to evaluate the thermal performance of the domain with respect to different input layouts accurately and efficiently. Finally, the neighborhood search-based layout optimization (NSLO) algorithm is proposed and combined with the FPN surrogate to solve discrete heat source layout optimization problems. A typical two-dimensional heat conduction optimization problem is investigated to demonstrate the feasibility and effectiveness of the proposed deep learning surrogate-assisted layout optimization framework. [ABSTRACT FROM AUTHOR]

A novel quantum steganography scheme is investigated based on efficient embedding algorithm of modified exploiting modification direction in this paper, which embeds two 2 n × 2 n binary images (secret information) into a 2 n × 2 n color image (carrier image). To improve the security of the secret information and enhance the robustness of the proposed scheme, a 2 n × 2 n binary image (secret key) is generated according to the exclusive or operation of two secret images. The secret key acts as the control key of choosing two channels from the carrier image's three channels of R, G and B (i.e., R, G or R, B channels chose as the pixel-group) to hide the secret information. In addition, the effective quantum circuits for investigated quantum steganography scheme are illustrated to better understanding the procedure of embedding algorithm. The experiment results simulated on the classical computer with MATLAB environment, and the numerical analyses demonstrate that the presented algorithm has good performance on imperceptibility and security. [ABSTRACT FROM AUTHOR]

Based on the modified flexible representation of quantum images, a novel quantum image encryption algorithm was proposed in this paper. The encryption process performs Arnold scrambling operation to disturb the quantum image information in spatial domain first. Then, quantum wavelet transforms are employed to decompose the scrambled quantum image into multiscale resolution (i.e., a sequence of subimages) in the frequency domain, which are mainly divided into two parts: the low-frequency component (i.e., the approximation) and high-frequency detail information (i.e., the horizontal details, vertical details and diagonal details in each decomposition level). Following that, Arnold scrambling operations are implemented to encrypt the wavelet coefficients within each subimage in the frequency domain once again. Finally, based on inverse quantum wavelet transforms, the encrypted wavelet coefficients can affect the pixel values of the entire reconstructed quantum images. Due to the fact that all the quantum operations are invertible, the decryption process of the encrypted image is performed in a straightforward manner by reversing all of the quantum operations within quantum image encryption process. The proposed encryption algorithm is simulated on a classical computer with MATLAB environments. Experimental results and numerical analysis indicate that the presented algorithm has a good encrypted effect and high security. [ABSTRACT FROM AUTHOR]

This paper is devoted to the analysis of the sixth-order symplectic and symmetric explicit extended Runge-Kutta-Nyström (ERKN) schemes for solving multi-frequency oscillatory nonlinear Hamiltonian equations. Fourteen practical sixth-order symplectic and symmetric explicit ERKN schemes are constructed, and their phase properties are investigated. The paper is accompanied by five numerical experiments, including a nonlinear two-dimensional wave equation. The numerical results in comparison with the sixth-order symplectic and symmetric Runge-Kutta-Nyström methods and a Gautschi-type method demonstrate the efficiency and robustness of the new explicit schemes for solving multi-frequency oscillatory nonlinear Hamiltonian equations. [ABSTRACT FROM AUTHOR]

Intrusion detection systems are devoted to monitor a network with aims at finding and avoiding anomalous events. In particular, we focus on misuse detection systems, which are trained to identify several known types of attacks. These can be unauthorized accesses, or denial of service attacks, among others. Whenever it scans a trace of a suspicious event, it is programmed to trigger an alert and/or to block this dangerous access to the system. Depending on the security policies of the network, the administrator may seek different requirements that will have a strong dependency on the behavior of the intrusion detection system. For a given application, the cost of raising false alarms could be higher than carrying out a preventive access lock. In other scenarios, there could be a necessity of correctly identifying the exact type of cyber attack to proceed in a given way. In this paper, we propose a multi-objective evolutionary fuzzy system for the development of a system that can be trained using different metrics. By increasing the search space during the optimization of the model, more accurate solutions are expected to be obtained. Additionally, this scheme allows the final user to decide, among a broad set of solutions, which one is better suited for the current network characteristics. Our experimental results, using the well-known KDDCup'99 problem, supports the quality of this novel approach in contrast to the state-of-the-art for evolutionary fuzzy systems in intrusion detection, as well as the C4.5 decision tree. [ABSTRACT FROM AUTHOR]

Document representation is a key problem in document analysis and processing tasks, such as document classification, clustering and information retrieval. Especially for unstructured text data, the use of a suitable document representation method would affect the performance of the subsequent algorithms for applications and research. In this paper, we propose a novel document representation method called the conditional co-occurrence degree matrix document representation method (CCODM), which is based on word co-occurrence. CCODM not only considers the co-occurrence of terms but also considers the conditional dependencies of terms in a specific context, which leads to more available and useful structural and semantic information being retained from the original documents. Extensive experimental classification results with different supervised and unsupervised feature selection methods show that the proposed method, CCODM, achieves better performance than the vector space model, latent Dirichlet allocation, the general co-occurrence matrix representation method and the document embedding method. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) is one of the most powerful and versatile evolutionary algorithms for efficiently solving complex real-world optimization problems in recent years. Since its introduction in 1995, the research focus in DE has mostly been on the variant side with so many new algorithms proposed based on the original DE algorithm. However, each new algorithm is only suitable for certain fitness landscapes, and, therefore, some types of optimization problems cannot be solved efficiently. To tackle this issue, this paper presents a new self-feedback DE algorithm, named the SFDE; its optimal variation strategy is selected by extracting the local fitness landscape characteristics in each generation population and combing the probability distributions of unimodality and multimodality in each local fitness landscape. The proposed algorithm is tested on a suite of 17 benchmark functions, and the experimental results demonstrated its advantages in a high search dimension in that it can ensure that the population moves to a better fitness landscape, then speeds up convergence to the global optimum, and avoids falling into local optima. [ABSTRACT FROM AUTHOR]

In this paper we introduce a new hierarchy of large cardinals between I3 and I2, the iterability hierarchy, and we prove that every step of it strongly implies the ones below. [ABSTRACT FROM AUTHOR]

This paper is concerned with mathematical and numerical analysis of the system of radiative integral transfer equations. The existence and uniqueness of solution to the integral system is proved by establishing the boundedness of the radiative integral operators and proving the invertibility of the operator matrix associated with the system. A collocation-boundary element method is developed to discretize the differential-integral system. For the non-convex geometries, an element-subdivision algorithm is developed to handle the computation of the integrals containing the visibility factor. An efficient iterative algorithm is proposed to solve the nonlinear discrete system and its convergence is also established. Numerical experiment results are also presented to verify the effectiveness and accuracy of the proposed method and algorithm. [ABSTRACT FROM AUTHOR]

This paper defines the self-covariance property for the solutions of transferable utility cooperative games (TU-games) as a weakening of their covariance. Self-covariant solutions are positively homogenous and satisfy a "restricted" translation covariance so that feasible shifts are only the solution vectors themselves and their multipliers. A description of all non-empty, single-valued, efficient, anonymous, weakly and self-covariant solutions in the class of twoplayer TU-games is given. As demonstrated below, among them there exist just three solutions admitting consistent extensions in the Davis-Maschler sense. They are the equal share solution, the standard solution, and the constrained egalitarian solution for superadditive two-player TUgames. For the third solution mentioned, characterizations of some consistent extensions to the class of all TU-games are given. [ABSTRACT FROM AUTHOR]

The minimax concave penalty (MCP) has been demonstrated theoretically and practically to be effective in nonconvex penalization for variable selection and parameter estimation. In this paper, we develop an efficient alternating direction method of multipliers (ADMM) with continuation algorithm for solving the MCP-penalized least squares problem in high dimensions. Under some mild conditions, we study the convergence properties and the Karush-Kuhn-Tucker (KKT) optimality conditions of the proposed method. A high-dimensional BIC is developed to select the optimal tuning parameters. Simulations and a real data example are presented to illustrate the efficiency and accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was given recently by Svensson. This was accomplished by introducing an easier problem called Local-Connectivity ATSP and showing that a good solution to this problem can be used to obtain a constant factor approximation for ATSP. In this paper, we solve Local-Connectivity ATSP for two different edge weights. The solution is based on a flow decomposition theorem for solutions of the Held-Karp relaxation, which may be of independent interest. [ABSTRACT FROM AUTHOR]

The results of testing formula simplification tools are presented in the first part of this paper. In the second part, an algorithm for constructing canonical forms of linear semi-algebraic formulas is described. The main result of the study is the definition of the canonical form of a linear semi-algebraic formula that has the property of uniqueness and other useful properties. An algorithm for constructing such a formula is described. [ABSTRACT FROM AUTHOR]

In this paper, new algorithms are proposed to solve operator inclusion problems with maximal monotone operators acting in a Hilbert space. The algorithms are based on inertial extrapolation and three well-known methods: Tseng forward-backward splitting and two hybrid algorithms for approximation of fixed points of nonexpansive operators. Theorems about strong convergence of the sequences generated by the algorithms are proved. [ABSTRACT FROM AUTHOR]

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]

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]

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]

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]

In this paper, we introduce and analyze a general iterative algorithm for finding a common solution of a finite family of mixed equilibrium problems, a general system of generalized equilibria and a fixed point problem of nonexpansive mappings in a real Hilbert space. Under some appropriate conditions, we derive the strong convergence of the sequence generated by the proposed algorithm to a common solution, which also solves some optimization problem. The result presented in this paper improves and extends some corresponding ones in the earlier and recent literature. [ABSTRACT FROM AUTHOR]

In this paper, we introduce and analyze a multi-step hybrid extragradient algorithm by combining Korpelevich's extragradient method, the viscosity approximation method, the hybrid steepest-descent method, Mann's iteration method and the gradient-projection method (GPM) with regularization in the setting of infinite-dimensional Hilbert spaces. It is proven that, under appropriate assumptions, the proposed algorithm converges strongly to a solution of the convex minimization problem (CMP) with constraints of several problems: finitely many generalized mixed equilibrium problems (GMEPs), finitely many variational inclusions, and the fixed point problem of a strictly pseudocontractive mapping. In the meantime, we also prove the strong convergence of the proposed algorithm to the unique solution of a hierarchical variational inequality problem (over the fixed point set of a strictly pseudocontractive mapping) with constraints of finitely many GMEPs, finitely many variational inclusions and the CMP. The results presented in this paper improve and extend the corresponding results announced by many others. [ABSTRACT FROM AUTHOR]

In this paper we introduce the notion of Zδ-continuity as a generalization of precontinuity, complete continuity and s2-continuity, where Z is a subset selection. And for each poset P, a closure space Zδc(P) arises naturally. For any subset system Z, we define a new type of completion, called Zδ-completion, extending each poset P to a Z-complete poset. The main results are: (1) if a subset system Z is subset-hereditary, then clZ(Ψ(P)), the Z-closure of all principal ideals Ψ(P) of poset P in Zδc(P), is a Zδ-completion of P and Zδc(P)≅Zδc(clZ(Ψ(P))); (2) let Z be an HUL-system and P a Zδ-continuous poset, then the Zδ-completion of P is also Zδ-continuous, and a Z-complete poset L is a Zδ-completion of P iff P is an embedded Zδ-basis of L; (3) the Dedekind-MacNeille completion is a special case of the Zδ-completion. [ABSTRACT FROM AUTHOR]

This paper studies the complexity of distributed construction of purely additive spanners in the CONGEST model. We describe algorithms for building such spanners in several cases. Because of the need to simultaneously make decisions at far apart locations, the algorithms use additional mechanisms compared to their sequential counterparts. We complement our algorithms with a lower bound on the number of rounds required for computing pairwise spanners. The standard reductions from set-disjointness and equality seem unsuitable for this task because no specific edge needs to be removed from the graph. Instead, to obtain our lower bound, we define a new communication complexity problem that reduces to computing a sparse spanner, and prove a lower bound on its communication complexity. This technique significantly extends the current toolbox used for obtaining lower bounds for the CONGEST model, and we believe it may find additional applications. [ABSTRACT FROM AUTHOR]

In the present paper and for the first time in the literature, a new five-stages symmetric two-step method with improved characteristics is developed.The main properties of the new method are:the new method is of symmetric type,the new method is of two-step algorithm,the new method is of five-stages,the new method is of twelfth-algebraic order,the new hybrid symmetric two-step method is based on the following approximations:Approximation of the first layer on the point xn-1,Approximation of the second layer on the point xn-1,Approximation of the third layer on the point xn-1,Approximation of the fourth layer on the point xn and finally,Approximation of the fifth (final) layer on the point xn+1,the new method has vanished the phase-lag and its first, second and third derivatives,the new method has optimized stability properties for the general problems,the new method is of P-stable type since it has an interval of periodicity equal to 0,∞. For the new obtained method a full numerical analysis (error and stability analysis) is presented.The evaluation of the efficiency of the new method is based on the numerical solution of systems of coupled differential equations of the Schrödinger type. [ABSTRACT FROM AUTHOR]

In this paper, we introduce an algorithm for presentation of an inner estimation of the solution set of a complex interval linear system, where the coefficient matrix is a crisp complex-valued matrix and the right-hand-side vector is an interval complex-valued vector. Also, we show that under some certain conditions, the obtained inner estimation is, in fact, an algebraic solution. [ABSTRACT FROM AUTHOR]

Inherent part of evolutionary algorithms that are based on Darwin’s theory of evolution and Mendel’s theory of genetic heritage, are random processes since genetic algorithms and evolutionary strategies are used. In this paper, we present extended experiments (of our previous) of selected evolutionary algorithms and test functions showing whether random processes really are needed in evolutionary algorithms. In our experiments we used differential evolution and SOMA algorithms with functions 2ndDeJong, Ackley, Griewangk, Rastrigin, SineWave and StretchedSineWave. We use n periodical deterministic processes (based on deterministic chaos principles) instead of pseudo-random number generators (PRGNs) and compare performance of evolutionary algorithms powered by those processes and by PRGNs. Results presented here are numerical demonstrations rather than mathematical proofs. We propose the hypothesis that a certain class of deterministic processes can be used instead of PRGNs without lowering the performance of evolutionary algorithms. [ABSTRACT FROM AUTHOR]

The main computational costs of implicit Runge-Kutta methods are caused by solving a system of algebraic equations at every step. By introducing explicit stages, it is possible to increase the stage (or pseudo-stage) order of the method, which makes it possible to increase the accuracy and avoid reducing the order in solving stiff problems, without additional costs of solving algebraic equations. The paper presents implicit methods with an explicit first stage and one or two explicit internal stages. The results of solving test problems are compared with similar methods having no explicit internal stages. [ABSTRACT FROM AUTHOR]

Hessenberg matrices frequently arise in many application areas and have been attracted much attention in recent years. In the current paper, we present two numerical algorithms of $$O(n^2)$$ for computing the determinant of an n-by- n general Hessenberg matrix. The algorithms are all suited for implementation using Computer Algebra Systems such as MATLAB and MAPLE. Some numerical examples are provided in order to demonstrate the performance of the proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper we analyze the convergence properties of two-level and W-cycle multigrid solvers for the numerical solution of the linear system of equations arising from hp-version symmetric interior penalty discontinuous Galerkin discretizations of second-order elliptic partial differential equations on polygonal/polyhedral meshes. We prove that the two-level method converges uniformly with respect to the granularity of the grid and the polynomial approximation degree p, provided that the number of smoothing steps, which depends on p, is chosen sufficiently large. An analogous result is obtained for the W-cycle multigrid algorithm, which is proved to be uniformly convergent with respect to the mesh size, the polynomial approximation degree, and the number of levels, provided the number of smoothing steps is chosen sufficiently large. Numerical experiments are presented which underpin the theoretical predictions; moreover, the proposed multilevel solvers are shown to be convergent in practice, even when some of the theoretical assumptions are not fully satisfied. [ABSTRACT FROM AUTHOR]

The diffusion of Device-to-Device (D2D) communications opens the door to exploit the contributions of multiple Mobile Devices (MDs) to accomplish collaborative tasks. In this paper a speaker recognition algorithm for MDs based on a multiple-observations approach is presented. We propose various fusion and clustering algorithms aimed at efficiently exploiting data coming from MDs. Numerical results show that in many cases our multiple-observation approach is able to significantly improve the accuracy of the considered speaker recognition algorithm. [ABSTRACT FROM AUTHOR]

Biogeography-based optimization (BBO) is a nature-inspired optimization algorithm and has been developed in both theory and practice. In canonical BBO, migration operator is crucial to affect algorithm's performance. In migration operator, a good solution has a large probability to be selected as an immigrant, while a poor solution has a large probability to be selected as an emigrant. The features in an emigrant will be completely replaced by the features in the corresponding immigrant. Hence, the migration operator in canonical BBO causes a significant deterioration of population diversity, and therefore, the algorithm's performance worsens. In this paper, we propose three novel migration operators to enhance the exploration ability of BBO. To present a mathematical proof, Markov analysis is conducted to confirm the advantages of the proposed migration operators over existing ones. In addition, a number of benchmark tests are carried out to empirically assess the performance of the proposed migration operators, on both low-dimensional and high-dimensional numerical optimization problems. The comparison results demonstrate that the proposed migration operators are feasible and effective to enhance BBO's performance. [ABSTRACT FROM AUTHOR]

This paper presents a primal method for finding the minimum L-infinity solution to under-determined linear systems of equations. The method is a two-phase method. Line search is performed at both phases. We establish a condition for a direction to be descent. The convergence proof of the method is shown. Expedient numerical schemes can be used whenever appropriate. Results are presented, which show the superiority of the method over some well-known methods. [ABSTRACT FROM AUTHOR]

In this paper, we construct a second order algorithm based on the spectral deferred correction method for the time-dependent magnetohydrodynamics flows at a low magnetic Reynolds number. We present a complete theoretical analysis to prove that this algorithm is unconditionally stable, consistent and second order accuracy. Finally, two numerical examples are given to illustrate the convergence and effectiveness of our algorithm. [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) is a population based algorithm for solving global optimization problems. Owing to its efficiency and simplicity, PSO has attracted many researchers' attention and developed many variants. Orthogonal learning particle swarm optimization (OLPSO) is proposed as a new variant of PSO that relies on a new learning strategy called orthogonal learning strategy. The OLPSO differs in the utilization of the information of experience from the standard PSO, in which each particle utilizes its historical best experience and globally best experience through linear summation. In OLPSO, particles can fly in better directions by constructing an efficient exemplar through orthogonal experimental design. However, the global version based orthogonal learning PSO (OLPSO-G) still have some drawbacks in solving some complex multimodal function optimization. In this paper, we proposed a quadratic interpolation based OLPSO-G (QIOLPSO-G), in which, a quadratic interpolation based construction strategy for the personal historical best experience is applied. Meanwhile, opposition-based learning, and Gaussian mutation are also introduced into this paper to increase the diversity of the population and discourage the premature convergence. Experiments are conducted on 16 benchmark problems to validate the effectiveness of the QIOLPSO-G, and comparisons are made with four typical PSO algorithms. The results show that the introduction of the three strategies does enhance the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

This paper is devoted to the study of a new class of nonconvex variational inequalities, named general regularized nonconvex variational inequalities. By using the auxiliary principle technique, a new modified predictor-corrector iterative algorithm for solving general regularized nonconvex variational inequalities is suggested and analyzed. The convergence of the iterative algorithm is established under the partially relaxed monotonicity assumption. As a consequence, the algorithm and results presented in the paper overcome incorrect algorithms and results existing in the literature. [ABSTRACT FROM AUTHOR]

In this paper we develop random block coordinate descent methods for minimizing large-scale linearly constrained convex problems over networks. Since coupled constraints appear in the problem, we devise an algorithm that updates in parallel at each iteration at least two random components of the solution, chosen according to a given probability distribution. Those computations can be performed in a distributed fashion according to the structure of the network. Complexity per iteration of the proposed methods is usually cheaper than that of the full gradient method when the number of nodes in the network is much larger than the number of updated components. On smooth convex problems, we prove that these methods exhibit a sublinear worst-case convergence rate in the expected value of the objective function. Moreover, this convergence rate depends linearly on the number of components to be updated. On smooth strongly convex problems we prove that our methods converge linearly. We also focus on how to choose the probabilities to make our randomized algorithms converge as fast as possible, which leads us to solving a sparse semidefinite program. We then describe several applications that fit in our framework, in particular the convex feasibility problem. Finally, numerical experiments illustrate the behaviour of our methods, showing in particular that updating more than two components in parallel accelerates the method. [ABSTRACT FROM AUTHOR]

In the paper, we introduce a class of delay differential variational inequalities consisting of a system of delay differential equations and variational inequalities. The existence conclusion of Carathéodory's weak solution for delay differential variational equalities is obtained. Furthermore, an algorithm for solving the delay differential variational inequality is shown, and the convergence analysis for the algorithm is given. Finally, a numerical example is given to verify the validity of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we propose robust numerical methods for finding the maximum likelihood estimation of the generalized inverse Gaussian distribution. A comparative analysis of the existing algorithms and the results of numerical experiments are presented. Special attention is paid to reproducibility of the tests. [ABSTRACT FROM AUTHOR]

In this paper, we propose two iterative methods for finding a common solution of a finite family of equilibrium problems for pseudomonotone bifunctions. The first is a parallel hybrid extragradientcutting algorithm which is extended from the previously known one for variational inequalities to equilibrium problems. The second is a new cyclic hybrid extragradient-cutting algorithm. In the cyclic algorithm, using the known techniques, we can perform and develop practical numerical experiments. [ABSTRACT FROM AUTHOR]

In this paper, a modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems is proposed. The global convergence of the method and superlinear convergence are proved under some suitable assumptions. Numerical experiments are included to highlight the efficacy of the modified algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new iterative algorithm to approximate fixed points of total asymptotically nonexpansive mappings in $\operatorname{CAT}(0)$ spaces. We also provide two examples to illustrate the convergence behavior of the proposed algorithm and numerically compare the convergence of the proposed iteration scheme with the existing schemes. [ABSTRACT FROM AUTHOR]

This paper proposes and evaluates a near admissible heuristic search strategy and its application to a kind of flexible manufacturing system (FMS) scheduling in a Petri net framework. Petri nets can concisely model the strict precedence constraint, multiple kinds of resources, and concurrent activities. To cope with the complexities for scheduling of FMS with alternative routings, this paper proposes an admissible heuristic function based on the execution of P-timed Petri nets and presents an improved dynamic weighting A* strategy using the proposed heuristic function. The search scheme does not need to predict the depth of solution in advance and the quality of the search result is also controllable. Some numerical experiments are carried out to demonstrate usefulness of the algorithm. [ABSTRACT FROM AUTHOR]

This paper discusses characteristics unique in the two-phase high-frequency-testing (HFT) environment in semiconductor manufacturing. We believe this paper is the first to define, formalize, and analyze the decision making problem associated with the two-phase HFT. Specifically, this paper defines the problem of minimizing the total HFT capacity usage by systematically finding the optimal number of preliminary HFT bin-1 chips subject to the main HFT, with the existence of the target service rate. We also propose a heuristic algorithm that exploits the special structure of the problem for efficiently obtaining a near-optimal solution. Finally, a numerical analysis and a case study have been conducted to gain more insights on the problem structure and the proposed algorithm. [ABSTRACT FROM AUTHOR]

Long accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, ). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. ). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity-theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, ) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, ). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation. [ABSTRACT FROM AUTHOR]

The interval Newton method can be used for computing an enclosure of a single simple zero of a smooth function in an interval domain. It can practically be extended to allow computing enclosures of all zeros in a given interval. This paper deals with the extended interval Newton method. An essential operation of the method is division by an interval that contains zero (extended interval division). This operation has been studied by many researchers in recent decades, but inconsistency in the research has occurred again and again. This paper adopts the definition of extended interval division redefined in recent documents (Kulisch in Arithmetic operations for floating-point intervals, ; Pryce in P1788: IEEE standard for interval arithmetic version 02.2, ). The result of the division is called the precise quotient set. Earlier definitions differ in the overestimation of the quotient set in particular cases, causing inefficiency in Newton's method and even leading to redundant enclosures of a zero. The paper reviews and compares some extended interval quotient sets defined during the last few decades. As a central theorem, we present the fundamental properties of the extended interval Newton method based on the precise quotient set. On this basis, we develop an algorithm and a convenient program package for the extended interval Newton method. Statements on its convergence are also given. We then demonstrate the performance of the algorithm through nine carefully selected very sensitive numerical examples and show that it can compute correct enclosures of all zeros of the functions with high efficiency, particularly in cases where earlier methods are less effective. [ABSTRACT FROM AUTHOR]

In this paper, we attempt to introduce an algorithm which considers not only time factor but also cost, risk, and quality criteria to determine the critical path under fuzzy environment. In this algorithm first, decision makers allocate time, cost, risk, and quality to each activity. We are lacking in data and information, so in the proposed algorithm, the ratings of each activity and the weight of each criterion are described by fuzzy numbers and linguistic variables, which can be expressed in triangular fuzzy number. Linguistic variables are applied to represent the intensity of preferences of one criterion over another. Then, we add up triangular fuzzy numbers to determine the final evaluation value of each criterion for paths. Next, we use fuzzy TOPSIS, a technique for order preferences by similarity to an ideal solution, a method proposed by the authors in another paper, to choose the best alternative. Finally, numerical example is solved to illustrate the procedure of proposed method at the end of this paper. [ABSTRACT FROM AUTHOR]

Let M be a commutative, cancellative, atomic monoid and x a nonunit in M. We define ω( x)= n if n is the smallest positive integer with the property that whenever x∣ a⋅⋅⋅ a, where each a is an atom, there is a T⊆{1,2,..., t} with | T|≤ n such that x∣∏ a. The ω-function measures how far x is from being prime in M. In this paper, we give an algorithm for computing ω( x) in any numerical monoid. Simple formulas for ω( x) are given for numerical monoids of the form 〈 n, n+1,...,2 n−1〉, where n≥3, and 〈 n, n+1,...,2 n−2〉, where n≥4. The paper then focuses on the special case of 2-generator numerical monoids. We give a formula for computing ω( x) in this case and also necessary and sufficient conditions for determining when x is an atom. Finally, we analyze the asymptotic behavior of ω( x) by computing $\lim_{x\rightarrow \infty}\frac{\omega(x)}{x}$. [ABSTRACT FROM AUTHOR]

Evolutionary Structural Optimization (ESO) andits later version bi-directional ESO (BESO) have gainedwidespread popularity among researchers in structural optimizationand practitioners in engineering and architecture.However, there have also been many critical comments onvarious aspects of ESO/BESO. To address those criticisms,we have carried out extensive work to improve the originalESO/BESO algorithms in recent years. This paper summarizeslatest developments in BESO for stiffness optimizationproblems and compares BESO with other well-establishedoptimization methods. Through a series of numerical examples,this paper provides answers to those critical commentsand shows the validity and effectiveness of the evolutionarystructural optimization method. [ABSTRACT FROM AUTHOR]