4 resultados para Ortelius, Abraham, 1527-1598.

em Boston University Digital Common


Relevância:

10.00% 10.00%

Publicador:

Resumo:

This dissertation, an exercise in practical theology, consists of a critical conversation between the evangelistic practice of Campus Crusade for Christ in two American university contexts, Bryan Stone's ecclesiologically grounded theology of evangelism, and William Abraham's eschatologically grounded theology of evangelism. It seeks to provide these evangelizing communities several strategic proposals for a more ecclesiologically and eschatologically grounded practice of evangelism within a university context. The current literature on evangelism is long on evangelistic strategy and activity, but short on theological analysis and reflection. This study focuses on concrete practices, but is grounded in a thick description of two particular contexts (derived from qualitative research methods) and a theological analysis of the ecclesiological and eschatological beliefs embedded within their evangelistic activities. The dissertation provides an historical overview of important figures, ideas, and events that helped mold the practice of evangelism inherited by the two ministries of this study, beginning with the famous Haystack Revival on Williams College in 1806. Both ministries, Campus Crusade for Christ at Bowling Green State University (Ohio) and at Washington State University, inherited an evangelistic practice sorely infected with many of the classic distortions that both Abraham and Stone attempt to correct. Qualitative research methods detail the direction that Campus Crusade for Christ at Bowling Green State University (Ohio) and Washington State University have taken the practice of evangelism they inherited. Applying the analytical categories that emerge from a detailed summary of Stone and Abraham to qualitative data of these two ministries reveals several ways evangelism has morphed in a manner sympathetic to Stone's insistence that the central logic of evangelism is the embodied witness of the church. The results of this analysis reveal the subversive and pervasive influence of modernity on these evangelizing communities—an influence that warrants several corrective strategic proposals including: 1) re-situating evangelism within a reading of the biblical narrative that emphasizes the present, social, public, and realized nature of the gospel of the kingdom of God rather than simply its future, personal, private, and unrealized dimensions; 2) clarifying the nature of the evangelizing communities and their relationship to the church; and 3) emphasizing the virtues that characterize a new evangelistic exemplar who is incarnational, intentional, humble, and courageous.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In many multi-camera vision systems the effect of camera locations on the task-specific quality of service is ignored. Researchers in Computational Geometry have proposed elegant solutions for some sensor location problem classes. Unfortunately, these solutions utilize unrealistic assumptions about the cameras' capabilities that make these algorithms unsuitable for many real-world computer vision applications: unlimited field of view, infinite depth of field, and/or infinite servo precision and speed. In this paper, the general camera placement problem is first defined with assumptions that are more consistent with the capabilities of real-world cameras. The region to be observed by cameras may be volumetric, static or dynamic, and may include holes that are caused, for instance, by columns or furniture in a room that can occlude potential camera views. A subclass of this general problem can be formulated in terms of planar regions that are typical of building floorplans. Given a floorplan to be observed, the problem is then to efficiently compute a camera layout such that certain task-specific constraints are met. A solution to this problem is obtained via binary optimization over a discrete problem space. In preliminary experiments the performance of the resulting system is demonstrated with different real floorplans.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

System F is the well-known polymorphically-typed λ-calculus with universal quantifiers ("∀"). F+η is System F extended with the eta rule, which says that if term M can be given type τ and M η-reduces to N, then N can also be given the type τ. Adding the eta rule to System F is equivalent to adding the subsumption rule using the subtyping ("containment") relation that Mitchell defined and axiomatized [Mit88]. The subsumption rule says that if M can be given type τ and τ is a subtype of type σ, then M can be given type σ. Mitchell's subtyping relation involves no extensions to the syntax of types, i.e., no bounded polymorphism and no supertype of all types, and is thus unrelated to the system F≤("F-sub"). Typability for F+η is the problem of determining for any term M whether there is any type τ that can be given to it using the type inference rules of F+η. Typability has been proven undecidable for System F [Wel94] (without the eta rule), but the decidability of typability has been an open problem for F+η. Mitchell's subtyping relation has recently been proven undecidable [TU95, Wel95b], implying the undecidability of "type checking" for F+η. This paper reduces the problem of subtyping to the problem of typability for F+η, thus proving the undecidability of typability. The proof methods are similar in outline to those used to prove the undecidability of typability for System F, but the fine details differ greatly.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of activities: modeling and design. As a modeling tool, it enables the abstraction of an existing system so as to retain sufficient enough details to enable future analysis of safety properties. As a design tool, NetSketch enables the exploration of alternative safe designs as well as the identification of minimal requirements for outsourced subsystems. NetSketch embodies a lightweight formal verification philosophy, whereby the power (but not the heavy machinery) of a rigorous formalism is made accessible to users via a friendly interface. NetSketch does so by exposing tradeoffs between exactness of analysis and scalability, and by combining traditional whole-system analysis with a more flexible compositional analysis approach based on a strongly-typed, Domain-Specific Language (DSL) to specify network configurations at various levels of sketchiness along with invariants that need to be enforced thereupon. In this paper, we overview NetSketch, highlight its salient features, and illustrate how it could be used in applications, including the management/shaping of traffic flows in a vehicular network (as a proxy for CPS applications) and in a streaming media network (as a proxy for Internet applications). In a companion paper, we define the formal system underlying the operation of NetSketch, in particular the DSL behind NetSketch's user-interface when used in "sketch mode", and prove its soundness relative to appropriately-defined notions of validity.