waashk/dblp huggingface dataset:
editorial message: special track on ubiquitous computing. ubiquitous computing places humans in the center of environments saturated with computing and wireless communications capabilities, yet gracefully integrated, so that technology recedes in the background of everyday activities. the ubiquitous computing world then, is a world largely defined by applications. but such applications present an altogether new set of requirements. the special track on ubiquitous computing applications, first introduced in acm sac 2004, provides a forum for the discussion of all types of ubiquitous computing applications and related specialized infrastructures built for the deployment of targeted applications. individual papers place applications within their use context and introduce novel and appropriate interaction paradigms while at the same time addressing related technical and business aspects and consequently identify novel opportunities or constraints.
mining and analyzing the topological structure of protein-protein interaction networks. we report a comprehensive evaluation of the topological structure of protein-protein interaction (ppi) networks by mining and analyzing graphs constructed from the publicly available popular data sets to the bioinformatics research community. we compare the topology of these networks across different species, at different confidence levels, and from different experimental systems. our results confirm the well-accepted claim that the degree distribution follows a power law. however, further statistical analysis shows that the residues are not independent on the fit values, indicating that the power law model may be inadequate. our results also show that the dependence of the average clustering coefficient on the vertices degree is far from a power law, contradicting many published results. for the first time, we report that the average vertex density exhibits a strong power law dependence on the vertices degree for all the networks studied, regardless of species, confidence levels, and experimental systems.
access-controlled resource discovery for pervasive networks. networks of the future will be characterized by a variety of computational devices that display a level of dynamism not seen in traditional wired networks. because of the dynamic nature of these networks, resource discovery is one of the fundamental problems that must be faced. while resource discovery systems are not a novel concept, securing these systems in an efficient and scalable way is challenging. this paper describes the design and implementation of an architecture for access-controlled resource discovery. this system achieves this goal by integrating access control with the intentional naming system (ins), a resource discovery and service location system. the integration is scalable, efficient, and fits well within a proxy-based security framework designed for dynamic networks. we provide performance experiments that show how our solution outperforms existing schemes. the result is a system that provides secure, access-controlled resource discovery that can scale to large numbers of resources and users.
the user as social actor: a focus on systems development methodology enactment. this paper provides an innovative example for understanding systems development method (sdm) enactment by conceptualizing the it worker as a social actor and method user. the paper shows how it workers can be seen as acting in constrained ways, rather than as simple "users" of the sdm; and secondly shows the potential contribution of social actor theory.
concurrent and distributed programming using constraint logic programs. we describe a coordination language for high-level distributed programming. its roots are in concurrent constraint programming where there is a shared constraint store and synchronization is achieved via constraint entailment. a system is modeled as: (a) a set of processes, and (b) a set of constraints which capture the concurrent behavior of the system. the key advantages are that (1) there is a clear separation of the concurrency and the functionality aspects of the system, (2) processes are coordinated explicitly by a declarative formalism, i.e. constraints, and (3) the processes-agents are programming language independent.
pumas: a framework based on ubiquitous agents for accessing web information systems through mobile devices. in this paper, we describe pumas [3], a framework based on ubiquitous agents for accessing web information systems (wis) through mobile devices (md). the objective of pumas is to adapt the information delivered to a nomadic user (who often changes her/his location) according to her/his preferences, intentions and history in the system and, to the limited capacities of her/his md. we use some auml (agent unified modelling language) [11] diagrams for representing the messages exchange between the agents and the pumas components.
information retrieval and spelling correction: an inquiry into lexical disambiguation. in a preliminary study, we show the effect of spelling errors on an ad hoc information retrieval task. then, we report on the comparison of different strategies for correcting spelling errors resulting in non-existent words. unlike interactive spelling checkers, where usually only the left context is available, the system we developed takes advantage of the entire context surrounding misspelling. moreover, unlike traditional systems, based exclusively on a string-to-string edit distance and a word language model, we explore the use of the part-of-speech for selecting candidates. in conclusion, we show that spelling correction improves by extending the context. the best results are obtained when combining a part-of-speech filter with a word language model, and using both the left and right adjacent contexts.
frequent free tree discovery in graph data. in recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. in this paper, we are investigating the middle ground between these two extremes: mining free (that is, unrooted) trees in graph data. the motivation for this is the need to upgrade linear path patterns, while avoiding complexity issues with subgraph patterns. starting from such complexity considerations, we are defining free trees and their canonical form, before we present freetreeminer, an algorithm making efficient use of this canonical form during search. experiments with two datasets from the national cancer institute's developmental therapeutics program (dtp), anti-hiv and anti-cancer screening data, are reported.
websogo: a global ontology for describing web sources. based on the limitations raised by existing approaches in the context of the semantic web, we propose a formalism, web sources global ontology (websogo), a data meta-model for the description of web sources in terms of content, query-processing capabilities, service and navigation information. websogo is formalized in the object-oriented paradigm using the unified modeling language (uml). we also describe websogo-s, a multi-layered system that will allow agents to discover, execute and compose web sources through queries against a websogo catalog of source ontologies. the uml specification of websogo has been mapped to the object-relational (or) model in oracle; we define an oracle cartridge with a list of types and methods that allow the specification of sql queries against the websogo catalog. by using the jdbc and odbc drivers provided by oracle, any agent or application will be able to contact websogo-s.
interactive mobile 3d graphics for on-the-go visualization and walkthroughs. developing interactive 3d graphics for mobile java applications is now a reality. recently, the mobile 3d graphics (m3g) api (also known as jsr-184) was proposed to provide an efficient 3d graphics environment suitable for the j2me platform. however, new services and applications using interactive 3d graphics, which have already achieved reasonable standards on the desktop, do not exist for resource-constrained handheld devices yet. in this work, a generic architecture for visualizing and navigating through 3d worlds in a mobile setting was designed and implemented. in particular, a 3d virtual tour application was developed based on the proposed architecture, where multiple mobile clients using m3g navigate through and interact with each other in a shared 3d space.
efficient processing of past-future spatiotemporal queries. spatiotemporal databases emerge as an evolving scientific field due to a great variety of applications, tracking mobile objects being one of them. for this purpose, a number of methods have been proposed to efficiently organize and index moving objects and answer spatiotemporal queries. the majority of all these methods are addressing either the past or the future movement of the moving objects. up until now, addressing both the past and the future movement of the objects in an integrated manner has rarely appeared in the literature. in the current paper, based on a spatiotemporal access method, the xbr-tree, we propose algorithms for the efficient processing of spatiotemporal window (past) and timestamp (past, present and future) queries. moreover, we experimentally study the efficiency of processing these queries based on the xbr-tree against using an existing structure, the rppf-tree.
analysis of the set e-commerce protocol using a true concurrency process algebra. a formal specification of the purchase phase in the set protocol (secure electronic transaction), an e-commerce protocol by visa and mastercard, is presented. it is modelled by means of a true concurrency timed process algebra called btc which takes into account that the (limited amount of) available resources in a system have to be shared by all the processes. we have considered heterogeneous resources and we extend the algebra with the intention of representing the actions which use the shared resources and how many resources of each type the system has at its disposal.
finding saddle points using stability boundaries. the task of finding saddle points on potential energy surfaces plays a crucial role in understanding the dynamics of a micro-molecule as well as in studying the folding pathways of macro-molecules like proteins. this paper primarily focusses on computing saddle points on potential energy surfaces. a stability boundary based approach that explores the dynamic and geometric characteristics of stability boundaries of a nonlinear dynamical system has been used to compute saddle points. a novel ray-adjustment procedure is used to trace the stability boundary. a simpler version of the algorithm has also been used to find the saddle points of symmetric systems. our approach was also successful in finding saddle points on higher dimensional energy surfaces.
an approach for adaptable learning systems with respect to psychological aspects. content delivered by multimedia-rich learning courses supported by passive media such as videos are not appropriate to guide students until the end of a learning course. research identified the necessity to make learning systems more user-centric in order to prevent frustration and drop outs of students. for this, the presented approach integrates psychological factors in an adaptable learning system which is based on meta data enriched learning objects. an adaptation framework is introduced to show the interaction of the discussed concepts to fulfill the request for individualized learning systems.
survey of semantic annotation platforms. the realization of the semantic web requires the widespread availability of semantic annotations for existing and new documents on the web. semantic annotations are to tag ontology class instance data and map it into ontology classes. the fully automatic creation of semantic annotations is an unsolved problem. instead, current systems focus on the semi-automatic creation of annotations. the semantic web also requires facilities for the storage of annotations and ontologies, user interfaces, access apis, and other features to fully support annotation usage. this paper examines current semantic web annotation platforms that provide annotation and related services, and reviews their architecture, approaches and performance.
towards the prioritization of regression test suites with data flow information. regression test prioritization techniques re-order the execution of a test suite in an attempt to ensure that defects are revealed earlier in the test execution phase. in prior work, test suites were prioritized with respect to their ability to satisfy control flow-based and mutation-based test adequacy criteria. in this paper, we propose an approach to regression test prioritization that leverages the all-dus test adequacy criterion that focuses on the definition and use of variables within the program under test. our prioritization scheme is motivated by empirical studies that have shown that (i) tests fulfilling the all-dus test adequacy criteria are more likely to reveal defects than those that meet the control flow-based criteria, (ii) there is an unclear relationship between all-dus and mutation-based criteria, and (iii) mutation-based testing is significantly more expensive than testing that relies upon all-dus.in support of our prioritization technique, we provide a formal statement of the algorithms and equations that we use to instrument the program under test, perform test suite coverage monitoring, and calculate test adequacy. furthermore, we examine the architecture of a tool that implements our novel prioritization scheme and facilitates experimentation. the use of this tool in a preliminary experimental evaluation indicates that, for three case study applications, our prioritization can be performed with acceptable time and space overheads. finally, these experiments also demonstrate that the prioritized test suite can have an improved potential to identify defects earlier during the process of test execution.
biochain: lexical chaining methods for biomedical text summarization. lexical chaining is a technique for identifying semantically-related terms in text. we propose concept chaining to link semantically-related concepts within biomedical text together. the resulting concept chains are then used to identify candidate sentences useful for extraction. the extracted sentences are used to produce a summary of the biomedical text. the concept chaining process is adapted from existing lexical chaining approaches, which focus on chaining semantically-related terms, rather than semantically-related concepts. the unified medical language system (umls) metathesaurus and semantic network are used as semantic resources. the umls metamap transfer tool is used to perform text-to-concept mapping. the goal is to propose concept chaining and develop a novel concept chaining system for the biomedical domain using umls lexicon and the ideas of lexical chaining. the resulting concept chains from the full-text are evaluated against the concepts of a human summary (the paper's abstract). precision is measured at 0.90 and recall at 0.92. the resulting concept chains are used to summarize the text. we also evaluate generated summaries using existing summarization systems using sentence matching, and confirm the generated summaries are useful to a domain expert. our results show that the proposed concept chaining is a promising methodology for biomedical text summarization.
a formal logic-based language and an automated verification tool for computer forensic investigation. in this paper, a formal logic-based language, called s-tla+, is proposed for computer forensic investigation. it allows an unambiguous description of evidences, a modeling of the forensic expert knowledge in the form of hacking scenarios fragments, and a reasoning capability with uncertainty by filling in potential lack of data with hypotheses. the proposal is complemented by an automated formal verification tool, called s-tlc which helps exploring additional evidences and checks whether there are plausible hacking scenarios that meet the available evidences.
service interface: a new abstraction for implementing and composing protocols. in this paper we compare two approaches to the design of protocol frameworks -- tools for implementing modular network protocols. the most common approach uses events as the main abstraction for a local interaction between protocol modules. we argue that an alternative approach, that is based on service abstraction, is more suitable for expressing modular protocols. it also facilitates advanced features in the design of protocols, such as dynamic update of distributed protocols. we then describe an experimental implementation of a service-based protocol framework in java.
honeynet based distributed adaptive network forensics and active real time investigation. network forensics and honeynet systems have the same features of collecting information about the computer misuses. honeynet system can lure attackers and gain information about new types of intrusions. network forensics system can analysis and reconstruct the attack behaviors. these two systems integrating together can help to build an active self-learning and response system to profile the intrusion behavior features and investigate the attack original source. in this paper, we present a design of honeynet based active network intrusion response system. the features of our system are distributed adaptive network forensics and active real time network investigation.
multimedia and visualization track. the multimedia and visualization (mmv) track has been a popular track because of its appeal for the current trends in daily life applications. visualization is the key to comprehending the continuously changing complex phenomena around us. multimedia combines information from local and remote sources. the users may view this information on on_demand basis. there are many issues associated with this: data manipulation, display, motion, security etc. this track attracts investigators from pure research to applications in wide variety of areas. some of the papers included were: video indexing, visualization techniques for data mining and surface modeling, video on demand, security.
web metasearch: rank vs. score based rank aggregation methods. given a set of rankings, the task of ranking fusion is the problem of combining these lists in such a way to optimize the performance of the combination. the ranking fusion problem is encountered in many situations and, e.g., metasearch is a prominent one. it deals with the problem of combining the result lists returned by multiple search engines in response to a given query, where each item in a result list is ordered with respect to a search engine and a relevance score. several ranking fusion methods have been proposed in the literature. they can be classified based on whether: (i) they rely on the rank; (ii) they rely on the score; and (iii) they require training data or not. our paper will make the following contributions: (i) we will report experimental results for the markov chain rank based methods, for which no large experimental tests have yet been made; (ii) while it is believed that the rank based method, named borda count, is competitive with score based methods, we will show that this is not true for metasearch; and (iii) we will show that markov chain based methods compete with score based methods. this is especially important in the context of metasearch as scores are usually not available from the search engines.
automatic structured query transformation over distributed digital libraries. structured data and complex schemas are becoming the main way to represent the information many digital libraries provide, thus impacting the services they offer. when searching information among distributed digital libraries with heterogeneous schemas, the structured query with a given schema (the global or target schema) has to be transformed into a query over the schema of the digital library it will be submitted to (the source schema). schema mappings define the rules for this query transformation. schema matching is the problem of learning these mappings.in this paper we address the issue of automatically learning these mappings and transforming a structured query over the target schema into a new structured query over the source schema. we propose a simple and effective schema matching method based on the well known cori selection algorithm and two ways of applying it. by evaluating the effectiveness of the obtained structured queries we show that the method works well in accessing distributed, heterogeneous digital libraries.
from spontaneous total order to uniform total order: different degrees of optimistic delivery. a total order protocol is a fundamental building block in the construction of distributed fault-tolerant applications. unfortunately, the implementation of such a primitive can be expensive both in terms of communication steps and of number of messages exchanged. this problem is exacerbated in large-scale systems, where the performance of the algorithm may be limited by the presence of high-latency links.optimistic total order protocols have been proposed to alleviate this problem. however, different optimistic protocols offer quite distinct services. this paper makes an overview of different optimistic approaches and shows how they can be combined in a single adaptive protocol.
implementing fuzzy expert system for intelligent buildings. in this paper we present the design of an intelligent dome, as well as the design and implementation of the fuzzy expert system for the module controlling ventilation and air conditioning. the system was designed as a client/server, blackboard architecture, implemented in fuzzyclips, and intensively tested under different conditions. we describe here all the design and implementation stages as well as some of the results obtained.
does object coupling really affect the understanding and modifying of ocl expressions? early and precise models started to play an increasingly relevant role since models themselves become the primary focus in recent initiatives of model-driven engineering (such as model-driven development and model-driven architecture). however, a precise model cannot be obtained through the use of unified modeling language (uml), due to the limited expressiveness of diagram-based uml notation. a textual add-on to the uml diagrams is needed, such as the object constraint language (ocl), for reaching complete and consistent models and avoiding underspecification. aware of the proliferation of measures for uml-based models and the lack of measures to capture the quality aspects of uml/ocl combined models we defined a set of measures for measuring the structural properties of ocl expressions. this paper carefully describes an experiment we have conducted to confirm the conclusions and strengthen the external validity of a previous family of experiments, with the purpose of investigating the relationship between object coupling in ocl expressions and the understandability and modifiability of ocl expressions. empirical evidence that such a relationship exists is reaffirmed and consolidated.