waashk/dblp huggingface dataset:
automatic learning of text-to-concept mappings exploiting wordnet-like lexical networks. a great jump towards the advent of the semantic web will take place when a critical mass of web resources is available for use in a semantic way. this goal can be reached by the creation of semantic meta-data in the publication workflow, or by the development of systems and applications able to associate semantics to resources (i.e., annotating them) automatically. those applications should analyze the content of a web page and should be able to associate some ontology classes to it. one particular issue in this context is to define a suitable relationship between each concept of the ontology and some words (or, more in general, strings) which are expected to appear in resources dealing with that concept, playing the role of "triggers" suggesting the relevance of a given text fragment to a concept.we hereby propose an approach that, starting from a set of textual representations created by experts (synsets), is able to automatically widen their lexical coverage by computing new, larger synsets, increasing the capability of a semantic application to correctly recognize the ontology classes a document is related to. in such approach, the initial textual representations are integrated and augmented by exploiting lexical networks like wordnet, which contain syntactic information connected through semantic relationships. some algorithms are proposed to avoid misleading terms and consequently to perform sense disambiguation in wordnet.
the advent of trusted computing: implications for digital forensics. the release of computer hardware devices based on "trusted computing" technologies is heralding a paradigm shift that will have profound implications for digital forensics. in this paper, we map out the contours of a trusted environment in order to establish the context for the paper. this is followed by the main components of the tc architecture with an emphasis on the trusted platform and the trusted platform module (tpm). the next section presents a synopsis based on three threat models, viz., (i) pc owner-centric, (ii) trusted computing-centric, and (iii) digital forensics-centric and then briefly touches on the implications and unintended consequences of trusted computing for digital forensics. finally, the last section of the concludes with a recommendation on how to mitigate the negative effects of trusted computing.
quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts. we solve the consensus problem using a new class of broadcasts that are very appropriate to ad-hoc networking: every broadcast message is eventually ensured to be garbage-collected, thus freeing buffers in the resource-constrained mobile devices. we identify an impossibility result, the conditions in which a consensus protocol that assumes normal, message-keeping broadcasts can work using the new broadcast, and the adaptation such a protocol would require when these conditions do not hold. the cost of achieving quiescent consensus, estimated through simulations, is shown to be affordable for hosting practical dependable applications.
proxy-based security protocols in networked mobile devices. we describe a resource discovery and communication system designed for security and privacy. all objects in the system, e.g., appliances, wearable gadgets, software agents, and users have associated trusted software proxies that either run on the appliance hardware or on a trusted computer. we describe how security and privacy are enforced using two separate protocols: a protocol for secure device-to-proxy communication, and a protocol for secure proxy-to-proxy communication. using two separate protocols allows us to run a computationally-inexpensive protocol on impoverished devices, and a sophisticated protocol for resource authentication and communication on more powerful devices.we detail the device-to-proxy protocol for lightweight wireless devices and the proxy-to-proxy protocol which is based on spki/sdsi (simple public key infrastructure / simple distributed security infrastructure). a prototype system has been constructed, which allows for secure, yet efficient, access to networked, mobile devices. we present a quantitative evaluation of this system using various metrics.
agent factory: generative migration of mobile agents in heterogeneous environments. in most of today's agent systems migration of agents requires homogeneity in the programming language and/or agent platform in which an agent has been designed. in this paper an approach is presented with which heterogeneity is possible: agents can migrate between non-identical platforms, and need not be written in the same language. instead of migrating the "code" (including data and state) of an agent, a blueprint of an agent's functionality and its state is transferred. an agent factory generates new code on the basis of this blueprint. this approach of generative mobility not only has implications for interoperability but also for security, as discussed in this paper.
peerspaces: data-driven coordination in peer-to-peer networks. shared dataspaces &agrave; la linda, and the underlying data-driven coordination model, have been successfully exploited in the development of a huge variety of applications, going from parallel computing to web-based collaborative work. in this paper we consider a novel class of applications, namely those developed for peer-to-peer networks &agrave; la gnutella or freenet. we discuss the problems which arise when trying to exploit the original linda coordination model in this new scenario. in order to address these problems, we introduce peerspaces, a new coordination model particularly suited for the realm of peer-to-peer network applications, and we present a prototypical implementation of this coordination model based on the jxta peer-to-peer technology.
flexible querying of web documents. in this paper we present a flexible query language for expressing both conditions on the documents structure and conditions on the topics of interest. the first condition acts as a soft filter so as to reduce the set of documents on which to evaluate the second condition. flexibility is achieved by allowing users to specify both a linguistic quantifier such as most for qualifying the global composition of the documents into a number of sections and preferences on the desired documents sections.
extending sql with customizable soft selection conditions. users of information systems are aware that databases can be a mine of useful information, and would like to express flexible queries over the data possibly retrieving, not perfect" items when the perfect ones, those exactly matching the selection conditions, are not available. most commercial dbmss are still based on the sql for querying. thus providing some flexibility to sql can help users to improve their interaction with the systems without requing them to learn a completely novel language. in our approach we allow vague selection conditions based on linguistic predicates, i.e. soft conditions. this topic has been considered in previous works, specifically in sql/f which is a proposal for extending sql with soft conditions; however, we think that sql/f does not completely solve the problem mainly because it does not provide any practical means to customize the meanings of soft conditions to fit specific application domains. based on these considerations, we propose an extension of sql which supports customizable soft selection conditions which admit degrees of satisfaction; customizable soft conditions can be defined by users for their specific needs and application domains by means of an sql like operator. specifically, this paper proposes an extension of the basic sql select operator for specifying soft conditions; introduces a new operator for customizing the semantics of the linguistic predicates, provides the formal semantics for the proposed extension of selection conditions.
on the serializability of transactions in shared dataspaces with temporary data. several coordination platforms based on the shared dataspace approach introduces, besides the typical linda-like coordination primitives (used to produce, consume, and test for the presence/absence of data in a common repository), a transaction mechanism provided to group coordination primitives which should be executed in such a way that either all succeed or none of them is performed. in this paper we continue the investigation of the serializability of transactions in shared dataspace coordination languages that has been initiated in [2]. the new contribution consists of the analysis of the interplay between transactions and temporary data, ie., data with an associated expiration time.
a pivot-based index structure for combination of feature vectors. we present a novel indexing schema that provides efficient nearest-neighbor queries in multimedia databases consisting of objects described by multiple feature vectors. the benefits of the simultaneous usage of several (statically or dynamically) weighted feature vectors with respect to retrieval effectiveness have been previously demonstrated. support for efficient multi-feature vector similarity queries is an open problem, as existing indexing methods do not support dynamically parameterized distance functions. we present a solution for this problem relying on a combination of several pivot-based metric indices. we define the index structure, present algorithms for performing nearest-neighbor queries on these structures, and demonstrate the feasibility by experiments conducted on two real-world image databases. the experimental results show a significant performance improvement over existing access methods.
experimenting with sta, a tool for automatic analysis of security protocols. we present sta (symbolic trace analyzer), a tool for the analysis of security protocols. sta relies on symbolic techniques that avoid explicit construction of the whole, possibly infinite, state-space of protocols. this results in accurate protocol modeling, increased efficiency and more direct formalization, when compared to finite-state techniques. we illustrate the use of sta by analyzing the well-known asymmetric needham schroeder protocol. we discuss the results of this analysis, and contrast them with previous work based on finite-state model checking.
finding maximum independent sets in graphs arising from coding theory. new results are presented concerning binary correcting codes, such as deletion-correcting codes, transposition-correction codes, and codes for the z-channel. these codes are important due to the possibility of packet loss and corruption on internet transmissions. it is known that the problem of finding the largest correcting codes can be reduced to a well-known combinatorial optimization problem on graphs, the maximum independent set problem. a general scheme of organizing a local search for the maximum independent set problem is discussed. based on the developed heuristics, an exact branch-and-bound algorithm is proposed, which is able to find exact solutions for graphs with over 500 vertices within a reasonable time.
a pattern-based development methodology for communication protocols. patterns help to improve software quality and reduce development cost by documenting the experience of experts so that good solutions to recurring problems can be reused. in this paper, we propose a pattern-based software development methodology for communication protocols, particularly focusing on the specification and validation of message interactions. for the description of communication protocols, we propose a set of patterns. a complex protocol can be obtained by composing such patterns. to provide confidence in the protocol description, we validate the pattern-based specification by using the spin model checker. the validation phase needs model construction for the specification and checks the desired properties of the developing protocol. to show the feasibility of our methodology, we have conducted several case studies on real protocols.
about possibilistic queries against possibilistic databases. this paper is situated in the area of the so-called fuzzy databases, i.e., databases containing imprecise information. it is now recognized that querying databases containing imperfect information raises several problems, including complexity. in this paper, we consider a specific kind of queries, called possibilistic queries, of the form "to what extent is it possible that a given tuple t belongs to the answer of q (a regular relational query)". the major objective is to show that a reasonable complexity can be expected for a specific (although not too restricted) subset of possibilistic queries.
transforming ocl constraints: a context change approach. integrity constraints (ics) play a key role in the definition of conceptual schemas. in the uml, ics are usually specified as invariants written in the ocl. however, due to the high expressiveness of the ocl, the designer has different syntactic alternatives to express each ic, mainly depending on the type used as a context of the constraint. the method presented in this paper assists the designer during the definition of ics by means of automatically transforming the initially defined constraints into equivalent alternatives. the method is also useful in the context of the mda, where the choice of a particular alternative has a direct effect on the efficiency of the automatically generated implementation.
rail: code instrumentation for .net. code instrumentation is a mechanism that allows modules of programs to be completely rewritten at runtime. with the advent of virtual machines, this type of functionality is becoming more interesting because it allows the introduction of new functionality after an application has been deployed, easy implementation of aspect-oriented programming, performing security verifications, dynamic software upgrading, among others.the runtime assembly instrumentation library (rail) is one of the first frameworks to implement code instrumentation in the .net platform. it specifically addresses the limitations that exist between the reflection capabilities of .net and its code emission functionalities. rail gives the programmer an object-oriented vision of the code of an application, allowing assemblies, modules, classes, references and even intermediate code to be easily manipulated.this paper addresses the design of an implementation of rail along with the difficulties and lessons learned while building a framework for code instrumentation in .net.
enabling mobile agents to dynamically assume roles. agent-based application development must face the issues related to the interactions among agents. in fact, their sociality allows decomposing large applications into collaborating agents, while open environments, such as the internet, require agents belonging to different applications to compete to gain resources. in the brain framework, interactions among agents are fruitfully modeled and implemented on the basis of roles. this approach achieves several advantages, from separation of concerns between the algorithmic issues and the interaction issues, to the reuse of solutions and experiences in different applications. in this paper we propose a mechanism to enable java agents to dynamically assume roles at runtime. our approach is based on the modification of the bytecode of java agents, in order to implement an appropriate interface and to add the related methods. an application example and the comparison with other approaches show the effectiveness of our approach.
strong agent mobility for aglets based on the ibm jikesrvm. mobility enables agents to migrate among several hosts, becoming active entities of networks. java is today one of the most exploited languages to build mobile agent systems, thanks to its object-oriented support, portability and network facilities. nevertheless, java does not support strong mobility, i.e., the mobility of threads along with their execution state; thus developers cannot develop agents as real mobile entities. this paper reports our approach for java thread strong migration, based on the ibm jikes research virtual machine, presenting our results and proposing an enrichment of the aglets mobile agent platform in order to exploit strong agent mobility.
model transformations for hypertext modeling on web information systems. in response to the lack of suitable methods to build the navigation model of web information systems (wis), we presented in past works hm3, the hypertext modeling method of midas, a methodological framework for the agile development of wis. we proposed a method to obtain the navigation model of a wis, starting from the conceptual data model and the user requirements, collected in the use case model. in this work, continuing with the mda approach for wis development that we are following with hm3, we define the model to model transformations needed at the pim level to get the hypertext model from the behavioral and content models. firstly we specify the transformation rules with natural language to later map them to graph transformation rules.
an abstract architecture for semantic service coordination in agent-based intelligent peer-to-peer environments. intelligent agent-based peer-to-peer (ip2p) environment provide a means for pervasively providing and flexibly co-ordinating ubiquitous business application services to the mobile users and workers in the dynamically changing contexts of open, large-scale, and pervasive settings. we present an abstract architecture for service delivery and coordination in ip2p environments that has been developed within the cascom project.
editorial message: special track on web technologies and applications. the special track on web technologies and applications is already at its fourth edition and has seen a constant evolution in the research issues. currently, web applications are required to rely on open, flexible, adaptable, and distributed infrastructure and to be ubiquitous, highly scalable, reliable, accessible from different devices, and personalized with respect to various user requirements. web applications are becoming increasingly complex thereby creating a need for appropriate theoretical foundations, development methodologies, and supporting technology, drawing on different areas of computer science such as databases, artificial intelligence, programming languages, distributed computing, information retrieval, semantic modeling, human-computer interaction, etc.
using roles and business objects to model and understand business processes. business process modeling focus on describing how activities interact with other business objects while sustaining the organization's strategy. business objects are object-oriented representations of organizational concepts, such as resources and actors, which collaborate with one another in order to achieve business goals. these objects exhibit different behavior according to each specific collaboration context. this means the perception of a business object depends on its collaborations with other objects. business process modeling techniques do not clearly separate the multiple collaborative aspects of a business object from its internal aspects, making it difficult to understand objects which are used in different contexts, thus hindering reuse. to cope with such issues, this paper proposes using role modeling as a separation of concerns mechanism to increase the understandability and reusability of business process models. the approach divides a business process model into a business object model and a role model. the business object models deals with specifying the structure and intrinsic behavior of business objects while the role model specifies its collaborative aspects.
modeling organizational actors and business processes. finding suitable actors to perform specific activities is a common problem in knowledge-oriented organizations. to address this problem, this paper outlines the concepts required to represent organizational actor's skills and the services that are required by business process activities. these concepts are used within a marketplace-based model that enables dynamically managing actors and activities according to competence supply and demand.
solving weighted max-sat optimization problems using a taboo scatter search metaheuristic. in the last three decades, many researchers have focused on the satisfiability problem and on many of its variants, in particular, on the weighted maximum satisfiability problem (max-w-sat). the latter is known to be difficult to solve, due to a high number of local minima present in its search space. in this work, we present a metaheuristic based on taboo search (ts) procedure that makes use of the scatter search (ss) paradigm. our objective is to support a ts by a ss add-on to explore the influence of a population and combination strategies on the ability of generating high quality solutions.
adaptive testing of software components. software components are popular in nowadays software industries. however, how to test software components is a problem since the source code of the software component under test may not be available for the third-party user. in this paper we show that the software component should be tested in an adaptive manner in the sense that the software defect detection rates are estimated on-line by using testing data collected during testing to improve test case selections. in doing so, we use a recursive least squares estimation method to do on-line parameter estimations. this paper further justifies the advantages of the controlled markov chain (cmc) approach to software testing in particular, and the practicality of the idea of software cybermetics in general.
incremental adaptive filtering: profile learning and threshold calibration. this paper proposes an adaptive filtering process. adaptive filtering consists on receiving documents over time and compare them to the user profile. filtering is improved over time by updating the user profile and the dissemination threshold, the profile and the threshold are the principle elements in the filtering decision function. in this paper, a linear system under constraints is resolved when a relevant document is retrieved, the solution to this system is used to improve the user profile. this allows to reinforce the relevance of each relevant retrieved document. the constraints are a form of tf*idf (term frequency*inverse document frequency). a gradient distribution approach is used, based on information extracted from relevant filtered documents to update the dissemination threshold. experiments are undertaken into a dataset provided by trec (text retrieval conference) in order to simulate and evaluate a filtering process.
a robust watermarking system based on compression. digital watermarking can be used to protect the intellectual property for multimedia data. in this paper, we introduce an image watermarking scheme based on the svd (singular value decomposition) compression. in particular, we divide the cover image into blocks and apply the svd to each block; the watermark is embedded in all the non-zero singular values according to the local features of the cover image so as to balance embedding capacity with distortion. the watermarking system we propose is robust against typical attacks, including low-pass and high-pass filtering, as evaluated by the checkmark benchmarking tool [19].
using a hybrid evolutionary-taboo algorithm to solve job shop problem. in this paper, we propose a new hybrid algorithm to solve the job shop problem. our algorithm, called evoluntionary-taboo uses an evolutionary algorithm (ea) to enhance results obtained by one of the best taboo algorithms for this problem. we tested the algorithm on the benchmark problems for which the taboo algorithm returned its worst results. on average, we improved taboo results by 2.9%. the results were under one percent from the best known results for these problems.