Optimization of Generator Based on Gaussian Process Regression Model with Conditional Likelihood Lower Bound Search

The noise that comes from finite element simulation often causes the model to fall into the local optimal solution and over fitting during optimization of generator.Thus,this paper proposes a Gaussian Process Regression(GPR)model based on Conditional Likelihood Lower Bound Search(CLLBS)to optimize the design of the generator,which can filter the noise in the data and search for global optimization by combining the Conditional Likelihood Lower Bound Search method.Taking the efficiency optimization of 15 kW Permanent Magnet Synchronous Motor as an example.Firstly,this method uses the elementary effect analysis to choose the sensitive variables,combining the evolutionary algorithm to design the super Latin cube sampling plan;Then the generator-converter system is simulated by establishing a co-simulation platform to obtain data.A Gaussian process regression model combing the method of the conditional likelihood lower bound search is established,which combined the chi-square test to optimize the accuracy of the model globally.Secondly,after the model reaches the accuracy,the Pareto frontier is obtained through the NSGA-II algorithm by considering the maximum output torque as a constraint.Last,the constrained optimization is transformed into an unconstrained optimizing problem by introducing maximum constrained improvement expectation(CEI)optimization method based on the re-interpolation model,which cross-validated the optimization results of the Gaussian process regression model.The above method increase the efficiency of generator by 0.76%and 0.5%respectively;And this method can be used for rapid modeling and multi-objective optimization of generator systems.

Lower Bounds of Decay Rates for Solution to the Single-Layer Quasi-Geostrophic Model

In this paper, we study the long-time behavior of solutions of the single-layer quasi-geostrophic model arising from geophysical fluid dynamics. We obtain the lower bound of the decay estimate of the solution. Utilizing the Fourier splitting method, under suitable assumptions on the initial data, for any multi-index α, we show that the solution Ψ satisfies .

Lower bound on BER performance for maximal ratio combining with weighting errors

The theoretical lower bounds on mean squared channel estimation errors for typical fading channels are presented by the infinite-length and non-causal Wiener filter and the exact closed-form expressions of the lower bounds for different channel Doppler spectra are derived. Based on the obtained lower bounds on mean squared channel estimation errors, the limits on bit error rate （BER） for maximal ratio combining （MRC） with Gaussian distributed weighting errors on independent and identically distributed （i. i. d） fading channels are presented. Numerical results show that the BER performances of ideal MRC are the lower bounds on the BER performances of non-ideal MRC and deteriorate as the maximum Doppler frequency increases or the SNR of channel estimate decreases.

The Estimation for Lower Bounds of the Solutions of Fermat's Equation

Let p be a prime with p≡3(mod 4). In this paper,by using some results relate the representation of integers by primitive binary quadratic forms,we prove that if x,y,z are positive integers satisfying x^p+y^p=z^p, p|xyz, x<y<z, then y>p^(6p-2)/2.

LOWER BOUNDS ESTIMATE FOR THE BLOW-UP TIME OF A NONLINEAR NONLOCAL POROUS MEDIUM EQUATION

The lower bounds for the blow-up time of blow-up solutions to the nonlinear nolocal porous equation ut=△u^m＋u^p∫Ωu^qdxwith either null Dirichlet boundary condition or homogeneous Neumann boundary condi- tion is given in this article by using a differential inequality technique.

ON THE LOWER BOUND FOR A CLASS OF HARMONIC FUNCTIONS IN THE HALF SPACE

The main objective is to derive a lower bound from an upper one for harmonic functions in the half space, which extends a result of B. Y. Levin from dimension 2 to dimension n 〉 2. To this end, we first generalize the Carleman＇s formula for harmonic functions in the half plane to higher dimensional half space, and then establish a Nevanlinna＇s representation for harmonic functions in the half sphere by using HSrmander＇s theorem.

NEW LOWER BOUNDS FOR LEE DISCREPANCY ON TWO AND THREE MIXED LEVELS FACTORIALS

The objective of this paper is to study the issue of uniformity on asymmetrical designs with two and three mixed levels in terms of Lee discrepancy. Based on the known formulation, we present a new lower bound of Lee discrepancy of fractional factorial designs with two and three mixed levels. Our new lower bound is sharper and more valid than other existing lower bounds in literature, which is a useful complement to the lower bound theory of discrepancies.

A LOWER BOUND APPROACH TO THE YIELD LOCI OF POROUS MATERIALS

A lower bound approach is proposed for the first time to solve the macroscopic yield loci of porous materials.The results are then compared with Gurson's upper bound yield loci and those of the experiments.It is shown that the present analysis is much more in accordance with the experimen- tal results than the Gurson's.

LOWER BOUNDS OF BLOW UP TIME FOR A SYSTEM OF SEMI-LINEAR HYPERBOLIC PETROVSKY EQUATIONS

Li et al. in [3] obtained blow-up results for a system of Petrovskey equations in some different cases. In this article we obtain lower bounds for the blow up time under some considerations on initial data.

LOWER BOUND LIMIT ANALYSIS OF THREE-DIMENSIONAL ELASTOPLASTIC STRUCTURES BY BOUNDARY ELEMENT METHOD

Based on the lower bound theorem of limit analysis, a solution procedure for limit analysis of three_dimensional elastoplastic structures was established using conventional boundary element method (BEM). The elastic stress field for lower bound limit analysis was computed directly by three_dimensional boundary element method (3_D BEM). The self_equilibrium stress field was constructed by the linear combination of several self_equilibrium “basis vectors” which can be computed by elastic_plastic incremental iteration of 3_D BEM analysis. The lower bound limit analysis problem was finally reduced to a series of nonlinear programming sub_problems with relatively few optimal variables. The complex method was used to solve the nonlinear programming sub_problems. The numerical results show that the present solution procedure has good accuracy and high efficiency.

