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>2014-09-19T03:04:34Z</dc:date>
        ^
  • line 17, column 6: An item should not include both pubDate and dc:date (50 occurrences) [help]

          <dc:date>2014-09-18T08:51:47Z</dc:date>
          ^
  • line 628, 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>LRA Community:</title>
  5.    <link>http://hdl.handle.net/2381/316</link>
  6.    <description />
  7.    <pubDate>Fri, 19 Sep 2014 03:04:34 GMT</pubDate>
  8.    <dc:date>2014-09-19T03:04:34Z</dc:date>
  9.    <item>
  10.      <title>Dynamizing succinct tree representations</title>
  11.      <link>http://hdl.handle.net/2381/29103</link>
  12.      <description>Title: Dynamizing succinct tree representations
  13. Authors: Joannou, Stelios; Raman, Rajeev
  14. Abstract: We consider succinct, or space-efficient, representations of ordinal trees. Representations exist that take 2n + o(n) bits to represent a static n-node ordinal tree - close to the information-theoretic minimum - and support navigational operations in O(1) time on a RAM model; and some implementations have good practical performance. The situation is different for dynamic ordinal trees. Although there is theoretical work on succinct dynamic ordinal trees, there is little work on the practical performance of these data structures. Motivated by applications to representing XML documents, in this paper, we report on a preliminary study on dynamic succinct data structures. Our implementation is based on representing the tree structure as a sequence of balanced parentheses, with navigation done using the min-max tree of Sadakane and Navarro (SODA '10). Our implementation shows promising performance for update and navigation, and our findings highlight two issues that we believe will be important to future implementations: the difference between the finger model of (say) Farzan and Munro (ICALP '09) and the parenthesis model of Sadakane and Navarro, and the choice of the balanced tree used to represent the min-max tree.</description>
  15.      <pubDate>Thu, 18 Sep 2014 08:51:47 GMT</pubDate>
  16.      <guid isPermaLink="false">http://hdl.handle.net/2381/29103</guid>
  17.      <dc:date>2014-09-18T08:51:47Z</dc:date>
  18.    </item>
  19.    <item>
  20.      <title>A model for supporting electrical engineering with e-learning</title>
  21.      <link>http://hdl.handle.net/2381/29066</link>
  22.      <description>Title: A model for supporting electrical engineering with e-learning
  23. Authors: Akaslan, Dursun
  24. Abstract: The overall goal of this research work was developing and evaluating a model for supporting electrical engineering with e-learning. The model development was based on the survey data collected from representative teachers and students in Turkey whereas the model evaluation was conducted in the relevant HEIs in Turkey and the United Kingdom. To develop the model, the study investigated the attitudes of representative key stakeholders towards e-learning in Turkey by administrating questionnaires and interviews with teachers and students. Then the responses of the teachers and students were compared. Based on the results, I proposed a model with a multi-dimensional approach to e-learning: (1) self-directed learning by studying e-book, (2) self-assessment by solving e-exercises, (3) teacher-directed learning by attending classroom sessions as an integral part of the blended learning (4) teacher-assessment by solving e-exercises, (5) computer-directed learning by playing e-games and (6) computer-assessment by solving e-exercises.&#xD;
  25. To evaluate the applicability of the model in different conditions, a case-control study was conducted to determine whether the model had the intended effect on the participating students in HEIs in Turkey and the United Kingdom. As the result of the case-control study, the effects of e-learning, blended learning and traditional learning were verified. However, there were significant differences among the groups. The overall scores indicated that e-learning and blended learning was more effective as compared to the traditional learning. The results of our study indicated that the knowledge increase in e-learners seemed to be gradual because they tended to study daily by completing each activity on time. However, the traditional learners did not have the same pattern because they usually did not read the core text and did not solve e-exercise regularly before the classroom sessions. The results of pre-placement, post-placement tests and middle tests also justified these assumptions.</description>
  26.      <pubDate>Mon, 08 Sep 2014 14:27:39 GMT</pubDate>
  27.      <guid isPermaLink="false">http://hdl.handle.net/2381/29066</guid>
  28.      <dc:date>2014-09-08T14:27:39Z</dc:date>
  29.    </item>
  30.    <item>
  31.      <title>Compressed representation of XML documents with rapid navigation</title>
  32.      <link>http://hdl.handle.net/2381/29062</link>
  33.      <description>Title: Compressed representation of XML documents with rapid navigation
  34. Authors: Kharabsheh, Mohammad Kamel Ahmad
  35. Abstract: XML(Extensible Markup Language) is a language used in data representation and&#xD;
  36. storage, and transmission and manipulation of data. Excessive memory consumption&#xD;
  37. is an important challenge when representing XML documents in main memory.&#xD;
  38. Document Object Model (DOM) APIs are used in a processing level that provides&#xD;
  39. access to all parts of XML documents through the navigation operations. Although&#xD;
  40. DOM serves as a a general purpose tool that can be used in different applications,&#xD;
  41. it has high memory cost particularly if using na¨ıve. The space usage of DOM has&#xD;
  42. been reduced significantly while keeping fast processing speeds, by use of succinct&#xD;
  43. data structures in SiXDOM [1]. However, SiXDOM does not explore in depth XML&#xD;
  44. data compression principles to improve in-memory space usage. Such XML data&#xD;
  45. compression techniques have been proven to be very effective in on-disk compression&#xD;
  46. of XML document. In this thesis we propose a new approach to represent XML&#xD;
  47. documents in-memory using XML data compression ideas to further reduce space&#xD;
  48. usage while rapidly supporting operations of the kind supported by DOM.&#xD;
  49. Our approach is based upon a compression method [2] which represents an XML&#xD;
  50. document as a directed acyclic graph (DAG) by sharing common subtrees. However,&#xD;
  51. this approach does not permit the representation of attributes and textual data,&#xD;
  52. and furthermore, a naive implementation of this idea gives very poor space usage&#xD;
  53. relative to other space-efficient DOM implementations [1]. In order to realise the&#xD;
  54. potential of this compression method as an in-memory representation, a number&#xD;
  55. of optimisations are made by application of succinct data structures and variablelength&#xD;
  56. encoding. Furthermore, a framework for supporting attribute and textual&#xD;
  57. data nodes is introduced. Finally, we propose a novel approach to representing the&#xD;
  58. textual data using Minimal Perfect Hashing(MPH).&#xD;
  59. We have implemented our ideas in a software library called DAGDOMand performed&#xD;
  60. extensive experimental evaluation on a number of standard XML files. DAGDOM&#xD;
  61. yields a good result and we are able to obtain significant space reductions over existing&#xD;
  62. space-efficient DOM implementations (typically 2 to 5 times space reduction),&#xD;
  63. with very modest degradations in CPU time for navigational operations.</description>
  64.      <pubDate>Fri, 05 Sep 2014 15:30:29 GMT</pubDate>
  65.      <guid isPermaLink="false">http://hdl.handle.net/2381/29062</guid>
  66.      <dc:date>2014-09-05T15:30:29Z</dc:date>
  67.    </item>
  68.    <item>
  69.      <title>Backward analysis via over-approximate abstraction and under-approximate subtraction</title>
  70.      <link>http://hdl.handle.net/2381/28950</link>
  71.      <description>Title: Backward analysis via over-approximate abstraction and under-approximate subtraction
  72. Authors: Piterman, Nir; Bakhirkin, Alexey; Berdine, Josh
  73. Abstract: We propose a novel approach for computing weakest liberal safe preconditions of programs. The standard approaches, which call for either under-approximation of a greatest fixed point, or complementation of a least fixed point, are often difficult to apply successfully. Our approach relies on a different decomposition of the weakest precondition of loops. We exchange the greatest fixed point for the computation of a least fixed point above a recurrent set, instead of the bottom element. Convergence is achieved using over-approximation, while in order to maintain soundness we use an under-approximating logical subtraction operation. Unlike general complementation, subtraction more easily allows for increased precision in case its arguments are related. The approach is not restricted to a specific abstract domain and we use it to analyze programs using the abstract domains of intervals and of 3-valued structures.
  74. Description: The file associated with this record is embargoed until 12 months after the date of publication. The final published version may be available through the links above.</description>
  75.      <pubDate>Thu, 26 Jun 2014 14:09:45 GMT</pubDate>
  76.      <guid isPermaLink="false">http://hdl.handle.net/2381/28950</guid>
  77.      <dc:date>2014-06-26T14:09:45Z</dc:date>
  78.    </item>
  79.    <item>
  80.      <title>Mining sequential patterns from probabilistic databases</title>
  81.      <link>http://hdl.handle.net/2381/28949</link>
  82.      <description>Title: Mining sequential patterns from probabilistic databases
  83. Authors: Muzammal, Muhammad; Raman, Rajeev
  84. Abstract: This paper considers the problem of sequential pattern mining (SPM) in&#xD;
  85. probabilistic databases. Specifically, we consider SPM in situations where there is uncertainty&#xD;
  86. in associating an event with a source, model this kind of uncertainty in the probabilistic&#xD;
  87. database framework and consider the problem of enumerating all sequences&#xD;
  88. whose expected support is sufficiently large. We give an algorithm based on dynamic&#xD;
  89. programming to compute the expected support of a sequential pattern. Next, we propose&#xD;
  90. three algorithms for mining sequential patterns from probabilistic databases. The&#xD;
  91. first two algorithms are based on the candidate generation framework – one each based&#xD;
  92. on a breadth-first (similar to GSP) and a depth-first (similar to SPAM) exploration&#xD;
  93. of the search space. The third one is based on the pattern growth framework (similar&#xD;
  94. to PrefixSpan). We propose optimizations that mitigate the effects of the expensive&#xD;
  95. dynamic programming computation step. We give an empirical evaluation of the probabilistic&#xD;
  96. SPM algorithms and the optimizations, and demonstrate the scalability of the&#xD;
  97. algorithms in terms of CPU time and the memory usage. We also demonstrate the&#xD;
  98. effectiveness of the probabilistic SPM framework in extracting meaningful sequences in&#xD;
  99. the presence of noise.
  100. Description: The file associated with this record is embargoed until 12 months after the date of publication. The final published version may be available through the links above.</description>
  101.      <pubDate>Thu, 26 Jun 2014 13:15:31 GMT</pubDate>
  102.      <guid isPermaLink="false">http://hdl.handle.net/2381/28949</guid>
  103.      <dc:date>2014-06-26T13:15:31Z</dc:date>
  104.    </item>
  105.    <item>
  106.      <title>Design-by-contract for software architectures</title>
  107.      <link>http://hdl.handle.net/2381/28924</link>
  108.      <description>Title: Design-by-contract for software architectures
  109. Authors: Poyias, Kyriakos
  110. Abstract: We propose a design by contract (DbC) approach to specify and maintain architectural&#xD;
  111. level properties of software. Such properties are typically relevant in the design&#xD;
  112. phase of the development cycle but may also impact the execution of systems. We give a&#xD;
  113. formal framework for specifying software architectures (and their refi nements) together&#xD;
  114. with contracts that architectural con figurations abide by. In our framework, we can&#xD;
  115. specify that if an architecture guarantees a given pre- condition and a refi nement rule&#xD;
  116. satisfi es a given contract, then the refi ned architecture will enjoy a given post-condition.&#xD;
  117. Methodologically, we take Architectural Design Rewriting (ADR) as our architectural&#xD;
  118. description language. ADR is a rule-based formal framework for modelling (the&#xD;
  119. evolution of) software architectures. We equip the recon figuration rules of an ADR&#xD;
  120. architecture with pre- and post-conditions expressed in a simple logic; a pre-condition&#xD;
  121. constrains the applicability of a rule while a post-condition specifi es the properties&#xD;
  122. expected of the resulting graphs. We give an algorithm to compute the weakest precondition&#xD;
  123. out of a rule and its post-condition. Furthermore, we propose a monitoring&#xD;
  124. mechanism for recording the evolution of systems after certain computations, maintaining&#xD;
  125. the history in a tree-like structure. The hierarchical nature of ADR allows us to&#xD;
  126. take full advantage of the tree-like structure of the monitoring mechanism. We exploit&#xD;
  127. this mechanism to formally defi ne new rewriting mechanisms for ADR reconfi guration&#xD;
  128. rules. Also, by monitoring the evolution we propose a way of identifying which part of&#xD;
  129. a system has been a ffected when unexpected run-time behaviours emerge. Moreover,&#xD;
  130. we propose a methodology that allows us to select which rules can be applied at the&#xD;
  131. architectural level to reconfigure a system so to regain its architectural style when it&#xD;
  132. becomes compromised by unexpected run-time recon figurations.</description>
  133.      <pubDate>Mon, 16 Jun 2014 15:40:37 GMT</pubDate>
  134.      <guid isPermaLink="false">http://hdl.handle.net/2381/28924</guid>
  135.      <dc:date>2014-06-16T15:40:37Z</dc:date>
  136.    </item>
  137.    <item>
  138.      <title>A structured approach to VO reconfigurations through Policies</title>
  139.      <link>http://hdl.handle.net/2381/28881</link>
  140.      <description>Title: A structured approach to VO reconfigurations through Policies
  141. Authors: Reiff-Marganiec, Stephan
  142. Abstract: One of the strength of Virtual Organisations is their ability to dynamically and rapidly adapt in response&#xD;
  143. to changing environmental conditions. Dynamic adaptability has been studied in other system&#xD;
  144. areas as well and system management through policies has crystallized itself as a very prominent solution&#xD;
  145. in system and network administration. However, these areas are often concerned with very&#xD;
  146. low-level technical aspects. Previous work on the APPEL policy language has been aimed at dynamically&#xD;
  147. adapting system behaviour to satisfy end-user demands and – as part of STPOWLA – APPEL&#xD;
  148. was used to adapt workflow instances at runtime. In this paper we explore how the ideas of APPEL&#xD;
  149. and STPOWLA can be extended from workflows to the wider scope of Virtual Organisations. We will&#xD;
  150. use a Travel Booking VO as example.</description>
  151.      <pubDate>Fri, 30 May 2014 10:52:19 GMT</pubDate>
  152.      <guid isPermaLink="false">http://hdl.handle.net/2381/28881</guid>
  153.      <dc:date>2014-05-30T10:52:19Z</dc:date>
  154.    </item>
  155.    <item>
  156.      <title>Maintaining transactional integrity in long running workflow service : a policy-driven framework</title>
  157.      <link>http://hdl.handle.net/2381/28880</link>
  158.      <description>Title: Maintaining transactional integrity in long running workflow service : a policy-driven framework
  159. Authors: Reiff-Marganiec, Stephan; Ali, Manar S.
  160. Abstract: This chapter presents a framework to provide autonomous handling of long running transactions based&#xD;
  161. on dependencies which are derived from the workflow. Business Processes naturally involve long running&#xD;
  162. activities and require transactional behaviour across them. This framework presents a solution for forward&#xD;
  163. recovery from errors by automatic application of compensation to executing instances of workflows. The&#xD;
  164. mechanism is based on propagation of failures through a recursive hierarchical structure of transaction&#xD;
  165. components (nodes and execution paths). The authors discuss a transaction management system that is&#xD;
  166. implemented as a reactive system controller, where system components change their states based on rules&#xD;
  167. in response to triggering of events, such as activation, failure, force-fail, completion, or compensation&#xD;
  168. events. One notable feature of the model is the distinction of vital and non-vital components, allowing&#xD;
  169. the process designer to express the cruciality of activities in the workflow with respect to the business&#xD;
  170. logic. Another novel feature is that in addition to dependencies arising from the structure of the workflow,&#xD;
  171. the approach also permits the workflow designer to specify additional dependencies which will also be&#xD;
  172. enforced. Thus, the authors introduce new techniques and architectures supporting enterprise integration&#xD;
  173. solutions that cater to the dynamics of business needs. The approach is implemented through workflow&#xD;
  174. actions executed by services and allows management of faults through a policy-driven framework.</description>
  175.      <pubDate>Thu, 29 May 2014 15:48:08 GMT</pubDate>
  176.      <guid isPermaLink="false">http://hdl.handle.net/2381/28880</guid>
  177.      <dc:date>2014-05-29T15:48:08Z</dc:date>
  178.    </item>
  179.    <item>
  180.      <title>Encoding range minima and range top-2 queries</title>
  181.      <link>http://hdl.handle.net/2381/28856</link>
  182.      <description>Title: Encoding range minima and range top-2 queries
  183. Authors: Davoodi, Pooya; Navarro, Gonzalo; Raman, Rajeev; Rao, S. Srinivasa
  184. Abstract: We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can answer the query RMQ(i,j), which returns the index containing the smallest element in A[i..j], without access to the array A at query time. We give a data structure whose space usage is 2n+o(n) bits, which is asymptotically optimal for worst-case data, and answers RMQs in O(1) worst-case time. This matches the previous result of Fischer and Heun, but is obtained in a more natural way. Furthermore, our result can encode the RMQs of a random array A in 1.919n+o(n) bits in expectation, which is not known to hold for Fischer and Heun’s result. We then generalize our result to the encoding range top-2 query (RT2Q) problem, which is like the encoding RMQ problem except that the query RT2Q(i,j) returns the indices of both the smallest and second smallest elements of A[i..j]. We introduce a data structure using 3.272n+o(n) bits that answers RT2Qs in constant time, and also give lower bounds on the effective entropy of the RT2Q problem.</description>
  185.      <pubDate>Wed, 28 May 2014 10:49:40 GMT</pubDate>
  186.      <guid isPermaLink="false">http://hdl.handle.net/2381/28856</guid>
  187.      <dc:date>2014-05-28T10:49:40Z</dc:date>
  188.    </item>
  189.    <item>
  190.      <title>Optimal indexes for sparse bit vectors</title>
  191.      <link>http://hdl.handle.net/2381/28854</link>
  192.      <description>Title: Optimal indexes for sparse bit vectors
  193. Authors: Golynski, Alexander; Orlandi, Alessio; Raman, Rajeev; Rao, S. Srinivasa
  194. Abstract: We consider the problem of supporting rank and select operations on a bit vector of length m with n 1-bits. The problem is considered in the succinct index model, where the bit vector is stored in "read-only" memory and an additional data structure, called the index is created during pre-processing to help answer the above queries. We give asymptotically optimal density-sensitive trade-offs, involving both m and n, that relate the size of the index to the number of accesses to the bit vector (and processing time) needed to answer the above queries. The results are particularly interesting for the case where n=o(m).</description>
  195.      <pubDate>Tue, 27 May 2014 10:19:32 GMT</pubDate>
  196.      <guid isPermaLink="false">http://hdl.handle.net/2381/28854</guid>
  197.      <dc:date>2014-05-27T10:19:32Z</dc:date>
  198.    </item>
  199.    <item>
  200.      <title>An empirical evaluation of extendible arrays</title>
  201.      <link>http://hdl.handle.net/2381/28738</link>
  202.      <description>Title: An empirical evaluation of extendible arrays
  203. Authors: Joannou, Stelios; Raman, Rajeev
  204. Editors: Pardalos, PM; Rebennack, S
  205. Abstract: We study the performance of several alternatives for implementing extendible arrays, which allow random access to elements stored&#xD;
  206. in them, whilst allowing the arrays to be grown and shrunk. The study&#xD;
  207. not only looks at the basic operations of grow/shrink and accessing data, but also the effects of memory fragmentation on performance.
  208. Description: The final publication is&#xD;
  209. available at link.springer.com</description>
  210.      <pubDate>Wed, 09 Apr 2014 10:40:44 GMT</pubDate>
  211.      <guid isPermaLink="false">http://hdl.handle.net/2381/28738</guid>
  212.      <dc:date>2014-04-09T10:40:44Z</dc:date>
  213.    </item>
  214.    <item>
  215.      <title>Cell-cycle regulation of NOTCH signaling during C. elegans vulval development</title>
  216.      <link>http://hdl.handle.net/2381/28643</link>
  217.      <description>Title: Cell-cycle regulation of NOTCH signaling during C. elegans vulval development
  218. Authors: Nusser-Stein, Stefanie; Beyer, Antje; Rimann, Ivo; Adamczyk, Magdalene; Piterman, Nir; Hajnal, Alex; Fisher, Jasmin
  219. Abstract: C. elegans vulval development is one of the best‐characterized systems to study cell fate specification during organogenesis. The detailed knowledge of the signaling pathways determining vulval precursor cell (VPC) fates permitted us to create a computational model based on the antagonistic interactions between the epidermal growth factor receptor (EGFR)/RAS/MAPK and the NOTCH pathways that specify the primary and secondary fates, respectively. A key notion of our model is called bounded asynchrony, which predicts that a limited degree of asynchrony in the progression of the VPCs is necessary to break their equivalence. While searching for a molecular mechanism underlying bounded asynchrony, we discovered that the termination of NOTCH signaling is tightly linked to cell‐cycle progression. When single VPCs were arrested in the G1 phase, intracellular NOTCH failed to be degraded, resulting in a mixed primary/secondary cell fate. Moreover, the G1 cyclins CYD‐1 and CYE‐1 stabilize NOTCH, while the G2 cyclin CYB‐3 promotes NOTCH degradation. Our findings reveal a synchronization mechanism that coordinates NOTCH signaling with cell‐cycle progression and thus permits the formation of a stable cell fate pattern.</description>
  220.      <pubDate>Fri, 07 Mar 2014 13:50:41 GMT</pubDate>
  221.      <guid isPermaLink="false">http://hdl.handle.net/2381/28643</guid>
  222.      <dc:date>2014-03-07T13:50:41Z</dc:date>
  223.    </item>
  224.    <item>
  225.      <title>Faster temporal reasoning for infinite-state programs</title>
  226.      <link>http://hdl.handle.net/2381/28591</link>
  227.      <description>Title: Faster temporal reasoning for infinite-state programs
  228. Authors: Piterman, Nir; Cook, Byron; Khlaaf, Heidy
  229. Abstract: In many model checking tools that support temporal logic, performance is hindered by redundant reasoning performed in the presence of nested temporal operators. In particular, tools supporting the state-based temporal logic CTL often symbolically partition the system's state space using the sub-formulae of the input temporal formula. This can lead to repeated work when tools are applied to infinite-state programs, as often the characterization of the state-spaces for nearby program locations are similar and interrelated. In this paper, we describe a new symbolic procedure for CTL verification of infinite-state programs. Our procedure uses the structure of the program's control-flow graph in combination with the nesting of temporal operators in order to optimize reasoning performed during symbolic model checking. An experimental evaluation against competing tools demonstrates that our approach not only gains orders-of-magnitude performance speed improvement, but allows for scalability of temporal reasoning for larger programs.</description>
  230.      <pubDate>Thu, 20 Feb 2014 14:08:53 GMT</pubDate>
  231.      <guid isPermaLink="false">http://hdl.handle.net/2381/28591</guid>
  232.      <dc:date>2014-02-20T14:08:53Z</dc:date>
  233.    </item>
  234.    <item>
  235.      <title>Strongly complete logics for coalgebras</title>
  236.      <link>http://hdl.handle.net/2381/28587</link>
  237.      <description>Title: Strongly complete logics for coalgebras
  238. Authors: Kurz, Alexander; Rosicky, Jiri
  239. Abstract: Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary set-functor is given and proven to be strongly complete under additional assumptions. We proceed in three parts. Part I argues that sifted colimit preserving functors are those functors that preserve universal algebraic structure. Our main theorem here states that a functor preserves sifted colimits if and only if it has a finitary presentation by operations and equations. Moreover, the presentation of the category of algebras for the functor is obtained compositionally from the presentations of the underlying category and of the functor. Part II investigates algebras for a functor over ind-completions and extends the theorem of J{'o}nsson and Tarski on canonical extensions of Boolean algebras with operators to this setting. Part III shows, based on Part I, how to associate a finitary logic to any finite-sets preserving functor T. Based on Part II we prove the logic to be strongly complete under a reasonable condition on T.</description>
  240.      <pubDate>Fri, 14 Feb 2014 10:52:40 GMT</pubDate>
  241.      <guid isPermaLink="false">http://hdl.handle.net/2381/28587</guid>
  242.      <dc:date>2014-02-14T10:52:40Z</dc:date>
  243.    </item>
  244.    <item>
  245.      <title>Completeness for the coalgebraic cover modality</title>
  246.      <link>http://hdl.handle.net/2381/28586</link>
  247.      <description>Title: Completeness for the coalgebraic cover modality
  248. Authors: Kupke, Clemens; Kurz, Alexander; Venema, Yde
  249. Abstract: We study the finitary version of the coalgebraic logic introduced by L.Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical propositional logic with a so-called coalgebraic cover modality depending on the type functor. Its semantics is defined in terms of a categorically defined relation lifting operation. As the main contributions of our paper we introduce a derivation system, and prove that it provides a sound and complete axiomatization for the collection of coalgebraically valid inequalities. Our soundness and completeness proof is algebraic, and we employ Pattinson's stratification method, showing that our derivation system can be stratified in countably many layers, corresponding to the modal depth of the formulas involved. In the proof of our main result we identify some new concepts and obtain some auxiliary results of independent interest. We survey properties of the notion of relation lifting, induced by an arbitrary but fixed set functor. We introduce a category of Boolean algebra presentations, and establish an adjunction between it and the category of Boolean algebras. Given the fact that our derivation system involves only formulas of depth one, it can be encoded as a endo-functor on Boolean algebras. We show that this functor is finitary and preserves embeddings, and we prove that the Lindenbaum-Tarski algebra of our logic can be identified with the initial algebra for this functor.</description>
  250.      <pubDate>Fri, 14 Feb 2014 10:40:06 GMT</pubDate>
  251.      <guid isPermaLink="false">http://hdl.handle.net/2381/28586</guid>
  252.      <dc:date>2014-02-14T10:40:06Z</dc:date>
  253.    </item>
  254.    <item>
  255.      <title>Activity awareness in context-aware systems using software sensors</title>
  256.      <link>http://hdl.handle.net/2381/28379</link>
  257.      <description>Title: Activity awareness in context-aware systems using software sensors
  258. Authors: Pathan, Kamran Taj
  259. Abstract: Context-aware systems being a component of ubiquitous or pervasive computing environment sense the users’ physical and virtual surrounding to adapt their behaviour accordingly. To achieve activity context tracking devices are common practice. Service Oriented Architecture is based on collections of services that communicate with each other. The communication between users and services involves data that can be used to sense the activity context of the user. SOAP is a simple protocol to let applications exchange their information over the web. Semantic Web provides standards to express the relationship between data to allow machines to process data more intelligently.&#xD;
  260. This work proposes an approach for supporting context-aware activity sensing using software sensors. The main challenges in the work are specifying context information in a machine processable form, developing a mechanism that can understand the data extracted from exchanges of services, utilising the data extracted from these services, and the architecture that supports sensing with software sensors. To address these issues, we have provided a bridge to combine the traditional web services with the semantic web technologies, a knowledge structure that supports the activity context information in the context-aware environments and mapping methods that extract the data out of exchanges occurring between user and services and map it into a context model. The Direct Match, the Synonym Match and the Hierarchical Match methods are developed to put the extracted data from services to the knowledge structure.&#xD;
  261. This research will open doors to further develop automated and dynamic context-aware systems that can exploit the software sensors to sense the activity of the user in the context-aware environments.</description>
  262.      <pubDate>Fri, 08 Nov 2013 15:49:07 GMT</pubDate>
  263.      <guid isPermaLink="false">http://hdl.handle.net/2381/28379</guid>
  264.      <dc:date>2013-11-08T15:49:07Z</dc:date>
  265.    </item>
  266.    <item>
  267.      <title>Pure Type Systems with Corecursion on Streams: From Finite to Infinitary Normalisation</title>
  268.      <link>http://hdl.handle.net/2381/28332</link>
  269.      <description>Title: Pure Type Systems with Corecursion on Streams: From Finite to Infinitary Normalisation
  270. Authors: Severi, Paula; de Vries, Fer-Jan
  271. Abstract: In this paper, we use types for ensuring that programs involving streams are well-behaved.We extend pure type systems with a type constructor for streams, a modal operator next and a fixed point operator for expressing corecursion. This extension is called Pure Type Systems with Corecursion (CoPTS). The typed lambda calculus for reactive programs defined by Krishnaswami and Benton can be obtained as a CoPTS. CoPTSs allow us to study a wide range of typed lambda calculi extended with corecursion using only one framework. In particular, we study this extension for the calculus of constructions which is the underlying formal language of Coq. We use the machinery of infinitary rewriting and formalise the idea of well-behaved programs using the concept of infinitary normalisation. The set of finite and infinite terms is defined as a metric completion. We establish a precise connection between the modal operator (• A) and the metric at a syntactic level by relating a variable of type (• A) with the depth of all its occurrences in a term. This syntactic connection between the modal operator and the depth is the key to the proofs of infinitary weak and strong normalisation.</description>
  272.      <pubDate>Mon, 28 Oct 2013 15:24:43 GMT</pubDate>
  273.      <guid isPermaLink="false">http://hdl.handle.net/2381/28332</guid>
  274.      <dc:date>2013-10-28T15:24:43Z</dc:date>
  275.    </item>
  276.    <item>
  277.      <title>Succinct Representations of Binary Trees for Range Minimum Queries</title>
  278.      <link>http://hdl.handle.net/2381/28331</link>
  279.      <description>Title: Succinct Representations of Binary Trees for Range Minimum Queries
  280. Authors: Davoodi, Pooya; Raman, Rajeev; Satti, Satti Srinivasa
  281. Abstract: We provide two succinct representations of binary trees that can be used to represent the Cartesian tree of an array A of size n. Both the representations take the optimal 2n + o(n) bits of space in the worst case and support range minimum queries (RMQs) in O(1) time. The first one is a modification of the representation of Farzan and Munro (SWAT 2008); a consequence of this result is that we can represent the Cartesian tree of a random permutation in 1.92n + o(n) bits in expectation. The second one uses a well-known transformation between binary trees and ordinal trees, and ordinal tree operations to effect operations on the Cartesian tree. This provides an alternative, and more natural, way to view the 2D-Min-Heap of Fischer and Huen (SICOMP 2011). Furthermore, we show that the pre-processing needed to output the data structure can be performed in linear time using o(n) bits of extra working space, improving the result of Fischer and Heun who use n + o(n) bits working space.</description>
  282.      <pubDate>Mon, 28 Oct 2013 13:05:12 GMT</pubDate>
  283.      <guid isPermaLink="false">http://hdl.handle.net/2381/28331</guid>
  284.      <dc:date>2013-10-28T13:05:12Z</dc:date>
  285.    </item>
  286.    <item>
  287.      <title>Succinct representations of permutations and functions</title>
  288.      <link>http://hdl.handle.net/2381/28330</link>
  289.      <description>Title: Succinct representations of permutations and functions
  290. Authors: Munro, J. Ian; Raman, Rajeev; Raman, Venkatesh; Rao, Satti Srinivasa
  291. Abstract: We investigate the problem of succinctly representing an arbitrary permutation, π, on {0, . . . , n−1} so that π[superscript k](i) can be computed quickly for any i and any (positive or negative) integer power k. A representation taking (1 + ϵ)n lg n + O(1) bits suffices to compute arbitrary powers in constant time, for any positive constant ϵ ≤ 1. A representation taking the optimal ⌈lg n!⌉ + o(n) bits can be used to compute arbitrary powers in O(lg n/ lg lg n) time.&#xD;
  292. We then consider the more general problem of succinctly representing an arbitrary function, f : [n] → [n] so that f[superscript k](i) can be computed quickly for any i and any integer power k. We give a representation that takes (1 + ϵ)n lg n + O(1) bits, for any positive constant ϵ ≤ 1, and computes arbitrary positive powers in constant time. It can also be used to compute f[superscript k](i), for any negative integer k, in optimal O(1+ | f[superscript k](i) |) time. We place emphasis on the redundancy, or the space beyond the information-theoretic lower bound that the data structure uses in order to support operations efficiently. A number of lower bounds have recently been shown on the redundancy of data structures. These lower bounds confirm the space–time optimality of some of our solutions.&#xD;
  293. Furthermore, the redundancy of one of our structures "surpasses" a recent lower bound by Golynski [Golynski, SODA 2009], thus demonstrating the limitations of this lower bound.
  294. Description: NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science, 2012, 438, pp. 47-88, DOI: 10.1016/j.tcs.2012.03.005.</description>
  295.      <pubDate>Mon, 28 Oct 2013 12:29:09 GMT</pubDate>
  296.      <guid isPermaLink="false">http://hdl.handle.net/2381/28330</guid>
  297.      <dc:date>2013-10-28T12:29:09Z</dc:date>
  298.    </item>
  299.    <item>
  300.      <title>Dynamic Compressed Strings with Random Access</title>
  301.      <link>http://hdl.handle.net/2381/28247</link>
  302.      <description>Title: Dynamic Compressed Strings with Random Access
  303. Authors: Grossi, Roberto; Raman, Rajeev; Rao, Satti Srinivasa; Venturini, Rossano
  304. Abstract: We consider the problem of storing a string S in dynamic compressed form, while permitting operations directly on the compressed representation of S: access a substring of S; replace, insert or delete a symbol in S; count how many occurrences of a given symbol appear in any given prefix of S (called rank operation) and locate the position of the ith occurrence of a symbol inside S (called select operation). We discuss the time complexity of several combinations of these operations along with the entropy space bounds of the corresponding compressed indexes. In this way, we extend or improve the bounds of previous work by Ferragina and Venturini [TCS, 2007], Jansson et al. [ICALP, 2012], and Nekrich and Navarro [SODA, 2013].</description>
  305.      <pubDate>Fri, 04 Oct 2013 12:14:04 GMT</pubDate>
  306.      <guid isPermaLink="false">http://hdl.handle.net/2381/28247</guid>
  307.      <dc:date>2013-10-04T12:14:04Z</dc:date>
  308.    </item>
  309.    <item>
  310.      <title>Maintaining Transactional Integrity in Long Running Workflow Services: A Policy-Driven Framework</title>
  311.      <link>http://hdl.handle.net/2381/28168</link>
  312.      <description>Title: Maintaining Transactional Integrity in Long Running Workflow Services: A Policy-Driven Framework
  313. Authors: Ali, Manar Sayed Salamah
  314. Abstract: Business to Business integration is enhanced by Workflow structures, which allow for aggregating web services as interconnected business tasks to achieve a business outcome. Business processes naturally involve long running activities, and require transactional behavior across them addressed through general management, failure handling and compensation mechanisms. Loose coupling and the asynchronous nature of Web Services make an LRT subject to a wider range of communication failures. Two basic requirements of transaction management models are reliability and consistency despite failures. This research presents a framework to provide autonomous handling of long running transactions, based on dependencies which are derived from the workflow. The framework presents a solution for forward recovery from errors and compensations automatically applied to executing instances of workflows. The failure handling mechanism is based on the propagation of failures through a recursive hierarchical structure of transaction components (nodes and execution paths). The management system of transactions (COMPMOD) is implemented as a reactive system controller, where system components change their states based on rules in response to triggering of execution events. One practical feature of the model is the distinction of vital and non-vital components, allowing the process designer to express the cruciality of activities in the workflow with respect to the business logic. A novel feature of this research is that the approach permits the workflow designer to specify additional compensation dependencies which will be enforced. A notable feature is the extensibility of the model that is eased by the simple and declarative based formalism. In our approach, the main concern is the provision of flexible and reliable underlying control flow mechanisms supported by management policies. The main idea for incorporating policies is to manage the static structure of the workflow, as well as handling arbitrary failure and compensation events. Thus, we introduce new techniques and architectures to support enterprise integration solutions that support the dynamics of business needs.</description>
  315.      <pubDate>Thu, 12 Sep 2013 10:44:21 GMT</pubDate>
  316.      <guid isPermaLink="false">http://hdl.handle.net/2381/28168</guid>
  317.      <dc:date>2013-09-12T10:44:21Z</dc:date>
  318.    </item>
  319.    <item>
  320.      <title>Computing Minimum Spanning Trees with Uncertainty</title>
  321.      <link>http://hdl.handle.net/2381/28154</link>
  322.      <description>Title: Computing Minimum Spanning Trees with Uncertainty
  323. Authors: Erlebach, Thomas; Hoffmann, Michael; Krizanc, Danny; Mihal’ák, Matúš; Raman, Rajeev
  324. Editors: Albers, S.; Weil, P.
  325. Abstract: We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the graph only a set Aₑ, called an uncertainty area, that contains the actual edge weight wₑ is known. The algorithm can ‘update’ e to obtain the edge weight wₑ E Aₑ. The task is to output the edge set of a minimum spanning tree after a minimum number of updates.&#xD;
  326. An algorithm is k-update competitive if it makes at most k times as many updates as the optimum. We present a 2-update competitive algorithm if all areas Aₑ are open or trivial, which is the best possible among deterministic algorithms. The condition on the areas Aₑ is to exclude degenerate inputs for which no constant update competitive algorithm can exist.&#xD;
  327. Next, we consider a setting where the vertices of the graph correspond to points in Euclidean space and the weight of an edge is equal to the distance of its endpoints. The location of each point is initially given as an uncertainty area, and an update reveals the exact location of the point. We give a general relation between the edge uncertainty and the vertex uncertainty versions of a problem and use it to derive a 4-update competitive algorithm for the minimum spanning tree problem in the vertex uncertainty model. Again, we show that this is best possible among deterministic algorithms.</description>
  328.      <pubDate>Tue, 10 Sep 2013 13:05:03 GMT</pubDate>
  329.      <guid isPermaLink="false">http://hdl.handle.net/2381/28154</guid>
  330.      <dc:date>2013-09-10T13:05:03Z</dc:date>
  331.    </item>
  332.    <item>
  333.      <title>Inferring Extended Finite State Machine Models from Software Executions</title>
  334.      <link>http://hdl.handle.net/2381/28128</link>
  335.      <description>Title: Inferring Extended Finite State Machine Models from Software Executions
  336. Authors: Walkinshaw, Neil; Taylor, Ramsay; Derrick, John
  337. 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 two open-source software projects.</description>
  338.      <pubDate>Wed, 04 Sep 2013 09:00:20 GMT</pubDate>
  339.      <guid isPermaLink="false">http://hdl.handle.net/2381/28128</guid>
  340.      <dc:date>2013-09-04T09:00:20Z</dc:date>
  341.    </item>
  342.    <item>
  343.      <title>Attitudes towards User Experience (UX) Measurement</title>
  344.      <link>http://hdl.handle.net/2381/28125</link>
  345.      <description>Title: Attitudes towards User Experience (UX) Measurement
  346. Authors: Law, Lai-Chong; van Schaik, Paul
  347. Editors: Wiedenbeck, S
  348. Abstract: User experience (UX), as an immature research area, is still haunted by the challenges of defining the scope of UX in general and operationalising experiential qualities in particular. To explore the basic question whether UX constructs are measurable, we conducted semi-structured interviews with eleven UX professionals where a set of questions in relation to UX measurement were explored. The interviewees expressed scepticism as well as ambivalence towards UX measures and shared anecdotes related to such measures in different contexts. Besides, the data suggested that design-oriented UX professionals tended to be sceptical about UX measurement. To examine whether such an attitude prevailed in the HCI community, we conducted a survey with essentially the same set of questions used in the interviews. Altogether 367 responses were received; 170 of them were valid and analysed. The survey provided empirical evidence on this issue as a baseline for progress in UX measurement. Overall, results indicated that attitude was favourable and there were nuanced views on details of UX measurement, implying good prospects for its acceptance, given further progress in research and education in UX measurement where UX modelling grounded in theories can play a crucial role. Mutual recognition of the value of objective measures and subjective accounts of user experience can enhance the maturity of this area.</description>
  349.      <pubDate>Tue, 03 Sep 2013 14:47:00 GMT</pubDate>
  350.      <guid isPermaLink="false">http://hdl.handle.net/2381/28125</guid>
  351.      <dc:date>2013-09-03T14:47:00Z</dc:date>
  352.    </item>
  353.    <item>
  354.      <title>Algorithms for Wireless Communication and Sensor Networks</title>
  355.      <link>http://hdl.handle.net/2381/28100</link>
  356.      <description>Title: Algorithms for Wireless Communication and Sensor Networks
  357. Authors: Grant, Thomas
  358. Abstract: In this thesis we will address four problems concerned with algorithmic issues that arise from communication and sensor networks. &#xD;
  359. The problem of scheduling wireless transmissions under SINR constraints has received much attention for unicast (one to one) transmissions. We consider the scheduling problem for multicast requests of one sender to many receivers, and present a logarithmic approximation algorithm and an online lower bound for arbitrary power assignments.&#xD;
  360. We study the problem of maximising the lifetime of a sensor network for fault-tolerant target coverage in a setting with composite events, where a composite event is the simultaneous occurrence of one or more atomic events. We are the first to study this variation of the problem from a theoretical perspective, where each event must be covered twice and there are several event types, and we present a (6 + ɛ)-approximation algorithm for the problem.&#xD;
  361. The online strongly connected dominating set problem concerns the construction of a dominating set that is strongly connected at all times, and for every vertex not in the dominating set, there exists an edge to some vertex in the dominating set, and an edge from a vertex in the dominating set. We present a lower bound for deterministic online algorithms and present an algorithm that achieves competitive ratio matching the lower bound.&#xD;
  362. The monotone barrier resilience problem is to determine how many sensors must be removed from a sensor network, such that a monotone path can exist between two points that does not intersect any sensor. We present a polynomial time algorithm that can determine the monotone barrier resilience for sensor networks of convex pseudo-disks of equal width.</description>
  363.      <pubDate>Thu, 29 Aug 2013 10:44:20 GMT</pubDate>
  364.      <guid isPermaLink="false">http://hdl.handle.net/2381/28100</guid>
  365.      <dc:date>2013-08-29T10:44:20Z</dc:date>
  366.    </item>
  367.    <item>
  368.      <title>Mining Sequential Patterns from Probabilistic Databases</title>
  369.      <link>http://hdl.handle.net/2381/28080</link>
  370.      <description>Title: Mining Sequential Patterns from Probabilistic Databases
  371. Authors: Muzammal, Muhammad; Raman, Rajeev
  372. Editors: Huang, J.Z.; Cao, L.; Srivastava, J.
  373. Abstract: We consider sequential pattern mining in situations where there is uncertainty about which source an event is associated with. We model this in the probabilistic database framework and consider the problem of enumerating all sequences whose expected support is sufficiently large. Unlike frequent itemset mining in probabilistic databases [C. Aggarwal et al. KDD’09; Chui et al., PAKDD’07; Chui and Kao, PAKDD’08], we use dynamic programming (DP) to compute the probability that a source supports a sequence, and show that this suffices to compute the expected support of a sequential pattern. Next, we embed this DP algorithm into candidate generate-and-test approaches, and explore the pattern lattice both in a breadth-first (similar to GSP) and a depth-first (similar to SPAM) manner. We propose optimizations for efficiently computing the frequent 1-sequences, for re-using previously-computed results through incremental support computation, and for elmiminating candidate sequences without computing their support via probabilistic pruning. Preliminary experiments show that our optimizations are effective in improving the CPU cost.
  374. Description: Full text of this item is not currently available on the LRA.  The final published version may be available through the links above.</description>
  375.      <pubDate>Thu, 25 Jul 2013 10:38:00 GMT</pubDate>
  376.      <guid isPermaLink="false">http://hdl.handle.net/2381/28080</guid>
  377.      <dc:date>2013-07-25T10:38:00Z</dc:date>
  378.    </item>
  379.    <item>
  380.      <title>Range Extremum Queries</title>
  381.      <link>http://hdl.handle.net/2381/28079</link>
  382.      <description>Title: Range Extremum Queries
  383. Authors: Raman, Rajeev
  384. Abstract: There has been a renewal of interest in data structures for range extremum queries. In such problems, the input comprises N points, which are either elements of a d-dimensional matrix, that is, their coordinates are specified by the 1D submatrices they lie in (row and column indices for d = 2), or they are points in ℝ[superscript d] . Furthermore, associated with each point is a priority that is independent of the point’s coordinate. The objective is to pre-process the given points and priorities to answer the range maximum query (RMQ): given a d-dimensional rectangle, report the points with maximum priority. The objective is to minimze the space used by the data structure and the time taken to answer the above query. This talk surveys a number of recent developments in this area, focussing on the cases d = 1 and d = 2.</description>
  385.      <pubDate>Thu, 25 Jul 2013 09:04:54 GMT</pubDate>
  386.      <guid isPermaLink="false">http://hdl.handle.net/2381/28079</guid>
  387.      <dc:date>2013-07-25T09:04:54Z</dc:date>
  388.    </item>
  389.    <item>
  390.      <title>Random Access to Grammar-Compressed Strings</title>
  391.      <link>http://hdl.handle.net/2381/28052</link>
  392.      <description>Title: Random Access to Grammar-Compressed Strings
  393. Authors: Bille, Philip; Landau, Gad M.; Raman, Rajeev; Sadakane, Kunihiko; Satti, Srinivasa Rao; Weimann, Oren
  394. Abstract: Let S be a string of length N compressed into a context-free grammar S of size n. We present two representations of S achieving O(logN) random access time, and either O(n · α[subscript k](n)) construction time and space on the pointer machine model, or 0(n) construction time and space on the RAM. Here, α[subscript k](n) is the inverse of the k[superscript th] row of Ackermann's function. Our representations also efficiently support decompression of any substring in S: we can decompress any substring of length m in the same complexity as a single random access query and additional O(m) time. Combining these results with fast algorithms for uncompressed approximate string matching leads to several efficient algorithms for approximate string matching on grammar-compressed strings without decompression. For instance, we can find all approximate occurrences of a pattern P with at most k errors in time O(n(min{|P|k,k[superscript 4] + |P|}+logN)+occ), where occ is the number of occurrences of P in S. Finally, we are able to generalize our results to navigation and other operations on grammar-compressed trees. All of the above bounds significantly improve the currently best known results. To achieve these bounds, we introduce several new techniques and data structures of independent interest, including a predecessor data structure, two "biased" weighted ancestor data structures, and a compact representation of heavy-paths in grammars.</description>
  395.      <pubDate>Thu, 11 Jul 2013 12:05:53 GMT</pubDate>
  396.      <guid isPermaLink="false">http://hdl.handle.net/2381/28052</guid>
  397.      <dc:date>2013-07-11T12:05:53Z</dc:date>
  398.    </item>
  399.    <item>
  400.      <title>Using Evidential Reasoning to Make Qualified Predictions of Software Quality</title>
  401.      <link>http://hdl.handle.net/2381/28050</link>
  402.      <description>Title: Using Evidential Reasoning to Make Qualified Predictions of Software Quality
  403. Authors: Walkinshaw, Neil
  404. Editors: Wagner, S
  405. Abstract: Software quality is commonly characterised in a top-down manner. High-level notions such as quality are decomposed into hierarchies of sub-factors, ranging from abstract notions such as maintainability and reliability to lower-level notions such as test coverage or team-size. Assessments of abstract factors are derived from relevant sources of information about their respective lower-level sub-factors, by surveying sources such as metrics data and inspection reports. This can be difficult because (1) evidence might not be available, (2) interpretations of the data with respect to certain quality factors may be subject to doubt and intuition, and (3) there is no straightforward means of blending hierarchies of heterogeneous data into a single coherent and quantitative prediction of quality. This paper shows how Evidential Reasoning (ER) - a mathematical technique for reasoning about uncertainty and evidence - can address this problem. It enables the quality assessment to proceed in a bottom-up manner, by the provision of low-level assessments that make any uncertainty explicit, and automatically propagating these up to higher-level 'belief-functions' that accurately summarise the developer's opinion and make explicit any doubt or ignorance.</description>
  406.      <pubDate>Thu, 04 Jul 2013 15:35:16 GMT</pubDate>
  407.      <guid isPermaLink="false">http://hdl.handle.net/2381/28050</guid>
  408.      <dc:date>2013-07-04T15:35:16Z</dc:date>
  409.    </item>
  410.    <item>
  411.      <title>Ant Colony Optimization in Stationary and Dynamic Environments</title>
  412.      <link>http://hdl.handle.net/2381/27971</link>
  413.      <description>Title: Ant Colony Optimization in Stationary and Dynamic Environments
  414. Authors: Mavrovouniotis, Michalis
  415. Abstract: The ant colony optimization (ACO) metaheuristic is inspired by the foraging behaviour of real ant colonies. Similarly with other metaheuristics, ACO suffers from stagnation behaviour, where all ants construct the same solution from early stages.&#xD;
  416. In result, the solution quality may be degraded because the population may get trapped on local optima. In this thesis, we propose a novel approach, called direct communication (DC) scheme, that helps ACO algorithms to escape from a local optimum if they get trapped. The experimental results on two routing problems showed that the DC scheme is effective.&#xD;
  417. Usually, researchers are focused on problems in which they have static environment.&#xD;
  418. In the last decade, there is a growing interest to apply nature-inspired metaheuristics in optimization problems with dynamic environments. Usually, dynamic optimization problems (DOPs) are addressed using evolutionary algorithms. In this thesis, we apply several novel ACO algorithms in two routing DOPs. The proposed ACO algorithms are integrated with immigrants schemes in which immigrant ants are generated, either randomly or with the use of knowledge from previous environment(s), and replace other ants in the current population. The experimental results showed that each proposed algorithm performs better in different dynamic cases, and that they have better performance than other peer ACO algorithms in general.&#xD;
  419. The existing benchmark generators for DOPs are developed for binary-encoded combinatorial problems. Since routing problems are usually permutation-encoded combinatorial problems, the dynamic environments used in the experiments are generated using a novel benchmark generator that converts a static problem instance to a dynamic one. The specific dynamic benchmark generator changes the fitness landscape of the problem, which causes the optimum to change in every environmental change. Furthermore in this thesis, another benchmark generator is proposed which moves the population to another location in the fitness landscape, instead of modifying it. In this way, the optimum is known and one can see how close to the optimum an algorithm performs during the environmental changes.</description>
  420.      <pubDate>Fri, 14 Jun 2013 09:45:27 GMT</pubDate>
  421.      <guid isPermaLink="false">http://hdl.handle.net/2381/27971</guid>
  422.      <dc:date>2013-06-14T09:45:27Z</dc:date>
  423.    </item>
  424.    <item>
  425.      <title>Completeness of Conversion between Reactive Programs for Ultrametric Models</title>
  426.      <link>http://hdl.handle.net/2381/27961</link>
  427.      <description>Title: Completeness of Conversion between Reactive Programs for Ultrametric Models
  428. Authors: Severi, Paula; de Vries, Fer-Jan
  429. Abstract: In 1970 Friedman proved completeness of beta eta conversion in the simply-typed lambda calculus for the set-theoretical model. Recently Krishnaswami and Benton have captured the essence of Hudak’s reactive programs in an extension of simply typed lambda calculus with causal streams and a temporal modality and provided this typed lambda calculus for reactive programs with a sound ultrametric semantics.&#xD;
  430. We show that beta eta conversion in the typed lambda calculus of reactive programs is complete for the ultrametric model.</description>
  431.      <pubDate>Tue, 11 Jun 2013 10:45:55 GMT</pubDate>
  432.      <guid isPermaLink="false">http://hdl.handle.net/2381/27961</guid>
  433.      <dc:date>2013-06-11T10:45:55Z</dc:date>
  434.    </item>
  435.    <item>
  436.      <title>Broadcasting, Coverage, Energy Efficiency and Network Capacity in Wireless Networks</title>
  437.      <link>http://hdl.handle.net/2381/27808</link>
  438.      <description>Title: Broadcasting, Coverage, Energy Efficiency and Network Capacity in Wireless Networks
  439. Authors: Henna, Shagufta
  440. Abstract: Broadcasting, coverage, duty cycling, and capacity improvement are some of the important areas of interest in Wireless Networks. We address different problems related with broadcasting, duty cycling, and capacity improvement by sensing different network conditions and dynamically adapting to them. We propose two cross layer broadcasting protocols called CASBA and CMAB which dynamically adapt to network conditions of congestion and mobility. We also propose a broadcasting protocol called DASBA which dynamically adapts to local node density. CASBA, CMAB, and DASBA improve the reachability while minimizing the broadcast cost. Duty cycling is an efficient mechanism to conserve energy in Wireless Sensor Networks (WSNs). Existing duty cycling techniques are unable to handle the contention under dynamic traffic loads. Our proposed protocol called SA-RI-MAC handles traffic contention much more efficiently than RI-MAC without sacrificing the energy efficiency. It improves the delivery ratio with a significant reduction in the latency and energy consumption. Due to limited battery life and fault tolerance issues posed by WSNs, efficient methods which ensure reliable coverage are highly desirable. One solution is to use disjoint set covers to cover the targets. We formulate a problem called MDC which addresses the maximum coverage by using disjoint set covers S1 and S2. We prove that MDC is NP-complete and propose a √n-approximation algorithm for the MDC problem to cover n targets. The use of multi-channel MAC protocols improves the capacity of wireless networks. Efficient multi-channel MAC protocols aim to utilize multiple channels effectively. Our proposed multi-channel MAC protocol called LCV-MMAC effectively utilizes the multiple channels by handling the control channel saturation.  LCV-MMAC demonstrates significantly better throughput and fairness compared to DCA, MMAC, and AMCP in different network scenarios.</description>
  441.      <pubDate>Wed, 13 Mar 2013 11:14:56 GMT</pubDate>
  442.      <guid isPermaLink="false">http://hdl.handle.net/2381/27808</guid>
  443.      <dc:date>2013-03-13T11:14:56Z</dc:date>
  444.    </item>
  445.    <item>
  446.      <title>Zooming out of Membrane Graph Transformation Systems</title>
  447.      <link>http://hdl.handle.net/2381/27791</link>
  448.      <description>Title: Zooming out of Membrane Graph Transformation Systems
  449. Authors: Bapodra, Mayur
  450. Abstract: Living cells offer a rich variety of complex interactions and interesting structures to those wishing to model processes in systems biology. Of particular interest is the hierarchical nature of cell configurations, the compartmentalized reactions that can occur within individual cells, and the interaction between different levels of this hierarchy. Graph transformation systems are an intuitive and readable modelling paradigm that lends itself to representing such systems since graphs can be utilised to represent this rich structural information, while graph rewriting rules can concisely describe cell reactions. We formulate a generic graph transformation model that captures many functional properties of membrane (or P) systems that take inspiration from such cell biological processes. The main focus is then on abstraction of systems defined as instances of this metamodel, which we refer to as membrane graph transformation systems. Often, such systems are analysed by stochastic simulation, as this allows us to examine their overall, emergent behaviour, incorporating the effect that randomness may have on the results. Stochastic simulation can be resource intensive, limiting the applicability of many modelling languages to real biological systems. To improve performance and the scalability of modelling, we formalize a methodology that hides detail in the lowest level of the hierarchy, but retains any important information as attributes. We then train the parameter of the abstract model using Bayesian networks so that the local, per-rule behaviour of the original, concrete model is preserved. Consequently, trends in global properties are preserved, such as the way in which they change with respect to the stochastic parameters of certain rules. The methodology is demonstrated and evaluated against two case studies: a hypothetical immunological response and a peer-to-peer voice over IP network.</description>
  451.      <pubDate>Tue, 12 Mar 2013 11:26:40 GMT</pubDate>
  452.      <guid isPermaLink="false">http://hdl.handle.net/2381/27791</guid>
  453.      <dc:date>2013-03-12T11:26:40Z</dc:date>
  454.    </item>
  455.    <item>
  456.      <title>The SiXML Project: SiXDOM 1.2</title>
  457.      <link>http://hdl.handle.net/2381/27744</link>
  458.      <description>Title: The SiXML Project: SiXDOM 1.2
  459. Authors: Delpratt, O’Neil; Joannou, Stelios; Rahman, Naila; Raman, Rajeev
  460. Abstract: This White Paper introduces the SiXML project, developed by O’Neil Delpratt, Stelios Joannou, Naila Rahman and Rajeev Raman at the University of Leicester. SiXML uses the novel technology of succinct data structures to process XML documents in their entirety in main memory with a very low memory footprint. SiXML greatly improves the scalability of XML processing, both in terms of volume of data that can be handled and processing time. SiXML software can be downloaded in the accompanying zip file.
  461. Description: This is an updated version of the SDOM 1.0 software available at http://hdl.handle.net/2381/3363.</description>
  462.      <pubDate>Fri, 08 Feb 2013 09:10:48 GMT</pubDate>
  463.      <guid isPermaLink="false">http://hdl.handle.net/2381/27744</guid>
  464.      <dc:date>2013-02-08T09:10:48Z</dc:date>
  465.    </item>
  466.    <item>
  467.      <title>Matching of Service Feature Diagrams based on Linear Logic</title>
  468.      <link>http://hdl.handle.net/2381/27741</link>
  469.      <description>Title: Matching of Service Feature Diagrams based on Linear Logic
  470. Authors: Naeem, Muhammad
  471. Abstract: Managing variability is essential for an efficient implementation of end-user services that can be customised to individual needs. Apart from variations in selection and orchestration, also third-party services may have to be customisable. Although feature diagrams provide a high-level visual notation for variability, their use for specifying variability of services raises the problem of matching a required feature diagram against a set of provided ones.&#xD;
  472. In particular, the established interpretation of feature diagrams in Propositional Logic is not expressive enough for matching in the context of service variability. The problem becomes more visible when a certain requirement is going to be satisfied by a combination of multiple offers with overlapping features, which is a consequence of idempotence in Propositional Logic.&#xD;
  473. To address this problem, we propose service feature diagrams with semantics in Linear Logic. Linear Logic only allows the use of idempotence on the propositions with modalities. The permissible selection of features of a service feature diagram is called an instance diagram. We provide rules to obtain instance diagrams from the service feature diagram. The semantics of instance diagrams are also supported by Linear Logic.&#xD;
  474. This thesis not only introduces service feature diagrams, but also formalises their matching as linear deduction. We propose two categories of rules to verify diagrammatically if a collection of service descriptions satisfy the requirements. First, graphical matching rules are used to match service feature diagrams of requestor and provider. Second, graphical merging rules are used to merge multiple feature diagrams contributing to satisfy the requestor’s demands. We prove the correctness of these rules using the inference system of Linear Logic. We also provide the analysis of graphical rules and show that the application of the graphical rules is independent of the context in service feature diagram, i.e., graphical rule can be applied anywhere in a service feature diagram.</description>
  475.      <pubDate>Thu, 07 Feb 2013 10:46:02 GMT</pubDate>
  476.      <guid isPermaLink="false">http://hdl.handle.net/2381/27741</guid>
  477.      <dc:date>2013-02-07T10:46:02Z</dc:date>
  478.    </item>
  479.    <item>
  480.      <title>Online Algorithms for Temperature Aware Job Scheduling Problems</title>
  481.      <link>http://hdl.handle.net/2381/27686</link>
  482.      <description>Title: Online Algorithms for Temperature Aware Job Scheduling Problems
  483. Authors: Birks, Martin David
  484. Abstract: Temperature is an important consideration when designing microprocessors. When exposed to high temperatures component reliability can be reduced, while some components completely fail over certain temperatures. We consider the design and analysis of online algorithms; in particular algorithms that use knowledge of the amount of heat a job will generate. We consider algorithms with two main objectives. The first is maximising job throughput. We show upper and lower bounds for the case where jobs are unit length, both when jobs are weighted and unweighted. Many of these bounds are matching for all cooling factors in the single and multiple machine case.&#xD;
  485. We extend this to consider the single machine case where jobs have longer than unit length. When all jobs are equal length we show matching bounds for the case without preemption. We also show that both models of pre-emption enable at most a slight reduction in the competitive ratio of algorithms. We then consider when jobs have variable lengths. We analyse both the models of unweighted jobs and the jobs with weights proportional to their length. We show bounds that match within constant factors, in the non-preemptive and both preemptive models.&#xD;
  486. The second objective we consider is minimising flow time. We consider the objective of minimising the total flow time of a schedule. We show NP-hardness and inapproximability results for the offline case, as well as giving an approximation algorithm for the case where all release times are equal. For the online case we give some negative results for the case where maximum job heats are bounded. We also give some results for a resource augmentation model that include a 1-competitive algorithm when the extra power for the online algorithm is high enough. Finally we consider the objective of minimising the maximum flow time of any job in a schedule.</description>
  487.      <pubDate>Thu, 17 Jan 2013 11:55:28 GMT</pubDate>
  488.      <guid isPermaLink="false">http://hdl.handle.net/2381/27686</guid>
  489.      <dc:date>2013-01-17T11:55:28Z</dc:date>
  490.    </item>
  491.    <item>
  492.      <title>Partner-Based Scheduling and Routing for Grid Workflows</title>
  493.      <link>http://hdl.handle.net/2381/27683</link>
  494.      <description>Title: Partner-Based Scheduling and Routing for Grid Workflows
  495. Authors: Ashraf, Jawad
  496. Abstract: The Grid has enabled the scientific community to make faster progress. Scientific experiments and data analyses once spanning several years can now be completed in a matter of hours. With the advancement of technology, the execution of scientific experiments, often represented as workflows, has become more demanding. Thus, there is a vital need for improvements in the scheduling of scientific workflows.  Efficient execution of scientific workflows can be achieved by the timely allocation of the resources. Advance reservation can ensure the future availability of heterogeneous resources and help a scheduler to produce better schedules.&#xD;
  497. We propose a novel resource mapping technique for jobs of a Grid workflow in an advance reservation environment. Using a dynamic critical path based job selection method, our proposed technique considers the conditional mapping of parent and child jobs to the same resource, trying to minimise the communication duration between jobs and thus optimising the workflow completion time. The proposed method is analysed in both static and dynamic environments, and the simulation results show encouraging performance especially for workflows where the communication costs are higher than the computation costs.&#xD;
  498. We also propose a hybrid of multiple scheduling heuristics for the aforementioned problem, which chooses the best among multiple schedules computed by different algorithms. Simulation results show a significant improvement over well known scheduling heuristics in terms of workflow completion time.&#xD;
  499. Considering the advance reservation environment, a better schedule for the earliest completion of a workflow can be achieved if better paths can be found for the transfer of data files between jobs executed on different resources. We propose a K-shortest path based routing algorithm for finding good paths in the advance reservation environment. The results show that our proposed algorithm performs very well in terms of the earliest arrival time of the data.&#xD;
  500. Finally, we also study a modified partner based scheduling heuristic for non-advance reservation environments. The results demonstrate that our proposed algorithm is a promising candidate for adoption in such Grid environments.</description>
  501.      <pubDate>Wed, 16 Jan 2013 14:15:54 GMT</pubDate>
  502.      <guid isPermaLink="false">http://hdl.handle.net/2381/27683</guid>
  503.      <dc:date>2013-01-16T14:15:54Z</dc:date>
  504.    </item>
  505.    <item>
  506.      <title>Mining Sequential Patterns from Probabilistic Data</title>
  507.      <link>http://hdl.handle.net/2381/27638</link>
  508.      <description>Title: Mining Sequential Patterns from Probabilistic Data
  509. Authors: Muzammal, Muhammad
  510. Abstract: Sequential Pattern Mining (SPM) is an important data mining problem. Although it is assumed in classical SPM that the data to be mined is deterministic, it is now recognized that data obtained from a wide variety of data sources is inherently noisy or uncertain, such as data from sensors or data being collected from the web from different (potentially conflicting) data sources. Probabilistic databases is a popular framework for modelling uncertainty. Recently, several data mining and ranking problems have been studied in probabilistic databases. To the best of our knowledge, this is the first systematic study of mining sequential patterns from probabilistic databases.&#xD;
  511. In this work, we consider the kind of uncertainties that could arise in SPM. We propose four novel uncertainty models for SPM, namely tuple-level uncertainty, event-level uncertainty, source-level uncertainty and source-level uncertainty in deduplication, all of which fit into the probabilistic databases framework, and motivate them using potential real-life scenarios. We then define the interestingness predicate for two measures of interestingness, namely expected support and probabilistic frequentness. Next, we consider the computational complexity of evaluating the interestingness predicate, for various combinations of uncertainty models and interestingness measures, and show that different combinations have very different outcomes from a complexity theoretic viewpoint: whilst some cases are computationally tractable, we show other cases to be computationally intractable.&#xD;
  512. We give a dynamic programming algorithm to compute the source support probability and hence the expected support of a sequence in a source-level uncertain database. We then propose optimizations to speedup the support computation task. Next, we propose probabilistic SPM algorithms based on the candidate generation and pattern growth frameworks for the source-level uncertainty model and the expected support measure. We implement these algorithms and give an empirical evaluation of the probabilistic SPM algorithms and show the scalability of these algorithms under different parameter settings using both real and synthetic datasets. Finally, we demonstrate the effectiveness of the probabilistic SPM framework at extracting meaningful patterns in the presence of noise.</description>
  513.      <pubDate>Thu, 20 Dec 2012 11:37:59 GMT</pubDate>
  514.      <guid isPermaLink="false">http://hdl.handle.net/2381/27638</guid>
  515.      <dc:date>2012-12-20T11:37:59Z</dc:date>
  516.    </item>
  517.    <item>
  518.      <title>Model-Based Testing Using Visual Contracts</title>
  519.      <link>http://hdl.handle.net/2381/27571</link>
  520.      <description>Title: Model-Based Testing Using Visual Contracts
  521. Authors: Khan, Tamim Ahmed
  522. Abstract: Web services only expose interface level information, abstracting away implementation details. Testing is a time consuming and resource-intensive activity. Therefore, it is important to minimize the set of test cases executed without compromising quality. Since white-box testing techniques and traditional structural coverage criteria require access to code, we require a model-based approach for web service testing. Testing relies on oracles to provide expected outcomes for test cases and, if implemented manually, they depend on testers’ understanding of functional requirements to decide the correct response of the system on every given test case. As a result, they are costly in creation and maintenance and their quality depends on the correct interpretation of the requirements. Alternatively, if suitable specifications are available, oracles can be generated automatically at lower cost and with better quality. We propose to specify service operations as visual contracts with executable formal specifications as rules of a typed attributed graph transformation system. We associate operation signatures with these rules for providing test oracles.&#xD;
  523. We analyze dependencies and conflicts between visual contracts to develop a dependency graph. We propose model-based coverage criteria, considering this dependency graph, to assess the completeness of test suites. We also propose a mechanism to find out which of the potential dependencies and the conflicts were exercised by a given test case. While executing the tests, the model is simulated and coverage is recorded as well as measured against the criteria. The criteria are formalized and the dynamic detection of conflicts and dependencies is developed. This requires keeping track of occurrences and overlaps of pre- and post-conditions, their enabling and disabling, in successive model states, and interpreting these in terms of the static dependency graph.&#xD;
  524. Systems evolve over time and need retesting each time there is a change. In order to verify that the quality of the system is maintained, we use regression testing. Since regression test suites tend to be large, we isolate the affected part in the system only retesting affected parts by rerunning a selected subset of the total test suite. We analyze the test cases that were executed on both versions and propose a mechanism to transfer the coverage provided by these test cases. This information helps us to assess the completeness of the test suite on the new version without executing all of it.</description>
  525.      <pubDate>Fri, 02 Nov 2012 12:37:51 GMT</pubDate>
  526.      <guid isPermaLink="false">http://hdl.handle.net/2381/27571</guid>
  527.      <dc:date>2012-11-02T12:37:51Z</dc:date>
  528.    </item>
  529.    <item>
  530.      <title>PCTL model checking of Markov chains: Truth and falsity as winning strategies in games</title>
  531.      <link>http://hdl.handle.net/2381/26567</link>
  532.      <description>Title: PCTL model checking of Markov chains: Truth and falsity as winning strategies in games
  533. Authors: Fecher, H; Huth, M; Piterman, N; Wagner, D</description>
  534.      <pubDate>Wed, 24 Oct 2012 09:21:52 GMT</pubDate>
  535.      <guid isPermaLink="false">http://hdl.handle.net/2381/26567</guid>
  536.      <dc:date>2012-10-24T09:21:52Z</dc:date>
  537.    </item>
  538.    <item>
  539.      <title>A hierarchy of reverse bisimulations on stable configuration structures</title>
  540.      <link>http://hdl.handle.net/2381/26332</link>
  541.      <description>Title: A hierarchy of reverse bisimulations on stable configuration structures
  542. Authors: Phillips, I; Ulidowski, I</description>
  543.      <pubDate>Wed, 24 Oct 2012 09:21:34 GMT</pubDate>
  544.      <guid isPermaLink="false">http://hdl.handle.net/2381/26332</guid>
  545.      <dc:date>2012-10-24T09:21:34Z</dc:date>
  546.    </item>
  547.    <item>
  548.      <title>Enriched Logical Connections</title>
  549.      <link>http://hdl.handle.net/2381/21632</link>
  550.      <description>Title: Enriched Logical Connections
  551. Authors: Kurz, A; Velebil, J</description>
  552.      <pubDate>Wed, 24 Oct 2012 09:10:17 GMT</pubDate>
  553.      <guid isPermaLink="false">http://hdl.handle.net/2381/21632</guid>
  554.      <dc:date>2012-10-24T09:10:17Z</dc:date>
  555.    </item>
  556.    <item>
  557.      <title>Soft constraints of difference and equality</title>
  558.      <link>http://hdl.handle.net/2381/21619</link>
  559.      <description>Title: Soft constraints of difference and equality
  560. Authors: Hebrard, E; Marx, D; O'Sullivan, B; Razgon, I</description>
  561.      <pubDate>Wed, 24 Oct 2012 09:10:16 GMT</pubDate>
  562.      <guid isPermaLink="false">http://hdl.handle.net/2381/21619</guid>
  563.      <dc:date>2012-10-24T09:10:16Z</dc:date>
  564.    </item>
  565.    <item>
  566.      <title>Finitary functors: From set to Preord and Poset</title>
  567.      <link>http://hdl.handle.net/2381/21606</link>
  568.      <description>Title: Finitary functors: From set to Preord and Poset
  569. Authors: Balan, A; Kurz, A</description>
  570.      <pubDate>Wed, 24 Oct 2012 09:10:16 GMT</pubDate>
  571.      <guid isPermaLink="false">http://hdl.handle.net/2381/21606</guid>
  572.      <dc:date>2012-10-24T09:10:16Z</dc:date>
  573.    </item>
  574.    <item>
  575.      <title>Relation liftings on preorders and posets</title>
  576.      <link>http://hdl.handle.net/2381/21605</link>
  577.      <description>Title: Relation liftings on preorders and posets
  578. Authors: Bílková, M; Kurz, A; Petrişan, D; Velebil, J</description>
  579.      <pubDate>Wed, 24 Oct 2012 09:10:16 GMT</pubDate>
  580.      <guid isPermaLink="false">http://hdl.handle.net/2381/21605</guid>
  581.      <dc:date>2012-10-24T09:10:16Z</dc:date>
  582.    </item>
  583.    <item>
  584.      <title>Verifying Distributed Systems: the Operational Approach</title>
  585.      <link>http://hdl.handle.net/2381/20789</link>
  586.      <description>Title: Verifying Distributed Systems: the Operational Approach
  587. Authors: Ridge, T</description>
  588.      <pubDate>Wed, 24 Oct 2012 09:08:59 GMT</pubDate>
  589.      <guid isPermaLink="false">http://hdl.handle.net/2381/20789</guid>
  590.      <dc:date>2012-10-24T09:08:59Z</dc:date>
  591.    </item>
  592.    <item>
  593.      <title>Efficient algorithms for finding a longest common increasing subsequence</title>
  594.      <link>http://hdl.handle.net/2381/20787</link>
  595.      <description>Title: Efficient algorithms for finding a longest common increasing subsequence
  596. Authors: Chan, W-T; Zhang, Y; Ye, D; Fung, SPY; Zhu, H</description>
  597.      <pubDate>Wed, 24 Oct 2012 09:08:59 GMT</pubDate>
  598.      <guid isPermaLink="false">http://hdl.handle.net/2381/20787</guid>
  599.      <dc:date>2012-10-24T09:08:59Z</dc:date>
  600.    </item>
  601.    <item>
  602.      <title>The semantics of x86-CC multiprocessor machine code</title>
  603.      <link>http://hdl.handle.net/2381/20788</link>
  604.      <description>Title: The semantics of x86-CC multiprocessor machine code
  605. Authors: Sarkar, S; Sewell, P; Nardelli, FZ; Owens, S; Ridge, T; Braibant, T; Myreen, MO; Alglave, J</description>
  606.      <pubDate>Wed, 24 Oct 2012 09:08:59 GMT</pubDate>
  607.      <guid isPermaLink="false">http://hdl.handle.net/2381/20788</guid>
  608.      <dc:date>2012-10-24T09:08:59Z</dc:date>
  609.    </item>
  610.    <item>
  611.      <title>Rigorous protocol design in practice: An optical packet-switch MAC in HOL</title>
  612.      <link>http://hdl.handle.net/2381/20790</link>
  613.      <description>Title: Rigorous protocol design in practice: An optical packet-switch MAC in HOL
  614. Authors: Biltcliffe, A; Ridge, T; Sewell, P; Dales, M; Jansen, S</description>
  615.      <pubDate>Wed, 24 Oct 2012 09:08:59 GMT</pubDate>
  616.      <guid isPermaLink="false">http://hdl.handle.net/2381/20790</guid>
  617.      <dc:date>2012-10-24T09:08:59Z</dc:date>
  618.    </item>
  619.    <item>
  620.      <title>Modelling user experience - An agenda for research and practice</title>
  621.      <link>http://hdl.handle.net/2381/20594</link>
  622.      <description>Title: Modelling user experience - An agenda for research and practice
  623. Authors: Law, EL-C; Van Schaik P</description>
  624.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
  625.      <guid isPermaLink="false">http://hdl.handle.net/2381/20594</guid>
  626.      <dc:date>2012-10-24T09:08:51Z</dc:date>
  627.    </item>
  628.  </channel>
  629. </rss>
  630.  
  631.  

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