pinecone/core-2020-05-10-deduplication huggingface dataset:
Service Selection Based on Non-functional Properties

This is the author's final draft of the paper published as Lecture Notes in Computer Science, 2009, 4907, pp. 128-138, and presented at the Service-Oriented Computing - ICSOC 2007 Workshops.  The original publication is available at www.springerlink.com.  Doi: 10.1007/978-3-540-93851-4_13Service-oriented Architecture supports software to be composed from services dynamically. Selecting and composing appropriate services according to business process, policies and non-functional constraints is an essential challenge. This paper proposes a method for automatic selection of the most relevant service for composition based on non-functional properties and the user’s context. In doing this we also propose a method of obtaining and evaluating non-functional aspects
StPowla: SOA, Policies and Workflows

This is the author's final draft of the paper published as Lecture Notes in Computer Science, 2009, 4907, pp. 351-362, and presented at the Service-Oriented Computing - ICSOC 2007 Workshops. The original publication is available at www.springerlink.com.  Doi: 10.1007/978-3-540-93851-4_35We introduce StPowla, a workflow based approach to business process modelling that integrates a simple graphical notation, to ease the presentation of the core business process, a user–friendly policy language, Appel, to provide the necessary adaptation to the varied expectations of the various business stakeholders, and the Service Oriented Architecture, to assemble and orchestrate available services in the business process. We illustrate the approach with a loan approval process
The regulation of hybrids and chimeras in the UK.

In this report, we will, for the most part, sidestep discussion of how “chimeras” and “hybrids” are to be defined and distinguished, by simply focusing on the UK’s regulation of the activities that CHIMBRIDS has identified as its concern. These are activities that involve “the fusion of human and non-human tissue and cells”, and include human/non-human:\ud
\ud
* transplantation (i.e. xenotransplantation)\ud
* gamete mixing\ud
* somatic cell nuclear transfer (into an enucleated ovum)\ud
* zygote genetic modification\ud
* embryonic cell transfer/fusion.\ud
\ud
We will address each of these possibilities before addressing patent regulation and the wider ethico-cultural background of the UK regulatory position
An Optimization Approach to Weak Approximation of Lévy-Driven Stochastic Differential Equations

This is the authors' final draft of the paper published as Lecture Notes in Control and Information Sciences, 2010, 398, pp. 263-272.  The original publication is available at www.springerlink.com.  Doi: 10.1007/978-3-540-93918-4We propose an optimization approach to weak approximation of Lévy-driven stochastic differential equations. We employ a mathematical programming framework to obtain numerically upper and lower bound estimates of the target expectation, where the optimization procedure ends up with a polynomial programming problem. An advantage of our approach is that all we need is a closed form of the Lévy measure, not the exact simulation knowledge of the increments or of a shot noise representation for the time discretization approximation. We also investigate methods for approximation at some different intermediate time points simultaneously
On the unification of process semantics: observational semantics

The complexity of parallel systems has produced a large collection of semantics for processes. Van Glabbeek’s linear time-branching time spectrum provides a classification of most of these semantics; however, no suitable unified definitions were available. We have discovered how to unify them, both in an observational framework and in an equational framework. In this first part of our study we present the observational semantics, that stresses the differences between the simulation (branching) semantics and the extentional (linear) semantics. As a result we rediscover the classification in van Glabbeek’s spectrum and shed light on it, obtaining a framework where we can consider all the semantics in the spectrum at the same time. Also, we have discovered some “lost links” that correspond to semantics, possibly not too interesting (at the moment), that provide a clearer picture of the spectrum
When Analysis Fails: Heuristic Mechanism Design via Self-Correcting Procedures

Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multi-agent systems despite private information, self-interest and limited computational resources. CMD finds application in many settings, in the public sector for wireless spectrum and airport landing rights, to Internet advertising, to expressive sourcing in the supply chain, to allocating computational resources. In meeting the demands for CMD in these rich domains, we often need to bridge from the theory of economic mechanism design to the practice of deployable, computational mechanisms. A compelling example of this need arises in dynamic combinatorial environments, where classic analytic approaches fail and heuristic, computational approaches are required. In this talk I outline the direction of self-correcting mechanisms, which dynamically modify decisions via “output ironing" to ensure truthfulness and provide a fully computational approach to mechanism design. For an application, I suggest heuristic mechanisms for dynamic auctions in which bids arrive over time and supply may also be uncertain.Engineering and Applied Science
The influence of chain orientation in the electric behaviour of polymer diodes

