The Diversity Paradox

At the core of museum practice is the notion of diversity. However, as this analysis of different types of metadata production shows, contradictory ideas and ideals pervade both metadata production among information specialists (i.e. archivists, metadata managers, curators working in the heritage institutions), and the systems for, and practices of, participatory metadata production. While the discourse on metadata standards is permeated by ideas of objectivity and interoperability the field is, in practice, far from coherent, being marked by a great variety as regards templates, formats and vocabularies. Conversely, the discourse on digital participation in the cultural heritage is permeated with notions of diversity, as means to increase democracy and support variety. In practice, however, the available crowdsourcing platforms are often formulaic offering few possibilities for the crowd to add individual interpretations and their own agenda. This analysis of the practice of producing descriptive metadata reveals the complex, multifaceted implications of notions of diversity for the cultural heritage. Diversity, meaning great variety, is then not solely a positive end in itself but can in fact hinder the distribution and linkability of information and thereby the creation and building of new knowledge. Likewise, participatory activities where heritage institutions reach out to the crowd do not automatically generate diversity as there is no direct correlation between the magnitude of the group and variability. To understand this complexity and acknowledge the, sometimes, contradictory demands and effects related to the notion and norms of diversity is at the core of the making and preservation of our cultural heritage.

Support varieties of baby Verma modules

Let [Formula: see text] be a connected reductive algebraic group over an algebraically closed field [Formula: see text] of prime characteristic [Formula: see text] and [Formula: see text]. For a given nilpotent [Formula: see text]-character [Formula: see text], let [Formula: see text] be a baby Verma module associated with a restricted weight [Formula: see text]. A conjecture describing the support variety of [Formula: see text] via that of its restricted counterpart is given: [Formula: see text]. Under the assumption of [Formula: see text](the Coxeter number) and [Formula: see text] [Formula: see text]-regular, this conjecture is proved when [Formula: see text] falls in the regular nilpotent orbit for any [Formula: see text] and the subregular nilpotent orbit for [Formula: see text] being of type [Formula: see text]. We also verify this conjecture whenever [Formula: see text] is of type [Formula: see text] and [Formula: see text] falls in the minimal nilpotent orbit.

GENERALIZATION TECHNIQUE FOR 2D+SCALE DHE DATA MODEL

Different users or applications need different scale model especially in computer application such as game visualization and GIS modelling. Some issues has been raised on fulfilling GIS requirement of retaining the details while minimizing the redundancy of the scale datasets. Previous researchers suggested and attempted to add another dimension such as scale or/and time into a 3D model, but the implementation of scale dimension faces some problems due to the limitations and availability of data structures and data models. Nowadays, various data structures and data models have been proposed to support variety of applications and dimensionality but lack research works has been conducted in terms of supporting scale dimension. Generally, the Dual Half Edge (DHE) data structure was designed to work with any perfect 3D spatial object such as buildings. In this paper, we attempt to expand the capability of the DHE data structure toward integration with scale dimension. The description of the concept and implementation of generating 3D-scale (2D spatial + scale dimension) for the DHE data structure forms the major discussion of this paper. We strongly believed some advantages such as local modification and topological element (navigation, query and semantic information) in scale dimension could be used for the future 3D-scale applications.

APPLICATION PERSPECTIVE OF 2D+SCALE DIMENSION

Different applications or users need different abstraction of spatial models, dimensionalities and specification of their datasets due to variations of required analysis and output. Various approaches, data models and data structures are now available to support most current application models in Geographic Information System (GIS). One of the focuses trend in GIS multi-dimensional research community is the implementation of scale dimension with spatial datasets to suit various scale application needs. In this paper, 2D spatial datasets that been scaled up as the third dimension are addressed as 2D+scale (or 3D-scale) dimension. Nowadays, various data structures, data models, approaches, schemas, and formats have been proposed as the best approaches to support variety of applications and dimensionality in 3D topology. However, only a few of them considers the element of scale as their targeted dimension. As the scale dimension is concerned, the implementation approach can be either multi-scale or vario-scale (with any available data structures and formats) depending on application requirements (topology, semantic and function). This paper attempts to discuss on the current and new potential applications which positively could be integrated upon 3D-scale dimension approach. The previous and current works on scale dimension as well as the requirements to be preserved for any given applications, implementation issues and future potential applications forms the major discussion of this paper.

Scalable Multimedia Archive Storage System Research

In the traditional file system, The lack of contact between the file name and the data content led to waste a lot of availability storage space, especially in large data archive storage system. This paper designs and implements a scalable multimedia archive storage system, called IMCAS. IMCAS use CAS store the archive data and use real-time monitor program automatically extract metadata information. through dynamic loading extraction module, the system can support variety of multimedia form.

Filtrations in Modular Representations of Reductive Lie Algebras

Let G be a connected reductive algebraic group over an algebraically closed field k of prime characteristic p, and 𝔤 = Lie (G). In this paper, we study representations of the reductive Lie algebra 𝔤 with p-character χ of standard Levi form associated with an index subset I of simple roots. With aid of the support variety theory, we prove that a Uχ(𝔤)-module is projective if and only if it is a strong "tilting" module, i.e., admitting both [Formula: see text]- and [Formula: see text]-filtrations. Then by an analogy of the arguments in [2] for G1T-modules, we construct so-called Andersen–Kaneda filtrations associated with each projective 𝔤-module of p-character χ, and finally obtain sum formulas from those filtrations.

Decentralized Overlay for Federation of Enterprise Clouds

This chapter describes Aneka-Federation, a decentralized and distributed system that combines enterprise Clouds, overlay networking, and structured peer-to-peer techniques to create scalable wide-area networking of compute nodes for high-throughput computing. The Aneka-Federation integrates numerous small scale Aneka Enterprise Cloud services and nodes that are distributed over multiple control and enterprise domains as parts of a single coordinated resource leasing abstraction. The system is designed with the aim of making distributed enterprise Cloud resource integration and application programming flexible, efficient, and scalable. The system is engineered such that it: enables seamless integration of existing Aneka Enterprise Clouds as part of single wide-area resource leasing federation; self-organizes the system components based on a structured peer-to-peer routing methodology; and presents end-users with a distributed application composition environment that can support variety of programming and execution models. This chapter describes the design and implementation of a novel, extensible and decentralized peer-to-peer technique that helps to discover, connect and provision the services of Aneka Enterprise Clouds among the users who can use different programming models to compose their applications. Evaluations of the system with applications that are programmed using the Task and Thread execution models on top of an overlay of Aneka Enterprise Clouds have been described here.