text:
Concrete topics for PhD research
Ruzanna Chitchyan
Topics on Software Engineering for Sustainability: These topics relate to understanding the implications of sustainability needs on the systems engineering, with main focus on requirements engineering, system modelling, and design. Software is in the centre of many human activities. Thus, it is essential to review and modernise the way software is developed and used to ensure that both its' direct and indirect effects support the relevant aspects of sustainabilnirity. The direct effects of software use are in the way it enables immediate resource consumption/preservation and facilitates the in-situ organisational/social processes. For instance, a programme for party organisation may help minimise food waste by carefully checking how many people will be present and what type/portion of food they will use. The indirect effects, on the other hand, are its long-term effects (such as changes in societal lifestyle (e.g., due to use of social media), or changes in patterns of resource use triggered by it. There is a large set of topics in this area, and my research interests are not limited to the examples below.
Some references:
- M. Mahaux, P. Heymans, and G. Saval, "Discovering Sustainability Requirements: An Experience Report," in Requirements Engineering: Foundation for Software Quality, 2011, pp. 19–33. URL: http://info.fundp.ac.be/~mma/wordpress/wp-content/uploads/2012/02/paperExpReport.pdf
- J. Cabot, S. Easterbrook, J. Horkoff, L. Lessard, S. Liaskos, and J. N. Mazón,"Integrating Sustainability in Decision-Making Processes: A Modelling Strategy," in 31st International Conference on Software Engineering-Companion Volume, 2009. ICSE-Companion 2009, 2009, pp. 207–210. URL: http://www.cs.utoronto.ca/~jenhork/Papers/Sustainability_ICSE_NIER.pdf
- Engineering Sustainability Requirements: at this time it is not clear what sustainability requirements actually are. Sustainability is a wide and complex concept, it is often defined as comprising social, economic, and environmental aspects, each of which may be perceived quite differently in a given application area or discipline. The first challenge in tacking the sustainability problem in software design is in understanding and mapping out this complex concept into a format useable by requirements engineers (e.g., a soft-goal decomposition catalogue). This, obviously, will have to be validated via case studies and supported by a tool.
- Measuring Sustainability Impact of Software: this project will develop techniques and tools for quantifying the above mentioned direct and indirect sustainability effects delivered by a particular choices in software design. For instance, working from home may reduce resource consumption (e.g., eliminating travel-related fuel consumption, and office space use), but adversely affect social interactions of a person (e.g., by eliminating opportunities for direct contact with colleagues and ability to build real relationships). How can such effects be measured? What kind of tools will be needed to support such quantification?
Advanced Software Modularity: These topics are related to new ways of modularising and composing software systems, with specific focus on requirements and architecture design areas, such as:
- aspect-oriented requirements engineering;
- requirements and architecture design techniques for software product line engineering;
- requirements engineering for service-oriented systems.
Some References:
- "Semantics-Based Composition for Aspect-Oriented Requirements Engineering", R. Chitchyan, A. Rashid, P. Rayson, R. Waters, Proceedings of the 6th International Conference on Aspect-Oriented Software Development (AOSD 2007). URL: http://www.comp.lancs.ac.uk/computing/aop/papers/AOSD_2007.pdf
- "A Framework for Constructing Semantically Composable Feature Models from Natural Language Requirements", N. Weston, R. Chitchyan, A. Rashid. Proceedings of the 13th International Software Product Line Conference (SPLC 2009).
Creative Engineering of Systems for Future: This is a follow on from work on the All-in One project. The All-in-One project sets out to deliver a scientific and technological data collection and aggregation support for envisioning future (100 years from now) utilities delivery infrastructure. With this work in progress, there is a need to design and develop methodologies and tools for analysis of the available scientific and technological data for (predictive) computing of the future technological landscape for a given utility area (e.g., water supply, or ICT). Since utilities can be perceived as a type of service, this research can be pursued with respect to other service-like application areas as well (not only utilities).
- "Energy and Utilities Infrastructure: Can All be in One?", F. Camci, B. Ulanicki , J. Boxall, R. Chitchyan , L. Varga. Conference on Energy and People: Futures, Complexity and Challenges, 2011. URL: http://www.ukerc.ac.uk/support/tiki-download_file.php?fileId=1938&display
Ruzanna Chitchyan's homepage and contact details
Roy Crole
Programming language semantics research makes use of techniques from mathematical logic, category theory and type theory to develop the foundations of programming languages with a long term goal of producing new and better programming languages and environments. I am interested in axiomatic, operational, categorical and denotational semantics. One creates mathematical models and methods which inform language design and assist with the development of logical systems for specifying and reasoning about program properties. More specifically this research:
- aims to increase our general understanding of the theory and fundamentals of programming and computation;
- aims to underpin and clarify our understanding of existing programming languages and systems, and can be used as a basis for analysis, specification, verification, and testing; and
- can lead to the development of fundamentally new languages and systems.
- Mathematical Models of Variable Binding: In the last decade we have advanced our understanding of the formal notion of variable binding considerably. Presheaf categories have been shown to provide models of standard languages with variable binding, such as (variants of) the lambda calculus, as initial algebras. This is a considerable advancement over older models in which expressions with binders could only be realised as alpha-equivalence classes of elements of initial algebras. The important gain here is the initial algebra gives rise to a clear principle of structural induction. My own work has developed particular kinds of presheaf category models, and a PhD thesis could be based upon the further development of these models and the associated reasoning principles.
- Computer Systems for Reasoning About Binding: The Hybrid system was developed in Isabelle HOL. It is a metalogic which can be used to reason about languages with binding. One translates the object language into Hybrid, and then uses Hybrid's reasoning principles (such as induction and coinduction) to prove properties of the language. There are a variety of research avenues to explore, ranging from applications of Hybrid which could involve the testing of Hybrid and its comparison with other systems of reasoning with binders, to the further development of the Hybrid system itself.
Roy Crole's homepage and contact details
Fer-Jan de Vries
Rewriting and Lambda Calculus We are interested to extend the theory of rewriting with infinite reductions and infinite terms. This leads to new insights when one tries to generalise results and concepts of finite rewriting to the infinite setting. See http://www.cs.le.ac.uk/people/fdv1/ for papers that I've written with colleagues. Areas that are waiting to be explored are:
- Models for infinitary lambda calculus: the study of infinite lambda calculus has revealed an abundance of different syntactic models. Is it possible to construct models that induce the same equality relations as these syntactic models with other means, for instance via domain equations? The converse question is of interest too: given a known semantics of the lambda calculus, what is the corresponding infinite lambda calculus whose term model induces the same equality relation?
- Infinite lambda calculi without renaming: traditional finite lambda calculi follow a variable convention. Various solutions have been proposed to circumvent this problem: for instance De Bruijn indices or the Adbmal calculus of Hendriks and van Oostrom. Do these solutions generalise?
- Weakly orthogonal rewriting is confluent in finite rewriting. Does this generalise to infinite rewriting?
- Undefined terms: for term rewriting and for lambda calculus there is a notion of meaningless set. Meaningless terms need to be identified in order to regain confluence in the infinite orthogonal setting. Is there a notion of meaningless set for other rewriting formats, like Klop's combinatory reduction systems?
- Decreasing diagrams is a powerful technique to prove confluence in finite rewriting. Can it be generalised to prove confluence in the infinite setting?#
Fer-Jan de Vries's homepage and contact details
Thomas Erlebach
NOTE: Professor Erlebach does not have any spare supervision capacity at the moment and therefore does not plan to accept further new PhD students in 2013/14.
Algorithmic Aspects of Comunication Networks. Numerous challenging optimization problems arise in the design and operation of communication networks such as optical networks, cellular wireless networks, mobile wireless ad-hoc networks, and GRID computing. Examples of such problems include network design, resource provisioning, resource allocation, scheduling, virtual backbone construction, and call admission control. Students working on such topics typically identify suitable models and problem formulations, design and analyze algorithms (approximation algorithms, on-line algorithms, distributed algorithms, algorithmic game theory), and implement simulations of algorithms for the purpose of experimental evaluation and comparisons. The focus can be more on the theoretical analysis (proofs of worst-case performance guarantees, competitive analysis) or on the experimental and algorithm engineering side, but typically the research includes aspects of both.
This is a broad topic that can accommodate a number of specific PhD research projects. Note, however, that I already have a number of PhD students and, for the moment, will accept additional students only if they are exceptionally well qualified.
List of skills required:
- Ability to understand the design and analysis of algorithms.
- Ability to understand and apply basic concepts of discrete mathematics (graphs, combinatorics, proofs).
- Ability to write about algorithms and proofs in a precise and rigorous way.
- Creativity in prolem-solving.
- Ability to write programs in a suitable programming language such as Java or C++ (only if the PhD project includes a simulation or implementation component).
List of relevant optional modules that can be attended at University of Leicester:
- CO7200 Algorithms for Bioinformatics
- CO7212 Game Theory in Computer Science
- CO7213 Networking and Distributed Computing
Some suggested reading:
- Introduction to Online Algorithms:
Susanne Albers: Competitive Online Algorithms. BRICS Lecture Series, LS-96-2, 1996. Available at: http://www.brics.dk/LS/96/2/
- Survey of Approximation Algorithms for Disjoint Paths Problems:
Thomas Erlebach: Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow. In E. Bampis et al. (Eds.): Efficient Approximation and Online Algorithms, LNCS 3484, Springer, 2006, pp. 97-134. Available at: http://www.cs.le.ac.uk/people/te17/papers/edpsurvey.pdf
- Survey of Algorithmic Models of Ad-hoc/Sensor Networks:
S. Schmid and R. Wattenhofer: Algorithmic Models for Sensor Networks. In Proceedings of the 14th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS), April 2006. Available at: http://www.dcg.ethz.ch/members/pascal/refs/wpdrts06cam.pdf
- Example of an algorithmic result for virtual backbone construction in ad-hoc networks:
Christoph Ambuehl, Thomas Erlebach, Matus Mihalak, Marc Nunkesser: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006), LNCS 4110, Springer, 2006, pp. 3-14. Extended version available at: http://www.cs.le.ac.uk/people/te17/papers/CS-06-008.pdf
Thomas Erlebach's homepage and contact details
Stanley Fung
Design and analysis of algorithms, particularly in the areas of
- Online algorithms
- Combinatorial optimization
- Computational biology and bioinformatics
Background in discrete mathematics and algorithms as provided in most CS undergraduate degrees
Suggested MSc modules:
Analysis and Design of Algorithms. provides the above skills. C++ Programming and Advanced Algorithm Design and Game Theory in Computer Science may also be useful.
- S. Albers, Online algorithms: a survey, Mathematical Programming 97 (1-2), p. 3-26, July 2003. http://www.informatik.uni-freiburg.de/~salbers/ismp03.ps.gz
- A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998.
Stanley Fung's homepage and contact details
Reiko Heckel
Modelling and analysis of social networks by graph transformation
A network can be seen as a graph, and its evolution over time modelled by graph transformation rules. See http://www.cs.le.ac.uk/people/rh122/papers/2006/Hec06Nutshell.pdf for an introduction to graph transformation and google 'social network analysis' to get an idea of the problem.
Graph transformation systems (GTS), see http://www.cs.le.ac.uk/people/rh122/papers/2006/Hec06Nutshell.pdf, are more expressive than nets, and indeed every net can be seen as a simple GTS. Lifting ideas and concepts from the Petri net world, we would like to establish GTS as a technique for modelling workflows / business processes.
Good knowledge and skills in at least two out of the following three areas is required.
- OO development (programming and UML).
- basic theoretical computer science (automata and formal languages, propositional and first order logic, basic set theory).
- classical maths (specifically analysis and probability theory).
Test management for web applications based on probabilistic models
With limited resources (computing, personnel and time) it is not possible to exhaustively test every feature of a web-application on every browser or device. A key challenge of any software engineering project is to decide how to deploy your testing resources. The goal is to detect faults in the application, but we must decide whether to focus on bugs that have the biggest impact on a user, those that will affect most users, those that are most easily fixed by developers, etc.
That means to make decisions as to which features of the application to focus on and which browsers or devices to use. As we receive the results of testing we learn about which choices reveal the most defects and so adapt our testing strategy to focus more tightly on specific areas. However, as applications evolve and bugs are removed, the areas in which we should focus also change. If we think about the probability that a defect is exposed in a certain feature when viewed in a certain browser using a probability distribution, it should be possible to model these distributions and use them to guide our decision making on how to focus our testing effort.
On the more technical side it would be interesting to develop tools that allow us to maintain, visualise and use these model throughout a software project. Automated tested adds another dimension of complexity to this because we can use it to test certain functionality across browsers and devices, but this itself requires resources to develop and maintain.
The project will be co-supervised with Dr Richard Craggs, Release Manager at Jadu.
Reiko Heckel's homepage and contact details
Michael Hoffmann
1. Algorithm with uncertainty: The area of update algorithms for problems with uncertainty is a relative recent developed topic. For most classical algorithms it is assumed that the input is precise. In this model each input might be given in a rough (uncertain) form. The precise value for each input can be obtained for a certain cost. The algorithm has to decide for which input data the the extra costs needs to be paid to solve the underlying problem. Algorithm with uncertainty are rated on cost effective they are.
- Programming in C++, Java, or similar computer language
- Knowledge in time and space complexity
- Knowledge in statistical analysis
Related publication:
- Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matu's Mihala'k, Rajeev Raman: Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288T.
2. Online Algorithms: Quota from wikipedia: (http://en.wikipedia.org/wiki/Online_algorithm) "In computer science, an online algorithm is one that can process its input piece-by-piece, without having the entire input available from the start. In contrast, an offline algorithm is given the whole problem data from the beginning and is required to output an answer which solves the problem at hand. (For example, selection sort requires that the entire list be given before it can sort it.)
As an example of the problem consider the problem of finding a shortest path in a finite connected graph when the graph is unknown and the algorithm receives the node neighbors only when it "enters" the node. It is clear that this problem can not be solved optimally without a simple exhaustive search. Thus, new performance measures have to be introduced, such as competitive analysis, which compares the performance of an online algorithm with that of a hypothetical offline algorithm that knows the entire input in advance."
In this general topic some of my recent research focused on network discovery. Where a structure of the network is not known and by probing certain nodes the whole network will be discovered.
- Programming in C++, Java, or similar computer language
- Knowledge in time and space complexity
- Knowledge in statistical analysis
Related publication:
- Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matu's Mihala'k, L. Shankar Ram: Network Discovery and Verification. IEEE Journal on Selected Areas in Communications 24(12): 2168-2181 (2006)
Michael Hoffmann's homepage and contact details
If you are interested in questions that have to do with two-player games, automata, algorithms related to them, or other things that appear on my research interests, there's something to talk about.
p-Automata and related games: These are new automata motivated by probabilistic CTL and alternating tree automata that accept Markov chains. Their study involve issues about automata (conversion between different transition modes of automata (deterministic, nondeterministic, alternating)), algorithmic questions about automata, the introduction of new games (obligation games) and algorithmic questions about such games.
You can have a look on the paper introducing them or the paper on obligation games .
Synthesis of controllers from temporal specifications: Synthesis (in my language) is the automatic conversion of a specification in linear temporal logic to an input-enabled program all of whose executions satisfy the specification.
This is a question that intrigued researchers in verification for many years, getting much attention, but only recently getting actual practical progress.
The techniques involved in doing this include the study of transition systems, two player games, and construction of strategies. This is also related to automata and temporal logic.
The approach that I have been advocating calls for restricting the type of specifications to a "reasonable" subset that can be handled in practice.
I have recently considered how to apply this to certain abstract ways of representing the world (here).
This is also related to questions about games with partial information, their solutions, and strategies controlling them (See survey, not mine).
Dynamic Reactive Modules: This is an approach for modeling transition systems that support allocation of new processing power (and its deallocation) based on variable sharing (rather than message passing). I find this very exciting as this could be related to ad-hoc networks and such things and hasn't been considered in the past.
See the paper introducing them.
Nir Piterman's homepage and contact details
Stephan Reiff-Marganiec
1. Dynamic Adaptation of Workflows: Workflows capture Business Processes, but business is dynamic so their workflows need to adapt. StPowla is an approach to process modelling for service-oriented systems. It has three ingredients: workflows to express core processes, services to perform activities and policies to express variability. Workflows are expressed using a graphical notation. Policies can make short-lived changes to a workflow instance, i.e. they last for the duration of the workflow instance and usually will be made during the execution of the instance, rather than applied to the overall workflow model. There are two types of policies: refinement and reconfiguration. Refinement policies specify criteria for the selection of the service that is ultimately chosen and invoked to execute the task at hand, while reconfiguration policies change the structure of the workflow instance by e.g. deleting or adding tasks. This area also covers the study of policy conflict.
Selected References:
- S Gorton, C Montangero, S Reiff-Marganiec and L Semini. StPowla: SOA, Policies and Workflows. WESOA 2007.
- L Bocchi, S Gorton and S Reiff-Marganiec. Engineering Service Oriented Applications: From StPowla Processes to SRML Models. FACS (Formal Aspects of Computing).
2. Service Selection: One area of service-oriented computing is concerned with identifying the right service for a user. This is a very active and interesting area and I am specifically interested in how can the best service for a specific user context be selected and how can the overall selection services for a business process be optimized. In the former area we have developed an extension of LSP (Logic Scoring for Preferences) that allows for automatic ranking of single services. An extension of this method for workflows is under consideration, however, for workflows we are also working on an Immune based algorithm for finding the global best.
Selected References:
- J. Xu and S Reiff-Marganiec. Towards Heuristic Web Services Composition Using Immune Algorithm. ICWS 2008.
- HQ Yu and S Reiff-Marganiec. A Method for Automated Web Service Selection. WSCA 2008.
3. Virtual Organisations: The idea of virtual organisations captured the fact that many smaller organisations can work together in dynamic ways to achieve larger goals that none of them could achieve on their own. We are studying how to model VOs at higher levels of abstraction, but in ways that will ultimately allow to reason about their behaviour. A future aspect of this work would be the consideration of a run-time platform to enable the operation of VOs.
- L. Bocchi, J.L. Fiadeiro, N. Rajper and S. Reiff-Marganiec. Structure and Behaviour of Virtual Organisation Breeding Environments. FAVO 2009.
Stephan Reiff-Marganiec's homepage and contact details
Tom Ridge
I'm interested in ways to make our I.T. systems more dependable and reliable. This could include:
- developing new programming language features
- identifying and implementing key I.T. infrastructure, e.g. persistent message queues
- using mathematics to prove that e.g. implementations of algorithms and systems are correct
- developing tools to make the above tasks easier e.g. theorem provers such as HOL4, and specification tools such as Ott and Lem
Some concrete current projects I would like PhD students to work on are:
Verified filesystem Filesystems are incredibly important, particularly when applications must provide some form of persistence for their data (eg a database must ensure that data survives a complete system failure). In order to develop applications that use the filesystem, one has to know what guarantees are being provided by the filesystem. Unfortunately current filesystems do not provide many guarantees beyond POSIX "atomic move" (if you move a file, and the system crashes, then either the file moved or it did not). The aim of this project is to develop a filesystem which guarantees certain key properties that application developers depend on. The filesystem will be developed in a functional language such as Haskell, OCaml or SML. Verification will use a theorem prover such as Isabelle, HOL, or Coq. The aim is to develop a reliable filesystem that can be used in real-world systems such as Linux.
Filesystem implementation The project is to develop a C implementation of a filesystem I have implemented in OCaml. The OCaml version is verified correct. Ideally the C implementation would have some direct (formal, mathematical) connection to the OCaml version, so that the C version would also be correct (there are several ways to make this more precise).
Verified computational complexity Lots of effort has been dedicated to reasoning formally about program correctness. We would now like to prove that implemented code has time and space complexity that it is claimed to have. A simple approach would be to define the atomic steps of a language, and count the number of steps a piece of code takes. However, informal reasoning tends to be at a much higher level than this. The aim of this project is to start developing the formal verification of computational complexity by looking at simple functional implementations e.g. of mergesort etc. Some recent work by Bob Harper et al. is relevant, here.
Reasoning above operational semantics One way to prove programs correct is to reason directly about their operational behaviour, as defined by the operational semantics for the language. There are many things that need to be done here, such as developing good operational semantics to support high-level reasoning; developing tools to make symbolic evaluation quicker; developing reasoning techniques for operational reasoning; porting existing techniques to the operational setting etc
Access control matrices Access control matrices (related to access control lists) are used to specify who has access to what resources. For example, the following states that user tom has access to all files, whereas jen has access only to File A.
|File A|File B|File C tom| Y | Y | Y jen| Y | N | N
Access control matrices are easy to implement. Unfortunately they are very difficult to manage, because high-level access control rules (e.g. only users with the role of administrator should be able to access all files) are not explicitly captured. Much existing research has been directed at this problem, but it should be possible to do something new and interesting by expressing the high-level rules in higher-order logic, then using automated provers to check that the properties are enforced.
OCaml to C compilation The project is to define how to translate OCaml (more likely, a simple functional programming language such as MiniML) to C. This would provide a general way to achieve the results of the "filesystem implementation" project above. The L4.verified project, to develop a verified operating system, did something similar, and it should be possible to use this existing work.
OCaml to Scheme compilation The project is to define how to translate OCaml (more likely, a simple functional programming language such as MiniML) to Scheme, similar to the OCaml to C compilation project above. Scheme is available pretty much everywhere, but implementations of ML-like languages are not so readily available. When new technologies such as Java (or .NET) come along, you want to be able to use all the new features and technology, combined with everything you love about ML. Scheme is usually supported very quickly e.g. from within Java via JScheme or Kawa, but it is still difficult to use ML-like languages with Java. This project aims to develop an ML to Scheme translator, allowing ML programmers to take advantage of existing Scheme/Java technology to run their ML code on the Java platform.
Tom Ridge's homepage and contact details
Rick Thomas
1. Automatic groups and semigroups: There have been some intriguing interactions in recent years between group theory and theoretical computer science. One area which has proved to be very fruitful in providing interesting and useful results is that of automatic groups where computation in the group can (essentially) be performed via an associated set of finite automata. For example, it is known that any automatic group must be finitely presented and the word problem of an automatic group can be solved in quadratic time. For an overview of automatic groups, see [1].
Much of the research at Leicester is involved in extending this theory to semigroups. We find that some of the results in automatic groups do generalize to semigroups (such as the solution of the word problem in quadratic time) whereas others do not (for example, there exist automatic semigroups that are not finitely presented). See [2] for an introduction to automatic semigroups. As an example of the work done in this area, see [3] where it was shown that, for semigroups, the notions of automatic and biautomatic do not coincide (this is still an open problem for groups).
- D. B. A. Epstein, J. W. Cannon, D. F. Holt, S. Levy, M. S. Paterson and W. Thurston, Word Processing in Groups (Jones and Barlett, 1992).
- C. M. Campbell, E. F. Robertson, N. Ruskuc and R. M. Thomas, Automatic semigroups, Theoretical Computer Science 250 (2001), 365-391.
- M. Hoffmann and R. M. Thomas, Biautomatic semigroups, in: M. Liskiewicz and R. Reischuk (editors), 15th International Symposium on Fundamentals of Computation Theory (FCT) 2005 (Lecture Notes in Computer Science 3623, Springer-Verlag, 2005), 56-67.
2. Hyperbolic groups and monoids: The notion of hyperbolic groups has played a fundamental role in computational group theory. There were several equivalent definitions of the notion of hyperbolicity in groups (see [1] for example) but none of these generalized to monoids. This changed with Gilman's elegant characterization of hyperbolic groups; Duncan and Gilman then suggested that this formulation could be taken as the definition of a hyperbolic monoid.
Their definition is entirely natural but we do not have efficient algorithms for dealing with hyperbolic monoids. It is known that the word problem for hyperbolic groups can be solved in linear time but the best known algorithm for the word problem in a hyperbolic monoid is exponential [2]. Other questions are still open as far as hyperbolic monoids are concerned, even as regards decidability. However, research at Leicester has shown how the definition can be changed in such a way that we still have equivalence in the class of groups but we do have efficient algorithms for hyperbolic monoids; see [3].
- J. M Alonso, T. Brady, D. Cooper, V. Ferlini, M. Lustig, M. Michalik, M. Shapiro and H. Short, Notes on word hyperbolic groups, in: E. Ghys, A. Haefliger and A. Verjovsky (editors), Group Theory from a Geometric Viewpoint (World Scientific Publishing, 1991), 3-63.
- M. Hoffmann, D. Kuske, F. Otto and R. M. Thomas, Some relatives of automatic and hyperbolic groups, in: G. M. S. Gomes, J-E. Pin and P. V. Silva (editors), Semigroups, Algorithms, Automata and Languages (World Scientific, 2002), 379-406.
- M. Hoffmann and R. M. Thomas, Notions of hyperbolicity in monoids, in: E. Csuhaj-Varju and Z. Esik (editors), 16th International Symposium on Fundamentals of Computation Theory (FCT) 2007 (Lecture Notes in Computer Science 4639, Springer-Verlag, 2007), 341-352.
4. Word problems of groups and semigroups. The word problem for a finitely generated group is one of the must fundamental notions in group theory. There are many intriguing connections with theoretical computer science, and one important such area is that of investigating what implications the structure of the word problem as a formal language has on the algebraic structure of the corresponding group; see [2] for example. We can also ask which groups have word problem solvable within some resource bound, which leads to intriguing connections with computational complexity; see [1] for example.
As well as groups, it is possible to consider these issues in the wider context of finitely generated semigroups; several questions that have been completely resolved in the group case remain open in this wider setting. Notwithstanding this, some advances have been made, particularly in the case of the one-counter languages (see [3]).
- S. R. Lakin and R. M. Thomas, Context-sensitive decision problems in groups, in: C. S. Calude, E. Calude and M. J. Dinneen (editors), Developments in Language Theory: 8th International Conference, DLT 2004, (Lecture Notes in Computer Science 3340, Springer-Verlag, 2004), 296-307.
- D. F. Holt, C. E. Roever, S. E. Rees and R. M. Thomas, Groups with a context-free co-word problem, Journal of the London Mathematical Society 71 (2005), 643-657.
- D. F. Holt, M. D. Owens and R. M. Thomas, Groups and semigroups with a one-counter word problem, Journal of the Australian Mathematical Society 85 (2008), 197-209.
4. FA-presentable structures. When one considers the notion of a computable structure. one would normally use some general model of computation such as a Turing machine. However, there have been various ideas put forward to restrict the model of computation used; whilst the range of possible structures decreases, the computation can become more efficient and certain properties of the structures may become decidable.
One interesting approach was introduced by Khoussainov and Nerode [1] who considered structures whose domain and relations can be checked by finite automata (as opposed to Turing machines); such a structure is said to be FA-presentable. One area of intense interest here has been the classification of which structures are FA-presentable, and there are not many instances where this has been achieved. Amongst the few examples of this to date has been the classification of FA-presentable finitely generated groups in [2] and the generalization to FA-presentable finitely generated cancellative semigroups in [3].
- B. Khoussainov and A. Nerode, Automatic presentations of structures, in: D. Leivant (editor), Logic and Computational Complexity (Lecture Notes in Comp. Science 960, Springer-Verlag, 1995), 367-392.
- G. P. Oliver and R. M. Thomas, Automatic presentations for finitely generated groups, in: V. Diekert and B. Durand (editors), 22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 05 (Lecture Notes in Computer Science 3404, Springer-Verlag, 2005), 693-704.
- A. J. Cain, G. P. Oliver, N. Ruskuc and R. M. Thomas, Automatic presentations for semigroups, Information and Computation 207 (2009), 1156-1168.
Rick Thomas's homepage and contact details
Emilio Tuosto
Abstractions for mobile distributed systems: The widespread use of distributed and concurrent systems urges to use formal models to rigorously describe and analyse computations where remotely executing processes interact through amongcommunication infrastructures that can dynamically change.
I'm interested in studying models for several aspects of modern distributed computations from theoretical as well as applied points of view. My favourite models are based on process algebras, automata and hypergraphs.
1. Process Algebras: Process algebras are particularly suitable for formally describing and reasoning on distributed communicating processes that operates in a dynamically changing environment. Indeed, many different theories (e.g., behavioural type systems) have been shown adequate to tackle problems rising in distributed computing (e.g., service-oriented computing). Moreover, process algebras can be practically used for verifying systems with techniques like model checking or type-checking.
Promising research directions are event-notification based calculi and session types to control distributed interactions (see the suggested papers below). Both theoretical and applied research is possible, in fact I'm currently interested in defining suitable systems for dynamic multiparty sessions and some implementation issues of an event-notification based process algebra.
Required skills:
- Good mathematical and logical skills.
- If interested in implementation aspects, good programming skills (either functional or object oriented programming).
- Robin Milner, Joachim Parrow, David Walker. A Calculus of Mobile Processes Part I and Part II. Information and Computation 100:1-77 (1992).
- GianLuigi Ferrari, Daniele Strollo, Roberto Guanciale, and Emilio Tuosto. Coordination Via Types in an Event-Based Framework. In J. Derrick and J. Vain, editors, 27th IFIP WG 6.1 International Conference on Formal Methods for Networked and Distributed Systems Special focus on service oriented computing and architectures, volume 4574 of Lecture Notes in Computer Science. Springer-Verlag, June 2007.
- Roberto Bruni, Ivan Lanese, Hernan Melgratti, Emilio Tuosto. Multiparty sessions in SOC. In D. Lea and G. Zavattaro editors. Coordination Models and Languages, volume 5052 of Lecture Notes in Computer Science, Springer-Verlag, May 2008.
2. Automata for mobile systems: Traditional automata can be enriched to model computational phenomena arising in mobile systems modelled with nominal calculi. Not only automata can be used to check behavioural equivalences of systems, but they are also suitable to model check them or verify e.g., service compatibility.
This research is very much related to process algebras and aims at exploiting the class of History-Dependent automata as the basis for formal verification of systems modelled with nominal calculi
Required skills:
- Good mathematical and logical skills.
- Notions of automata theory.
- Robin Milner, Joachim Parrow, David Walker. A Calculus of Mobile Processes - Part I and Part II. Information and Computation 100:1-77 (1992).
- G. Ferrari, U. Montanari, E. Tuosto. Coalgebraic Minimisation of HD-Automata for the pi-calculus Using Polymorphic Types. TCS 331:325-365 (2005).
- V. Ciancia, G. Ferrari, M. Pistore, E. Tuosto. History Dependent Automata for Service Compatibility. In P. Degano, R. De Nicola, and J. Meseguer editors. Concurrency, Graphs and Models, volume 5065 of Lecture Notes in Computer Science, Springer-Verlag, July 2008.
3. Graphs model: Graph and graph transformation can be envisaged as a generalisation of terms and term rewriting. In last years, graphs have been widely used to model concurrent and distributed systems and nowadays many tools rely on such theories.
I'm interested in the use of a recent techniques for rewriting hypergraphs, a class of graphs where edges can connect more than 2 nodes. An interesting line of research is the implementation of the rewriting techniques defined for hypergraphs.
Required skills:
- Good programming skills (preferably functional programming).
- Some mathematical and logical skills.
- Gianluigi Ferrari and Dan Hirsch and Ivan Lanese and Ugo Montanari and Emilio Tuosto. Synchronised Hyperedge Replacement as a Model for Service Oriented Computing. F. de Boer, M. M. Bonsangue, S. Graf and W. P. de Roever editors. Formal Methods for Components and Objects: 4th International Symposium, FMCO, volume 4111 of Lecture Notes in Computer Science, Springer-Verlag, November 2005.
Emilio Tuosto's homepage and contact details
Irek Ulidowski
Reversible Debugging and Concurrency: In the last several years a number of commercial debuggers appeared on the market that claim to make full use of reversibility when debugging programs. The two good examples of such tools are UndoBD by Undo Ltd and Simics Hindsight by Virtutech. However, when it comes to dealing with multi-threaded programs or programs that use a shared memory, these state-of-the-art debuggers are powerless. This project aims to address this inadequacy by taking the formal methods approach. We aim to develop a robust method for reversing simple multi-threaded programs using a process algebra-like notation and methodology. Moreover, we aim to implement an extension of one of the existing reversible debuggers that is able to cope with multi-threaded programs.
An ideal candidate for this project would be interested in debugging in general, and would enjoy working with formal methodologies such as process algebra CCS, operational semantics of multi-threaded programs and reversibility of such programs. Additionally, good programming skills would be very helpful.
Starting date: October. This will enable the successful candidate to take a course on process algebra CCS and refresh their C++ and Java programming skills during Semester 1 (October to January) of the academic year at the University of Leicester.
Irek Ulidowski's homepage and contact details


text:
Tags: asian babes big cock big tits blowjobs cumshots dick
Free pron movies fucked at work
Tags: gays kiss nude sucking tiny
Trolling at porn tryouts
Tags: amateur
Christie Stevens is a cute blonde porn star with
Tags: babes big tits blondes boobs busty cute hooters
Cute blonde in audition hopes to become the next porn star !...
Tags: amateur audition blondes cute hardcore tits
Blonde porn star Brooke Banner is at it again, she managed to lure...
Tags: blondes brooke banner
Sexy blonde slut Samantha Sin turns up at the door of nasty porn star...
Tags: anal ass to mouth blondes blowjobs cum cum swallowing cumshots
Cute blonde masturbating at home
Tags: amateur blondes cute homemade masturbation
Cute blonde masturbating at pond
Tags: anal blondes cute dildo fingering masturbation
Cute blonde chicks at beach
Tags: beach blondes cute tits
Blonde Cute Kim Plays at home
Tags: amateur babes blondes cute dildo homemade masturbation
cute blonde posing nude at bathroom
Tags: amateur ass bathroom blondes cute innocent lingerie
One look at the cute blonde te
Tags: anal blondes cumshots cute facials throat
Cute blonde sisters at beach - hidden cam
Tags: beach blondes cute hidden cam tits webcams
Cute blonde spreads her legs at the park
Tags: amateur blondes cute homemade legs panties upskirt
Hot Brazilian and Cute Blonde go at it
Tags: blondes brazilian cute latin lesbians
Cute blonde teen hardcore sex at the gym
Tags: blondes cute gym hardcore teens voyeur webcams
Cute sexy blonde foreign exhcange student gets fucked at arrival
Tags: blondes cute student teens
Cute blonde foreign exhcange student gets fucked at arrival Part3
Cute blonde foreign exhcange student gets fucked at arrival part
Very cute blonde taking a shower naked at the beach
Tags: amateur beach blondes cute homemade nude shower
Look at Casper. Look at his cute face. His cute baby blues. His cute...
Tags: black cute gays interracial white
TrafficHolder.com - Buy and Sell Adult Traffic|Trafficshop.com - Let your business grow|Contact Us|Webmaster
All content, including images, text, graphics, video and audio content contained in the website is protected under the laws of copyright, owned or under license to company or its designees,and represents proprietary and valuable intellectual property.
Contact Webmaster 18 U.S.C. 2257 Record-Keeping Requirements Compliance Statement
Powered by Stream Rotator

subset: commoncrawl


text:
main index
Tintin goes to visit Captain Haddock and Professor Calculus at their new home in Marlinspike Hall. On the train, he reads about a team of seven explorers led by Professor Sanders-Hardiman returning home after a two year expedition in the Andes where they discovered the tomb of the ancient Incan priest Rascar Capac, with the latter's mummy in tow. A strange man compares them to the Egyptologists who unearthed Tutankhamen's tomb and claims the same fate will befall them. Later on, Tintin attends a music hall with Haddock and is surprised to find General Alcazar, having been deposed of power and now performing as a knife thrower. Another act by a psychic also mentions the Incan expedition and claims its members are in grave danger.Concurrent with these events, each member of the Sanders-Hardiman expedition starts falling into a mysterious coma, one by one. Thompson and Thomson are investigating and reveal that the only clue present at each scene are fragments of crystal spheres, which apparently contained some sort of mysterious gas that caused the comas. Despite the efforts of Tintin, Haddock, and the Thompsons, they are unable to stop the attacks and finally decide to personally guard the last explorer, Professor Tarragon, an old friend of Professor Calculus, who accompanies them to the former's house. After the Rascar Capac mummy disappears from the house in a mysterious bolt of ball lightning, Tarragon claims that this is the culmination of a prophecy: Rascar Capac has "returned to his element" and will go after Tarragon personally. Despite the escort, Tarragon succumbs to the coma as well, becoming the last of the seven. To make matters worse, Professor Calculus is kidnapped after finding the mummy's bracelet.Tintin and Haddock chase the kidnapper and manage to track him to the Pachacamac, a ship bound for Peru. Tintin also discovers that Alcazar's assistant Chiquito, one of the last descendants of the Incas is also involved. Tintin and Haddock depart for Peru to rescue Calculus, closing part 1 of the two part story that concludes in Prisoners of the Sun.


text:
Encore presentation
New wallpaper. Looks glorious!
Where technology and my imagination converge
Posted 2 years ago
Post PC… we have all heard the term thrown around loosely lately. Its ubiquity has fueled countless page views and a copious amount of flame wars. In short, its been every bloggers wet dream. Weary and dreary from various articles posted by armchair critics
on their 16th minute of fame devoid of any personal opinion wantonly regurgitating the death of personal computing, I followed the smoke hoping to find a find a fire. I will spare you the anguish of said articles. If you must, a quick Google search should reveal more than you could ever want to know. Arguments from both sides.
I'm not really interested in prophecies, neither am I with quoting myself nor providing solace to my ego 5 years later that I was right. Everything runs its course, even the digital age we're currently in. Tech being like seasons, always has a company that is the soundtrack to a generation, that is to say, there's always a company fueling its ambitions with your wallets. Perseverance always pays the patient; we are now in an Age of Empires dominated by both Apple and Google.
Whether YOU believe it's Microsoft, Apple or Google is entirely subjective. One thing is certain though, we all benefit and our way of life is collectively lifted. Ever since Steve Jobs threw his weight behind the post pc movement, everyone I know including their grandmothers have quoted him and naturally their perceptions shifted. While his insight is invaluable, one also has to wonder how much of it was a sales pitch to further his iPad agenda and ultimately Apples'.
I love PCs, and I'm sure most of you still do. Having your opinion skewed by limiting your horizons only serves to cripple your peripheral vision to tunnel. Just last week I invested in another computer with the sole purpose of enriching my digital life. Why? Because it still works! We're not there yet…. we are still playing around with idea of portable not post pc.
Having owned multiple tablets, netbooks, laptops and a myriad of smart phones, it's safe to assume we all know intimately the limitations possessed by each. The Achilles heel of mobile computing lies in what powers it, battery life. The only technology that has yet to benefit from all of this.
Sometimes if it is broke, improve it. That does not mean replace it.
Posted 2 years ago
After taking a lengthy sabbatical from updating this blog trying to figure out what I want to do and which tech to lust after, up popped the Galaxy Nexus. While I'm not the first to admit, the name was somewhat anti-climactic after the bar was raised with the Nexus Prime moniker. Hey Google, I will totally understand if you decide to rename this thing at any point before launch. So what makes the Galaxy Nexus THAT special?
Well special enough to resuscitate me back to writing again. I think the answer is simple… it looks freaking awesome!!
This is one of those moments I'm completely unafraid to let my geek flag fly. Some things just transcend social borders and kick open the mainstream acceptance doors. I think 3rd time's the charm for Google. The Galaxy Nexus has managed to stir up more excitement than any of its previous incarnations. I even had a couple of friends which are firmly in the Apple camp stay up late and watch the unveiling in Hong Kong. That speaks volumes as to its appeal. Or it could just be a case of keeping your enemies closer?
So what do we know about the Galaxy Nexus, well for one it can't get here soon enough. 2. it's rocking the latest iteration of Android, Ice cream sandwich. This by all accounts is the most substantial UI/ UX update to date. 3. There's a ton of features too numerous to mention jam packed, but neatly packaged NOT to make it appeal to only the geek squad. 4. The hardware, while most were expecting a sextuplet-core, 20MP camera laden phone like the Nexus One, which was about pushing boundaries appears modest to some, I believe this time around Google was more about refining the user experience. And I could go on…
So my virtual friends, there you have it. Armed with little more than tech lust, the Galaxy Nexus has revived my fledgling blog. As to availability, well the Europeans get first dibs on this. And I'm sure before it arrives this side of the pond, courtesy of YouTube and the magic of unboxings, we'll know more about this phone than we ever did about our lover's secret desires.
Source: google.com
Love pictures? Love panoramic shots? What if you wanted to stitch and view your images mapped in 3D? Seems the fellas at Microsoft had the same problem and decided to pack the solution in a 4.4MB app called Photosynth. Here's a quick rundown;
Most of the cons pointed out however come with a dash of salt, Photosynth is still at version 1.0 and most of the current issues can be fixed with a future software update. Overall it stands as one of the best panorama apps I've used. For an admission price of free, your argument to not download this becomes harder to win.
Love it or hate it, apps make or break a platform, Steve Jobs knows this, Steve Ballmer knows this, heck, I'm gonna go out on a limb and say you know this! App stores make it more convenient to blow your hard earned money. We have a love affair with apps that make our daily lives infinitely easier, just to think, a few years ago to stalk you, I would have to use Street View on a PC or a Mac. Gone are those days, now I can whip out my Android device and park outside your house with ease thanks to Google Maps, Navigation and Latitude. So what are the apps you can't live without?
Origin - mid 20th century (in the sense of strong affinity for gadgets): from French gagée 'tool' and Greek pornographos 'writing about prostitues', from porné 'prostitute' + graphein 'write'. In other words, gadgets are our tools and we show a strong affinity for them like prostitutes.
This blog is a collection of some of my favorite gadgets past, present, owned and most importantly, make believe. Let's do formal introductions, first let me tell you what this blog isn't. If you're searching for corporate sponsored tripe, keep looking! If you're looking for opinions that will wildly vary from yours and royally piss you off, yup, welcome to your new home.
Gadgets are a lot like your preferred religion, they invoke illusions of grandeur and superiority within self which ultimately leads to the belief that your preferred gadgets dwell in Neverland with unicorns and all else is what ills the world. Androidism, iOSim, Windowsism and to the lesser vocal WebOSism, all cults with devout followers, all striving for dominance. Point being, that same burning desire you feel for gadgets, well, it's what created this. So let's have fun bludgeoning varying opinions to death.
Update: Finally got the branding done thanks to my good friend at TendenZi.com


text: code tag,sub tag and sup tag (It would have been nice if its properties CAN be altered. As you would have guess this is an italicized text minus the parenthesis.) Last but not the least, this is an underlined text has no text decoration and its font color is similar to a [link] but the linked text changes color when hovered.


text:
Busch Gardens
Griffon evokes the power and speed of a mythical bird that is part eagle and part lion. It plunges, twists and turns - giving riders an adrenaline-pumping adventure that's unlike any coaster experience in the world. Busch Gardens boasts more than 50 thrilling rides and attractions, 10 main stage shows, award-winning cuisine and world-class shops. Tickets can be purchased at Concierge Desk.
Colonial Williamsburg
Step right into the 18th century and see how the people of that time grew their gardens, raised their animals, decorated their houses, printed their books and newspapers and punished their criminals. You can see authentic architecture, hear authentic music, and eat authentic food. And that's just Colonial Williamsburg, a 173-acre park containing more than 500 restored and reconstructed buildings. Located 3 miles from the lodge. Tickets can be purchased at Concierge Desk.
"Ghosts of Williamsburg" Candlelight Tour
An entertaining blend of local folklore, ghost stories, historical information and trivia, this candlelit walking tour of Williamsburg's Historic Area will entertain and intrigue young and old. Approximately 1 1/2 hour walking tour. 24-Hour advance reservations needed. Tickets can be purchased at Concierge Desk.
Go Karts Plus
Williamsburg Virginia's premier family entertainment center featuring go-kart tracks, miniature golf, bumper boats, kiddieland and more! Just 10 minutes from the Lodge. Tickets can be purchased at Concierge Desk.
Historic Yorktown
Relive the pivotal battle of the Revolutionary War. Visit historic homes, museums, monuments and battlefields and learn more about the brave citizens and soldiers who took a stand here. Shop in specialty stores, play on the riverfront, and dine in one-of-a-kind restaurants on the York River and up the hill in the village
Jamestown Settlement
Visitors are immersed in the world of America's First permanent English Colony Replicas of the three ships that sailed from England to Virginia. Located 5 miles from the lodge. Tickets can be purchased at Concierge Desk.
Kings Dominion
Ultimate entertainment for the entire family - approximately 400 acres of non-stop family fun! Tickets can be purchased at Concierge Desk.
Ripley's Believe It or Not Museum
Your year-round destination for the strange, unusual and bizarre! Tickets can be purchased at Concierge Desk.
Riverwalk Landing
This mile-long pedestrian walkway on the York River links Yorktown Battlefield and Yorktown Victory Center. Specialty shops offer jewelry, clothing, quilts, patriotic items, home decor, and more. Take time to play on the beach. Savor waterfront dining in unique restaurants. Listen and dance to a variety of music in a performance venue right on the river.
Schooner Alliance
Sail into history aboard Yorktown's 105' tall ship. Three sails daily from Riverwalk Landing pier. (May-Oct) . Tickets available at the Concierge Desk.
Virginia Air and Space Center
Features dozens of hands-on air and space exhibits, a premier interactive aviation gallery that spans 100 years of flight, more than 30 historic aircraft, unique space flight artifacts and more! Your imagination will soar as you launch a rocket, pilot a space shuttle, become an air traffic controller, fly an airplane, and climb aboard a WWII bomber! Come face to face with the Apollo 12 Command Module that went to the moon, a Mars meteorite, a DC-9 passenger jet, a replica 1903 Wright Flyer and more! Tickets can be purchased at Concierge Desk.
Williamsburg Area Golf Courses
Tee Times for these courses can be booked at the Concierge Desk. For Rate information please call 757-229-9700 ext 794.
Williamsburg Winery
Includes 55 acres of vineyards that have produced a variety of outstanding wines. Produces more than 70,000 cases annually of acclaimed vintage varieties, proprietary blends and specialty wines. Located about 10 miles from the Lodge. Tickets can be purchased at Concierge Desk.
Yorktown Victory Center
The American Revolution era is chronicled in gallery exhibits and a living-history Continental Army encampment and 1780s farm. Gift Shop. Tickets can be purchased at Concierge Desk.
OLETA Tour and Travel
Lights Galore
Everyone knows that the Christmas Holiday Season is the time for lights, lights and more lights. Join Oleta Tours for a trip to see Hampton Roads at its best as we see over a million lights displayed!
The coach will board passengers at various resorts and transport to Newport News's Celebration in Lights which is a two-mile drive thru a park. Next we will visit Norfolk's Botanical Gardens featuring Garden of Lights. From there we will stop at Dunkin Donuts for Donuts and Coffee or Hot Chocolate (time pending). We will then proceed to our final stop in Virginia Beach where McDonalds sponsors the Holiday Lights at the Boardwalk.
Holiday music and/or videos will be shown on the coach for the road trip to/from the lights. Passengers will return to their hotels or resorts with a new found look at what Christmas Lighting is supposed to be.
Ask your concierge to sign you up today.Tour nights available are Sunday, Tuesday & Saturday. Departure from Great Wolf Lodge 4:45pm and returning around 10:30pm (depending on traffic). Private tours are available in our SUV for parties of 4-6 people.
**We recommend dressing warmly**
$35/person Adult or Child
Oleta Tour & Travel, Inc.
Williamsburg, Virginia * 757-253-1008
OLETA'S Historic Triangle Tour
Our Most Popular Tour!
Includes an exclusive visit to the "Glebe" (site of the first land cleared by Jamestown settlers), admission to Jamestown Settlement, lunch at the Old Chickahominy House (inclusive), scenic tour down the Colonial Parkway and admission to the Yorktown Victory Center with cannon-firing demonstration. Price includes all admission tickets, transportation by deluxe motor coach and lunch at the Old Chickahominy House. Tour departs at 8:30am & ends at 5pm. (Tour runs Tuesdays)
OLETA'S Washington, D.C. Tour
An inspiring tour of the nation's capital. Travel by custom coach to witness some of our land's greatest sites.
Included are trips to the Lincoln Memorial, the Korean, Vietnam, Iwo Jima, and FDR Memorials as well as a drive by the Jefferson Memorial. Free time is allotted for exploration of your choice of museums on the Smithsonian Mall area. Plus you'll visit Arlington National Cemetery, where you'll view the Changing of the Guard, JFK's eternal flame & gravesite, and the Tomb of the Unknowns. Tour departs at 6:45 am and ends at approx. 9:00 pm. (Tour runs Thursdays)
For Shuttle Service, click Learn more below.


text:
Page 2 - West End Apartments for Rent(hide neighborhood information)
Small but lively, the West End is a private neighborhood north of Beacon Hill along the Charles River. Wealthy Bostonians began to settle the area in the late 1700s and stately mansions began to grace the landscape. One of those mansions, built by Charles Bulfinch in 1796, was the first Harrison Gray Otis House (in all, Bulfinch built three homes for Otis). The house, now operating as a museum, is on the National Register of Historic Places and is a US National Historic Landmark.
Although many of the houses were torn down during the 1950s and 1960s as part of an urban renewal project, some of the other buildings to survive include the Charles Street Jail, built in 1851 – it is now a hotel. Massachusetts General Hospital is another example of architect Charles Bulfinch's work; it was built in 1811 and is the third-oldest general hospital in the nation. This hospital, ranked as one of the top five in the country, is a teaching hospital for Harvard Medical School.
15 photosAtmark Cambridge 70 Fawcett Street, Cambridge, MA 02138 Map1 BR - 2 BR$2,177 - $3,651(857) 301-9399
26 photos Brand New to South Boston!!West Square 320 D Street, South Boston, MA 02127 MapStudio - 2 BR$2,315 - $4,500(857) 285-2375
Emerson Place 72 Staniford Street, Boston, MA 02114 MapStudio - 3 BR$1,970 - $4,320(857) 301-9384


text:
Oakland Athletics : The Drumbeat
All about the Oakland A's
Posts filtered on Tag
(UPDATE: definitely starting) Look for Yoenis Cespedes to start for A's tomorrow
John Shea reporting from Camp Cespedes . . . UPDATE: Bob Melvin just made it official after the A's beat the Rockies 6-4. Cespedes will start in center field and bat second (Coco Crisp isn't playing). Here's what Melvin said: "I think everybody's looking forward to it. It was a wait to even see him, […] [Read More]


