Product Filters, Acyclicity and Suzumura Consistency

In a seminal contribution, Hansson (1976) demonstrates that the collection of decisive coalitions associated with an Arrovian social welfare function forms an ultrafilter. He goes on to show that if transitivity is weakened to quasi-transitivity as the coherence property imposed on a social relation, the set of decisive coalitions is a filter. We examine the notion of decisiveness with acyclical or Suzumura consistent social preferences and without assuming that the social relation is complete. This leads to a new set-theoretic concept applied to product spaces.

Reachability-based acyclicity analysis by Abstract Interpretation

In programming languages with dynamic use of memory, such as Java, knowing that a reference variable x points to an acyclic data structure is valuable for the analysis of termination and resource usage (e.g., execution time or memory consumption). For instance, this information guarantees that the depth of the data structure to which x points is greater than the depth of the data structure pointed to by x.f for any field f of x. This, in turn, allows bounding the number of iterations of a loop which traverses the structure by its depth, which is essential in order to prove the termination or infer the resource usage of the loop. The present paper provides an Abstract-Interpretation-based formalization of a static analysis for inferring acyclicity, which works on the reduced product of two abstract domains: reachability, which models the property that the location pointed to by a variable w can be reached by dereferencing another variable v (in this case, v is said to reach w); and cyclicity, modeling the property that v can point to a cyclic data structure. The analysis is proven to be sound and optimal with respect to the chosen abstraction.

Binary decompositions and acyclic schemes

It is well known that the notions of normal forms and acyclicity capture many practical desirable properties for database schemes. The basic schema design problem is to develop design methodologies that strive toward these ideals. The usual approach is to first normalize the database scheme as far as possible. If the resulting scheme is cyclic, then one tries to transform it into an acyclic scheme. In this paper, we argue in favor of carrying out these two phases of design concurrently. In order to do this efficiently, we need to be able to incrementally analyze the acyclicity status of a database scheme as it is being designed. To this end, we propose the formalism of "binary decompositions". Using this, we characterize design sequences that exactly generate theta-acyclic schemes, for theta = agr,beta. We then show how our results can be put to use in database design. Finally, we also show that our formalism above can be effectively used as a proof tool in dependency theory. We demonstrate its power by showing that it leads to a significant simplification of the proofs of some previous results connecting sets of multivalued dependencies and acyclic join dependencies.

Recognition And Top-Down Generation Of Beta-Acyclic Database Schemes

Database schemes can be viewed as hypergraphs with individual relation schemes corresponding to the edges of a hypergraph. Under this setting, a new class of "acyclic" database schemes was recently introduced and was shown to have a claim to a number of desirable properties. However, unlike the case of ordinary undirected graphs, there are several unequivalent notions of acyclicity of hypergraphs. Of special interest among these are agr-, beta-, and gamma-, degrees of acyclicity, each characterizing an equivalence class of desirable properties for database schemes, represented as hypergraphs. In this paper, two complementary approaches to designing beta-acyclic database schemes have been presented. For the first part, a new notion called "independent cycle" is introduced. Based on this, a criterion for beta-acyclicity is developed and is shown equivalent to the existing definitions of beta-acyclicity. From this and the concept of the dual of a hypergraph, an efficient algorithm for testing beta-acyclicity is developed. As for the second part, a procedure is evolved for top-down generation of beta-acyclic schemes and its correctness is established. Finally, extensions and applications of ideas are described.

Rationalizability of Choice Functions on General Domains without Full Transitivity

The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity. We describe the logical relationships between the different notions of rationalizability involving, for example, the transitivity, quasi-transitivity, or acyclicity of the rationalizing relation. Furthermore, we discuss sufficient conditions and necessary conditions for rational choice on arbitrary domains. Transitive, quasi-transitive, and acyclical rationalizability are fully characterized for domains that contain all singletons and all two-element subsets of the universal set.

Maximal-Element Rationalizability

We examine the maximal-element rationalizability of choice functions with arbitrary do-mains. While rationality formulated in terms of the choice of greatest elements according to a rationalizing relation has been analyzed relatively thoroughly in the earlier litera-ture, this is not the case for maximal-element rationalizability, except when it coincides with greatest-element rationalizability because of properties imposed on the rationalizing relation. We develop necessary and sufficient conditions for maximal-element rationaliz-ability by itself, and for maximal-element rationalizability in conjunction with additional properties of a rationalizing relation such as re exivity, completeness, P-acyclicity, quasi-transitivity, consistency and transitivity.

Rational Choice on Arbitrary Domains: A Comprehensive Treatment

