Synthesis of optimal networks with NOR and NAND gates by integer programming /

"January 18, 1971."

A nonlinear programming algorithm for an array computer /

"October 22, 1969."

Dynamic programming and mathematical economics.

"Prepared for United States Air Force Project Rand."

Computers and mathematical programming : proceedings of the Bicentennial Conference on Mathematical Programming held at the National Bureau of Standards, Gaithersburg, Maryland, November 29-December 1, 1976 /

Includes bibliographies.

Adaptive Penalty and Barrier function based on Fuzzy Logic

Optimization methods have been used in many areas of knowledge, such as Engineering, Statistics, Chemistry, among others, to solve optimization problems. In many cases it is not possible to use derivative methods, due to the characteristics of the problem to be solved and/or its constraints, for example if the involved functions are non-smooth and/or their derivatives are not know. To solve this type of problems a Java based API has been implemented, which includes only derivative-free optimization methods, and that can be used to solve both constrained and unconstrained problems. For solving constrained problems, the classic Penalty and Barrier functions were included in the API. In this paper a new approach to Penalty and Barrier functions, based on Fuzzy Logic, is proposed. Two penalty functions, that impose a progressive penalization to solutions that violate the constraints, are discussed. The implemented functions impose a low penalization when the violation of the constraints is low and a heavy penalty when the violation is high. Numerical results, obtained using twenty-eight test problems, comparing the proposed Fuzzy Logic based functions to six of the classic Penalty and Barrier functions are presented. Considering the achieved results, it can be concluded that the proposed penalty functions besides being very robust also have a very good performance.

Mapping sub-flows to p2mp LSPs

In previous work we proposed a multi-objective traffic engineering scheme (MHDB-S model) using different distribution trees to multicast several flows. In this paper, we propose a heuristic algorithm to create multiple point-to-multipoint (p2mp) LSPs based on the optimum sub-flow values obtained with our MHDB-S model. Moreover, a general problem for supporting multicasting in MPLS networks is the lack of labels. To reduce the number of labels used, a label space reduction algorithm solution is also considered

The design and development of an integrated system for object-oriented finite element computing

Finite Element Method (FEM) is widely used in Science and Engineering since 1960’s. The vast majority of FEM software is procedure-oriented. However, this conventional style of designing FEM software encounters problems in maintenance, reuse, and expansion of the software. Recently the object-oriented finite element method attracts the attention of lots of researchers, and now there is a growing interest in this method. In this paper, the object-oriented finite element (OOFE) is briefly introduced. Then the design and development of an integrated OOFE system is described. A comparison of the integrated OOFE system and a procedure-oriented system shows that our OOFE system has many advantages.

Unleashing the vermin : vectored route-length minimization

We have posed a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-length Minimization (VeRMin). Basically, it constitutes a re-casting of the classical “shortest route” problem in a strictly Euclidean space. We have presented only a heuristic solution process hoping that a formal proof will eventually emerge as the problem receives wider exposure within mathematical circles.

Um método previsor-corretor primal-dual de pontos interiores barreira logarítmica modificada, com estratégias de convergência global e de ajuste cúbico, para problemas de programação não-linear e não-convexa

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relax and cut: limitantes duais para o problema do caixeiro viajante

Pós-graduação em Matemática - IBILCE

Multiple precision computation of Legendre functions.

"C00-1469-0167."

SPORRT; simplified polynomial root finding at a remote terminal.

"Supported in part by ... Grant no. US NSF GP-9665."

A class of algorithms for automatic evaluation of certain elementary functions in a binary computer.

"Supported in part...under Grant No. US NSF GJ812 and Grant No. US NSF GJ813."

SMART: a program for simplified matrix algebra on remote terminals.

Thesis (M.S.)--University of Illinois.

A study of arithmetic recoding with applications in multiplication and division.

Vita.