text:
Let's assume that most Americans actually liked eating fruits and vegetables (a BIG assumption since most of us don't even come close; only a quarter to a third get the full recommended daily servings of fruit and vegetables).
Would they even be able to afford it? Because as we showed a few weeks ago, just one individual's daily portion is A LOT of food. A lot of EXPENSIVE food.
There are many ways to get your fruits and vegetables, but few disagree that fresh is best. They taste better and hold on to the most nutrients. Yet, the produce aisle is one of the most expensive sections of the store. Many people I know say one of the biggest deterrents to eating their daily fruit and veggies is the high add-on to their weekly grocery bill. No wonder everyone flocks to the processed food and candy aisles instead!
Or ... do we only think it's more expensive? Has anyone actually stopped complaining long enough to figure this out? By eating more roughage, will we be able to reduce our intake of other not-so-good foods and cut costs there? And how hard is it really to eat the full recommended amounts of produce every day? Will we feel and look so much better that it's worth the extra price?
A full investigation was in order. I spent a week carefully tracking my fruit and veggie consumption, trying to eat the full amount of each every day. And then I wrote down exactly how much eat bite cost me.
The bottom line:
I consider myself a healthy eater, but I was still surprised to see how much more fruit and vegetables I should be eating: a third more vegetables and at least twice as much fruit as I usually eat! I haven't been in the habit of snacking on fruit. My produce grocery bill came to $31.02 -- just for me. Throw in produce for my husband and my 6-year-old son and that brings us up to $77.55 just on fruit and vegetables. My family spent about $12 more than usual on fruit and $15 more on vegetables for a total $27 increase on top of our typical $150 per week bill.
So was the extra $27 worth it? Absolutely. First, there's the investment in our health. According to a new documentary, Nourish, Americans spend less than 10 percent of our income on food; meanwhile we spend 16 percent of our income on health care. Of course there are many different factors going into the high cost of health care beyond the junk we eat, but our highly-processed, cheap diet is definitely making us sicker. Besides, which of these two would you rather pay more for, food or health care? I don't have a lot of money, so when I do part with my precious funds I'd rather it go to healthy (and delicious) food.
By eating more fruit and vegetables I ate fewer empty calories. This was probably the biggest surprise, but snacking on all that fruit made me lose my appetite for the cookies in my pantry. I found vegetables that pulled double-duty as sources of nutrients and belly-fillers, what would ordinarily be some side starch that adds calories and little more. All in all I felt fed down to my cells, not just "full."
And then there's the joy of eating. The proportions on my plate changed from the traditional meat-starch-veg to meat-veg-veg, from brown and beige to a more vibrant array of colors. We also experienced a greater variety in flavors and textures at each meal. It reminded me of the scene in The Wizard of Oz when Dorothy leaves gray Kansas and enters colorful Oz. Who wouldn't want to eat like this more often?
What I ate over 1 week:
1 1/2 cup grape tomatoes $2.75
1 cup fennel bulb $1.69
1 cup arugula $2.50 organic
4 cup carrots $1.11
1 cup peas, frozen $0.62
3 cup red potatoes $3
1 1/2 cauliflower $0.75
1/2 cup salsa $1.29
1 cup watercress $1
1/2 cup mushrooms$0.75
1 cup broccoli rabe $1.50
1/2 cup pureed tomato $0.30
1 cup green beans $1
1 cup romaine hearts $1 (same cost for bagged salad mix)
6 bananas $1.77
4 apples $2 for local
1/2 cup kiwi berries $4
1 cup pineapple $2.50 ea
1 cup grapes $1.50 for "Mars" grapes at farmer's market
Total: $31.02 (not including flavorings and garnishes like garlic and basil)
Calculate how much fruit and vegetables you should be eating at FruitsandVeggiesMatter.
See this nifty info-graphic that shows how much Americans spend on groceries and on eating out by city.
Are you willing to spend more to get more fruits and veggies into your diet?
Image via ariztravel/Flickr
I love this post I have been trying to add more fruits but mostly veggies to our diets.It hasnt been easy but slowly I am doing it!Was that list you made only for one day?
I had to shop around for the right place to buy our fruits and veggies. I found the best place was a global food market-their produce selection is the best, the prices are better and overall quality is better too. I save a lot of money by buying just the produce and meats there, and get the rest of the general stuff at my other usual grocery store.
I am willing to spend a little more but I don't always have to. We mostly buy what is on sale, which will often be what is in season. We also save alot by buying from the farmer's market, whatever hey have. We only get strawberries in the summer, but we can live with that - not a $5 price tag for buying them in the winter.
I try to stick with fruits that are in season
We buy from a local stand that is ALL organic, yet significantly cheaper than even the icky stuff at the grocery store. I'll tell you too, I CANNOT STAND the stuff at normal chains anymore. Seriously, once you actually eat GOOD produce, you'll realize everything in chain stores not only looks terrible, but tastes terrible too. If more people got their hands on good produce, I think they'd willingly eat a lot more of it.
We fought over a pear that was pretty much perfect. Seriously. It was like candy.
Just because I don't buy as much as I should, DOESN'T mean I don't actually LOVE them. 'Cause I totally do. I hope we get to a point where I am able to incorporate more into my diet.
I already DO spend more....if I had more $$ to spend on them, yes, I'd increase my intake =)
Yes we do spend more, but its SO much better for us.


