waashk/dblp huggingface dataset:
doxels in context for retrieval: from structure to neighbours. we propose in this paper a new way of considering retrieval of structured documents, by exploiting non-structural relations between structured document elements (doxels). these relations may be defined by human beings (e.g. by the authors of the documents for navigation or reference purposes), but may also be created by the information retrieval system (e.g. using knn). unlike pagerank or hits that separate features link and content features, we integrate these two aspects by defining a relative specificity and a relative exhaustivity between doxels. we use these features, as well as the doxel content, in a comprehensive matching process. one concern here is to facilitate the exploration of the result space by selecting the relevant doxels, and by indicating potential good neighbours to access from one doxel. results of experiments on the inex2005 test collection are presented.
enhancing web service selection by qos-based ontology and ws-policy. the service oriented architecture enables the development of flexible large scale-applications in open environments by dynamically combining web services. nevertheless, current techniques fail to address the problem of selecting adequate services to meet service consumer needs. service selection must take into account non-functional parameters especially the quality of service (qos). in this work we propose a web service selection approach based on qos attributes. we extend the ws-policy to represent qos policies. we apply ontological concepts to ws-policy in order to enable semantic matching. publishing qos policies is also examined in this work. we propose to extend the uddi register to handle qos-based policies.
a biologically inspired generation of virtual characters. a number of techniques for generating geometric models of human head and body are in use nowadays. models of human characters are useful in computer games, virtual reality, and many other applications. the complexities involved in generating such models, however, impose heavy limitations on the variety of characters produced. in this paper, diploid reproduction is mimicked to produce an unlimited number of character models, which inherit traits from two parent models. the meshes of all models are constructed based on control parameters that are distributed as genes among a group of chromosomes. thus, the technique consists of distributing pre-selected characteristics, represented as control parameters, over a pre-determined number of chromosome pairs for both parents; followed by a simulated generation of the father's and the mother's gametes; which are randomly combined in a simulated fecundation. the diversity is ensured in four random processes: the random exchange of segments during crossover; the random alignment of homologous chromosomes at metaphases i and ii of meiosis; and the random union of male and female gametes during fecundation.
decision-making coordination in collaborative product configuration. in software product lines (spls), product configuration is a decision-making process in which a group of stakeholders choose features for a product. unfortunately, current configuration technology is essentially single-user-based in which user requirements are interpreted and translated into configuration decisions by a single role commonly referred to as the product manager. this process can be error-prone and time-consuming as it commonly requires back-and-forth interactions between the product manager and the stakeholders to cope with decision conflicts. in this paper, we propose an approach to collaborative product configuration (cpc) that aims at providing effective support for coordinating teamwork decision-making in the context of product configuration. the approach builds on well-known concepts in the spl arena such as feature models. the contributions of the paper include the cpc approach and the illustration of its application in a real-world product line.
integrating goal modeling and execution in adaptive complex enterprises. complex enterprises consistently struggle with successfully gaining benefits from enterprise architecture (ea) initiatives for a variety of reasons, one of them being an end-to-end integration between enterprise goals and operations that links goals to the dynamic operations of the organization. in this paper we describe (a) our conceptualization of the adaptive complex enterprise (b) our integrative notation and semantics for goal modeling and linking for such organizations and their operations and (c) an example drawn from an embedded industry project.
track on advances in spatial and image-based information systems (asiis): editorial message. in the past few years, there has been a lot of interest on spatial and image based information systems. these emerging systems and applications raise challenges in spatial data modelling, query processing and optimization and data semantics. they create the need for novel concepts for designing complex geo spatial systems. the acm sac track on advances in spatial and image-based information systems (asiis) is a forum for interdisciplinary discussions and research on various aspects of spatial and image based information systems, focusing on both theoretical research contributions and practical design solutions.
softmon: programmable software monitoring with minimum overhead by helper-threading. in practice, in-house testing is not guaranteed to detect all software errors. a plan for extensive testing is often constrained by resources like cost and time. so, the need for continuous monitoring software programs in production runs is always strong. software monitoring, however, suffers from the performance overhead of the probing techniques. unless the overhead for probing is tolerable, the code inserted for probing is typically cleaned from the released programs. in production runs, programmers can only rely on observable effects produced by the programs to examine problems. in this paper, a prototype tool called softmon is proposed to monitor a computer program with minimum overhead. softmon uses a helper thread to monitor programs on a separate cpu without inserting code in the middle of programs. the body of the helper thread is programmable in a language called mcml. by compiling the mcml script, a helper thread is instrumented into a program automatically and transparently.
knowledge-based semantic clustering. users of the web are increasingly interested in tracking the appearance of new postings rather than locating existing knowledge. coupled with this is the emergence of the web 2.0 movement (where everyone effectively publishes and subscribes), and the concept of the "internet of things". these trends bring into sharp focus the need for efficient distribution of information. however to date there has been few examples of applying ontology-based techniques to achieve this. knowledge-based networking (kbn) involves the forwarding of messages across a network based not just on the contents of the messages but also on the semantics of the associated metadata. in this paper we examine the scalability problems of such a network that would meet the needs of internet-scale semantic-based event feeds. this examination is conducted by evaluating an implemented extension to an existing pub-sub content-based networking (cbn) algorithm to support matching of notification messages to client subscription filters using ontology-based reasoning. we also demonstrate how the clustering of ontologies leads to increased efficiencies in the subscription forwarding tables used, which in turn results in increased scalability of the network.
ontology-based wom extraction service from weblogs. in this paper, we introduce a web-based service that extracts reputations of a product from the internet. if a user inputs the product name, the service first collects articles reviewing the product from weblogs, bbs, and so on. also, it analyzes their contents using metadata and ontologies with conventional nlp techniques. then, it indicates the reputations (positive or negative) from the overall and several pre-defined aspects, and other related products that are the subject of much discussion in the articles. this paper illustrates two technical points regarding use of metadata and ontologies with nlp, and summarizes evaluations in a case that we applied it to a market research for a vehicle.
a generic xml language for characterising objects to support digital preservation. the dominance of digital objects in today's information landscape has changed the way humankind creates and exchanges information. however, it has also brought an entirely new problem: the longevity of digital objects. due to the fast changes in technologies, digital documents have a short lifespan before they become obsolete. digital preservation, i.e. actions to ensure longevity of digital information, thus has become a pressing challenge. different strategies such as migration and emulation have been proposed; however, the decision between available tools for format migration is very complex. preservation planning supports decision makers in reaching accountable decisions by evaluating potential strategies against well-defined requirements. especially the evaluation of different migration tools for digital preservation has to rely on validating the converted objects and thus on an analysis of the logical structure and the content of documents. this paper presents the extensible characterisation languages (xcl) that support the automatic validation of document conversions and the evaluation of migration quality by hierarchically decomposing a document and representing documents from different sources in an abstract xml language. we present the context of the development of these languages and tools and describe the overall concept and features of the languages and how they can be applied to the evaluation of digital preservation solutions.
accessing and aggregating legacy data sources for healthcare research, delivery and training. the aggregation of data from disparate sources offers clear benefits for healthcare researchers and practitioners. such aggregation, however, must satisfy ethical, legal and social requirements: data ownership must be respected; patient privacy must not be compromised; data storage and transfer must be secure; etc. in this paper we describe the query aspects of sif (for service-oriented interoperability framework), a system which has been developed to support healthcare-related applications that depend upon the secure aggregation of data from multiple legacy databases. importantly, the system allows the federation of data stored in varying database management systems utilising varying schemas.
automatic feedback, control-based, stress and load testing. stress and load testing are of special interest to many segments of the software industry. however, existing approaches present limitations with respect to automation and applicability. while some approaches present an automated solution, they lack in terms of applicability. a fully automated approach with high applicability is proposed here. the approach is based on the use of a pid controller to automatically drive the inputs and to achieve a pre-specified level of stress/load for resources of interest. the approach also allows for automatic identification of inputs impacting the resources. an experiment along with multiple simulation runs are presented as an indication of the applicability and accuracy of the proposed approach.
dynamic configuration of application-specific implicit instructions for embedded pipelined processors. in this paper, we propose the dynamic configuration of application specific implicit instructions for pipelined processors to better exploit the available parallelism at instruction level. given the target application, the compiler selects a set of candidate instructions to be implicitly executed - i.e. their execution is controlled through a data-driven model, which avoids explicit instruction fetch. consequently, the clock cycles usually required for the explicit issues are saved, thus improving the performance and reducing the code size. the compiler generates the reconfiguration operations to properly setup the data-path. the processor pipeline has been optimized to support the parallel execution of implicitly issued instructions, requiring a limited hardware overhead. the proposed technique has a negligible impact on the processor isa - only reconfiguration instructions are added - which also benefits the compiler development times, since the optimization can be almost seamlessly added to an existing compilation tool-chain. the proposed approach has been applied to dsp and multimedia kernel loops, comparing its performance with those of two different baseline architectures: a scalar mips processor and a 4-issue vliw processor of the lx family provided by stmicroelectronics [5]. experimental results show a speedup ranging from 10 to 35%, and an average code size reduction of 19%.
umltrust: towards developing trust-aware software. as users in software systems depend on each other for achieving goals, performing tasks, and utilizing resources, the trust relationships in the systems need to be considered to identify the opportunities and vulnerabilities these relationships bring. however, the problem with specifying a trust relationship is that there is no precise and a priori criteria to be satisfied. the main objective of this work is towards incorporating trust from the very beginning of a software development process. a framework is presented for specifying trust scenarios using an extension of unified modeling language (uml) called umltrust (uml for trust scenarios). a trust scenario combines interested parties based on a context and thus helps in building a trust relationship. suitable trust rules can be generated from the trust scenarios to monitor the trustworthiness of specific trust relationships. in this way, we can avoid conflicting, ambiguous, and redundant trust requirements in a software development life cycle (sdlc). the applicability of the approach has been illustrated using examples from file sharing applications.
synchronization of strongly pulse-coupled oscillators with refractory periods and random medium access. the weakly pulse-coupled oscillator framework has proven to be a valuable resource for the development of peer-to-peer synchronization algorithms [9]. but leveraging it in a practical implementation (e.g. in wireless ad hoc/sensor networks) is problematic due to the difficulty in achieving precise coordination of broadcast messages. we found that a pseudo-random medium access control (mac) protocol produces a super-linear increase in the number of messages required per node with increasing network size, which would normally discourage its use. however, introducing a "refractory period" reduces this growth to linear with a small constant (verified by numerical simulations). furthermore, the refractory period allows for an increase in the coupling constant, effectively making the network "strongly" pulse-coupled. we show that the combination of the refractory period, strong coupling, and probabilistic medium access results in a significant decrease in the average number of messages required per node in several practical network topologies (and as much as ~ 90% over the original idealistic mechanism in line topologies).
a pattern to design crosscutting frameworks. a pattern that can be used to design aspect-oriented frameworks that require data from a base code is presented. the framework design is explicitly separated into two parts when this pattern is used: one dealing with the composition mechanisms and another dealing with the functional variabilities. regarding the composition part, there are several com alternatives facilitating the coupling to an existing base code as well as increasing the reuse levels. the functional part can be designed using classical object oriented patterns. the reuse process of the framework is also facilitated because the application and domain engineer can deal with both composition and functional parts separately.
pattern ranking for semi-automatic ontology construction. when developing semantic applications, the construction of ontologies is a crucial part. we are developing a semiautomatic ontology construction approach, ontocase, relying on ontology patterns as additional resources. a crucial part of this approach is how to select the appropriate patterns based on the input representation extracted from a text corpus. in this paper, we suggest a pattern ranking and selection approach with the ability to partially bridge the gap between abstract patterns and specific terms, as well as being specifically tuned to the characteristics of ontology patterns. compared to existing ontology ranking schemes our approach adds indirect matching of terms as well as relation matching. an initial experiment indicates that ontocase ranking performs better, especially when ranking small and abstract patterns, than existing ranking approaches.
encephalic nmr image analysis by textural interpretation. the novel technologies used in different application domains allow to obtain digital images with a high complex informative content. these meaningful information are expressed by textural skin that covers the objects represented inside the images. the textural information can be exploited to interpret the semantic meaning of the images themselves. this paper provides a mathematical characterization, based on texture analysis, of the basic objects contained in the layout of the nmr encephalic images (cerebral tissue, rest of skull, eventual abnormal mass, and background). by this characterization a prototype has been developed, which has allowed the achievement of three different targets: segmentation of the image layout in basic objects, identification of the eventual abnormal masses, characterization of the morphologic structures of the cerebral tissue.
the tale of the weather worm. how humans behave when faced with a disaster, natural or man-made, can be exploited automatically by news-aware malicious software. we introduce weather worms, worms that can automatically identify abnormal events and their location, and target computers at that physical location. such worms could be used to take advantage of poorly-defended computers in a disaster zone, and could amplify the effects of a physical attack. defenses against weather worms require examination of policy and presentation of information on the internet.
model and infrastructure for decentralized workflow enactment. today, enactment of web service flows -- the process of evaluating control flow and executing activities a workflow is composed of -- is typically done by a centralized workflow enactment service as part of a workflow management system. this exhibits a number of drawbacks with regard to process adaptability and process fragmentation among a number of participating partners. in order to overcome the deficiencies of centralized process navigation, we propose a model for flexible and adaptable distributed processes as orchestrations of a set of self-coordinating components, without the need for central coordination. furthermore, we provide key characteristics and an architecture for the development of a supporting infrastructure that facilitates both, deployment and management of distributed components as well as decentralized workflow enactment.
pentagons: a weakly relational abstract domain for the efficient validation of array accesses. we introduce pentagons (pntg), a weakly relational numerical abstract domain useful for the validation of array accesses in byte-code and intermediate languages (il). this abstract domain captures properties of the form of x &epsilon; [a, b]&and;x < y. it is more precise than the well known interval domain, but it is less precise than the octagon domain. the goal of pntg is to be a lightweight numerical domain useful for adaptive static analysis, where pntg is used to quickly prove the safety of most array accesses, restricting the use of more precise (but also more expensive) domains to only a small fraction of the code. we implemented the pntg abstract domain in clousot, a generic abstract interpreter for .net assemblies. using it, we were able to validate 83% of array accesses in the core runtime library mscorlib.dll in less than 8 minutes.
a formal architectural model for exception handling coordination. architectures based on coordinated atomic action (ca action) concepts have been used to build concurrent fault-tolerant systems. this conceptual model combines concurrent exception handling with action nesting to provide a general mechanism for both enclosing interactions among system components and coordinating forward error recovery measures. this paper proposes an architectural model to guide the formal specification of concurrent fault-tolerant systems. this architecture provides built-in csp (communicating sequential process) processes and predefined channels to coordinate exception handling of the user-defined components. as a result, a formal and general architecture supporting software fault-tolerance are ready to be used.
towards a model-driven engineering approach for developing embedded hard real-time software. model-driven engineering (mde) has been advocated as an effective way to deal with today's software complexity. mde can be seen as an integrative approach combining existing techniques such as domain-specific modeling languages (dsml) and transformation engines. this paper presents the ezrealtime, an mde-based tool that relies on the time petri net (tpn) formalism and defines a dsml to provide an easy-to-use environment for specifying embedded hard real-time (ehrt) system and for synthesizing timely and predictable scheduled c code. the ezrealtime adopts the universal xml-based transfer syntax for petri nets, named as pnml. the main idea of this work is to propose a generative programming method and tool to boost code quality and improve developer productivity with automated software synthesis. the ezrealtime tool reads and automatically translates the specification to a time petri net model through composition of building blocks with the purpose of providing a complete model of all tasks in the system. therefore, this model is used to find a feasible schedule by applying a depth-first search algorithm. finally, the scheduled code is generated by traversing the feasible schedule, and replacing transition's instances by the respective code segments. we also present the application of the proposed method in a case study.
aggregate similarity queries in relevance feedback methods for content-based image retrieval. content-based image retrieval techniques rely on automatic features extracted from images to process similarity queries. usually low-level features are extracted, and when they are used to compare images stored in a database to a reference image (through single center selection queries), they often lack the ability to convey to the users what they understand as similarity. to deal with the gap between what the user expects and what the system can automatically provide, relevance feedback techniques have been employed. in this paper we present a generalization of the single center similarity queries over data in metric spaces, taking into account both range and k-nearest neighbors. allowing a query to include multiple query centers, it straightforwardly attends the relevance feedback requirements. thus, we analyze how well our new approach contribute to relevance feedback methods for content-based image retrieval.