Institutional Metadata and the Problem of Context

2020 ◽  
Vol 6 (2) ◽  
pp. 17-34
Author(s):  
Jane Birkin

Abstract The traditional archive catalogue constitutes a form of structural and descriptive metadata that long precedes the internet; and the cataloguing of photographs is just one part of a process of archival administration. The application of keywords to images contrasts with archival prose description, which is based on the visual content of the image and is predominantly context-free; a remediation of the image itself. At the heart of this lies the notion that the single photograph is itself devoid of context; it is a discrete embodiment of shutter time and there is nothing certain either side of that. Thus, one can only speculate at its context, and institutional description techniques actively avoid such speculation. Yet context in the archive is ever-present and key to the function of images as objects of information and evidence. It is built through static relationships, through the situating of photographs in accordance with the concept of original order, and it is replicated through storage systems and hierarchical catalogue entries. Such orders, hierarchies and relationships are absent within sets of images that are brought together by keyword search, including through the websites of archival institutions that struggle to reconcile archival principles and identity with network culture. Images are transported to places where contextual information is at best difficult to access, especially for those unfamiliar with archival interfaces. In contrast to the controlled stasis of archival storage and interconnected recordkeeping systems, network storage is messy, unstable and poorly described. However, we must accept that context is not a prerequisite for many users, and for them the networking of archival images denotes a freedom; a democratisation of the archive. But in a media-driven society that is becoming more and more indifferent to the evidential value of documents of any kind, the context-free image is left predisposed to exploitation.

2015 ◽  
Vol 81 (8) ◽  
pp. 1532-1541 ◽  
Author(s):  
Jin Li ◽  
Xiaofeng Chen ◽  
Fatos Xhafa ◽  
Leonard Barolli

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Sun-Ho Lee ◽  
Im-Yeong Lee

Data outsourcing services have emerged with the increasing use of digital information. They can be used to store data from various devices via networks that are easy to access. Unlike existing removable storage systems, storage outsourcing is available to many users because it has no storage limit and does not require a local storage medium. However, the reliability of storage outsourcing has become an important topic because many users employ it to store large volumes of data. To protect against unethical administrators and attackers, a variety of cryptography systems are used, such as searchable encryption and proxy reencryption. However, existing searchable encryption technology is inconvenient for use in storage outsourcing environments where users upload their data to be shared with others as necessary. In addition, some existing schemes are vulnerable to collusion attacks and have computing cost inefficiencies. In this paper, we analyze existing proxy re-encryption with keyword search.


2017 ◽  
Vol 9 (2) ◽  
pp. 47-67
Author(s):  
Latreche Abdelkrim ◽  
Lehireche Ahmed ◽  
Kadda Benyahia

Traditional information search approaches do not explicitly capture the meaning of a keyword query, but provide a good way for the user to express his or her information needs based on the keywords. In principle, semantic search aims to produce better results than traditional keyword search, but its progression has retarded because of to the complexity of the query languages. In this article, the authors present an approach to adapt keyword queries to querying the semantic web based on semantic annotations: the approach automatically construct structured formal queries from keywords. The authors propose a new process where they introduce a novel context-based query autocompletion feature to help the users to construct their keywords query by suggesting queries given prefixes. They also address the problem of context-based generating formal queries by exploiting user's query history, where previous queries can be used as contextual information for generating a new query. With the first tests, the authors' approach achieved encouraging results.


2003 ◽  
Vol 13 (02) ◽  
pp. 207-223 ◽  
Author(s):  
JAMES S. PLANK ◽  
SCOTT ATCHLEY ◽  
YING DING ◽  
MICAH BECK

As peer-to-peer and wide-area storage systems become in vogue, the issue of delivering content that is cached, partitioned and replicated in the wide area, with high performance, becomes of great importance. This paper explores three algorithms for such downloads. The storage model is based on the Network Storage Stack, which allows for flexible sharing and utilization of writable storage as a network resource. The algorithms assume that data is replicated in various storage depots in the wide area, and the data must be delivered to the client either as a downloaded file or as a stream to be consumed by an application, such as a media player. The algorithms are threaded and adaptive, attempting to get good performance from nearby replicas, while still utilizing the faraway replicas. After defining the algorithms, we explore their performance downloading a 50 MB file replicated on six storage depots in the U.S., Europe and Asia, to two clients in different parts of the U.S. One algorithm, called progress-driven redundancy, exhibits excellent performance characteristics for both file and streaming downloads.


Sign in / Sign up

Export Citation Format

Share Document