text:
Hong Kong Ranked #1 in Economic FreedomFebruary 8, 2013 0 Comments
Hong Kong was ranked #1 in Economic Freedom in 2012. It is ranked #1 in Economic Freedom in 2013 as well!
Economic freedom is a crucial component of liberty. It empowers people to work, produce, consume, own, trade, and invest according to their personal choices.
Why Does Economic Freedom Matter? – from The Heritage Foundation's Understanding America series – explores the framework America's Founders established for an economically free nation, and what economic freedom means for the United States and the rest of the world.
Hong Kong's economic freedom score of 89.3 keeps it atop the Index rankings for the 19th consecutive year. Its overall score is 0.6 point lower than last year, mainly due to increased government spending relative to GDP and an increase in inflation. Hong Kong is ranked 1st out of 41 countries in the Asia–Pacific region and 1st in the world.
The top ten countries in the Heritage Foundation 2013 Index are:
1. Hong Kong
2. Singapore
3. Australia
4. New Zealand
5. Switzerland
6. Canada
7. Chile
8. Mauritius
9. Denmark
The complete list may be found here.


text:
Instagram Announces Online Profile Pages
Because we know plenty of you out there are not only Facebook, Twitter, and Pinterest users, but also avid Instagram users, we thought we'd pass the word on the announcement of Instagram Profiles, which look very much like a mashup between a Facebook profile and a Pinterest page...
Your web profile features a selection of your recently shared photographs just above your profile photo and bio, giving others a snapshot of the photos you share on Instagram. In addition, you can follow users, comment & like photos and edit your profile easily and directly from the web. It's a beautiful new way to share your Instagram photos!
We haven't received our upgraded profile yet, but you can check your own by simply navigating to instagram.com/[username]. A few more examples available over at the official Instagram Tumblr.
3 Comments
I'm kind of not happy about this. Now anyone can just look you up on the web and if you don't want that you have to make it private for everybody. That's the one thing I liked about IG, the fact that creepers couldn't necessarily access my life.
ugh .... am I the only one that's sick of seeing instagram photos? They are so common now that they've become a cliché.
facebook purchased, now "assumed" privacy goes put the window.....i see a trend.


