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!

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>2013-06-17T08:43:01Z</dc:date>
      ^

• line 21, column 6: An item should not include both pubDate and dc:date (50 occurrences) [help]

        <dc:date>2013-06-14T09:45:27Z</dc:date>
        ^

• line 489, 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>Mon, 17 Jun 2013 08:43:01 GMT</pubDate>
8.    <dc:date>2013-06-17T08:43:01Z</dc:date>
9.    <item>
10.      <title>Ant Colony Optimization in Stationary and Dynamic Environments</title>
11.      <link>http://hdl.handle.net/2381/27971</link>
12.      <description>Title: Ant Colony Optimization in Stationary and Dynamic Environments
13. Authors: Mavrovouniotis, Michalis
14. 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.

15. 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.

16. Usually, researchers are focused on problems in which they have static environment.

17. 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.

18. 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>
19.      <pubDate>Fri, 14 Jun 2013 09:45:27 GMT</pubDate>
20.      <guid isPermaLink="false">http://hdl.handle.net/2381/27971</guid>
21.      <dc:date>2013-06-14T09:45:27Z</dc:date>
22.    </item>
23.    <item>
24.      <title>Completeness of Conversion between Reactive Programs for Ultrametric Models</title>
25.      <link>http://hdl.handle.net/2381/27961</link>
26.      <description>Title: Completeness of Conversion between Reactive Programs for Ultrametric Models
27. Authors: Severi, Paula; de Vries, Fer-Jan
28. 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.

29. We show that beta eta conversion in the typed lambda calculus of reactive programs is complete for the ultrametric model.</description>
30.      <pubDate>Tue, 11 Jun 2013 10:45:55 GMT</pubDate>
31.      <guid isPermaLink="false">http://hdl.handle.net/2381/27961</guid>
32.      <dc:date>2013-06-11T10:45:55Z</dc:date>
33.    </item>
34.    <item>
35.      <title>Broadcasting, Coverage, Energy Efficiency and Network Capacity in Wireless Networks</title>
36.      <link>http://hdl.handle.net/2381/27808</link>
37.      <description>Title: Broadcasting, Coverage, Energy Efficiency and Network Capacity in Wireless Networks
38. Authors: Henna, Shagufta
39. 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>
40.      <pubDate>Wed, 13 Mar 2013 11:14:56 GMT</pubDate>
41.      <guid isPermaLink="false">http://hdl.handle.net/2381/27808</guid>
42.      <dc:date>2013-03-13T11:14:56Z</dc:date>
43.    </item>
44.    <item>
45.      <title>Zooming out of Membrane Graph Transformation Systems</title>
46.      <link>http://hdl.handle.net/2381/27791</link>
47.      <description>Title: Zooming out of Membrane Graph Transformation Systems
48. Authors: Bapodra, Mayur
49. 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>
50.      <pubDate>Tue, 12 Mar 2013 11:26:40 GMT</pubDate>
51.      <guid isPermaLink="false">http://hdl.handle.net/2381/27791</guid>
52.      <dc:date>2013-03-12T11:26:40Z</dc:date>
53.    </item>
54.    <item>
55.      <title>The SiXML Project: SiXDOM 1.2</title>
56.      <link>http://hdl.handle.net/2381/27744</link>
57.      <description>Title: The SiXML Project: SiXDOM 1.2
58. Authors: Delpratt, O’Neil; Joannou, Stelios; Rahman, Naila; Raman, Rajeev
59. 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.
60. Description: This is an updated version of the SDOM 1.0 software available at http://hdl.handle.net/2381/3363.</description>
61.      <pubDate>Fri, 08 Feb 2013 09:10:48 GMT</pubDate>
62.      <guid isPermaLink="false">http://hdl.handle.net/2381/27744</guid>
63.      <dc:date>2013-02-08T09:10:48Z</dc:date>
64.    </item>
65.    <item>
66.      <title>Matching of Service Feature Diagrams based on Linear Logic</title>
67.      <link>http://hdl.handle.net/2381/27741</link>
68.      <description>Title: Matching of Service Feature Diagrams based on Linear Logic
69. Authors: Naeem, Muhammad
70. 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.

71. 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.

72. 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.

