text:
An emergent network is autonomous at the service level. Network nodes have policies that enable them to process different types of service requests, with the processing earning the nodes 'rewards'. Successful nodes can pass some or all of their policies to other nodes using the evolutionary biology of bacteria as a model.
1. A method of operating a multi-service communications network comprising a polygonal topology and including a plurality of nodes located along at least one edge of the network and a plurality of nodes located away from the edge of the network, each node being directly connected to one or more neighboring nodes such that each node is directly or indirectly connected to every other node in the network, the method comprising, at each node:
either (a) selectively performing one or more services upon receipt of a service request in accordance with one or more nodal policies, when implemented by the node, or (b) forwarding a service request to a neighboring node,
each nodal policy including: (i) a service request type identifier indicating the type of service request to which the policy applies, and (ii) one or more service request criteria which specify the circumstances under which a node implementing the policy will perform a requested service;
wherein, whenever a node receives a service request at option (a), either from a user of the network or from a neighboring node, if the node is operating in accordance with a nodal policy whose service request type identifier corresponds to the type of the received service request and the criteria set out in the nodal policy are satisfied, then the service request is processed by the node or queued by the node for subsequent processing, but otherwise at option (b) the request is forwarded to a neighboring node, unless, in either case, the request has timed out;
maintaining an activity indicator whose value is determined in dependence upon the amount of time the node spends performing services in response to service requests; and
selectively varying a nodal policy or its implementation with a probability which is inversely correlated to the value of the activity indicator,
wherein service requests from users of the network are initially inserted into node locations along at least one edge of the multi-service communications network, and
wherein each node, when forwarding a service request to a neighboring node, selects a neighboring node to which to forward the request to cause a tendency for forwarded service requests to migrate away from said plurality of nodes located along said at least one edge of the network.
2. A method according to
3. A method according to
4. A method according to
5. A method according to
6. A method according to
7. A method according to
8. A data storage medium containing computer code which, when executed by a computer at each of plural nodes in a multi-services communications network causes the network to carry out the method of
9. A multi-service communications network comprising a polygonal topology and including a plurality of nodes located along at least one edge of the network and a plurality of nodes located away from the edge of the network, each node being directly connected to one or more neighboring nodes such that each node is directly or indirectly connected to every other node in the network, wherein each node comprises a processor, said processor having:
means for either (a) selectively performing one or more services upon receipt of a service request in accordance with one or more nodal policies, when implemented by the node, or (b) forwarding a service request to a neighboring node,
each nodal policy including: (i) a service request type identifier indicating the type of service request to which the policy applies, and (ii) one or more service request criteria which specify the circumstances under which a node implementing the policy will perform a requested service;
wherein whenever a node receives a service request at option (a), either from a user of the network or from a neighboring node, if the node is operating in accordance with a nodal policy whose service request type identifier corresponds to the type of the received service request and the criteria set out in the nodal policy are satisfied, then the service request is processed by the node or queued by the node for subsequent processing, but otherwise at option (b) the request is forwarded to a neighboring node, unless, in either case, the request has timed out;
means for maintaining an activity indicator whose value is determined in dependence upon the amount of time the node spends performing services in response to service requests; and
means for selectively varying a nodal policy or its implementation with a probability which is inversely correlated to the value of the activity indicator,
wherein the network is arranged such that service requests from users of the network are initially inserted into node locations along at least one edge of the multi-service communications network, and
wherein each node is operable, when forwarding a service request to a neighboring node, to select a neighboring node to which to forward the request to cause a tendency for forwarded service requests to migrate away from said plurality of nodes located along said at least one edge of the network.
This application is the US national phase of international application PCT/GB01/04134 filed 14 Sep. 2001 which designated the U.S.
1. Technical Field
This invention relates to the field of network management and in particular the management of complex data communication networks.
2. Related Art
Communication networks such as the Internet are probably the most complex machines built by mankind. The number of possible failure states in a major network is so large that even counting them is infeasible. Deciding the state that the network is in at any time with great accuracy is therefore not possible. In addition, data networks such as the Internet are subjected to a mixture of deterministic and stochastic load (see V Paxson and S Floyd, "Wide Area Traffic: The Failure of Poisson Modelling", IEEE/ACM Transactions on Networking 3, (3), pp 226-244, 1995 & S Gribble and E Brewer, "System Design Issues for Internet Middleware Services: Deductions from a Large Client Trace", Proceedings of the USENIX Symposium on Internet Technologies and Systems (USITS ′97), December 1997). The network's response to this type of traffic is chaotic (see M Abrams et al, "Caching Proxies: Limitations and Potentials", Proc. 4th Inter. World-Wide Web Conference, Boston, Mass., December 1995), and thus the variation of network state is highly divergent and accurate predictions of network performance require knowledge of the current network state that is more accurate than can be obtained. Future networks, which will have increased intelligence, will be even more complex and have less tractable management. A network management paradigm is required that can maintain network performance in the face of fractal demands without detailed knowledge of the state of the network, and can meet unanticipated future demands.
Biologically inspired algorithms (for example genetic algorithms and neural networks) have been successfully used in many cases where good solutions are required for difficult (here, the term 'difficult' is used to represent a problem that is computationally infeasible using brute force methods) problems of this type (see CM Roadknight et al, "Modelling of complex environmental data", IEEE Transactions on Neural Networks. Vol. 8, No 4. P. 852-862, 1997 & D Goldberg, "Genetic Algorithms in Search, Optimization and Machine Learning", Addison-Wesley, 1989). They simulate evolutionary procedures or neural activation pathways in software, these then acting as problem solving tools. They can do this because they take a clean sheet approach to problem solving, they can learn from successes and failures and due to multiple adaptive feedback loops, they are able to find optima in a fractal search space quickly.
According to a first aspect of the present invention there is provided a multi-service communications network having a substantially polygonal topology and comprising more than one node, each node comprising one or more nodal policy and being configured to process one or more services in accordance with said one or more nodal policy, each nodal policy comprising;
(i) a service request identifier, said service request identifier determining the type of service request that may be processed by each respective node; and (ii) one or more service request criteria, said service request criteria determining whether a type of service request defined by said service request identifier will be processed by each respective node, the processing of said one or more services determining an activity indicator of said node such that the node may vary one or more of the nodal policies in accordance with the activity indicator characterised in that service requests are inserted into node locations along at least one edge of the multi-service communications network. The invention is further characterised in that unprocesesed service request has a tendency to migrate away from the edge of the multi-service communications network at which the service request was introduced.
Preferably, each nodal policy comprises: (i) a service request identifier which determines the type of service request that is processed by each respective node; and (ii) one or more service request criteria which determines whether a suitable type of service request is processed by each respective node. The preferential processing of the service request may be determined by a service request function; this service request function may be the time to live or alternatively it may be the value derived from processing the service request.
It is preferred that if the activity indicator reaches a first upper threshold then the node may export one or more of the nodal policies. This provides the advantage that the policies of successful nodes to be exported for possible use by other nodes. Additionally, if the activity indicator reaches a second upper threshold then the node may replicate all of the nodal policies to generate a clone of the node. The second upper threshold may be a value of the activity indicator that is greater than the first upper threshold or it may be maintaining the first upper threshold for a given period of time. The advantage of this is that nodes which continue to be successful over longer periods are replicated, ensuring the survival of the fittest.
It is also preferred that if the activity indicator reaches a first lower threshold then the node may import a further nodal policy. This provides the advantage that the unsuccessful nodes may acquire policies from successful nodes in order to improve the unsuccessful nodes. Additionally, if the activity indicator reaches a second lower threshold then the node may repress an enabled nodal policy and enable a dormant nodal policy. The second lower threshold may be a value of the activity indicator that is lower than the first lower threshold or it may be maintaining the first lower threshold for a given period of time. This provides the advantage that unproductive policies can be discarded in order that other policies may be used. Furthermore, if the activity indicator reaches a second lower threshold and the node has no dormant nodal policies then the node may delete itself. The advantage of this is that nodes which continue to be unsuccessful over longer periods are removed from the network so that the processing of service requests can be concentrated on successful nodes.
Additionally, one or more of the variables within a nodal policy may be randomly varied, allowing the heterogeneity of nodal policies in the network to be advantageously increased. Each node may further comprise a variable that encodes a preference for existing in a defined region of a cluster. This allows nodes, or nodal policies held within a node to adapt themselves to develop a preference for a particular area of the network, for example a node which specialises in processing service requests with a short TTL may adapt to exist close to the edge of the network where the service requests enter the network.
The multi-service communications network may be implemented as described above using a data carrier storage medium comprising computer code means in coniunction with a processor at each of plural nodes in a multi-services communications network.
The invention will now be described, by way of example only, with reference to the following figures in which;
One approach to managing such a network would be to make all nodes capable of processing all types of requests and with each node having sufficient capacity to be able to process all of the requests received at that node. However, this would lead to a very inefficient use of resources as virtually every node would be over-dimensioned and have an excess of capacity, both in terms of the type of service requests and the number of service requests that each node would be able to process.
Another approach would be to limit each node to processing a fixed subset of the different services supported by the network and providing a fixed capacity of processing capability for each service type at each node. By placing nodes which can process different types of traffic optimally within the network with respect to the type and number of service requests generated by the nearby communities it will be possible to meet most service requests. There will need to be some management layer within the network so that service requests can be "balanced" across the network, by sending service requests which can not be handled by local nodes to more distant nodes, as the service requests vary across the network. The disadvantage of this approach is that as communities change and the service requirements of the communities change, the location and/or the processing capabilities of the nodes will become less optimal, causing an increase in inter-nodal traffic as service requests are routed to an appropriate node, increasing the management overhead of the network. For a network having N inter-connected nodes there are N2 inter-nodal relationships to manage, which makes such a management scheme intractable as N becomes large (for example, much larger than 1000).
According to the present invention the nodes shown in
Bacteria are a set of metabolically diverse, simple, single-cell organisms. Their internal structure is simpler than many other types of living cell, with no membrane-bound nucleus or organelles, and short circular DNA. This is because the genetic structure of bacteria is relatively simple. It has been demonstrated that only around 250 genes are required to code for an independent, self-sustaining bacterium, and highly competent bacteria, for whom the entire genome is known, have only 2000-3000 genes. As a result bacteria can reproduce within 30 minutes of 'birth'. It has been said that bacterial evolution 'transcends Darwinism'(D Caldwell et al, "Do Bacterial Communities Transcend Darwinism?", Advances in Microbial Ecology. Vol. 15. p.105-191, 1997), with asexual reproduction ensuring survival of the fittest and a more Lamarkian (Lamark was an 18th century French scientist who argued that evolution occurs because organisms can inherit traits, which have been acquired by their ancestors during their lifetime) mechanism of evolution occurring in parallel, with individuals capable of exchanging elements of their genetic material, known as plasmids, during their lifetime in response to environmental stress, and passing the acquired characteristics to their descendants.
Plasmid migration allows much quicker reaction to sudden changes in influential environmental factors and can be modelled as a learning mechanism. Sustaining fitness in a complex changing fitness landscape has been shown to require evolution together with a fast learning mechanism. It is vital that the learning is continuous, and does not require off-line training as with many neural-net-based approaches. When a population of E Coli (a common bacterium) is introduced to a new environment, adaptation begins immediately (see RE Lenski and M Travisano "Dynamics of Adaptation and Diversification", Proc. Nat Acad. Sci. 91: 6808-6814, 1994), with significant results apparent in a few days (i.e. O(1000) generations). Despite the rapid adaptation, bacterial communities are also remarkably stable. Fossils of communities (stromatolites) that lived 3.5 billion years ago in Australia appear identical to present day communities living in Shark Bay on Australia's west coast. Bacteria thus have many of the properties (simplicity, resilience, rapid response to change) that are desirable for network entities.
In similar biological systems such as protocists, where the probability of mutation occurring during the copying of a gene is around 1 in a billion, adaptive evolution can occur within 1 m generations (O(1000)yrs). GAs typically evolve much faster since the generation time is O(100) ms and the mutation rate is raised to 1 in a million but adaptation can still only deal with changes on a time-scale of O(10) s. Using bacterial learning (plasmid interchange) in a GA will improve this to O(10) ms, and substantially improve its performance when faced with rapid change.
The set of policies specifies which type of service request the node is able to process (e.g. a, b, c or d from
x is a function representing the type of service requested;
y is a function which determines whether a service request is accepted dependent upon the number of service requests queued at the node; and
z is a function which determines whether a service request is accepted dependent upon the activity level of the node.
The 'value' that a node may derive from processing a service request would be receiving revenue from a user or network or service provider (this is analogous to a bacterium gaining energy from metabolising resources, such that the bacterium can survive and potentially reproduce). The quantum of revenue will depend upon the type of service request which is processed by the node, with some service requests being more important and hence providing greater reward when they are processed.
Each node may have any number of policies. Enabled nodes (i.e. a node that is processing service requests) will have one or more enabled policies (i.e. policies which are in use to determine the response of the node) and may also have a number of dormant policies (i.e. once enabled policies that are no longer used to determine the response of the node). Dormant policies may be re-enabled and enabled policies may be repressed, becoming dormant.
User requests for service are received by the node(s) nearest the point of entry to the network from the user community generating the service request. If the node is capable of processing the request then the request joins a queue, with each node evaluating the items that arrive in its input queue on a 'first in, first out' principle. If the service request at the front of the queue matches an available policy the service request is processed, the node is 'rewarded' (i.e. revenue is generated for the network or service operator) and the request is then deleted from the queue. If the service request does not match any of the node's enabled policies then the request is forwarded to an adjacent node and no reward is given. The more time a node spends processing service requests, the busier it is and the rewards (or revenue) generated by the node increases. Conversely, if a node does not receive many service requests for which it has an enabled policy then the node is not busy and little reward (or revenue) is being generated by that node. If a node which is receiving service requests, for which it has an enabled policy, at a greater rate than it is capable of processing those requests then the length of the queue of service requests will grow. This will lead to an increase in the time taken to process a service request and hence a poor service will be supplied to the user communities.
In order to reduce these unwanted effects it would be desirable for the nodes which are not busy and/or which have small queue lengths to able to acquire the traits of the nodes which are busy and/or have large queue lengths. One method by which this may be achieved is by adopting a scheme that is an analogue of plasmid migration in bacteria. Plasmid migration involves genes from healthy individuals being shed or replicated into the environment and subsequently being absorbed into the genetic material of less healthy individuals. If plasmid migration does not help weak strains increase their fitness they eventually die. Thus, if a node has a queue length or an activity indicator that reaches an upper threshold value then one of the node's policies is randomly copied into a 'policy pool' which is accessible to all nodes. Alternatively, the node may copy the most successful policy (in terms of generating revenue over a given recent period) or any other policy into the 'policy pool'. If a node has an activity indicator and/or a queue length that reaches a lower threshold then a policy is randomly selected from the policy pool and acquired by the node. If the policy pool is empty then the node must wait for a 'successful' node to add a policy to the policy pool. The threshold values (both upper and lower) need not be the same for the queue length as for the activity indicator.
If a node maintains the upper threshold value for the queue length or for the activity indicator for a given period of time (i.e. the node sustains its success) then the node can clone itself by producing another node having the same set of policies as the parent node. This is analogous to healthy bacterium with a plentiful food supply reproducing by binary fission to produce identical offspring. Alternatively, this cloning process may be initiated by the node's queue length or activity indicator reaching a second upper threshold value, this second upper threshold value being greater than the first upper threshold value. Conversely, if a node maintains the lower threshold value for the queue length or for the activity indicator for a given period of time (i.e. the idleness of the node is sustained) then some or all of the enabled policies of the node are deleted and any dormant policies are activated. If the node has no dormant polices then once all the enabled policies have been deleted then the node is switched off. This is analogous to bacterial death due to nutrient deprivation.
Following the analogy with bacterial evolution, it is believed that a slower rate of adaptation to the environmental changes is preferable to a faster rate of adaptation, as a faster rate may mean that the network nodes end up in an evolutionary 'blind alley', without the genetic diversity to cope with subsequent environmental changes. This can be achieved by favouring random changes in nodal policies rather than favouring the adoption of successful policies or the rejection of unsuccessful policies.
The other method by which the nodal policies may be varied is analogous to random genetic mutations which occur in bacterium. For example, policy mutation may involve the random alteration of a single value in a policy. If a policy were to have the form:
Accept request for service a if activity indicator<80% then permissible mutations could include (mutation indicated in bold);
Accept request for service c if activity indicator <80%, or
Accept request for service a if activity indicator <60%, or
Accept request for service a if queue length <80%.
Simulations have shown that single value mutations give rise to stable systems with fairly low rates of mutation. Whilst it would be possible to have multiple value mutations (e.g. 'Accept request for service a if activity indicator<80%' mutating to 'Accept request for service b if queue length<20%') this may lead to an unstable system. Results of simulations show that because of the long-term self-stabilising, adaptive nature of bacterial communities, which is mimicked by the nodal policies, a network management algorithm based upon bacterial genetic structure and environmental responses provides a suitable approach to creating a stable network of autonomous nodes. The above approach makes each node within the network responsible for its own behaviour, such that the network is modelled as a community of cellular automata. Each member of this community is selfishly optimising its own local state, but this 'selfishness' has been proven as a stable community model for collections of living organisms (R Dawkins, "The Selfish Gene", Oxford University Press, 1976) and partitioning a system into selfishly adapting sub-systems has been shown to be a viable approach for the solving of complex and non-linear problems (S Kauffman et al "Divide and Coordinate: Coevolutionary Problem Solving", ftp://ftp.santafe.edu/pub/wgm/patch.ps). Thus overall network stability is provided by a set of cells that are acting for their own good and not the overall good of the network and this node self-management removes most of the high-level network management problems.
The inventors have implemented a simulation of a network according to the present invention (and of the kind described above). The simulation system supports up to ten different service types but in the interest of simplicity the following discussion will refer to a subset of four of these service types; A, B, C, D and is based upon a rectangular grid having 400 vertices (which is merely an exemplary value and not critical to the working of the invention). The system is initialised by populating a random selection of vertices with enabled nodes. These initial nodes have a random selection of policies which define how each node will handle requests for service. These policies have a number of variables and are represented by the form {x,y,z} where:
x is a function representing the type of service requested;
y is a function between 0 and 200 which is interpreted as the value in a statement of the form
Accept request for service [Val(x)] if queue length <Val(y); and
z is an integer between 0 and 100 that is interpreted as the value in a statement of the form
Accept request for service [Val(x)] if busyness <Val(z %)
A node having a number of policies is represented as {x1,y1,z1: x2,y2,z2: . . . : xi, yi,zi}
Requests are input to the system by injecting sequences of characters, which represent service requests, at each vertex in the array. If the vertex is populated by a node, the items join a node input queue. If there is no node at the vertex then the requests are forwarded to a neighbouring vertex. Each node evaluates the service requests that arrive in its input queue on a 'first in, first out' principle. If the request at the front of a nodal queue matches an available rule then the request is processed, the node is rewarded for performing the request and the request is deleted from the input queue. If there is no match between the service request and the node's policies then the request is forwarded to another vertex and no reward is obtained by the node. Each node may only process four requests per measurement period (henceforth referred to as an epoch). The more time a node spends processing requests, the busier it is seen to be and the greater the value of its activity indicator. The activity indicator can be determined by calculating the activity in the current epoch, for example, if the node processed three requests in the current epoch, generating 25 'points' of reward for each processed request, then the activity indicator would be 75. However in order to dampen any sudden changes in behaviour due to a highly dynamic environment it is preferred to combine the activity indicator at the previous epoch with the activity indicator for the current epoch. It has been found for the simulated network that a suitable ratio for the previous indicator to the current indicator is 0.8:0.2. For example, if in this epoch the node has processed three requests with each generating 25 points, and the node had an activity indicator of 65 for the previous epoch then the activity indicator for the present epoch will be 67. It will be seen that the ratio between the two indicators will vary with each system and depend upon how dynamic the system is. It should be also noted that the selection of four processing steps per epoch is an arbitrary choice and that other values may be adopted for this parameter. Plasmid interchange, as described above, was modelled in the simulation and if, through the interchange of policies, a node has more than four enabled policies then the newest policy to be acquired is repressed (i.e. registered as now being dormant) so that no more than four policies are enabled at any time in a node (although this limit of four enabled policies is an arbitrary one and may be varied). If a node has 4 enabled polices and acquires one from the policy pool then the policy acquired from the pool will not be repressed, but one of the policies previously present will be repressed. Other selection criteria may be applied when repressing policies, e.g. repressing the least successful policy or the policy which has been enabled for longest, etc.
Currently, values for queue length and the time-averaged activity indicator are used as the basis for interchange actions, and evaluation is performed every five epochs. If the queue length or activity indicator is above a threshold then one of the node's policies is copied into a 'policy pool' accessible to all nodes. Both of the threshold values were 50 in this example and it is clear that this value is only an example, other threshold values may be selected and there is no need to have the threshold value for the queue length to be equal to that of the activity indicator. The threshold values will determine the number of nodes which can reproduce to occupy the system and should be chosen suitably to match the performance requirements of the system. If the node continues to exceed the threshold for four evaluation periods (i.e. 20 epochs), it replicates its entire genome into an adjacent vertex where a node is not present, simulating reproduction by binary fission which is performed by healthy bacteria with a plentiful food supply. Offspring produced in this way are exact clones of their parent.
If the activity indicator is below a different threshold, for example 10, then the node is classified as idle and a policy is randomly selected from the policy pool and inserted into the node. If a node is 'idle' for three evaluation periods (i.e. 15 epochs), its enabled policies are deleted. If any dormant policies exist these are enabled, but if there are no dormant policies then the node is switched off. This is analogous to bacterial death by nutrient deprivation. For example, if a node having the policy {a,40,50:c,10,5} has an activity indicator of greater than 50 when it is evaluated, it will put a random policy (e.g. {c,10,5}) into the policy pool. If a node with the genome {b2,30:d,30,25} is later deemed to be idle it may import that policy and become {b,2,30:d,30,25:c,10,5}. If the imported policy does not increase the activity indicator of the node such that the node is no longer idle then a further policy may be imported; if there is no further policy to be imported then the node may be deleted.
A visualisation environment was created for this implemented simulation. The visualisation environment provides an interface where network load and other parameters can be varied in many ways, thereby allowing stresses to be introduced into the system in a flexible manner. For instance, the ratio of requests for the four services can be made to vary over time, as can the overall number of requests per unit time. A 'petri dish' that can accommodate up to 400 nodes was used to display the system state. Rules governing reproduction and evolution, including plasmid migration (as described above), were introduced into the simulation, in an attempt to force the nodes to model the behaviour of bacterium in a changing environment.
It will be immediately obvious that the control parameters given above are merely exemplary and are provided to illustrate the present invention. The optimal values of the different parameters will vary from system to system depending upon their size, dynamic constants, growth rates, etc.
It will be understood that the orientation of the rectangular array and the arrival of the requests at the uppermost layer of the array are arbitrary. The service requests could arrive at the lowest layer of the array and travel upwards through the array, or the array could be rotated through 90� with the requests arriving at either of the longer edges. Equally, the requests could arrive at one the shorter edges of the array. The size and proportion of the array are merely exemplary and are not critical to the working of this embodiment of the invention.
Additionally, the network is no longer fully connected such that when a node needs to forward a service request to another node it only has a subset of local nodes to forward the request to. For the uppermost 9 layers of the array this subset consists of the nodes directly left, right and below the forwarding node and the two nodes that are directly diagonally below the forwarding node (see
This second network simulation was executed in a similar manner to the first simulation described above. Where the difference in network connectivity caused a different approach to be taken, this will be described below. As the various service requests arrive at the uppermost layer of the array, if they arrive at a node which possesses a suitable policy for processing the request then the request is processed and the activity indicator of the node benefits accordingly. If the service request can not be processed by the node then the service request will be forwarded, either along the top row of the array or down to the second layer of the array. As there is a greater possibility of being forwarded down to the next row than along the present row, it will be seen that the general tendency of service requests will be to migrate down through the array before they arrive at a node that is capable of processing the service request. The two main implications of this process are that
Occupying a position in the uppermost layers of the array will provide an advantage to all nodes, but some nodes will be more advantaged than others by this. It is obvious that nodes that process predominantly short TTL requests will be better positioned at or near to the supply of service requests to the network, but nodes processing predominantly long TTL requests may also benefit by being near the point of request origin. A request having a long TTL may be processed equally well after passing through several layers of the network as if it had been processed at the edge of the network, but although a node may be thriving on the ninth layer of the array if it produces clones that populate the eight layer of the array then the clones will start taking some of the parent's potential requests, thereby decreasing the viability of the parent node. To try and encourage discerning use of all areas of the network, several penalties were introduced for nodes that effected their performance depending on their position.
In much the same way as different shop locations command different rentals based on proximity to customers, different nodes can be 'charged' more for occupying vertices that are nearer to the source of requests. In the 10 layer network described above each node in the first layer was penalised 9 fitness points per epoch, each node in the second layer 8 fitness points per epoch and so on, with no penalty being levied on those nodes which populate the lowest layer of the array.
One of the nodal characteristics that is used to determine the preferential survival and reproduction of a node is the maximum length of its queue. Due to the essentially selfish nature of the nodes there is selective pressure to evolve as big a 'maximum queue size' as possible, thereby keeping a large reservoir of requests for periods of low request rate. To counteract this obvious benefit of long maximum queue lengths a penalty was introduced to a node for allowing a request to 'die' in its queue. If a node accepts a request onto its queue that has exceeded its TTL by the time the node attempts to process it, the node receives a penalty, for example a reduction of the activity indicator by 4 points.
A more indirect penalty was created by penalising nodes that passed on requests with short times to live after realising they do not contain a policy to process the request. It is very anti-social to forward a near 'dead' request to the bottom of a neighbouring node's pile of requests (given the aforementioned timeout penalty) so nodes are penalised for forwarding a request based on the remaining TTL of that request. This should put evolutionary pressure on nodes to restrict the maximum length of their queues, as there is no penalty for not accepting a request. This penalty function has an effect on the optimal position of a node. If a node processes predominantly requests having a long TTL, occupying a prominent position in the network would mean it would have to forward all requests having a short TTL and incurring penalties for this. It is advantageous for these nodes to reside where the short TTL requests have already been processed, i.e. in the lower layers of the array. Although these penalties have been implemented by directly reducing the activity indictor of the node, it is also possible to penalise nodes by reducing the time window that they have to process requests
The simulation of a partially connected network includes an additional mechanism that is an analogy of tropism, which is the response of plants and lower order animal forms to a stimulus that has a greater intensity from one direction than another. For example, most plant seeds exhibit phototropism (a response to light) by sending shoots to maximise the effects of photosynthesis and hydrotropism (a response to water) by sending root systems to maximise water uptake from their environment. Each node has a tropism value encoded within its genome, which can be within the range 0 to 1, and which can effect the manner in which the node reproduces by binary fission (note that the tropism value is not transferred during plasmid migration). The tropism value of a node may be altered by a random mutation. If a node has a tropism value of greater than 0.5, its offspring will spawn directly to the left (at a 25% probability), directly to the right (at a 25% probability) or directly above the parent node (at a 50% probability). Alternatively, if the node's tropism value is 0.5 or less then its offspring will spawn directly to the left (at a 25% probability), directly to the right (at a 25% probability) or directly below the parent node (at a 50% probability). This allows some strains of nodes to evolve a preference for living in the upper levels of the array and other strains to prefer a life in the lower levels of the array. Those nodes that have a low tropism value are likely to process predominantly long TTL service requests due to their preference for the lower levels of the array, whilst those nodes having a high tropism value are likely to possess policies enabling them to process predominantly short TTL service requests due to their preference for the upper levels of the array.
As described above for the simulation of the fully connected network, nodes which have persistently low activity indicators first of all have one or more nodal policies repressed, until eventually the node 'dies', i.e. all of its policies have been repressed. For the simulation of the partially connected network an exception to this process was provided, wherein a node that is about to 'die' may sometimes change position with the node directly above or directly below them, allowing a node to move in a preferred direction where it may find more suitable conditions even if it's path is blocked by another node. The direction of the move is dependent upon the tropism value of the under-performing node with low tropism value nodes moving down the array whilst high tropism value nodes will move up the array. Simulation has shown that a suitable probability for allowing such a positional switch to occur is 10%.
The partially connected network, in which service requests arrive at random along the edge of the network is more representative of a real life network than the fully-connected network in which service requests are inserted randomly within the network. However, for real network users are not all situated along a single edge of the network but are distributed across a large area, so that they in effect send service requests to a number of network edges. It will be understood that the concepts described above for the partially-connected network could be adapted in a number of ways to provide an 'entire' network rather than just the edge to a network.
The topology of the network is described as being "substantially polygonal". Whilst previous discussions have focussed on square and rectangular networks, it will be readily understood that the concept can be extended to cover other regular polygons (e.g. pentagons, hexagons, octagons, etc.) and irregular polygons. It is also possible that service requests could be introduced along more than one network edge. In these cases, a more sophisticated approach may need to be adopted to describe the distance of the nodal location from the network edge from which the requests are inserted. Additionally, although previous discussions have focussed on networks having straight edges, the edges of the network may have concave, convex or complex geometries.
An example of such a multi-service network is as described by M Fry & A Ghosh, "Application Level Active Networking", available from http://dmir.socs.uts.edu.au/projects/alan/papers/cnis.ps. The network would contain a number of large scale active network nodes (ANNs), with each ANN comprising a large processor cluster, for example up to 200 processors, with each processor running a dynamic proxylet server (DPS) and around 10 Java virtual machines (JVMs), each of which contain one or more proxylets (a proxylet is a small program that implements an active network service, such as transcoding a data resource from one format to another e.g. from a QuickTime video stream to a RealPlayer video stream, or from CD format audio to MP3 format audio).
Each DPS controls and implements the algorithmic rules discussed above that determine the activity indicator levels at which nodes may reproduce, export nodal policies, import nodal policies, etc. The JVMs are the nodes (i.e. analogous to bacterium) with the proxylets (or policies pointing to the proxylets and authorising execution) providing the nodal policies (i.e. the genes of the bacteria).
In use, the proxylets are mostly multi-user devices, but they may be installed and used by a single user. A proxylet may be installed by a user who then proceeds to load the proxylet by making suitable service demands (this is analogous to placing a nodal policy into a node and then injecting some requests for the service it represents). Only at very low traffic loads will a given proxylet not be present at all the ANNs, but this gives rise to efficient network resource utilisation as proxylets are run only in response to user demand and are run at a convenient network location.
The nodes of the simulated network do not have any awareness of the concept of an ANN or the boundaries between the different ANNs that comprise a network. The main reasons for this is to minimise the complexity of the nodal operations and because of the fuzzy nature of the boundaries in a cluster model.
The simulation indicates that such an active network should be capable of implementation and that reasonable levels of performance achieved. The ability to manage the deployment of new services over such networks has also been successfully simulated.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
Ticket Package to Clubesque Cabaret Show
Center Stage Theater • Atlanta, GA
Use between Tuesday, June 17 – Thursday, September 04
What you get
- $29 ($48 Value) for One GA Ticket, Wine Tasting, Gift Bag & Meet-and-Greet with Show Performers
- Immersive Cabaret Show
- Choice of Six Performances
Atlanta welcomes the hit cabaret Clubesque, a Vegas style music revue at a premiere destination spot: Center Stage Theater. This modern pop cabaret show is a sexy, glamour-filled thrill ride co-starring international dance artist Sunni Stephens; one of the world's top burlesque performers, Perle Noire; renowned drag performer Gia Sunflowers, known for her extravagant costumes; and Atlanta's own trend-tracking journalist and style arbiter Kyle Collins.
Lush costumes, infectious music, dazzling choreography and a gorgeous cast will tantalize your senses and leave you wanting more. It all adds up to a spectacle -- in the best kind of way.
Clubesque Cabaret Show's Website
Fine printREFUND POLICY: This event is nonrefundable. No full or partial refunds are given to customers who miss an event. In the event of a cancellation, your voucher will be fully refunded • Limit 4 vouchers per purchaser • Must be 21+ with valid ID • The deal is valid only for tickets on the date[s] of the event as listed and may not be exchanged or redeemed for any other dates • Purchaser may change the name of the individual retrieving tickets up to 24 hours in advance of event via the LivingSocial website event details section; no name-changes or alternate pick-ups permitted without notice at venue • Entire value must be used in a single visit
Ticket Package to Clubesque Cabaret Show
times for
More upcoming events
use by Nov 30
Atlanta, GA
Admission to a Murder Mystery Dinner Show
Marriott Suites Midtown
use by Jul 26
Atlanta, GA
Three Autocross Laps in a Ferrari or Lamborghini
Turner Field
use by Aug 17
1-Week Admission to ROBOTS-4-U Summer Camp
Sunday Aug 9
Ticket Package to a Bridal Show
Doubletree by Hilton Buckhead | The Fox Theatre | Wyndham Galleria
Wednesday Aug 19
Atlanta, GA
Ticket to The Big Fake Wedding
Atlanta History Center
use by Aug 8
Atlanta, GA
Ticket Package to a Comedy Show at the Improv
Stillhouse and Cellar 56
Saturday Sep 19
Atlanta, GA
2 Tickets to Women's Health & Fitness Expo
Georgia World Congress Center
Sunday Jul 26
Atlanta, GA
Ticket to the Ultimate Same Sex Wedding Experience Expo
Magnolia Hall at Piedmont Park
Nearby deals
Couture Geek Boutique
Spa Party Package or Ceramic Painting
Organic Wax and Skin Care
Target Trouble Spots with a Cupping Treatment
Soteria Hair Express
Relaxer, Keratin Treatment, or Shampoo and Style
Grass Roots Carpets
Steam Carpet Cleaning Packages
All Pro Carpet
Carpet Cleaning; or Tile and Grout Cleaning
Krish Salon & Spa
Brazilian Waxes with Eyebrow Shaping and More
Laser Logic
Unlimited Laser Hair Removal for Two Years
The Fountain Laser Hair Removal
Six Laser Hair-Removal Treatments

subset: commoncrawl


text:
Thank you. If a matching email exists we will send you an email in a few minutes with instructions on how to reset your password.
Don't forget to check your spam folder if you cannot find the email. For further assistance please contact us at firstname.lastname@example.com .Okay
Crafted from recycled plastic, this planter offers a creative solution to indoor gardening. Each planter arrives with a hanging system for easy installation.


text:
Waffle Bathrobe
A spa classic, reinvented.
The classic spa robe, reinvented as only Coyuchi can.
Made from organic cotton in an airy, drapey waffle weave, it's prewashed to be soft from day one and get more so with every wash. Styled for men or women with a streamlined fit that keeps it comfortable and flattering with double belt-loops.
Materials: 100% Organic Cotton.
Dimensions: 37"L x 31"W x 0.5"H; Weight: 5 lbs.
Waffle Bathrobe
Reviewed by 1 customer
- Absorbent Organic Cotton
- Light-weight
- Light-weight Feel Cozy
- Looks great
- Order one size up
- Shrinks a lot
- Wish I Had Known
Best Uses
- After shower
- Morning And Evening Robe
- Summer robe
I wish I had known that this robe will shrink at least one full size when placed in the dryer (on low!). Now mine is too short in both sleeve length and overall length. Great fabric; featherweight and absorbent.
- Was this a gift?:
- No
Shopping Cart


text:
An illustrated guide to improving the composition of your photos and making them more powerful.
Explore the world of the small with this guide to macro and close-up photography gear, lighting, and technique.
From ultra-wide angle to ultra-telephoto to macro, tilt-shift and more, discover the creative options that specialized lenses and attachments provide.
Describes the tools, creative options, and special considerations involved in shooting with a DSLR camera at night or in low-light conditions, such as sunset or candlelight.
Ben Long shares strategies for capturing the best black and white images and techniques for converting to black and white in Photoshop.
"Keep up the good work—it's helping so many of us stay up to speed on all the many topics involved in building creative websites." —Sandra M.
more from our members »


text:
Venue has no reviews yet
Hair Salon
|Mon - Tue
|11:00 am
|7:00 pm
|- Closed -
|Thur - Sun
|11:00 am
|7:00 pm
Online bookings let you pick date/time for your visit.
If you purchase an eVoucher you will need to book with the venue directly.
Our old Wahanda Gift Vouchers can still be redeemed at over 3,000 locations. Use them to pay as you would with cash. Please note, the Wahanda Gift Voucher's successor – the Wahanda Gift Card – can only be used for online purchases.
Hoshi Coupe is a Hair Salon which offers a complete hair and beauty services.


text:
Is Your Computer Ready for Windows 10?
Have you heard that Windows 10 is going to be released in less than a month? Do you know if …
What's New At Schrock
June 28, 2015 KFAB Compute This Audio
June 27, 2015 KFOR Compute This Audio
Is Your Computer Safe from Viruses?
June 14, 2015 KFAB Compute This Audio
Let Schrock Install Windows 8.1 on your Computer and Save Yourself a Headache!
Windows 8.1 was released on October 18th and it is an update that all Windows 8 users should install. The update is free, but like any service pack or operating system upgrade, sometimes things don't go as smoothly as we all would like it to.
Schrock is offering a $40 flat rate service to install Windows 8.1 on your computer, and deal with any problems or issues that may pop up as a result. This service can be delivered through our online support service – the Schrock Desk – in many cases.
Contact the Service Center closest to you to schedule an online appointment or just bring your Windows 8 computer into our Service Center to have us install the upgrade for you.
In the past Microsoft has released Service Packs that add functionality to an existing operating system, reduce bugs and glitches, and improve user experiences. Typically Service Packs are downloaded automatically through Microsoft Update, but Windows 8.1 is a different breed that requires a few extra steps to install on your Windows 8 PC.
To get Windows 8.1, you have to download the 3.4GB update (that's huge folks!) through the Windows store. Simply press the start button on …


text:
- Annual Events
- Things to Do
- About Issaquah
- Services
- About Us
- News
2015 Downtown Issaquah Association Board of Directors and staff:
The Mission of the Downtown Issaquah Association is to promote and enhance the economic vitality of Historic Downtown Issaquah and support our membership through programs and events that celebrate our unique culture. The DIA board is comprised of Issaquah small business owners and individuals who are committed to accomplishing this mission.
Executive Board:
President – Steve Ahlbom (Artitudes)
Vice President – Lynn Rehn (Evergreen Ford/My Chef Lynn)
Treasurer – Keith Watts (Watts Properties)
Secretary – Reisha Holton (Essay Mentors)
Board Members:
Robyn Barfoot (Zoo ad Wildlife Consultant)
Brenda DeVore (Cleanscapes)
Cynthia Freese (artist)
Jamie Lilly (Village Theatre)
Rueben Nieto (Issaquah Food Bank)
Barak Rosenbloom (Essay Mentors)
Craig Walker (Coho Computers)
Lenoard Whitfield (ArtByFire)
Executive Director – Karen Donovan
Events Coordinator – Gaila Guiterrez
Website Coordinator – Alison Freese


text:
Louise Zass-Bangham
My name is Louise Zass-Bangham. I love to design things that are fun to knit and look great. I originally did a degree in textile design where I developed a passion for colour and specialised in knit. Later I went to Central St. Martins College of Art and Design as a postgraduate in pattern cutting (pattern making for US readers). The tutors dropped me straight in at the deep end with some of London's top catwalk designers, leading fashion brands and stylists. Having kids gave me the time to get back to hand knitting and I am thrilled to be designing my own pieces again.
Do join us in the group for people knitting my patterns - Inspiration Knits.
You can follow me on:
My BLOG Twitter @inspirationknit pinterest @inspirationknit
Inspiration Knits on Facebook.
Join my mailing list to stay up to date with new patterns, competitions & discounts - one lucky list member wins a free pattern every month!
IMPORTANT - If you are in the EU pattern sales have now reverted to being entirely on Ravelry. Yay! Ebooks and single patterns will be available on Ravelry. Promotions will work. Phew. Very, very pleased.


text:
Give Now
Indiana leads the nation in the number of meth lab seizures, causing hundreds of homes to be contaminated with dangerous chemicals each year.
The bill calls for the state's courts and police to update the database pharmacies use to track sales of over-the-counter of cold and allergy medication.
Mayor Duke Bennett wants to lobby for prescription-only Sudafed.
The new initiative is a public-private partnership to inform consumers that smurfing, or purchasing medicines for meth makers, is a criminal offense.
Laws the General Assembly passed this year include a biennial budget, school safety measures and initiatives aimed at boosting career education.
All four people found dead in a Waynesville home this weekend were shot in the head, an autopsy report shows.
1,437 meth labs were uncovered by law enforcement in 2011, an increase from the 1,395 labs found in 2010.
The bill, which would tighten the amount of ephedrine and pseudoephedrine Hoosiers could buy annually, is headed to the state Senate.
Rep. Ron Bacon (R-Chandler) says the bill could reduce meth production, but other legislators say similar proposals in other states have not worked.
The electronic database was implemented to help Indiana police and pharmacists track the sale of cold medicines that can be used to produce methamphetamine.


text:
Follow us on Twitter:
The next meeting will be held Tuesday, July 7th at 6pm at the Cefalo Center. Packets for Media Day as well as information for the Program Book will be handed out. We will also be verifying our contact information for players and parents as well as clothing sizes for the players. We would greatly appreciate if all parents/guardians can attend this meeting.
Media Day will be held Saturday, August 8th at 9am.
If you haven't already, be sure to Like our new Facebook page to stay up to date on all events!
We are now on Twitter. Follow us at @PABoosterClub
Summer practice schedules now posted under Schedules.
Click here for the 2015-16 Program Book Ad form
Game Schedule:


text:
Find out more about 1x-com.
About StumbleDNA StumbleDNA
Miguel's Interests
Advertising is everywhere. Learn the tricks of the marketing trade, from billboards to commercials.
Who spiked the punch? Vodka or rum, mixed drinks or shots, get recipe ideas for your next party.
Obsessed with Radiohead? Play Nirvana on repeat? Alternative rock music is awesome. Check out more.
Last Tuesday might feel like ancient history, but the Greeks and Romans knew better. Check it out.
From baby animals to wild creatures to exotic pets, discover cute pictures and more about animals.
From Disney to Flash, the art of animation has brought our favorite cartoons to the screen.
From Osamu Tezuka to Pokemon, explore the world of anime (minus the expensive flight to Japan).
From ancient Greek to modern designs, explore the architecture that has defined countless landscapes.
Flex your creativity by exploring performing arts, literature, music, visual arts and more.
Is Oktoberfest your dream vacation? Learn about breweries, craft beers, kegs, beer gardens and more.
Quench your thirst by Stumbling through the best recipes for refreshing drinks and beverages.
Sometimes the best stories come from real life. Explore top biographies of famous people throughout history.
Think ordinary is boring? Explore the weird, the strange, the obscure, and the downright freaky.
Do you love the 12-bar blues? Explore the best blues festivals, songs and more, from Chicago to Memphis.
Are you a card shark? Explore the best card games, whether you're playing online or in a casino.
Miss Saturday morning cartoons? Get your dose of cartoons - funny, political and more - here.
Discover funny pictures and more about cats, from cute kittens to fat cats. We promise you'll smile.
Fascinated by the lives of the rich and famous? Don't miss the latest celebrity news and gossip.
With order comes disorder. Learn about chaos theory, controlled chaos and the butterfly effect.


text:
Would like to find a lady who like riding a motorcycle but if she would not it would not be a deal breaker.
Join OkCupid
Find better matches with our advanced
Find better matches with our advanced
matching system
—% Match
—% Enemy
66 • Eastlake, OH • Man
I'm looking for
- Women
- Ages 48–71
- Near me
- Who are single
- For new friends, long-term dating
My details
- Last online
- Online now!
- Orientation
- Straight
- Ethnicity
- White
- Height
- 5′ 7″ (1.70m)
- Body Type
- A little extra
- Diet
- Mostly anything
- Smokes
- No
- Drinks
- Socially
- Drugs
- Never
- Religion
- Christianity, and somewhat serious about it
- Sign
- Taurus, and it's fun to think about
- Education
- Graduated from high school
- Job
- Sales / Marketing
- Income
- $30,000–$40,000
- Status
- Single
- Offspring
- Has kids, but doesn't want more
- Pets
- Has dogs
- Speaks
- English (Fluently)
My self-summary
Write a little about yourself. Just a paragraph will do.
Just a middle aged guy that hasen't grow up and loves thing and doing all life has to offer .Looking for my last love and best friend.
Would like to find a lady who like riding a motorcycle but if she would not it would not be a deal breaker.
Would like to find a lady who like riding a motorcycle but if she would not it would not be a deal breaker.
What I'm doing with my life
Don't overthink this one; tell us what you're doing day-to-day.
I am semi retired and looking for warm beachs and more time to spend with my loved one's.
I'm really good at
Go on, brag a little (or a lot). We won't judge.
solving problems and having a shoulder to cry on.
The first things people usually notice about me
I'm an empty essay… fill me out!
My smile and positive attitude.
Favorite books, movies, shows, music, and food
Help your potential matches find common interests.
Really haven't had a chance to read much lately. But I like Steven King's work's.
The six things I could never do without
Think outside the box. Sometimes the little things can say a lot.
My family
my religion
my dog:)
a kiss and smile from the woman I love.
A good bottle of wine
A good rib steak.
my religion
my dog:)
a kiss and smile from the woman I love.
A good bottle of wine
A good rib steak.
I spend a lot of time thinking about
Global warming, lunch, or your next vacation… it's all fair game.
Falling in love again and looking foward to enjoying my remaining year's with someone I can relate to and who loves me.
On a typical Friday night I am
Netflix and takeout, or getting your party on — how do you let loose?
Home with my dog watching Tv eating some pizza,just chilling.
The most private thing I'm willing to admit
I'm an empty essay… fill me out!
If I told you it wouldn't be private then would it!
You should message me if
Offer a few tips to help matches win you over.
Looking for friend's and if more is there that would be great.
Report this photo
How does this violate our Photo Rules?
You must be in the photo! Full nudity, extreme close ups, pets, cars, baby photos, artwork, images you've added yourself to, etc. are not allowed.
Photos in albums are meant to showcase other aspects of your life, and may include pets, cars, baby photos, artwork, etc. Full nudity and offensive content are not allowed.
Thanks! We'll look into the issue soon.
Flagging inappropriate content keeps OkCupid awesome. You're now eligible to be a flag moderator!
Connect your existing OkCupid account
Sign in
Welcome Back!
Restore your account to continue
meeting new people.
Reset your password
We'll email you a link to reset it.
Email sent!
An email is on its way to .
If you don't see it, try checking
your Spam folder.


text:
Jeff Erdmann was pumped when Merrill Lynch sent him to Hawaii in 1990 as a reward for pulling in dozens of new clients. When he returned, he recalls, he bragged to a prospective client about the trip and his big roster of 550 customers. But as the words came out, he suddenly realized they were all wrong. "She didn't want to hear how many other clients I had," he says.
Then and there, Erdmann resolved not only to change his pitch but to scale back the number of investors he served. "I ultimately decided I needed to shrink to grow," he says. "I had too many clients, and I couldn't impact all of their lives." As the years went by, he took on fewer but wealthier clients, and brought in talented partners to help. Today, the Greenwich, Conn.-based advisor and his 19-member team handle some $4.5 billion in assets for 140 families; the median account is $31 million.
The approach has worked well for both Erdmann and his clients. The team's assets under management have climbed nearly 30% during the past three years, the result of both strong performance and additional investments by new and existing clients. That has helped make Erdmann a fixture onBarron's annual listing of America's Top 100 Financial Advisors. Currently ranked No. 13, he is one of the few advisors to land on the list every year since we launched it in 2005.
The mission: "We're trying to help families make rational decisions in irrational times." Matthew Furman
At Merrill Lynch, which he joined 28 years ago as a college senior, Erdmann is now much in demand as a coach for other advisors. A recent morning in Greenwich found him meeting with 14 advisors who had flown in from Florida and Georgia.
He addressed the group in clear terms: "We're trying to help families make rational decisions in irrational times." That means advisors have to roll up their shirt sleeves and help on everything from asset allocation to setting up trusts to refinancing mortgages. No task should be considered too small. Erdmann has won wealthy clients by taking on just their checking accounts. The more significant assets usually followed.
ERDMANN, WHO TURNS 50 next month, believes that financial advice has never been more important: "All of us baby boomers are yearning for investment income. And we need it for retirement."
Bonds are no longer the easy solution for that, given an inevitable spike in interest rates from today's record lows. "We were all told by our parents to sell stocks and buy bonds as you got older," says Erdmann. "It was a great idea for 40 years. It's a terrible idea for the next 40 years."
"When you think about where you get your performance in the next three to five years, we think equities win by default," he says. Stocks make up 55% of the team's asset allocation.
To show the power of dividends, he points to a group of five blue chips: PepsiCo pep -0.2746672300866258% PepsiCo Inc. U.S.: NYSE USD94.4 -0.26 -0.2746672300866258% /Date(1436216469593-0500)/ Volume (Delayed 15m) : 4932123 AFTER HOURS USD94.4 % Volume (Delayed 15m) : 20300 P/E Ratio 22.004662004662006 Market Cap 139722995468.937 Dividend Yield 2.9766949152542375% Rev. per Employee 244565 More quote details and news » (ticker: PEP), Intel INTC -1.6854851906398298% Intel Corp. U.S.: Nasdaq USD30.04 -0.515 -1.6854851906398298% /Date(1436216400539-0500)/ Volume (Delayed 15m) : 30794907 AFTER HOURS USD29.97 -0.0700000000000003 -0.23302263648468707% Volume (Delayed 15m) : 1673158 P/E Ratio 12.728813559322035 Market Cap 144952921447.754 Dividend Yield 3.195739014647137% Rev. per Employee 523777 More quote details and news » (INTC), Johnson & Johnson JNJ -0.24380333197887039% Johnson & Johnson U.S.: NYSE USD98.2 -0.24 -0.24380333197887039% /Date(1436216534029-0500)/ Volume (Delayed 15m) : 6721532 AFTER HOURS USD98.31 0.109999999999999 0.1120162932790224% Volume (Delayed 15m) : 96264 P/E Ratio 17.567084078711986 Market Cap 290435670725.638 Dividend Yield 3.054989816700611% Rev. per Employee 580258 More quote details and news » (JNJ), Procter & Gamble PG 0.15013136494432627% Procter & Gamble Co. U.S.: NYSE USD80.05 0.12 0.15013136494432627% /Date(1436216505324-0500)/ Volume (Delayed 15m) : 6480702 AFTER HOURS USD80.05 % Volume (Delayed 15m) : 120516 P/E Ratio 25.634046368643524 Market Cap 216849778601.378 Dividend Yield 3.312429731417864% Rev. per Employee 671627 More quote details and news » (PG) and McDonald's mcd -0.5407091608609753% McDonald's Corp. U.S.: NYSE USD95.65 -0.52 -0.5407091608609753% /Date(1436216418900-0500)/ Volume (Delayed 15m) : 3817832 AFTER HOURS USD95.9 0.25 0.26136957658128596% Volume (Delayed 15m) : 34634 P/E Ratio 21.446188340807176 Market Cap 92180387203.6468 Dividend Yield 3.554626241505489% Rev. per Employee 63571.2 More quote details and news » (MCD). Together, those stocks yield an average of 3.29%, versus 2.09% for the same companies' 10-year bonds. The favorable tax treatment for dividends makes the disparity even greater. After tax, the stocks have a net yield of 2.79%, versus 1.36% for the bonds, which are taxed as ordinary income.
"Companies are trading at almost half the valuations they were at the beginning of 2000," Erdmann says in another argument for stocks. "They have more cash on their books than they've ever had. And all that we've been promised with new technology has made these companies much more efficient and productive."
One of Erdmann's core equity holdings is the PowerShares S&P 500 Low-Volatility Portfolio splv -0.13466199838405601% PowerShares S&P 500 Low Volatility Portfolio U.S.: NYSE Arca 37.08 -0.05 -0.13466199838405601% /Date(1436216400123-0500)/ Volume (Delayed 15m) : 1300620 AFTER HOURS 37.036 -0.0439999999999969 -0.1186623516720604% Volume (Delayed 15m) : 5389 P/E Ratio N/A Market Cap N/A Dividend Yield 2.285113268608414% Rev. per Employee N/A More quote details and news » (SPLV). The ETF tracks the 100 lowest-volatility stocks in the Standard & Poor's 500. It has a current yield of 2.9%.
For bonds, now 25% of the team's holdings, Erdmann over the past two years has been shifting some money from top-quality munis to ones with somewhat higher yields. He has also been picking up corporate and overseas bonds. He has put about 10% of the typical portfolio into alternative assets like hedge funds.
In the old days, Erdmann told the visiting advisors, it was enough to put your nose to the grindstone. "Today you can't just work hard; you have to work a lot smarter because of the complexity of the global markets."
Judging by the 35 thank-you notes adorning the walls of his team's kitchen, Erdmann is meeting the demands with room to spare.
E-mail: firstname.lastname@example.com


text:
You are using an outdated browser. Please upgrade your browser to improve your ReverbNation experience.
Laura McGhee
Nashville, TN
Wednesday, September 4th, 2013 at 7:00pm
All Ages
Come and see my 40 min solo set with back up by the talented Jack Boucher and Richard Trest!
© 2015 eMinor Incorporated
All trademarks are the property of the respective owners. ReverbNation is not affiliated with the trademark owners.
Not listening to anything?
Try one of the ReverbNation Channels


text:
Le Café Central de Deva
..... Deva blogs!!
When we talk to customers they want to know what is the difference between Recommended, Supported, Deprecated and deemphasized means. This is already well explained in Patrick's what unsupported mean article.
In simple terms, "Recommended vs. Supported" means,
In simple terms, "Deprecated vs. Deemphasized" means,
Hope this helps.


text:
East Lynne Theater Company and Cape May Film Society Present the Original 'Dracula', 10/14
On Sunday, October 14 at 8:00p.m., East Lynne Theater Company and The Cape May Film Society are proud to present the 1922 silent film cult classic, "Nosferatu," at The First Presbyterian Church, 500 Hughes St., Cape May, where ELTC is in residence.
Hutter, a real estate agent from Bremen, Germany visits Count Orlok at his remote castle in the Carphathian Mountains because the count wishes to buy a house in town - "a deserted one." On his way to the castle, Hutter visits an inn, where all of the customers fall silent when he mentions Orlok's name. Outside, horses bolt and run, and a hyena snarls before slinking away. He laughs off all the signs of gloom and doom, until, while dining with the count, he cuts himself with a bread knife and the count comments, "Blood - your beautiful blood!'
The full title of the film, "Nosferatu: A Symphony of Horror," lives up to its name. Max Schreck, who portrays the count, behaves more like an animal than a human being, with ears like bats, claw-like nails, and fangs that are in the middle of his mouth like a rodent's. Special effects add to the uneasy atmosphere: the disappearance of a coach, the count materializing out of thin air, and photographic negatives used to give the appearance of white trees against a black sky.
In spite of the film's director, F. W. Murnau, changing the characters' names, it is obvious that he's telling the tale of "Dracula" created by Bram Stoker. Stoker's widow went to court, demanding in vain, that the film be destroyed. Ironically, Murnau might have been the making of Stoker because "Nosferatu' inspired dozens of other "Dracula" films, none of them, according to many critics, quite as artistic or unforgettable, with the possible exception of Werner Herzog's 1979 version with Klaus Kinski.
Wayne Zimmerman, who played the organ accompaniment for ELTC and the Society's 2011 Halloween offering, "Phantom of the Opera," was so well received, that these two Cape May not-for-profit organizations started a Silent Film Festival. "Nosferatu" is the third and final film for this year's offerings, and Wayne is once more providing the music. He plays concerts and for silent films throughout the country, creating his own scores for every feature. Never taking a break during the film, he plays his scores from memory. It is rare nowadays that film lovers have the opportunity to see silent films as they were meant to be shown, with live music.
Tickets for "Nosferatu" are $15 and reservations may be made by calling ELTC at 609-884-5898 or by visiting their website, www.eastlynnetheater.org.
About Author
- Casting Roundup: Sarah Chalke, Kim Raver Headline New Pilots
- ADVENTURE TIME Headed to the Big Screen?
- Pilot Season Roundup: Colm Feore, Daniel Stern, Dave Annable to Star in New Shows
- James Franco to Star in New Fox Comedy, WHY HIM?
- Christopher Meloni to Star in WGN America's Slave Drama UNDERGROUND
- Check Out Alex Dunphy's Full College Essay from Latest MODERN FAMILY Episode
- Photo Flash: HBO Reveals Key Art for GAME OF THRONES Season 5
- Syfy to Honor Leonard Nimoy with Special Programming This Sunday
- Grammy Winner Kelly Clarkson Exclusively Premieres New Music from New Album on MTV, VH1 & CMT First
- CONSTELLATIONS' Jake Gyllenhaal and Ruth Wilson Set for THEATER TALK This Weekend


text:
|Amount Per Serving
|% Daily Value
|Fenugreek Seed 100% Organic
Added to My List as a guest*.
*Your guest list will be temporarily saved until you end this browser session.
Celebration Herbals Organic Fenugreek Seed Tea Caffeine Free -- 24 Herbal Tea Bags
Oops! Something went wrong and we were unable to process your request. Please try again.
|Amount Per Serving
|% Daily Value
|Fenugreek Seed 100% Organic
Fenugreek is one of the oldest cultivated crops. The Ancient Egyptians used it as food and incense. Benedictine monks introduced the plant to Central Europe where it was widely established by the 16th century. Chlorine free bags, no strings, tags, or staples, 100% recycle board. Cultivated by commercial growers with proper soil management that identify with our high standards of quality.
Suggested Usage: Good water is an essential part of brewing a great cup of tea. We recommend usuing spring or filtered water. Some of the most enjoyable aspects of tea are the calmness and ritual that surround it.
So that your tea has its maximum medicinal properties and flavour, be sure that your water is at a rolling boil when you pour it over your teabags.
If you desire a medicinal tea, be sure to use on tea bag per cup of boiling water, cover and steep for 10-20 minutes. This is known as the decoction method.
If you desire a pleasure tea or quick brew, use one teabag per cup of hot water. Pour water over teabags, cover and let steep 3 to 5 minutes to taste. Enjoy!
Vitacost price: $5.29
Vitacost price: $9.99
Vitacost price: $7.99
Vitacost - Earth Blends Matcha Green Tea Powder - Vegan - Gluten Free and Non-GMO -- 5.3 oz (150 oz)
Vitacost price: $10.60


text:
Quick Search
1978 Ford Thunderbird
Good running car in good running condition. New brakes. Clear title. Good 351M. Good value for the price.
... $1,500
1978 Ford Thunderbird
Vehicle always in a heated garage; in storage the last 15 years. No rust. Vinyl top in excellent shape. Engine runs, but fuel cell and carburetor will need additional
... $6,000
1978 Ford Thunderbird
This is one of the cleanest thunderbirds that I have seen without being restored.engine and tranny both run and drive great. nice leather interior and a clean body with nice
... $3,500
1979 Ford Thunderbird
Thunderbird, 9,200 actual miles. Everything original, no restoration done or needed. This car is as show room perfect as possible. Enjoy taking it to the classic shows. (PS)
... $6,500
1979 Ford Thunderbird
79 tbird is in excellent cond in and out,leather int,mostly all power,cold ac automatic,only 65600 miles goes to local car shows.always kept in garage. all original car
... $5,850
1979 Ford Thunderbird
New gas tank, all original not modified,needs headliner,carpet,front seat needs redo,trunk carpet,NEEDS TRANYY WORK,GOES REVERSE NOT FORWARD. $850 LOCAL SHOP CAN REBUILD WITH
... $3,000
1983 Ford Thunderbird
One family owned garage kept 1983 Ford Thunderbird with everything original and in excellent condition with very low mileage runs and drives great.
... $13,000 or best offer
1984 Ford Thunderbird
NEW YEAR'S SPECIAL!! FOR SALE: BACK TO THE 80'S 1984 Ford Thunderbird only 68k milesFantastic Beautiful Original Condition!! This classic car has a 302 5.0 V8! Automatic,
... $
1985 Ford Thunderbird
Its in great shape, brand new motor, and transmission. Also has a brand new water pump. It has been setting for a couple of years. But it's still looks great. And if you put
... $8,0000
1985 Ford Thunderbird
1985 Ford Thunderbird, turbocharged, 2.3L, 4 cylinder Search on Google "10 Most Collectible Fords from the '80s" - - this car is #1 on that list. This car
... $4,000
1986 Ford Thunderbird
Car runs well 2 new tires about 3 months oil lots if new parts in it. Transmission sometimes slips.car needs body paint job and inside car needs a few things.needs tlc.
... $900 obo.
1987 Ford Thunderbird
Must sell due to garage fire. Headlights and rearlights were in garage fire. Motor and suspension are rebuilt. Just getting ready to paint when fire happened. Fast car hate
... $3,000 or b/o
1989 Ford Thunderbird
will start and run. needs minor work on the interior. All original motor and transmission, original paint on the car not faded yet. never been in any accident, no rust, just
... $3,000
1989 Ford Thunderbird
very low miles on this car* interior is in good shape* exterior is in good condition with the exception of clear coat coming off* 5 speed supercharged* engine needs a tune up
... $3,200
1990 Ford Thunderbird
35th Anniversary Super Coupe. Only 3371 ever produced. Original owner, always garaged, bought to preserve. This actual car was photographed for the hard back book
... $19,950
1995 Ford Thunderbird
Stock #358-TPA This vehicle is located in our Tampa Showroom, Ruskin Fl-USA from I-75 you take exit 240B and go West on 674/ College Avenue. Go down .3 miles and turn right
... $9,995
1996 Ford Thunderbird
This was the top of the line T-Bird for 1996. It has the 4.6 litre, 281 cubic inch, fuel injected single overhead cam V8 engine, when most of them had the V6, 4 speed auto.
... $6,500
2002 Ford Thunderbird
After Being On Hiatus For Several Years, Ford Introduced A New Thunderbird For 2002. Returning To The Original Formula For The Thunderbird, The Latest Version Had A Two-Seat
... $21,900
2003 Ford Thunderbird
Stock # 80HOUUp for sale in the Houston showroom is a 2003 Ford Thunderbird. November 2000 saw a new Thunderbird launched, based on the Ford DEW platform. It was a personal
... $19,995
2004 Ford Thunderbird
Stock #81HOUUp for sale in our Houston showroom is a car that has a lot of history in its heritage, the 2004 Ford Thunderbird. In 1955, the Thunderbird was revealed as a
... $20,995


text:
According to a report from the South Whidbey Record, Nichols Brothers Boat Builders is looking at expanding its operations into Oak Harbor, Wash. in order to have a larger role in building ferries for Washington state.
A revolutionary new option to scrapping for younger panamax containerships deemed too small for a tradelane involves widening the vessel rather than adding length.
After signing an order for the construction of five new ships two weeks ago, the Italian shipowner Grimaldi Group has signed another contract for the construction
According to the head of the National Iranian Tanker Company (NITC), Iran has 42 very large crude carriers or VLCCs, each able to carry 2 million barrels of oil, reports Press TV.
Monthly demolition rates in the dry bulk shipping sector averaged 3.3 million DWT for 1H15, according to new figures from BIMCO, compared to 1.3 million DWT last year.
A series of interesting and extreme price spikes is going on in the shipping market today, says Clarksons, provider of global shipping and offshore market intelligence.


text:
SINGAPORE—On June 18 at the CommunicAsia conference in Singapore, European satellite bandwidth technology provider Newtec will join with MEASAT to send 4K Ultra High Definition Television (UHDTV) video via satellite using the new DVB-S2X (or extension to DVB-S2) transmission scheme.
Both companies are calling this test the first ever contribution of 4K UHDTV video distributed using the new DVB-S2X transmission scheme. Boasting improved spectral efficiency the new DVB standard, promises to give the satellite industry more breathing space to increase profitability and allow for business growth throughout all applications, from high speed IP to broadcast to VSAT. That's according to a white paper written by Koen Willems, Market Director for Government and IP Trunking at Newtec.
When it was approved in March Peter Siebert, DVB's Executive Director, said, "The satellite industry has been anxiously awaiting this standardization, which will help it to improve profitability, interoperability and achieve further growth."
During the demonstration at CommunicAsia, the UHDTV feed will be uplinked via MEASAT's teleport in Cyberjaya, Kuala Lumpur, and delivered live via MEASAT-3 satellite in C-Band, using Newtec's new DVB-S2X modulation equipment (including Newtec's M6100 Broadcast Satellite Modulators and demodulators). Ericsson is providing video processing technology at both ends of the closed link.
With U.S. offices in Stamford, Conn., Newtec's products and technologies can be applied in a wide range of single and multiservice applications from DTH broadcasting, video contribution and distribution and disaster recovery and backbones for cellular backhauling, to small and medium enterprises, SCADA networks, manned and unmanned aircrafts.
An Inside Look at Four Virtual Reality Start-Ups
What Moves the Social TV Needle?
Mark Kudsi Directs 'Art of Patron Virtual Reality Experience'
BT Renews Intelsat Deal
Top Twitter TV Shows for 2014-15 Season Unveiled
comScore Introduces MobiLens Plus
North Korean Propoganda Art Inspires the Credits of 'The Interview'
Imaginary Forces Creates Kaleidoscopic Titles for 'Bosch'
Filmmaker Embraces Short Documentary Format with Oscar-Nominated 'Crisis Hotline'
North Metro Television Goes Wireless with Comrex LiveShot
Spectra Logic and HauteSpot Networks Introduce Body-Worn Camera Video Surveillance Solution
Huge Ultra HD Display Lights Up Times Square


text:
Entries in By Gina (72)
Just In: online store, books, and samples
by Gina
This week we're featuring a few different things on our "Just In" post that often do not get featured. First up, these three great new dish towelings have been added to the Bolt online store (see that big "Shop Bolt" button to the right?).
Our in-store collection of dish toweling is over flowing right now. I think this is the largest variety we've ever had. (If you're shopping from afar, feel free to scroll through past Just In posts to see others that are available and give us a call.) We get asked a lot about what to do with toweling, other than the obvious and here are some ideas we share (or that have been shared with us): curtains, bags, table runners and napkins, small skirts and aprons. Here are a few of the newest additions:
This fantastic new book is getting us all excited about sewing up cute, cute kids' clothes for summer. Adrianna just brought in the great sample of a boy's top and drawstring shorts. Not only is the style so sweet, but the designs are timeless, straightforward and include both girls' and boys' designs!
Another great new set of samples is from the color block pouch pattern from V and Co. Super cute, and prefect for the whip-up-in-a-flash gift. Use coated cotton on the inside, or wax your fabric (we've got Otter Wax!) and have it be a great little make up / toiletries bag. And, we've got these great, colorful metal zippers that add just the right little detail.
Remember that fantastic "Go Anywhere Dress" Heather made up? We just received in more colors of that yummy linen/ rayon Brussels blend that she used. Such lovely drape to it. You'll want to make up an entire wardrobe!
See you soon.
Just In: Japanese shipment has arrived! Valentine's news.
by Gina
This week we welcomed a great shipment of goodies from Japan. These include double gauze and brushed double gauze, cotton linen blends, cotton twill and cotton crepe. Oooo-weee. We've been a bit giddy with this arrival. Most of these great beauties are by Nani Iro, Echino and Ellen Luckett Baker. Enjoy!
And, who doesn't love a good metallic cat?
And from those witty folks at Alexander Henry:
Other news to share this week—Hidden Hearts from Supportland! In honor of Valentine's Day, you will receive a "hidden heart" on your Supportland account with each purchase between Thursday and Saturday. Then, on Sunday for 24 magic hours, those hearts become 20 merits each (merits used to be "points") so you can shop to your hearts' content with your extra points. They will disappear after Sunday.
We'll be offering a new merit incentive starting today, and running for a month. If you all like it, we'll keep it going. For 50 merits from you, you'll receive 20% off your purchase from us! And remember, with those hidden hearts you'll be earning, you'll have 50 merits in no time. Check out the Supportland site here.
See you soon!
Just in: Amy Butler, Ellen Luckett Baker, Erin McMorris and more!
by Gina
This past week we've received a smattering of pieces from lines by some of our favorite designers around here, including Amy Butler, Ellen Lucket Baker and Portland's own Erin McMorris.Take a look-see!
We are big fans of double gauze around the store and are quite delighted to have this shipment arrive, including Ellen Luckett Baker's newest group from Kokka, along with new dotty double gauze from Nani Iro. It's hard to capture in the photo, but those sweet dots are a shimmery metallic. Oh so pretty!
Another shipment came in with some of our favorite staples—hemp and organic cotton blends, and introducing this neat new hemp blend summer cloth in a design by Josi Severson of Ten14 Textiles (the white with blue bricks print). Also new are a couple of great bluesy, plush cotton flannels.
See you soon!


text:
Deleuze and Guatarri include a similar piece somewhere in their work, Capitalism and Schizophrenia
Deleuze and Guatarri include a similar piece somewhere in their work, Capitalism and Schizophrenia
What the fuck?
Based on one of the simpler Cro-Magnon skinning chants, John Stump has been able to compose a fresh light melody with some dramatic undertones. I feel however that that at some points he deviates too much from the character and tone from the original and is too free in is interpretations. Note that the penguins are release BEFORE the cattle is removed. Although this feeds to the overall feeling of lack of discipline you can hear the talent seeping through the notes, especially in part J. I'm very much looking forward to hearing the new Heidelbergensis series Stump is supposedly composing right now. I only hope he would stop inserting all these peanuts.
yea my 5 year old brother can play this
"Rotate embouchures"? What? My face doesn't work that way.
I have a T-shirt with this on it. Amazing stuff.
Epic win.
I recently saw this performed at my local community college. I particularly liked the gong duet, but I think that without the dirigibles it's really missing that lighter feel you expect from a faeries' aire.
what is this i dont even..
Hang on hang on hang on. What?
A cave man's melody has never been sweeter, especially since it includes bicycles. (waited my whole like for an opportunity to type something like that)
Yeah. That would kill me.
You can listen to the piece on youtube. It all makes sense then... ;)
wtf did i just look at?
Is this real?
Mildly curious about this clusterf*** of music. kinda want to hear it played. but not sure if I want to know what something so pretty on sheets would sound like.


text:
Between the City of Leeuwarden & WaddenSea
From $56 / night
Description from the owner
Description from the owner
Bedrooms: 2/
Bathrooms: 2/
Sleeps: 6/
Type: Bed and Breakfast
This bed and breakfast between Leeuwarden and the Wadden Sea is as intended: Staying in a private home while maintaining your privacy.
The house is artistic and authentic furnished, warm colors, well into light. A good combination of old and design. At B&B; BijDeGraaf you can stay, look around, involve, but also retire, be completely on your own.
You sleep in the double room on the ground floor, the so-called "Herenkamer".
Whether you choose the "Familyroom' on the top floor. This room is suitable for families with children.
Both rooms overlook a quiet, rural village life.
For the'' wellness'' sense: the bathrooms have heated floors, a spacious ...Read more
About the owner
About the owner
Bed&Breakfast BijDeGraaf
Bed&Breakfast BijDeGraaf
- Response rate: 100%
- Response time: A few hours
- Calendar updated: 5 days ago
Overall rating:
5.0 / 5.0
Between the City of Leeuwarden & WaddenSea Finkum, Friesland, Holland (Netherlands)
Additional Location Information
Finkum (Feinsum) is located 9 kilometers north of Leeuwarden, along the Finkumervaart. This canal is part of the Eleven Cities Route, well known for skating.
On the canal is a small port and you can also fish.
For children there is a large playground and you can find a bowling alley.
Northwest Friesland is an attractive area for the visitor who loves authenticity. The landscape is dotted with small villages, always with a small old church. After every two to three kilometers awaits a new surprise. It is the land of the beets, onions and carrots; your food is grown here.
The Oudebildtdijk by 14 kilometers the longest street in the Netherlands runs along the shallows. The light, beautiful skies and tranquility have attracted many artists and you'll also find several galleries.
There are also several Historical houses dating from the 15th century. Dekema State (Jelsum) Popta Slot (Marssum) and Martena State (Britsum).
Hofstad Leeuwarden has many nice restaurants, terraces, cafes and includes the Fries Museum of Modern Art, the Natural Museum (very suitable for children) and the Museum of Ceramics Princessehof.
More About This Location
Rural retreats


text:
Baseball - Page 6
Managers La Russa, Torre, Cox Elected to Baseball Hall of Fame
Joe Torre, Tony La Russa and Bobby Cox Elected to Baseball Hall of Fame
Boy With Muscular Dystrophy Signs With College Baseball Team in Heartwarming Ceremony [VIDEO]
Did Miguel Cabrera Deserve AL MVP Award? — Sports Survey of the Day
For the second straight year, the American League Most Valuable Player award has become grounds for debate between baseball traditionalists who believe Miguel Cabrera deserved to win the award and fans of advanced metrics who feel as though Mike Trout got robbed. Did Cabrera deserve a second straight MVP?
Where Will You Go to Watch the World Series? [POLL]
It's World Series time! Our St. Louis Cardinals take on the Boston Red Sox for what should be a great series to see who is the best team in baseball. Even for casual fans, the World Series is a big event. It's important you're in an optimal viewing area.
2013 MLB League Championship Series Preview
Which Team From the League Championships Will Win the 2013 World Series?
This Weekend in Sports: MLB League Championship Series, SEC Football
MINK Baseball League Expands to Branson
It may be Major League Baseball Playoff time, but there was big news from the MINK League this weekend. The MINK League held their annual meeting last weekend in St. Joseph and announced that the Branson Nationals will be a new team coming to the league. This is the first time a new team has come into the league since the Sedalia Bombers and St. Joseph Mustangs came on board in 2009.


text:
Spotlight: JOhn McCain's campaign Four aides resign amid turbulence
He may be finished as money, polls fall
WASHINGTON -- Sen. John McCain's campaign for the Republican presidential nomination hit what may be its breaking point on Tuesday, as he accepted the resignations of four top aides while vowing to continue his struggling quest.
The aides were chief strategist John Weaver, campaign manager Terry Nelson, deputy manager Reed Galen and political director Rob Jesmer.
Serious problems
No reason given: The Arizona Republican wouldn't say why they all quit his campaign, but it's clear from the barrage of sagging poll numbers, weak fund-raising and staff layoffs that something has gone seriously wrong with a campaign that just a few months ago was regarded as the favorite to win the GOP nomination.
Weaver: The departure of Weaver was especially striking. The Texas strategist was central to McCain's 2000 presidential campaign and molded McCain's image then as an independent-minded straight-talker.
"They remain good and close and loyal friends, and they'll continue to help out in the campaign," a tense and terse McCain told reporters in the Capitol, repeating the line in response to virtually every question.
Davis takes over: Rick Davis, a Republican strategist who had been advising the campaign, will become the new campaign manager, the role he played in 2000.
Where's the money?
Trails Romney, Giuliani: The resignations come scarcely one week after McCain laid off dozens of campaign staffers across the country after a disappointing second quarter of fund-raising. He raised only $11.2 million from April through June, trailing former Massachusetts governor Mitt Romney and former New York mayor Rudy Giuliani.
$2 million left: So far this year, McCain has raised less than $25 million; Nelson had thought the campaign could raise $100 million for the year. Worse, McCain ended the quarter with only $2 million in cash on hand, a sign that the top-heavy campaign was spending money far too quickly.
Polls bad too: Recent polls in key states showed McCain losing ground. Among the reasons: his support for President Bush's approach on Iraq, which alienated moderates, and immigration reform, which alienated many conservatives.
"If they're not going to come out and announce a new team and a new plan, all they're doing is rearranging deck chairs on the Titanic," said Tony Fabrizio, a Republican pollster unaligned with any campaign this year.
"This is about as close to terminal as you can get without actually dying," said Alex Vogel, a GOP strategist and onetime aide to former senator Bill Frist, R-Tenn. "In medical terms they would say his campaign is in grave condition. The last rites are being uttered."
Subscribe to The Commercial Appeal
Need Help? Call us at 1-888-789-0831.
Monday-Friday: 6am-5pm / Saturday: 6:30am-11:30am / Sunday: 6am-1pm


text:
15/16 Season Cast Lists:
Nabucco |
An American Dream |
The Pearl Fishers |
The Marriage of Figaro |
Mary Stuart |
The Flying Dutchman
Don Giovanni
Ariadne auf Naxos
Sign up for the Seattle Opera Email List and receive artist news and information. Personalize your profile to receive the communications you want.
Join Email List
Turkish bass Burak Bilgili made his Seattle Opera debut as Banquo in Verdi's Macbeth and returns as Don Basilio in Rossini's Barber of Seville in January 2010. He recently made his San Francisco Opera debut as Ferrando in Verdi's Trovatore, a role he has also sung at the Metropolitan Opera and in Geneva. He has sung Duke Alfonso in Donizetti's Lucrezia Borgia at Teatro alla Scala, Leporello in Mozart's Don Giovanni in Geneva, Giorgio in Bellini's Puritani at the Savonlinna Festival, Nourabad in Bizet's Pêcheurs de perles at Florida Grand Opera, the villains in Offenbach's Contes d'Hoffmann at the Virginia Opera, and Zaccaria in Verdi's Nabucco and Dulcamara in Donizetti's Elisir d'amore at Michigan Opera Theatre. Other roles have included Colline in Puccini's Bohème, Walter in Verdi's Luisa Miller, and Escamillo in Bizet's Carmen. He has been seen at Canadian Opera Company, Gran Teatre del Liceu, Teatro dell'Opera di Roma, and Palm Beach Opera, among others. Upcoming, he sings Fiesco in Verdi's Simon Boccanegra in Montreal.
Bring a group to the opera and enjoy big discounts and a free ticket too!
Check out Seattle Opera's new and improved blog! Updated weekly.
Check out and become a fan of Seattle Opera now on Facebook!
© Tristram Kenton
Performances at: McCaw Hall, 321 Mercer Street, Seattle, WA 98109
Administrative Offices & Mailing Address: 1020 John Street, Seattle, WA 98109
Copyright ©2015 Seattle Opera. All rights reserved.


text:
Back Pain Health Center
Medical Reference Related to Back Pain
Opiate Pain Relievers for a Herniated Disc
Drug details for Opioids for a herniated disc.
Opiate Pain Relievers for Spinal Stenosis
Drug details for Opioids for spinal stenosis.
Physical Therapy for Back Pain - Topic Overview
Physical therapists provide a type of treatment you may need when back pain makes it hard to move around and do everyday tasks. This treatment helps you move better and may relieve pain. It also helps improve or restore your physical function and your fitness level. The goal of physical therapy is to make daily tasks and activities easier. For example, it may help with walking, going up stairs, or getting in and out of bed.Physical therapy may be used alone or with other treatments. You may get treatment at:A clinic.A hospital.A sports or fitness setting.Your physical therapist will examine you and make a treatment plan. You may need help with flexibility, strength, endurance, coordination, and/or balance. First, your therapist will try to reduce your pain and swelling. Then he or she will probably work to increase your flexibility, strength, and endurance. Physical therapy almost always includes exercise. It can include stretching, core exercises, weight lifting, and walking. You may
Whiplash - Topic Overview
What is whiplash? Whiplash is pain and stiffness in the neck after an injury that has caused the neck to move suddenly or beyond its normal range. It occurs when the head is suddenly forced backward or forward and is then snapped in the other direction. This kind of motion most often happens to people in a car that is hit from behind. Less commonly,it might happen in a fall,a sports injury,...
Nighttime Back Pain
WebMD examines the causes of back pain at night and associated symptoms that should prompt you to call your doctor.
Cervical Spondylosis - Topic Overview
Cervical spondylosis is a term used to describe the changes to the bones ( vertebrae ),joints and discs of the neck ( cervical spine ) as a result of aging (disc degeneration). The vertebrae and discs wear down,possibly resulting in pain. Cervical spondylosis is commonly seen in people 55 years of age and older. 1 See pictures of the neck and the vertebrae and discs. As you age,the discs ...
Cervical Spinal Fusion
Cervical spinal fusion (arthrodesis) is surgery that joins selected bones in the neck (cervical spine).
Muscle Relaxants for Neck Pain
Drug details for Muscle relaxants for neck pain.
Tricyclic Antidepressants for Neck Pain
Drug details for Tricyclic antidepressants for neck pain.
10 Important Questions to Ask Your Doctor About Back Pain
Ten questions to ask your doctor about back pain.