waashk/dblp huggingface dataset:
use case-driven component specification: a medical applications perspective to product line development. modular and flexible software components can be useful for reuse across a class of domain-specific applications or product lines. by varying the composition of components suited to a particular product line, an assortment of applications can be developed to support differing operational needs. a top-down approach to the design components for a specific application may be effective, however a more evolutionary approach is needed to support the specification of components suited for a class of applications. in addition, such evolutionary approaches require support for the knowledge transfer that must occur from domain experts, who are not software experts, to skilled software engineers. by combining concepts from software product line development (spld) and other evolutionary design techniques, a new, use case-driven approach has been created called component-based product line analysis and design (c-plad). this approach was used to develop components in the domain of image-guided surgery applications.
exploiting contextual change in context-aware retrieval. information retrieval systems are usually unaware of the context in which they are being used. we believe that exploiting context information to augment existing retrieval methods can lead to increased retrieval precision. this approach is particularly important with the development of wireless mobile information appliances, such as pdas. many of these devices are aware of the user's physical context, and this has led to the evolution of context-aware applications. such applications can automatically utilise the user's current context, e.g. location or ambient temperature. context-aware retrieval is related to traditional information retrieval and information filtering, but is potentially more challenging due to the often continuous changes in user context. to meet these challenges we suggest a potential advantage of context-aware retrieval: this is that the current context is often changing gradually and semi-predictably. in this paper we suggest new methods based on a context-diary and caching aimed at improving both the precision of relevant retrieved information and the speed/availability of retrieval. the methods can be used, in principle, on top of existing retrieval systems.
video information retrieval using objects and ostensive relevance feedback. in this paper, we present a brief overview of current approaches to video information retrieval (ir) and we highlight its limitations and drawbacks in terms of satisfying user needs. we then describe a method of incorporating object-based relevance feedback into video ir which we believe opens up new possibilities for helping users find information in video archives. following this we describe our own work on shot retrieval from video archives which uses object detection, object-based relevance feedback and a variation of relevance feedback called ostensive rf which is particularly appropriate for this type of retrieval.
potential prevention of medical errors in casualty surgery by using information technology. recent studies on adverse events in medicine have shown that errors in medicine are not rare and may cause severe harm. quality problems in discharge letters may be a source of medical error. we have analyzed 150 discharge letters of an outpaitient clinic for casualty surgery in order to identify and to classify typical mistakes. a failure mode and effect analysis has been initiated in order to estimate the risk associated with different failure types. possible it solutions to prevent the identified problems have been assessed, focusing on expected effects and on feasibility. our analyses have shown that there is a need to improve the quality of discharge letters, and that it support based on the frequency and severity of certain error types has a good potential. we plan to introduce both pre-structured discharge letters and reminders in order to prevent the observed errors. they could improve both documentation quality and, if used during the patient visit, quality of treatment. moreover, they could produce training effects on less experienced physicians. to be able to rapidly integrate such an adapted it support into a comprehensive healthcare information system (his), it is important to establish a responsive it infrastructure.
strategic alignment in requirements analysis for organizational it: an integrated approach. we present an integrated approach to requirements engineering for organizational it to help ensure it-business strategy alignment. a single, unified model to enable validation of system requirements against business strategy is proposed. we use vmost analysis to deconstruct business strategy. we then model strategy using a goal-oriented requirements engineering notation; this is done within the framework for modeling an organization's business strategy proposed by the business rules group. we use jackson's problem frames to represent business model context. our approach is illustrated via an e-business case study of seven-eleven japan taken from the literature.
advanced modeling and browsing of technical documents. this article proposes three techniques for improving the modeling and browsing of electronic books for technical documents specified in xml. technical documents are for two reasons prime applications for electronic books. first, electronic devices are nowadays widely used for the distribution, storage, and updating of such documents. second, since most technical documents have rather complex semantics and structure, they might be easier to consult as electronic books with their advanced functionalities than as paper prints.the techniques proposed in this article are as follows. first, author's views are proposed as a means for grouping semantically related, yet different contents. second, browsing style sheets are proposed for distinguishing between the semantics of hypertext links and their traversal behavior more drastically than it is the case with current xml hypertext links. third, a tool called reader's view is described with which a reader can annotate and restructure an electronic book while exploring it. these techniques remind of former proposals made in the hypertext community. the focus of the present proposal is the smooth integration of the proposed techniques within the existing xml/html world so as to exploit existing standards and tools as far as possible.
reactivity on the web: paradigms and applications of the language xchange. reactivity on the web is an emerging issue. it is essential for upcoming web systems such as online marketplaces, adaptive, semantic web systems as well as web services and grids. this article first introduces the paradigms upon which the high-level language xchange for programming reactive behaviour and distributed applications on the web relies. then, it briefly presents the main syntactical constructs of xchange. finally, it sketches the implementation in xchange of a reactive web-based application.
agent-based services for information portals. web portals have a huge importance on today's internet. their purpose is to serve as an entry point to information on the web, by proposing search and classification related services. the usefulness of a web portal depends directly on the quality of service it offers. this paper presents the simat architecture which exploits a backbone of machines running a secure mobile agent platform to improve quality of service. the agents are programmed to reduce the latency of information retrieval and to support the personalization and security of information search requests.
an owl-s based approach to express grid services coordination. e-science and e-business share the need of a middleware that integrates dynamic services running on distributed, heterogeneous platforms. the grid community is addressing this problem by moving towards web services as it is proposed in the open grid service architecture (ogsa). in this paper we discuss the benefits of using an ontology driven approach to grid services in order to enhance their composability thus enabling the submission of multiple interoperating jobs. specifically we introduce an owl-s extension to describe relations among grid jobs in order to express coordination-related aspects. this enables to expose coordination requirements in an orthogonal way with respect to single jobs management. as a proof of concept we use this extension to express relations among jobs in order to support the automation of the matchmaking of resources.
warp: web application rapid prototyping. this paper describes an environment specifically tailored for the design and the rapid prototyping of web applications. the environment, named warp (web application rapid prototyping), offers a set of online software tools, which assist the designer and the user browsing of a web application, in all its different aspects.the environment is based upon models and techniques already used in the hypermedia, information systems, and software engineering fields, adapted and blended in an original mix. the foundation of the proposal is the conceptual design of web applications, starting from hdm, a notation for the specification of structure navigation, and presentation semantics.compared to existing tools, warp is an aid for analysis and design of web application because it introduces a new approach completely on-line (both the design and the execution environment). so the author can immediately formulate and evaluate requirements, specification and designs.a real-life experience of the use of the methodology and of the warp in academic context are reported.
replica placement in adaptive content distribution networks. adaptive content networking is a promising new approach aimed at scalable delivery of content to a pervasive client population. by adaptive content delivery networks (a-cdn) content is adapted, replicated and delivered to the clients in a cost-quality-optimized fashion. the integration of content adaptation into cdns minimizes the interference of adaptation with replication effectiveness.the paper presents ongoing research on replica placement in a-cdns. based on a static model for cost-quality-optimized adaptive content networking, algorithms to optimize the placement of replicas in the surrogates of an a-cdn are discussed. the dynamics of a real web scenario are not explicitly taken into account by the algorithms. whereas long-term dynamics are dealt with by periodic adjustments of the underlying model and recalculation of an optimal placement, short term dynamics are considered to result in inaccuracies in the system and load model. therefore, algorithms being tolerant to an imperfect underlying model are chosen.as adaptation path composition turns out to be a subproblem of replica placement in a-cdns, we also introduce an algorithm for optimal adaptation path composition.
automatic parallelism in differentiation of fourier transforms. for functions given in the form of a computer program, automatic differentiation is an efficient technique to accurately evaluate the derivatives of that function. starting from a given computer program, automatic differentiation generates another program for the evaluation of the original function and its derivatives in a fully mechanical way. while the efficiency of this black box approach is already high as compared to numerical differentiation based on divided differences, automatic differentiation can be applied even more efficiently by taking into account high-level knowledge about the given computer program. we show that, in the case where the function involves a fourier transform, the degree of parallelism in the program generated by automatic differentiation can be increased leading to a rich set of automatic parallelization strategies that are not available when employing a black box automatic parallelization approach. experiments of the new automatic parallelization approach are reported on a sunfire 6800 server using up to 20 processors.
efficient mass decomposition. we study the problem of decomposing a positive integer m over a (fixed and finite) weighted alphabet &sigma;: we want to find non-negative integers ci such that m = c1a1+...+ckak, where the ai are the positive integer weights of the individual characters and |&sigma;| = k. we refer to the vector (c1,...,ck) as a witness (of m over &sigma;), and denote by &gamma;(m) the number of distinct witnesses of m. we present a data structure of size o(ka1) that allows finding all witnesses of any query m in time o(ka1. &gamma;(m). to the best of our knowledge, this is the first algorithm for the problem with runtime independent of the size of the query m. construction of the data structure requires o(ka1) time and constant additional space, and is very easy to implement.the problem is motivated by mass spectrometry experiments, where peaks need to be mapped to sample molecules whose mass they could represent. our simulations show that the algorithm presented performs well on relevant applications.
efficient derivative computations in neutron scattering via interface contraction. for the solution of a minimization problem, a neutron scattering simulation needs accurate and efficient derivatives of an objective function in the form of a fortran 77 program with about 3,500 lines of code. we use the adifor system implementing the technology of automatic differentiation to transform the given computer code into another program capable of evaluating the objective function and its derivatives. compared to numerical differentiation, the derivatives obtained from applying automatic differentiation in this black-box fashion are free from truncation error and, in this application, their computation requires less time. to increase the efficiency of automatic differentiation further, a technique called interface contraction is used. the idea of interface contraction is to exploit the local structure of a given code by temporarily reducing the number of derivatives propagated through the code. by reporting performance results, we show the significance of interface contraction in the neutron scattering application. we also demonstrate the simplicity of the approach and argue that interface contraction should be incorporated into future automatic differentiation tools.
hiding complexity and heterogeneity of the physical world in smart living environments. continuous technological advances lead to computerize all the electronic devices and connect them in a network, so that in the future physical and virtual worlds will be integrated and interoperate each other at the point that browsing the reality will be similar to browsing the web. heterogeneous networked devices, services satisfying needs of people and living environments equipped with devices and services, will have to collaborate instead of working independently for offering to the end-user a better quality of the daily life. as a consequence, developers of ubiquitous computing and communication software infrastructures should address their efforts toward the abstraction of the implemented concepts. they have to abstract concepts from direct and immediate human needs in specific smart environments, avoid undue assumptions about the available devices or services and promote decoupling among distinctive, physical and functional features of devices and services.this paper briefly describes the extensible software architecture for smart environments the authors designed and implemented and presents the approach used for representing the physical world in a useful, comprehensible and more abstract manner and facilitating connections with the virtual world.
a class of openmp applications involving nested parallelism. today, openmp is the de facto standard for portable shared-memory programming supporting multiple levels of parallelism. unfortunately, most of the current openmp implementations are not capable of fully exploiting more than one level of parallelism. with the increasing number of processors available in high-performance computing resources, the number of applications that would benefit from multilevel parallelism is also increasing. applying automatic differentiation to openmp programs is introduced as a new class of openmp applications with nested parallelism.
architecture for user-controlled e-privacy. empowering users to make informed decision-making over online release of private data is a challenge in today's society. a large majority of users has rejected many e-privacy business models including lumeria's, zero-knowledge's, and microsoft's passport. in detailing privacy requirements for an architecture for user-controlled e-privacy, we provide some key reasons, mainly centered around user's perception of control, behind the apparent dismissal of business models for privacy based on trusted third parties. we describe an architecture, based on the p3p platform, that supports privacy requirements for enhanced user control of privacy. privacy management issues that are addressed include the identification of data repositories and their purposes, user agents and their roles and interactions, and the separation of persona profile information from user preference information.
accelerating approximate similarity queries using genetic algorithms. searching for the exact answer to a similarity query is an expensive process considering computational resources, such as memory and processing time requirements. moreover, comparison operations over multimedia data is even more expensive than over traditional data such as numbers and small character strings. therefore, when comparing multimedia data, the comparison computations usually consider some properties extracted from the data elements. in this way, exact queries involving this kind of data return data that is exact regarding the properties compared, but not necessarily exact regarding the multimedia data itself. for example, searching for similar images regarding their colors return images whose color histogram are the most similar, but the retrieved images can be very different regarding, for instance, the shape the objects pictured. therefore, for applications dealing with complex data types, trading exact answering with query time response can be worthwhile. in this paper we propose to use techniques based on genetic algorithms to allow retrieving data indexed in a metric access methods within a limited, user-defined, amount of time. we show that these techniques lead to much faster execution, without reducing the quality of the answer. we also present experimental evaluation using real datasets, showing that suitable results can be obtained in a fraction of the time required to obtain the exact answer.
provably faithful evaluation of polynomials. we provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. to this end, we develop a formalization of floating-point numbers and rounding modes in the program verification system (pvs). our work is based on a well-known formalization of floating-point arithmetic in the proof assistant coq, where polynomial evaluation has been already studied. however, thanks to the powerful proof automation provided by pvs, the sufficient conditions proposed in our work are more general than the original ones.
software agents for process monitoring and notification. safety and efficiency are primary concerns in chemical processing facilities, though the complexity of many such systems often makes it difficult for operators to detect abnormal conditions before they compromise throughput or become hazardous. in this paper, we report initial results from the application of multi-agent systems to monitor complex chemical processes and flexibly and appropriately notify key plant personnel about off-nominal conditions.
conceptual process configurations in enterprise knowledge management systems. in this paper we will present the results of research into the semantics of modeling constructs for the process-oriented perspective for the conceptual modeling of enterprise subject areas. the set of modeling constructs that are defined in this paper are fully 'compatible' with the models in the data-oriented perspective in the fact oriented school of conceptual modeling. we will derive the 'semantic' bridges for the conceptual modeling methodology for enterprises in the process-oriented perspective.
an integrated tool for microarray data clustering and cluster validity assessment. in this paper we present a data mining system, which allows the application of different clustering and cluster validity algorithms for dna microarray data. this tool may improve the quality of the data analysis results, and may support the prediction of the number of relevant clusters in the microarray datasets. this systematic evaluation approach may significantly aid genome expression analyses for knowledge discovery applications. the developed software system may be effectively used for clustering and validating not only dna microarray expression analysis applications but also other biomedical and physical data with no limitations. the program is freely available for non-profit use on request at http://www.cs.tcd.ie/nadia.bolshakova/machaon.html
java bytecode specification and verification. we propose a framework for establishing the correctness of untrusted java bytecode components w.r.t. to complex functional and/or security policies. to this end, we define a bytecode specification language (bcsl) and a weakest precondition calculus for sequential java bytecode. bcsl and the calculus are expressive enough for verifying non-trivial properties of programs, and cover most of sequential java bytecode, including exceptions, subroutines, references, object creation and method calls. our approach does not require that bytecode components are provided with their source code. nevertheless, we provide a means to compile jml annotations into bcsl annotations by defining a compiler from the java modeling language (jml) to bcsl. our compiler can be used in combination with most java compilers to produce extended class files from jml-annotated java source programs. all components, including the verification condition generator and the compiler are implemented and integrated in the java applet correctness kit (jack).
multilingual semantic elaboration in the dose platform. from the early world wide web exploitation until contemporary semantic web generation, global communication has become an essential need for many people on the internet. globalization means ease of information exchange and of resource sharing, and requires convenient ways to bridge the gap between actual cultural and linguistic barriers. this paper introduces a simple approach to multilingual semantic elaboration in the dose distributed open semantic elaboration platform. the proposed approach uses a single, language independent ontology coupled with many language specific concepts definitions and sets of lexical entities (synsets) to characterize modeled concepts. a simple experimental setup is described in order to assess the approach viability and further experimentation issues are discussed.