73. 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>
74.      <pubDate>Thu, 07 Feb 2013 10:46:02 GMT</pubDate>
75.      <guid isPermaLink="false">http://hdl.handle.net/2381/27741</guid>
76.      <dc:date>2013-02-07T10:46:02Z</dc:date>
77.    </item>
78.    <item>
79.      <title>Online Algorithms for Temperature Aware Job Scheduling Problems</title>
80.      <link>http://hdl.handle.net/2381/27686</link>
81.      <description>Title: Online Algorithms for Temperature Aware Job Scheduling Problems
82. Authors: Birks, Martin David
83. 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.

84. 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.

85. 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>
86.      <pubDate>Thu, 17 Jan 2013 11:55:28 GMT</pubDate>
87.      <guid isPermaLink="false">http://hdl.handle.net/2381/27686</guid>
88.      <dc:date>2013-01-17T11:55:28Z</dc:date>
89.    </item>
90.    <item>
91.      <title>Partner-Based Scheduling and Routing for Grid Workflows</title>
92.      <link>http://hdl.handle.net/2381/27683</link>
93.      <description>Title: Partner-Based Scheduling and Routing for Grid Workflows
94. Authors: Ashraf, Jawad
95. 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.

96. 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.

97. 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.

98. 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.

99. 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>
100.      <pubDate>Wed, 16 Jan 2013 14:15:54 GMT</pubDate>
101.      <guid isPermaLink="false">http://hdl.handle.net/2381/27683</guid>
102.      <dc:date>2013-01-16T14:15:54Z</dc:date>
103.    </item>
104.    <item>
105.      <title>Mining Sequential Patterns from Probabilistic Data</title>
106.      <link>http://hdl.handle.net/2381/27638</link>
107.      <description>Title: Mining Sequential Patterns from Probabilistic Data
108. Authors: Muzammal, Muhammad
109. 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.

110. 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.

111. 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>
112.      <pubDate>Thu, 20 Dec 2012 11:37:59 GMT</pubDate>
113.      <guid isPermaLink="false">http://hdl.handle.net/2381/27638</guid>
114.      <dc:date>2012-12-20T11:37:59Z</dc:date>
115.    </item>
116.    <item>
117.      <title>Model-Based Testing Using Visual Contracts</title>
118.      <link>http://hdl.handle.net/2381/27571</link>
119.      <description>Title: Model-Based Testing Using Visual Contracts
120. Authors: Khan, Tamim Ahmed
121. 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.

122. 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.

