waashk/dblp huggingface dataset:
expanding domain-specific lexicons by term categorization. we discuss an approach to the automatic expansion of domain-specific lexicons by means of term categorization, a novel task employing techniques from information retrieval (ir) and machine learning (ml). specifically, we view the expansion of such lexicons as a process of learning previously unknown associations between terms and domains. the process generates, for each ci in a set c = {c1,..., cm} of domains, a lexicon li1, boostrapping from an initial lexicon li0 and a set of documents &theta; given as input. the method is inspired by text categorization (tc), the discipline concerned with labelling natural language texts with labels from a predefined set of domains, or categories. however, while tc deals with documents represented as vectors in a space of terms, we formulate the task of term categorization as one in which terms are (dually) represented as vectors in a space of documents, and in which terms (instead of documents) are labelled with domains.
editorial message for the special track on embedded systems: applications, solutions, and techniques. embedded systems can be regarded today as one of the most lively research and industrial targets. in this field, the ever-increasing demand for computing power and any sort of system resources continuously challenges state-of-the-art design methodologies and development techniques. the largest part of the most complex issues to be addressed during design and development phases can be related to the need to compromise among tight constrains on performance, memory size, code size, power consumption, appliance weight and dimension, possible real-time behaviors, maintainability, scalability, security, time-to-market and, last but not indubitably least, cost. the designer is continuously challenged by requirements modifications that must be timely addressed, operating at different levels of abstraction, e.g. from the proper adjustment of cpu internals to the scheduler structuring in rtoss, from the optimized exploitation of i/o devices to the employment of specialized compilation techniques. suitable solutions to emerging problems in this application field can be found via a joint effort by academia and industry.
editorial message: special track on the programming languages and object technologies. for the sac 2002, in the programming languages and object technologies track, papers were invited to address a wide range of topics from programming languages and object technologies. these included automatic programming, compiling techniques, domain-specific programming languages, formal semantics, meta and higher-order programming, new programming paradigms, practical experiences with programming languages, language design and implementations, security issues, standardization of languages, object-oriented programming languages and applications, object-oriented design and analysis, distributed object systems and architectures, languages for distributed object systems, quality of service in open environments, component-based software design, corba, rmi, dcom and related middleware, applications of distributed object computing, design patterns, and testing of object-oriented software. the call for papers was distributed through newsgroups, public and private mailing lists.
experimental aspect-oriented language - aspectcool. aspect-oriented programming (aop) is a programming technique for modularizing concerns that crosscut the basic functionality of programs. in aop, aspect languages are used to describe properties, which crosscut basic functionality, in a clean and a modular way. aop is currently supported mostly by aspect weavers, which require a source code for both components and aspects in order to create the final program. in this paper we have presented our approach to aspect weaving in order to achieve separate compilation. this approach to aspect weaving is used in the languages cool and aspectcool, which are also presented in the paper. with this approach it is possible to apply aspects on already compiled components.
evolution of business processes towards ebusiness using a critiquing approach. innovating the business processes of an enterprise requires their preliminary analysis and assessment. in particular, information on the performance and costs of activities and processes must be gathered in order to identify candidates for innovation. a critical point is finding suitable presentation means of the gathered data in order to support effectively the decision makers. this paper presents a strategy and supporting tools for business process innovation. the strategy integrates measurement, decision making, and critiquing techniques, for analyzing business processes, identifying activities and software systems that are candidate to innovation, and mapping critiques onto specific innovation actions. the strategy is supported by a toolkit, named webev+, that integrates the webev environment [2], for managing the assessment and evaluation tasks, and argouml [1], for modeling and critiquing business processes.
analysis of deployment dependencies in software components. administration and deployment of software systems become increasingly complex. this complexity results from the need of uniform access to applications from heterogeneous terminals through different communication infrastructures. moreover, applications consists in complex architectures of lot of small components connected together. a first step to simplify deployment is to have an unified and abstract model for representing deployment dependencies and managing them properly. therefore, we propose here a deployment model and a conceptual foundation for component installation. installation dependencies and installation rules are expressed in a logic language.
assessment and impact analysis for aligning business processes and software systems. business processes and existing software systems must be aligned so that software systems can adequately support the business processes in order to be effectively used within them. the alignment characteristic needs to be considered even during the execution of an evolution process. in particular, a strict relationship exists between the evolution of a legacy system and that of the supported business process. therefore, the requirements for evolving a software system embedded in a business process are to be defined on the basis of the change needing to be performed on the process activities. in fact, any modification performed in the business process activities and/or supporting software system may impact the process activities in terms of input/output and/or purpose of the software system and, therefore, cause misalignment. a coarse grained strategy is proposed for detecting misalignment between software systems and supported business processes when a change is executed. in addition, the strategy supports the identification of all the objects, either software system components or process activities, affected by a change and needing to be considered during the evolution process, for keeping the alignment and ensuring the technological support to the business process. the strategy proposes the exploitation of quality parameters, for codifying the alignment concept, and impact analysis techniques, for propagating the change and identifying all the objects affected by a change and requiring new evolution interventions.
interactive simulation of security policies. a general framework for simulating security policies interactively is developed by asms (gurevich's abstract state machines) and then mechanised by the asm workbench. the asm external functions make it possible to simulate under the environmental influence the behaviour of a policy. the interactive features of the workbench allow the simulation of the policy norms that apply to a given case study, facilitating their understanding. possible inconsistencies affecting the case study can be automatically detected during the simulation and widely documented. the framework is demonstrated on a published, example security policy. the findings support the claim that adding priorities to roles achieves the crucial goal of consistency.
a trust-enhanced recommender system application: moleskiing. recommender systems (rs) suggests to users items they will like based on their past opinions. collaborative filtering (cf) is the most used technique to assess user similarity between users but very often the sparseness of user profiles prevents the computation. moreover cf doesn't take into account the reliability of the other users. in this paper we present a real world application, namely moleskiing.it, in which both of these conditions are critic to deliver personalized recommendations. a blog oriented architecture collects user experiences on ski mountaineering and their opinions on other users. exploitation of trust metrics allows to present only relevant and reliable information according to the user's personal point of view of other authors trustworthiness. differently from the notion of authority, we claim that trustworthiness is a user centered notion that requires the computation of personalized metrics. we also present an open information exchange architecture that makes use of semantic web formats to guarantee interoperability between ski mountaineering communities.
availability of protocol goals. a new principle for prudent design of security protocols is developed to extend and complement the existing ones. called goal availability, the principle requires that a given protocol goal be confirmed by a formal guarantee that the principals can invoke in practice. in consequence, the guarantees must be based on assumptions that the principals are able to verify. analysing known protocols in the light of the new principle highlights unknown features. for example, an established ban-logic claim is undermined, and some weaknesses of a modern smart card protocol are discovered. our findings support the general claim that checking a protocol against goal availability helps discover unspotted lacks of explicitness in the protocol messages. the protocol analyses reported here are all machine assisted, but goal availability serves for protocol analysis in general.
applications of finite fields to dynamical systems and reverse engineering problems. we present a mathematical model: dynamical systems over finite sets (dsf), and we show that boolean and discrete genetic models are special cases of dfs, [1, 4, 10].in this paper, we prove that a function defined over finite sets with different number of elements can be represented as a polynomial function over a finite field. given the data of a function defined over different finite sets, we describe an algorithm to obtain all the polynomial functions associated to this data. as a consequence, all the functions defined in a regulatory network can be represented as a polynomial function in one variable or in several variables over a finite field. we apply these results to study the reverse engineering problem.
editorial message: special track on computer security. the proliferation of network computing and especially the ubiquity of the internet has made security one of the key areas in modern computing. this track aims at bringing together researchers working on applied issues in computer and information security, ranging from protocols and tools to policy and laws.security is a multidisciplinary topic related to almost every aspect of computer science. from information security to mobile computation, from artificial intelligence to wireless communication, it is difficult to find a computer science area that is not concerned with security directly or indirectly.the computer security track in the 2002 symposium on applied computing is a demonstration of the diversity. the track focus is on practical (applied) aspects of computer security so as to fit well with the general objectives of the symposium.
editoral message: special track on computer security. the security track, currently in its fifth edition, continues to raise large interest. this year's success is in large part due to the efforts of the expanded program committee, composed of 19 leading researchers coming from academia and industry:&bull; gail-joon ahn (university of north caroline at charlotte, usa)&bull; arslan br&ouml;mme (university of magdeburg, germany)&bull; david w chadwick (university of salford, uk)&bull; bruce christianson (university of hertfordshire, uk)&bull; nancy durgin (sandia national laboratories, usa)&bull; simon foley (university college cork, ireland)&bull; c&egrave;dric fournet (microsoft research cambridge, uk)&bull; dieter gollmann (technical university hamburg, germany)&bull; stefanos gritzalis (university of the aegean, greece)&bull; peter honeyman (university of michigan, usa)&bull; sokratis k katsikas (university of the aegean, greece)&bull; helmut kurth (atsec, germany)&bull; volkmar lotz (sap research, france)&bull; heiko mantel (rwth aachen university, germany)&bull; chris mitchell (royal holloway university of london, uk)&bull; david von oheimb (siemens ct ic, germany&bull; pierangela samarati (universit&aacute; di milano, italy)&bull; vitaly shmatikov (sri international, usa)&bull; kymie tan (carnegie-mellon university, usa)
analytical modelling of priority commit protocol for reliable web applications. web applications are vulnerable to failures and low performance due to the large population of users and the widespread distribution of internet. transaction technology provides web applications with high reliability and improved performance. this paper presents a novel approach for the efficient commit processing of web transactions. the proposed approach is based on the implementation of priority active network scheduling mechanism at each network node. it involves rigorous analysis of a network node with-finite capacity to accommodate messages, bursty arrival process to represent incoming multi-class messages, and the employment of a priority scheduling mechanism to give preferential treatment to high priority messages. this analytical solution provides closed from expressions for calculating the queuing delay per class involved in the commit processing of web transactions at each network node. the proposed approach significantly reduces the queuing delay for high priority messages such as commit, abort, and compensation of web transactions. consequently, performance of the commit processing of web transactions is improved as response time of the nodes responsible for making decision is reduced.
special track on computer security. the increasing importance of information security to society in the 21st century is widely acknowledged. this is reflected by the growing interest in the security track, which is now in its fourth edition. this year's success is in large part due to the efforts of the expanded program committee, composed of 18 leading researchers coming from academia and industry.
efficient comparison of enterprise privacy policies. enterprise privacy policies often reflect different legal regulations, promises made to customers, as well as more restrictive enterprise-internal practices. the notion of policy refinement is fundamental for privacy policies, as it allows one to check whether a company's policy fulfills regulations or adheres to standards set by customer organizations, to realize the "sticky policy paradigm" that addresses transferring data from one realm to another in a privacy-preserving way, and much more. although well-established in theory, the problem of how to efficiently check whether one policy refines another has been left open in the privacy policy literature. we present a practical algorithm for this task, concentrating on those aspects that make refinement of privacy policies more difficult than, for example refinement for access control policies, such as a more sophisticated treatment of deny rules and a suitable way for dealing with obligations and conditions on context information.
editorial message: special track on computer security. the security track, currently in its fifth edition, continues to raise large interest. this year's success is in large part due to the efforts of the expanded program committee, composed of 19 leading researchers coming from academia and industry:&bull; gail-joon ahn (university of north caroline at charlotte, usa)&bull; arslan br&ouml;mme (university of magdeburg, germany)&bull; david w chadwick (university of salford, uk)&bull; bruce christianson (university of hertfordshire, uk)&bull; nancy durgin (sandia national laboratories, usa)&bull; simon foley (university college cork, ireland)&bull; c&egrave;dric fournet (microsoft research cambridge, uk)&bull; dieter gollmann (technical university hamburg, germany)&bull; stefanos gritzalis (university of the aegean, greece)&bull; peter honeyman (university of michigan, usa)&bull; sokratis k katsikas (university of the aegean, greece)&bull; helmut kurth (atsec, germany)&bull; volkmar lotz (sap research, france)&bull; heiko mantel (rwth aachen university, germany)&bull; chris mitchell (royal holloway university of london, uk)&bull; david von oheimb (siemens ct ic, germany&bull; pierangela samarati (universit&aacute; di milano, italy)&bull; vitaly shmatikov (sri international, usa)&bull; kymie tan (carnegie-mellon university, usa)
efficiency of prefix and non-prefix codes in string matching over compressed databases on handheld devices. this paper shows the efficiency of prefix and non-prefix codes for searching over compressed handheld databases. byte pair encoding (bpe), tagged suboptimal code (tsc), and huffman encoding are the compression techniques used in the evaluation. by compressing handheld databases and searching over compressed text without needing to expand the databases, more data will be stored and more applications can be used. experimental results show that about 33% more space has been achieved in the compressed handhelds' databases when using searching over compressed text using bpe (sctb) or searching over compressed text using tsc (sctt) solutions. moreover, both solutions are 6.6 times faster than decompressing the databases followed by a linear search in all different sizes of databases. efficiency performance shows that sctb is the recommended solution for databases consisting of large-sized records and rarely updated, and sctt is the recommended method for frequently updated databases or consisting of small-sized records. tsc and bpe compression schemes could also be used to accelerate wireless connectivity, web clipping, or databases transfer between handheld devices and computers, since these databases are usually small in size.
implementing rule-based mechanisms for agent-based price negotiations. this note describes a sample implementation of automated negotiations in an e-commerce modeling multi-agent system. a specific set of rules is used for enforcing negotiation mechanisms. discussion of system design and implementation using jade and jess is provided. finally, an experiment involving multiple english auctions performed in parallel is discussed.
webuml: reverse engineering of web applications. web applications have become complex and crucial for many firms, especially when combined with areas such as crm (customer relationship management) and bpr (business process reengineering). since then the scientific community has focused attention to web application design, development, analysis, testing, by studying and proposing methodologies and tools. this paper describes an automatic tool for the construction of uml models from existing web applications. this tool, named webuml, generates class and state diagrams by analysing source code and by interacting with the web server. this reverse engineering tool is based on source code static analysis and also applies mutational techniques in order to exploit the server side execution engine to accomplish part of the dynamic analysis. this tool will be the core of a testing suite under construction at our laboratory. webuml generated models (diagrams) will be used as a base for test case generation and coverage analysis.
applying scheduling techniques to minimize the number of late jobs in workflow systems. ordering the cases in a workflow can result in significant decrease on the number of late jobs. but merging workflow and scheduling is not trivial. this paper presents some of the problems of using scheduling results in ordering cases in a workflow and tackles two of them: the uncertainties on the cases' processing times and routing. a new approach to modeling these uncertainties is also proposed: the guess and solve technique. it consists of making a guess on the execution times and routes the case will follow, and solving the corresponding deterministic scheduling problem using a suitable technique, in this paper genetic algorithms. simulation results show that for almost all workloads rules such as earliest due date first, and guess and solve (if the error in guessing is bound by 30%) are statistically significantly better than the commonly used fifo rule regarding the number of late jobs.
testuml: user-metrics driven web applications testing. web applications have become very complex and crucial, especially when combined with areas such as crm (customer relationship management) and bpr (business process reengineering), the scientific community has focused attention to web application design, development, analysis, and testing, by studying and proposing methodologies and tools. this paper describes techniques for semi-automatic test case definition and for user1-driven testing (based on statistical testing or coverage analysis) from web applications reverse engineered uml models. these techniques are implemented as tools in the waat project. webuml is a reverse engineering tool that generates class and state diagrams through static and dynamic web application analysis. testuml is a testing suite that uses generated models to define test cases, coverage testing criteria and also reliability analysis.
drc4.5: improving c4.5 by means of prior knowledge. classification is one of the most useful techniques for extracting meaningful knowledge from databases. classifiers, e.g. decision trees, are usually extracted from a table of records, each of which represents an example. however, quite often in real applications there is other knowledge, e.g. owned by experts of the field, that can be usefully used in conjunction with the one hidden inside the examples. as a concrete example of this kind of knowledge we consider causal dependencies among the attributes of the data records. in this paper we discuss how to use such a knowledge to improve the construction of classifiers. the causal dependencies are represented via bayesian causal maps (bcms), and our method is implemented as an adaptation of the well known c4.5 algorithm.
a multi-criteria model for electronic auctions. in this paper we present a multi-criteria model for electronic auctions, which is based on reference points. according to the model, the buyer must specify an aspiration point that expresses his desired values on the attributes of the item to be purchased and a reservation point that represents the minimal values required. negotiation takes place between software agents that negotiate on behalf of their human owners. the multi-criteria model allows the buyer agent to control the negotiation process on each attribute of the deal. we illustrate the use of this model by providing an auction mechanism based on an english reverse auction protocol.