43,471 research outputs found
The BTeV Software Tutorial Suite
The BTeV Collaboration is starting to develop its C++ based offline software
suite, an integral part of which is a series of tutorials. These tutorials are
targeted at a diverse audience, including new graduate students, experienced
physicists with little or no C++ experience, those with just enough C++ to be
dangerous, and experts who need only an overview of the available tools. The
tutorials must both teach C++ in general and the BTeV specific tools in
particular. Finally, they must teach physicists how to find and use the
detailed documentation. This report will review the status of the BTeV
experiment, give an overview of the plans for and the state of the software and
will then describe the plans for the tutorial suite.Comment: Submitted to the proceedings of CHEP03, paper number THLT00
The CAMOMILE collaborative annotation platform for multi-modal, multi-lingual and multi-media documents
In this paper, we describe the organization and the implementation of the CAMOMILE collaborative annotation framework for multimodal, multimedia, multilingual (3M) data. Given the versatile nature of the analysis which can be performed on 3M data, the structure of the server was kept intentionally simple in order to preserve its genericity, relying on standard Web technologies. Layers of annotations, defined as data associated to a media fragment from the corpus, are stored in a database and can be managed through standard interfaces with authentication. Interfaces tailored specifically to the needed task can then be developed in an agile way, relying on simple but reliable services for the management of the centralized annotations. We then present our implementation of an active learning scenario for person annotation in video, relying on the CAMOMILE server; during a dry run experiment, the manual annotation of 716 speech segments was thus propagated to 3504 labeled tracks. The code of the CAMOMILE framework is distributed in open source.Peer ReviewedPostprint (author's final draft
Public transit route planning through lightweight linked data interfaces
While some public transit data publishers only provide a data dump – which only few reusers can afford to integrate within their applications – others provide a use case limiting origin-destination route planning api. The Linked Connections framework instead introduces a hypermedia api, over which the extendable base route planning algorithm “Connections Scan Algorithm” can be implemented. We compare the cpu usage and query execution time of a traditional server-side route planner with the cpu time and query execution time of a Linked Connections interface by evaluating query mixes with increasing load. We found that, at the expense of a higher bandwidth consumption, more queries can be answered using the same hardware with the Linked Connections server interface than with an origin-destination api, thanks to an average cache hit rate of 78%. The findings from this research show a cost-efficient way of publishing transport data that can bring federated public transit route planning at the fingertips of anyone
Towards an Interaction-based Integration of MKM Services into End-User Applications
The Semantic Alliance (SAlly) Framework, first presented at MKM 2012, allows
integration of Mathematical Knowledge Management services into typical
applications and end-user workflows. From an architecture allowing invasion of
spreadsheet programs, it grew into a middle-ware connecting spreadsheet, CAD,
text and image processing environments with MKM services. The architecture
presented in the original paper proved to be quite resilient as it is still
used today with only minor changes.
This paper explores extensibility challenges we have encountered in the
process of developing new services and maintaining the plugins invading
end-user applications. After an analysis of the underlying problems, I present
an augmented version of the SAlly architecture that addresses these issues and
opens new opportunities for document type agnostic MKM services.Comment: 14 pages, 7 figure
Ultra-Reliable Low Latency Communication (URLLC) using Interface Diversity
An important ingredient of the future 5G systems will be Ultra-Reliable
Low-Latency Communication (URLLC). A way to offer URLLC without intervention in
the baseband/PHY layer design is to use interface diversity and integrate
multiple communication interfaces, each interface based on a different
technology. In this work, we propose to use coding to seamlessly distribute
coded payload and redundancy data across multiple available communication
interfaces. We formulate an optimization problem to find the payload allocation
weights that maximize the reliability at specific target latency values. In
order to estimate the performance in terms of latency and reliability of such
an integrated communication system, we propose an analysis framework that
combines traditional reliability models with technology-specific latency
probability distributions. Our model is capable to account for failure
correlation among interfaces/technologies. By considering different scenarios,
we find that optimized strategies can in some cases significantly outperform
strategies based on -out-of- erasure codes, where the latter do not
account for the characteristics of the different interfaces. The model has been
validated through simulation and is supported by experimental results.Comment: Accepted for IEEE Transactions on Communication
Hypermedia-based discovery for source selection using low-cost linked data interfaces
Evaluating federated Linked Data queries requires consulting multiple sources on the Web. Before a client can execute queries, it must discover data sources, and determine which ones are relevant. Federated query execution research focuses on the actual execution, while data source discovery is often marginally discussed-even though it has a strong impact on selecting sources that contribute to the query results. Therefore, the authors introduce a discovery approach for Linked Data interfaces based on hypermedia links and controls, and apply it to federated query execution with Triple Pattern Fragments. In addition, the authors identify quantitative metrics to evaluate this discovery approach. This article describes generic evaluation measures and results for their concrete approach. With low-cost data summaries as seed, interfaces to eight large real-world datasets can discover each other within 7 minutes. Hypermedia-based client-side querying shows a promising gain of up to 50% in execution time, but demands algorithms that visit a higher number of interfaces to improve result completeness
Goal-Oriented RE for E-Services
Current research in service-oriented computing (SoC) is mainly\ud
about technology standards for SoC and the design of software components that\ud
implement these standards. In this paper we investigate the problem of\ud
requirements engineering (RE) for SoC. We propose a framework for goaloriented\ud
RE for e-services that identifies patterns in service provisioning and\ud
shows how to compose business models from them. Based on an analysis of 19\ud
business models for e-intermediaries we identified 10 intermediation service\ud
patterns and their goals, and show how we can compose new business models\ud
from those patterns in a goal-oriented way. We represent the service patterns\ud
using value models, which are models that show which value exchanges\ud
business patterns engage in. We conclude the paper with a discussion of how\ud
this approach can be extended to include business process patterns to perform\ud
the services, and software components that support these processes
- …