/pdf/a-break-in-the-clouds-towards-a-cloud-definition-svovsw1r5a.pdf

A Break in the Clouds: Towards a Cloud Definition

Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing parallelism. The potential complexity of dealing with side effects in a parallel context is mitigated by the nature of the parallelism constructs and by support for abstract data types: a recommended Multilisp programming style is presented which, if followed, should lead to highly parallel, easily understandable programs.Multilisp is being implemented on the 32-processor Concert multiprocessor; however, it is ultimately intended for use on larger multiprocessors. The current implementation, called Concert Multilisp, is complete enough to run the Multilisp compiler itself and has been run on Concert prototypes including up to eight processors. Concert Multilisp uses novel techniques for task scheduling and garbage collection. The task scheduler helps control excessive resource utilization by means of an unfair scheduling policy; the garbage collector uses a multiprocessor algorithm based on the incremental garbage collector of Baker.

/pdf/multilisp-a-language-for-concurrent-symbolic-computation-2je5ymy3rh.pdf

MULTILISP: a language for concurrent symbolic computation

When distributed systems first appeared, they were programmed in traditional sequential languages, usually with the addition of a few library procedures for sending and receiving messages. As distributed applications became more commonplace and more sophisticated, this ad hoc approach became less satisfactory. Researchers all over the world began designing new programming languages specifically for implementing distributed applications. These languages and their history, their underlying principles, their design, and their use are the subject of this paper.We begin by giving our view of what a distributed system is, illustrating with examples to avoid confusion on this important and controversial point. We then describe the three main characteristics that distinguish distributed programming languages from traditional sequential languages, namely, how they deal with parallelism, communication, and partial failures. Finally, we discuss 15 representative distributed languages to give the flavor of each. These examples include languages based on message passing, rendezvous, remote procedure call, objects, and atomic transactions, as well as functional languages, logic languages, and distributed data structure languages. The paper concludes with a comprehensive bibliography listing over 200 papers on nearly 100 distributed programming languages.

/pdf/programming-languages-for-distributed-computing-systems-swl2r5wnf8.pdf

Programming languages for distributed computing systems

A document localization, management and delivery system in a computer environment. A preferred embodiment of the invention automatically determines the language and country of a Web site visitor and directs the Web server to deliver the appropriate localized content contained in a country/language database to the visitor's browser. The visitor's browser is notified of the proper font and content encoding needed to display the selected language and is allowed to download the font. A toolkit is provided which allows a master site to be built that is language and country-independent. The actual language and country content is placed in a language/country database where it is easily managed and maintained. When a visitor enters the site, the requested document is automatically served in the visitor's language and for the visitor's country by filling in a document template from the master site with the correct language content from the language/country database. A viewer allows the developer to view and debug the document template as it appears to a visitor in any of the available language content from the language/country database.

Multilingual electronic document translation, management, and delivery system

THE distinguished author of “Why the Mind has a Body” is one of the most original and fearless philosophers of the school which labels itself “Critical Realism.” The present short volume, though it is written with all the freshness and vigour we associate with his work, is frankly disappointing. This is because, instead of stating his theory and advancing his argument from his own point of view, he develops it by means of a rather tedious criticism of Mr. Bradley, Mr. Russell, M. Bergson, and other philosophers. His own theory rests, he tells us, on two assumptions: first, that there is a world; second, that there is a self. Nature, he is convinced, is really what it appears to be, and the self is an outgrowth of nature, though in some of its manifestations rising above it. It seems to us that the primary difficulty of such assumptions is that they conflict with physical science and are irreconcilable with the scientific concepts of nature and self. In philosophy, assumptions in the premises have a curious knack of turning up in the conclusion so that no real progress can be made, but they are otherwise harmless enough. Scientific reality is a question of real metaphysical interest at the present time, but it finds no place in this theory, which is mainly concerned with the question of sense-data.A Theory of Knowledge.Charles AugustusStrongBy. Pp. xii+103. (London, Bombay and Sydney: Constable and Co., Ltd., 1923.) 6s. net.

Theory of Knowledge

