768 resultados para Logic programs
Resumo:
We examine whether and under what circumstances World Bank and International Monetary Fund (IMF) programs affect the likelihood of major government crises. We find that crises are, on average, more likely as a consequence of World Bank programs. We also find that governments face an increasing risk of entering a crisis when they remain under an IMF or World Bank arrangement once the economy's performance improves. The international financial institution's (IFI) scapegoat function thus seems to lose its value when the need for financial support is less urgent. While the probability of a crisis increases when a government turns to the IFIs, programs inherited by preceding governments do not affect the probability of a crisis. This is in line with two interpretations. First, the conclusion of IFI programs can signal the government's incompetence, and second, governments that inherit programs might be less likely to implement program conditions agreed to by their predecessors.
Resumo:
In order to enhance the quality of care, healthcare organisations are increasingly resorting to clinical decision support systems (CDSSs), which provide physicians with appropriate health care decisions or recommendations. However, how to explicitly represent the diverse vague medical knowledge and effectively reason in the decision-making process are still problems we are confronted. In this paper, we incorporate semiotics into fuzzy logic to enhance CDSSs with the aim of providing both the abilities of describing medical domain concepts contextually and reasoning with vague knowledge. A semiotically inspired fuzzy CDSSs framework is presented, based on which the vague knowledge representation and reasoning process are demonstrated.
Resumo:
This article reports the results of a mixed-methods approach to investigating the association between globalisation and MATESOL in UK universities. Qualitative and quantitative data collected from academic staff through eight emails, four interviews and 41 questionnaires indicate that the globalised context of higher education have affected these programmes in a number of ways including an increasing interest in recruiting more international students and a growing awareness about the need for curriculum and content modifications. The analysis of the data suggests that although change has been an inherent characteristic of these MAs over the past decade, it has been implemented gradually and conservatively, often relying on a dialectic relationship between academic staff and universities’ policies. The results imply that factors other than globalisation have also been at work. Many of the participants contend that globalisation has not lowered the quality of these MAs or standards of good practice.
Resumo:
The automatic transformation of sequential programs for efficient execution on parallel computers involves a number of analyses and restructurings of the input. Some of these analyses are based on computing array sections, a compact description of a range of array elements. Array sections describe the set of array elements that are either read or written by program statements. These sections can be compactly represented using shape descriptors such as regular sections, simple sections, or generalized convex regions. However, binary operations such as Union performed on these representations do not satisfy a straightforward closure property, e.g., if the operands to Union are convex, the result may be nonconvex. Approximations are resorted to in order to satisfy this closure property. These approximations introduce imprecision in the analyses and, furthermore, the imprecisions resulting from successive operations have a cumulative effect. Delayed merging is a technique suggested and used in some of the existing analyses to minimize the effects of approximation. However, this technique does not guarantee an exact solution in a general setting. This article presents a generalized technique to precisely compute Union which can overcome these imprecisions.
Resumo:
This article examines the role played by ideas and their thinkers in Christopher Hill's histories of the English Revolution. Hill protested against a reductionist economic determinism with no place for the intrinsic power of ideas, but his account of ideas gave them a progressive logic parallel to, if not always easy to link with, that of economic development, and threatened to divorce them from their muddled and imperfect thinkers. This account of the logic of ideas had a striking impact on the way in which the more mainstream radicals of the English Revolution appeared in Hill's work, with both the Levellers and James Harrington being half assimilated to, and half pushed aside in favor of, the more thoroughgoing economic radicals who expressed, in however ragged a way, the intrinsic potential of their ideas. However, Hill's writings also betray a surprising attraction to religious over secular forms of radicalism.
Resumo:
Aligning information systems (IS) solutions with business goals and needs are crucial for IS activities. IS professionals who are able to work closely with both the business and technical staff are key enablers of business and IT alignment. IS programs in higher education (HE) institutions have a long tradition of enabling graduates to develop the appropriate skills needed for their future careers. Yet, organizations are still having difficulty finding graduates who possess both the knowledge and skills that are best suited to their specific requirements. Prior studies suggest that IS curricula are often ill-matched with industry/business needs. This study reports on the business analysis curricula (re) design which was undertaken to align it with a key professional body for the IS industry. This study presents the approaches taken in the (re) design of the module, and provides a discussion of the wider implications for IS curricula design. The results show a positive outcome for the HE and professional body partnership.
Resumo:
Vector field formulation based on the Poisson theorem allows an automatic determination of rock physical properties (magnetization to density ratio-MDR-and the magnetization inclination-MI) from combined processing of gravity and magnetic geophysical data. The basic assumptions (i.e., Poisson conditions) are: that gravity and magnetic fields share common sources, and that these sources have a uniform magnetization direction and MDR. In addition, the previously existing formulation was restricted to profile data, and assumed sufficiently elongated (2-D) sources. For sources that violate Poisson conditions or have a 3-D geometry, the apparent values of MDR and MI that are generated in this way have an unclear relationship to the actual properties in the subsurface. We present Fortran programs that estimate MDR and MI values for 3-D sources through processing of gridded gravity and magnetic data. Tests with simple geophysical models indicate that magnetization polarity can be successfully recovered by MDR-MI processing, even in cases where juxtaposed bodies cannot be clearly distinguished on the basis of anomaly data. These results may be useful in crustal studies, especially in mapping magnetization polarity from marine-based gravity and magnetic data. (c) 2007 Elsevier Ltd. All rights reserved.
Resumo:
The logic of proofs (lp) was proposed as Gdels missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for lp have not explored this closeness with S4 and contain rules whose analycity is not immediately evident. We study possible formulations of analytic tableau proof methods for lp that preserve the subformula property. Two sound and complete tableau decision methods of increasing degree of analycity are proposed, KELP and preKELP. The latter is particularly inspired on S4-proofs. The crucial role of proof constants in the structure of lp-proofs methods is analysed. In particular, a method for the abduction of proof constant specifications in strongly analytic preKELP proofs is presented; abduction heuristics and the complexity of the method are discussed.
Resumo:
Planning to reach a goal is an essential capability for rational agents. In general, a goal specifies a condition to be achieved at the end of the plan execution. In this article, we introduce nondeterministic planning for extended reachability goals (i.e., goals that also specify a condition to be preserved during the plan execution). We show that, when this kind of goal is considered, the temporal logic CTL turns out to be inadequate to formalize plan synthesis and plan validation algorithms. This is mainly due to the fact that the CTL`s semantics cannot discern among the various actions that produce state transitions. To overcome this limitation, we propose a new temporal logic called alpha-CTL. Then, based on this new logic, we implement a planner capable of synthesizing reliable plans for extended reachability goals, as a side effect of model checking.