Articles de revista
http://hdl.handle.net/2117/3093
Wed, 29 Jul 2015 01:15:21 GMT2015-07-29T01:15:21ZThe ordering principle in a fragment of approximate counting
http://hdl.handle.net/2117/28288
The ordering principle in a fragment of approximate counting
Atserias Peri, Albert; Thapen, Neil
The ordering principle states that every finite linear order has a least element. We show that, in the relativized setting, the surjective weak pigeonhole principle for polynomial time functions does not prove a Herbrandized version of the ordering principle over T-2(1). This answers an open question raised in Buss et al. [2012] and completes their program to compare the strength of Jerabek's bounded arithmetic theory for approximate counting with weakened versions of it.
Wed, 01 Jan 2014 00:00:00 GMThttp://hdl.handle.net/2117/282882014-01-01T00:00:00ZProcess discovery algorithms using numerical abstract domains
http://hdl.handle.net/2117/28272
Process discovery algorithms using numerical abstract domains
Carmona Vargas, Josep; Cortadella Fortuny, Jordi
The discovery of process models from event logs has emerged as one of the crucial problems for enabling the continuous support in the life-cycle of an information system. However, in a decade of process discovery research, the algorithms and tools that have appeared are known to have strong limitations in several dimensions. The size of the logs and the formal properties of the model discovered are the two main challenges nowadays. In this paper we propose the use of numerical abstract domains for tackling these two problems, for the particular case of the discovery of Petri nets. First, numerical abstract domains enable the discovery of general process models, requiring no knowledge (e.g., the bound of the Petri net to derive) for the discovery algorithm. Second, by using divide and conquer techniques we are able to control the size of the process discovery problems. The methods proposed in this paper have been implemented in a prototype tool and experiments are reported illustrating the significance of this fresh view of the process discovery problem.
Mon, 01 Dec 2014 00:00:00 GMThttp://hdl.handle.net/2117/282722014-12-01T00:00:00ZFirefighting as a game
http://hdl.handle.net/2117/28172
Firefighting as a game
Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Molter, Hendrik
The Firefighter Problem was proposed in 1995 [16] as a deterministic discrete-time model for the spread (and containment) of a fire. Its applications reach from real fires to the spreading of diseases and the containment of floods. Furthermore, it can be used to model the spread of computer viruses or viral marketing in communication networks.
In this work, we study the problem from a game-theoretical perspective. Such a context seems very appropriate when applied to large networks, where entities may act and make decisions based on their own interests, without global coordination.
We model the Firefighter Problem as a strategic game where there is one player for each time step who decides where to place the firefighters. We show that the Price of Anarchy is linear in the general case, but at most 2 for trees. We prove that the quality of the equilibria improves when allowing coalitional cooperation among players. In general, we have that the Price of Anarchy is in T(n/k) where k is the coalition size. Furthermore, we show that there are topologies which have a constant Price of Anarchy even when constant sized coalitions are considered.
Wed, 10 Dec 2014 00:00:00 GMThttp://hdl.handle.net/2117/281722014-12-10T00:00:00ZLower bounds for DNF-refutations of a relativized weak pigeonhole principle
http://hdl.handle.net/2117/28085
Lower bounds for DNF-refutations of a relativized weak pigeonhole principle
Atserias Peri, Albert; Müller, Moritz; Oliva Valls, Sergi
The relativized weak pigeonhole principle states that if at least 2n out of n(2) pigeons fly into n holes, then some hole must be doubly occupied. We prove that every DNF-refutation of the CNF encoding of this principle requires size 2((log n)3/2-is an element of) for every is an element of > 0 and every sufficiently large n. By reducing it to the standard weak pigeonhole principle with 2n pigeons and n holes, we also show that this lower bound is essentially tight in that there exist DNF-refutations of size 2((log n)O(1)) even in R(log). For the lower bound proof we need to discuss the existence of unbalanced low-degree bipartite expanders satisfying a certain robustness condition.
Mon, 01 Jun 2015 00:00:00 GMThttp://hdl.handle.net/2117/280852015-06-01T00:00:00ZBounded-width QBF is PSPACE-complete
http://hdl.handle.net/2117/27300
Bounded-width QBF is PSPACE-complete
Atserias Peri, Albert; Oliva Valls, Sergi
Tree-width and path-width are two well-studied parameters of structures that measure their similarity to a tree and a path, respectively. We show that QBF on instances with constant path-width, and hence constant tree-width, remains PSPACE-complete. This answers a question by Vardi. We also show that on instances with constant path-width and a very slow-growing number of quantifier alternations (roughly inverse-Ackermann many in the number of variables), the problem remains NP-hard. Additionally, we introduce a family of formulas with bounded tree-width that do have short refutations in Q-resolution, the natural generalization of resolution for quantified Boolean formulas.
Sat, 01 Nov 2014 00:00:00 GMThttp://hdl.handle.net/2117/273002014-11-01T00:00:00ZA boolean rule-based approach for manufacturability-aware cell routing
http://hdl.handle.net/2117/27267
A boolean rule-based approach for manufacturability-aware cell routing
Cortadella Fortuny, Jordi; Petit Silvestre, Jordi; Gómez Fernández, Sergio; Moll Echeto, Francisco de Borja
An approach for cell routing using gridded design rules is proposed. It is technology-independent and parameterizable for different fabrics and design rules, including support for multiple-patterning lithography. The core contribution is a detailed-routing algorithm based on a Boolean formulation of the problem. The algorithm uses a novel encoding scheme, graph theory to support floating terminals, efficient heuristics to reduce the computational cost, and minimization of the number of unconnected pins in case the cell is unroutable. The versatility of the algorithm is demonstrated by routing single-and double-height cells. The efficiency is ascertained by synthesizing a library with 127 cells in about one hour and a half of CPU time. The layouts derived by the implemented tool have also been compared with the ones from a commercial library; thus, showing the competitiveness of the approach for gridded geometries.
Sat, 01 Mar 2014 00:00:00 GMThttp://hdl.handle.net/2117/272672014-03-01T00:00:00ZArea-optimal transistor folding for 1-D gridded cell design
http://hdl.handle.net/2117/27265
Area-optimal transistor folding for 1-D gridded cell design
Cortadella Fortuny, Jordi
The 1-D design style with gridded design rules is gaining ground for addressing the printability issues in subwavelength photolithography. One of the synthesis problems in cell generation is transistor folding, which consists of breaking large transistors into smaller ones (legs) that can be placed in the active area of the cell. In the 1-D style, diffusion sharing between differently sized transistors is not allowed, thus implying a significant area overhead when active areas with different sizes are required. This paper presents a new formulation of the transistor folding problem in the context of 1-D design style and a mathematical model that delivers area-optimal solutions. The mathematical model can be customized for different variants of the problem, considering flexible transistor sizes and multiple-height cells. An innovative feature of the method is that area optimality can be guaranteed without calculating the actual location of the transistors. The model can also be enhanced to deliver solutions with good routability properties.
Fri, 01 Nov 2013 00:00:00 GMThttp://hdl.handle.net/2117/272652013-11-01T00:00:00ZPartially definable forcing and bounded arithmetic
http://hdl.handle.net/2117/27193
Partially definable forcing and bounded arithmetic
Atserias Peri, Albert; Müller, Moritz
We describe a method of forcing against weak theories of arithmetic and its applications in propositional proof complexity.
Sun, 01 Feb 2015 00:00:00 GMThttp://hdl.handle.net/2117/271932015-02-01T00:00:00ZTrustworthiness in P2P: performance behaviour of two fuzzy-based systems for JXTA-overlay platform
http://hdl.handle.net/2117/27102
Trustworthiness in P2P: performance behaviour of two fuzzy-based systems for JXTA-overlay platform
Spaho, Evjola; Sakamoto, Shinji; Barolli, Leonard; Xhafa Xhafa, Fatos; Ikeda, Makoto
Peer-to-peer (P2P) networks, will be very important for future distributed systems and applications. In such networks, peers are heterogeneous in providing the services and they do not have the same competence of reliability. Therefore, it is necessary to estimate whether a peer is trustworthy or not for file sharing and other services. In this paper, we propose two fuzzy-based trustworthiness system for P2P communication in JXTA-overlay. System 1 has only one fuzzy logic controller (FLC) and uses four input parameters: mutually agreed behaviour (MAB), actual behaviour criterion (ABC), peer disconnections (PD) and number of uploads (NU) and the output is peer reliability (PR). System 2 has two FLCs. In FLC1 use three input parameters: number of jobs (NJ), number of connections (NC) and connection lifetime (CL) and the output is actual behavioural criterion (ABC). We use ABC and reputation (R) as input linguistic parameters for FLC2 and the output is peer reliability (PR). We evaluate the proposed systems by computer simulations. The simulation results show that the proposed systems have a good behaviour and can be used successfully to evaluate the reliability of the new peer connected in JXTA-overlay.
Mon, 01 Sep 2014 00:00:00 GMThttp://hdl.handle.net/2117/271022014-09-01T00:00:00ZMeasuring precision of modeled behavior
http://hdl.handle.net/2117/26715
Measuring precision of modeled behavior
Adriansyah, Arya; Muñoz Gama, Jorge; Carmona Vargas, Josep; Van Dongen, Boudewijn; van der Aalst, Wil M. P.
Conformance checking techniques compare observed behavior (i.e., event logs) with modeled behavior for a variety of reasons. For example, discrepancies between a normative process model and recorded behavior may point to fraud or inefficiencies. The resulting diagnostics can be used for auditing and compliance management. Conformance checking can also be used to judge a process model automatically discovered from an event log. Models discovered using different process discovery techniques need to be compared objectively. These examples illustrate just a few of the many use cases for aligning observed and modeled behavior. Thus far, most conformance checking techniques focused on replay fitness, i.e., the ability to reproduce the event log. However, it is easy to construct models that allow for lots of behavior (including the observed behavior) without being precise. In this paper, we propose a method to measure precision of process models, given their event logs by first aligning the logs to the models. This way, the measurement is not sensitive to non-fitting executions and more accurate values can be obtained for non-fitting logs. Furthermore, we introduce several variants of the technique to deal better with incomplete logs and reduce possible bias due to behavioral property of process models. The approach has been implemented in the ProM 6 framework and tested against both artificial and real-life cases. Experiments show that the approach is robust to noise and applicable to handle logs and models of real-life complexity.
Sun, 01 Feb 2015 00:00:00 GMThttp://hdl.handle.net/2117/267152015-02-01T00:00:00Z