text:
Divine Liturgy - English version of the Arabic
The Divine Liturgy by Professor Michael Hilko, sung by many of our choirs in the 1950s and 1960s, is now available in English.
Divine Liturgy - 3-part
Three-part music for smaller choirs, in the key of F.
Michael the Archangel, Troparion of
This is the choral version of the Troparion of St. Michael that will be used at the Archdiocese Convention, 2009. It is in the special melody of Tone 4.
Kontakion of Meat-Fare Saturday (choral)
"With the saints give rest," sung on the Saturday before Meat-Fare Sunday. Also sung in the Funeral Service (See Funeral Service).
Communion Hymns for the Year
25 communion hymns for all occasions throughout the liturgical year
Trisagion Hymn (10E)
In English
Entrance Hymn - Hierarchical
Convention music-7C
Bless, O Lord, Thy Servants
Sung at weddings
Wedding, Sacrament of Marriage
Choral version of the Wedding: Betrothal & Crowning
Wedding, Sacrament of Marriage
Various Choral versions of the Wedding: Betrothal & Crowning
Memorial Service
Choral version of the Memorial (Trisagion) Service
Funeral Service
Choral version of the Funeral Service
Baptism, Sacrament of
Chant and Choral music for the Sacrament of Baptism. UPDATED AND CORRECTED, 8/29/13.
Cherubic Hymn
Convention music-13I. The audio file is provided by the SMI Chamber Chorale.
Hymn to the Theotokos
Harmonized by John Warren - Convention Music-17C
Holy Week Series
Selected pieces for Holy Week.
Troparion of the 5th Sunday of Great Lent
Sunday of St. Mary of Egypt
Troparion of the 3rd Sunday of Great Lent
Sunday of the Cross
Kontakion of Annunciation
Sung on March 25, and during the Akathist Hymn - Service
Troparion of the 4th Sunday of Great Lent
Sunday of John Climacus of the Divine Ladder
All creation rejoices in thee
Sung as the Hymn to the Theotokos for the Liturgy of St. Basil the Great (January 1st, the Sundays of Great Lent, Holy Thursday & Holy Saturday morning)
Kontakion of Annunciation
Sung on March 25, and during the Akathist Hymn - Service
Troparion of the 2nd Sunday of Great Lent
Sunday of Gregory Palamas
Troparion of the 1st Sunday of Great Lent
Sung on the Sunday of Orthodoxy
Kontakion of Cheese Fare Sunday
Fourth Sunday of the Pre-Lenten season