Recently some experimental results have showed that the spatial alignment of conjugated polymer chains on nanometre length scales can influence the behaviour of polymer-based electronic devices, such as light-emitting diodes, field effect transistors, and photovoltaic cells. The effects of chain orientation at electrode-polymer interfaces on the charge injection process and charge mobility through the polymer layer are not well understood. In this work we use a generalized dynamical Monte Carlo method to study the influence of different polymer chain orientation relative to the electrodes surface on the electric behaviour of single-layer polymer diode, namely density current and charge
density.Fundação para a Ciência e a Tecnologia (FCT) - POCTI/CTM/41574/2001; CONC-REEQ/443/EEI/2005; SFRH/BD/22143/2005FEDE
Static Timing Model Extraction for Combinational Circuits

For large circuits, static timing analysis (STA) needs to be performed in a
hierarchical manner to achieve higher performance in arrival time propagation.
In hierarchical STA, efficient and accurate timing models of sub-modules need
to be created. We propose a timing model extraction method that significantly
reduces the size of timing models without losing any accuracy by removing
redundant timing information. Circuit components which do not contribute to the
delay of any input to output pair are removed. The proposed method is
deterministic. Compared to the original models, the numbers of edges and
vertices of the resulting timing models are reduced by 84% and 85% on average,
respectively, which are significantly more than the results achieved by other
methods.Comment: International Workshop on Power and Timing Modeling, Optimization and
  Simulation (PATMOS), 200
An ant colony algorithm for time-dependent vehicle routing problem with\ud
time windows

In this paper, we address the Vehicle Routing Problem with Time Windows, both time-independent and -dependent cases. In the timeindependent case, our objective is to minimize the total distance. To solve this problem, we propose an Ant Colony Optimization algorithm. Then we implement the algorithm to solve the time-dependent case where the objective is to minimize the total tour time. The time dependency is embedded in this model by using a deterministic travel speed function which is a step function of the time of the day. An experimental evaluation of the proposed approach is performed on the well-known benchmark problems Optimizing a distribution network has been and remains an important challenge both in the literature and in real-life applications and the routing of a eet of vehicles is the most widely addressed problem in a distribution network. The Vehicle Routing Problem (VRP) determines a set of vehicle routes originating and terminating at a single depot such that all customers are visited exactly once and the total demand of the customers assigned to each route does not violate the capacity of the vehicle. The objective is to minimize the total distance traveled. An implicit primary objective is to use the least number of vehicles. The Vehicle Routing Problem with Time Windows (VRPTW) is a variant of VRP in which lower and upper limits are imposed to the delivery time of each customer. The arrival at a customer outside the specified delivery time is either penalized (soft time windows) or strictly forbidden (hard time windows). The interested reader is referred to [1] for more details on VRPTW. In the Stochastic Vehicle Routing Problem, the customer demands and/or the travel times between the customers may vary. Although stochastic travel times and demand distributions have been frequently used in the literature, time-varying travel speeds and time-dependent VRPTW (TDVRPTW) have seldom been addressed. In the literature, time dependency is taken into consideration in two ways: stochastic travel times and deterministic travel times. First introduced by [2], stochastic travel times are mainly examined by [4] and [3]. [5] proposeda deterministic travel time based model in which the important nonpassing property is introduced. [6] and [7] also use deterministic travel times in a setting where the day is divided into time intervals. \u
A new model and tabu search approach for planning the emergency service stations

The location planning of emergency service stations is crucial, especially in the populated cities with heavy tra±c conditions such as Istanbul. In this paper, we propose a Backup Double Covering Model (BDCM), a variant of the well-known Maximal Covering Location Problem, that requires two types of services to plan the emergency service stations. The objective of the model is to maximize the total population serviced using two distinct emergency service stations in di®erent time limits where the total number of stations is limited. We propose a Tabu Search (TS) approach to solve the problem. We conduct an extensive experimental study on randomly generated data set with di®erent parameters to demonstrate the e®ectiveness of the proposed algorithm. Finally, we apply our TS approach for planning the emergency service stations in Istanbul
Report: Extensibility and implementation independence of the .NET cryptographic API

