Search

In the environment of the World Wide Web large volumes of library data have been pub-lished following different conceptual models. The navigation through these volumes and the data interlinking require the development of mappings between the conceptual models. Library conceptual models provide constructs for the representation of bibliographic families and the relationships between Works. A key requirement for successful map-pings between different conceptual models is to preserve such content relationships. This paper studies a set of cases (Work with single Expression, Work with multiple Expres-sions, translation, adaptation) to examine if and how bibliographic content relationships and families could be preserved in mappings from FRBR to BIBFRAME 2.0. Even though, relationships between Works of the same bibliographic family may be preserved, the progenitor Work is not always represented in BIBFRAME after mappings.

Usual processes for pursuing education excellence in a graduate program are candidate selection, coursework, research, and thesis defense. This paper is an experience report on a complementary approach: the growing of a peer review culture among graduate students. We instruct first-year masters and doctoral students on principles for preparing a thesis proposal. Students present their proposals in collective discussion sessions with feedback from professors. The students then submit their proposals through a web interface and are instructed on the role they will play next of anonymous referees of their peers proposals. The referee reports and general statistics are made available to all participating students and advisers. Updated proposals are submitted to an annual workshop open to all participating students and advisers. About 60 students take part in this annual series of seminars with peer review and workshop, generating individual thesis proposals and 180 referee reports, 3 for each proposal. Students and their advisers receive detailed feedback on individual participation as author and referee. The main strength of this experience is the opportunity to assimilate the techniques of objective criticism and to reflect about the quality of own and others work. The paper outlines future research and development issues.

Integration of library data into the Linked Data environment is a key issue in li-braries and is approached on the basis of interoperability between library data conceptual models. Achieving interoperability for different representations of the same or related entities between the library and cultural heritage domains shall enhance rich bibliographic data reusability and support the development of new data-driven information services. This paper aims to contribute to the desired in-teroperability by attempting to map core semantic paths between the BIBFRAME and EDM conceptual models. BIBFRAME is developed by the Library of Con-gress to support transformation of legacy library data in MARC format into linked data. EDM is the model developed for and used in the Europeana Cultural Heritage aggregation portal.

Semantic Web technologies and Linked data form a new reference framework for libraries. The library community aims to integrate its data with the Semantic Web and as a result new library data models have been developed. In this context, significant research effort focuses on the alignment between the library models with relevant models developed by other communities in the cultural heritage domain. However there exist several issues concerning the interoperability between all these data models. This paper seeks to contribute in the interoperability of four models, namely FRBR, FRBRoo, EDM and BIBFRAME. It highlights the commonalities and the divergences between them by using a case bibliographic record and by exploring how this record is represented by each one of them.

This thesis studies the library data and the way that linked data technologies may affect libraries. The thesis aims to contribute to the research regarding the devel-opment and implementation of a framework for the integration of bibliographic data in the semantic web. It seeks to make sound propositions for the interopera-bility of conceptual bibliographic models, as well as for future library systems and search environments integrating bibliographic information.

Semantic architecture is crucial for a digital library application especially in a distributed system environment. It provides various approaches to overcome semantic interoperability problems and usually consists of metadata solution with open system architecture. The design of the digital library system for the China Cultural Celebrities’ Manuscripts Library (CCCML), which is a branch of Shanghai Library, has taken into account a lot of the main aspects from the requirement of semantics, including the metadata profiles, encoding consistence, authority control, ontology functioning, semantic integration, etc. We argue that it is very important to establish an articulated layered semantic architecture for digital libraries in the semantic web environment. And it becomes more and more clear that the semantic services can be settled with the Semantic Web Services technologies, which is supported by and consisted of a wide range of standards and protocols. And a lot of mainstream interoperability architecture, such as OAI, OpenURL etc., can be conformed or implemented by Semantic Web Services. This paper gives some major considerations and overviews on the design of semantic architecture for CCCML, which shows a lot of similarity in typical digital library systems.