123. 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>
124.      <pubDate>Fri, 02 Nov 2012 12:37:51 GMT</pubDate>
125.      <guid isPermaLink="false">http://hdl.handle.net/2381/27571</guid>
126.      <dc:date>2012-11-02T12:37:51Z</dc:date>
127.    </item>
128.    <item>
129.      <title>PCTL model checking of Markov chains: Truth and falsity as winning strategies in games</title>
130.      <link>http://hdl.handle.net/2381/26567</link>
131.      <description>Title: PCTL model checking of Markov chains: Truth and falsity as winning strategies in games
132. Authors: Fecher, H; Huth, M; Piterman, N; Wagner, D</description>
133.      <pubDate>Wed, 24 Oct 2012 09:21:52 GMT</pubDate>
134.      <guid isPermaLink="false">http://hdl.handle.net/2381/26567</guid>
135.      <dc:date>2012-10-24T09:21:52Z</dc:date>
136.    </item>
137.    <item>
138.      <title>A hierarchy of reverse bisimulations on stable configuration structures</title>
139.      <link>http://hdl.handle.net/2381/26332</link>
140.      <description>Title: A hierarchy of reverse bisimulations on stable configuration structures
141. Authors: Phillips, I; Ulidowski, I</description>
142.      <pubDate>Wed, 24 Oct 2012 09:21:34 GMT</pubDate>
143.      <guid isPermaLink="false">http://hdl.handle.net/2381/26332</guid>
144.      <dc:date>2012-10-24T09:21:34Z</dc:date>
145.    </item>
146.    <item>
147.      <title>Enriched Logical Connections</title>
148.      <link>http://hdl.handle.net/2381/21632</link>
149.      <description>Title: Enriched Logical Connections
150. Authors: Kurz, A; Velebil, J</description>
151.      <pubDate>Wed, 24 Oct 2012 09:10:17 GMT</pubDate>
152.      <guid isPermaLink="false">http://hdl.handle.net/2381/21632</guid>
153.      <dc:date>2012-10-24T09:10:17Z</dc:date>
154.    </item>
155.    <item>
156.      <title>Soft constraints of difference and equality</title>
157.      <link>http://hdl.handle.net/2381/21619</link>
158.      <description>Title: Soft constraints of difference and equality
159. Authors: Hebrard, E; Marx, D; O'Sullivan, B; Razgon, I</description>
160.      <pubDate>Wed, 24 Oct 2012 09:10:16 GMT</pubDate>
161.      <guid isPermaLink="false">http://hdl.handle.net/2381/21619</guid>
162.      <dc:date>2012-10-24T09:10:16Z</dc:date>
163.    </item>
164.    <item>
165.      <title>Finitary functors: From set to Preord and Poset</title>
166.      <link>http://hdl.handle.net/2381/21606</link>
167.      <description>Title: Finitary functors: From set to Preord and Poset
168. Authors: Balan, A; Kurz, A</description>
169.      <pubDate>Wed, 24 Oct 2012 09:10:16 GMT</pubDate>
170.      <guid isPermaLink="false">http://hdl.handle.net/2381/21606</guid>
171.      <dc:date>2012-10-24T09:10:16Z</dc:date>
172.    </item>
173.    <item>
174.      <title>Relation liftings on preorders and posets</title>
175.      <link>http://hdl.handle.net/2381/21605</link>
176.      <description>Title: Relation liftings on preorders and posets
177. Authors: Bílková, M; Kurz, A; Petrişan, D; Velebil, J</description>
178.      <pubDate>Wed, 24 Oct 2012 09:10:16 GMT</pubDate>
179.      <guid isPermaLink="false">http://hdl.handle.net/2381/21605</guid>
180.      <dc:date>2012-10-24T09:10:16Z</dc:date>
181.    </item>
182.    <item>
183.      <title>Verifying Distributed Systems: the Operational Approach</title>
184.      <link>http://hdl.handle.net/2381/20789</link>
185.      <description>Title: Verifying Distributed Systems: the Operational Approach
186. Authors: Ridge, T</description>
187.      <pubDate>Wed, 24 Oct 2012 09:08:59 GMT</pubDate>
188.      <guid isPermaLink="false">http://hdl.handle.net/2381/20789</guid>
189.      <dc:date>2012-10-24T09:08:59Z</dc:date>
190.    </item>
191.    <item>
192.      <title>Efficient algorithms for finding a longest common increasing subsequence</title>
193.      <link>http://hdl.handle.net/2381/20787</link>
194.      <description>Title: Efficient algorithms for finding a longest common increasing subsequence
195. Authors: Chan, W-T; Zhang, Y; Ye, D; Fung, SPY; Zhu, H</description>
196.      <pubDate>Wed, 24 Oct 2012 09:08:59 GMT</pubDate>
197.      <guid isPermaLink="false">http://hdl.handle.net/2381/20787</guid>
198.      <dc:date>2012-10-24T09:08:59Z</dc:date>
199.    </item>
200.    <item>
201.      <title>The semantics of x86-CC multiprocessor machine code</title>
202.      <link>http://hdl.handle.net/2381/20788</link>
203.      <description>Title: The semantics of x86-CC multiprocessor machine code
204. Authors: Sarkar, S; Sewell, P; Nardelli, FZ; Owens, S; Ridge, T; Braibant, T; Myreen, MO; Alglave, J</description>
205.      <pubDate>Wed, 24 Oct 2012 09:08:59 GMT</pubDate>
206.      <guid isPermaLink="false">http://hdl.handle.net/2381/20788</guid>
207.      <dc:date>2012-10-24T09:08:59Z</dc:date>
208.    </item>
209.    <item>
210.      <title>Rigorous protocol design in practice: An optical packet-switch MAC in HOL</title>
211.      <link>http://hdl.handle.net/2381/20790</link>
212.      <description>Title: Rigorous protocol design in practice: An optical packet-switch MAC in HOL
213. Authors: Biltcliffe, A; Ridge, T; Sewell, P; Dales, M; Jansen, S</description>
214.      <pubDate>Wed, 24 Oct 2012 09:08:59 GMT</pubDate>
215.      <guid isPermaLink="false">http://hdl.handle.net/2381/20790</guid>
216.      <dc:date>2012-10-24T09:08:59Z</dc:date>
217.    </item>
218.    <item>
219.      <title>Modelling user experience - An agenda for research and practice</title>
220.      <link>http://hdl.handle.net/2381/20594</link>
221.      <description>Title: Modelling user experience - An agenda for research and practice
222. Authors: Law, EL-C; Van Schaik P</description>
223.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
224.      <guid isPermaLink="false">http://hdl.handle.net/2381/20594</guid>
225.      <dc:date>2012-10-24T09:08:51Z</dc:date>
226.    </item>
227.    <item>
228.      <title>On coalgebras over algebras</title>
229.      <link>http://hdl.handle.net/2381/20595</link>
230.      <description>Title: On coalgebras over algebras
231. Authors: Balan, A; Kurz, A</description>
232.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
233.      <guid isPermaLink="false">http://hdl.handle.net/2381/20595</guid>
234.      <dc:date>2012-10-24T09:08:51Z</dc:date>
235.    </item>
236.    <item>
237.      <title>Measuring teachers' readiness for E-learning in higher education institutions associated with the subject of electricity in Turkey</title>
238.      <link>http://hdl.handle.net/2381/20593</link>
239.      <description>Title: Measuring teachers' readiness for E-learning in higher education institutions associated with the subject of electricity in Turkey
240. Authors: Akaslan, D; Law, EL-C</description>
241.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
242.      <guid isPermaLink="false">http://hdl.handle.net/2381/20593</guid>
243.      <dc:date>2012-10-24T09:08:51Z</dc:date>
244.    </item>
245.    <item>
246.      <title>Foreword: Special issue on coalgebraic logic</title>
247.      <link>http://hdl.handle.net/2381/20596</link>
248.      <description>Title: Foreword: Special issue on coalgebraic logic
249. Authors: Doberkat, E-E; Kurz, A</description>
250.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
251.      <guid isPermaLink="false">http://hdl.handle.net/2381/20596</guid>
252.      <dc:date>2012-10-24T09:08:51Z</dc:date>
253.    </item>
254.    <item>
255.      <title>Presenting functors on many-sorted varieties and applications</title>
256.      <link>http://hdl.handle.net/2381/20599</link>
257.      <description>Title: Presenting functors on many-sorted varieties and applications
258. Authors: Kurz, A; Petrian, D</description>
259.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
260.      <guid isPermaLink="false">http://hdl.handle.net/2381/20599</guid>
261.      <dc:date>2012-10-24T09:08:51Z</dc:date>
262.    </item>
263.    <item>
264.      <title>Modal logics are coalgebraic</title>
265.      <link>http://hdl.handle.net/2381/20598</link>
266.      <description>Title: Modal logics are coalgebraic
267. Authors: Cîrstea, C; Kurz, A; Pattinson, D; Schröder, L; Venema, Y</description>
268.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
269.      <guid isPermaLink="false">http://hdl.handle.net/2381/20598</guid>
270.      <dc:date>2012-10-24T09:08:51Z</dc:date>
271.    </item>
272.    <item>
273.      <title>Coalgebraic representations of distributive lattices with operators</title>
274.      <link>http://hdl.handle.net/2381/20605</link>
275.      <description>Title: Coalgebraic representations of distributive lattices with operators
276. Authors: Bonsangue, MM; Kurz, A; Rewitzky, IM</description>
277.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
278.      <guid isPermaLink="false">http://hdl.handle.net/2381/20605</guid>
279.      <dc:date>2012-10-24T09:08:51Z</dc:date>
280.    </item>
281.    <item>
282.      <title>Algebraic semantics for coalgebraic logics</title>
283.      <link>http://hdl.handle.net/2381/20607</link>
284.      <description>Title: Algebraic semantics for coalgebraic logics
285. Authors: Kupke, C; Kurz, A; Pattinson, D</description>
286.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
287.      <guid isPermaLink="false">http://hdl.handle.net/2381/20607</guid>
288.      <dc:date>2012-10-24T09:08:51Z</dc:date>
289.    </item>
290.    <item>
291.      <title>Weak factorizations, fractions and homotopies</title>
292.      <link>http://hdl.handle.net/2381/20602</link>
293.      <description>Title: Weak factorizations, fractions and homotopies
294. Authors: Kurz, A; Rosický, J</description>
295.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
296.      <guid isPermaLink="false">http://hdl.handle.net/2381/20602</guid>
297.      <dc:date>2012-10-24T09:08:51Z</dc:date>
298.    </item>
299.    <item>
300.      <title>Equational presentations of functors and monads</title>
301.      <link>http://hdl.handle.net/2381/20597</link>
302.      <description>Title: Equational presentations of functors and monads
303. Authors: Velebil, J; Kurz, A</description>
304.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
305.      <guid isPermaLink="false">http://hdl.handle.net/2381/20597</guid>
306.      <dc:date>2012-10-24T09:08:51Z</dc:date>
307.    </item>
308.    <item>
309.      <title>Families of symmetries as efficient models of resource binding</title>
310.      <link>http://hdl.handle.net/2381/20603</link>
311.      <description>Title: Families of symmetries as efficient models of resource binding
312. Authors: Ciancia, V; Kurz, A; Montanari, U</description>
313.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
314.      <guid isPermaLink="false">http://hdl.handle.net/2381/20603</guid>
315.      <dc:date>2012-10-24T09:08:51Z</dc:date>
316.    </item>
317.    <item>
318.      <title>Stone coalgebras</title>
319.      <link>http://hdl.handle.net/2381/20608</link>
320.      <description>Title: Stone coalgebras
321. Authors: Kupke, C; Venema, Y; Kupke, C; Kurz, A</description>
322.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
323.      <guid isPermaLink="false">http://hdl.handle.net/2381/20608</guid>
324.      <dc:date>2012-10-24T09:08:51Z</dc:date>
325.    </item>
326.    <item>
327.      <title>Coalgebra and logic: A brief overview</title>
328.      <link>http://hdl.handle.net/2381/20600</link>
329.      <description>Title: Coalgebra and logic: A brief overview
330. Authors: Kurz, A; Palmigiano, A; Venema, Y</description>
331.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
332.      <guid isPermaLink="false">http://hdl.handle.net/2381/20600</guid>
333.      <dc:date>2012-10-24T09:08:51Z</dc:date>
334.    </item>
335.    <item>
336.      <title>On universal algebra over nominal sets</title>
337.      <link>http://hdl.handle.net/2381/20601</link>
338.      <description>Title: On universal algebra over nominal sets
339. Authors: Kurz, A; Petrian, D</description>
340.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
341.      <guid isPermaLink="false">http://hdl.handle.net/2381/20601</guid>
342.      <dc:date>2012-10-24T09:08:51Z</dc:date>
343.    </item>
344.    <item>
345.      <title>Coalgebras and modal expansions of logics</title>
346.      <link>http://hdl.handle.net/2381/20606</link>
347.      <description>Title: Coalgebras and modal expansions of logics
348. Authors: Kurz, A; Palmigiano, A</description>
349.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
350.      <guid isPermaLink="false">http://hdl.handle.net/2381/20606</guid>
351.      <dc:date>2012-10-24T09:08:51Z</dc:date>
352.    </item>
353.    <item>
354.      <title>MuMHR: Multi-path, multi-hop hierarchical routing</title>
355.      <link>http://hdl.handle.net/2381/20604</link>
356.      <description>Title: MuMHR: Multi-path, multi-hop hierarchical routing
357. Authors: Hammoudeh, M; Gaura, E; Kurz, A</description>
358.      <pubDate>Wed, 24 Oct 2012 09:08:51 GMT</pubDate>
359.      <guid isPermaLink="false">http://hdl.handle.net/2381/20604</guid>
360.      <dc:date>2012-10-24T09:08:51Z</dc:date>
361.    </item>
362.    <item>
363.      <title>Fixed-parameter tractability of multicut parameterized by the size of the cutset</title>
364.      <link>http://hdl.handle.net/2381/20526</link>
365.      <description>Title: Fixed-parameter tractability of multicut parameterized by the size of the cutset
366. Authors: Marx, D; Razgon, I</description>
367.      <pubDate>Wed, 24 Oct 2012 09:08:48 GMT</pubDate>
368.      <guid isPermaLink="false">http://hdl.handle.net/2381/20526</guid>
369.      <dc:date>2012-10-24T09:08:48Z</dc:date>
370.    </item>
371.    <item>
372.      <title>Singular Artin monoids of finite coxeter type are automatic</title>
373.      <link>http://hdl.handle.net/2381/20517</link>
374.      <description>Title: Singular Artin monoids of finite coxeter type are automatic
375. Authors: Corran, R; Hoffmann, M; Thomas, RM; Kuske, D</description>
376.      <pubDate>Wed, 24 Oct 2012 09:08:47 GMT</pubDate>
377.      <guid isPermaLink="false">http://hdl.handle.net/2381/20517</guid>
378.      <dc:date>2012-10-24T09:08:47Z</dc:date>
379.    </item>
380.    <item>
381.      <title>Preface</title>
382.      <link>http://hdl.handle.net/2381/20366</link>
383.      <description>Title: Preface
384. Authors: Ulidowski, I</description>
385.      <pubDate>Wed, 24 Oct 2012 09:08:39 GMT</pubDate>
386.      <guid isPermaLink="false">http://hdl.handle.net/2381/20366</guid>
387.      <dc:date>2012-10-24T09:08:39Z</dc:date>
388.    </item>
389.    <item>
390.      <title>Preface. Hybrid automata and oscillatory behaviour in biological systems</title>
391.      <link>http://hdl.handle.net/2381/20367</link>
392.      <description>Title: Preface. Hybrid automata and oscillatory behaviour in biological systems
393. Authors: Cannata, N; Merelli, E; Ulidowski, I</description>
394.      <pubDate>Wed, 24 Oct 2012 09:08:39 GMT</pubDate>
395.      <guid isPermaLink="false">http://hdl.handle.net/2381/20367</guid>
396.      <dc:date>2012-10-24T09:08:39Z</dc:date>
397.    </item>
398.    <item>
399.      <title>Editorial for special section on dependencies and interactions with aspects</title>
400.      <link>http://hdl.handle.net/2381/20341</link>
401.      <description>Title: Editorial for special section on dependencies and interactions with aspects
402. Authors: Chitchyan, R; Fabry, J; Katz, S; Rensink, A</description>
403.      <pubDate>Wed, 24 Oct 2012 09:08:37 GMT</pubDate>
404.      <guid isPermaLink="false">http://hdl.handle.net/2381/20341</guid>
405.      <dc:date>2012-10-24T09:08:37Z</dc:date>
406.    </item>
407.    <item>
408.      <title>Preface</title>
409.      <link>http://hdl.handle.net/2381/20320</link>
410.      <description>Title: Preface
411. Authors: Bonchi, F; Grohmann, D; Spoletini, P; Troina, A; Tuosto, E</description>
412.      <pubDate>Wed, 24 Oct 2012 09:08:36 GMT</pubDate>
413.      <guid isPermaLink="false">http://hdl.handle.net/2381/20320</guid>
414.      <dc:date>2012-10-24T09:08:36Z</dc:date>
415.    </item>
416.    <item>
417.      <title>Preface</title>
418.      <link>http://hdl.handle.net/2381/20294</link>
419.      <description>Title: Preface
420. Authors: Cannata, N; Merelli, E; Ulidowski, I</description>
421.      <pubDate>Wed, 24 Oct 2012 09:08:34 GMT</pubDate>
422.      <guid isPermaLink="false">http://hdl.handle.net/2381/20294</guid>
423.      <dc:date>2012-10-24T09:08:34Z</dc:date>
424.    </item>
425.    <item>
426.      <title>Reidemeister-Schreier type rewriting for semigroups</title>
427.      <link>http://hdl.handle.net/2381/20273</link>
428.      <description>Title: Reidemeister-Schreier type rewriting for semigroups
429. Authors: Campbell, CM; Robertson, EF; Ruškuc, N; Thomas, RM</description>
430.      <pubDate>Wed, 24 Oct 2012 09:08:33 GMT</pubDate>
431.      <guid isPermaLink="false">http://hdl.handle.net/2381/20273</guid>
432.      <dc:date>2012-10-24T09:08:33Z</dc:date>
433.    </item>
434.    <item>
435.      <title>On a class of semigroups with symmetric presentations</title>
436.      <link>http://hdl.handle.net/2381/20276</link>
437.      <description>Title: On a class of semigroups with symmetric presentations
438. Authors: Campbell, CM; Robertson, EF; Thomas, RM</description>
439.      <pubDate>Wed, 24 Oct 2012 09:08:33 GMT</pubDate>
440.      <guid isPermaLink="false">http://hdl.handle.net/2381/20276</guid>
441.      <dc:date>2012-10-24T09:08:33Z</dc:date>
442.    </item>
443.    <item>
444.      <title>Reversibility and Models for Concurrency</title>
445.      <link>http://hdl.handle.net/2381/20214</link>
446.      <description>Title: Reversibility and Models for Concurrency
447. Authors: Phillips, I; Ulidowski, I</description>
448.      <pubDate>Wed, 24 Oct 2012 09:08:29 GMT</pubDate>
449.      <guid isPermaLink="false">http://hdl.handle.net/2381/20214</guid>
450.      <dc:date>2012-10-24T09:08:29Z</dc:date>
451.    </item>
452.    <item>
453.      <title>Predictive modeling of signaling crosstalk during C. elegans vulval development.</title>
454.      <link>http://hdl.handle.net/2381/20178</link>
455.      <description>Title: Predictive modeling of signaling crosstalk during C. elegans vulval development.
456. Authors: Fisher, J; Piterman, N; Hajnal, A; Henzinger, TA
457. Abstract: Caenorhabditis elegans vulval development provides an important paradigm for studying the process of cell fate determination and pattern formation during animal development. Although many genes controlling vulval cell fate specification have been identified, how they orchestrate themselves to generate a robust and invariant pattern of cell fates is not yet completely understood. Here, we have developed a dynamic computational model incorporating the current mechanistic understanding of gene interactions during this patterning process. A key feature of our model is the inclusion of multiple modes of crosstalk between the epidermal growth factor receptor (EGFR) and LIN-12/Notch signaling pathways, which together determine the fates of the six vulval precursor cells (VPCs). Computational analysis, using the model-checking technique, provides new biological insights into the regulatory network governing VPC fate specification and predicts novel negative feedback loops. In addition, our analysis shows that most mutations affecting vulval development lead to stable fate patterns in spite of variations in synchronicity between VPCs. Computational searches for the basis of this robustness show that a sequential activation of the EGFR-mediated inductive signaling and LIN-12 / Notch-mediated lateral signaling pathways is key to achieve a stable cell fate pattern. We demonstrate experimentally a time-delay between the activation of the inductive and lateral signaling pathways in wild-type animals and the loss of sequential signaling in mutants showing unstable fate patterns; thus, validating two key predictions provided by our modeling work. The insights gained by our modeling study further substantiate the usefulness of executing and analyzing mechanistic models to investigate complex biological behaviors.</description>
458.      <pubDate>Wed, 24 Oct 2012 09:08:25 GMT</pubDate>
459.      <guid isPermaLink="false">http://hdl.handle.net/2381/20178</guid>
460.      <dc:date>2012-10-24T09:08:25Z</dc:date>
461.    </item>
462.    <item>
463.      <title>Editorial</title>
464.      <link>http://hdl.handle.net/2381/20162</link>
465.      <description>Title: Editorial
466. Authors: Mosses, PD; Ulidowski, I</description>
467.      <pubDate>Wed, 24 Oct 2012 09:08:22 GMT</pubDate>
468.      <guid isPermaLink="false">http://hdl.handle.net/2381/20162</guid>
469.      <dc:date>2012-10-24T09:08:22Z</dc:date>
470.    </item>
471.    <item>
472.      <title>Model-driven development of reactive information systems: From graph transformation rules to JML contracts</title>
473.      <link>http://hdl.handle.net/2381/20157</link>
474.      <description>Title: Model-driven development of reactive information systems: From graph transformation rules to JML contracts
475. Authors: Heckel, R; Lohmann, M</description>
476.      <pubDate>Wed, 24 Oct 2012 09:08:21 GMT</pubDate>
477.      <guid isPermaLink="false">http://hdl.handle.net/2381/20157</guid>
478.      <dc:date>2012-10-24T09:08:21Z</dc:date>
479.    </item>
480.    <item>
481.      <title>Guest editorial to the special issue on language engineering for model-driven software development</title>
482.      <link>http://hdl.handle.net/2381/20121</link>
483.      <description>Title: Guest editorial to the special issue on language engineering for model-driven software development
484. Authors: Bézivin, J; Heckel, R</description>
485.      <pubDate>Wed, 24 Oct 2012 09:07:58 GMT</pubDate>
486.      <guid isPermaLink="false">http://hdl.handle.net/2381/20121</guid>
487.      <dc:date>2012-10-24T09:07:58Z</dc:date>
488.    </item>
489.  </channel>
490. </rss>
491.  
492.  

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):

   <a href="http://www.rssboard.org/rss-validator/check.cgi?url=https%3A//lra.le.ac.uk/feed/rss_2.0/2381/316"><img src="valid-rss.png" alt="[Valid RSS]" title="Validate my RSS feed" /></a>

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

Home · About · News · Docs · Terms