When a vulnerability is discovered in a cryptographic algorithm, or in a specific implementation of that algorithm, it is important that software using that algorithm or implementation is upgraded quickly. Hence, modern cryptographic libraries such as the .NET crypto libraries are designed to be extensible with new algorithms. In addition, they also support algorithm and implementation independent use. Software written against these libraries can be implemented such that switching to a new crypto algorithm or implementation requires very little effort.

This paper reports on our experiences with the implementation of a number of extensions to the .NET cryptographic framework. The extensions we consider are smart card based implementations of existing algorithms. We evaluate the extensibility of the libraries, and the support for implementation independence. We identify several problems with the libraries that have a negative impact on these properties, and we propose solutions.

The main conclusion of the paper is that extensibility and implementation independence can be substantially improved with only minor changes. These changes maintain backwards compatibility for client code.status: publishe
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

We present a linear-time algorithm for solving the simulta- neous embedding problem with ﬁxed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one cycle) by reducing it to the following embedding problem: Given a planar graph G, a cycle C of G, and a partitioning of the remaining vertices of G, does there exist a planar embedding in which the induced subgraph on each vertex partite of G C is contained entirely inside or outside C ? For the latter prob- lem, we present an algorithm that is based on SPQR-trees and has linear running time. We also show how we can employ SPQR-trees to decide SEFE for two planar graphs where one graph has at most two cycles and the intersection is a pseudoforest in linear time. These results give rise to our hope that our SPQR-tree approach might eventually lead to a polynomial-time algorithm for deciding the general SEFE problem for two planar graphs
Challenges in the specification of full contracts

Partially supported by the Nordunet3 project “COSoDIS”.The complete specification of full contracts - contracts which include tolerated exceptions, and which enable reasoning about the contracts themselves, can be achieved using a combination of temporal and deontic concepts. In this paper we discuss the challenges in combining deontic and other relevant logics, in particular focusing on operators for choice, obligations over sequences, contrary-to-duty obligations, and how internal and external decisions may be incorporated in an action-based language for specifying contracts. We provide different viable interpretations and approaches for the development of such a sound logic and outline challenges for the future.peer-reviewe
Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B

This paper introduces action refinement in the context of CSP||B. Our motivation to include this notion of refinement within the CSP parallel to B framework is the desire to increase flexibility in the refinement process. We introduce the ability to change the events of a CSP process and the B machines when refining a system. Notions of refinement based on traces and on traces/divergences are introduced in which abstract, events arc, refined by sequences of concrete events. A complementary notion of refinement between B machines is also introduced, yielding compositionality results for refinement of CSP parallel to B controlled components. The paper also introduces a notion of I/O refinement into our action refinement framework
Stochastic motion planning and applications to traffic

