Hermeneutics, accreting receptions, hypermedia: A tool for reference versus a tool for instruction

We provide a select overview of tools supporting traditional Jewish learning. Then we go on to discuss our own HyperJoseph/HyperIsaac project in instructional hypermedia. Its application is to teaching, teacher training, and self-instruction in given Bible passages. The treatment of two narratives has been developed thus far. The tool enables an analysis of the text in several respects: linguistic, narratological, etc. Moreover, the Scriptures' focality throughout the cultural history makes this domain of application particularly challenging, in that there is a requirement for the tool to encompass the accretion of receptions in the cultural repertoire, i.e., several layers of textual traditions—either hermeneutic (i.e., interpretive), or appropriations—related to the given core passage, thus including "secondary" texts (i.e., such that are responding or derivative) from as disparate realms as Roman-age and later homiletics, Medieval and later commentaries or supercommentaries, literary appropriations, references to the arts and modern scholarship, etc. in particular, the Midrash (homiletic expansions) is adept at narrative gap filling, so the narratives mushroom at the interstices where the primary text is silent. The genealogy of the project is rooted in Weiss' index of novelist Agnon's writings, which was eventually upgraded into a hypertextual tool, including Agnon's full-text and ancillary materials. Those early tools being intended primarily for reference and research-support in literary studies, the Agnon hypertext system was initially emulated in the conception of HyperJoseph, which is applied to the Joseph story from Genesis. Then, the transition from a tool for reference to an instructional tool required a thorough reconception in an educational perspective, which led to HyperIsaac, on the sacrifice of Isaac, and to a redesign and upgrade of HyperJoseph as patterned after HyperIsaac.

Maximum curves and isolated points of entire functions

Given M(r; f) =maxjzj=r (jf(z)j) , curves belonging to the set of points M = fz : jf(z)j = M(jzj; f)g were de�ned by Hardy to be maximum curves. Clunie asked the question as to whether the set M could also contain isolated points. This paper shows that maximum curves consist of analytic arcs and determines a necessary condition for such curves to intersect. Given two entire functions f1(z) and f2(z), if the maximum curve of f1(z) is the real axis, conditions are found so that the real axis is also a maximum curve for the product function f1(z)f2(z). By means of these results an entire function of in�nite order is constructed for which the set M has an in�nite number of isolated points. A polynomial is also constructed with an isolated point.

Maintenance of a case-base for the retrieval of rotationally symmetric shapes for the design of metal castings

In this paper, we discuss the problem of maintenance of a CBR system for retrieval of rotationally symmetric shapes. The special feature of this system is that similarity is derived primarily from graph matching algorithms. The special problem of such a system is that it does not operate on search indices that may be derived from single cases and then used for visualisation and principle component analyses. Rather, the system is built on a similarity metric defined directly over pairs of cases. The problems of efficiency, consistency, redundancy, completeness and correctness are discussed for such a system. Performance measures for the CBR system are given, and the results for trials of the system are presented. The competence of the current case-base is discussed, with reference to a representation of cases as points in an n-dimensional feature space, and a Gramian visualisation. A refinement of the case base is performed as a result of the competence analysis and the performance of the case-base before and after refinement is compared.

A framework for historical case-based reasoning

This paper presents a framework for Historical Case-Based Reasoning (HCBR) which allows the expression of both relative and absolute temporal knowledge, representing case histories in the real world. The formalism is founded on a general temporal theory that accommodates both points and intervals as primitive time elements. A case history is formally defined as a collection of (time-independent) elemental cases, together with its corresponding temporal reference. Case history matching is two-fold, i.e., there are two similarity values need to be computed: the non-temporal similarity degree and the temporal similarity degree. On the one hand, based on elemental case matching, the non-temporal similarity degree between case histories is defined by means of computing the unions and intersections of the involved elemental cases. On the other hand, by means of the graphical presentation of temporal references, the temporal similarity degree in case history matching is transformed into conventional graph similarity measurement.

Case-based retrieval of 3-dimensional shapes for the design of metal castings

This paper describes research into retrieval based on 3-dimensional shapes for use in the metal casting industry. The purpose of the system is to advise a casting engineer on the design aspects of a new casting by reference to similar castings which have been prototyped and tested in the past. The key aspects of the system are the orientation of the shape within the mould, the positions of feeders and chills, and particular advice concerning special problems and solutions, and possible redesign. The main focus of this research is the effectiveness of similarity measures based on 3-dimensional shapes. The approach adopted here is to construct similarity measures based on a graphical representation deriving from a shape decomposition used extensively by experienced casting design engineers. The paper explains the graphical representation and discusses similarity measures based on it. Performance measures for the CBR system are given, and the results for trials of the system are presented. The competence of the current case-base is discussed, with reference to a representation of cases as points in an n-dimensional feature space, and its principal components visualization. A refinement of the case base is performed as a result of the competence analysis and the performance of the case-base before and after refinement is compared.