text:
Here's the game-day schedule for the Trojans, who start with a 9 a.m. wake-up call.
Monthly Archives: December 2007
Weekend Forum Answers, Act III
Here's the next installment of answers as 2007 winds down. Hail Caesar!
Continue reading
Looking Back
USC defensive lineman Sedrick Ellis on his concluding his career: "This may be the most winningest class in college football history, but you never really think about it until you come to the end. Playing with players like Reggie Bush and Matt Leinart and others, Its pretty amazing."
Injury Check
Here's Caesar's final injury update before the Rose Bowl.
Continue reading
About Those Chow Reports
Just a quick word about the idea of Norm Chow going to UCLA as offensive coordinator. Chow always tells friends that Titans coach Jeff Fisher is the best coach he ever worked for. And he's two years away from being eligible for an NFL pension. OK, that's it.
Weekend Forum Answers, Act II
Please join us in thanking Roman Meal for their continued sponsorship this season. Roman Meal, the bread Caesar supplies his legions as he convinces them it's great to be in the Rose Bowl.
Continue reading
Weekend Forum Answers, Act I
Here's the first installment on the last day of the year.
Continue reading
Polar Opposites
Even on the eve of the Rose Bowl, it comes back to Matt Leinart.
The Rumor Mill
Nebraska is making a strong push at quarterback Dayne Crist, who committed to Notre Dame months ago.
Word Of Warning
Quarterback John David Booty said teams no longer fear USC.
"I think teams are so excited to play us now because they know you can beat us and they want to bring us down," Booty said.


