Construction of stochastic simulation metamodels with segmented polynomials

SIMULATION ◽  
2021 ◽  
pp. 003754972110187
Author(s):  
Pedro M. Reis dos Santos ◽  
M. Isabel Reis dos Santos

Metamodels are an important tool in simulation analysis as they can provide insight about the behavior of the simulation response. Modeling the response with low-degree polynomial segments allows the identification of different behavior zones and the parameters still have relation with the physical world. The purpose of this paper is to extend the use of segmented polynomial functions for simulation metamodeling, where the segments have at most identical value and slope at the breaks. Our approach is to build segmented polynomials metamodels where the hypothesis of degree and continuity of splines are less exigent, allowing more flexibility of the approximation. When breaks are known, constrained least squares are used for metamodel estimation, taking into account the linear formulation of the problem. If breaks have to be estimated, the unconstrained nonlinear regression theory is used, when it can be applied. Otherwise, the estimation is performed using an iterative algorithm which is applied repeatedly in a cyclic manner for estimating the breaks, and jackknifing yields the confidence intervals.

2016 ◽  
Vol 59 ◽  
pp. 04003
Author(s):  
Nuraddeen Muhammad Babangida ◽  
Muhammad Raza Ul Mustafa ◽  
Khamaruzaman Wan Yusuf ◽  
Mohamed Hasnain Isa ◽  
Imran Baig

2005 ◽  
Vol 8 ◽  
pp. 46-79 ◽  
Author(s):  
Derek F. Holt ◽  
Colva M. Roney-Dougal

AbstractThe maximal subgroups of the finite classical groups are divided by a theorem of Aschbacher into nine classes. In this paper, the authors show how to construct those maximal subgroups of the finite classical groups of linear, symplectic or unitary type that lie in the first eight of these classes. The ninth class consists roughly of absolutely irreducible groups that are almost simple modulo scalars, other than classical groups over the same field in their natural representation. All of these constructions can be carried out in low-degree polynomial time.


Geometry ◽  
2013 ◽  
Vol 2013 ◽  
pp. 1-2 ◽  
Author(s):  
E. Ballico

Fix integers m≥5 and d≥3. Let f be a degree d homogeneous polynomial in m+1 variables. Here, we prove that f is the sum of at most d·⌈(m+dm)/(m+1)⌉d-powers of linear forms (of course, this inequality is nontrivial only if m≫d.)


2014 ◽  
Vol 501-504 ◽  
pp. 474-479
Author(s):  
Workuha Dagnew Assefa ◽  
Juan Juan Ren

With in the development of high-speed railway countrys China is one of the competent use of ballast less track spreader and largely applied on sub grade, in order to ensure high speed, safe and comfortable run of the train, the sub grade structure must provide smoother and more stable support for the upper track structure, but the problems caused by non uniformity sub grade structure performance are increasingly prominent. There have many serious problems such as low precision of measurement, low degree of automation, compaction mechanism, sometimes consolidation time and high interference of human factors. This paper described as the structural characteristics of longitudinal coupled prefabricated slab track System similar to bögl from German, a model for static analysis has been developed. Based on the model, the slab track element is presented. This element includes rail, rail fastening, prefabricated slab, CA mortar, and base plate and sub grade.


2013 ◽  
Vol 9 (2) ◽  
pp. 347-363
Author(s):  
Francis Deboeverie ◽  
Peter Veelaert ◽  
Wilfried Philips

2004 ◽  
Vol 69 (2) ◽  
pp. 305-315 ◽  
Author(s):  
Eike Kiltz ◽  
Arne Winterhof

We obtain lower bounds on degree and weight of bivariate polynomials representing the Diffie-Hellman mapping for finite fields and the Diffie-Hellman mapping for elliptic curves over finite fields. This complements and improves several earlier results. We also consider some closely related bivariate mappings called P-Diffie-Hellman mappings introduced by the first author. We show that the existence of a low degree polynomial representing a P-Diffie-Hellman mapping would lead to an efficient algorithm for solving the Diffie-Hellman problem. Motivated by this result we prove lower bounds on weight and degree of such interpolation polynomials, as well.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Zhuopin Guo ◽  
Jie Zhen ◽  
Yiying Qu ◽  
Hao Ren

Under China’s distinct policy-driven agglomeration approach, the Chinese industrial park displays a low degree of industrial relevance and weak cooperation among enterprises in the park. The key to solving this problem lies in the guiding role of the park management committee. Accordingly, this study constructs a trilateral evolutionary game model of interenterprise cooperative innovation inside the industrial park under the supervision of the park management committee, leadership of the core enterprises, and with the participation of the small- and medium-sized enterprises. Through simulation analysis, this study explores the influencing factors behind the trilateral cooperative innovation strategy choices. Results show that (1) the park management committee, core enterprises, and small- and medium-sized enterprises have different degrees of influence on each other’s willingness to participate in cooperative innovation; (2) small- and medium-sized enterprises are sensitive to the management committee’s policy support, and core enterprises are sensitive to the management committee’s financial support; (3) core enterprises are more sensitive to penalties and income distribution than small- and medium-sized enterprises; (4) the degree of resource complementarity and trust among enterprises has a profound effect on core enterprises and small- and medium-sized enterprises’ willingness to participate in cooperative innovation.


Sign in / Sign up

Export Citation Format

Share Document