Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories

The k-symplectic formulation of field theories is especially simple, since only tangent and cotangent bundles are needed in its description. Its defining elements show a close relationship with those in the symplectic formulation of mechanics. It will be shown that this relationship also stands in the presymplectic case. In a natural way,one can mimick the presymplectic constraint algorithm to obtain a constraint algorithmthat can be applied to k-presymplectic field theory, and more particularly to the Lagrangian and Hamiltonian formulations offield theories defined by a singular Lagrangian, as well as to the unified Lagrangian-Hamiltonian formalism (Skinner--Rusk formalism) for k-presymplectic field theory. Two examples of application of the algorithm are also analyzed.

Program, Highlights & Budget Summaries, 2004

Budget in Brief from the Governor's Office

Budget Report Fiscal Year 2005

Budget from the Governor's Office

Constraint satisfaction techniques under uncertain conditions for fault diagnosis in nonlinear dynamic systems

The speed of fault isolation is crucial for the design and reconfiguration of fault tolerant control (FTC). In this paper the fault isolation problem is stated as a constraint satisfaction problem (CSP) and solved using constraint propagation techniques. The proposed method is based on constraint satisfaction techniques and uncertainty space refining of interval parameters. In comparison with other approaches based on adaptive observers, the major advantage of the presented method is that the isolation speed is fast even taking into account uncertainty in parameters, measurements and model errors and without the monotonicity assumption. In order to illustrate the proposed approach, a case study of a nonlinear dynamic system is presented

Annual Report and Budget Summary, 2003-2004

Annual report for the Department of Public Health

Comparison of Work Scheduling Using Constraint Programming or Auctions

Business processes designers take into account the resources that the processes would need, but, due to the variable cost of certain parameters (like energy) or other circumstances, this scheduling must be done when business process enactment. In this report we formalize the energy aware resource cost, including time and usage dependent rates. We also present a constraint programming approach and an auction-based approach to solve the mentioned problem including a comparison of them and a comparison of the proposed algorithms for solving them

Annual Report and Budget Summary, 2004

Annual report for the Department of Public Health

Iowa Budget Report Associated Financial Documents, January 2005

This report is of the financial documents, statements of federal funding.

Iowa Budget Report, January 2005

The FY 2006 budget we present to you today was built from the ground up and is the result of a budget process that focuses on priorities and results. Faced with difficult choices, we are heartened by the progress we have achieved with your cooperation and collaboration. Fulfilling our responsibility to Iowa children, together we have focused resources on cing class sizes and reversed an eight-year decline in test scores. As a result, Iowa students have reachieved four straight years of improved test scores, ranking among America’s best.

Iowa Budget Report Agency Budgets, January 2005

This is the detailed budget report of all state agencies for the FY2006. Page 604 long.

Iowa Budget Report Capital Projects, January 2005

This report is of the projects for the capital.