text:
International Student Admissions > Welcome new Gators!
By bbaldwin
August 23rd 2012
Allegheny is proud to welcome 28 new students to the Allegheny "Gator" family! Welcome and congratulations! It's wonderful to meet everyone personally after working with them this past year.
Name (required)
Mail (will not be published) (required)
"Allegheny has helped me gain an understanding of important global issues."
—Edayatu Lamptey
Rachel Dingman
International Admissions Coordinator
(814) 332-4732
AIM: WorldwideGators


text:
Basehart was unusually careful as a new Hollywood performer to vary his roles and avoid getting typecast. His first of what proved a string of memorable portrayals was in He Walked By Night (1948), a fact-based thriller in which the actor played a brilliant but sociopathic electronics expert, responsible for a string of burglaries and for killing a police officer. Viewers who grew up knowing Basehart as the heroic figure on the series Voyage to the Bottom of the Sea in the 1960s are often startled to see him 20 years earlier in He Walked By Night as an almost feral presence, quietly fierce, threatening and stealthy in his efforts to escape detection and capture. Over the next two years, Basehart essayed a multitude of roles, in contemporary dramatic subjects and period dramas, the most interesting of which was Anthony Mann's Reign of Terror (1949), in which he portrayed Maximilien Robespierre, one of the chief architects of the bloodbath that followed in the wake of the French Revolution. In 1950, Basehart played one of the most difficult film roles of his career when he was cast in the fact-based movie Fourteen Hours, playing a young man who spends 14 hours on the ledge of an office building, threatening to jump. It was during the shooting of this movie that Basehart's wife, Stephanie, was taken ill with what proved to be a brain tumor, and died very suddenly. He finished work on the film and then left the United States, going to Italy where he began putting his life back together. This began when he met the actress Valentina Cortese, whom he married in 1951. The two worked together in one movie, The House on Telegraph Hill, directed by Robert Wise at 20th Century Fox, in which Basehart played the villain trying to murder Cortese for her estate. Basehart returned to Hollywood only intermittently for the next nine years, and his next appearance in an American movie wasn't until 1953, when he worked in Titanic, starring Barbara Stanwyck and Clifton Webb. It was during the decade that Basehart made his home in Europe that the actor became multilingual, and developed a serious following over there as a leading man; while other, older American performers were entering the final legs of their careers making pictures in France, Italy, or England, he was making important pictures and playing great roles, as the doomed, gentle clown in Federico Fellini's La Strada; a basically honest man driven into crime in The Good Die Young; the movie director threatened by a blackmailer in Joseph Losey's Finger of Guilt, and even an action-adventure hero in an Italian-made version of Cartouche (1957). John Huston specifically chose Basehart for the central role of Ishmael in his superb 1956 film version of Moby Dick. In 1957, Basehart tried reestablishing his Hollywood acting credentials with his portrayal of a conscience-stricken American officer in the movie Time Limit, which got good notices but proved to be a one-off American screen credit.
In 1960, the actor divorced his second wife and left Italy behind. He returned to live permanently in America and restart his career, and began a new life, marrying again in 1962. He found that film roles weren't easily forthcoming, however -- the only part that came his way was the title role in Stuart Heisler's 1962 drama Hitler, in which Basehart gave an unusually complex, cerebral portrayal of the Nazi leader. He made numerous appearances in dramatic series such as Combat and Naked City, and television anthology shows including Playhouse 90 and Hallmark Hall of Fame. In 1964, Basehart accepted the offer of a starring role on a television series, beginning a four-year run on the Irwin Allen-produced Voyage to the Bottom of the Sea, portraying Admiral Harriman Nelson. Thus began the steadiest work of his career, more than 100 episodes made Basehart a television star. He appeared in one movie during this period, John Sturges' thriller The Satan Bug (1965), in which he played the villain. Following the cancellation of Voyage to the Bottom of the Sea, Basehart returned to acting on-stage, interspersed with work in made-for-television movies and occasional feature films, such as Rage (1972), directed by George C. Scott. He won critical acclaim for his work in the drama The Andersonville Trial, directed by George C. Scott, portraying Lt. Col. Henry Wirz, the commandant of the notorious Confederate prisoner of war camp, and made the rounds of guest star roles in television shows, perhaps most memorably the "Dagger of the Mind" episode of Columbo. Basehart and his third wife, Diana, also became known for their dedication to the cause of animal rights, founding the organization Actors and Others for Animals. During the final years of his life, he did some acting on television series such as Knight Rider and appeared in movies such as the hit Being There, but he was also very much in demand as a narrator, working on Vietnam: The Ten Thousand Day War (1980), among other projects. It was as a narrator that he made his final public appearance, at the closing ceremonies of the 1984 Summer Olympics. Basehart suffered a series of strokes, and passed away soon after. ~ Bruce Eder, Rovi


