摘要：We consider the problem of displaying commer- cial advertisements on web pages, in the ＂cost per click＂ model. The advertisement server has to learn the appeal of each type of visitor for the different advertisements in order to maximize the profit. Advertisements have constraints such as a certain number of clicks to draw, as well as a lifetime. This problem is thus inherently dynamic, and intimately com- bines combinatorial and statistical issues. To set the stage, it is also noteworthy that we deal with very rare events of in- terest, since the base probability of one click is in the or- der of 10-4. Different approaches may be thought of, rang- ing from computationally demanding ones （use of Markov decision processes, or stochastic programming） to very fast ones. We introduce NOSEED, an adaptive policy learning al- gorithm based on a combination of linear programming and multi-arm bandits. We also propose a way to evaluate the extent to which we have to handle the constraints （which is directly related to the computation cost）. We investigate the performance of our system through simulations on a realistic model designed with an important commercial web actor.

摘要：An optimal allocation of earth is of great significance to reduce the project cost and duration in the construction of rock-fill dams. The earth allocation is a dynamic system affected by various time-space constraints. Based on previous studies, a new method of optimizing this dynamic system as a static one is presented. In order to build a generalized and flexible model of the problem, some man-made constraints were investigated in building the mathematic model. linear programming and simplex method are introduced to solve the optimization problem of earth allocation. A case study in a large-scale rock-fill dam construction project is presented to demonstrate the proposed method and its successful application shows the feasibility and effectiveness of the method.

摘要：Using GIS, GPS, GPRS and RFID, a dynamic information management system of digital mining in an open pit was designed and developed.A linear programming model was set up in a practical *** the model, the system can automatically draw up production plan of ore blending well every *** system can monitor and dispatch open-pit trucks and shovels well, and can play back their historical *** can monitor and control the process of mining production in real *** RFID, the system can also count the number of trucks'delivery and shovels'loading *** on real scenes show that the performance of this system is stable and can satisfy production standards of mining in open pits.

摘要：In this paper we compute Karmarkar's projections quickly using MoorePenrose g-inverse and matrix factorization. So the computation work of (ATD2A)-1is decreased.

摘要：Aiming to efficiently support theLocator/Identifier Separation Protocol(LISP),in this paper,we present an enhanced pointerbased DHT mapping system:*** system creates a pointer space to build ontop of standard *** within thepointer space are(Endpoint Identifiers(EID),pointers) where the pointer is the address ofthe root node(the physical node that stores themappings) of the corresponding(EID,RoutingLocators(RLOCs)) *** addition toenabling architectural qualities such as scalability and reliability,the proposed LISP-PCHORDcan copy with flat EIDs such as *** performance of the mapping systemplays a key role in LISP;however,DHT-basedapproaches for LISP seldom consider the mismatch problem that heavily damages the system performance in terms of lookup *** order to mitigate the mismatch problem andachieve optimal performance,we propose anoptimization design method that seeks an optimal matching relationship between P-nodes(nodes within the pointer space) and the physical nodes on the basis of the given lookuptraffic *** order to find the optimal matching relationship,we provide two solutions:a linear programming method and a ***,we evaluate the performance of the proposed scheme and compare itwith that of LISP-DHT.

摘要：Optimal layout of rectangular stock cutting is still in great demand from industry for diversified applications. This paper introduces four basic solution methods to the problem linear programming, dynamic programming, tree search and heuristic approach. A prototype of application software is developed to verify the pros and cons of various approaches

摘要：For a SlSO linear discrete-time system with a specified input signal, a novel method to realize optimal l1 regulation control is presented. Utilizing the technique of converting a polynomial equation to its corresponding matrix equation, a linear programming problem to get an optimal l1 norm of the system output error map is developed which includes the first term and the last term of the map sequence in the objective function and the right vector of its constraint matrix equation, respectively. The adjustability for the width of the constraint matrix makes the trade-off between the order of the optimal regulator and the value of the minimum objective norm become possible, especially for achieving the optimal regulator with minimum order. By norm scaling rules for the constraint matrix equation, the optimal solution can be scaled directly or be obtained by solving a linear programming problem with l1 norm objective.

摘要：In this paper, the well-known Cholesky Algorithm (for solving simultaneous linear equations, or SLE) is re-visited, with the ultimate goal of developing a simple, user-friendly, attractive, and useful Java Visualization and Animation Graphical User Inter-face (GUI) software as an additional teaching tool for students to learn the Cholesky factorization in a step-by-step fashion with computer voice and animation. A demo video of the Cholesky Decomposition (or factorization) animation and result can be viewed online from the website: http://***/~imako001/cholesky/demo/***. The software tool developed from this work can be used for both students and their instructors not only to master this technical subject, but also to provide a dynamic/valuable tool for obtaining the solutions for homework assignments, class examinations, self-assessment studies, and other coursework related activities. Various transportation engineering applications of SLE are cited. Engineering educators who have adopted “flipped classroom instruction” can also utilize this Java Visualization and Animation software for students to “self-learning” these algorithms at their own time (and at their preferable locations), and use valuable class-meeting time for more challenging (real-life) problems’ discussions. Statistical data for comparisons of students’ performance with and without using the developed Java computer animation are also included.

摘要：[Objective] The paper was to precisely predict nutrient requirements and optimize ration formula, and explore the inherent feature of ration optimization of dairy cow. [Method] Based on cornell net carbohydrate and protein system （CNCPS） with integrating dynamic prediction models on main nutrient requirements of dairy cattle recommended by NRC （2001） and the CNCPS parameter database accumu- lated by Chinese feed database, the ration nutrient requirement dynamic calculation and total mixed ration （TMR） formula optimizing system for Holstein dairy cow was developed using FOXPRO database system and parametric linear programming algo- rithm. [Result] By optimizing a specific cow ration and analyzing its completed nutri- ents, the results showed that this system could entirely consider a lots of nutrient balances, such as concentrate fraction and forage fraction balance, rumen degrad- able protein and rumen undergradable protein balance, crude protein and lactation net energy balance, fibrous substances （ADF, NDF） and non-fiber carbohydrates （NFC） balance, calcium and phosphate balance, electrolytes balance and trace ele- ment balance etc., and could also calculate intestinal amino acid flow in terms of different models. [Conclusion] By using dynamic mathematical equations and comput- erized program, it can be realized for the ration formula design of lactating cow with all-round interoperable but mutual-constraining each other among ration nutrients.