A layered architecture that can provide a unified environment for multiparadigm programming on sequential processors is described. The architecture gives open-endedness to a system for programming in multiple languages based on multiple paradigms. Language-specific constructs such as control structures and variable definitions are given in an upper layer. Lower layers describe concepts common to all languages, such as data types and reference protocols. Since communication among languages is handled in the lower layers, the upper layers provide an open-ended abstraction for multiparadigm programming. >

Layered architecture of multiple programming language system for multiparadigm programming

A variety of communities create and publish metadata as Linked Open Data (LOD). Users of those datasets find and use them for their own purposes and may combine the datasets to add value. Each LOD dataset uses various vocabularies, structures and constraints for describing resources. In order to improve the usability of LOD datasets, it is very important for metadata designers to enhance the interoperability of their own metadata with that of other datasets. In order to create new interoperable metadata, metadata schema designers have to understand the Application Profiles of the existing LOD datasets.

Dublin Core Description Set Profile (DSP) is a component of Dublin Core Application Profiles. A DSP describes the structures and constraints of metadata in an application (e.g., resource classes, properties cardinality and value scheme). Metadata schema registries, which collect and provide metadata schemas, have a large potential for helping metadata schema designers find, compare, and adopt existing schemas. However, most LOD datasets are not published with their DSPs. As a result, metadata schema designers have to look at each dataset and guess the DSPs.

This paper proposes a method to extract the structural constraints of metadata records automatically from metadata instances using existing metadata schema. The goal of this study is to reduce the cost of metadata schema extraction and to increase the number of metadata schemas registered in metadata schema registries. We have experimentally extracted constraints from LOD datasets using SPARQL. To evaluate, we applied our approach to 10 datasets in the DataHub. By comparing the structural constraints that were extracted using our approach with a manual approach, we found that our approach was able to extract more constraints.

http://dcpapers.dublincore.org/pubs/article/download/3706/1929

Extracting description set profiles from RDF datasets using metadata instances and SPARQL queries

Metadata application profiles act as a key element in interoperability of metadata instances. There are various accepted formats to express application profiles. Most of these expression formats such as RDF, OWL, JSON-LD, SHACL, and ShEx are machine-actionable, and formats like spreadsheets or web pages act as human-readable documentation. Due to limited options in the mutual conversion of these expression formats, they are often created independent of each other and thus makes the process of application profile creation and maintenance an expensive process requiring sophisticated skills and time. Proposals for convertible authoring formats to create application profiles have received less acceptance, mainly due to their inability in addressing various use cases and requirements. The authors describe a new authoring format based on YAML and evaluate the scope of extensibility of authoring formats by comparing this with the capabilities of two already available proposals; Simple DSP, Bibframe Editor. The comparison includes an attempt to recreate real-world application profiles with an extensible format. This study argues that the extensible authoring formats are suitable for creating application profiles with custom requirements and different use cases. This would promote the acceptance of application profiles by reducing the associated cost and skill requirements in creation, maintenance, and publishing of application profiles.

Authoring Formats and Their Extensibility for Application Profiles

Archiving Web content is an important topic for digital libraries and especially for deposit libraries. Web archiving systems usually collect Web resources using search robot software and/or by human labor. However, these resource gathering methods have disadvantages: for example, it is difficult to collect all historical versions of a resource or to collect hidden or dynamic resources. This paper proposes a Web archiving system which is designed to collect resources in accordance with a resource archiving policy determined by the person or organization which provides the resources on the Web. This paper presents the model of the Web archiving system and a prototype system implemented based on the model.

A policy-based system for institutional web archiving

/pdf/documenting-spatial-and-temporal-information-for-heritage-7767m9jnnd.pdf

Shigeo Sugimoto

Papers

Layered architecture of multiple programming language system for multiparadigm programming

Extracting description set profiles from RDF datasets using metadata instances and SPARQL queries

Authoring Formats and Their Extensibility for Application Profiles

A policy-based system for institutional web archiving

Documenting Spatial and Temporal Information for Heritage Preservation: A Case Study of Sri Lanka