waashk/dblp huggingface dataset:
the architecture and design of a malleable object-oriented prolog engine. the implementation of prolog systems has a long history, from the first interpreter written in 1972 to de facto standard model of the warren abstract machine. although many architectural variations have been proposed, object-oriented design was left mostly unexplored, favoring other factors such as execution time and memory storage optimizations. however, today complex software systems are typically built as aggregates of heterogeneous components, where logic programming may effectively help facing key issues such as intelligence of components and management of interaction. in this scenario, implementation of logic languages could just aim at reasonable - rather than maximum - efficiency, requiring instead configurable and flexible architectures to allow for extensions and tailoring for different application domains. tuprolog is an object-oriented prolog engine which has been designed to feature a malleable architecture at its core, and to exhibit the typical properties of basic components for complex dynamic systems and intelligent infrastructures---such as easy deployability, lightness, and configurability. in this paper, we first describe tuprolog's malleable architecture, composed by a set of managers controlling sensible parts of the system, and operating around a minimal interpreter shaped as a finite state machine. then, we support the malleability claim by discussing two possible architectural extension of the engine.
towards temporal web search. this paper shifts the focus of web search towards finding and exploiting small text nuggets, rather than full-length documents, assumming that the type of targeted information (e.g., date) is specified in the queries. each nugget is a document sentence fragment that encodes open-domain factual information associated to some entity. the entities are dates (e.g., 1971) when the events captured by the nuggets must have occurred. the nuggets are extracted from the unstructured text of web documents, based on lightweight text processing. since per-document time stamps are available only in restricted collections such as news articles, but not in arbitrary web documents, the extraction of the relevant dates relies on simple, local text analysis. the resulting time-stamped text nuggets have immediate applications in web search, as direct results for queries asking about the date of an event explicitly (e.g., "when was the transistor invented") or implicitly (e.g., "golden gate bridge built").
multi-purpose proactive m-artifacts. paper-based artifacts (e.g., forms, manuals, questionnaires) are used ubiquitously and pervasively to support a wide set of activities. education and health care are major examples of such endeavor. however, given the passiveness of the medium itself, several problems (e.g., communication, adjustment, lack of interactivity) are usually encountered within these activities which hinder human efficiency or prevent users from achieving desired goals. this paper presents a framework that provides common users with tools to create interactive and adjustable digital artifacts for mobile devices. the artifacts can be adjusted to the users' needs, introducing different configurations regarding their look, interaction and behavior, providing support to various purposes by coping with and enhancing different procedures. the framework has been validated through two case studies by providing support to mobile learning, and within psychotherapy, by offering means to achieve ubiquitous cognitive behavioral therapy.
learning to identify emotions in text. this paper describes experiments concerned with the automatic analysis of emotions in text. we describe the construction of a large data set annotated for six basic emotions: anger, disgust, fear, joy, sadness and surprise, and we propose and evaluate several knowledge-based and corpusbased methods for the automatic identification of these emotions in text.
an architecture of services for session management and contents adaptation in ubiquitous medical environments. advances in wireless technologies and mobile devices have made possible a wide range of efficient and powerful healthcare environments. ubiquitous computing concepts meet healthcare principles, enabling physicians to connect to and use healthcare systems almost anytime, anywhere. this paper proposes a service architecture based on a context-aware middleware, which provides session management and content adaptation for ubiquitous medicine environments. by using simple applications on top of the proposed middleware services, associated physicians join a network of services, so called uhs (ubiquitous health services) that provide ubiquitous access for its users from any point of the network, with different kinds of devices.
using the rrt algorithm to optimize classification systems for handwritten digits and letters. multi-objective genetic algorithms have been often used to optimize classification systems, but little is discussed on their computational cost to solve such problems. this paper optimizes a classification system with an annealing based approach, the record-to-record travel algorithm. results obtained are compared to those obtained with a multi-objective genetic algorithm in the same approach. experiments are performed with isolated handwritten digits and uppercase letters, demonstrating both the effectiveness and lower computational cost of the annealing based approach.
uml state machine diagram driven runtime verification of java programs for message interaction consistency. in object-oriented programs, we often need to set some restrictions on the temporal orders of the message receiving for objects, which forms a class of safety requirements. in this paper, we use uml state machine diagrams as design specifications, and present an approach to runtime verification of java programs, which is focused on the temporal order of message receiving based consistency verification between the behavior of state machine diagrams and the program execution traces. in the approach, we first instrument the program under verification so as to gather the program execution traces related to a given state machine diagram. then we drive the instrumented program by random test cases so as to generate the program execution traces. finally we check if the collected program execution traces are consistent with the behavior of the state machine diagram, which means that the temporal orders of the message receiving occurring in the program traces are consistent with the ones occurring in the state machine diagram. our approach can be used to detect not only the program bugs resulting from the wrong temporal orders of message receiving, but also the imperfect state machine models constructed in reverse engineering for legacy systems, and leads to a testing tool which may proceed in a fully automatic fashion.
a method for semantics-based conceptual expansion of ontology. for the past few years, automatic ontology construction and expansion is one of the most important research subjects in the field of knowledge engineering. compared with the traditional term frequency method, we propose a semantics-based method to extract concepts from a large corpus of text documents and expand the concepts of the known ontology based on the semantic relations between two terms. the proposed method explores how to identify the candidate concepts, and how to give suggestions to knowledge engineers on where the concepts should be inserted in a given ontology. the effectiveness of the proposed approach is demonstrated by experiments on a traditional chinese medicine text corpus.
population genetics of human copy number variations: models and simulation of their evolution along and across the genomes. population genetic models play a significant role in human genetic research, since they promise to provide a better understanding of both evolution of normal variations of the genomes as well as development of disease promoting genomic segments. in this paper, we propose and computationally simulate a model of evolution for unique and segmentally duplicated regions of human genome, which manifest in genome-wide variations in copy number. copy number variations (cnvs) are known for their possible association with genomic diseases and predisposition to various health conditions, and yet, the underlying population genetic models, needed for association studies, have remained largely undeveloped. additionally, segmentally duplicated (sd) regions of the human genome are of a specific interest, since they exhibit a complex behavior of copy number changes and are specifically known for catalyzing pathogenic and unstable genomic rearrangements. our main contribution is in suggesting mechanisms for evolution of copy number changes in regions of segmental duplication of the human genome, which is essential for association studies involving cnv markers and estimation of parameters of stochastic diffusion that determine asymptotic behavior of such evolutionary processes.
towards design patterns for ontology alignment. aligning ontologies is a crucial and tedious task. matching algorithms and tools provide support to facilitate the task of the user in defining correspondences between ontologies entities. however, automatic matching is actually limited to the detection of simple one to one correspondences to be further refined by the user. we propose in this paper the use of correspondence patterns as a tool to assist the design of ontology alignments. based on existing research on patterns in the fields of software and ontology engineering, we propose a pattern template as an helper to develop a correspondence patterns library. we give ways towards the representation of patterns using an appropriate correspondence representation formalism: the alignment ontology.
examining the motivations of defection in large-scale open systems. in large-scale open systems such as ebay one of the key concerns in increasing the utility of users is having a trustworthy method for users to determine which interactions will be satisfactory and which are liable to lead to disappointment. rather than starting from the point of assuming there are good and bad users we will examine why we can make such a distinction in this context and how humans mitigate some of the problems which seem endemic to such a system through game modification. we then demonstrate a use of this model of behaviour in simulating a particular agent choice in order to show the conditions under which different reputation systems affect an agent's trustworthiness, before briefly describing possible future directions of research to deal with the truly disenfranchised agents.
test generation and minimization with "basic" statecharts. model-based testing as a black-box testing technique has grown in importance. the models used represent the relevant features of the system under consideration (suc), and can also be used as a basis for generating test case sets. in this work we introduce a novel representation of state-charts which subsumes common features of different state-chart variants. based on this model and well-defined test criteria, efficient algorithms are introduced for generating test case sets. those test case sets are minimized to cover both the model of suc and its inversion, i.e., the complementary model.
c-saw---contextual semantic alignment of ontologies: using negative semantic reinforcement. understanding the meaning of each term in an ontology is essential for successfully integrating and aligning ontologies. much ontology integration research to date is focused on syntactic, structural and semantic matching where the actual meaning of the concepts is disregarded. the c-saw approach to ontology alignment is based on the contextualizing the concepts by using a set of semantic alignment words (c-saw). the c-saw approach is enhanced by negative semantic reinforcement (nsr), where additional semantic meaning can be added to the set of semantic alignment words, by considering words which are unrelated to the concept.
track on computer networks: editorial message. on behalf of the program committee of the track on computer networks of the 23rd annual acm symposium on applied computing (acm sac 2008), it is our great pleasure to welcome you to the acm sac 2008, held from march 16 to march 20, 2008, in fortaleza, cear&aacute;, brazil. in recent years, significant advances in computer networks have been made throughout the world. this track aims to be a forum for scientists, engineers and practitioners, in academia and industry to share new ideas, experiences and results, and to present their latest findings in any aspects of computer networks.
evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem. this paper studies the use of different population structures in a genetic algorithm (ga) applied to lot sizing and scheduling problems. the population approaches are divided into two types: single-population and multi-population. the first type has a non-structured single population. the multi-population type presents non-structured and structured populations organized in binary and ternary trees. each population approach is tested on lot sizing and scheduling problems found in soft drink companies. these problems have two interdependent levels with decisions concerning raw material storage and soft drink bottling. the challenge is to simultaneously determine the lot sizing and scheduling of raw materials in tanks and products in lines. computational results are reported allowing determining the better population structure for the set of problem instances evaluated.
a genetic algorithm for sensor deployment based on two-dimensional operators. in this paper, we propose a novel and efficient genetic algorithm to the optimal sensor placement of nodes for a wireless sensor network designed to monitor enemy vehicles in a hostile region. a notable feature of our genetic algorithm is the combination of mutation derived from physics and crossover in which heterogeneity between genes is removed by pairing nearest two-dimensional genes. making experiments by a new simulator that is developed to improve time performance of the sensor deployment simulator based on the geographic information system, we demonstrated the superiority of the proposed genetic algorithm.
a graph-based profile similarity calculation method for collaborative information retrieval. collaborative information retrieval (cir) is one of the popular social-based ir approaches. a cir system registers the previous user interactions to response to the subsequent user queries more efficiently. but cir suffers from the personalization problem because the goals and the characteristics of two users may be different; so when they send the same query to a cir system, they may be interested in two different lists of documents. we have developed a personalized cir system, called percirs, to solve this problem. selecting an efficient method to calculate the similarity between user profiles is a key factor for enhancing percirs's efficiency. in this paper, we propose a new graph-based method for user profile similarity calculation. finally, by introducing an evaluation method, we will show that this new method is more efficient than the previous methods.
dynamic support to transactional remote invocations over multiple transports. xactor is a distributed transaction manager that affords transactional remote invocations over an open-ended set of transports. its support to transactional interactions is dynamic, in the sense that the transaction manager fully exploits a collection of rmi mechanisms and transport protocols that grows with the addition of plug-in modules to running instances of xactor. a distributed transaction can employ any combination of the transports that the currently installed plug-ins provide. two-phase commit (logging and failure recovery included) runs over any such combination of transports. aimed at server-side application containers, xactor can be integrated with those systems in a way that allows its plug-in modules to take advantage of the dynamic deployment facilities of the container environment.
special track on computer security: editorial message. it is a pleasure to announce that the security track at the 2008 acm symposium on applied computing has reached its seventh year, and therefore stands amongst the tracks with the longest tradition. the program committee was enriched also this year, and as usual features passionate researchers affiliated to industrial or academic institutions in the entire world. here they are, in alphabetical order.
a farsi part-of-speech tagger based on markov model. this paper describes applying a part-of-speech (pos) tagging system on an unreported farsi corpus by using a markov model. some aspects of farsi morphology and some issues in developing a tagging system are offered. by simulation we evaluate this method on the corpus. to our knowledge, this is first time that a statistical pos tagger is applied on a farsi corpus.
a qos-oriented external scheduler. quality of service (qos) related objectives are used in many current applications, like grid-based systems and e-commerce applications. network managers, application servers and grid resource managers are examples of software that is often qos-enabled. on the other hand, database servers usually provide a best-effort model, answering each query as fast as possible. thus, they are not prepared to provide qos differentiation for incoming queries. in this work, we present an external control system for qos-oriented scheduling of database requests. our external system prioritizes queries and automatically adjusts the number of queries that are concurrently executed (degree of multi-programming) in order to achieve user-specified service level objectives (slo). there are works on external schedulers, admission control systems and on the specification of the degree of multi-programming, but most focus on best-effort models and do not consider service level objectives. our experimental results show that our approach is effective and that using a specialized scheduler for achieving slo is very important.
slack time evaluation with rtsj. we address in this paper the problem of jointly scheduling hard periodic tasks and soft aperiodic events using the real-time specification for java (rtsj). we present the programming constraints of rtsj and propose slack time evaluation and utilization algorithms which take these constraints into account. we evaluate these algorithms and compare their performances with the background scheduling (bs) through simulations.
serpentine: adaptive middleware for complex heterogeneous distributed systems. adaptation of system parameters is acknowledged as a requirement to scalable and dependable distributed systems. unfortunately, adaptation cannot be effective when provided solely by individual system components as the correct decision is often tied to the composition itself and the system as a whole. in fact, proper adaption is a cross-cutting issue: diagnostic and feedback operations must target multiple components and do it at different abstraction levels. we address this problem with the serpentine middleware platform. by relying on the industry standard jmx as a service interface, it can monitor and operate on a wide range of distributed middleware and application components. by building on a jmx-enabled osgi runtime, serpentine is able to control the life-cycle of components themselves. the scriptable stateless server and cascading architecture allow for increased dependability and flexibility.
version control in crosscutting framework-based development. crosscutting frameworks are a type of aspect-oriented framework, which includes only one crosscutting concern, such as persistence, distribution or security. this type of framework is currently being researched in-depth, however little attention has been given to the version control of these frameworks and of the applications developed with their support. version control concerning the development based on crosscutting frameworks is more complex than in traditional development. moreover, it is more complex than in the development based on traditional frameworks, which require suitable techniques to control the evolution of both the frameworks and developed applications. thus, in this paper we present guidelines and a tool which aims to control the versions of crosscutting frameworks, as well as the applications which are developed with their support.
an approach for specification construction using property-preserving refinement patterns. this paper proposes a refinement method based on a set of formal refinement patterns for software architecture design using software architecture model (sam). first, an approach for specification construction through property-preserving refinement patterns is discussed. the refinement patterns are categorized into connector refinement, component refinement and high-level petri nets refinement. then, modeling and refining a life insurance system is used to demonstrate how to applying the refinement patterns for software architecture design using sam. the results demonstrate that a refinement method is an effective way to develop a high assurance system. our result can be easily generalized to other formal methods as well.
special track on middleware engineering (me): editorial message. welcome to the middleware engineering (me) track of 23rd annual acm symposium on applied computing (acm sac 2008). research in middleware systems has evolved from simple client server models to distributed systems, peer-to-peer (p2p) systems, mobile devices, service oriented computing, grid computing, agent based computing, smart environment, and sensors network. each of the above areas in distributed computing, peer-to-peer computing, service oriented computing, grid computing, agent based computing and smart devices, and sensor networks, poses its own unique challenges in the design, development and deployment of middleware, its components and applications using such middleware. the main objective of the middleware engineering track is to bring together researchers and practitioners working in middleware systems with topics ranging from different areas from the afore mentioned areas under one roof with an aim of encouraging exchange of ideas and experiences among these diverse communities.
large-scale simulation of v2v environments. providing vehicles with enhanced ability to communicate and exchange real-time data with neighboring vehicles opens up a variety of complex challenges that can only be met by combining different research fronts such as wireless communications, information processing, self-organization protocols and collaborative optimization. the difficulty in performing real tests in this area forces the use of computer simulation. in this paper we introduce an efficient simulation framework for large scale vehicle-to-vehicle (v2v) networks in urban environments. our main contribution is a sophisticated traffic simulator, which is oriented towards simulating car-to-car communications, and relies on a global positioning server in order to convey location information for micro-simulated vehicles. to illustrate the various studies made possible by our simulation system, we provide a preliminary characterization of how the wireless transmission range in an urban-like environment affects the freshness and inter-vehicle propagation characteristics of real-time mobility information.
providing dependability for web services. web services have been widely employed to allow interoperability among applications and/or technologies. however, the standard technologies and protocols which provide the foundation for web services do not address issues such as fault tolerance and dependability of services. aiming to solve this limitation, this paper proposes a software architecture for providing dependability for web services. this architecture is responsible for increasing service availability and maintaining all replicas of a service in a consistent state, having as main characteristic the separation of these replicas in groups.