‎‎in the category of mordell curves (e_d:y^2=x^3+d) with nontrivial torsion groups we find curves of the generic rank two as quadratic twists of (e_1), ‎and of the generic rank at least two and at least three as cubic twists of (e_1). ‎previous work‎, ‎in the category of mordell curves with trivial torsion groups‎, ‎has found infinitely many elliptic curves with rank at least seven as sextic tw...

Structures of the finite dimensional simple weight Uq(sl(2, 1))modules are studied in detail for both the generic and the roots of 1 cases.

As part of the StAR project, for the design of a computer system to support risk assessment, it has been necessary to develop a graphical language for the representation of generic structures. These structures are used by rule writers to describe toxicophores for risk assessment. Until now, the input of generic structures in knowledge-based systems has very often been by means of a SMILES-like ...

A structuring algorithm for arbitrary control ow graphs is presented. Graphs are structured into functional, semantical and structural equivalent graphs, without code replication or introduction of new variables. The algorithm makes use of a set of generic high-level language structures that includes diierent types of loops and conditionals. Gotos are used only when the graph cannot be structur...

by Lie-Quan Lee In this thesis I present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Standard Template Library (STL), the graph algorithms in GGCL do not depend on the particular data structures upon which they operate, meaning a single algorithm can operate on arbitrary concrete represent...

This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq module functors for constructing complex lattices using efficient data structures. The lattice signature contains a well-foundedness proof obligation which ensures termination of generic fixpoint iteration algorithms. Wi...

Generic design aims at achieving non-redundancy by unifying differences among similar program concepts or structures at the design and code levels, for simplification purpose. The extent to which similar program structures deliberately spread through programs, indicates that potentials of generic design may not be fully exploited. While not all such recurring similar program structures are nece...

Generic design aims at achieving non-redundancy for simplification reasons, by unifying similarity patterns at design and code levels, whenever there is an engineering benefit of doing so. The extent of non-accidental repetitions recurring similar structures in programs suggests that the potential of generic design may not be fully exploited. Poor design and ad hoc maintenance are the two often...

In this paper we discuss the connections between a Vlasov-Fokker-Planck equation and an underlying microscopic particle system, and we interpret those connections in the context of the GENERIC framework (Öttinger 2005). This interpretation provides (a) a variational formulation for GENERIC systems, (b) insight into the origin of this variational formulation, and (c) an explanation of the origin...