text:
The line between existing and succeeding can sometimes be fine. Have you done everything you can do to make sure your business is a success? We work with business owners who are ready to take their company to the next level with online marketing tools, aggressive strategies, and cutting-edge solutions to earn new, real business online via web design, search engine optimization, social media posting, and much more.
Your skill and your passion inspired you to create your own company. It's important that you stand out in the crowd. We take pride in our ability to build a true brand for your business, from something as small as a logo to your entire online presence. In order for your company to succeed, it must first be identified. We've helped Montana companies stand out in the crowd for years.
Any business owner can identify their primary client base. Few can effectively target those clients and properly market their business. iNSiGHT Creative Business Solutions can not only help you identify your market, but present your company to that market and build a bigger client base.
It's critical to be plugged into new marketing trends and avenues you can use to promote your company. A failure to do this leaves the door open to competitors who are equally prepared to grow their business. iNSiGHT will consult with you and ensure that your business utilizes even the newest tools available to meet new clients.
We understand that your focus is on your business. Our focus is on helping your business grow. Don't handicap your growth by not exploring new options and being aggressive. Work with a consulting firm that always looks out for your best interests. iNSiGHT's got you covered.
This is what we do. We specialize in getting to know your business better than anyone else and building a relationship. We're prepared to hit the ground running with great ideas for your business right away. Drop us a quick line, come hang out at the office, or fill our our online form and get the ball rolling on a new project with iNSiGHT right away.
The most important thing a modern business owner can do to legitimize their business to prospective buyers is to build a website. iNSiGHT will work on you to create an effective, sleek, and functional website that is optimized for today's online world. It's the backbone of our online marketing offering.
There's no getting around it - the world has gone mobile. To reach the millions of customers that are glued to their mobile devices, Insight can help you keep up with responsive websites that are built to give customers easy access to you through their mobile devices.
The best form of advertising will always be word of mouth. After all, what matters more to you: a positive ad you see in the paper, or a trusted friend or colleague's endorsement? Social media is the modern platform for word of mouth. Work with us to be fully optimized on this medium and generate a positive buzz.
Your business is crippled if people can't figure out how to reach you. A quick look at your listings online can reveal old contact information, closed locations, previous businesses, or incorrect information. Insight has the ability to clean up your business information and make sure that online customers and search engines have the right information.
If you're an expert - let people know! We're not shy about letting you know that iNSiGHT Creative Business Solutions is an industry leader in marketing, advertising, branding, and consulting in the Bozeman, MT, area. You shouldn't be shy, either. Work with us to develop stellar online content that represents your business and piques customer interest.
You're fabulous at what you do - it's important that your customers tell you that! iNSiGHT Creative Business Solutions gives you the avenue to do that with premium listings. We'll also work with you to monitor what your customers are saying, so that you're always in the know.


text:
Welcome To The Unofficial Collie Christensen Fraudster Page
Collie Christensen started his illustrious career as a criminal boosting cars and breaking into houses in his youth, or at least that's the story from one of his estranged old friends.
He soon became resourceful enough to start his own business, selling phones and then working for ITEX, bartering and trading goods. He eventually reached the position of CEO at ITEX and was subsequently asked to leave by the Board of Directors, after allegations of fraud were brought by the board members against Terry Neal, his predecessor at the company, who was later convicted of defrauding the government of $143,718 and ordered to pay $2.3 million in ill-gotten gains. Although Collie was never formally charged, you can find information regarding his Fraud case online via Quatloos (link included).
Collie then began 'flipping houses' and used the momentum and money he had made to convince a group of people to invest in a Modesto project, building track-homes, which ultimately went bankrupt. He maintained that the housing market crash was to blame and that it was out of his hands.
He didn't let this get in his way as he forged forward with another development in the Gulf Coast, in Wiggins, MS. With some smooth talking and the appearance of a tremendous amount of wealth (which did not exist) he began pulling in more money than ever.
He formed Equus 11, a 'private real estate development company' in 2007 and although never being registered with the SEC or any governing body he began collecting huge amounts of money in small amounts from Doctor's and other inexperienced investors, who required little to no due diligence and trusted him based on his word. This project also soon went bankrupt, costing many investors their family's life savings.
Collie's newest endeavors are not known... Ā


