injection molding is one of the most important and common plastic formation methods. combination of modeling tools and optimization algorithms can be used in order to determine optimum process conditions for the injection molding of a special part. because of the complication of the injection molding process and multiplicity of parameters and their interactive effects on one another, analytical...

a reproducing kernel hilbert space restricts the space of functions to smooth functions and has structure for function approximation and some aspects in learning theory. in this paper, the solution of an integral equation of the third kind is constructed analytically using a new method. the analytical solution is represented in the form of series in the reproducing kernel space. some numerical ...

on the basis of a reproducing kernel space, an iterative algorithm for solving the one-dimensional linear and nonlinear schrödinger equations is presented. the analytical solution is shown in a series form in the reproducing kernel space and the approximate solution is constructed by truncating the series. the convergence of the approximate solution to the analytical solution is also proved. th...

in this paper, we study the existence of extremal solutions forimpulsive delay fuzzy integrodifferential equations in$n$-dimensional fuzzy vector space, by using monotone method. weshow that obtained result is an extension of the result ofrodr'{i}guez-l'{o}pez cite{rod2} to impulsive delay fuzzyintegrodifferential equations in $n$-dimensional fuzzy vector space.

A simple method for solving Prandtl's integro-differential equation is proposed based on a new reproducing kernel space. Using a transformation and modifying the traditional reproducing kernel method, the singular term is removed and the analytical representation of the exact solution is obtained in the form of series in the new reproducing kernel space. Compared with known investigations, its ...

Above figures show that if the solution space only exists at S=1 space and the initial weights are at S = −1 space, the training path needs to pass the origin to change space. It means w3 changes from positive value to negative value. Compare the learning behaviors of two different initial weights, Wa = [1,−2.5, 2] and Wb = 0.5Wa = [0.5,−1.25, 1], we’ll find the bigger absolute value of w3 caus...

We give a brief summary of work on exploiting solution space structure. The approach is to exploit structures that we call “solution clusters.” We describe what we mean by solution clusters, why they are relevant to reducing search within negotiation, and how they can can be found. We give a high-level description of how they might be applied to a system-of-systems such as the SNAPMAPLANT inter...