waashk/dblp huggingface dataset:
special track on adaptive techniques in operating systems: editorial message. the purpose of this track is to bring together researchers, designers, and developers who are interested in methodology for the design and analysis of operating systems and adaptive applications. it is motivated by a tremendous growth on the demands for high-performance operating systems in recent years. such an observation comes with the fact that many adaptive applications become more and more complex, and it imposes new challenging issues never faced before in this application field. it is thus clear that nowadays the development and design of operating systems must rely, even more than that in the recent past, on specific solutions both in the hardware and in the software components. moreover, the needs to timely tackle changes in the market pushes toward the employment of methodologies to shorten the development time and to drive the evolution of existing products. the solutions to new problems emerging in this setting call for a joint effort from the academics and industry.
an adaptation of the collections framework, reflection and object cloning from j2se to j2me. the jargon used by sun microsystems related to the java technology "write once, run anywhere" does not match the reality when it comes to devices with distinct memory and processing capability as can be evidenced by software engineers in migration projects between j2se and j2me platforms. this work proposes a solution on how to port conventional desktop-tailored codes to less capable mobile devices, achieving the same results, with comparative examples that use the collections framework classes, and the object cloning and reflection resources. moreover, this paper shows a case study where the proposed process is applied.
verifiable anonymous vote submission. this paper describes a new architecture for supporting the anonymous submission of votes in the revs voting system. furthermore, it enables voters to verify during the election that the electoral system processed correctly their anonymously submitted vote. this verification is a weak proof that the vote was effectively considered in the final tally. but since malicious electoral servers have no means to choose which votes should not be considered in the tally, the weak proof is strong enough for ensuring voters that the outcome of the election was not manipulated by the servers towards a particular outcome. in spite have been conceived for the revs system, our anonymizing architecture can be used in other voting systems as well. the only requirement is that it should be possible to submit the same vote several times and to detect and drop vote replicas at the tallying phase, which is valid for other blind signature voting protocols.
a wrapper generation system for pdf documents. the widespread use of the pdf format for exchanging print-oriented documents raises new challenges in the research field of information extraction. in this paper we present a novel wrapper generation system for extracting information from pdf documents. objects in a pdf document are accessible by their position, thus we exploit spatial constraints for driving the extraction of relevant information according to a set of group type definitions. moreover, using fuzzy logic based conditions enables effectively handling uncertainty on the comprehension of the layout structure of pdf documents. the experimental results shown in the paper state a good accuracy of our pdf wrapping system.
similarity estimation module for owscis. semantic interoperability based on ontologies is nowadays becoming a great challenge. we propose an architecture for semantic-based cooperation called owscis (ontology and web service based cooperation of information sources). it allows to map various information sources using ontologies and to answer users' queries over the cooperation. in this paper we focus on the similarity estimation service of the owscis architecture which allows to discover mappings between different ontologies. it relies on various mappings methods which are combined and refined to semi-automatically generate mappings between a local and a reference ontologies.
epml: an executable process modeling language for process-aware applications. process modeling and process enactment are becoming a prominent concern for a large class of modern applications. this is witnessed by the increasing number of modeling languages and software tools designed to assist the development of the so called process-aware applications. most of these languages and tools are targeted to different application domains (workflow management, web service orchestration, business process management, etc.) and also differ about the way coordination is achieved. this forces software designers to address the very same concern, process coordination, with different, albeit often similar, languages when moving across application domains. epml is a process modeling language that, along with its enactment engine, can be used to address process coordination across different application domains. this result is achieved with high expressive power and by promoting an effective separation of concerns that increases software composability.
redesigning business networks: reference process, network and service map. driven by factors like globalization, increased competition, and declining customer loyalty, the financial industry is facing a structural transformation. operating in a changing market, the (re)design of business models and thus also the business network is a mayor challenge for financial institutions. one way of succeeding in this endeavor is to focus on core competencies. banks therefore adjust their business models in order to reduce their degree of vertical integration by outsourcing complementary activities. this business redesign requires an integrated approach to align the future business model with the involved processes and information systems while also taking the surrounding conditions of the company and its market into account. present approaches show a restricted usability as they focus either on strategic aspects or process-efficiency only. moreover, these procedures often lack methodological support so that they are rarely applicable in practice. this paper introduces an integrated approach of business network redesign for the financial industry that covers the layers strategy, process and systems. the methodology considers the necessity for a common understanding of the underlying processes when reshaping the business model / network. since research is still in progress, this paper concentrates on the basic instruments which are used to describe a distinct business environment: a reference network and a reference service map both derived from a reference process. as the research focuses on the financial services sector, the paper exemplifies these reference models for the investment process from a bank's point of view. finally, the instruments are applied to a case study to verify their content and examine their applicability.
a constraint hierarchies approach to geometric constraints on sketches. we propose an approach that uses preferences on the constraints in order to deal with over-constrained geometric constraint problems. this approach employs constraint hierarchies, a paradigm that has close relations with the traditional graph-based approaches used in geometric constraint solving. we also remark that any geometric constraint problem defined by imposing relations on a sketch becomes overconstrained as soon as the sketch is imposed as a weak constraint representing the designers intents. as a result our method appears very appropriate in cad/cam tools.
increasing trust through the use of 3d e-commerce environment. existing 2d e-commerce internet websites provide users with only relatively simple, browser-based interface to access available products and services. these websites often lack in the emulation of real-life human representative which is an important factor in establishing consumer's trust. 3d e-commerce environments with 3d virtual space and human-like avatar facilitating the sale of real-world products may add the human factor to the shopping experience and might therefore enhance the relation of social trust in these environments. this paper explains the concept of 3d e-commerce environments and their roles in increasing consumer's trust and in enhancing e-business profitability.
towards automatic feature vector optimization for multimedia applications. we systematically evaluate a recently proposed method for unsupervised discrimination power analysis for feature selection and optimization in multimedia applications. a series of experiments using real and synthetic benchmark data is conducted, the results of which indicate the suitability of the method for unsupervised feature selection and optimization. we present an approach for generating synthetic feature spaces of varying discrimination power, modeling main characteristics from real world feature vector extractors. a simple, yet powerful visualization is used to communicate the results of the automatic analysis to the user.
extending rup to develop fault tolerant software. software reliability is generally considered a critical requirement in distributed systems such as web-based systems and real-time embedded systems. reliability can be obtained using fault tolerance techniques during the software development process. however, most of the software development processes do not provide suitable support for the construction of a software system that needs to meet fault tolerance requirements. the development processes as such rup were proposed before the recognition of this concern and they still lack appropriate support. rup (rational unified process) is a well-known software engineering process that provides a disciplined approach to assigning tasks and responsibilities. the paper aims to present an extension to rup for the development of fault tolerant software. the fault tolerance is embodied in rup as a knowledge area (discipline) with activities and roles defined according to the architecture of process engineering uma (unified method architecture). an example was elaborated to clarify and show the feasibility of the proposal.
special track on the semantic web and applications: editorial message. the technical track "the semantic web and applications (swa)" focuses on the topics related to semantic web technologies and their applications. the semantic web is a next generation web. the current web content is not easy to be processed by machines. on the other hand, the web content in the semantic web can be processed easily by machines. the techniques to realize and/or utilize the semantic web are discussed in this track.
scheduling distributable real-time threads in the presence of crash failures and message losses. we consider the problem of scheduling distributable realtime threads under run-time uncertainties including those on thread execution times, thread arrivals, node failures, and message losses. we present a distributed scheduling algorithm called acua that is designed under a partially synchronous model, allowing for probabilistically-described message delays. we show that acua satisfies thread time constraints in the presence of crash failures and message losses, is early-deciding, and has an efficient message and time complexity. the algorithm has also better "best-effort" real-time property than past thread scheduling algorithms.
propagating multitrust within trust networks. we suggest the concept of multitrust, which is aimed at computing trust by collectively involving a group of trustees at the same time: the trustor needs the concurrent support of multiple individuals to accomplish its task. we propose soft constraint logic programming based on semirings as a mean to quickly represent and evaluate trust propagation for this scenario. to attain this, we model the trust network adapting it to a weighted and-or graph, where the weight on a connector corresponds to the trust feedback value among the connected nodes. semirings are the parametric and flexible structures used to appropriately represent trust metrics.
a behavior priority driven approach for resource reservation scheduling. in this paper a behavioral distinction of soft real-time tasks is introduced. the distinction is based on the behavior of the previous instance of each task and it is used to propose a scheduling algorithm. the algorithm, called bids, uses well-known server mechanisms with an extension to handle two priority queues within each server. the priority of a server is managed accordingly to the result that its associated task produce. along with the formal presentation of the algorithm and the proofs of its properties some performance evaluations based on simulations are included.
applying markup language resources in the specification of visual alphabets and visual sentences. visual language systems are electronic artifacts that provide information in a graphical and dynamical way. in this article we propose an approach for visual language system specification based on visual alphabets and grammars where xml documents and schemas are specialized to specify visual language systems. in addition, we define how to manipulate and extract visual language information from these documents and schemas through xml resources. this approach was formally specified and as a proof of concept we implement our ideas in a visual language system generator.
citywalker: a mobile gps for walking travelers. global positioning system (gps) is widely used in vehicle navigation; however, they are unusable for pedestrians. problems include inadequate information for optimized path-planning in the pedestrian level; and the human-computer interface (hci) for vehicles basically does not work for walking user. this paper presents solutions to solve these problems through experiments. a new design of gps based human navigation aid, called "city walker", is proposed. citywalker uses a digital fluxgate compass to rotate the map automatically, according to user's orientation. city-walker thus provides a low-cost solution for building a gps based, human oriented navigation tool on various mobile platforms.
a performance comparison of pso and ga in scheduling hybrid flow-shops with multiprocessor tasks. applications in industry and computing require a proper scheduling of tasks to achieve good performance. the algorithms presented in this paper tackles task scheduling problem in a multi layer multiprocessor environment. using the scheduling terminology, problem is defined as multiprocessor task scheduling in hybrid flow-shops. this paper presents a particle swarm optimization (pso) algorithm for the solution. in order to improve the performance of pso, hybrid techniques were also employed. the performance results, compared with other well known meta-heuristics from the literature, are reported. results show that pso and hybrid methods have merits in solving multiprocessor task scheduling in hybrid flow-shop environment.
combination of decomposability and propagation for solving first-order constraints in decomposable theories. over the last decade, first-order constraints have been efficiently used in the constraint programming world to model many kinds of complex problems such as: scheduling, resource allocation, computer graphics and bio-informatics. recently, a new property called "decomposability" has been introduce and many first-order theories have been proved to be decomposable: finite or infinite trees, rational and real numbers, linear dense order, ... etc. a decision procedure in the form of 5 rewriting rules has also been developed but this later can only decide if a formula without free variables is true or not in any decomposable theory t. unfortunately, this decision procedure is not enough when we want to find the values of the free variables of any first-order constraint &phiv; so that &phiv; is true in any decomposable theory t. these kind of problems are generally known as first-order constraint satisfaction problems. we present in this paper not only a decision procedure but a full first-order constraint solver for any decomposable theory t. our solver is given in the form of six rewriting rules which transform any first-order constraint (which can possibly contain free variables) into an equivalent solved formula which is either the formula true, or the formula false or a formula having at least one free variable and written in a very simple and explicit solved form. we also show the efficiency of our solver by solving complex first-order constraints containing a huge number of imbricated quantifiers and negations. this is the first full first-order constraint solver over any decomposable theory.
xedge: clustering homogeneous and heterogeneous xml documents using edge summaries. in this paper we propose a unified clustering algorithm for both homogeneous and heterogeneous xml documents. depending on the type of the xml documents, the proposed algorithm modifies its distance metric in order to properly adapt to the special structural characteristics of homogeneous and heterogeneous xml documents. we compare the quality of the formed clusters with those of one of the latest xml clustering algorithms and show that our algorithm outperforms it in the case of both homogeneous and heterogeneous xml documents.
bigbatch: a document processing platform for clusters and grids. bigbatch is an image processing environment designed to process batches of thousands of monochromatic documents. one of the flexibilities and pioneer aspects of bigbatch is offering the possibility of working in distributed environments such as clusters and grids. this paper presents the bigbatch tool and the results of a comparative analysis between cluster and grid configurations. the results obtained show almost no difference in total execution times, indicating that performance is not a primary criterion for choosing between the use of a cluster or a grid. however, there are other, qualitative, aspects that may impact this choice. this paper also considers these aspects and provides a general picture of how to successfully use bigbatch to process document images employing many computers for this task.
performability evaluation of mobile client-server systems. recent advances in mobile computing have made it possible for customers carrying handheld devices to have access to data and information services regardless of their physical location. customers expect the same level of service in terms of availability and performance from the mobile applications as with their non-mobile counterparts. different types of client-server computing architectures are used today that facilitates such mobile access of data. in order to achieve high performance and availability, replicas of data servers are usually added to tolerate failures and balance workloads. this paper introduces a modeling technique to evaluate combined performance and availability that not only considers the failures of the mobile (i.e. wireless) links, mobile devices and the data servers but also takes into account the rate of mobility of the clients. it demonstrates the applicability of the model by building and analyzing models for two client-server architectures.
tag-aware recommender systems by fusion of collaborative filtering algorithms. recommender systems (rs) aim at predicting items or ratings of items that the user are interested in. collaborative filtering (cf) algorithms such as user- and item-based methods are the dominant techniques applied in rs algorithms. to improve recommendation quality, metadata such as content information of items has typically been used as additional knowledge. with the increasing popularity of the collaborative tagging systems, tags could be interesting and useful information to enhance rs algorithms. unlike attributes which are "global" descriptions of items, tags are "local" descriptions of items given by the users. to the best of our knowledge, there hasn't been any prior study on tag-aware rs. in this paper, we propose a generic method that allows tags to be incorporated to standard cf algorithms, by reducing the three-dimensional correlations to three two-dimensional correlations and then applying a fusion method to re-associate these correlations. additionally, we investigate the effect of incorporating tags information to different cf algorithms. empirical evaluations on three cf algorithms with real-life data set demonstrate that incorporating tags to our proposed approach provides promising and significant results.
code-carrying theory. code-carrying theory (cct) is an alternative to the proof-carrying code (pcc) approach to secure delivery of code. with pcc, code is accompanied by assertions and a proof of correctness or of other required properties. the code consumer does not accept delivery unless it first succeeds in generating theorems, called verification conditions, from the code and assertions and checking that the supplied proof proves these theorems. with cct, instead of transmitting code explicitly, only assertions and proofs are transmitted to the consumer. if proof checking succeeds, code is then obtained by applying a simple tool called codegen to the resulting theory. this paper explains the design and implementation of cct and shows how it can be used to achieve secure delivery of code with required correctness or safety properties. all the tools used in the verification steps are implemented in athena, which is both a traditional programming language and a deduction language.
special track on artificial intelligence in space applications: editorial message. the special track on artifical intelligence in space applications was part of the 2008 acm symposium on applied computing, which was held in march 16--20, 2008, in fortaleza, cear&aacute;, brazil.
houston, we have a problem...: a survey of actual problems in computer games development. this paper presents a survey of problems found in the development process of electronic games. these problems were collected mainly from game postmortems and specialized litterature on game development, allowing a comparison with respect to well-known problems in the traditional software industry.
handle local optimum traps in cbir systems. existing cbir systems, designed around query refinement based on relevance feedback, suffer from local optimum traps. that is, when the user is examining a relevant cluster surrounded by less relevant images, essentially the same set of images will be returned for the user to provide relevance feedback. since the user would select the same query images again, the relevance feedback process gets trapped in a local optimum. this local-optimum trap problem may severely impair the overall retrieval performance of today's cbir systems. in this paper, we therefore propose a simulated annealing-based approach to address this important issue. when a stuck-at-a-local-optimum occurs, we employ a neighborhood search technique (i.e., simulated annealing) to escape from the local optimum. we also propose an index structure to speed up such neighborhood search. our experimental study confirms that our approach can efficiently address the local-optimum trap problem, and therefore can improve the effectiveness of existing cbir systems.
special track on agent-oriented programming, systems, languages, and applications (apsla): editorial message. the requirements of distributed software systems become increasingly complex. among the aspects that characterize such a complexity are the inherent distribution of resources and activity - that makes global control practically infeasible and emphasizes the need for decentralized control - and the highly dynamic and changing operating conditions in which today's distributed applications operate - that calls for open and adaptive software.