text:
To Kill A Sunrise…..
October 15, 2010 lizhastings No comments
If a child wakes me in the middle of the night because they have had a bad dream, they need assistance in the bathroom, have a soiled diaper, want to tell me a knock-knock joke or remembered the name of their new best friend they must schedule a sleepover with, I'm okay with it.
When Hornsour the cat wakes me at 1:44am because she has a visitor on our deck wanting nothing more than to find shelter from the rain on one of the remaining seven cushioned dining chairs, why do you suppose she would hiss and attack this fellow straggler? Continue reading "To Kill A Sunrise….." »


text:
LOS ANGELES -- "The Twilight Saga: Eclipse" is waning at the box office but still has gotten off to a blockbuster start with $161 million in its first five days.
The third chapter in the vampire romance fell off sharply after
debuting last Wednesday with $68.5 million. That was the
second-best opening-day haul ever, behind its predecessor, last
year's "The Twilight Saga: New Moon," which opened with $72.7
From Friday to Sunday, "Eclipse" took in $69 million, a
fraction more than it managed just on opening day.
Its total through Sunday came in well short of the $200 million
mark set last year by "Transformers: Revenge of the Fallen," the
record-holder for best five-day start for movies opening on


text:
Find Richmond and Central Areas Alzheimer's Facilities
Located on 59 picturesque acres in the eastern foothills of Virginia's Blue Ridge Mountains, The Colonnades is just minutes from the University of Virginia, Thomas Jefferson's Monticello, the 250-Bypass, Highway 64 and Route 29. We pride ourselves in ... read more
Imagine a lifestyle where every day has the feel of home - a place where you are surrounded by an extended family of friends and caring staff. Imagine days filled with entertaining social activities or quiet relaxation in the privacy you desire. Fina ... read more
Southerland Place - Midlothian provides our residents with lifestyles, housing, care and services in comfortable surroundings combined with exceptional amenities, programs, and care. Through Brookdale's signature Personalized Assisted Living we custo ... read more


text:
Missing Giro was my choice, says Porte
Richie Porte from Australia waves to the crowd on the podium after stage 5 of the 2014 Tour Down Under cycling race at Willunga Hill near Adelaide on January 25, 2014 - by Mark Gunter
Sky announced their nine-man Giro team on Thursday, with Briton Peter Kennaugh, Dario Cataldo of Italy and Belarussian Kanstantin Siutsou leading the British team, who will be aiming for stage wins rather than overall GC success.
Earlier in the season, Porte had been slated to lead Sky for the first time at a Grand Tour in Italy but a bout of gastroenteritis, which saw him abandon from both the Tirreno-Adriatico and Tour of Catalunya, meant he had to pull out of the Italian extravaganza.
Instead he will again be title-holder Chris Froome's main lieutenant at July's Tour de France.
"I want to talk a bit about the Giro and what happened," Porte wrote in his blog on cyclingnews.com.
"Look, first off it was a really tough call but at the end of the day, I decided that I just couldn't go there and race. It was my decision, not the team's and they've been really supportive and didn't put any pressure on me whatsoever.
"I would have loved to have raced the Giro but at Tirreno I went from being up there on one mountain stage, and in quite good condition, to being knelt over a toilet in my time trial position due to gastroenteritis.
"I thought that I was okay for Catalunya but I just had nothing in the tank and when you know, you just know."
Porte has just spent two weeks training on the Mount Tiede volcano in Tenerife with Froome.
He says he's riding himself into form and even admitted there was a slight temptation to go for the Giro, before deciding he doesn't have enough time to reach peak condition for a three-week race.
Instead he is looking forward to tackling Sunday's Liege-Bastogne-Liege race before going on to the Tour of Romandie next week.
"In the last few days, of course I've thought about changing track and going to the Giro," added the 29-year-old Tasmanian.
"You're out training, you're feeling good and you can't help but think to yourself 'yeah I can still do this' but a month without racing just means it's not realistic.
"A month without racing feels like an eternity and no matter how much work you do at altitude, it's still not the same.
"The reality is that you can't lose three weeks of training so close to a grand tour.
"Now I'll go to the Tour, where we'll have a stronger team and a clear set of aims. We have the defending champion, and the best rider in the peloton in Froomie and I'm looking forward to racing alongside him.
"So it's Liege next and then Romandie. I did Romandie last year and my form at that time was on a bit of a downward spiral but I'm coming into that race quite fresh."
You might also like these:
facebook recommendations
Sports Features
Barclays Premier League
- England players 'treated like babies' - Ferdinand
- Wenger says new Giroud deal 'done'
- Hull name change now in arbitration - FA
- 'Frightening' United encourage Van Persie
- Stoke add to Magpies' misery
- English Premier League scorers
- English Premier League table
- English Premier League results
- Rest is Hart-stopping for City keeper
- I deserved to be sent-off, admits Rooney
- Entertainment
- Asia Celeb News
- Hollywood Buzz
- Korean Buzz
- Celeb Interviews
- Celeb Bios
- Celeb Blogs
- Photo Galleries
- Music Reviews
- Movies
- xinFirst Webisodes
- TV Channels
- Channel 5
- Channel 8
- Channel U
- okto
- Suria
- Vasantham
- Radio
- Class 95FM
- Gold 90.5FM
- Lush 99.5FM
- Symphony 92.4FM
- Capital 95.8FM
- Love 97.2FM
- Ria 89.7FM
- Warna 94.2FM
- Oli 96.8FM
- Lifestyle
- Beauty & Fashion
- Food
- Going Out
- Health
- Relationships
- Travel
- Work Life
- Style
- Style:Men
- Style:Weddings
- Style:Living
- i-Weekly i周刊
- Timepieces
- Mother & Baby
- Elle
- Postbox
- News
- Singapore
- World
- Regional
- Sci-Tech
- Weird
- Business
- News Videos
- Sports
- Local Sports
- World Football
- Formula One
- Video
- Catch-Up TV
- Entertainment
- xinmsn Celebs
- Korean Celebs
- Hollywood Celebs
- Weird & Wonderful
- News
- Lifestyle
- Sports
- xinFirst


text:
I was in an auto accident, where an young lady rear end me. Because of the accident I had to have back surgery,(back fusion). I have been home since 12/26/2012. I had to paid out pocket, for ALL of my medical expense. I also was told I had to settle, for her insurance which uninsured motorist is $25,000.00 and my uninsured motorist is the same. Why can't I get loss wages, pain and suffering, and my medical paid by her. So far I feel as if I am being blamed for an accident, that I did not cause. I feel like the BIGGEST LOSER.
The other driver's insurance will obviously only pay up to the coverage she bought.
But there is good news, assuming you acted prudently. Because many people are underinsured, EVERY driver should carry a HIGH limit uninsured motorists coverage, and, if they lack health insurance, med-pay. Assuming you did this, the good news is your med pay pays your medical bills up to your policy limit, and you can go after your own UM coverage as well. Hopefully you have a lawyer as you should already have one, so they can collect these claims for you.
If you made the mistake of not having such coverage, you made a mistake that sadly will prove very costly. But if you have the two coverages I mentioned, this post was good news for you.
Incidentally, if the other driver has assets or income, your lawyer may also be able to sue the other party for claims above the policy limits.
Discuss all this immediately with your attorney. Good luck with your recovery!
If you have not consulted with an attorney you should do so as soon as possible. It sounds like the other driver has $25,000 in liability coverage and you have $25,000.00 in uninsured motorist coverage. Georgia has two types of uninsured motorist coverage, one allows you to add or stack your coverage and the other does not. If you have add on coverage you can get to $50,000.00 based on the facts you provide. Also, if you live with any resident relatives that have their own policies or have other insured vehicles you may be able to use that insurance for additional coverage. Last but not least, if you have a hospital lien your attorney ought to be able to negotiate that down so you can get some money in your pocket.
In sum, don't feel like a loser and I wish you the best of luck in your recovery.
The problem you have is that it appears that the driver who hurt you only carried the State mandatory $25,000.00 worth of insurance. It also sounds like you only carried $25,000.00 worth of underinsured coverage (insurance designed for situations like this).
Have you discussed these issues with your lawyer as there are ways to stack the insurance to get $50,000.00 of coverage. There may also be more insurance out there that you don't know about. If you don't have a lawyer you need one.
UM could be stackable, and there may another source of coverage. Have a local personal injury lawyer get you everything to which you are entitled.
I'm sorry about your loss. Unfortunately, the issues in your case are not whether the lady who hit you was at fault or whether you have suffered significant damage, but whether there is enough insurance or assets or income of the driver available to fully compensate you. Have your attorney fully investigate the available insurance in your household and the driver's household and the assets and income of the driver who hit you before you settle your case. Good luck.
Attorney Ashman has pretty much answered your question. Also, in Ga. your UM must exceed the other drivers liability coverage (in this case 25k) before you can claim it, and your injuries are sufficient to warrant more than the other party's 25k limit. Your injuries clearly warrant a great deal more than 25k but if you don't have health ins. and higher UM coverage and med-pay, you are stuck suing the other driver if he/she has any assets you can collect or, if not, settling for the 25k. Even if you sue and win more, unless she was drunk the reality is that she could probably bankrupt on your judgment anyway. I am sorry for your apparently unfortunate situation, which many people find themselves in. In the future, protect yourself by buying more insurance coverage.
Get free answers from experienced attorneys.
26,543 answers this week
2,990 attorneys answering
Get answers from top-rated lawyers.
Ask a Lawyer
26,543 answers this week
2,990 attorneys answering