A filled function method for constrained global optimization
|
|
- Randolf Jefferson
- 5 years ago
- Views:
Transcription
1 DOI 0.007/s ORIGINAL PAPER A filled funtion method for onstrained global optimization Z. Y. Wu F. S. Bai H. W. J. Lee Y. J. Yang Reeived: 0 Marh 005 / Aepted: 5 February 007 Springer Siene+Business Media B.V. 007 Abstrat In this paper, a filled funtion method for solving onstrained global optimization problems is proposed. A filled funtion is proposed for esaping the urrent loal minimizer of a onstrained global optimization problem by ombining the idea of filled funtion in unonstrained global optimization and the idea of penalty funtion in onstrained optimization. Then a filled funtion method for obtaining a global minimizer or an approximate global minimizer of the onstrained global optimization problem is presented. Some numerial results demonstrate the effiieny of this global optimization method for solving onstrained global optimization problems. Keywords Filled funtion Filled funtion method Constrained global optimization Z. Y. Wu B F. S. Bai Shool of Mathematis and Computer Siene, Chonging Normal University, Chonging , China zywu@nu.edu.n F. S. Bai fsbai@nu.edu.u H. W. J. Lee Department of Applied Mathematis, The Hong Kong Polytehni University, Kongloon, Hong Kong, China Joseph.Lee@inet.polyu.edu.hk Y. J. Yang Department of Mathematis, Shanghai University, Shanghai 00444, China yjyang@mail.shu.edu.n Present Address: Z. Y. Wu F. S. Bai Shool of Information Tehnology and Mathematial Sienes, University of Ballarat, Ballarat, VIC 3353, Australia
2 Introdution We onsider the following ineuality onstrained global optimization problem: P min f x. s.t. g i x 0, i =,..., m, x X, where f : X R, g i : X R, i =,,..., m, andx is a box. The existene of loal minimizer other than global one makes global optimization a great hallenge. As one of the main methods to solve general unonstrained global optimization problem without speial strutural property, filled funtion method has attrated extensive attention, see, e.g., [5,6,9,,8 0]. The essential idea of filled funtion method is to onstrut an auxiliary funtion alled filled funtion via the urrent loal minimizer of the original optimization problem, with the property that the urrent loal minimizer is a loal maximizer of the onstruted filled funtion and a better initial point of the primal optimization problem an be obtained by searhing the onstruted filled funtion loally. Both the theoretial and the algorithmi studies show that the filled funtion method is ompetitive with the other existing global optimization methods, suh as tunneling funtion methods [,0] and stohasti methods [4,5]. Constrained global optimization is an even tougher area to takle. For some global optimization problems with nie speial strutural property, suh as onave minimization problem, D.C. programming problems, reverse onvex programming problems and monotone programming problems, there are a number of well developed methods, see, e.g., [,7,8,3,7]. For general onstrained global optimization, i.e., onstrained global optimization without speial strutural property, there is lak of well developed methods. In this paper, we generalize the appliable area of filled funtion method to general onstrained global optimization. The key idea here is to ombine the filled funtion method in unonstrained global optimization proposed in Ref. [8] with penalty funtion methods in onstrained optimization. It is should be noted that all the existing filled funtion methods proposed in Refs. [5,6,9,,,8 ] fous only on solving unonstrained global optimization problems or box onstrained global optimization problems, whereas the filled funtion method proposed in this paper fouses on solving general onstrained global optimization problems. The rest of this paper is organized as follows. In Set., a filled funtion for onstrained global optimization problem P is introdued, and then some basi properties of the proposed filled funtion are disussed. Espeially, it is shown that an improved feasible point an be obtained by solving loally an unonstrained or a box onstrained optimization problem onstruted via the given filled funtion. In Set. 3, we propose a global optimization method named filled funtion method using the presented filled funtion to obtain a global minimizer of the onstrained global optimization problem P. Finally, some illustrative numerial examples are given in Set. 4. Filled funtion of onstrained global optimization and its properties To begin with, we have the following assumptions. Assumption. f and g i, i =,..., m, are ontinuously differentiable.
3 Let where inta denotes the interior of set A. S ={x X g i x 0, i =,..., m},. S ={x intx g i x <0, i =,..., m},. Assumption. S =,ls = S, wherela denotes the losure of set A. By Assumption., we know that for any x 0 S, there exists a seuene {x n } S, suh that lim n x n = x 0. Let Y ={x S x is a loal minimizer of problemp}..3 Assumption.3 The set {f x x Y} is a finite set. Definition. A point x X is said to be a vertex of box X if x = λx + λx with x, x X and λ 0, implies that x = x = x. Let x S be the urrent loal minimizer of problem P. Definition. A funtion px is said to be a filled funtion of problem P at a loal minimizer x if it is ontinuously differentiable and satisfies the following onditions: x is a strit loal maximizer of px on X; i any point x with p x = 0and x = x satisfies f x <f x and x S; ii any loal minimizer x of px on X satisfies a. f x <f x and x S, or b. x is a vertex of X. 3 If x is not a global minimizer of problem P, then there exists a point x S, suh that x is a loal minimizer of px on X with f x <f x. 4 For any x, x X with i f x f x or x X \ S and ii f x f x or x X \ S, it holds that x x > x x if and only if px <px. By the above definition, we know that if px is a filled funtion of problem P at a loal minimizer x, then any infeasible point or any x X with x = x and f x f x, exept the vertexes of X, is neither a loal minimizer of px on X, nor a stationary point of px. Also we note that the urrent loal minimizer x is a global minimizer of problem P if and only if any loal minimizer of funtion px on X is a vertex of X. Condition 4 reveals some kind of algorithmi onsideration for an appliable filled funtion. In what follows, we will introdue a funtion p r,,,x x whih satisfies Definition.. To begin with, we design two ontinuously differentiable funtions f r, t and t. Funtion f r, t should has the following properties: f r, t euals to a onstant when t > 0, and f r, t euals to zero when t is less than a negative number r. f r, t plays the role of filling in the onstrution of filled funtion. t should have the following properties: It is larger than a positive number d when t > 0 and euals to zero when t is less than a negative number r, in addition, it is inreasing. t an be regarded as
4 a modified penalty funtion and used for dealing with onstraints. More speifially, for any given > 0andr > 0, let, t 0 f r, t = r 3 t3 3 r t +, r < t 0,.4 0, t r t + t 0 r 4 t = r 3 t 3 + r 6 r t + t + r < t < t r Note that the reuirement for ontinuous differentiability of f r, t and t justifies the use of ubi polynomials in f r, t and t. Conseuently we have that 0, t 0 f r, t = 6 r 3 t 6 t, r < t 0,.6 r 0, t r t 0 t = 3r r 3 t 4r + r t + r < t < t r Obvilousy f r, t and t are ontinuously differentiable on R. Define p r,,,x x = x x + f r, f x f x m + g i x r,.8 where > 0, r > 0, and > 0 are parameters. Remark. Funtion p r,,,x x is essentially different from the filled funtion H,r,x x proposed in Ref. [8]. Here p r,,,x x inludes m g i x as a penalty term to penalize unfeasible points, while H,r,x x just plays the role of filling. The following theorems shows that p r,,,x x satisfies Definition.. Theorem. For any > 0, > 0, and0 < r, x is a strit loal maximizer of p r,,,x x on X. Proof Sine x is a loal minimizer of the original problem P, there exists δ 0 > 0, suh that f x f x for any x S Nx, δ 0,whereNx, δ 0 denotes the neighborhood of x with radius δ 0, i.e., Nx, δ 0 ={x R n x x <δ 0 }. Then, for any x X Nx, δ 0, we have f x f x or x X \ S, whih yields f x f x + m g i x.
5 Thus, when > 0and0< r, we have that m f r, f x f x + g i x r =. Therefore, we have that p r,,,x x = x x + < = p r,,,x x for any x X Nx, δ 0 \{x } when 0 < r. Thus, x is a strit loal maximizer of p r,,,x x on X. In what follows we assume that,, and r > 0. Theorem. i Any x X with x = x and p r,,,x x = 0 satisfies that f x <f x and x S; ii when r, any loal minimizer x Xofp r,,,x x on X satisfies that f x < f x and x S, or x isavertexofx. Proof i By.8, we have that x x p r,,,x x = f r, f x f x m + x x + m + x x + f r, g r f x f x + f x f x f x + For any x X satisfying f x f x or x X \ S, we have that m f x f x + g i x. When r, we have that m f x f x + g i x r 0, whih yields and f r, f x f x + f r, Thus, we have that f x f x + m m g i x r g i x r m g r g i x g i x..9 g i x r = g i x r = 0. p r,,,x x = x x x x +.
6 Therefore, for any x X with x = x and f x f x,orx X \ S, we have that p r,,,x x = 0, furthermore, T p r,,,x xdx <0, where dx is defined as dx = x x x x. Thus, any point x = x with p r,,,x x = 0 satisfies that f x <f x and x S. ii If x is a loal minimizer of p r,,,x x on X, and x is neither a point satisfying f x <f x and x S, nor a vertex of X, then there exist two different points z, z X and a positive number α with 0 <α<suh that x = αz + αz and p r,,,x x = x x + when 0 < r. Sine, X is a box, we have that [z, z ] := {λz + λz 0 λ } X. Let d 0 = z z, α 0 = min{α, α}. Then, we an easily verify that for any s with s α 0, it holds x + sd 0 [z, z ] X. Let z,λ = x + λd 0 and z,λ = x λd 0,where0< λ α 0.Thenz,λ, z,λ X and p r,,,x z,λ z,λ x + = x x + λd 0 +, p r,,,x z,λ z,λ x + = x x λd 0 +. By x x + λd 0 + x x λd 0 = x x + λ d 0 + λ d 0, x x + x x + λ d 0 λ d 0, x x = x x + λ d 0 > x x, we have that x x + λd 0 or x x λd 0 is larger than x x. Thus, p r,,,x z,λ or p r,,,x z,λ is less than p r,,,x x. Sine,λ an approah 0 to any extent, we obtain that x is not a loal minimizer of p r,,,x x on X. This is a ontradition. Therefore, if x is a loal minimizer of p r,,,x x on X, then we have f x <f x and x S,or x is a vertex of X. Theorem.3 If x is not a global minimizer of the original problem P, then there exist r 0 > 0, 0 > 0,and x S, suh that x is a loal minimizer of p r,,,x x on X with f x <f x when r r 0 and 0.
7 Proof i If x is not a global minimizer of the original problem P, then there exists x 0 S suh that f x 0 <fx.letr 0 = f x f x 0,thenr 0 > 0. By Assumption., there exists x S suh that f x f x 0 <r 0. For this r 0, there exists 0 > 0, suh that g i x < r 0 0 for any i =,..., m. Thus, when r r 0 and 0, we have f x f x = f x f x 0 + f x 0 f x < r 0 r 0 r, and g i x < r for any i =,..., m, whih yield p r,,,x x = 0. Note that p r,,,x x 0foranyx X and p r,,,x x =, it follows that x = x is a global minimizer of p r,,,x x on X. Conseuently, by x S, we have that p r,,,x x = 0, whih yields f x <f x. Theorem.4 For any x, x X with i f x f x or x S and ii f x f x or x S, we have that when 0 < r, x x > x x if and only if p r,,,x x < p r,,,x x. Proof For suh x i, p r,,,x x i =, i =,, when 0 < r. Thus, we have x i x + that x x > x x if and only if p r,,,x x <p r,,,x x when 0 < r. 3 Algorithm We introdue here the following box onstrained optimization problem named filled funtion problem: P min p r,,,x x. x X Based on the proposed filled funtion p r,,,x x, we an obtain a filled funtion method for the onstrained global optimization problem P. The general idea of this filled funtion method is as follows: if the urrent loal minimizer x is not a global minimizer of P, then we an manage to obtain a point x S with f x <f x by applying some loal searh shemes to problem P. Conseuently we an obtain a better loal minimizer of P by applyingloal searh shemesto problem P starting from x. Finally, a global minimizer or an approximate global minimizer of P an be obtained. The orresponding algorithm is denoted by Algorithm FFMC and detailed as follows: 3. Algorithm FFMC Step 0 a Choose a small positive numbers µ, and a large positive number M in the examples of Set. 4,wetakeµ = 0 5 and M = 0 5. Choose a positive integer number K and diretions e,..., e K in the numerial examples in Set. 4, weletk = n
8 and let e i, i =,..., K, be the oordinate diretions, where n is the number of dimensions of the variable. Choose the initial values,,andr for the parameters,, and r, respetively in the numerial examples of Set. 4, wetake = 00, =, and r =. b Choose an initial point x 0 Xhere x0 may not be a feasible point, then use penalty funtion methods to find the first loal minimizer x of the original problem P. Letk :=, j :=, and λ :=, and go to Step. Step Let p rk, k, k,x x = k x x k + f r k, k k f x f x k + m k g i x r k, k 3. where f r, t and t are defined in.4 and.5, respetively. Go to Step. Step If j K, hoose a nonnegative λ with λ suh that y j k := x k + λe j X, and go to Step 3; otherwise, go to Step 5. Step 3. Searh for a loal minimizer of the following filled funtion problem starting from y j k in the numerial examples of Set. 4, we use the onjugate gradient method to searh for a loal minimizer of the following problem: min p r x X k, k, k,x x. 3. k One a point y k X with f y k <fx k and g iy k 0, i =,..., m, is obtained in the proess of searh, set x 0 k+ := y k, k := k +,andgotostep4;otherwiseontinue the proess. Let x k be an obtained loal minimizer of problem 3.. If x k satisfies f x k <fx k and x k S, thenletx0 k+ := x k, k := k +, and go to Step 4; otherwise, let j := j + and go to Step. Step 4 Find a loal minimizer x k of the original onstrained problem P by loal searh methods starting from x 0 k in the numerial examples of Set. 4, weusethe SQP method to obtain a loal minimizer of the original problem P. Go to Step. Step 5 If k M,let k := 0 k,andj :=, go to Step ; otherwise, go to Step 6. Step 6 If k M, let k := 0 k, k :=, j :=, go to Step ; otherwise, go to Step 7. Step 7 If r k µ, letr k := r k 0, k :=, k :=,gotostep;otherwise,stopand x k is a global minimizer or an approximate global minimizer of problem P. By Assumption.3, we know that the set V := {f x x Y} is a finite set, where Y is defined in.3. Let V : ={v,..., v l }, 3.3 η : = min{ v i v j v i, v j V, i = j}. 3.4 For any v i V, there exists x i Y suh that f x i = y i.ifx i is not a global minimizer of problem P, then by Assumption., there exists x i S suh that f x i fx i < η.
9 For this η, there exists i > 0 suh that g j x i < η i for any j =,..., m. Otherwise, if x i is a global minimizer of problem P, thenlet i = 0. Let : = max{ i, i =,..., l}. 3.5 The following assumption together with Assumptions..3 an ensure the onvergene of Algorithm FFMC. Assumption 3. µ η, M,andtheset{e,..., e K } is large enough to ensure that if problem P has a better loal minimizer than the urrent loal minimizer x k,then x 0 k+ in Step 3 an be obtained. Remark 3. Theoretially we an obtain a global optimizer in finite steps under Assumptions..3 and 3.. However, in pratie, some of these assumptions are freuently violated, espeially Assumption 3.. Hene we often obtain approximate global minimizers instead of global minimizers by implementing Algorithm FFMC to solve onstrained global optimization problems. 4 Numerial examples In this setion we give four numerial examples to illustrate the effiieny of Algorithm FFMC. For eah example, we take several initial points to start the searh proess. In the list of tables, we use the same notations as in Algorithm FFMC, and moreover, we use NFFE to denote the number of filled funtion evaluations. FORTRAN 95 is used to ode the algorithm, and the NCONF subroutine, whih is based on the SQP method, is used to find loal minimizers of the original onstrained problem when k. The onjugate gradient method is used to searh for loal minimizers of the filled funtion problems. Example 4. min f x = x + x os7x os7x + 3 s.t. g x = x + x.6 0, g x = x + x 3.7 0, x X ={x, x 0 x i, i =, }. This example is taken from Ref. [6]. It is a nononvex problem with loal optimal solutions in the interior of the feasible region. By Sun and Li [6], we know that x = 0.755, is a global minimum of Example 4. with global optimal value f = Table reords the numerial results of Example 4..
10 Table Numerial results for Example 4. k 3 3 x 0 k f x 0 k x k f x k NFFE Sum: Sum: Sum: Sum: Sum: 3 Example 4. min f x = 5x x x 3 x 4 4 x 5 x 6 4 s.t. x x 4 4 x x 6 4 x 3x x + x x + x 6 x + x 0 x 6 0 x 8 x X = x x x 4 6 x x 6 0 This example is taken from Ref. [4]. We know from Ref. [4] that there exist 8 loal minima and that x = 5,, 5, 0, 5, 0 is a global minimum of Example 4. with global optimal value f = 30. Table reords the numerial results of Example 4..
11 Table Numerial results for Example 4. k x 0 k f x 0 k x k f x k NFFE 3, 3, 3, 3, 3, ,, 5, , 5, ,, 5, , 5, ,,5, ,5, ,.,5, ,5, ,,5,0,5, ,.00000,5,0,5, ,,5,0,5, Sum: 60 4,4,4,4,4,4 5,,5,4,5, ,, 5, , 5, ,, 5, 6, 5, ,, 5, , 5, ,, 5, 0, 5, ,, 5, 0, 5, ,, 5, 0, 5, Sum: 400 3, 3, 4, 4, 3, ,,5,4,5, ,, 5, , 5, ,, 5, 0, 5, Sum: 6,, 3,, 3, 6 5,,5,6,5, ,, 5, , 5, ,, 5, 0, 5, Sum: 6 4, 7, 4, 5, 4, ,,5,6,5, ,, 5, , 5, ,, 5, 0, 5, Sum: 6 Table 3 Numerial results for Example 4.3 k x 0 k f x 0 k x k f x k NFFE 0, , , , , , Sum: , , , , , , , , Sum: , , Example 4.3 min x y s.t. y x 4 8x 3 + 8x + y 4x 4 3x x 96x x 3 0 y 4. This problem is taken from Ref. [3]. We know from Ref. [3] that the best known global solution is x =.395, with funtion value f x = Table 3 reords the numerial results of Example 4.3.
12 Example 4.4 min x x x x s.t x 3 x x x x x x 3 x x x x x x x x x x x x x x x x 3 x x 3 x x x x 3 x x 3 x x x x 0 33 x 45 x X = x 7 x x x 5 45 This problem is also taken from Ref. [3]. We know from Ref. [3] that the best known global solution is x = 78, 33, , 45, with funtion value f x = Table 4 Numerial results for Example 4.4 k x 0 k f x 0 k x k f x k NFFE Sum:
13 Table 4 reords the numerial results of Example 4.4. Aknowledgements This work is partly supported by Australia Researh Counil Projet Grant and by Program for New Century Exellent Talents in University of China. Referenes. Barhen, J., Protopopesu, V., Reister, D.: TRUST: A deterministi algorithm for global optimization. Siene 76, Benson, H.P.: Deterministi algorithm for onstrained onave minimization: a unified ritial surver. Naval Res. Logist. 43, Floudas, C.A., Pardalos, P.M.: A Colletion of Test Problems for Constrained Global Optimization Algorithms. Springer, Berlin Heidelberg Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Shweiger, C.A.: Handbook of Test Problems in Loal and Global Optimization. Kluwer Dordreht, The Netherlands Ge, R.: A filled funtion method for finding a global minimizer of a funtion of several variables. Math. Program. 46, Ge, R.: The globally onvexized filled funtions for global optimization. Appl. Math. Comput. 35, Hoffman, K.L.A.: A method for globally minimizing onave funtions over onvex set. Math. Program. 0, Horst, R.: Deterministi methods in onstrained global optimization: some reent advanes and new fields of appliation. Naval Res. Logist. 37, Kanzow, C.: Global optimization tehniues for mixed omplementarity problems. J. Glob. Optim. 6, Levy, A.V., Montalvo, A.: The tunneling algorithm for the global minimization of funtion. SIAM J. Si. Stat. Comput. 6, Liu, X.: Finding global minimia with a omputable filled funtion. J. Glob. Optim. 9, Luidi, S., Piialli, V.: New lasses of globally onvexized filled funtions for global optimization. J. Glob. Optim. 4, Pardalos, P.M., Rosen, J.B.: Constrained Global Optimization, Algorithms and Appliations. Springer, Berlin Rinnoy Kan, A.H.G., Timmer, G.T.: Stohasti global optimization methods, part I: lustering methods. Math. Program. 39, Rinnoy Kan, A.H.G., Timmer, G.T.: Stohasti global optimization methods, part II: multi-level methods. Math. Program. 39, Sun, X.L., Li, D.: Value-estimation funtion method for onstrained global optimization. J. Optim. Theory Appl. 0, Tuy, H.: Convex Analysis and Global Optimization. Kluwer, Dordreht, Boston, London Wu, Z.Y., Lee, H.W.J., Zhang, L.S., Yang, X.M.: A novel filled funtion method and uasi-filled funtion method for global optimization. Comput. Optim. Appl. 34, Xu, Z., Huang, H.X., Pardalos, P.: Filled funtions for unonstrained global optimization. J. Glob. Optim. 0, Zhang, L.S., NG, C.K., Li, D., Tian, W.W.: A new filled funtion method for global optimization. J. Glob. Optim. 8, Zhu, W.X.: A lass of filled funtions for box onstrained ontinuous global optimization. Appl. Math. Comput 69, Zhu, W.X.: Globally onavized filled funtion method for the box onstrained ontinuous global minimization problem. Optim. Methods Softw. 4,
A new initial search direction for nonlinear conjugate gradient method
International Journal of Mathematis Researh. ISSN 0976-5840 Volume 6, Number 2 (2014), pp. 183 190 International Researh Publiation House http://www.irphouse.om A new initial searh diretion for nonlinear
More informationMaximum Entropy and Exponential Families
Maximum Entropy and Exponential Families April 9, 209 Abstrat The goal of this note is to derive the exponential form of probability distribution from more basi onsiderations, in partiular Entropy. It
More informationSensitivity analysis for linear optimization problem with fuzzy data in the objective function
Sensitivity analysis for linear optimization problem with fuzzy data in the objetive funtion Stephan Dempe, Tatiana Starostina May 5, 2004 Abstrat Linear programming problems with fuzzy oeffiients in the
More informationComplexity of Regularization RBF Networks
Complexity of Regularization RBF Networks Mark A Kon Department of Mathematis and Statistis Boston University Boston, MA 02215 mkon@buedu Leszek Plaskota Institute of Applied Mathematis University of Warsaw
More informationON LOWER LIPSCHITZ CONTINUITY OF MINIMAL POINTS. Ewa M. Bednarczuk
Disussiones Mathematiae Differential Inlusions, Control and Optimization 20 2000 ) 245 255 ON LOWER LIPSCHITZ CONTINUITY OF MINIMAL POINTS Ewa M. Bednarzuk Systems Researh Institute, PAS 01 447 Warsaw,
More informationmax min z i i=1 x j k s.t. j=1 x j j:i T j
AM 221: Advaned Optimization Spring 2016 Prof. Yaron Singer Leture 22 April 18th 1 Overview In this leture, we will study the pipage rounding tehnique whih is a deterministi rounding proedure that an be
More informationA Queueing Model for Call Blending in Call Centers
A Queueing Model for Call Blending in Call Centers Sandjai Bhulai and Ger Koole Vrije Universiteit Amsterdam Faulty of Sienes De Boelelaan 1081a 1081 HV Amsterdam The Netherlands E-mail: {sbhulai, koole}@s.vu.nl
More informationAn Integer Solution of Fractional Programming Problem
Gen. Math. Notes, Vol. 4, No., June 0, pp. -9 ISSN 9-784; Copyright ICSRS Publiation, 0 www.i-srs.org Available free online at http://www.geman.in An Integer Solution of Frational Programming Problem S.C.
More informationControl Theory association of mathematics and engineering
Control Theory assoiation of mathematis and engineering Wojieh Mitkowski Krzysztof Oprzedkiewiz Department of Automatis AGH Univ. of Siene & Tehnology, Craow, Poland, Abstrat In this paper a methodology
More informationHankel Optimal Model Order Reduction 1
Massahusetts Institute of Tehnology Department of Eletrial Engineering and Computer Siene 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Hankel Optimal Model Order Redution 1 This leture overs both
More information(q) -convergence. Comenius University, Bratislava, Slovakia
Annales Mathematiae et Informatiae 38 (2011) pp. 27 36 http://ami.ektf.hu On I (q) -onvergene J. Gogola a, M. Mačaj b, T. Visnyai b a University of Eonomis, Bratislava, Slovakia e-mail: gogola@euba.sk
More informationSome recent developments in probability distributions
Proeedings 59th ISI World Statistis Congress, 25-30 August 2013, Hong Kong (Session STS084) p.2873 Some reent developments in probability distributions Felix Famoye *1, Carl Lee 1, and Ayman Alzaatreh
More informationNonreversibility of Multiple Unicast Networks
Nonreversibility of Multiple Uniast Networks Randall Dougherty and Kenneth Zeger September 27, 2005 Abstrat We prove that for any finite direted ayli network, there exists a orresponding multiple uniast
More informationAsymptotic non-degeneracy of the solution to the Liouville Gel fand problem in two dimensions
Comment. Math. Helv. 2 2007), 353 369 Commentarii Mathematii Helvetii Swiss Mathematial Soiety Asymptoti non-degeneray of the solution to the Liouville Gel fand problem in two dimensions Tomohio Sato and
More informationWhere as discussed previously we interpret solutions to this partial differential equation in the weak sense: b
Consider the pure initial value problem for a homogeneous system of onservation laws with no soure terms in one spae dimension: Where as disussed previously we interpret solutions to this partial differential
More informationVolume 29, Issue 3. On the definition of nonessentiality. Udo Ebert University of Oldenburg
Volume 9, Issue 3 On the definition of nonessentiality Udo Ebert University of Oldenburg Abstrat Nonessentiality of a good is often used in welfare eonomis, ost-benefit analysis and applied work. Various
More informationON A PROCESS DERIVED FROM A FILTERED POISSON PROCESS
ON A PROCESS DERIVED FROM A FILTERED POISSON PROCESS MARIO LEFEBVRE and JEAN-LUC GUILBAULT A ontinuous-time and ontinuous-state stohasti proess, denoted by {Xt), t }, is defined from a proess known as
More informationDiscrete Bessel functions and partial difference equations
Disrete Bessel funtions and partial differene equations Antonín Slavík Charles University, Faulty of Mathematis and Physis, Sokolovská 83, 186 75 Praha 8, Czeh Republi E-mail: slavik@karlin.mff.uni.z Abstrat
More informationA model for measurement of the states in a coupled-dot qubit
A model for measurement of the states in a oupled-dot qubit H B Sun and H M Wiseman Centre for Quantum Computer Tehnology Centre for Quantum Dynamis Griffith University Brisbane 4 QLD Australia E-mail:
More informationThe Hanging Chain. John McCuan. January 19, 2006
The Hanging Chain John MCuan January 19, 2006 1 Introdution We onsider a hain of length L attahed to two points (a, u a and (b, u b in the plane. It is assumed that the hain hangs in the plane under a
More informationModeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations
Computers and Chemial Engineering (00) 4/448 www.elsevier.om/loate/omphemeng Modeling of disrete/ontinuous optimization problems: haraterization and formulation of disjuntions and their relaxations Aldo
More informationA new method of measuring similarity between two neutrosophic soft sets and its application in pattern recognition problems
Neutrosophi Sets and Systems, Vol. 8, 05 63 A new method of measuring similarity between two neutrosophi soft sets and its appliation in pattern reognition problems Anjan Mukherjee, Sadhan Sarkar, Department
More informationResearch Article Approximation of Analytic Functions by Solutions of Cauchy-Euler Equation
Funtion Spaes Volume 2016, Artile ID 7874061, 5 pages http://d.doi.org/10.1155/2016/7874061 Researh Artile Approimation of Analyti Funtions by Solutions of Cauhy-Euler Equation Soon-Mo Jung Mathematis
More informationStochastic Combinatorial Optimization with Risk Evdokia Nikolova
Computer Siene and Artifiial Intelligene Laboratory Tehnial Report MIT-CSAIL-TR-2008-055 September 13, 2008 Stohasti Combinatorial Optimization with Risk Evdokia Nikolova massahusetts institute of tehnology,
More informationJAST 2015 M.U.C. Women s College, Burdwan ISSN a peer reviewed multidisciplinary research journal Vol.-01, Issue- 01
JAST 05 M.U.C. Women s College, Burdwan ISSN 395-353 -a peer reviewed multidisiplinary researh journal Vol.-0, Issue- 0 On Type II Fuzzy Parameterized Soft Sets Pinaki Majumdar Department of Mathematis,
More informationStability of alternate dual frames
Stability of alternate dual frames Ali Akbar Arefijamaal Abstrat. The stability of frames under perturbations, whih is important in appliations, is studied by many authors. It is worthwhile to onsider
More informationEstimating the probability law of the codelength as a function of the approximation error in image compression
Estimating the probability law of the odelength as a funtion of the approximation error in image ompression François Malgouyres Marh 7, 2007 Abstrat After some reolletions on ompression of images using
More informationMoments and Wavelets in Signal Estimation
Moments and Wavelets in Signal Estimation Edward J. Wegman 1 Center for Computational Statistis George Mason University Hung T. Le 2 International usiness Mahines Abstrat: The problem of generalized nonparametri
More informationAverage Rate Speed Scaling
Average Rate Speed Saling Nikhil Bansal David P. Bunde Ho-Leung Chan Kirk Pruhs May 2, 2008 Abstrat Speed saling is a power management tehnique that involves dynamially hanging the speed of a proessor.
More informationEXACT TRAVELLING WAVE SOLUTIONS FOR THE GENERALIZED KURAMOTO-SIVASHINSKY EQUATION
Journal of Mathematial Sienes: Advanes and Appliations Volume 3, 05, Pages -3 EXACT TRAVELLING WAVE SOLUTIONS FOR THE GENERALIZED KURAMOTO-SIVASHINSKY EQUATION JIAN YANG, XIAOJUAN LU and SHENGQIANG TANG
More informationOptimal Control of Air Pollution
Punjab University Journal of Mathematis (ISSN 1016-2526) Vol. 49(1)(2017) pp. 139-148 Optimal Control of Air Pollution Y. O. Aderinto and O. M. Bamigbola Mathematis Department, University of Ilorin, Ilorin,
More informationTwo Points Hybrid Block Method for Solving First Order Fuzzy Differential Equations
Journal of Soft Computing and Appliations 2016 No.1 (2016) 43-53 Available online at www.ispas.om/jsa Volume 2016, Issue 1, Year 2016 Artile ID jsa-00083, 11 Pages doi:10.5899/2016/jsa-00083 Researh Artile
More informationTHE computation of Fourier transforms (see Definition
IAENG International Journal of Applied Mathematis, 48:, IJAM_48 6 The Computation of Fourier Transform via Gauss-Regularized Fourier Series Qingyue Zhang Abstrat In this paper, we onstrut a new regularized
More informationA filled function method for finding a global minimizer on global integer optimization
Journal of Computational and Applied Mathematics 8 (2005) 200 20 www.elsevier.com/locate/cam A filled function method for finding a global minimizer on global integer optimization You-lin Shang a,b,,,
More informationMillennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion
Millennium Relativity Aeleration Composition he Relativisti Relationship between Aeleration and niform Motion Copyright 003 Joseph A. Rybzyk Abstrat he relativisti priniples developed throughout the six
More informationEffect of magnetization process on levitation force between a superconducting. disk and a permanent magnet
Effet of magnetization proess on levitation fore between a superonduting disk and a permanent magnet L. Liu, Y. Hou, C.Y. He, Z.X. Gao Department of Physis, State Key Laboratory for Artifiial Mirostruture
More informationWuming Li and Fan Yang
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 33 (004), 159 164 N DIMENSIONAL MINKOWSKI SPACE AND SPACE TIME ALGEBRA Wuming Li and Fan Yang (Reeived February 003) Abstrat. By using an n Dimensional Minkowski
More informationPacking Plane Spanning Trees into a Point Set
Paking Plane Spanning Trees into a Point Set Ahmad Biniaz Alfredo Garía Abstrat Let P be a set of n points in the plane in general position. We show that at least n/3 plane spanning trees an be paked into
More informationSINCE Zadeh s compositional rule of fuzzy inference
IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 14, NO. 6, DECEMBER 2006 709 Error Estimation of Perturbations Under CRI Guosheng Cheng Yuxi Fu Abstrat The analysis of stability robustness of fuzzy reasoning
More informationREFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS. 1. Introduction
Version of 5/2/2003 To appear in Advanes in Applied Mathematis REFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS MATTHIAS BECK AND SHELEMYAHU ZACKS Abstrat We study the Frobenius problem:
More informationBilinear Formulated Multiple Kernel Learning for Multi-class Classification Problem
Bilinear Formulated Multiple Kernel Learning for Multi-lass Classifiation Problem Takumi Kobayashi and Nobuyuki Otsu National Institute of Advaned Industrial Siene and Tehnology, -- Umezono, Tsukuba, Japan
More informationThe First Integral Method for Solving a System of Nonlinear Partial Differential Equations
ISSN 179-889 (print), 179-897 (online) International Journal of Nonlinear Siene Vol.5(008) No.,pp.111-119 The First Integral Method for Solving a System of Nonlinear Partial Differential Equations Ahmed
More informationRIEMANN S FIRST PROOF OF THE ANALYTIC CONTINUATION OF ζ(s) AND L(s, χ)
RIEMANN S FIRST PROOF OF THE ANALYTIC CONTINUATION OF ζ(s AND L(s, χ FELIX RUBIN SEMINAR ON MODULAR FORMS, WINTER TERM 6 Abstrat. In this hapter, we will see a proof of the analyti ontinuation of the Riemann
More informationA NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM
NETWORK SIMPLEX LGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM Cen Çalışan, Utah Valley University, 800 W. University Parway, Orem, UT 84058, 801-863-6487, en.alisan@uvu.edu BSTRCT The minimum
More informationA Functional Representation of Fuzzy Preferences
Theoretial Eonomis Letters, 017, 7, 13- http://wwwsirporg/journal/tel ISSN Online: 16-086 ISSN Print: 16-078 A Funtional Representation of Fuzzy Preferenes Susheng Wang Department of Eonomis, Hong Kong
More informationIs classical energy equation adequate for convective heat transfer in nanofluids? Citation Advances In Mechanical Engineering, 2010, v.
Title Is lassial energy equation adequate for onvetive heat transfer in nanofluids? Authors Wang, L; Fan, J Citation Advanes In Mehanial Engineering, 200, v. 200 Issued Date 200 URL http://hdl.handle.net/0722/24850
More informationDetermining both sound speed and internal source in thermo- and photo-acoustic tomography
Inverse Problems Inverse Problems (05) 05005 (0pp) doi:0.088/06656//0/05005 Determining both sound speed and internal soure in thermo and photoaousti tomography Hongyu Liu,,5 and Gunther Uhlmann,4 Department
More informationConvergence of the Logarithmic Means of Two-Dimensional Trigonometric Fourier Series
Bulletin of TICMI Vol. 0, No., 06, 48 56 Convergene of the Logarithmi Means of Two-Dimensional Trigonometri Fourier Series Davit Ishhnelidze Batumi Shota Rustaveli State University Reeived April 8, 06;
More informationProbabilistic Graphical Models
Probabilisti Graphial Models David Sontag New York University Leture 12, April 19, 2012 Aknowledgement: Partially based on slides by Eri Xing at CMU and Andrew MCallum at UMass Amherst David Sontag (NYU)
More informationError Bounds for Context Reduction and Feature Omission
Error Bounds for Context Redution and Feature Omission Eugen Bek, Ralf Shlüter, Hermann Ney,2 Human Language Tehnology and Pattern Reognition, Computer Siene Department RWTH Aahen University, Ahornstr.
More informationTime Domain Method of Moments
Time Domain Method of Moments Massahusetts Institute of Tehnology 6.635 leture notes 1 Introdution The Method of Moments (MoM) introdued in the previous leture is widely used for solving integral equations
More informationOrdered fields and the ultrafilter theorem
F U N D A M E N T A MATHEMATICAE 59 (999) Ordered fields and the ultrafilter theorem by R. B e r r (Dortmund), F. D e l o n (Paris) and J. S h m i d (Dortmund) Abstrat. We prove that on the basis of ZF
More informationRelative Maxima and Minima sections 4.3
Relative Maxima and Minima setions 4.3 Definition. By a ritial point of a funtion f we mean a point x 0 in the domain at whih either the derivative is zero or it does not exists. So, geometrially, one
More informationThe transition between quasi-static and fully dynamic for interfaces
Physia D 198 (24) 136 147 The transition between quasi-stati and fully dynami for interfaes G. Caginalp, H. Merdan Department of Mathematis, University of Pittsburgh, Pittsburgh, PA 1526, USA Reeived 6
More informationOn the Licensing of Innovations under Strategic Delegation
On the Liensing of Innovations under Strategi Delegation Judy Hsu Institute of Finanial Management Nanhua University Taiwan and X. Henry Wang Department of Eonomis University of Missouri USA Abstrat This
More informationSECOND HANKEL DETERMINANT PROBLEM FOR SOME ANALYTIC FUNCTION CLASSES WITH CONNECTED K-FIBONACCI NUMBERS
Ata Universitatis Apulensis ISSN: 15-539 http://www.uab.ro/auajournal/ No. 5/01 pp. 161-17 doi: 10.1711/j.aua.01.5.11 SECOND HANKEL DETERMINANT PROBLEM FOR SOME ANALYTIC FUNCTION CLASSES WITH CONNECTED
More informationOn the application of the spectral projected gradient method in image segmentation
Noname manusript No. will be inserted by the editor) On the appliation of the spetral projeted gradient method in image segmentation Laura Antonelli Valentina De Simone Daniela di Serafino May 22, 2015
More informationSQUARE ROOTS AND AND DIRECTIONS
SQUARE ROOS AND AND DIRECIONS We onstrut a lattie-like point set in the Eulidean plane that eluidates the relationship between the loal statistis of the frational parts of n and diretions in a shifted
More informationThe Influences of Smooth Approximation Functions for SPTSVM
The Influenes of Smooth Approximation Funtions for SPTSVM Xinxin Zhang Liaoheng University Shool of Mathematis Sienes Liaoheng, 5059 P.R. China ldzhangxin008@6.om Liya Fan Liaoheng University Shool of
More informationHILLE-KNESER TYPE CRITERIA FOR SECOND-ORDER DYNAMIC EQUATIONS ON TIME SCALES
HILLE-KNESER TYPE CRITERIA FOR SECOND-ORDER DYNAMIC EQUATIONS ON TIME SCALES L ERBE, A PETERSON AND S H SAKER Abstrat In this paper, we onsider the pair of seond-order dynami equations rt)x ) ) + pt)x
More informationNuclear Shell Structure Evolution Theory
Nulear Shell Struture Evolution Theory Zhengda Wang (1) Xiaobin Wang () Xiaodong Zhang () Xiaohun Wang () (1) Institute of Modern physis Chinese Aademy of SienesLan Zhou P. R. China 70000 () Seagate Tehnology
More informationConvergence Analysis of Transcendental Fractals
International Journal Computer Appliations (0975 8887) Convergene Analysis Transendental Fratals Shafali Agarwal Researh Sholar, Singhania University, Rajasthan, India Ashish Negi Phd, Dept. Computer Siene,
More informationGenerating Functions For Two-Variable Polynomials Related To a Family of Fibonacci Type Polynomials and Numbers
Filomat 30:4 2016, 969 975 DOI 10.2298/FIL1604969O Published by Faulty of Sienes and Mathematis, University of Niš, Serbia Available at: http://www.pmf.ni.a.rs/filomat Generating Funtions For Two-Variable
More informationRigorous prediction of quadratic hyperchaotic attractors of the plane
Rigorous predition of quadrati hyperhaoti attrators of the plane Zeraoulia Elhadj 1, J. C. Sprott 2 1 Department of Mathematis, University of Tébéssa, 12000), Algeria. E-mail: zeraoulia@mail.univ-tebessa.dz
More informationA FETI Method for a Class of Indefinite or Complex Second- or Fourth-Order Problems
A FETI Method for a Class of Indefinite or Complex Seond- or Fourth-Order Problems Charbel Farhat 1, Jing Li 2, Mihel Lesoinne 1 and Philippe Avery 1 1 University of Colorado at Boulder, Department of
More informationChapter 8 Hypothesis Testing
Leture 5 for BST 63: Statistial Theory II Kui Zhang, Spring Chapter 8 Hypothesis Testing Setion 8 Introdution Definition 8 A hypothesis is a statement about a population parameter Definition 8 The two
More informationDevelopment of Fuzzy Extreme Value Theory. Populations
Applied Mathematial Sienes, Vol. 6, 0, no. 7, 58 5834 Development of Fuzzy Extreme Value Theory Control Charts Using α -uts for Sewed Populations Rungsarit Intaramo Department of Mathematis, Faulty of
More informationThe shape of a hanging chain. a project in the calculus of variations
The shape of a hanging hain a projet in the alulus of variations April 15, 218 2 Contents 1 Introdution 5 2 Analysis 7 2.1 Model............................... 7 2.2 Extremal graphs.........................
More informationA Filled Function Method with One Parameter for R n Constrained Global Optimization
A Filled Function Method with One Parameter for R n Constrained Global Optimization Weixiang Wang Youlin Shang Liansheng Zhang Abstract. For R n constrained global optimization problem, a new auxiliary
More informationUnderstanding Elementary Landscapes
Understanding Elementary Landsapes L. Darrell Whitley Andrew M. Sutton Adele E. Howe Department of Computer Siene Colorado State University Fort Collins, CO 853 {whitley,sutton,howe}@s.olostate.edu ABSTRACT
More informationMaxmin expected utility through statewise combinations
Eonomis Letters 66 (2000) 49 54 www.elsevier.om/ loate/ eonbase Maxmin expeted utility through statewise ombinations Ramon Casadesus-Masanell, Peter Klibanoff, Emre Ozdenoren* Department of Managerial
More informationA two storage inventory model with variable demand and time dependent deterioration rate and with partial backlogging
Malaya Journal of Matematik, Vol. S, No., 35-40, 08 https://doi.org/0.37/mjm0s0/07 A two storage inventory model with variable demand and time dependent deterioration rate and with partial baklogging Rihi
More informationSome GIS Topological Concepts via Neutrosophic Crisp Set Theory
New Trends in Neutrosophi Theory and Appliations A.A.SALAMA, I.M.HANAFY, HEWAYDA ELGHAWALBY 3, M.S.DABASH 4,2,4 Department of Mathematis and Computer Siene, Faulty of Sienes, Port Said University, Egypt.
More informationTaste for variety and optimum product diversity in an open economy
Taste for variety and optimum produt diversity in an open eonomy Javier Coto-Martínez City University Paul Levine University of Surrey Otober 0, 005 María D.C. Garía-Alonso University of Kent Abstrat We
More informationThe law of the iterated logarithm for c k f(n k x)
The law of the iterated logarithm for k fn k x) Christoph Aistleitner Abstrat By a lassial heuristis, systems of the form osπn k x) k 1 and fn k x)) k 1, where n k ) k 1 is a rapidly growing sequene of
More informationDoes P=NP? Karlen G. Gharibyan. SPIRIT OF SOFT LLC, 4-th lane 5 Vratsakan 45, 0051, Yerevan, Armenia
1 Does P=NP? Om tat sat Karlen G. Gharibyan SPIRIT OF SOFT LLC, 4-th lane 5 Vratsakan 45, 0051, Yerevan, Armenia E-mail: karlen.gharibyan@spiritofsoft.om Abstrat-The P=NP? problem was emerged in 1971.
More informationUniversity of Groningen
University of Groningen Port Hamiltonian Formulation of Infinite Dimensional Systems II. Boundary Control by Interonnetion Mahelli, Alessandro; van der Shaft, Abraham; Melhiorri, Claudio Published in:
More informationSeismic dip estimation based on the two-dimensional Hilbert transform and its application in random noise attenuation a
Seismi dip estimation based on the two-dimensional Hilbert transform and its appliation in random noise attenuation a a Published in Applied Geophysis, 1, 55-63 (Marh 015) Cai Liu, Changle Chen, Dian Wang,
More informationThe Unified Geometrical Theory of Fields and Particles
Applied Mathematis, 014, 5, 347-351 Published Online February 014 (http://www.sirp.org/journal/am) http://dx.doi.org/10.436/am.014.53036 The Unified Geometrial Theory of Fields and Partiles Amagh Nduka
More informationOn maximal inequalities via comparison principle
Makasu Journal of Inequalities and Appliations (2015 2015:348 DOI 10.1186/s13660-015-0873-3 R E S E A R C H Open Aess On maximal inequalities via omparison priniple Cloud Makasu * * Correspondene: makasu@uw.a.za
More informationthe following action R of T on T n+1 : for each θ T, R θ : T n+1 T n+1 is defined by stated, we assume that all the curves in this paper are defined
How should a snake turn on ie: A ase study of the asymptoti isoholonomi problem Jianghai Hu, Slobodan N. Simić, and Shankar Sastry Department of Eletrial Engineering and Computer Sienes University of California
More informationTight bounds for selfish and greedy load balancing
Tight bounds for selfish and greedy load balaning Ioannis Caragiannis Mihele Flammini Christos Kaklamanis Panagiotis Kanellopoulos Lua Mosardelli Deember, 009 Abstrat We study the load balaning problem
More informationINTERNATIONAL JOURNAL OF CIVIL AND STRUCTURAL ENGINEERING Volume 2, No 4, 2012
INTERNATIONAL JOURNAL OF CIVIL AND STRUCTURAL ENGINEERING Volume, No 4, 01 Copyright 010 All rights reserved Integrated Publishing servies Researh artile ISSN 0976 4399 Strutural Modelling of Stability
More informationSURFACE WAVES OF NON-RAYLEIGH TYPE
SURFACE WAVES OF NON-RAYLEIGH TYPE by SERGEY V. KUZNETSOV Institute for Problems in Mehanis Prosp. Vernadskogo, 0, Mosow, 75 Russia e-mail: sv@kuznetsov.msk.ru Abstrat. Existene of surfae waves of non-rayleigh
More information11.1 Polynomial Least-Squares Curve Fit
11.1 Polynomial Least-Squares Curve Fit A. Purpose This subroutine determines a univariate polynomial that fits a given disrete set of data in the sense of minimizing the weighted sum of squares of residuals.
More informationAfter the completion of this section the student should recall
Chapter I MTH FUNDMENTLS I. Sets, Numbers, Coordinates, Funtions ugust 30, 08 3 I. SETS, NUMERS, COORDINTES, FUNCTIONS Objetives: fter the ompletion of this setion the student should reall - the definition
More informationCollinear Equilibrium Points in the Relativistic R3BP when the Bigger Primary is a Triaxial Rigid Body Nakone Bello 1,a and Aminu Abubakar Hussain 2,b
International Frontier Siene Letters Submitted: 6-- ISSN: 9-8, Vol., pp -6 Aepted: -- doi:.8/www.sipress.om/ifsl.. Online: --8 SiPress Ltd., Switzerland Collinear Equilibrium Points in the Relativisti
More informationc-perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories
-Perfet Hashing Shemes for Binary Trees, with Appliations to Parallel Memories (Extended Abstrat Gennaro Cordaso 1, Alberto Negro 1, Vittorio Sarano 1, and Arnold L.Rosenberg 2 1 Dipartimento di Informatia
More informationBroadcast Channels with Cooperating Decoders
To appear in the IEEE Transations on Information Theory, Deember 2006. 1 Broadast Channels with Cooperating Deoders Ron Dabora Sergio D. Servetto arxiv:s/0505032v3 [s.it] 1 Nov 2006 Abstrat We onsider
More informationA Characterization of Wavelet Convergence in Sobolev Spaces
A Charaterization of Wavelet Convergene in Sobolev Spaes Mark A. Kon 1 oston University Louise Arakelian Raphael Howard University Dediated to Prof. Robert Carroll on the oasion of his 70th birthday. Abstrat
More informationA NOVEL FILLED FUNCTION METHOD FOR GLOBAL OPTIMIZATION. 1. Introduction Consider the following unconstrained programming problem:
J. Korean Math. Soc. 47, No. 6, pp. 53 67 DOI.434/JKMS..47.6.53 A NOVEL FILLED FUNCTION METHOD FOR GLOBAL OPTIMIZATION Youjiang Lin, Yongjian Yang, and Liansheng Zhang Abstract. This paper considers the
More information3 Tidal systems modelling: ASMITA model
3 Tidal systems modelling: ASMITA model 3.1 Introdution For many pratial appliations, simulation and predition of oastal behaviour (morphologial development of shorefae, beahes and dunes) at a ertain level
More informationThe Effectiveness of the Linear Hull Effect
The Effetiveness of the Linear Hull Effet S. Murphy Tehnial Report RHUL MA 009 9 6 Otober 009 Department of Mathematis Royal Holloway, University of London Egham, Surrey TW0 0EX, England http://www.rhul.a.uk/mathematis/tehreports
More informationQuasi-Monte Carlo Algorithms for unbounded, weighted integration problems
Quasi-Monte Carlo Algorithms for unbounded, weighted integration problems Jürgen Hartinger Reinhold F. Kainhofer Robert F. Tihy Department of Mathematis, Graz University of Tehnology, Steyrergasse 30,
More informationThe Second Postulate of Euclid and the Hyperbolic Geometry
1 The Seond Postulate of Eulid and the Hyperboli Geometry Yuriy N. Zayko Department of Applied Informatis, Faulty of Publi Administration, Russian Presidential Aademy of National Eonomy and Publi Administration,
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematis A NEW ARRANGEMENT INEQUALITY MOHAMMAD JAVAHERI University of Oregon Department of Mathematis Fenton Hall, Eugene, OR 97403. EMail: javaheri@uoregon.edu
More informationarxiv:cond-mat/ v1 [cond-mat.stat-mech] 16 Aug 2004
Computational omplexity and fundamental limitations to fermioni quantum Monte Carlo simulations arxiv:ond-mat/0408370v1 [ond-mat.stat-meh] 16 Aug 2004 Matthias Troyer, 1 Uwe-Jens Wiese 2 1 Theoretishe
More informationTHEre are many physical phenomena that can be described
IAENG International Journal of Applied Mathematis, 8:, IJAM_8 3 On Young Funtionals Related to Certain Class of Rapidly Osillating Sequenes Andrzej Z. Grzybowski, Member, IAENG, Piotr Puhała Abstrat The
More informationEffect of Rotation, Magnetic Field and Initial Stresses on Propagation of Plane Waves in Transversely Isotropic Dissipative Half Space
Applied Mathematis 4 7- http://dx.doi.org/.436/am..48a5 Published Online August (http://www.sirp.org/journal/am) Effet of otation Magneti Field and Initial Stresses on Propagation of Plane Waves in Transversely
More informationResearch Article Finding Global Minima with a Filled Function Approach for Non-Smooth Global Optimization
Hindawi Publishing Corporation Discrete Dynamics in Nature and Society Volume 00, Article ID 843609, 0 pages doi:0.55/00/843609 Research Article Finding Global Minima with a Filled Function Approach for
More information