This paper presents a stochastic motion planning algorithm and its application to traffic navigation. The algorithm copes with the uncertainty of road traffic conditions by stochastic modeling of travel delay on road networks. The algorithm determines paths between two points that optimize a cost function of the delay probability distribution. It can be used to find paths that maximize the probability of reaching a destination within a particular travel deadline. For such problems, standard shortest-path algorithms don’t work because the optimal substructure property doesn’t hold. We evaluate our algorithm using both simulations and real-world drives, using delay data gathered from a set of taxis equipped with GPS sensors and a wireless network. Our algorithm can be integrated into on-board navigation systems as well as route-finding Web sites, providing drivers with good paths that meet their desired goals.National Science Foundation (U.S.) (grant EFRI-0710252)National Science Foundation (U.S.) (grant IIS-0426838
Identification of practically visible spatial objects in natural environments

Image retrieval of landscape photographs requires accurate annotation using multi-faceted descriptions relating to the subject and content of the photograph. The subject of such photographs is dominantly the terrain and spatial objects visible from the photographer’s viewpoint. While some spatial objects in the background may be obscured by foreground vegetation, other visible spatial objects beyond a certain distance may not present noteworthy elements of the captured scene (such as distant houses). Our aim is to assess approaches to improve the identification of practically visible spatial objects for image annotation. These approaches include the consideration of the apparent spatial object size and landcover information about occluding vegetation. These inputs are used to enhance viewshed analysis to accurately identify only spatial objects practically visible and therefore likely to be notable subjects of a photograph. The two approaches are evaluated in an experiment in a semi-rural area of Switzerland, whose results indicate that visual magnitude is key in accurate identification of visible spatial objects
Detecting regulatory compliance for business process models through semantic annotations

A given business process may face a large number of regulatory obligations the process may or comply with. Providing tools and techniques through which an evaluation of the compliance degree of a given process can be undertaken is seen as a key objective in emerging business process platforms. We address this problem through a diagnostic framework that provides the ability to assess the compliance gaps present in a given process. Checking whether a process is compliant with the rules involves enumerating all reachable states and is hence, in general, a hard search problem. The approach taken here allows to provide useful diagnostic information in polynomial time. The approach is based on two underlying techniques. A conceptually faithful representation for regulatory obligations is firstly provided by a formal rule language based on a non-monotonic deontic logic of violations. Secondly, processes are formalized through semantic annotations that allow a logical state space to be created. The intersection of the two allows us to devise an efficient method to detect compliance gaps; the method guarantees to detect all obligations that will necessarily arise during execution, but that will not necessarily be fulfilled
Recursive construction and evolution of collaborative business processes

Virtual Enterprises (VEs) bring together expertise and processes of different companies to react to a market opportunity. Here we propose a novel approach to support the collaborative construction and evolution of such VEs and their business processes, comprising a model of the VE, and a set of model construction rules and operators. Our approach is based on the principles of iterative elaboration, devolved decision-making and situatedness, and achieves flexibility by treating the processes of work, coordination and selection in a uniform manner. We argue that certain assumptions behind existing approaches make them unsuitable to the business practices we observed in the target business ecosystem. We then show how the proposed approach can underpin software support for informal business practices of collaborative process construction by manufacturing SMEs
Optimum channel allocation in OFDMA multi-cell systems

This paper addresses the problem of allocating users to radio resources (i.e., sub-carriers) in the downlink of an OFDMA cellular system. We consider a classical multi-cellular environment with a realistic interference model and a margin adaptive approach, i.e., we aim at minimizing total transmission power while maintaining a certain given rate for each user. We discuss computational complexity issues of the resulting model and present a heuristic approach that finds optima under suitable conditions, or "reasonably good" solutions in the general case. Computational experiences show that, in a comparison with a commercial state-of-the-art optimization solver, our algorithm is quite effective in terms of both infeasibilities and transmitted powers and extremely efficient in terms of CPU times. Â© 2009 Springer Berlin Heidelberg
Verifying RoboCup Teams

Pocreeding of: 5th International Workshop on Model Checking and Artificial Intelligence. MOCHART-2008, Patras, Greece, july, 21st, 2008.Verification of multi-agent systems is a challenging task due to their dynamic nature, and the complex interactions between agents. An example of such a system is the RoboCup Soccer Simulator, where two teams of eleven independent agents play a game of football against each other. In the present article we attempt to verify a number of properties of RoboCup football teams, using a methodology involving testing. To accomplish such testing in an efficient manner we use the McErlang model checker, as it affords precise control of the scheduling of the agents, and provides convenient access to the internal states and actions of the agents of the football teams.This work has been partially supported by the FP7-ICT-2007-1 project ProTest (215868), a Ramón y Cajal grant from the Spanish Ministerio de Educación y Ciencia, and the Spanish national projects TRA2007-67374-C02-02, TIN2006-15660-C02- 02 (DESAFIOS) and S-0505/TIC/0407 (PROMESAS).Publicad
Fairness with an Honest Minority and a Rational Majority

We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is fair when executed with many rational parties together with a small minority of honest  parties. That is, all parties will learn the secret with high probability when the honest parties follow the protocol and the rational parties act in their own self-interest (as captured by a set-Nash analogue of trembling hand perfect equilibrium). The protocol only requires a standard (synchronous) broadcast channel, tolerates both early stopping and incorrectly computed messages, and only requires 2 rounds of communication.
Previous protocols for this problem in the cryptographic or economic models have either required an honest majority, used strong communication channels that enable simultaneous exchange of information, or settled for approximate notions of security/equilibria. They all also required a nonconstant number of rounds of communication.Engineering and Applied Science