Beginning Apache Struts will provide you a working knowledge of Apache Struts 1.2. This book is ideal for you Java programmers who have some JSP familiarity, but little or no prior experience with Servlet technology. Organized in a condensed tutorial and lab format, the material in this book has been tested in real classroom environments. It takes a step-by-step, hands-on approach to teaching you Struts. The book even previews the next generation of Struts, the Apache Shale. The overall result is that you can quickly apply Struts to your work settings with confidence.
Continue reading Beginning Apache Struts: From Novice to Professional

Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter.
Continue reading Algorithms for Computer Algebra

Advances in Natural Computation: Second International Conference, ICNC 2006, Xi’an, China, September 24-28, 2006, Proceedings, Part II (Lecture Notes in Computer Science): Licheng Jiao, Lipo Wang, Xinbo Gao, Jing Liu, Feng Wu
Springer | ISBN: 3540459073 | 2006-11-13 | PDF (OCR) | 998 pages | 35.8 Mb

Nonlinear Programming: Theory and Algorithms-now in an extensively updated Third Edition- addresses the problem of optimizing an objective function in the presence of equality and inequality constraints. Many realistic problems cannot be adequately represented as a linear program owing to the nature of the nonlinearity of the objective function and/or the nonlinearity of any constraints. The Third Edition begins with a general introduction to nonlinear programming with illustrative examples and guidelines for model construction.
Concentration on the three major parts of nonlinear programming is provided:
* Convex analysis with discussion of topological properties of convex sets, separation and support of convex sets, polyhedral sets, extreme points and extreme directions of polyhedral sets, and linear programming
* Optimality conditions and duality with coverage of the nature, interpretation, and value of the classical Fritz John (FJ) and the Karush-Kuhn-Tucker (KKT) optimality conditions; the interrelationships between various proposed constraint qualifications; and Lagrangian duality and saddle point optimality conditions
* Algorithms and their convergence, with a presentation of algorithms for solving both unconstrained and constrained nonlinear programming problems
Important features of the Third Edition include:
* New topics such as second interior point methods, nonconvex optimization, nondifferentiable optimization, and more
* Updated discussion and new applications in each chapter
* Detailed numerical examples and graphical illustrations
* Essential coverage of modeling and formulating nonlinear programs
* Simple numerical problems
* Advanced theoretical exercises
The book is a solid reference for professionals as well as a useful text for students in the fields of operations research, management science, industrial engineering, applied mathematics, and also in engineering disciplines that deal with analytical optimization techniques. The logical and self-contained format uniquely covers nonlinear programming techniques with a great depth of information and an abundance of valuable examples and illustrations that showcase the most current advances in nonlinear problems.