Lower bounds and modified LPT algorithm for k-partitioning problems with partition matroid constraint

In this paper, the k-partitioning problem with partition matroid constraint is considered. LPT algorithm is modified to fit the problem and its worst-ease performance is analyzed. The lower bounds of optimal solution for the min-max problem are given.

AN ASYMPTOTIC-NUMERICAL ANALYSIS FOR THE LOWER BOUND DYNAMIC BUCKLING ESTIMATES

A finite element asymptotic analysis for determining the lower bound dynamic buckling estimates of imperfection-sensitive structures under step load of infinite duration is presented. The lower bound dynamic buckling loads and the corresponding displacements are sought in the form of asymptotic expansions based on the static stability criterion and they can be determined by solving numerically (FEM) several linear problems with a single nonsingular sub-stiffness matrix.

Lower bound for the security of differential phase shift quantum key distribution against a one-pulse-attack

Quantum key distribution is the art of sharing secret keys between two distant parties, and has attracted a lot of attention due to its unconditional security. Compared with other quantum key distribution protocols, the differential phase shift quantum key distribution protocol has higher efficiency and simpler apparatus. Unfortunately, the uncondi- tional security of differential phase shift quantum key distribution has not been proved. Utilizing the sharp continuity of the von Neuman entropy and some basic inequalities, we estimate the upper bound for the eavesdropper Eve＇s infor- mation. We then prove the lower bound for the security of the differential phase shift quantum key distribution protocol against a one-pulse attack with Devatak-Winter＇s secret key rate formula.

Area-time associated test cost model for SoC and lower bound of test time

A novel test access mechanism （TAM） architecture with multi test-channel （TC） based on IEEE Standard 1500 is proposed instead of the traditional sub-TAM structure. The cost model of an area-time associated test and the corresponding lower bound of system-on-chip （SoC） test time are established based on this TAM architecture. The model provides a more reliable method to control the SoC scheduling and reduces the complexity in related algorithm research. The result based on the area time associated test cost model has been validated using the ITC02 test benchmark.

Lower Bound Limit Analysis of Anisotropic Soils

Previous approaches can only tackle anisotropic problems with cohesion varying with direction.A novel linearization of the Mohr-Coulomb yield criterion associated with plane strain problem has been achieved by simulating the Mohr’s circle with orientation lines inσ-τspace,which allows for lower bound solution of soils with cohesion and friction coefficient varying with direction.The finite element lower limit analysis formulation using the modified anisotropic yield criterion is then developed.Several examples are given to illustrate the capability and effectiveness of the proposed numerical procedure for computing rigorous lower bounds for anisotropic soils.

Multistatic radar analysis based on ambiguity function and Cramér-Rao lower bounds

The primary goal of this work is to characterize the impact of weighting selection strategy and multistatic geometry on the multistatic radar performance. With the relationship between the multistatic ambiguity function （AF） and the multistatie Cram6r-Rao lower bound （CRLB）, the problem of calculating the multistatic AF and the multistatic CRLB as a performance metric for multistatic radar system is studied. Exactly, based on the proper selection of the system parameters, the multistatic radar performance can be significantly improved. The simulation results illustrate that the multistatic AF and the multistatic CRLB can serve as guidelines for future multistatic fusion rule development and multistatic radars deployment.

Cramér-Rao lower bound analysis for guidance systems with bearings-only measurements

Most currently existing investigations on the observability of passive guidance systems can only provide a qualitative result. In this paper, a quantitative method, which utilizes Cramér-Rao lower bound in the estimability analysis of closed-loop guidance systems with bearings-only measurements, is proposed. The new method provides an intuitive result for observability of the guidance system through graphical analysis. As a demonstration, a numerical example is presented, in which the degrees of observability of the guidance systems under two commonly used guidance laws are compared by using the new approach.

Remarks on the lower bounds for sums of the BDH type

This paper will correct some gaps existing in the proof of a theorem written in an earlier paper by the author on the lower bounds for sums of BDH type published in 1993. Some improvements upon the previous version of that theorem will be obtained.

Sharp Lower Bound of the Least Eigenvalue of Graphs with Given Diameter

The eigenvalues of graphs play an important role in the fields of quantum chemistry, physics, computer science, communication network, and information science. Particularly, they can be interpreted in some situations as the energy levels of an electron in a molecule or as the possible frequencies of the tone of a vibrating membrane. The diameter of a graph, the maximum distance between any two vertices of a graph, has great impact on the service quality of communication networks. So we were motivated to investigate the sharp lower bound of the least eigenvalue of graphs with given diameter. Let gn. d be the set of graphs on n vertices with diameter d. For any graph G ∈ gn, d, by considering the least eigenvalue of its connected spanning bipartite subgraph, we obtained the sharp lower bound of the least eigenvalue of graph G. Furthermore, an upper bound of Laplacian spectral radius of graph G was given.

LOWER BOUNDS ON THE MAXIMUM GENUS OF LOOPLESS MULTIGRAPHS

The lower bounds on the maximum genus of loopless graphs are obtained according to the connectivity of these graphs. This not only answers a question of Chen, Archdeacon and Gross, but also generalizes the previous known results. Thus, a picture of the lower bounds on the maximum genus of loopless multigraphs is presented.