A NEW GENERATOR FOR PARAMETRIC DRAFTING PROGRAM

In this paper a new generator for parametric drafting program is presented.The func- tions and the syntax of the parametric drafting program are described.This software has been suc- cessfully used to generate a parametric drafting program for designs of motors.

Code Transform Model Producing High-Performance Program

This paper introduces a novel transform method to produce the newly generated programs through code transform model called the second generation of Generative Pre-trained Transformer(GPT-2)reasonably,improving the program execution performance significantly.Besides,a theoretical estimation in statistics has given the minimum number of generated programs as required,which guarantees to find the best one within them.The proposed approach can help the voice assistant machine resolve the problem of inefficient execution of application code.In addition to GPT-2,this study develops the variational Simhash algorithm to check the code similarity between sample program and newly generated program,and conceives the piecewise longest common subsequence algorithm to examine the execution’s conformity from the two programs mentioned above.The code similarity check deducts the redundant generated programs,and the output conformity check finds the best-performing generative program.In addition to texts,the proposed approach can also prove the other media,including images,sounds,and movies.As a result,the newly generated program outperforms the sample program significantly because the number of code lines reduces 27.21%,and the program execution time shortens 24.62%.

MINIMUM DISCRIMINATION INFORMATION PROBLEMS VIA GENERALIZED GEOMETRIC PROGRAMMING

In this paper,the quadratic program problem and minimum discrimination information (MDI) problem with a set of quadratic inequality constraints and entropy constraints of density are considered.Based on the properties of the generalized geometric programming,the dual programs of these two problems are derived.Furthermore,the duality theorems and related Kuhn-Tucker conditions for two pairs of the prime-dual programs are also established by the duality theory.

Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.

THE SUFFICIENT EFFICIENCY CONDITIONS IN SEMIINFINITE MULTIOBJECTIVE FRACTIONAL PROGRAMMING UNDER HIGHER ORDER EXPONENTIAL TYPE HYBRID TYPE INVEXITIES

First, a class of higher order exponential type hybrid （α,β, γ, η, p, h（.,.）, κ（., .）, w（.,., .）, ω（.,.,.）, θ）-invexities is introduced, second, some parametrically sufficient efficiency conditions based on the higher order exponential type hybrid invexities are established, and finally some parametrically sufficient efficiency results under the higher order exponential type hybrid （a,β, γ, ρ, h（.,.）, k（.,-）, w（-,., .）, w（.,., .）, 0）-invexities are investigated to the context of solving semiinfinite multiobjective fractional programming problems. The notions of the higher order exponential type hybrid （a, β, γ η, p, h（., .）, n（., .）, w（-,.,-）, ω（.,.,.）, 0）-invexities encompass most of the generalized invexities in the literature. To the best of our knowledge, the results on semiinfinite multiobjective fractional programming problems established in this communication are new and application-oriented toward multitime multi- objectve problems as well as multiobiective control problems.

NEW SYSTEMS OF GENERALIZED QUASI-VARIATIONAL INCLUSIONS IN FC-SPACES AND APPLICATIONS

In this paper, we study some new systems of generalized quasi-variational inclusion problems in FC-spaces without convexity structure.By applying an existence theorem of maximal elements of set-valued mappings due to the author, some new existence theorems of solutions for the systems of generalized quasi-variational inclusion problems are proved in noncompact FC-spaces. As applications, some existence results of solutions for the system of quasi-optimization problems and mathematical programs with the systems of generalized quasi-variational inclusion constraints are obtained in FC-spaces.

Existence results for generalized vector equilibrium problems with applications

By a coincidence theorem, some existence theorems of solutions are proved for four types of generalized vector equilibrium problems with moving cones. Applications to the generalized semi-infinite programs with the generalized vector equilibrium constraints under the mild conditions are also given. The results of this paper unify and improve the corresponding results in the previous literature.

Two-Level Linear Relaxation Method for Generalized Linear Fractional Programming

This paper presents an efficient algorithm for globally solving a generalized linear fractional programming problem.For establishing this algorithm,we firstly construct a two-level linear relaxation method,and by utilizing the method,we can convert the initial generalized linear fractional programming problem and its subproblems into a series of linear programming relaxation problems.Based on the branch-and-bound framework and linear programming relaxation problems,a branch-and-bound algorithm is presented for globally solving the generalized linear fractional programming problem,and the computational complexity of the algorithm is given.Finally,numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm.

Generalized Goal Programming and Its Application in Water Environmental System

This paper presents the concept of generalized goal programming (GGP), the characteristics of the programming model is "designing optimum system". Firstly, based on the synthesis of goal programming and Denovo programming, one type of generalized goal programming model is established. In the paper the properties of feasible region is studied. Secondly, GGP is enlarged to the case that fuzzy parameters and fuzzy goal sets exist in the GGP model, the solution methods using fuzzy set theory for GGP with fuzzy parameters are provided. Finally, this approach has been used to analyse a water environmental system in coastal city, thus proving its usefulness.

Discrete Simulation Software Styles and GPMS

GPMS is a new integrated simulation modelling environment for discrete event systems. It is composed of several independent components which perform different tasks in the process of simulation modelling and owns a number of features from different kinds of simulation software. This paper introduces GPMS through reviewing and discussing various discrete simulation software styles.