RSS Advisory Board

RSS Validator

This service tests the validity of a Really Simple Syndication feed, checking to see that it follows the rules of the RSS specification.

Enter the URL of an RSS feed:

 

Congratulations!

[Valid RSS] This is a valid RSS feed.

Recommendations

This feed is valid, but interoperability with the widest range of feed readers could be improved by implementing the following recommendations.

  • line 8, column 4: A channel should not include both pubDate and dc:date [help]

        <dc:date>2015-05-14T07:13:43Z</dc:date>
        ^
  • line 17, column 6: An item should not include both pubDate and dc:date (50 occurrences) [help]

          <dc:date>2015-05-13T10:06:24Z</dc:date>
          ^
  • line 675, column 2: Missing atom:link with rel="self" [help]

      </channel>
      ^

Source: https://lra.le.ac.uk/feed/rss_2.0/2381/316

  1. <?xml version="1.0" encoding="UTF-8"?>
  2. <rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  3.  <channel>
  4.    <title>DSpace Community:</title>
  5.    <link>http://hdl.handle.net/2381/316</link>
  6.    <description />
  7.    <pubDate>Thu, 14 May 2015 07:13:43 GMT</pubDate>
  8.    <dc:date>2015-05-14T07:13:43Z</dc:date>
  9.    <item>
  10.      <title>Performance and energy evaluation of RESTful web services in Raspberry Pi</title>
  11.      <link>http://hdl.handle.net/2381/32267</link>
  12.      <description>Title: Performance and energy evaluation of RESTful web services in Raspberry Pi
  13. Authors: Nunes, L. H.; Nakamura, L. H. V.; De F. Vieira, H..; De O. Libardi, R. M.; De Oliveira, E. M.; Estrella, J. C.; Reiff-Marganiec, Stephan
  14. Abstract: Green computing has emerged as a hot topic leading to a need to understand energy consumption of computations. This need also extends to devices with limited resources as are common in the internet of things. RESTful services have shown their potential on such devices, but there are many choices of frameworks for their development and execution. Current research has analysed performance of the frameworks but no attention has been given to systematically studying their power consumption. In this paper we analyse the execution behaviour and power consumption of web services on devices with limited resources and make initial observations that should influence future development of web service frameworks. Specifically, we conduct experiments comparing web services in the Axis2 and CXF frameworks analysing the respective performance and power consumption. Bringing together the best features of small devices and SoC, it is possible to provide diverse, mobile and green applications - however careful selection of development environments can make significant differences in performance and energy consumption.</description>
  15.      <pubDate>Wed, 13 May 2015 10:06:24 GMT</pubDate>
  16.      <guid isPermaLink="false">http://hdl.handle.net/2381/32267</guid>
  17.      <dc:date>2015-05-13T10:06:24Z</dc:date>
  18.    </item>
  19.    <item>
  20.      <title>Observing access control policies using scrabble games</title>
  21.      <link>http://hdl.handle.net/2381/32266</link>
  22.      <description>Title: Observing access control policies using scrabble games
  23. Authors: Ahmad, S.; Abidin, S. Z. Z.; Omar, N.; Reiff-Marganiec, Stephan
  24. Abstract: Access control is concerned with the policies that manage data sharing activities. Access control plays a crucial role in application areas such as education, health and business. However, most programming languages and programming environments do not naturally provide support for implementing access control policies requiring access control policies for systems to be coded as part of the development effort. Access control management policies are high-level features so having to involve a computer programmer during deployment stages for making changes to policies is costly. In this paper, we present an abstraction of access control management policies in the form of extended scrabble in its rules. The needs of access control policies program construct for supporting this game are examined. New relevant program constructs are then incorporated into JACIE (Java-based Authoring language for Collaborative Interactive Environments). The usefulness of these program construct are being demonstrated through the extended scrabble.</description>
  25.      <pubDate>Wed, 13 May 2015 09:55:17 GMT</pubDate>
  26.      <guid isPermaLink="false">http://hdl.handle.net/2381/32266</guid>
  27.      <dc:date>2015-05-13T09:55:17Z</dc:date>
  28.    </item>
  29.    <item>
  30.      <title>Classifying Smart Objects using capabilities</title>
  31.      <link>http://hdl.handle.net/2381/32265</link>
  32.      <description>Title: Classifying Smart Objects using capabilities
  33. Authors: Pérez Hernández, Marco E.; Reiff-Marganiec, Stephan
  34. Abstract: The Internet Of Things has emerged, providing an umbrella for the increasing number of heterogeneous Smart Objects that are becoming part of our daily activities. In this scenario, classification approaches are useful to understand differences and identify opportunities of generalization and common solutions, especially when different disciplines are coming together and bringing their individual terms and concepts. We propose a novel model for classifying Smart Objects using capabilities. This five-level model, inspired in the Capability Maturity Models, aims to be simple and inclusive, separating objects with basic capabilities from those with complex ones. In addition, examples of objects for each level are provided as validation of the proposal. The model is useful to identify requirements that Smart Objects have to cover externally as they cannot themselves support them and thus it allows for clear understanding of the external support system (or Middleware) into which the smart object is embedded.</description>
  35.      <pubDate>Wed, 13 May 2015 09:46:00 GMT</pubDate>
  36.      <guid isPermaLink="false">http://hdl.handle.net/2381/32265</guid>
  37.      <dc:date>2015-05-13T09:46:00Z</dc:date>
  38.    </item>
  39.    <item>
  40.      <title>Design and implementation of fault tolerance techniques to improve QoS in SOA</title>
  41.      <link>http://hdl.handle.net/2381/32264</link>
  42.      <description>Title: Design and implementation of fault tolerance techniques to improve QoS in SOA
  43. Authors: Oliveira, E. M.; Estrella, J. C.; Kuehne, B. T.; Filho, D. M. L.; Adami, L. J.; Nunes, L. H.; Nakamura, L. H.; Libardi, R. M.; Souza, P. S. L.; Reiff-Marganiec, Stephan
  44. Abstract: Fault tolerance techniques can improve the trust of users in service oriented architectures as they can ensure data availability. This paper presents an implementation of a novel fault tolerance mechanism in a SOA architecture which simultaneously provides increased availability and better quality of service. In addition to this mechanism, a service selector using reputation ratings of the architecture components is discussed. The selection is based on information from past transactions of the components of the architecture, which allows to identify the best web services able to meet the requests of customers. The mechanisms are tested and a performance evaluation is presented to validate the results.</description>
  45.      <pubDate>Wed, 13 May 2015 09:23:28 GMT</pubDate>
  46.      <guid isPermaLink="false">http://hdl.handle.net/2381/32264</guid>
  47.      <dc:date>2015-05-13T09:23:28Z</dc:date>
  48.    </item>
  49.    <item>
  50.      <title>A semantic approach for efficient and customized management of IaaS resources</title>
  51.      <link>http://hdl.handle.net/2381/32263</link>
  52.      <description>Title: A semantic approach for efficient and customized management of IaaS resources
  53. Authors: Nakamura, L. H. V.; Estrella, J. C.; Santana, R. H. C.; Santana, M. J.; Reiff-Marganiec, Stephan
  54. Abstract: This paper presents a semantic approach to custom management of IaaS (Infrastructure as a Service) resources in a cloud computing environment requiring minimal human intervention from both the cloud provider and the user. The proposal differs from other approaches by using autonomic computing and semantic web techniques together to provide a self-configuring and self-optimizing environment that aims to satisfy SLAs (Service Level Agreements). The approach monitors the virtualized resources to guarantee a customized and optimized use based on financial criteria and energy consumption policies.</description>
  55.      <pubDate>Wed, 13 May 2015 09:15:14 GMT</pubDate>
  56.      <guid isPermaLink="false">http://hdl.handle.net/2381/32263</guid>
  57.      <dc:date>2015-05-13T09:15:14Z</dc:date>
  58.    </item>
  59.    <item>
  60.      <title>Managing access control policy from end user perspective in collaborative environment</title>
  61.      <link>http://hdl.handle.net/2381/32252</link>
  62.      <description>Title: Managing access control policy from end user perspective in collaborative environment
  63. Authors: Ahmad, S.; Omar, N.; Abidin, S. Z. Z.; Reiff-Marganiec, Stephan
  64. Abstract: Currently, collaborative environments offer unlimited data sharing for users. Data owners are poorly involved in handling their data for such environment when it deals with data policy. Normally, data access control policy consists of a resource and authorization descriptions which are assigned by the administrator. It is the responsibility of the administrator to set and specify the policy for application services. The policy details are massive and complex for administrator to handle where most of the times there will be cases of unreview services. This paper proposes a framework that allows data owners to provision policies for storing and managing their shared data with third parties. By adapting RBAC model and adding owner's interest on permissions for data operations and objects, the proposed framework will facilitate data access control whereby owners have the freedom to set their own data access policy.</description>
  65.      <pubDate>Fri, 08 May 2015 14:55:00 GMT</pubDate>
  66.      <guid isPermaLink="false">http://hdl.handle.net/2381/32252</guid>
  67.      <dc:date>2015-05-08T14:55:00Z</dc:date>
  68.    </item>
  69.    <item>
  70.      <title>HIAWSC: An Immune Algorithm Based Heuristic Web Service Composition Framework</title>
  71.      <link>http://hdl.handle.net/2381/32251</link>
  72.      <description>Title: HIAWSC: An Immune Algorithm Based Heuristic Web Service Composition Framework
  73. Authors: Xu, J.; Reiff-Marganiec, Stephan
  74. Abstract: The introduction of of web services has led to web service composition being a focus of many researchers. Composing web services using workflows is seen as the most realistic method from an industrial viewpoint. Amongst other method, the use of natural computing methods has been proposed previously to automate web service composition. The need for a fast response when computing the most suitable sequence of services is addressed in this paper. In particular, we propose a novel heuristic immune algorithm with an efficient encoding and mutation method. The algorithm involves two steps: an immune selection operation, which is maintaining antibody population diversity and the clonal selection. The use of a vaccine during the evolution provides heuristic information that accelerates the convergence. Our experimental results illustrate that the proposed heuristic immune algorithm is very effective in improving the convergence speed. We also provide a schema analysis for this method.</description>
  75.      <pubDate>Fri, 08 May 2015 14:39:51 GMT</pubDate>
  76.      <guid isPermaLink="false">http://hdl.handle.net/2381/32251</guid>
  77.      <dc:date>2015-05-08T14:39:51Z</dc:date>
  78.    </item>
  79.    <item>
  80.      <title>Performance Evaluation in a Cloud with the Provisioning of Different Resources Configurations</title>
  81.      <link>http://hdl.handle.net/2381/32250</link>
  82.      <description>Title: Performance Evaluation in a Cloud with the Provisioning of Different Resources Configurations
  83. Authors: Batista, B. G.; Estrella, J. C.; Santana, M. J.; Santana, R. H. C.; Reiff-Marganiec, Stephan
  84. Abstract: Cloud computing is a computing style where resource providers can offer on-demand services in a transparent way and clients usually pay as they go. It introduces a new level of flexibility and scalability for IT users addressing challenges such as the rapid change in IT and the need to reduce cost and time of infrastructure management. However, to be able to offer QoS guarantees without limiting the number of accepted requests, providers must be able to dynamically adjust the available resources to serve requests. This dynamic resource management is not a trivial task, bringing its own challenges related to workload and performance modelling, and deployment and monitoring of applications on virtualised IT resources. An efficient mapping between resources and applications ensures workload balancing and good resource utilization and allows to meet the QoS levels required by clients. This paper presents a performance evaluation that considers different resource configurations in a cloud environment to define which dimension of resource scaling has real impact on client applications.</description>
  85.      <pubDate>Fri, 08 May 2015 14:11:44 GMT</pubDate>
  86.      <guid isPermaLink="false">http://hdl.handle.net/2381/32250</guid>
  87.      <dc:date>2015-05-08T14:11:44Z</dc:date>
  88.    </item>
  89.    <item>
  90.      <title>Low-Latency Service Data Aggregation Using Policy Obligations</title>
  91.      <link>http://hdl.handle.net/2381/32249</link>
  92.      <description>Title: Low-Latency Service Data Aggregation Using Policy Obligations
  93. Authors: Reiff-Marganiec, Stephan; Tilly, M.; Janicke, H.
  94. Abstract: The Internet of Things, large scale sensor networks or even in social media, are now well established and their use is growing daily. Usage scenarios in these fields highlight the requirement to process, procure, and provide information with almost zero latency. This work is introducing new concepts for enabling fast communication by limiting information flow through filtering concepts combined with data processing techniques adopted from complex event processing. Specifically we introduce a novel mediation services architecture using filter policies to reduce latency. The filter policies define when and what data services need to provide to the mediator and thus save on bandwidth. The filter policies describe temporal conditions between two events removing the need to keep a complete history while still allowing temporal reasoning. Promising experimental results highlight the advantages to be gained from the approach.</description>
  95.      <pubDate>Fri, 08 May 2015 13:59:21 GMT</pubDate>
  96.      <guid isPermaLink="false">http://hdl.handle.net/2381/32249</guid>
  97.      <dc:date>2015-05-08T13:59:21Z</dc:date>
  98.    </item>
  99.    <item>
  100.      <title>PEESOS: A Web Tool for Planning and Execution of Experiments in Service Oriented Systems</title>
  101.      <link>http://hdl.handle.net/2381/32241</link>
  102.      <description>Title: PEESOS: A Web Tool for Planning and Execution of Experiments in Service Oriented Systems
  103. Authors: Nunes, L. H.; Vasconcelos Nakamura, L. H.; Tardiole Kuehne, B.; De Oliveira, E. M.; De O Libardi, R. M.; Junqueira Adami, L.; Estrella, J. C.; Reiff-Marganiec, Stephan
  104. Abstract: Performing functionality testing in service-oriented architectures is not a trivial task. The difficulty is especially the large number of components that may be present in a SOA such as brokers, providers, service registries, clients, monitoring tools, data storage tools, etc. Thus, in order to facilitate the process of conducting functional testing and capacity planning in service-oriented systems, we present PEESOS. This first version is a functional prototype that offers facilities to assist researchers and industry to test their new applications, allowing collaborations that can be done between the participants to achieve an appropriate objective when developing a new application. The first results show that it is possible to make a planning environment easier to operate and to readily obtain results for performance evaluation of a target architecture. Since this is a first version of the prototype, it has interface and scalability limitations as well as needing improvements in performance of the logs repository and also in a core engine. We hope that such limitations can be corrected in the near future, including gathering information from the scientific community to make the prototype a useful and accessible tool. PEESOS is on-line and available at http://peesos.wsarch.lasdpc.icmc.usp.br.
  105. Description: PEESOS is on-line and available at http://peesos.wsarch.lasdpc.icmc.usp.br.</description>
  106.      <pubDate>Fri, 08 May 2015 10:56:39 GMT</pubDate>
  107.      <guid isPermaLink="false">http://hdl.handle.net/2381/32241</guid>
  108.      <dc:date>2015-05-08T10:56:39Z</dc:date>
  109.    </item>
  110.    <item>
  111.      <title>Providing Quality of Service on Services Selection Using Anycast Techniques</title>
  112.      <link>http://hdl.handle.net/2381/32239</link>
  113.      <description>Title: Providing Quality of Service on Services Selection Using Anycast Techniques
  114. Authors: Adami, L. J.; Estrella, J. C.; De Oliveira, E. M.; Reiff- Marganiec, Stephan
  115. Abstract: Over the last years, the complexity and variety of services available on the Internet increased. This fact is leading to the search for efficient techniques of routing client requests to the best server available. A known technique is the application layer anycast (ALA). The main goal of this work is to elaborate efficient ways to provide ALA with quality of service in the context of cloud computing. To achieve this goal, we proposed a new algorithm (GALA, Global Application Layer Anycast). It inherits characteristics from another existing system (GAA, Global Application-layer Anycast), and uses geolocation as a differential. The results of the experiments show that GALA, compared to the inherited algorithm, maintains the client requests efficiencies and substantially lowers their latencies.</description>
  116.      <pubDate>Fri, 08 May 2015 10:48:38 GMT</pubDate>
  117.      <guid isPermaLink="false">http://hdl.handle.net/2381/32239</guid>
  118.      <dc:date>2015-05-08T10:48:38Z</dc:date>
  119.    </item>
  120.    <item>
  121.      <title>A Utility-Aware Runtime Conflict Resolver for Composite Web services</title>
  122.      <link>http://hdl.handle.net/2381/32237</link>
  123.      <description>Title: A Utility-Aware Runtime Conflict Resolver for Composite Web services
  124. Authors: Ning, X.; Xu, J.; Xu, N.; Reiff-Marganiec, Stephan
  125. Abstract: Web services are developed independently and&#xD;
  126. deployed in a distributed environment, new service can be&#xD;
  127. obtained by composing existing ones. The rapid introduction&#xD;
  128. of new services also results in undesirable interactions between&#xD;
  129. services. These conflicts are not mismatches of interfaces, but&#xD;
  130. are usually based on the data in the executing instance and&#xD;
  131. therefore runtime management of conflicts in Web services&#xD;
  132. should be considered. We study the problem from the perspective&#xD;
  133. of user’s revenue, and propose an online approach to&#xD;
  134. resolve conflicts is proposed.</description>
  135.      <pubDate>Fri, 08 May 2015 10:40:16 GMT</pubDate>
  136.      <guid isPermaLink="false">http://hdl.handle.net/2381/32237</guid>
  137.      <dc:date>2015-05-08T10:40:16Z</dc:date>
  138.    </item>
  139.    <item>
  140.      <title>Study Case of Restful Frameworks in Raspberry Pi: A Perfomance and Energy Overview</title>
  141.      <link>http://hdl.handle.net/2381/32236</link>
  142.      <description>Title: Study Case of Restful Frameworks in Raspberry Pi: A Perfomance and Energy Overview
  143. Authors: Nunes, L. H.; Nakamura, L. H. V.; De F. Vieira, H.; De O. Libardi, R. M.; De Oliveira, E. M.; Adami, L. J.; Estrella, J. C.; Reiff-Marganiec, Stephan
  144. Abstract: This paper analyzes the execution behavior of web&#xD;
  145. services on devices with limited resources. The experiments&#xD;
  146. compare web services in the Axis2 and CXF frameworks&#xD;
  147. analyzing performance and power consumption. To determine&#xD;
  148. which framework is better suited for service provision, a testing&#xD;
  149. environment and a performance and energy evaluation between&#xD;
  150. them are presented. We show that the Raspberry Pi can be&#xD;
  151. useful in service-oriented applications for different types of&#xD;
  152. tasks. Bringing together the best features of small devices&#xD;
  153. and SoC, it is possible to provide diverse, mobile and green&#xD;
  154. applications.</description>
  155.      <pubDate>Fri, 08 May 2015 10:34:01 GMT</pubDate>
  156.      <guid isPermaLink="false">http://hdl.handle.net/2381/32236</guid>
  157.      <dc:date>2015-05-08T10:34:01Z</dc:date>
  158.    </item>
  159.    <item>
  160.      <title>Fast Selection of Web Services with QoS using a Distributed Parallel Semantic Approach</title>
  161.      <link>http://hdl.handle.net/2381/32235</link>
  162.      <description>Title: Fast Selection of Web Services with QoS using a Distributed Parallel Semantic Approach
  163. Authors: Nakamura, L. H. V.; do Prado, P. F.; de O. Libardi, R. M.; Nunes, L. H.; Estrella, J. C.; Santana, R. H. C.; Santana, M. J.; Reiff-Marganiec, Stephan
  164. Abstract: This paper presents a solution to performance&#xD;
  165. issues in the quality of service aware selection of Web services&#xD;
  166. using techniques of parallelism and mechanisms of inference&#xD;
  167. provided by Semantic Web. The results point to a significant&#xD;
  168. improvement in the speed of searching Web services and thus&#xD;
  169. makes the use of semantic resources viable in distributed&#xD;
  170. systems to provide better quality of service to the clients.</description>
  171.      <pubDate>Fri, 08 May 2015 10:25:34 GMT</pubDate>
  172.      <guid isPermaLink="false">http://hdl.handle.net/2381/32235</guid>
  173.      <dc:date>2015-05-08T10:25:34Z</dc:date>
  174.    </item>
  175.    <item>
  176.      <title>Encoding Data Structures</title>
  177.      <link>http://hdl.handle.net/2381/32217</link>
  178.      <description>Title: Encoding Data Structures
  179. Authors: Raman, Rajeev
  180. Abstract: In recent years, there has been an explosion of interest in&#xD;
  181. succinct data structures, which store the given data in compact or compressed&#xD;
  182. formats and answer queries on the data rapidly while it is still&#xD;
  183. in its compressed format. Our focus in this talk is to introduce encoding&#xD;
  184. data structures. Encoding data structures consider the data together&#xD;
  185. with the queries and aim to store only as much information about the&#xD;
  186. data as is needed to store the queries. Once this is done, the original data&#xD;
  187. can be deleted. In many cases, one can obtain space-efficient encoding&#xD;
  188. data structures even when the original data is incompressible.
  189. Description: Abstract of invited talk.</description>
  190.      <pubDate>Thu, 07 May 2015 13:20:56 GMT</pubDate>
  191.      <guid isPermaLink="false">http://hdl.handle.net/2381/32217</guid>
  192.      <dc:date>2015-05-07T13:20:56Z</dc:date>
  193.    </item>
  194.    <item>
  195.      <title>Compact Encodings and Indexes for the Nearest Larger Neighbor Problem</title>
  196.      <link>http://hdl.handle.net/2381/32215</link>
  197.      <description>Title: Compact Encodings and Indexes for the Nearest Larger Neighbor Problem
  198. Authors: Jo, S.; Raman, Rajeev; Satti, S. R.
  199. Abstract: Given a d-dimensional array, for any integer d &gt; 0, the nearest&#xD;
  200. larger value (NLV) query returns the position of the element which&#xD;
  201. is closest, in L1 distance, to the query position, and is larger than the&#xD;
  202. element at the query position. We consider the problem of preprocessing&#xD;
  203. a given array, to construct a data structure that can answer NLV queries&#xD;
  204. efficiently. In the 2-D case, given an n × n array A, we give an asymptotically&#xD;
  205. optimal O(n&#xD;
  206. 2&#xD;
  207. )-bit encoding that answers NLV queries in O(1)&#xD;
  208. time. When A is a binary array, we describe a simpler O(n&#xD;
  209. 2&#xD;
  210. )-bit encoding&#xD;
  211. that also supports NLV queries in O(1) time. Using this, we obtain&#xD;
  212. an index of size O(n&#xD;
  213. 2&#xD;
  214. /c) bits that supports NLV queries in O(c) time,&#xD;
  215. for any parameter c, where 1 ≤ c ≤ n, matching the lower bound. For&#xD;
  216. the 1-D case we consider the nearest larger right value (NLRV) problem&#xD;
  217. where the nearest larger value to the right is sought. For an array of&#xD;
  218. length n, we obtain an index that takes O((n/c) log c) bits, and supports&#xD;
  219. NLRV queries in O(c) time, for any any parameter c, where 1 ≤ c ≤ n,&#xD;
  220. improving the earlier results of Fischer et al. and Jayapaul et al.</description>
  221.      <pubDate>Thu, 07 May 2015 13:05:29 GMT</pubDate>
  222.      <guid isPermaLink="false">http://hdl.handle.net/2381/32215</guid>
  223.      <dc:date>2015-05-07T13:05:29Z</dc:date>
  224.    </item>
  225.    <item>
  226.      <title>MSSF: A step towards user-friendly multi-cloud data dispersal</title>
  227.      <link>http://hdl.handle.net/2381/32118</link>
  228.      <description>Title: MSSF: A step towards user-friendly multi-cloud data dispersal
  229. Authors: Libardi, R. M. de O.; Bedo, M. V. N.; Reiff-Marganiec, Stephan; Estrella, Julio C.
  230. Abstract: With an increasing number of companies and individuals&#xD;
  231. adopting cloud computing for their data needs. Naturally,&#xD;
  232. there is a shift in financial and operational costs and and provided&#xD;
  233. services should meet users’ performance and cost expectations.&#xD;
  234. We focus on storage and propose MSSF, a Multi-cloud Storage&#xD;
  235. Selection Framework. MSSF contains a basic set of algorithms,&#xD;
  236. a set of security rules and a formal definition of user profiles&#xD;
  237. allowing to fit cloud storage services to user needs. Preliminary&#xD;
  238. experiments investigate the cost differences between two baseline&#xD;
  239. algorithms and user profile models. Considering the promising&#xD;
  240. initial results we provide several observations about the MSSF&#xD;
  241. decision making process that will help with future improvements.</description>
  242.      <pubDate>Wed, 06 May 2015 12:06:35 GMT</pubDate>
  243.      <guid isPermaLink="false">http://hdl.handle.net/2381/32118</guid>
  244.      <dc:date>2015-05-06T12:06:35Z</dc:date>
  245.    </item>
  246.    <item>
  247.      <title>Survey of Aspect-Oriented Analysis and Design Approaches</title>
  248.      <link>http://hdl.handle.net/2381/32112</link>
  249.      <description>Title: Survey of Aspect-Oriented Analysis and Design Approaches
  250. Authors: Chitchyan, Ruzanna; Rashid, A.; Sawyer, P.; Garcia, A.; Alarcon, M. P.; Bakker, J.; Tekinerdogan, B.; Clarke, S.; Jackson, A.
  251. Abstract: A number of Aspect-Oriented (AO) Requirements, Architecture, and Design approaches have emerged recently. In this report we survey the most significant of these approaches, considering their origins, aims, and contributions. Alongside the AO approaches, we also analyse some of the contemporary non-AO work in order to bring out the differences between two sets of techniques, and to understand the potential contributions of aspect-oriented analysis and design. We also provide some initial insights into processes for AO requirements engineering, analysis and design which may serve as basis for integration of the work of the AOSD- EUROPE project partners. We also outline some issues relevant to such integration.</description>
  252.      <pubDate>Tue, 05 May 2015 11:06:43 GMT</pubDate>
  253.      <guid isPermaLink="false">http://hdl.handle.net/2381/32112</guid>
  254.      <dc:date>2015-05-05T11:06:43Z</dc:date>
  255.    </item>
  256.    <item>
  257.      <title>Tractable Probabilistic μ-Calculus that Expresses Probabilistic Temporal Logics</title>
  258.      <link>http://hdl.handle.net/2381/32065</link>
  259.      <description>Title: Tractable Probabilistic μ-Calculus that Expresses Probabilistic Temporal Logics
  260. Authors: Castro, P.; Kilmurray, C.; Piterman, Nir
  261. Abstract: We revisit a recently introduced probabilistic μ-calculus and study an expressive fragment of it. By using the probabilistic quantification as an atomic operation of the calculus we establish a connection between the calculus and obligation games. The calculus we consider is strong enough to encode well-known logics such as pCTL and pCTL*. Its game semantics is very similar to the game semantics of the classical μ-calculus (using parity obligation games instead of parity games). This leads to an optimal complexity of NP intersection co-NP for its finite model checking procedure. Furthermore, we investigate a (relatively) well-behaved fragment of this calculus: an extension of pCTL with fixed points. An important feature of this extended version of pCTL is that its model checking is only exponential w.r.t. the alternation depth of fixed points, one of the main characteristics of Kozen's μ-calculus.
  262. Description: 1998 ACM Subject Classification F.4.1 Mathematical Logic</description>
  263.      <pubDate>Fri, 24 Apr 2015 16:40:02 GMT</pubDate>
  264.      <guid isPermaLink="false">http://hdl.handle.net/2381/32065</guid>
  265.      <dc:date>2015-04-24T16:40:02Z</dc:date>
  266.    </item>
  267.    <item>
  268.      <title>Assessing and generating test sets in terms of behavioural adequacy</title>
  269.      <link>http://hdl.handle.net/2381/31971</link>
  270.      <description>Title: Assessing and generating test sets in terms of behavioural adequacy
  271. Authors: Fraser, G.; Walkinshaw, Neil
  272. Editors: Offutt, J.
  273. Abstract: Identifying a finite test set that adequately captures the essential behaviour of a program such that all faults are identified is a well-established problem. This is traditionally addressed with syntactic adequacy metrics (e.g. branch coverage), but these can be impractical and may be misleading even if they are satisfied. One intuitive notion of adequacy, which has been discussed in theoretical terms over the past three decades, is the idea of behavioural coverage: If it is possible to infer an accurate model of a system from its test executions, then the test set can be deemed to be adequate. Despite its intuitive basis, it has remained almost entirely in the theoretical domain because inferred models have been expected to be exact (generally an infeasible task) and have not allowed for any pragmatic interim measures of adequacy to guide test set generation. This paper presents a practical approach to incorporate behavioural coverage. Our bestest approach (1) enables the use of machine learning algorithms to augment standard syntactic testing approaches and (2) shows how search-based testing techniques can be applied to generate test sets with respect to this criterion. An empirical study on a selection of Java units demonstrates that test sets with higher behavioural coverage significantly outperform current baseline test criteria in terms of detected faults.</description>
  274.      <pubDate>Fri, 10 Apr 2015 10:17:43 GMT</pubDate>
  275.      <guid isPermaLink="false">http://hdl.handle.net/2381/31971</guid>
  276.      <dc:date>2015-04-10T10:17:43Z</dc:date>
  277.    </item>
  278.    <item>
  279.      <title>Fairness for Infinite-State Systems</title>
  280.      <link>http://hdl.handle.net/2381/31957</link>
  281.      <description>Title: Fairness for Infinite-State Systems
  282. Authors: Cook, B.; Khlaaf, H.; Piterman, Nir
  283. Editors: Baier, C.; Tinelli , C.
  284. Abstract: In this paper we introduce the first known tool for symbolically proving fair-CTL properties of (infinite-state) integer programs. Our solution is based on a reduction to existing techniques for fairness- free CTL model checking via the use of infinite non-deterministic branching to symbolically partition fair from unfair executions. We show the viability of our approach in practice using examples drawn from device drivers and algorithms utilizing shared resources.
  285. Description: See also Research Note RN/14/11 UCL Department of Computer Science.</description>
  286.      <pubDate>Wed, 08 Apr 2015 09:51:07 GMT</pubDate>
  287.      <guid isPermaLink="false">http://hdl.handle.net/2381/31957</guid>
  288.      <dc:date>2015-04-08T09:51:07Z</dc:date>
  289.    </item>
  290.    <item>
  291.      <title>From Communicating Machines to Graphical Choreographies</title>
  292.      <link>http://hdl.handle.net/2381/31932</link>
  293.      <description>Title: From Communicating Machines to Graphical Choreographies
  294. Authors: Lange, Julien; Tuosto, Emilio; Yoshida, Nobuko
  295. Editors: Rajamani, S. K.; Walker, D.
  296. Abstract: Graphical choreographies, or global graphs, are general multiparty session specifications featuring expressive constructs such as forking, merging, and joining for representing application-level protocols. Global graphs can be directly translated into modelling notations such as BPMN and UML. This paper presents an algorithm whereby a global graph can be constructed from asynchronous interactions represented by communicating finite-state machines (CFSMs). Our results include: a sound and complete characterisation of a subset of safe CFSMs from which global graphs can be constructed; an algorithm to translate CFSMs to global graphs; a time complexity analysis; and an implementation of our theory, as well as an experimental evaluation.</description>
  297.      <pubDate>Fri, 27 Mar 2015 15:38:12 GMT</pubDate>
  298.      <guid isPermaLink="false">http://hdl.handle.net/2381/31932</guid>
  299.      <dc:date>2015-03-27T15:38:12Z</dc:date>
  300.    </item>
  301.    <item>
  302.      <title>Resolving non-determinism in choreographies</title>
  303.      <link>http://hdl.handle.net/2381/31873</link>
  304.      <description>Title: Resolving non-determinism in choreographies
  305. Authors: Bocchi, L.; Melgratti, H.; Tuosto, Emilio
  306. Abstract: Resolving non-deterministic choices of choreographies is a crucial task. We introduce a novel notion of realisability for choreographies -called whole-spectrum implementation- that rules out deterministic implementations of roles that, no matter which context they are placed in, will never follow one of the branches of a non-deterministic choice. We show that, under some conditions, it is decidable whether an implementation is whole-spectrum. As a case study, we analyse the POP protocol under the lens of whole-spectrum implementation. © 2014 Springer-Verlag.</description>
  307.      <pubDate>Mon, 16 Mar 2015 11:59:32 GMT</pubDate>
  308.      <guid isPermaLink="false">http://hdl.handle.net/2381/31873</guid>
  309.      <dc:date>2015-03-16T11:59:32Z</dc:date>
  310.    </item>
  311.    <item>
  312.      <title>Inferring Extended Finite State Machine Models from Software Executions</title>
  313.      <link>http://hdl.handle.net/2381/31765</link>
  314.      <description>Title: Inferring Extended Finite State Machine Models from Software Executions
  315. Authors: Walkinshaw, Neil; Taylor, R.; Derrick, J.
  316. Editors: Robbes, R.; Oliveto, R.; Di Penta, M.
  317. Abstract: The ability to reverse-engineer models of software behaviour is valuable for a wide range of software maintenance, validation and verification tasks. Current reverse-engineering techniques focus either on control-specific behaviour (e.g., in the form of Finite State Machines), or data-specific behaviour (e.g., as pre / post-conditions or invariants). However, typical software behaviour is usually a product of the two; models must combine both aspects to fully represent the software's operation. Extended Finite State Machines (EFSMs) provide such a model. Although attempts have been made to infer EFSMs, these have been problematic. The models inferred by these techniques can be non-deterministic, the inference algorithms can be inflexible, and only applicable to traces with specific characteristics. This paper presents a novel EFSM inference technique that addresses the problems of inflexibility and non-determinism. It also adapts an experimental technique from the field of Machine Learning to evaluate EFSM inference techniques, and applies it to three diverse software systems.</description>
  318.      <pubDate>Wed, 04 Mar 2015 16:59:57 GMT</pubDate>
  319.      <guid isPermaLink="false">http://hdl.handle.net/2381/31765</guid>
  320.      <dc:date>2015-03-04T16:59:57Z</dc:date>
  321.    </item>
  322.    <item>
  323.      <title>Minimum Spanning Tree Verification under Uncertainty</title>
  324.      <link>http://hdl.handle.net/2381/31666</link>
  325.      <description>Title: Minimum Spanning Tree Verification under Uncertainty
  326. Authors: Erlebach, Thomas R.; Hoffmann, Michael
  327. Abstract: In the verification under uncertainty setting, an algorithm is given, for each input item, an uncertainty area that is guaranteed to contain the exact input value, as well as an assumed input value. An update of an input item reveals its exact value. If the exact value is equal to the assumed value, we say that the update verifies the assumed value. We consider verification under uncertainty for the minimum spanning tree (MST) problem for undirected weighted graphs, where each edge is associated with an uncertainty area and an assumed edge weight. The objective of an algorithm is to compute the smallest set of updates with the property that, if the updates of all edges in the set verify their assumed weights, the edge set of an MST can be computed. We give a polynomial-time optimal algorithm for the MST verification problem by relating the choices of updates to vertex covers in a bipartite auxiliary graph. Furthermore, we consider an alternative uncertainty setting where the vertices are embedded in the plane, the weight of an edge is the Euclidean distance between the endpoints of the edge, and the uncertainty is about the location of the vertices. An update of a vertex yields the exact location of that vertex. We prove that the MST verification problem in this vertex uncertainty setting is NP-hard. This shows a surprising difference in complexity between the edge and vertex uncertainty settings of the MST verification problem.</description>
  328.      <pubDate>Fri, 13 Feb 2015 11:59:12 GMT</pubDate>
  329.      <guid isPermaLink="false">http://hdl.handle.net/2381/31666</guid>
  330.      <dc:date>2015-02-13T11:59:12Z</dc:date>
  331.    </item>
  332.    <item>
  333.      <title>Query-competitive algorithms for cheapest set problems under uncertainty</title>
  334.      <link>http://hdl.handle.net/2381/31664</link>
  335.      <description>Title: Query-competitive algorithms for cheapest set problems under uncertainty
  336. Authors: Erlebach, Thomas; Hoffmann, Michael; Kammer, F.
  337. Abstract: Considering the model of computing under uncertainty where element weights are uncertain but can be obtained at a cost by query operations, we study the problem of identifying a cheapest (minimum-weight) set among a given collection of feasible sets using a minimum number of queries of element weights. For the general case we present an algorithm that makes at most d·OPT+d queries, where d is the maximum cardinality of any given set and OPT is the optimal number of queries needed to identify a cheapest set. For the minimum multi-cut problem in trees with d terminal pairs, we give an algorithm that makes at most d·OPT+1 queries. For the problem of computing a minimum-weight base of a given matroid, we give an algorithm that makes at most 2·OPT queries, generalizing a known result for the minimum spanning tree problem. For each of our algorithms we give matching lower bounds.</description>
  338.      <pubDate>Fri, 13 Feb 2015 10:03:39 GMT</pubDate>
  339.      <guid isPermaLink="false">http://hdl.handle.net/2381/31664</guid>
  340.      <dc:date>2015-02-13T10:03:39Z</dc:date>
  341.    </item>
  342.    <item>
  343.      <title>Computational complexity of traffic hijacking under BGP and S-BGP</title>
  344.      <link>http://hdl.handle.net/2381/31661</link>
  345.      <description>Title: Computational complexity of traffic hijacking under BGP and S-BGP
  346. Authors: Chiesa, M.; Di Battista, G.; Patrignani, M.; Erlebach, Thomas
  347. Abstract: Harmful Internet hijacking incidents put in evidence how fragile the Border Gateway Protocol (BGP) is, which is used to exchange routing information between Autonomous Systems (ASes). As proved by recent research contributions, even S-BGP, the secure variant of BGP that is being deployed, is not fully able to blunt traffic attraction attacks. Given a traffic flow between two ASes, we study how difficult it is for a malicious AS to devise a strategy for hijacking or intercepting that flow. We show that this problem marks a sharp difference between BGP and S-BGP. Namely, while it is solvable, under reasonable assumptions, in polynomial time for the type of attacks that are usually performed in BGP, it is NP-hard for S-BGP. Our study has several by-products. E.g., we solve a problem left open in the literature, stating when performing a hijacking in S-BGP is equivalent to performing an interception.</description>
  348.      <pubDate>Thu, 12 Feb 2015 15:21:43 GMT</pubDate>
  349.      <guid isPermaLink="false">http://hdl.handle.net/2381/31661</guid>
  350.      <dc:date>2015-02-12T15:21:43Z</dc:date>
  351.    </item>
  352.    <item>
  353.      <title>Approximation algorithms for disjoint st-paths with minimum activation cost</title>
  354.      <link>http://hdl.handle.net/2381/31648</link>
  355.      <description>Title: Approximation algorithms for disjoint st-paths with minimum activation cost
  356. Authors: Alqahtani, Hasna Mohsen; Erlebach, Thomas
  357. Abstract: In network activation problems we are given a directed or undirected graph G = (V,E) with a family {f (x, x) : (u,v) ∈ E} of monotone non-decreasing activation functions from D to {0,1}, where D is a constant-size domain. The goal is to find activation values x for all v ∈ V of minimum total cost Σ x such that the activated set of edges satisfies some connectivity requirements. Network activation problems generalize several problems studied in the network literature such as power optimization problems. We devise an approximation algorithm for the fundamental problem of finding the Minimum Activation Cost Pair of Node-Disjoint st-Paths (MA2NDP). The algorithm achieves approximation ratio 1.5 for both directed and undirected graphs. We show that a ρ-approximation algorithm for MA2NDP with fixed activation values for s and t yields a ρ-approximation algorithm for the Minimum Activation Cost Pair of Edge-Disjoint st-Paths (MA2EDP) problem. We also study the MA2NDP and MA2EDP problems for the special case |D| = 2.</description>
  358.      <pubDate>Wed, 11 Feb 2015 13:28:34 GMT</pubDate>
  359.      <guid isPermaLink="false">http://hdl.handle.net/2381/31648</guid>
  360.      <dc:date>2015-02-11T13:28:34Z</dc:date>
  361.    </item>
  362.    <item>
  363.      <title>Multi-Type Display Calculus for Propositional Dynamic Logic</title>
  364.      <link>http://hdl.handle.net/2381/31644</link>
  365.      <description>Title: Multi-Type Display Calculus for Propositional Dynamic Logic
  366. Authors: Frittella, S.; Greco, G.; Kurz, Alexander; Palmigiano, A.
  367. Abstract: We introduce a multi-type display calculus for Propositional Dynamic&#xD;
  368. Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style&#xD;
  369. cut-elimination and subformula property.</description>
  370.      <pubDate>Wed, 11 Feb 2015 11:12:31 GMT</pubDate>
  371.      <guid isPermaLink="false">http://hdl.handle.net/2381/31644</guid>
  372.      <dc:date>2015-02-11T11:12:31Z</dc:date>
  373.    </item>
  374.    <item>
  375.      <title>A Multi-type Display Calculus for Dynamic Epistemic Logic</title>
  376.      <link>http://hdl.handle.net/2381/31643</link>
  377.      <description>Title: A Multi-type Display Calculus for Dynamic Epistemic Logic
  378. Authors: Frittella, S.; Greco, G.; Kurz, Alexander; Palmigiano, A.; Sikimić, V.
  379. Abstract: In the present paper, we introduce a multi-type display calculus for dynamic&#xD;
  380. epistemic logic, which we refer to as Dynamic Calculus. The displayapproach&#xD;
  381. is suitable to modularly chart the space of dynamic epistemic logics&#xD;
  382. on weaker-than-classical propositional base. The presence of types endows&#xD;
  383. the language of the Dynamic Calculus with additional expressivity, allows&#xD;
  384. for a smooth proof-theoretic treatment, and paves the way towards a general&#xD;
  385. methodology for the design of proof systems for the generality of dynamic&#xD;
  386. logics, and certainly beyond dynamic epistemic logic. We prove that&#xD;
  387. the Dynamic Calculus adequately captures Baltag-Moss-Solecki’s dynamic&#xD;
  388. epistemic logic, and enjoys Belnap-style cut elimination.</description>
  389.      <pubDate>Wed, 11 Feb 2015 11:06:46 GMT</pubDate>
  390.      <guid isPermaLink="false">http://hdl.handle.net/2381/31643</guid>
  391.      <dc:date>2015-02-11T11:06:46Z</dc:date>
  392.    </item>
  393.    <item>
  394.      <title>Establishing the Source Code Disruption Caused by Automated Remodularisation Tools</title>
  395.      <link>http://hdl.handle.net/2381/31618</link>
  396.      <description>Title: Establishing the Source Code Disruption Caused by Automated Remodularisation Tools
  397. Authors: Hall, M.; Khojaye, Muhammad; Walkinshaw, Neil; McMinn, P.
  398. Editors: Poshyvanik, D.; Zaidman, A.
  399. Abstract: Current software remodularisation tools only operate on abstractions of a software system. In this paper, we investigate the actual impact of automated remodularisation on source code using a tool that automatically applies remodularisations as refactorings. This shows us that a typical remodularisation (as computed by the Bunch tool) will require changes to thousands of lines of code, spread throughout the system (typically no code files remain untouched). In a typical multi-developer project this presents a serious integration challenge, and could contribute to the low uptake of such tools in an industrial context. We relate these findings with our ongoing research into techniques that produce iterative commit friendly code changes to address this problem.</description>
  400.      <pubDate>Thu, 05 Feb 2015 14:45:08 GMT</pubDate>
  401.      <guid isPermaLink="false">http://hdl.handle.net/2381/31618</guid>
  402.      <dc:date>2015-02-05T14:45:08Z</dc:date>
  403.    </item>
  404.    <item>
  405.      <title>A Proof-Theoretic Semantic Analysis of Dynamic Epistemic Logic</title>
  406.      <link>http://hdl.handle.net/2381/31596</link>
  407.      <description>Title: A Proof-Theoretic Semantic Analysis of Dynamic Epistemic Logic
  408. Authors: Frittella, S.; Greco, G.; Kurz, Alexander H.; Palmigiano, A.; Sikimić, V.
  409. Editors: Aucher, G.; Hjortland, O.; Roy, O.
  410. Abstract: The present article provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the best-known members of a family of logical systems that have been successfully applied to diverse scientific disciplines, but the proof-theoretic treatment of which presents many difficulties. After an illustration of the proof-theoretic semantic principles most relevant to the treatment of logical connectives, we turn to illustrating the main features of display calculi, a proof-theoretic paradigm that has been successfully employed to give a proof-theoretic semantic account of modal and substructural logics. Then, we review some of the most significant proposals of proof systems for dynamic epistemic logics, and we critically reflect on them in the light of the previously introduced proof-theoretic semantic principles. The contributions of the present article include a generalization of Belnap's cut-elimination metatheorem for display calculi, and a revised version of the display-style calculus D.EAK [30]. We verify that the revised version satisfies the previously mentioned proof-theoretic semantic principles, and show that it enjoys cut-elimination as a consequence of the generalized metatheorem.</description>
  411.      <pubDate>Wed, 04 Feb 2015 16:21:31 GMT</pubDate>
  412.      <guid isPermaLink="false">http://hdl.handle.net/2381/31596</guid>
  413.      <dc:date>2015-02-04T16:21:31Z</dc:date>
  414.    </item>
  415.    <item>
  416.      <title>Minimum activation cost node-disjoint paths in graphs with bounded treewidth</title>
  417.      <link>http://hdl.handle.net/2381/31524</link>
  418.      <description>Title: Minimum activation cost node-disjoint paths in graphs with bounded treewidth
  419. Authors: Alqahtani, Hasna Mohsen; Erlebach, Thomas
  420. Abstract: In activation network problems we are given a directed or undirected graph G = (V,E) with a family {f uv : (u,v) ∈ E} of monotone non-decreasing activation functions from D2 to {0,1}, where D is a constant-size subset of the non-negative real numbers, and the goal is to find activation values xv for all v ∈ V of minimum total cost ∑  v ∈ V x v such that the activated set of edges satisfies some connectivity requirements. We propose algorithms that optimally solve the minimum activation cost of k node-disjoint st-paths (st-MANDP) problem in O(tw ((5 + tw)|D|)2tw + 2|V|3) time and the minimum activation cost of node-disjoint paths (MANDP) problem for k disjoint terminal pairs (s 1,t 1),…,(s k ,t k ) in O(tw ((4 + 3tw)|D|)2tw + 2|V|) time for graphs with treewidth bounded by tw.</description>
  421.      <pubDate>Fri, 30 Jan 2015 12:01:13 GMT</pubDate>
  422.      <guid isPermaLink="false">http://hdl.handle.net/2381/31524</guid>
  423.      <dc:date>2015-01-30T12:01:13Z</dc:date>
  424.    </item>
  425.    <item>
  426.      <title>Nominal Lambda Calculus</title>
  427.      <link>http://hdl.handle.net/2381/31396</link>
  428.      <description>Title: Nominal Lambda Calculus
  429. Authors: Nebel, Frank
  430. Abstract: Since their introduction, nominal techniques have been widely applied in computer&#xD;
  431. science to reason about syntax of formal systems involving name-binding operators.&#xD;
  432. The work in this thesis is in the area of “nominal" type theory, or more precisely the&#xD;
  433. study of “nominal" simple types.&#xD;
  434. We take Nominal Equational Logic (NEL), which augments equational logic with&#xD;
  435. freshness judgements, as our starting point to introduce the Nominal Lambda Calculus&#xD;
  436. (NLC), a typed lambda calculus that provides a simple form of name-dependent&#xD;
  437. function types. This is a key feature of NLC, which allows us to encode freshness in&#xD;
  438. a novel way.&#xD;
  439. We establish meta-theoretic properties of NLC and introduce a sound model theoretic&#xD;
  440. semantics. Further, we introduce NLC[A], an extension of NLC that captures&#xD;
  441. name abstraction and concretion, and provide pure NLC[A] with a strongly&#xD;
  442. normalising and confluent βη-reduction system.&#xD;
  443. A property that has not yet been studied for “nominal" typed lambda calculi is&#xD;
  444. completeness of βη-conversion for a nominal analogue of full set-theoretic hierarchies.&#xD;
  445. Aiming towards such a result, we analyse known proof techniques and identify various&#xD;
  446. issues. As an interesting precursor, we introduce full nominal hierarchies and&#xD;
  447. demonstrate that completeness holds for βη-conversion of the ordinary typed lambda&#xD;
  448. calculus.&#xD;
  449. The notion of FM-categories was developed by Ranald Clouston to demonstrate&#xD;
  450. that FM-categories correspond precisely to NEL-theories. We augment FM-categories&#xD;
  451. with equivariant exponentials and show that they soundly model NLC-theories. We&#xD;
  452. then outline why NLC is not complete for such categories, and discuss in detail an&#xD;
  453. approach towards extending NLC which yields a promising framework from which we&#xD;
  454. aim to develop a future (sound and complete) categorical semantics and a categorical&#xD;
  455. type theory correspondence.&#xD;
  456. Moreover, in pursuit of a categorical conservative extension result, we study (enriched/&#xD;
  457. internal) Yoneda isomorphisms for “nominal" categories and some form of&#xD;
  458. “nominal" gluing.</description>
  459.      <pubDate>Thu, 08 Jan 2015 15:07:38 GMT</pubDate>
  460.      <guid isPermaLink="false">http://hdl.handle.net/2381/31396</guid>
  461.      <dc:date>2015-01-08T15:07:38Z</dc:date>
  462.    </item>
  463.    <item>
  464.      <title>CMMI-CM compliance checking of formal BPMN models using Maude</title>
  465.      <link>http://hdl.handle.net/2381/31390</link>
  466.      <description>Title: CMMI-CM compliance checking of formal BPMN models using Maude
  467. Authors: El-Saber, Nissreen A. S.
  468. Abstract: From the perspective of business process improvement models, a business process&#xD;
  469. which is compliant with best practices and standards (e.g. CMMI) is necessary for defining&#xD;
  470. almost all types of contracts and government collaborations. In this thesis, we propose&#xD;
  471. a formal pre-appraisal approach for Capability Maturity Model Integration (CMMI)&#xD;
  472. compliance checking based on a Maude-based formalization of business processes in&#xD;
  473. Business Process Model and Notation (BPMN). The approach can be used to assess&#xD;
  474. the designed business process compliance with CMMI requirements as a step leading&#xD;
  475. to a full appraisal application. In particular, The BPMN model is mapped into Maude,&#xD;
  476. and the CMMI compliance requirements are mapped into Linear Temporal Logic (LTL)&#xD;
  477. then the Maude representation of the model is model checked against the LTL properties&#xD;
  478. using the Maude’s LTL model checker.&#xD;
  479. On the process model side, BPMN models may include structural issues that hinder&#xD;
  480. their design. In this thesis, we propose a formal characterization and semantics specification&#xD;
  481. of well-formed BPMN processes using the formalization of rewriting logic (Maude)&#xD;
  482. with a focus on data-based decision gateways and data objects semantics. Our formal&#xD;
  483. specification adheres to the BPMN standards and enables model checking using Maude’s&#xD;
  484. LTL model checker. The proposed semantics is formally proved to be sound based on the&#xD;
  485. classical workflow model soundness definition. On the compliance requirements side,&#xD;
  486. CMMI configuration management process is used as a source of compliance requirements&#xD;
  487. which then are mapped through compliance patterns into LTL properties. Model&#xD;
  488. checking results of Maude based implementation are explained based on a compliance&#xD;
  489. grading scheme. Examples of CMMI configuration management processes are used to&#xD;
  490. illustrate the approach.</description>
  491.      <pubDate>Thu, 08 Jan 2015 12:29:00 GMT</pubDate>
  492.      <guid isPermaLink="false">http://hdl.handle.net/2381/31390</guid>
  493.      <dc:date>2015-01-08T12:29:00Z</dc:date>
  494.    </item>
  495.    <item>
  496.      <title>Management concerns in service-driven applications</title>
  497.      <link>http://hdl.handle.net/2381/30107</link>
  498.      <description>Title: Management concerns in service-driven applications
  499. Authors: Alghamdi, Ahmed Musfer
  500. Abstract: With the abundance of functionally-similar Web-Services, the offered or agreed-on qualities are becoming decisive factors in attracting private as well as corporate customers to a given service, among all others. Nevertheless, the state-of-art in handling qualities, in this emerging service paradigm, remains largely bound to the aspects of technology and their standards (e.g. time-response, availability, throughputs). However, current approaches still ignore capital domain-based business qualities and management concerns (e.g. customer profiles, business deadlines). The main objective of this thesis is to leverage the handling of quality and management issues in service-driven business applications toward the intuitive business level supported by a precise and flexible conceptualisation. Thus, instead of addressing qualities using just rigid IT-SLA (service-level agreements) as followed by Web Services technology and standards, we propose to cope with more abstract and domain-dependent and adaptive qualities in an intuitive, yet conceptual, manner. The approach is centred on evolving business rules and policies for management, with a clean separation of functionalities as specific rules. At the conceptual level, we propose specialised architectural connectors called management laws that we also separate from coordination laws for functionality issues. We further propose a smooth and compliant mapping of the conceptualisation toward service technology, using existing rule-based standards.</description>
  501.      <pubDate>Mon, 15 Dec 2014 10:36:12 GMT</pubDate>
  502.      <guid isPermaLink="false">http://hdl.handle.net/2381/30107</guid>
  503.      <dc:date>2014-12-15T10:36:12Z</dc:date>
  504.    </item>
  505.    <item>
  506.      <title>Flexibo : language and its application to static analysis</title>
  507.      <link>http://hdl.handle.net/2381/30106</link>
  508.      <description>Title: Flexibo : language and its application to static analysis
  509. Authors: Zhou, Jianguo
  510. Abstract: This thesis introduces a new object-based language FlexibO to support prototype development paradigm and more importantly, program static analysis. FlexibO offers extreme flexibility and hence enables developers to write programs that contain rich information for further analysis and optimization. FlexibO interpreter's seamless integration with Java (including direct access to Java classes and methods and direct inheritance of Java classes) makes it a suitable tool for fast prototype software development. FlexibO's extreme flexibility allows developers to redefine the behavior of program evaluation by overriding its default evaluation method. This mechanism can be used to translate FlexibO to other efficient languages. In this thesis we design a translator in FlexibO to translate Bulk-Synchronous Parallel specifications (expressed in FlexibO) to executable C pro grams linked with BSPLib. Before translation, the tool first checks syntax and type, then statically analyzes potential communication conflicts, and finally generates C code. The translation process can accurately analyze primitive commands but require approximation (using abstract interpretation) for more advanced commands such as loops. The appropriateness of the translator and the associated static analysis can be formally analyzed using the technique of normal form.</description>
  511.      <pubDate>Mon, 15 Dec 2014 10:36:12 GMT</pubDate>
  512.      <guid isPermaLink="false">http://hdl.handle.net/2381/30106</guid>
  513.      <dc:date>2014-12-15T10:36:12Z</dc:date>
  514.    </item>
  515.    <item>
  516.      <title>Automatic presentations of groups and semigroups</title>
  517.      <link>http://hdl.handle.net/2381/30105</link>
  518.      <description>Title: Automatic presentations of groups and semigroups
  519. Authors: Oliver, Graham
  520. Abstract: Effectively deciding the satisfiability of logical sentences over structures is an area well-studied in the case of finite structures. There has been growing work towards considering this question for infinite structures. In particular the theory of automatic structures, considered here, investigates structures representable by finite automata. The closure properties of finite automata lead naturally to algorithms for deciding satisfiability for some logics. The use of finite automata to investigate infinite structures has been inspired by the interplay between the theory of finite automata and the theory of semigroups. This inspiration has come in particular from the theory of automatic groups and semigroups, which considers (semi)groups with regular sets of normal forms over their generators such that generator-composition is also regular. The work presented here is a contribution to the foundational problem for automatic structures: given a class of structures, classify those members that have an automatic presentation. The classes considered here are various interesting subclasses of the class of finitely generated semigroups, as well as the class of Cayley Graphs of groups. Although similar, the theories of automatic (semi)groups and automatic presentation differ in their construction. A classification for finitely generated groups allows a direct comparison of the theory of automatic presentations with the theory of automatic groups.</description>
  521.      <pubDate>Mon, 15 Dec 2014 10:36:10 GMT</pubDate>
  522.      <guid isPermaLink="false">http://hdl.handle.net/2381/30105</guid>
  523.      <dc:date>2014-12-15T10:36:10Z</dc:date>
  524.    </item>
  525.    <item>
  526.      <title>Optimization problems in communication networks</title>
  527.      <link>http://hdl.handle.net/2381/30104</link>
  528.      <description>Title: Optimization problems in communication networks
  529. Authors: Mihalak, Matus
  530. Abstract: We study four problems arising in the area of communication networks. The minimum-weight dominating set problem in unit disk graphs asks, for a given set D of weighted unit disks, to find a minimum-weight subset D' ⊆ D such that the disks D' intersect all disks D. The problem is NP-hard and we present the first constant-factor approximation algorithm. Applying our techniques to other geometric graph problems, we can obtain better (or new) approximation algorithms. The network discovery problem asks for a minimum number of queries that discover all edges and non-edges of an unknown network (graph). A query at node v discovers a certain portion of the network. We study two different query models and show various results concerning the complexity, approximability and lower bounds on competitive ratios of online algorithms. The OVSF-code assignment problem deals with assigning communication codes (nodes) from a complete binary tree to users. Users ask for codes of a certain depth and the codes have to be assigned such that (i) no assigned code is an ancestor of another assigned code and (ii) the number of (previously) assigned codes that have to be reassigned (in order to satisfy (i)) is minimized. We present hardness results and several algorithms (optimal, approximation, online and fixed-parameter tractable). The joint base station scheduling problem asks for an assignment of users to base stations (points in the plane) and for an optimal colouring of the resulting conflict graph: user u with its assigned base station b is in conflict with user v, if a disk with center at 6, and u on its perimeter, contains v. We study the complexity, and present and analyse optimal, approximation and greedy algorithms for general and various special cases.</description>
  531.      <pubDate>Mon, 15 Dec 2014 10:36:09 GMT</pubDate>
  532.      <guid isPermaLink="false">http://hdl.handle.net/2381/30104</guid>
  533.      <dc:date>2014-12-15T10:36:09Z</dc:date>
  534.    </item>
  535.    <item>
  536.      <title>Categories of containers</title>
  537.      <link>http://hdl.handle.net/2381/30102</link>
  538.      <description>Title: Categories of containers
  539. Authors: Abbott, Michael Gordon
  540. Abstract: This thesis develops a new approach to the theory of datatypes based on separating data and storage resulting in a class of datatype called a container. The extension of a container is a functor which can be regarded as a generalised polynomial functor in type variables. A representation theorem allows every natural transformation between container functors to be represented as a unique pair of morphisms in a category.;Under suitable assumptions on the ambient category container functors are closed under composition, limits, coproducts and the construction of initial algebras and final coalgebras. These closure properties allow containers to provide a functorial semantics for an important class of polymorphic types including the strictly positive types.;Since polymorphic functions between functorial polymorphic types correspond to natural transformations, every polymorphic function can be represented as a container morphism; this simplifies reasoning about such functions and provides a framework for developing concepts of generic programming.;Intuitionistic well-founded trees or W-types are the initial algebras of container functors in one parameter; the construction of the initial algebra of a container in more than one parameter leads to the solution of a problem left incomplete by earlier work of Dybjer.;We also find that containers provide a suitable framework to define the derivative of a functor as a kind of linear exponential. We show that the use of containers is essential for this approach.;The theory is developed in the context of a fairly general category to allow for a wide choice of applications. We use the language of dependent type theory to develop the theory of containers in an arbitrary extensive locally cartesian closed category; much of the development in this thesis can also be generalised to display map categories. We develop the appropriate internal language and its interpretation in a category with families.</description>
  541.      <pubDate>Mon, 15 Dec 2014 10:36:09 GMT</pubDate>
  542.      <guid isPermaLink="false">http://hdl.handle.net/2381/30102</guid>
  543.      <dc:date>2014-12-15T10:36:09Z</dc:date>
  544.    </item>
  545.    <item>
  546.      <title>Formal languages and the irreducible word problem in groups</title>
  547.      <link>http://hdl.handle.net/2381/30103</link>
  548.      <description>Title: Formal languages and the irreducible word problem in groups
  549. Authors: Fonseca, Ana
  550. Abstract: There exist structural classifications of groups with a regular, one-counter or context-free word problem. Following on from this, the main object of the work presented here has been the irreducible word problem of a group, a notion introduced by Haring-Smith, who denned it as the subset of the word problem consisting of the non-empty words which have no non-empty proper subword equal to the identity. He proved that the groups with a finite irreducible word problem with respect to some group generating set are exactly the plain groups.;We know that the class of groups with a context-free irreducible word problem is a proper subclass of the virtually free groups. We look at direct products of finitely generated free groups by finite groups and also at the plain groups and consider their irreducible word problems with respect to minimal group generating sets. We prove that, of all the direct products of the infinite cyclic group by a non-trivial finite group, only Z x Z2 and Z x Z 3 have context-free irreducible word problem (and only with respect to a few group generating sets). We also exhibit a plain group that has context-free irreducible word problem with respect to every minimal group generating set.;Looking at the direct products of finitely generated free groups by non-trivial finite groups, we have found that the only irreducible word problem that is one-counter is that of Z x Z2 with respect to the canonical group generating set.;As for irreducible word problems lying in classes of languages above context-free, on one hand, we prove that having a recursive irreducible word problem is equivalent to having a recursive word problem. On the other hand, we prove that, while there are groups such that the fact that their irreducible word problem is recursively enumerable implies that they are recursive, that is not always the case.</description>
  551.      <pubDate>Mon, 15 Dec 2014 10:36:09 GMT</pubDate>
  552.      <guid isPermaLink="false">http://hdl.handle.net/2381/30103</guid>
  553.      <dc:date>2014-12-15T10:36:09Z</dc:date>
  554.    </item>
  555.    <item>
  556.      <title>Alternative approaches to optophonic mappings</title>
  557.      <link>http://hdl.handle.net/2381/30101</link>
  558.      <description>Title: Alternative approaches to optophonic mappings
  559. Authors: Capp, Michael.
  560. Abstract: This thesis presents a number of modifications to a blind aid, known as the video optophone, which enables a blind user to more readily interpret that local environment for enhanced mobility and navigation.  Versions of this form of blind aid are generally both difficult to use and interpret, and are therefore inadequate for safe mobility.  The reason for this severe problem lies in the complexity and excessive bandwidth of the optophonic output after the conversion from scene-to-sound.;The work herein describes a number of modifications that can be applied to the current optophonic process to make more efficient use of the limited bandwidth provided by the auditory system when converting scene images to sound.  Various image processing and stereo techniques have been employed to artificially emulate the human visual system through the use of depth maps that successfully fade out the quantity of relatively unimportant image features, whilst emphasising the more significant regions such as nearby obstacles.;A series of experiments was designed to test these various modifications to the optophonic mapping by studying important factors of mobility and subject response whilst going about everyday life.  The devised system, labelled DeLIA for the Detection, Location, Identification, and Avoidance (or Action) of obstacles, provided a means for gathering statistical data on users' interpretation of the optophonic output.  An analysis of this data demonstrated a significant improvement when using the stereo cartooning technique, developed as part of this work, over the more conventional plain image as an input to an optophonic mapping from scene-to-sound.;Lastly, conclusions were drawn from the results, which indicated that the use of a stereo depth map as an input to a video optophone would improve its usefulness as an aid to general mobility.  For the purposes of detecting and determining text or similar detail, either a plain unmodified image or some form of edge (depth) image were found to produce the best results.</description>
  561.      <pubDate>Mon, 15 Dec 2014 10:36:08 GMT</pubDate>
  562.      <guid isPermaLink="false">http://hdl.handle.net/2381/30101</guid>
  563.      <dc:date>2014-12-15T10:36:08Z</dc:date>
  564.    </item>
  565.    <item>
  566.      <title>Multimodal human-computer interaction for enhancing customers’ decision-making and experience on B2C e-commerce websites</title>
  567.      <link>http://hdl.handle.net/2381/29330</link>
  568.      <description>Title: Multimodal human-computer interaction for enhancing customers’ decision-making and experience on B2C e-commerce websites
  569. Authors: Al Sokkar, Abdullah Ahmad Musa
  570. Abstract: The main aim of this thesis was to identify, complement and refine the factors that contribute to users’ intention to purchase, satisfaction and attitude toward using a particular B2C online environment, as well as the causal relationships between these factors. A systematic literature review on Information System (IS), Market Research, and User Experience (UX), which has informed the design and development of a pilot study, has been conducted. Results have led to the conception of an online shopping decision-making (OSDM) model called ‘Episodic UX Model on Decision-Making’ (EUX-DM). It has been developed by integrating the established Technology Acceptance Model (TAM) as well as Information System Success Model (ISSM), and emerging UX models, and Expectation-Confirmation Theory (ECT). Results from analysing 305 responses to the web-based questionnaire aimed to evaluate EUX-DM verified its validity. In addition, after investigating the users’ preferences for the possible modifications related to the use of visual avatar in a particular B2C e-Commerce website for information presentation, another research focus has been placed on identifying the real conversational functions and their related communicational behaviour in designing male and female visual avatars’ facial expressions and body gestures. Following this, four different types of information presentations have been developed to be used in a contrived B2C online shopping environment, namely: (i) 2D static graphical and textual information, (ii) non-expressive avatars, (iii) avatars with facial expressions, (iv) and avatars with facial expressions and body gestures information presentations. Consequently, these information presentations were empirically investigated through two experimental studies. The outcomes of these studies indicated that the gender of the avatar and participants were found to be insignificant factors for any of the measured qualities, and the use of visual avatars with animated facial expressions and body gestures positively influenced customers’ usage attitude, intention to purchase and satisfaction.</description>
  571.      <pubDate>Tue, 09 Dec 2014 11:49:14 GMT</pubDate>
  572.      <guid isPermaLink="false">http://hdl.handle.net/2381/29330</guid>
  573.      <dc:date>2014-12-09T11:49:14Z</dc:date>
  574.    </item>
  575.    <item>
  576.      <title>Lem : Reusable engineering of real-world semantics</title>
  577.      <link>http://hdl.handle.net/2381/29328</link>
  578.      <description>Title: Lem : Reusable engineering of real-world semantics
  579. Authors: Mulligan, Dominic P.; Gray, Kathryn E.; Sewell, Peter; Owens, Scott; Ridge, Tom
  580. Abstract: Recent years have seen remarkable successes in rigorous engineering: using mathematically rigorous semantic models (not just idealised calculi) of real-world processors, programming languages, protocols, and security mechanisms, for testing, proof, analysis, and design. Building these models is challenging, requiring experimentation, dialogue with vendors or standards bodies, and validation; their scale adds engineering issues akin to those of programming to the task of writing clear and usable mathematics. But language and tool support for specification is lacking. Proof assistants can be used but bring their own difficulties, and a model produced in one, perhaps requiring many person-years effort and maintained over an extended period, cannot be used by those familiar with another. We introduce Lem, a language for engineering reusable large-scale semantic models. The Lem design takes inspiration both from functional programming languages and from proof assistants, and Lem definitions are translatable into OCaml for testing, Coq, HOL4, and Isabelle/HOL for proof, and LaTeX and HTML for presentation. This requires a delicate balance of expressiveness, careful library design, and implementation of transformations - akin to compilation, but subject to the constraint of producing usable and human-readable code for each target. Lem's effectiveness is demonstrated by its use in practice. © 2014 ACM.</description>
  581.      <pubDate>Tue, 09 Dec 2014 10:33:34 GMT</pubDate>
  582.      <guid isPermaLink="false">http://hdl.handle.net/2381/29328</guid>
  583.      <dc:date>2014-12-09T10:33:34Z</dc:date>
  584.    </item>
  585.    <item>
  586.      <title>Simple, efficient, sound and complete combinator parsing for all context-free grammars, using an oracle</title>
  587.      <link>http://hdl.handle.net/2381/29327</link>
  588.      <description>Title: Simple, efficient, sound and complete combinator parsing for all context-free grammars, using an oracle
  589. Authors: Ridge, Tom
  590. Abstract: Parsers for context-free grammars can be implemented directly and naturally in a functional style known as “combinator parsing”, using recursion following the structure of the grammar rules. Traditionally parser combinators have struggled to handle all features of context-free grammars, such as left recursion.&#xD;
  591. &#xD;
  592. Previous work introduced novel parser combinators that could be used to parse all context-free grammars. A parser generator built using these combinators was proved both sound and complete in the HOL4 theorem prover. Unfortunately the performance was not as good as other parsing methods such as Earley parsing.&#xD;
  593. &#xD;
  594. In this paper, we build on this previous work, and combine it in novel ways with existing parsing techniques such as Earley parsing. The result is a sound-and-complete combinator parsing library that can handle all context-free grammars, and has good performance.
  595. Description: timestamp: Tue, 09 Sep 2014 10:57:11 +0200 biburl: http://dblp.uni-trier.de/rec/bib/conf/sle/Ridge14 bibsource: dblp computer science bibliography, http://dblp.org</description>
  596.      <pubDate>Tue, 09 Dec 2014 10:20:37 GMT</pubDate>
  597.      <guid isPermaLink="false">http://hdl.handle.net/2381/29327</guid>
  598.      <dc:date>2014-12-09T10:20:37Z</dc:date>
  599.    </item>
  600.    <item>
  601.      <title>On the Synthesis of Choreographies</title>
  602.      <link>http://hdl.handle.net/2381/29310</link>
  603.      <description>Title: On the Synthesis of Choreographies
  604. Authors: Lange, Julien
  605. Abstract: The theories based on session types stand out as effective methodologies&#xD;
  606. to specify and verify properties of distributed systems. A key result in the area shows the&#xD;
  607. suitability of choreography languages and session types as a basis for a choreography-driven&#xD;
  608. methodology for distributed software development. The methodology it advocates&#xD;
  609. is as follows: a team of programmers designs a global view of the interactions to be&#xD;
  610. implemented (i.e., a choreography), then the choreography is projected onto each role.&#xD;
  611. Finally, each program implementing one or more roles in the choreography is validated&#xD;
  612. against its corresponding projection(s).&#xD;
  613. This is an ideal methodology but it may not always be possible to design one set of&#xD;
  614. choreographies that will drive the overall development of a distributed system. Indeed,&#xD;
  615. software needs maintenance, specifications may evolve (sometimes also during the development),&#xD;
  616. and issues may arise during the implementation phase. Therefore, there is a&#xD;
  617. need for an alternative approach whereby it is possible to infer a choreography from local&#xD;
  618. behavioural specifications (i.e., session types).&#xD;
  619. We tackle the problem of synthesising choreographies from local behavioural specifications&#xD;
  620. by introducing a type system which assigns – if possible – a choreography to&#xD;
  621. set of session types. We demonstrate the importance of obtaining a choreography from&#xD;
  622. local specifications through two applications. Firstly, we give three algorithms and a&#xD;
  623. methodology to help software designers refine a choreography into a global assertion,&#xD;
  624. i.e., a choreography decorated with logical formulae specifying senders’ obligations and&#xD;
  625. receivers’ requirements. Secondly, we introduce a formal model for distributed systems&#xD;
  626. where each participant advertises its requirements and obligations as behavioural contracts&#xD;
  627. (in the form of session types), and where multiparty sessions are started when a set&#xD;
  628. of contracts allows to synthesise a choreography.</description>
  629.      <pubDate>Thu, 04 Dec 2014 12:10:48 GMT</pubDate>
  630.      <guid isPermaLink="false">http://hdl.handle.net/2381/29310</guid>
  631.      <dc:date>2014-12-04T12:10:48Z</dc:date>
  632.    </item>
  633.    <item>
  634.      <title>User Activity Recognition through Software Sensors</title>
  635.      <link>http://hdl.handle.net/2381/29228</link>
  636.      <description>Title: User Activity Recognition through Software Sensors
  637. Authors: Reiff-Marganiec, Stephan
  638. Abstract: Context-aware systems are an instance of the ubiquitous or pervasive computing vision. They sense the users’ physical and virtual surrounding to identify the best system support for that user and adapt the system behaviour accordingly. The overall architecture of a context aware system can be broken into a number of logical aspects: gathering context data, storing the data, deriving knowledge through reasoning and mining and retrieving that knowledge to finally adapting system behaviours. Context is anything characterizing the environment of the user – their location, the ambient temperature, the people they are with, their current activity and some even consider the user’s mood. Traditionally context information has been gathered through the use of hardware sensors, such as GPS sensors or smart badges for locations and there has been work to track user’s eye movements at their desk to see which application they are using. However, determining the activity of a user has shown to be elusive to being sensed with hardware sensors. As users use web services more frequently they are exchanging messages with the services through the SOAP protocol. SOAP messages contain data, which is valuable if gathered and interpreted right – especially as this data can be shedding information on the activity of a user that goes beyond “sitting at the computer and typing”. We propose a complimentary sensor technology through the use of software sensors. The software sensors are essentially based on monitoring SOAP messages and inserting data for further reasoning and querying into a semantic context model. In this paper we consider details of extracting the data from SOAP messages in a non-obstructive way and show a solution to map the data from a SOAP message to our OWL ontology model automatically. On the latter, we specifically explain the methodology to map from SOAP messages to an existing structure of knowledge.
  639. Description: The file associated with this record is embargoed until 18 months after the date of publication. The final published version may be available through the links above.</description>
  640.      <pubDate>Thu, 30 Oct 2014 10:28:23 GMT</pubDate>
  641.      <guid isPermaLink="false">http://hdl.handle.net/2381/29228</guid>
  642.      <dc:date>2014-10-30T10:28:23Z</dc:date>
  643.    </item>
  644.    <item>
  645.      <title>Succinct indices for range queries with applications to orthogonal range maxima</title>
  646.      <link>http://hdl.handle.net/2381/29206</link>
  647.      <description>Title: Succinct indices for range queries with applications to orthogonal range maxima
  648. Authors: Farzan, Arash; Munro, J. Ian; Raman, Rajeev
  649. Abstract: We consider the problem of preprocessing N points in 2D, each endowed with a priority, to answer the following queries: given a axis-parallel rectangle, determine the point with the largest priority in the rectangle. Using the ideas of the effective entropy of range maxima queries and succinct indices for range maxima queries, we obtain a structure that uses O(N) words and answers the above query in O(logN loglogN) time. This a direct improvement of Chazelle's result from 1985 [10] for this problem - Chazelle required O(N/ε) words to answer queries in O((logN)[superscript 1+ε]) time for any constant ε &gt; 0.</description>
  650.      <pubDate>Tue, 28 Oct 2014 10:40:48 GMT</pubDate>
  651.      <guid isPermaLink="false">http://hdl.handle.net/2381/29206</guid>
  652.      <dc:date>2014-10-28T10:40:48Z</dc:date>
  653.    </item>
  654.    <item>
  655.      <title>Succinct representations of ordinal trees</title>
  656.      <link>http://hdl.handle.net/2381/29205</link>
  657.      <description>Title: Succinct representations of ordinal trees
  658. Authors: Raman, Rajeev; Rao, S. Srinivasa
  659. Abstract: We survey succinct representations of ordinal, or rooted, ordered trees. Succinct representations use space that is close to the appropriate information-theoretic minimum, but support operations on the tree rapidly, usually in O(1) time.</description>
  660.      <pubDate>Tue, 28 Oct 2014 10:33:36 GMT</pubDate>
  661.      <guid isPermaLink="false">http://hdl.handle.net/2381/29205</guid>
  662.      <dc:date>2014-10-28T10:33:36Z</dc:date>
  663.    </item>
  664.    <item>
  665.      <title>On probabilistic models for uncertain sequential pattern mining</title>
  666.      <link>http://hdl.handle.net/2381/29204</link>
  667.      <description>Title: On probabilistic models for uncertain sequential pattern mining
  668. Authors: Muzammal, Muhammad; Raman, Rajeev
  669. Editors: Cao, L.; Feng, Y.; Zhong, J.
  670. Abstract: We study uncertainty models in sequential pattern mining. We consider situations where there is uncertainty either about a source or an event. We show that both these types of uncertainties could be modelled using probabilistic databases, and give possible-worlds semantics for both. We then describe ”interestingness” criteria based on two notions of frequentness (previously studied for frequent itemset mining) namely expected support [C. Aggarwal et al. KDD’09;Chui et al., PAKDD’07,’08] and probabilistic frequentness [Bernecker et al., KDD’09]. We study the interestingness criteria from a complexity-theoretic perspective, and show that in case of source-level uncertainty, evaluating probabilistic frequentness is #P-complete, and thus no polynomial time algorithms are likely to exist, but evaluate the interestingness predicate in polynomial time in the remaining cases.</description>
  671.      <pubDate>Tue, 28 Oct 2014 10:26:52 GMT</pubDate>
  672.      <guid isPermaLink="false">http://hdl.handle.net/2381/29204</guid>
  673.      <dc:date>2014-10-28T10:26:52Z</dc:date>
  674.    </item>
  675.  </channel>
  676. </rss>
  677.  
  678.  

If you would like to create a banner that links to this page (i.e. this validation result), do the following:

  1. Download the "valid RSS" banner.

  2. Upload the image to your own server. (This step is important. Please do not link directly to the image on this server.)

  3. Add this HTML to your page (change the image src attribute if necessary):

If you would like to create a text link instead, here is the URL you can use:

http://www.rssboard.org/rss-validator/check.cgi?url=https%3A//lra.le.ac.uk/feed/rss_2.0/2381/316