the development of multimedia and network technology which provide a new carrier and platform for the traditional teaching, is also the foundation of hybrid teaching mode, which is a hot topic in the research of teach...
详细信息
ISBN:
(纸本)9781467383028
the development of multimedia and network technology which provide a new carrier and platform for the traditional teaching, is also the foundation of hybrid teaching mode, which is a hot topic in the research of teaching reform in colleges and universities. Flipped classroom emphasizes the students as the subject, and the teacher as a supplement, which truly reflects the "student centered" education idea. At first, this paper analyzes the present mainly existing problems in Java programming course, and then puts forward a hybrid flipped classroom teaching mode according to the type and characteristics of knowledge points, and apply it to the teaching practice. Finally, taking the students of Java programming course as research object, this paper investigated and analyzed the application effect of hybrid flipped classroom teaching mode, the results of the survey show that this teaching mode has good application effect.
the traditional PID control algorithm requires tuning and optimization to achieve better control performance in the nonlinear time-delay system, which complicates the controller design. We proposed a new self-tuning a...
详细信息
ISBN:
(纸本)9781450385855
the traditional PID control algorithm requires tuning and optimization to achieve better control performance in the nonlinear time-delay system, which complicates the controller design. We proposed a new self-tuning and optimization algorithm for controller parameters based on Adaptive Dynamic programming(ADP). the algorithm uses neural networks to approximate the performance index functions and control strategies in dynamic programming to achieve online self-tuning and optimization of control parameters. Using ADP and Genetic algorithms tuning Proportional-IntegralDerivative(PID) control parameters and comparing the results can demonstrate the feasibility and effectiveness of our proposed approach.
this paper involves an unrelated parallel machine scheduling problem. Setup times are sequence dependent. A mixed integer linear programming model that represents the system is formulated. Two measures of performance,...
详细信息
ISBN:
(数字)9781728167855
ISBN:
(纸本)9781728167855
this paper involves an unrelated parallel machine scheduling problem. Setup times are sequence dependent. A mixed integer linear programming model that represents the system is formulated. Two measures of performance, makespan, total tardiness, and a combination of both measures, are minimize Results from a numerical example show that, with a proper weight between the two measures, a compromise solution can be found.
Given A is an element of Z(mxn) and b is an element of Z(m), we provide a sharp upper bound for the l(infinity)-distance from any vertex of the polyhedron P(A, b) = {x is an element of R->= 0(n) : Ax = b} to a near...
详细信息
ISBN:
(纸本)9781665481908
Given A is an element of Z(mxn) and b is an element of Z(m), we provide a sharp upper bound for the l(infinity)-distance from any vertex of the polyhedron P(A, b) = {x is an element of R->= 0(n) : Ax = b} to a nearby feasible integral point under a strong assumption regarding the dimensions of the matrix A. It is hoped that this result provides motivation for conducting further research into providing more such upper bounds under certain additional assumptions.
programming Language has been a basic course for non-computer specialized students, however, using the traditional teaching method which focuses on knowledge system is difficult to stimulate students' interest in ...
详细信息
ISBN:
(纸本)9781467302395
programming Language has been a basic course for non-computer specialized students, however, using the traditional teaching method which focuses on knowledge system is difficult to stimulate students' interest in learning, making teach effects not satisfactory. Based on years of teaching practice, this article discusses about educational reforms of this course ranging from teaching methods, practical teaching to evaluation of teaching. An alternative teaching method based on the teaching content of project organization is introduced as a key point in the article and how to strengthen the practical teaching of the course is also included.
the Perceptron Problem (PP) appeared for the first time in the Learning Machines and is very useful for zero-knowledge identification schemes in cryptology. the problem is NP-complete and no deterministic algorithm is...
详细信息
ISBN:
(纸本)9781424437597
the Perceptron Problem (PP) appeared for the first time in the Learning Machines and is very useful for zero-knowledge identification schemes in cryptology. the problem is NP-complete and no deterministic algorithm is known to date. In this paper we develop a deterministic method based on DC (Difference of Convex functions) programming and DCA (DC optimization Algorithms), an innovative approach in nonconvex programming framework. We first formulate the PP as a concave minimization programming problem. then, we show how to apply DC programming and DCA for the resulting problem. Numerical results demonstrate that the proposed algorithm is promising: its is very fast and can efficiently solve the Perceptron Problem with large sizes.
programming is a difficult course and often the result of its assessment is not encouraging. programming skill is very important to graduate in order to get job and to success in the industry. A careful assessment is ...
详细信息
ISBN:
(纸本)9781450354141
programming is a difficult course and often the result of its assessment is not encouraging. programming skill is very important to graduate in order to get job and to success in the industry. A careful assessment is required to help the student learning. It is proved that the assessment itself will improve the learning. the review showed to-date that there are several automatic assessment for programming skills, however, there is no common grading being applied. this paper, is proposing an assessment framework based on Bloom Taxonomy cognitive domain to assess students programming skills. the focus is on basic programming course which introduce the programming concept to students.
In this paper, we propose a linear programming based interactive method for multiobjective linear programming problems, in which fuzzy coefficients and random variable coefficients are involved in the objective functi...
详细信息
ISBN:
(纸本)9781479959556
In this paper, we propose a linear programming based interactive method for multiobjective linear programming problems, in which fuzzy coefficients and random variable coefficients are involved in the objective functions simultaneously. In the proposed method, it is assumed that the decision maker has a fuzzy goal for each objective function, and such a fuzzy goal can be quantified by eliciting the membership function. through the possibility measure and a fractile optimization model, the original problem is transformed to the well-defined multiobjective programming problem. then, a generalized Pareto optimal concept is defined, and a linear programming based interactive algorithm is proposed to obtain a satisfactory solution from among a generalized Pareto optimal solution set.
the nonlinear complementarity problem (NCP) has been served as a general framework for linear, quadratic, and nonlinear programming, linear complementarity problem, and some equilibrium problems. Applications of the N...
详细信息
ISBN:
(纸本)9781424437597
the nonlinear complementarity problem (NCP) has been served as a general framework for linear, quadratic, and nonlinear programming, linear complementarity problem, and some equilibrium problems. Applications of the NCP can be found in many important fields such as economics, mathematical programming, operations research, engineering and mechanics. In this article, we consider smooth NCP on the basis of the square Penalized Fiscber-Burmeister function. We show under certain assumptions, any stationary point of the unconstrained minimization problem is already a solution of smooth NCP. Furthermore, a derivative-free descent algorithm is suggested and conditions for its convergence are given. Finally, some preliminary numerical results are presented.
暂无评论