waashk/dblp huggingface dataset:
towards a flexible, process-oriented it architecture for an integrated healthcare network. healthcare information systems play an important role in improving healthcare quality. as providing healthcare increasingly changes from isolated treatment episodes towards a continuous medical process involving multiple healthcare professionals and institutions, there is an obvious need for an information system to support processes and span the whole healthcare network. a suitable architecture for such an information system must take into account that it has to work as an integral part of a complex socio-technical system with changing conditions and requirements. we have surveyed the core requirements of healthcare professionals and analysed the literature for known problems and information needs. we consolidated the results to define use cases for an integrated information system as communication patterns, from which general implications on the required properties of a helathcare network information system could be derived. key issues are flexibility, adaptability, robustness, integration of existing systems and standards, semantic compatibility, security and process orientation. based on these results an it architecture is being designed that is capable of addressing the requirements mostly on the basis of well-established standards and concepts.
special track on model transformation (mt 2006). we are witnessing an increasing interest in the software engineering community towards the use of models for developing software systems. shifting intellectual property and business logic from source code into models, allows organizations to focus on the important aspects of their systems, which have traditionally been blurred by the usage of standard programming languages and underlying technologies.
semantic cores for representing documents in ir. this paper deals with the use of ontologies for information retrieval. roughly, the proposed approach consists in identifying important concepts in documents using two criterions, co-occurrence and semantic relatedness and then disambiguating them via an external general purpose ontology, namely wordnet. matching the ontology and a document results in a set of scored concept-senses (nodes) with weighted links. this representation, called semantic core of a document best reveals the semantic content of the document. we regard our approach, of which the first evaluation results are encouraging, as a short but strong step toward the long term goal of intelligent indexing and semantic retrieval.
adding spice to software development: a software development approach designed for rapidly changing environments. the office of military applications and stockpile support of the office of defense programs (dp-20) within the u.s. department of energy (doe) is responsible for managing nuclear materials. over the last five years, changes at home and abroad have had a dramatic effect on dp-20. the end of the cold war and the associated treaties have shifted much of dp-20 work from nuclear weapons production to the maintenance of a shrinking stockpile. the declassification of information has required dp-20 personnel to probe into data archived for decades. (you can't declassify information without having the information available.) finally, the election of a new president has led to the restructuring of doe and severe down-sizing of dp. these changes, and many others not mentioned, have made dp-20 a rapidly changing environment.
an optimized java interpreter for connected devices and embedded systems. the java virtual machine (jvm) is usually implemented by an interpreter or just-in-time (jit) compiler. jits provide the best performance, but interpreters have a number of advantages that make them attractive, especially for embedded systems. these advantages include simplicity, portability and low memory requirements. in this paper we describe a new interpreter core for cvm, sun microsystem's jvm for connected devices and embedded systems. the interpreter core is portable and programmed in c. an interpreter generator is used to apply a number of optimisations automatically to the source code. experimental results show that on benchmarks that spend almost all their time in the interpreter (rather than the run time system) it is 28% to 58% faster than the original cvm interpreter, and is only 5% to 9% slower than the highly-sophisticated, hand-tuned, assembly language interpreter in sun's desktop jvm.
hybrid ontology-based matchmaking for service discovery. the paper presents an ontology-based approach to service discovery, apt to support flexible and efficient matchmaking between service descriptions. we propose a hybrid approach that combines two matching strategies: a deductive strategy based on description logics with a reasoning procedure exploiting ontology knowledge to assess the type of match among services; a similarity-based strategy exploiting information retrieval metrics to measure the degree of match among services.
how to incorporate revocation status information into the trust metrics for public-key certification. in a traditional pki, the trust associated with a public key is expressed in binary either by 0 or 1. alternatively, several authors have proposed trust metrics to evaluate the confidence afforded by a public key. however their work has a static point of view and does not take into account the issue of public key revocation. in this paper, we make the first attempt to incorporate the revocation status information into the trust metrics for public key certification. to achieve our goal, we use a tailored form of a vector of trust model recently proposed. this would allow us to reason formally about when there is a need to check revocation status and how reliable the revocation mechanism should be in a given security application.
creation and management of versions in multiversion data warehouse. a data warehouse (dw) provides an information for analytical processing, decision making, and data mining tools. on the one hand, the structure and content of a data warehouse reflects a real world, i.e. data stored in a dw come from real production systems. on the other hand, a dw and its tools may be used for predicting trends and simulating a virtual business scenarios. this activity is often called the what-if analysis. traditional dw systems have static structure of their schemas and relationships between data, and therefore they are not able to support any dynamics in their structure and content. for these purposes, multiversion data warehouses seem to be very promising. in this paper we present a concept and an ongoing implementation of a multiversion data warehouse that is capable of handling changes in the structure of its schema as well as simulating alternative business scenarios.
sitelang: : edu: towards a context-driven e-learning content utilization model. current e-learning systems do not offer content customized for sophisticated learner characteristics. different learner types are supported only by means of varying presentation styles. methods for specifying learner-centered learning process are missing. for providing the right learning content in a proper context, in the right dosis and in the right moment, an e-learning system must follow the changes of learner's cognitive structures. this work presents sitelang::edu, a formal approach to specifying the learning process according to piaget's constructivistic theory. the approach allows to specify the learning process for learners with different learning styles. sitelang::edu specifications can be validated thanks to the operational semantics.
mace: lossless compression and analysis of microarray images. the ubiquity of microarray expression data in state-of-the-art biology has been well established. the widespread adoption of this technology coupled with the significant volume of image-based experimental data generated per experiment (averaging 40 mb), have led to significant challenges in storage and query-retrieval of primary data from microarray experiments. research in the yet nascent area of microarray data-compression seeks to address this problem. in this paper, we propose a conceptually novel approach that achieves significantly better lossless compression. unlike lossy compression, our algorithm is guaranteed against loss of information that may have potential biological relevance. the proposed method supports key operations such as automated grid and spot finding, histogram-based automatic thresholding for spot segmentation, and subsequent foreground and background separation. based on the proposed approach, we have developed a standardized format for storing microarray data that encapsulates all the relevant information, including both the cy3 and cy5 expression images significantly compressed. we have also developed a software application called mace (microarray compression and extraction application) to compress-decompress microarray data and generate the aforementioned format. compression-decompression results on a wide class of microarray experiments involving different spot layouts validate the effectiveness of our approach and its potential to significantly address the aforementioned challenges in storage and management of microarray data.
using genetic algorithms to find suboptimal retrieval expert combinations. a common problem of expert combination approaches in information retrieval (ir) is the selection of both, the experts to be combined and the combination function. in most studies the experts are selected from a rather small set of candidates using some heuristics. thus, only a reduced number of possible combinations is considered and other possibly better solutions are left out. in this paper we propose the use of genetic algorithms to find a suboptimal combination of experts for a document collection. our system automatically determines both, the experts to be combined and the parameters of the combination function. we test and evaluate the approach on four classical text collections. the results show that the learnt combination strategies perform better than any of the individual methods and that genetic algorithms provide a viable method to learn expert combinations.
secure mobile agent systems using java: where are we heading?. java is the predominant language for mobile agent systems, both for implementing mobile agent execution environments and for writing mobile agent applications. this is due to inherent support for code mobility by means of dynamic class loading and separable class name spaces, as well as a number of security properties, such as language safety and access control by means of stack introspection. however, serious questions must be raised whether java is actually up to the task of providing a secure execution environment for mobile agents. at the time of writing, it has neither resource control nor proper application separation. in this article we take an in-depth look at java as a foundation for secure mobile agent systems.
labrat lims: an extensible framework for developing laboratory information management, analysis, and bioinformatics solutions for microarrays. the biotechnology industry has long recognized the need for robust methods for tracking samples and data; however, it is only with the recent widespread adoption of genomic scale experiments that smaller academic facilities have also begun to appreciate the value of laboratory information management systems (lims) for use in tracking samples through the many procedures involved, including automated data collection and analysis. we have designed an extensible lims database backend collectively called labrat lims. the labrat lims database is an extremely flexible reference schema for implementing a generic lims system. additionally, we have created two front-end implementations for the labrat lims database: labrat lims web interface and microarray data portal for use in sample tracking and microarray data analysis, respectively. although designed primarily for microarray sample tracking and analysis, we believe that the flexibility of generic data management and multiple front-end interface architecture make labrat lims an extremely robust lims architecture. here we present the schema and implementation of this system.
web services for e-commerce: guaranteeing security access and quality of service. being e-commerce one of the most critical internet application, it is fundamental to employ technologies which guarantee not only secure transactions but also an adequate quality of service. in this paper we present a solution to this problem based on an extension of the emerging web service technology. in particular we introduce a new web service discovery protocol that extends standard uddi capability by addiing: (i) the discovery of web services at run-time supporting environment re-configurations, (ii) security access control to web services and (iii) a mechanism for distributing service invocations among several web services implementing (at different efficiency levels) the same task. discovery at run-time is realized by dynamically resorting to the discovery protocol (a web service itself) every time a service is invoked, access control is obtained by employing symmetric and asymmetric keys, while the different efficiency levels of service implementations are represented via weights. the proposal is formalized by employing a coordination platform, which is a probabilistic extension of the existing wssecspaces. such a platform is based on a data space, where data can be not only protected via access control mechanisms, like in wssecspaces, but also accessed probabilistically.
proxy viewpoints model-based requirements engineering. this paper addresses the problem of the "missing requirements" in software requirement specification (srs) expressed in natural language. due to rapid changes in technology and business frequently witnessed over time, the original srs documents often experience the problems of missing, not available, and hard-to-locate requirements. one of the flaws in earlier solutions to this problem has no consideration for missing requirements from multiple viewpoints. furthermore, since such srs documents represent an incomplete domain model, manual discovery (identification and incorporation) of missing requirements is highly labor intensive and error-prone. consequently, deriving and improving an efficient adaptation of srs changes remain a complex problem. in this paper, we present a new methodology entitled "proxy viewpoints model-based requirements discovery (pvrd)". through the requirements discovery and analysis process, pvrd methodology provides ways to construct proxy viewpoints model from legacy status requirements. requirements term expansion technique facilitates the retrieval process of requirements of interest based on the improved requirements representation space in proxy viewpoints model. the pvrd methodology provides an integrated environment that supports requirements discovery process as well as efficient management.
soft constraint propagation and solving in chrs. soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are combined according to combinators which express the desired optimization criteria. constraint handling rules (chrs) constitute a high-level natural formalism to specify constraint solvers and propagation algorithms. in this paper we present a framework to design and specify soft constraint solvers by using chrs. in this way, we extend the range of applicability of chrs to soft constraints rather than just classical ones, and we provide a straightforward implementation for soft constraint solvers.
editorial message: special track on e-commerce technologies. the past few years have seen an exponential growth and dramatic changes in the field of e-commerce. the focus of this track is on novel applications for e-commerce, i.e., application that survived the dot-com crash in 2000 and that hold new promises for rapidly evolving electronic markets. a few years ago, e-commerce applications were focused primarily on handling transactions and managing catalogs. business requirements, however, are evolving beyond transaction support to include content management, mobile and pervasive computing, privacy and personalization, interoperability and integration. the track focuses on technologies currently employed in creating offerings, the latest developments in the electronic marketplace, on computational and deployment issues, architectural support, policies, and advanced solutions and practices. the track is intended to address the current needs of both researchers and practitioners, and to identify significant research challenges that will most beneficially impact the future use of e-commerce applications. the objective of the track is to provide a high quality forum for presentation and exchange of research results, ideas, and practical experiences among applied computer scientists and application developers working in the field of e-commerce. it also aims at bringing together academic and industrial researchers from various fields to discuss current challenges to e-commerce. it is our hope and expectation that the track is useful to the e-commerce research and development community and will help in finding promising future directions. as chairs we feel strongly that e-commerce will continue to be one of the most exciting fields in modern science.
modeling and detecting the cascade vulnerability problem using soft constraints. establishing network security is based not just on the security of its component systems but also on how they are configured to interoperate. in this paper we consider how soft constraints provide an approach to detecting the cascade vulnerability problem: whether system interoperation provides circuitous or cascading routes across the network that increase the risk of violation of multilevel security. taking the constraints approach means that we are building on techniques that have proven success in solving large-scale problems from other domains.
editorial message: special track on e-commerce technologies. the past few years have seen an exponential growth and dramatic changes in the field of e-commerce technologies. the focus of this track is on novel applications for e-commerce, i.e., applications that survived the dot-com crash in 2000 and that hold new promises for rapidly evolving electronic markets. a few years ago, e-commerce applications were focused primarily on handling transactions and managing catalogs. business requirements, however, are evolving beyond transaction support to include content management, mobile and pervasive computing, privacy and personalization, interoperability and integration. the track focuses on technologies currently employed in creating offerings, the latest developments in the electronic marketplace, on computational and deployment issues, architectural support, policies, and advanced solutions and practices. the track is intended to address the current needs of both researchers and practitioners, and to identify significant research challenges that will most beneficially impact the future use of e-commerce applications. the objective of the track is to provide a high quality forum for presentation and exchange of research results, ideas, and practical experiences among applied computer scientists and application developers working in the field of e-commerce. it also aims at bringing together academic and industrial researchers from various fields to discuss current challenges to e-commerce. it is our hope and expectation that the track is useful to the e-commerce research and development community and will help in finding promising future directions. as chairs we feel strongly that e-commerce will continue to be one of the most exciting fields in modem science.
editorial: special track on constraint solving and programming. constraints have emerged as the basis of a representational and computational paradigm that draws from many disciplines and can be brought to bear on many problem domains. given the increasing importance of the research field of constraints, organizing a special track dedicated to the topic was an ideal opportunity to showcase research from the field at acm sac-2005.
special track editorial: constraint solving and programming. constraints have emerged as the basis of a representational and computational paradigm that draws from many disciplines and can be brought to bear on many problem domains. given the increasing importance of the research field of constraints, organising a special track dedicated to the topic was an ideal opportunity to showcase research from the field at acm sac-2006.
a conceptual framework for testing biometric algorithms within operating systems' authentication. this paper presents a conceptual framework for testing the implementation of biometric algorithms within unix and windows nt/2000 operating systems' login authentication. to support the analysis and evaluation of biometric algorithms, a data logging module will be used, enabling the collection of quantitative data, e.g. timestamps, biometric raw data, (pre)processed data, and return codes from each run of a biometric authentication. it is shown how biometric algorithms and a data logging module can be integrated into unix and windows nt/2000. in addition to the explained system components a human observer is necessary to collect extended data like user behavior and environmental conditions, which cannot be automatically recorded by the data logging module. from the combination of these two types of data, conclusions on the biometric algorithm in the context of its implementation in operating systems' authentication can be drawn. the resulting benefits for the development of appropriate biometric algorithms concerning aspects of robustness (security, safety), performance measures and usability will be discussed for iris-biometrics.
issues in augmenting image databases to improve processing content-based similarity searches. many current multimedia database management systems perform content-based retrieval of images by extracting a set of features from each data object inserted into the underlying database. this allows users to search the database for images that are similar to an input query image where the similarity is determined by comparing the previously extracted features. thus, the ability of the system to compare images depends upon the features it can extract from them. this also means that the system may fail to correctly match one of its stored images to the query image if their corresponding features do not sufficiently match. one approach to minimize the occurrences of these situations is to add modified versions of the stored image to the database and attempt to match the query image to any one of them. this paper discusses the advantages and applicability of this approach.
an architecture to support distributed data retrieval in specialized formats. raw data and processed information are essential to the development of software simulation systems used in the analysis of various application domains. in such domains, the dissemination and management of this information is a daunting task. this paper discusses software architectural and specification-driven approaches to data retrieval in custom formats. simulation developers use xml-based specification to request database results in any format.