In this paper we present a method based on fuzzy computing with words to measure the informative quality of Web sites used to publish information stored in XML documents. This method generates linguistic recommendations on the informative quality of Web sites. This method is made up of both an evaluation scheme to analyze the informative quality of such Web sites and a generation method of linguistic recommendations. The evaluation scheme presents both technical criteria of Web site design and criteria related to the content of information of Web sites. It is oriented to the user because the chosen criteria are user friendly, in such a way that visitors to a Web site can assess them by means of linguistic evaluation judgements. The generation method generates linguistic recommendations of Web sites based on those linguistic evaluation judgements using the LOWA and LWA operators. Then, when a user looks for information on the Web we can help him/her with both recommendations on Web sites which store the retrieved documents and also recommendations on other Web sites which store other documents of interest related to his/her information needs. With this proposal information filtering and evaluation possibilities on the Web are increased.

Counterexample minimization tries to remove irrelevant variables from counterexamples, such that they are easier to be understood. For the first time, we proposes a novel approach to minimize looplike and path-like counterexamples of ACTL properties. For a counterexample s0 . . . sk, our algorithm tries to extract a succinct cube sequence c0 . . . ck, such that paths run through c0 . . . ck are all valid counterexamples. Experimental result shows that our algorithm can significantly minimize ACTL counterexamples.

It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample minimization algorithm. This algorithm is the most effective one among all existing approaches, but time overhead of its second stage(called BFL) is very large due to one call to SAT solver per candidate variable to be eliminated. So we propose a faster counterexample minimization algorithm based on unit core extraction and incremental SAT. First, for every unsatisfiable instance of BFL, we perform unit core extraction algorithm to extract the set of variables that are sufficient to lead to conflict, all variables not belong to this set can be eliminated simultaneously. In this way, we can eliminate many variables with only one call to SAT solver. At the same time, we employ incremental SAT approach to share learned clauses between similar instances of BFL, to prevent overlapped state space from being searched repeatedly. Theoretic analysis and experiment result show that, our approach is 1 order of magnitude faster than K Ravi’s algorithm, and still retains its ability to eliminate irrelevant variables.

We propose a novel approach to locate errors in complex counterexample of safety property. Our approach measures the distance between two state transition traces with difference of their control flow. With respect to this distance metrics, our approach search for a witness as near as possible to the counterexample. Then we can obtain the set of control flow predicates with difference assignment in witness and counterexample. Run this witness-searching algorithm iteratively, we can then obtain a predicate list with priority. A predicate with higher priority means that this predicate is more likely the actual error. Experiment result shows that our approach is highly accurate.

Human-centered computation is characterized by at least three features: it must be adaptive, reactive, and it must empower the user to configure and extend the behavior of the systems using her natural modes of interaction. In our previous work we have proposed systems that address the first two features. In this paper we present Alfred – a natural end user programming interface for Intelligent Environments., Engineering and Applied Sciences

An oblivious subspace embedding (OSE) for some \(\epsilon\),\(\delta \in (0,1/3)\) and d ≤ m ≤ n is a distribution \(\mathcal{D}\) over \(\mathbb{R}^{m×n}\) such that \(\underset {\Pi \sim \mathcal{D}} {Pr} (\forall x \in W, (1−\epsilon)|| x ||_2≤ || \Pi x ||_2≤(1+\epsilon)|| x||_2)≥1−\delta\) for any linear subspace \(W \subset \mathbb{R}^n\) of dimension d. We prove any OSE with \(\delta < 1/3\) has \(m = \Omega((d + log(1/\delta))/\epsilon^2)\), which is optimal. Furthermore, if every \(\Pi\) in the support of \(\mathcal{D}\) is sparse, having at most s non-zero entries per column, we show tradeoff lower bounds between m and s., Engineering and Applied Sciences

Mathematics

Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms presented use constraint satisfaction techniques to compare user interaction histories to a set of ideal solutions. We evaluate these algorithms on data obtained from user interactions with a commercially available pedagogical software, and find that these algorithms identified users’ activities with 93% accuracy., Engineering and Applied Sciences