884 resultados para Credit constraint
Resumo:
To enhance the role of rural women in development, NGOs have assisted in the establishment of credit programs.
Resumo:
Bifurcation of an elastic structure crucially depends on the curvature of the constraints against which the ends of the structure are prescribed to move, an effect which deserves more attention than it has received so far. In fact, we show theoretically and we provide definitive experimental verification that an appropriate curvature of the constraint over which the end of a structure has to slide strongly affects buckling loads and can induce: (i.) tensile buckling; (ii.) decreasing- (softening), increasing- (hardening), or constant-load (null stiffness) postcritical behaviour; (iii.) multiple bifurcations, determining for instance two bifurcation loads (one tensile and one compressive) in a single-degree-of-freedom elastic system. We show how to design a constraint profile to obtain a desired postcritical behaviour and we provide the solution for the elastica constrained to slide along a circle on one end, representing the first example of an inflexional elastica developed from a buckling in tension. These results have important practical implications in the design of compliant mechanisms and may find applications in devices operating in quasi-static or dynamic conditions.
Resumo:
This paper develops a technique for improving the region of attraction of a robust variable horizon model predictive controller. It considers a constrained discrete-time linear system acted upon by a bounded, but unknown time-varying state disturbance. Using constraint tightening for robustness, it is shown how the tightening policy, parameterised as direct feedback on the disturbance, can be optimised to increase the volume of an inner approximation to the controller's true region of attraction. Numerical examples demonstrate the benefits of the policy in increasing region of attraction volume and decreasing the maximum prediction horizon length. © 2012 IEEE.
Resumo:
Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.
a constraint-driven human resource scheduling method in software development and maintenance process
Resumo:
University of Twente; Centre for Telematics and Information Technology; Netherlands Organisation for Scientific Research; Jacquard; Capgemini