1000 resultados para 080299 Computation Theory and Mathematics not elsewhere classified
Resumo:
This article examines contemporary feminist arguments about contract. It does not aim to advance new arguments for or against contract but to call into question the dominant feminist position which is that contract has to be cast aside and/or that alternative approaches to contract have to be developed in order to advance the position of women. In a reworking of Elizabeth Kingdom's anti-essentialist approach to rights, Sullivan argues that a feminist but non-essentialist approach to contract is both possible and desirable. Sullivan explores a number of concrete situations in the Australian context where contract approaches have been deployed in law and public policy and demonstrates that contract may be detrimental or advantageous to the position of women. Sullivan argues, therefore, for a strategic and critical feminist approach to the utilisation of the language and practice of contract.
Resumo:
At the core of the analysis task in the development process is information systems requirements modelling, Modelling of requirements has been occurring for many years and the techniques used have progressed from flowcharting through data flow diagrams and entity-relationship diagrams to object-oriented schemas today. Unfortunately, researchers have been able to give little theoretical guidance only to practitioners on which techniques to use and when. In an attempt to address this situation, Wand and Weber have developed a series of models based on the ontological theory of Mario Bunge-the Bunge-Wand-Weber (BWW) models. Two particular criticisms of the models have persisted however-the understandability of the constructs in the BWW models and the difficulty in applying the models to a modelling technique. This paper addresses these issues by presenting a meta model of the BWW constructs using a meta language that is familiar to many IS professionals, more specific than plain English text, but easier to understand than the set-theoretic language of the original BWW models. Such a meta model also facilitates the application of the BWW theory to other modelling techniques that have similar meta models defined. Moreover, this approach supports the identification of patterns of constructs that might be common across meta models for modelling techniques. Such findings are useful in extending and refining the BWW theory. (C) 2002 Elsevier Science Ltd. All rights reserved.
Resumo:
This is a reply to the comment by P Schlottmann and A A Zvyagin.
Resumo:
We extend a recent construction for an integrable model describing Josephson tunneling between identical BCS systems to the case where the BCS systems have different single particle energy levels. The exact solution of this generalized model is obtained through the Bethe ansatz.
Resumo:
A new integrable model which is a variant of the one-dimensional Hubbard model is proposed. The integrability of the model is verified by presenting the associated quantum R-matrix which satisfies the Yang-Baxter equation. We argue that the new model possesses the SO(4) algebra symmetry, which contains a representation of the eta-pairing SU(2) algebra and a spin SU(2) algebra. Additionally, the algebraic Bethe ansatz is studied by means of the quantum inverse scattering method. The spectrum of the Hamiltonian, eigenvectors, as well as the Bethe ansatz equations, are discussed. (C) 2002 American Institute of Physics.
Resumo:
Within the information systems field, the task of conceptual modeling involves building a representation of selected phenomena in some domain. High-quality conceptual-modeling work is important because it facilitates early detection and correction of system development errors. It also plays an increasingly important role in activities like business process reengineering and documentation of best-practice data and process models in enterprise resource planning systems. Yet little research has been undertaken on many aspects of conceptual modeling. In this paper, we propose a framework to motivate research that addresses the following fundamental question: How can we model the world to better facilitate our developing, implementing, using, and maintaining more valuable information systems? The framework comprises four elements: conceptual-modeling grammars, conceptual-modeling methods, conceptual-modeling scripts, and conceptual-modeling contexts. We provide examples of the types of research that have already been undertaken on each element and illustrate research opportunities that exist.
Resumo:
In many species, females display preferences for extreme male signal traits, but it has not been determined if such preferences evolve as a consequence of females gaining genetic benefits from exercising choice. If females prefer extreme male traits because they indicate male genetic quality that will enhance the fitness of offspring, a genetic correlation will evolve between female preference genes and genes that confer offspring fitness. We show that females of Drosophila serrata prefer extreme male cuticular hydrocarbon (CHC) blends, and that this preference affects offspring fitness. Female preference is positively genetically correlated with offspring fitness, indicating that females have gained genetic benefits from their choice of males. Despite male CHCs experiencing strong sexual selection, the genes underlying attractive CHCs also conferred lower offspring fitness, suggesting a balance between sexual selection and natural selection may have been reached in this population.
Resumo:
Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.
Resumo:
Groupers (Epinephelinae) are prominent marine fishes distributed in the warmer waters of the world. Review of the literature suggests that trematodes are known from only 62 of the 159 species and only 9 of 15 genera; nearly 90% of host-parasite combinations have been reported only once or twice. All 20 families and all but 7 of 76 genera of trematodes found in epinephelines also occur in non-epihephelines. Only 12 genera of trematodes are reported from both the Atlantic-Eastern Pacific and the Indo-West Pacific. Few (perhaps no) species are credibly cosmopolitan but some have wide distributions across the Indo-West Pacific. The hierarchical 'relatedness' of epinephelines as suggested by how they share trematode taxa (families, genera, species) shows little congruence with what is known of their phylogeny. The major determinant of relatedness appears to be geographical proximity. Together these attributes suggest that host-parasite coevolution has contributed little to the evolution of trematode communities of epinephelines. Instead, they appear to have arisen through localized episodes of host-switching, presumably both into and out of the epinephelines. The Epinephelinae may well be typical of most groups of marine fishes both in the extent to which their trematode parasites are known and in that, apparently, co-evolution has contributed little to the evolution of their communities of trematodes.
Resumo:
If the cestodes are excluded, then the parasitic platyhelminths of fishes divide neatly into the external and monoxenous Monogenea and the internal and heteroxenous Digenea. Both groups have apparently had long associations of coevolution, host switching and adaptation with fishes and have become highly successful in their respective habitats. Current estimates of species richness for the two groups suggest that they may be remarkably similar. Here we consider the nature of the diversity of the Monogenea. and Digenea of fishes in terms of richness of species and higher taxa to determine what processes may be responsible for observed differences. The Monogenea includes at least two super-genera (Dactylogyrus and Gyrodactylus) each of which has hundreds of species, no comparable genera are found in the Digenea. Possible reasons for this difference include the higher host specificity of monogeneans and their shorter generation Lime. If allowance is made for the vagaries of taxonomic 'lumping' and 'splitting', then there are probably comparable numbers of families of monogeneans and digeneans in fishes. However, the nature of the families differ profoundly. Richness in higher taxa (families) in the Digenea is explicable in terms of processes that appear to have been unimportant in the Monogenea. Readily identifiable sources of diversity in the Digenea are: recolonisation of fishes by taxa that arose in association with tetrapods; adoption of new sites within hosts; adoption of new diets and feeding mechanisms; adaptations relating to the exploitation of ecologically similar groups of fishes and second intermediate hosts; and adaptations relating to the exploitation of phylogenetic lineages of molluscs. In contrast, most higher- level monogenean diversity (other than that associated with the subclasses) relates principally to morphological specialisation for attachment by the haptor. (C) 2002 Australian Society for Parasitology Inc. Published by Elsevier Science Ltd. All rights reserved.
Resumo:
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from high-level language programs to assembler code, Recent models also incorporate timing properties, but the resulting formalisms are intimidatingly complex. Here we take advantage of a new, simple model of real-time refinement, based on predicate transformer semantics, to present a straightforward compilation formalism that incorporates real-time constraints. (C) 2002 Elsevier Science B.V. All rights reserved.