The rationalizability of a choice function on arbitrary domains by means of a transitive relation has been analyzed thoroughly in the literature. Moreover, characterizations of various versions of consistent rationalizability have appeared in recent contributions. However, not much seems to be known when the coherence property of quasi-transitivity or that of P-acyclicity is imposed on a rationalization. The purpose of this paper is to fill this significant gap. We provide characterizations of all forms of rationalizability involving quasi-transitive or P-acyclical rationalizations on arbitrary domains.

A Characterization of Consistent Collective Choice Rules

We characterize a class of collective choice rules such that collective preference relations are consistent. Consistency is a weakening of transitivity and a strengthening of acyclicity requiring that there be no cycles with at least one strict preference. The properties used in our characterization are unrestricted domain, strong Pareto, anonymity and neutrality. If there are at most as many individuals as there are alternatives, the axioms provide an alternative characterization of the Pareto rule. If there are more individuals than alternatives, however, further rules become available.

Decisive Coalitions and Coherence Properties

In a seminal contribution, Hansson has demonstrated that the family of decisive coalitions associated with an Arrovian social welfare function forms an ultrafilter. If the population under consideration is infinite, his result implies the existence of nondictatorial social welfare functions. He goes on to show that if transitivity is weakened to quasi-transitivity as the coherence property imposed on a social relation, the set of decisive coalitions is a filter. We examine the structure of decisive coalitions and analogous concepts with alternative coherence properties, namely, acyclicity and Suzumura consistency, and without assuming that the social relation is complete.

Studies on Fuzzy Graphs

In this thesis an attempt to develop the properties of basic concepts in fuzzy graphs such as fuzzy bridges, fuzzy cutnodes, fuzzy trees and blocks in fuzzy graphs have been made. The notion of complement of a fuzzy graph is modified and some of its properties are studied. Since the notion of complement has just been initiated, several properties of G and G available for crisp graphs can be studied for fuzzy graphs also. Mainly focused on fuzzy trees defined by Rosenfeld in [10] , several other types of fuzzy trees are defined depending on the acyclicity level of a fuzzy graph. It is observed that there are selfcentered fuzzy trees. Some operations on fuzzy graphs and prove that complement of the union two fuzzy graphs is the join of their complements and complement of the join of two fuzzy graphs is union of their complements. The study of fuzzy graphs made in this thesis is far from being complete. The wide ranging applications of graph theory and the interdisciplinary nature of fuzzy set theory, if properly blended together could pave a way for a substantial growth of fuzzy graph theory.

Histological assessment of ovaries and uterus of rats subjected to nandrolone decanoate treatment

This study aimed to analyze the effects of nandrolone decanoate on the ovaries and uterus of adult females rats. This drug was administered intraperitoneally, at one, two and three doses of 3 mg nandrolone decanoate/kg of body weight, respectively, in the first, second and third week of treatment. The females of the control group received a physiological solution. The rats treated with nandrolone decanoate showed estral acyclicity and there was destruction of follicular units and an absence of corpus luteum in the ovaries. In the uterus, the drug promoted morphological alterations, characterized by vacuolated epithelium and endometrial stroma fibrosis. Ovary, uterus and pituitary weights were not affected by the steroid treatment. Nandrolone decanoate affects the sexual cycle and promotes histological alterations in the ovaries and uterus of adult female rats. (C) 2005 Elsevier B.V. All rights reserved.

Efeitos dos esteroides anabólicos androgênicos sobre o útero e parâmetros reprodutivos de ratas adultas

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Nandrolone Decanoate and Physical Effort: Histological and Morphometrical Assessment in Adult Rat Uterus

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

OVARIAN HISTOLOGY and FOLLICULAR SCORE IN FEMALE RATS TREATED WITH NANDROLONE DECANOATE and SUBMITTED TO PHYSICAL EFFORT

The study was conducted to analyze the histology of the ovaries of adults rats treated with steroids, and submitted or not to physical effort. The control group consisted of females submitted to physical effort and sedentary females, both of which received a physiological solution of 0.9% saline. Treated females, sedentary or not, received 6 mg/kg of body weight of nandrolone decanoate. The steroid and physiological solution were administered intraperitoneally, with a single injection per week for 4 consecutive weeks. The applied physical effort was swimming (20 minutes daily, 5 days/week, for the 4 weeks of treatment). Serial sections (5 mu m) of ovaries were prepared for histological evaluation and follicular score. The weight of ovaries and hypophysis, the number of antral and atretic follicles, and the area of corpus luteum were all affected by the steroids. In the ovaries of the control groups, well-developed corpus luteum was observed. In the treated groups, the cortical stroma was occupied by ovarian interstitial tissue. The females treated with steroids presented estral acyclicity. The use of nandrolone decanoate, whether associated with physical effort or not, affected the morphological pattern of the ovaries.

Atividade dos neurônios noradrenérgicos do Locus coeruleus e o conteúdo de GnRH em ratas Wistar acíclicas

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)